Applications of a splitting trick

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

Volumn 5555 LNCS, Issue PART 1, 2009, Pages 354-365

  Dietzfelbinger, Martin ^a   Rink, Michael ^a  

^a ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENT SIMULATION; GENERAL APPROACH; INDEPENDENT FUNCTIONS; NEW APPLICATIONS; SIMPLE METHOD; SPACE BOUNDS;

DATA STRUCTURES; HASH FUNCTIONS; LINGUISTICS; TRANSLATION (LANGUAGES);

SPACE PROBES;

EID: 70449103308     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02927-1_30     Document Type: Conference Paper

References (18)

1. Carter, L., Wegman, M.N.: Universal classes of hash functions. J. Comput. Syst. Sci. 18(2), 143-154 (1979)
2. Pagh, R., Rodler, F.F.: Cuckoo hashing. J. Algorithms 51(2), 122-144 (2004)
3. Siegel, A.: On universal classes of extremely random constant-time hash functions. SIAM J. Comput. 33(3), 505-543 (2004)
4. Fotakis, D., Pagh, R., Sanders, P., Spirakis, P.G.: Space efficient hash tables with worst case constant access time. Theory Comput. Syst. 38(2), 229-248 (2005)
5. Dietzfelbinger, M., Weidling, C.: Balanced allocation and dictionaries with tightly packed constant size bins. Theor. Comput. Sci. 380(1-2), 47-68 (2007)
6. Mitzenmacher, M., Vadhan, S.: Why simple hash functions work: exploiting the entropy in a data stream. In: Proc. 19th SODA, pp. 746-755. SIAM, Philadelphia (2008)
7. Hagerup, T., Tholey, T.: Efficient minimal perfect hashing in nearly minimal space. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 317-326. Springer, Heidelberg (2001)
8. Dietzfelbinger, M.: Design strategies for minimal perfect hash functions. In: Hromkovič, J., Královič, R., Nunkesser, M., Widmayer, P. (eds.) SAGA 2007. LNCS, vol. 4665, pp. 2-17. Springer, Heidelberg (2007)
9. Östlin, A., Pagh, R.: Uniform hashing in constant time and linear space. In: Proc. 35th STOC, pp. 622-628. ACM Press, New York (2003)
10. Dietzfelbinger, M., Woelfel, P.: Almost random graphs with simple hash functions. In: Proc. 35th STOC, pp. 629-638. ACM Press, New York (2003)
11. Pagh, A., Pagh, R.: Uniform hashing in constant time and optimal space. SIAM J. Comput. 38(1), 85-96 (2008)
12. Siegel, A.: On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications. In: Proc. 30th FOCS, pp. 20-25 (1989)
13. Buhrman, H., Miltersen, P.B., Radhakrishnan, J., Venkatesh, S.: Are bitvectors optimal? SIAM J. Comput. 31(6), 1723-1744 (2002)
14. Ta-Shma, A.: Storing information with extractors. Inf. Process. Lett. 83(5), 267-274 (2002)
15. Östlin, A., Pagh, R.: One-probe search. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 439-450. Springer, Heidelberg (2002)
16. Dietzfelbinger, M., Meyer auf der Heide, F.: A new universal class of hash functions and dynamic hashing in real time. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 6-19. Springer, Heidelberg (1990)
17. Dietzfelbinger, M., Pagh, R.: Succinct data structures for retrieval and approximate membership (Extended abstract). In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 385-396. Springer, Heidelberg (2008)
18. Calkin, N.J.: Dependent sets of constant weight binary vectors. Combinatorics, Probability & Computing 6(3), 263-271 (1997)