Sorting and searching on the word RAM

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

Volumn 1373 LNCS, Issue , 1998, Pages 366-398

  Hagerup, Torben ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

AC0; conservative algorithms; dictionaries; exponential range reduction; exponential search trees; fusion trees; multiplication; network flow; searching; Sorting; tries; word RAM; word level parallelism

Indexed keywords

AC0; CONSERVATIVE ALGORITHMS; DICTIONARIES; FUSION TREES; MULTIPLICATION; NETWORK FLOWS; RANGE REDUCTION; SEARCH TREES; SEARCHING; TRIES; WORD RAM; WORD-LEVEL PARALLELISM;

ALGORITHMS; COMPUTER SCIENCE;

RANDOM ACCESS STORAGE;

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

References (24)

1. M. Ajtai, M. Fredman, and J. Komlós, Hash functions for priority queues, Inform. and Control 63 (1984), pp. 217-225.
2. S. Albers and T. Hagerup, Improved parallel integer sorting without concurrent writing, Inform. and Comput. 136 (1997), pp. 25-51.
3. A. Andersson, Sublogarithmic searching without multiplications, in Proc. 36th Annum IEEE Symposium on Foundations of Computer Science (FOCS 1995), pp. 655-663.
4. A. Andersson, Faster deterministic sorting and searching in linear space, in Proc. 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1996), pp. 135-141.
5. A. Andersson, T. Hagerup, S. Nilsson, and R. Raman, Sorting in linear time?, J. Comput. System Sci., to appear. A preliminary version appeared in Proc. 27th Annual ACM Symposium on the Theory of Computing (STOC 1995), pp. 427-436.
6. 0 RAMs: Query time Θ(√log n/log log n) is necessary and sufficient, in Proc. 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1996), pp. 441-450.
7. 0 instructions only, Theoret. Comput. Sci., to appear.
8. A. Andersson and M. Thorup, Implementing monotone priority queues, Proc. 1996 DIMACS Challenge, to appear.
9. K. E. Batcher, Sorting networks and their applications, in Proc. 32nd AFIPS Spring Joint Computer Conference (1968), pp. 307-314.
10. R. Bayer and E. McCreight, Organization and maintenance of large ordered indexes, Acta Inform. 1 (1972), pp. 173-189.
11. P. Beame and F. Fich, On searching sorted lists: A near-optimal lower bound, manuscript, 1997.
12. A. M. Ben-Amram and Z. Galil, When can we sort in o(n log n) time?, in Proc. 34th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1993), pp. 538-546.
13. O. Berkman, B. Schieber, and U. Vishkin, Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values, J. Algorithms 14 (1993), pp. 344-370.
14. A. Brodnik, P. B. Miltersen, and J. I. Munro, Trans-dichotomous algorithms without multiplication - some upper and lower bounds, in Proc. 5th International Workshop on Algorithms and Data Structures (WADS 1997), Lecture Notes in Computer Science, Vol. 1272, Springer, Berlin, pp. 426-439.
15. J. L. Carter and M. N. Wegman, Universal classes of hash functions, J. Comput. System Sci. 18 (1979), pp. 143-154.
16. 3)-time maximum-flow algorithm, SIAM J. Comput. 25 (1996), pp. 1144-1170.
17. S. A. Cook and R. A. Reckhow, Time bounded random access machines, J. Comput. System Sci. 7 (1973), pp. 354-375.
18. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, The MIT Press, Cambridge, MA, 1990.
19. A. Dessmark and A. Lingas, On the power of nonconservative PRAM, in Proc. 21st International Symposium on Mathematical Foundations of Computer Science (MFCS 1996), Lecture Notes in Computer Science, Vol. 1113, Springer, Berlin, pp. 303-311.
20. M. Dietzfelbinger, T. Hagerup, J. Katajainen, and M. Penttonen, A reliable randomized algorithm for the closest-pair problem, J. Algorithms 25 (1997), pp. 19-51.
21. F. Fich and P. B. Miltersen, Tables should be sorted (on random access machines), in Proc. 4th International Workshop on Algorithms and Data Structures (WADS 1995), Lecture Notes in Computer Science, Vol. 955, Springer, Berlin, pp. 482-493.
22. M. L. Fredman, J. Komlós, and E. Szemerédi, Storing a sparse table with O(1) worst case access time, J. Assoc. Comput. Mach. 31 (1984), pp. 538-544.
23. M. L. Fredman and M. E. Saks, The cell probe complexity of dynamic data structures, Proc. 21st Annual ACM Symposium on Theory of Computing (STOC 1989), pp. 345-354.
24. M. L. Fredman and D. E. Willard, Surpassing the information theoretic bound with fusion trees, J. Comput. System Sci. 47 (1993), pp. 424-436.