Improved bounds for multipass pairing heaps and path-balanced binary search trees.

Dani Dorfman Haim Kaplan László Kozma Seth Pettie Uri Zwick

Published in: CoRR (2018)

Keyphrases

binary search trees
data structure
lower bound
parallel algorithm
search tree
upper bound
upper and lower bounds
reinforcement learning
management system
shortest path
database
worst case
orders of magnitude
metaheuristic
improved algorithm
lower and upper bounds