Tight(er) worst-case bounds on dynamic searching and priority queues

We introduce a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structures. Based on this we present optimal bounds for ...

[1]  Mikkel Thorup,et al.  Faster deterministic sorting and priority queues in linear space , 1998, SODA '98.

[2]  Michael L. Fredman,et al.  Surpassing the Information Theoretic Bound with Fusion Trees , 1993, J. Comput. Syst. Sci..

[3]  Peter Bro Miltersen,et al.  Static dictionaries on AC/sup 0/ RAMs: query time /spl theta/(/spl radic/log n/log log n) is necessary and sufficient , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[4]  A. Andersson.  Static Dictionaries on RAMs: Query Time is Necessary and Sufficient , 1996, FOCS 1996.

[5]  Faith Ellen,et al.  Optimal bounds for the predecessor problem , 1999, STOC '99.

[6]  Peter Bro Miltersen,et al.  Trans-Dichotomous Algorithms without Multiplication —some Upper and Lower Bounds , 1997 .

[7]  Peter Bro Miltersen,et al.  Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds , 1997, WADS.

[8]  Dan E. Willard,et al.  Applications of the fusion tree method to computational geometry and searching , 1992, SODA '92.

[9]  Mikkel Thorup.  Randomized sorting in O(n log log n) time and linear space using addition, shift, and bit-wise boolean operations , 1997, SODA '97.

[10]  Peter van Emde Boas,et al.  Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space , 1977, Inf. Process. Lett..

[11]  Arne Andersson,et al.  Sublogarithmic searching without multiplications , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[12]  Rajeev Raman,et al.  A Constant Update Time Finger Search Tree , 1990, Inf. Process. Lett..

[13]  Gerth Stølting Brodal,et al.  Finger search trees with constant insertion time , 1998, SODA '98.

[14]  Kurt Mehlhorn,et al.  Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space , 1990, Information Processing Letters.

[15]  Arne Andersson.  Faster deterministic sorting and searching in linear space , 1996, Proceedings of 37th Conference on Foundations of Computer Science.