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
Parents
106
Cuckoo search: recent advances and applications
Xin‐She Yang, Suash Deb · Neural Computing and Applications · 2013 · 1.1K citations · Full text
Rasmus Pagh, Flemming Friche Rodler · Journal of Algorithms · 2004 · 1.1K citations
Biplob Debnath, Sudipta Sengupta, Jin Li · Proceedings of the VLDB Endowment · 2010 · 239 citations
1–5 of 106
250
10
h-index
4
h-index
4
h-index
4
h-index
4
h-index
1–5 of 250
140

Harvard University Press
Cambridge, United States
6 h-index
7 publications
543 citations

Huazhong University of Science and Technology
Wuhan, China
5 h-index
24 publications
475 citations
Carnegie Mellon University
Pittsburgh, United States
5 h-index
9 publications
994 citations

Technische Universität Ilmenau
Ilmenau, Germany
4 h-index
8 publications
176 citations
Wuhan National Laboratory for Optoelectronics
Wuhan, China
4 h-index
19 publications
330 citations
Harvard University
Cambridge, United States
3 h-index
4 publications
71 citations
Brno University of Technology
Brno, Czechia
3 h-index
6 publications
93 citations
University of California, Davis
Davis, United States
3 h-index
14 publications
1.4K citations
1–8 of 140
3 publications · 62 citations
3
h-index
3 publications · 228 citations
3
h-index
3 publications · 1.1K citations
3
h-index
PVLDB · 3 publications · 331 citations
3
h-index
2 publications · 102 citations
2
h-index
1–5