Constructing efficient dictionaries in close to sorting time

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

Volumn 5125 LNCS, Issue PART 1, 2008, Pages 84-95

  Ružić, Milan ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; COMPUTER SCIENCE; CONTROL THEORY; LINGUISTICS; TECHNOLOGY;

CHALLENGING TASK; EXTERNAL MEMORY MODELS; HIGHLY EFFICIENT; LINEAR SPACES; LOWER BOUNDS; PERFORMANCE BOUNDS; RAM MODEL; REALISTIC MODELING; UPPER BOUNDS;

TRANSLATION (LANGUAGES);

EID: 49049114743     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70575-8_8     Document Type: Conference Paper

References (19)

1. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Commun. ACM 31(9), 1116-1127 (1988)
2. Albers, S., Hagerup, T.: Improved parallel integer sorting without concurrent writing. In: Proceedings of the 3rd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 463-472 (1992)
3. Alon, N., Naor, M.: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica 16(4-5), 434-449 (1996)
4. Andersson, A.: Sublogarithmic searching without multiplications. In: Proc. 36th Symposium on Foundations of Computer Science (FOCS), pp. 655-663 (1995)
5. Brodal, G.S., Fagerberg, R.: On the limits of cache-obliviousness. In: Proc. 35th Annual ACM Symposium on Theory of Computing, pp. 307-315 (2003)
6. Carter, J.L., Wegman, M.N.: Universal classes of hash functions. J. of Comput. Syst. Sci. 18(2), 143-154 (1979)
7. Dietzfelbinger, M., Karlin, A.R., Mehlhorn, K., auf der Heide, F.M., Rohnert, H., Tarjan, R.E.: Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput. 23(4), 738-761 (1994)
8. Fredman, M.L., Komlós, J., Szemerédi, E.: Storing a sparse table with O(1) worst case access time. J. ACM 31(3), 538-544 (1984)
9. Fredman, M.L., Willard, D.E.: Surpassing the information theoretic bound with fusion trees. J. Comput. Syst. Sci. 47(3), 424-436 (1993)
10. Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. In: Proceedings of the 40th Symposium on Foundations of Computer Science (FOCS), pp. 285-298 (1999)
11. Hagerup, T.: Sorting and searching on the word RAM. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol. 1373, pp. 366-398. Springer, Heidelberg (1998)
12. Hagerup, T., Miltersen, P.B., Pagh, R.: Deterministic dictionaries. J. Algor. 41(1), 69-85 (2001)
13. Han, Y.: Deterministic sorting in O(n log log n) time and linear space. J. Algor. 50(1), 96-105 (2004)
14. Overmars, M.H., van Leeuwen, J.: Worst-case optimal insertion and deletion methods for decomposable searching problems. Inf. Proc. Lett. 12(4), 168-173 (1981)
15. Pagh, R.: A trade-off for worst-case efficient dictionaries. Nordic J. Comput. 7(3), 151-163 (2000)
16. Raman, R.: Priority queues: Small, monotone and trans-dichotomous. In: Díaz, J. (ed.) ESA 1996. LNCS, vol. 1136, pp. 121-137. Springer, Heidelberg (1996)
17. Ružić, M.: Making deterministic signatures quickly. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms, pp. 900-909. ACM, SIAM (2007); Preliminary full version is available on the author's web page
18. Ružić, M.: Uniform deterministic dictionaries. ACM Transactions on Algorithms 4(1) (2008)
19. Tarjan, R.E., Yao, A.C.-C.: Storing a sparse table. Commun. ACM 22(11), 606-611 (1979)