Tight(er) worst-case bounds on dynamic searching and priority queues
- 1 May 2000
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 335-342
- https://doi.org/10.1145/335305.335344
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Optimal bounds for the predecessor problemPublished by Association for Computing Machinery (ACM) ,1999
- A constant update time finger search treeInformation Processing Letters, 1994
- Surpassing the information theoretic bound with fusion treesJournal of Computer and System Sciences, 1993
- Bounded ordered dictionaries in O(log log N) time and O(n) spaceInformation Processing Letters, 1990
- A balanced search tree with O(1) worst-case update timeActa Informatica, 1988
- Preserving order in a forest in less than logarithmic time and linear spaceInformation Processing Letters, 1977