An efficient quasidictionary

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

Volumn 2368, Issue , 2002, Pages 1-18

  Hagerup, Torben ^a   Raman, Rajeev ^b  

^a GOETHE UNIVERSITY   (Germany)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CHECK-IN; CONSTANT AMORTIZED TIME; CONSTANT TIME; DATA ITEMS; FOLLOWING OPERATION; LINEAR SPACES; NUMBER OF DATUM; POSITIVE INTEGERS;

DATA STRUCTURES;

EID: 33845186102     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45471-3_1     Document Type: Conference Paper

References (24)

1. A. Andersson, T. Hagerup, S. Nilsson, and R. Raman, Sorting in linear time?, J. Comput. System Sci. 57 (1998), pp. 74-93.
2. A. Andersson, P. B. Miltersen, S. Riis, and M. Thorup, Static dictionaries on AC0 RAMs: Query time Θ(√log n/log log n) is necessary and sufficient, Proc., 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1996), pp. 441-450.
3. A. Andersson and M. Thorup, Tight(er) worst-case bounds on dynamic searching and priority queues, Proc., 32nd Annual ACM Symp osium on Theory of Computing (STOC 2000), pp. 335-342.
4. P. Beame and F. E. Fich, Optimal bounds for the predecessor problem, Proc., 31st Annual ACMSymp osium on Theory of Computing (STOC 1999), pp. 295-304.
5. M.R. Brown and R. E. Tarjan, A representation for linear lists with movable fingers, Proc., 10th Annual ACMSymp osium on Theory of Computing (STOC 1978), pp. 19-29.
6. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms (1st edition), The MIT Press, Cambridge, MA, 1990.
7. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms (2nd edition), The MIT Press, Cambridge, MA, 2001.
8. E. D. Demaine, A threads-only MPI implementation for the development of parallel programs, Proc., 11th International Symposium on High Performance Computing Systems (HPCS 1997), pp. 153-163.
9. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan, Dynamic perfect hashing: Upper and lower bounds, SIAM J. Comput. 23 (1994), pp. 738-761.
10. M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization problems, J. ACM 34 (1987), pp. 596-615.
11. M. L. Fredman and D. E. Willard, Surpassing the information theoretic bound with fusion trees, J. Comput. System Sci. 47 (1993), pp. 424-436.
12. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, New York, 1979.
13. J. Gergov, Algorithms for compile-time memory optimization, Proc., 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1999), pp. 907-908.
14. L. J. Guibas and R. Sedgewick, A dichromatic framework for balanced trees, Proc., 19th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1978), pp. 8-21.
15. T. Hagerup, Sorting and searching on the word RAM, Proc., 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS 1998), Lecture Notes in Computer Science, Springer-Verlag, Berlin, Vol. 1373, pp. 366-398.
16. T. Hagerup, P. B. Miltersen, and R. Pagh, Deterministic dictionaries, J. Algorithms 41 (2001), pp. 69-85.
17. S. Huddleston and K. Mehlhorn, A new data structure for representing sorted lists, Acta Inf. 17 (1982), pp. 157-184.
18. M. G. Luby, J. Naor, and A. Orda, Tight bounds for dynamic storage allocation, Proc., 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1994), pp. 724-732.
19. K. Mehlhorn and S. Näher, LEDA: A Platform for Combinatorial and Geometric Computing, Cambridge University Press, 1999.
20. R. Raman, Priority queues: Small, monotone and trans-dichotomous, Proc., 4th Annual European Symposium on Algorithms (ESA 1996), Lecture Notes in Computer Science, Springer-Verlag, Berlin, Vol. 1136, pp. 121-137.
21. J. M. Robson, An estimate of the store size necessary for dynamic storage allocation, J. ACM 18 (1971), pp. 416-423.
22. J. M. Robson, Bounds for some functions concerning dynamic storage allocation, J. ACM 21 (1974), pp. 491-499.
23. M. Thorup, On RAM priority queues, SIAM J. Comput. 30 (2000), pp. 86-109.
24. P. R. Wilson, M. S. Johnstone, M. Neely, and D. Boles, Dynamic storage allocation: A survey and critical review, Proc., International Workshop on Memory Management (IWMM 1995), Lecture Notes in Computer Science, Springer-Verlag, Berlin, Vol. 986, pp. 1-116.