Cuckoo Hashing

Cuckoo Hashing is a hash table algorithm that resolves collisions by employing two or more alternative hash functions and relocating displaced keys to their alternate positions, thereby guaranteeing worst-case constant-time lookup through a deterministic displacement mechanism.

106

Publications

7.2K

Citations

250

Authors

140

Institutions

Publications per year

2017–2026

44

Authors

250

  1. MM
    Michael Mitzenmacher

    Harvard University Press, United States

    10 publications · 590 citations

    10

    h-index

  2. MD
    Martin Dietzfelbinger

    Technische Universität Ilmenau, Germany

    4 publications · 88 citations

    4

    h-index

  3. RK
    Reinhard Kutzelnigg

    TU Wien, Austria

    4 publications · 87 citations

    4

    h-index

  4. SP
    Salvatore Pontarelli

    University of Rome Tor Vergata, Italy

    4 publications · 105 citations

    4

    h-index

  5. YH
    Yu Hua

    Huazhong University of Science and Technology, China

    4 publications · 78 citations

    4

    h-index

1–5 of 250

Venues

  1. Multimedia Tools and Applications

    3 publications · 62 citations

    3

    h-index

  2. SIAM Journal on Computing

    3 publications · 228 citations

    3

    h-index

  3. Neural Computing and Applications

    3 publications · 1.1K citations

    3

    h-index

  4. Proceedings of the VLDB Endowment

    PVLDB · 3 publications · 331 citations

    3

    h-index

  5. Random Structures and Algorithms

    2 publications · 102 citations

    2

    h-index

1–5