Predecessor queries in dynamic integer sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1200, Issue , 1997, Pages 21-32

  Brodal, Gerth Stølting ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ARBITRARY CONSTANTS; BIT-SHIFTS; BOOLEAN OPERATIONS; CONSTANT TIME; INSERTIONS AND DELETIONS; MINIMUM QUERIES; PREDECESSOR QUERIES; SMOOTH FUNCTIONS;

DATA STRUCTURES;

EID: 33645261519     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0023445     Document Type: Conference Paper

References (16)

1. Susanne Albers and Torben Hagerup. Improved parallel integer sorting without concurrent writing. In Proc. 3rd ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 463-472, 1992.
2. Arne Andersson. Sublogarithmic seaxching without multiplications. In Proc. 36th Ann. Symp. on Foundations of Computer Science (FOCS), pages 655-663, 1995.
3. Arne Andersson. Faster deterministic sorting and searching in linear space. In Proc. 37th Ann. Symp. on Foundations of Computer Science (FOCS), pages 135-141, 1996.
4. Lars Arge. The buffer tree: A new technique for optimal I/O-algorithms. In Proc. 4th Workshop on Algorithms and Data Structures (WADS), volume 955 of Lecture Notes in Computer Science, pages 334-345. Springer Verlag, Berlin, 1995.
5. Kenneth E. Batcher. Sorting networks and their applications. In Proc. AFIPS Spring Joint Computer Conference, 32, pages 307-314, 1968.
6. Gerth Stølting Brodal, Shiva Chaudhuri, and Jaikumar Radhakrishnan. The randomized complexity of maintaining the minimum. In Proc. 5th Scandinavian Workshop on Algorithm Theory (SWAT), volume 1097 of Lecture Notes in Computer Science, pages 4-15. Springer Verlag, Berlin, 1996.
7. Michael L. Fredman and Dan E. Willard. Surpassing the information theoretic bound with fusion trees. Journal of Computer and System Sciences, 47:424-436, 1993.
8. Scott Huddleston and Kurt Mehlhorn. A new data structure for representing sorted lists. Acta Informatica, 17:157-184, 1982.
9. Peter Bro Miltersen. Lower bounds for Union-Split-Find related problems on random access machines. In Proc. 26th Ann. ACM Symp. on Theory of Computing (STOC), pages 625-634, 1994.
10. Peter Bro Miltersen. Lower bounds for static dictionaries on RAMs with bit operations but no multiplications. In Proc. 23rd Int. Colloquium on Automata, Languages and Programming (ICALP), volume 1099 of Lecture Notes in Computer Science, pages 442-453. Springer Verlag, Berlin, 1996.
11. Peter Bro Miltersen, Noam Nisan, Shmuel Safra, and Avi Wigderson. On data structures and asymmetric communication complexity. In Proc. 27th Ann. ACM Symp. on Theory of Computing (STOC), pages 103-111, 1995.
12. Mark H. Overmars. The Design of Dynamic Data Structures, volume 156 of Lecture Notes in Computer Science. Springer Verlag, Berlin, 1983.
13. Rajeev Raman. Priority queues: Small, monotone and trans-dichotomous. In ESA '96, Algorithms, volume 1136 of Lecture Notes in Computer Science, pages 121-137. Springer Verlag, Berlin, 1996.
14. Mikkel Thorup. On RAM priority queues. In Proc. 7th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 59-67, 1996.
15. Peter van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters, 6:80-82, 1977.
16. Peter van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Mathematical Systems Theory, 10:99-127, 1977.