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: ESA (2018)

Keyphrases

binary search trees
data structure
parallel algorithm
upper bound
search tree
shortest path
lower bound
kd trees
special case
cost function
worst case
constraint satisfaction
improved algorithm
lower and upper bounds