On AC0 implementations of fusion trees and atomic heaps

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 699-707

  Thorup, Mikkel ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; MULTIMEDIA SYSTEMS; PROGRAM COMPILERS; RANDOM ACCESS STORAGE; THEOREM PROVING;

ATOMIC HEAPS; FUSION TREES;

GRAPH THEORY;

EID: 0038077465     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (36)

1. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Princiles, Techniques, and Tools. Addison-Wesley, Reading, Massachusetts, 1986.
2. M. Ajtai, M. L. Fredman, and J. Komlós. Hash functions for priority queues. Inform. and Comput., 63:217-225, 1984. Announced at FOCS'83.
3. S. Albers and T. Hagerup. Improved parallel integer sorting without concurrent writing. Inf. Contr., 136:25-51, 1997.
4. S. Alstrup, D. Harel, P.W. Lauridsen, and M. Thorup. Dominators in linear time. SIAM J. Comp., 28(6):2117-2132, 1999.
5. S. Alstrup, T. Husfeldt, and T. Rauhe. Marked ancestor problems. In Proc. 39th FOCS, pages 534-544, 1998.
6. A. Andersson. Faster deterministic sorting and searching in linear space. In Proc. 37th FOCS, pages 135-141, 1996.
7. A. Andersson, T. Hagerup, S. Nilsson, and R. Raman. Sorting in linear time? J. Comp. Syst. Sc., 57:74-93, 1998. See also STOC'95.
8. 0 RAMs: Query time Θ(√log n/log log n) is necessary and sufficient. In Proc. 37th FOCS, pages 441-450, 1996.
9. 0 instructions only. Theor. Comp. Sc., 215(1-2):337-344, 1999.
10. A. Andersson and M. Thorup. A pragmatic implementation of monotone priority queues. DIMACS Implementation challenge, 1996.
11. A. Andersson and M. Thorup. Tight(er) worst-case bounds on dynamic searching and priority queues. In Proc. 32th STOC, 2000.
12. P. Beame and F. Fich. Optimal bounds for the predecessor problem. In Proc. 31st STOC, pages 295-304, 1999.
13. P. Beame and J. Håstad. Optimal bounds for decision problems on the CRCW PRAM. J. ACM, 36(3):643-670, 1989.
14. A. M. Ben-Amram. When can we sort in o(n log n) time. J. Comput. System Sci., 54:345-370, 1997. See also FOCS'93.
15. A. Brodnik, S. Carlsson, J. Karlsson, and I. Munro. Worst case constant time priority queues. In Proc. 12th SODA, pages 523-528, 2001.
16. A. Brodnik, P. B. Miltersen, and I. Munro. Transdichotomous algorithms without multiplication - some upper and lower bounds. In Proc. 5th WADS, LNCS 1272, pages 426-439, 1997.
17. B. Chazelle. A minimum spanning tree algorithm with inverse-ackermann type complexity. J. ACM, 47(6):1028-1047, 2000.
18. P.F. Dietz. Optimal algorithms for list indexing and subset rank. In Proc. WADS '89, LNCS 382, pages 39-46, 1989.
19. M. L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table with O(1) worst case access time. J. ACM, 31(3):538-544, 1984.
20. M. L. Fredman and M.E. Saks. The cell probe complexity of dynamic data structure. In Proc. 21st STOC, pages 345-354, 1989.
21. M. L. Fredman and D. E. Willard. Surpassing the information theoretic bound with fusion trees. J. Comput. Syst. Sci., 47:424-436, 1993. See also STOC'90.
22. M. L. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. Syst. Sci., 48:533-551, 1994. See also FOCS'90.
23. H. N. Gabow and R. E. Tarjan. A linear-time algorithm for a special case of disjoint set union. J. Comput. System Sci., 30:209-221, 1985. Announced at STOC'83.
24. IEEE. IEEE standard for binary floating-point arithmetic. SIGPLAN Notices, 22:9-25, 1985.
25. Intel. The IA-32 Intel Architecture Software Developer's Manual, Volume 2: Instruction Set Reference (Order Number 245471), 2001. http://developer.intel.com/design/pentium4/manuals/245471.htm.
26. B.W. Kernighan and D.M. Ritchie. The C Programming Language (2nd ed.). Prentice Hall, 1988.
27. E.M. McCreight. Priority search trees. SIAM J. Comp., 14(2):257-276, 1985.
28. K. Mehlhorn and S. Nähler. Bounded ordered dictionaries in O(log log n) time and O(n) space. Inf. Proc. Lett., 35(4):183-189, 1990.
29. P. B. Miltersen. Lower bounds for static dictionaries on RAMs with bit operations. In Proc. 23rd ICALP, LNCS 1099, pages 442-453, 1996.
30. Motorola. AlitVec Technology Programming Environments Manual, 2002. http://e-www.motorola.com/brdata/PDFDB/docs/ALTIVECPEM.pdf.
31. B. Stroustrup. The C++ Programming Language, Special Edition. Addison-Wesley, Reading, MA, 2000.
32. M. Thorup. Fast deterministic sorting and priority queues in linear space. In Proc. 9th SODA, pages 550-555, 1998.
33. M. Thorup. Undirected single source shortest paths with positive integer weights in linear time. J. ACM, 46(3):362-394, 1999. See also FOCS'97.
34. M. Thorup. Randomized sorting in O(n log log n) time and linear space using addition, shift, and bit-wise boolean operations. J. Algor., 42(2):205-230, 2002. Announced at SODA'97.
35. P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Math. Syst. Theory, 10:99-127, 1977.
36. D. E. Willard. Examining computational geometry, van Emde Boas trees, and hashing from the perspective of the fusion tree. SIAM J. Comput., 29(3):1030-1049, 2000. See also SODA'92.