Making deterministic signatures quickly

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 900-909

  Ružić, Milan ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE MEMORY;

ALGORITHMS AND DATA STRUCTURES; BINARY STRING; CACHE-OBLIVIOUS MODEL; COMPUTATIONAL MODEL; CONSTRUCTION TIME; PREDECESSOR PROBLEMS; QUERY PERFORMANCE; VARIABLE LENGTH;

QUERY PROCESSING;

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

References (27)

1. S. Albers and T. Hagerup. Improved parallel integer sorting without concurrent writing. In 3rd SODA, pages 463-472, 1992.
2. A. Andersson. Sublogarithmic searching without multiplications. In 36th FOCS, pages 655-663, 1995.
3. A. Andersson. Faster deterministic sorting and searching in linear space. In 37th FOCS, pages 135-141, 1996.
4. A. Andersson, T. Hagerup, S. Nilsson, and R. Raman. Sorting in linear time? In 27th STOC, p. 427-436.
5. 0 RAMs: Query time Θ(√log n/log log n) is necessary and sufficient. In 37th FOCS, pages 441-450, 1996.
6. L. Arge, P. Ferragina, R. Grossi, and J. S. Vitter. On sorting strings in external memory. In 29th STOC, pages 540-548, 1997.
7. P. Beame and F. E. Fich. Optimal bounds for the predecessor problem and related problems. J. Comput. Syst. Sci., 65(1):38-72, 2002.
8. M. A. Bender, M. Farach-Colton, and B. C. Kuszmaul. Cache-oblivious string B-trees. In PODS, 2006.
9. G. S. Brodal and R. Fagerberg. Cache-oblivious string dictionaries. In 17th SODA, pages 581-590, 2006.
10. A. Brodnik, P. B. Miltersen, and J. I. Munro. Transdichotomous algorithms without multiplication - some upper and lower bounds. In 5th WADS, pages 426-439.
11. P. Diaconis and R. Graham. Spearman's footrule as a measure of disarray. J. Royal Statistical Society, 39:262-268, 1977.
12. P. Dietz. Optimal algorithms for list indexing and subset rank. In 1989 WADS, pages 39-46, 1989.
13. M. Dietzfelbinger, A. R. Karlin, K. Mehlhorn, F. M. auf der Heide, H. Rohnert, and R. E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. SIAM J. Computing, 23(4):738-761, 1994.
14. R. Fagerberg, A. Pagh, and R. Pagh. External string sorting: Faster and cache-oblivious. In 23rd STACS, pages 68-79, 2006.
15. P. Ferragina and R. Grossi. The string B-tree: A new data structure for string search in external memory and its applications. J. ACM, 46(2):236-280, 1999.
16. M. Fredman and M. Saks. The cell probe complexity of dynamic data structures. In 21st STOC, p. 345-354.
17. 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.
18. M. L. Fredman and D. E. Willard. Surpassing the information theoretic bound with fusion trees. J. Comput. Syst. Sci., 47(3):424-436, 1993.
19. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In 40th FOCS, pages 285-298, 1999.
20. 0 RAM. In 25th ICALP, pages 79-90, 1998.
21. T. Hagerup. Sorting and searching on the word RAM. In 15th STACS, pages 366-398, 1998.
22. T. Hagerup, P. B. Miltersen, and R. Pagh. Deterministic dictionaries. J. Algorithms, 41(1):69-85, 2001.
23. Y. Han. Deterministic sorting in O(n log log n) time and linear space. J. Algorithms, 50(1):96-105, 2004.
24. J. Kärkkäinen and P. Sanders. Simple linear work suffix array construction. In 30th ICALP, pages 943-955, 2003.
25. M. PǍtraşcu and M. Thorup. Time-space trade-offs for predecessor search. In 38th STOC, 2006.
26. M. Ružić. Uniform deterministic dictionaries. Manuscript, 2005. Very preliminary version appeared as: Uniform Algorithms for Deterministic Construction of Efficient Dictionaries. In 12th ESA, pages 592-603. Springer-Verlag, 2004.
27. P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and Implementation of an Efficient Priority Queue. Mathematical Systems Theory, 10:99-127, 1977.