Bounds and Algorithms for Alphabetic Codes and Binary Search Trees.

Roberto Bruno Roberto De Prisco Alfredo De Santis Ugo Vaccaro

Published in: CoRR (2024)

Keyphrases

binary search trees
worst case
data structure
computational complexity
upper bound
theoretical analysis
orders of magnitude
error bounds
databases
learning algorithm
parallel algorithm
upper and lower bounds
average case
theoretical guarantees