Priority Queues: Small, Monotone and Trans-dichotomous

We consider two data-structuring problems which involve performing priority queue (pq) operations on a set of integers in the range 0..2w−1 on a unit-cost RAM with word size ω bits.

[1]  Prof. Dr. Kurt Mehlhorn,et al.  Data Structures and Algorithms 1 , 1984, EATCS.

[2]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 1: Sorting and Searching , 2011, EATCS Monographs on Theoretical Computer Science.

[3]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[4]  장훈,et al.  [서평]「Computer Organization and Design, The Hardware/Software Interface」 , 1997 .

[5]  Martin Dietzfelbinger,et al.  Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes , 1996, STACS.

[6]  Dan E. Willard.  Log-Logarithmic Worst-Case Range Queries are Possible in Space Theta(N) , 1983, Inf. Process. Lett..

[7]  János Komlós,et al.  Hash functions for priority queues , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[8]  János Komlós,et al.  Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

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

[10]  Sajal K. Das,et al.  Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.

[11]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[12]  Martti Penttonen,et al.  A Reliable Randomized Algorithm for the Closest-Pair Problem , 1997, J. Algorithms.

[13]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[14]  Rajeev Raman,et al.  Fast Algorithms for Shortest Paths and Sorting , 1996 .

[15]  Rajeev Raman,et al.  Sorting in linear time? , 1995, STOC '95.

[16]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[17]  Donald J. Patterson,et al.  Computer organization and design: the hardware-software interface (appendix a , 1993 .

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

[19]  Kurt Mehlhorn,et al.  Faster algorithms for the shortest path problem , 1990, JACM.

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

[21]  R. Raman.  Improved Data Structures for Predecessor Queries in Integer Sets , 1996 .

[22]  Andrew Chi-Chih Yao,et al.  Should Tables Be Sorted? , 1981, JACM.

[23]  Michael L. Fredman,et al.  Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths , 1994, J. Comput. Syst. Sci..

[24]  Dan E. Willard,et al.  Log-logarithmic worst-case range queries are possible in space ⊕(N) , 1983 .

[25]  Mikkel Thorup,et al.  On RAM priority queues , 1996, SODA '96.