Resizable Hash Tables
Resizable Hash Tables is a dynamic data structure that, unlike fixed-size hash tables, automatically expands or contracts its capacity in response to changes in the number of stored elements to maintain efficient load factors and performance guarantees.
10
Publications
254
Citations
28
Authors
23
Institutions
Publications per year
2017–2026
4
Variants
Resizable Hash Table
Parents
10
Dynamic-sized nonblocking hash tables
Yujie Liu, Kunlong Zhang, Michael Spear · 2014 · 44 citations
DyCuckoo: Dynamic Hash Tables on GPUs
Yuchen Li, Qiwei Zhu, Zheng Lyu et al. · 2021 · 27 citations · Full text
Predicate RCU: an RCU for scalable concurrent updates
Maya Arbel, Adam Morrison · 2015 · 23 citations
Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once
Michael A. Bender, Alex Conway, Martı́n Farach-Colton et al. · Journal of the ACM · 2023 · 20 citations
1–5 of 10
28
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 28
23
Rutgers, The State University of New Jersey
New Brunswick, United States
1 h-index
1 publications
20 citations
Foundation for Research and Technology Hellas
Heraklion, Greece
1 h-index
1 publications
16 citations
Wuhan National Laboratory for Optoelectronics
Wuhan, China
1 h-index
3 publications
48 citations

Huazhong University of Science and Technology
Wuhan, China
1 h-index
3 publications
48 citations
University of Arizona
Tucson, United States
1 h-index
1 publications
11 citations
Singapore Management University
Singapore, Singapore
1 h-index
1 publications
27 citations
FORTH Institute of Computer Science
Heraklion, Greece
1 h-index
1 publications
16 citations

Lehigh University
Bethlehem, United States
1 h-index
2 publications
88 citations
1–8 of 23
Repository · 1 publications · 14 citations
1
h-index
Conference · 1 publications · 67 citations
1
h-index
JACM · 1 publications · 20 citations
1
h-index
TOS · 1 publications · 16 citations
1
h-index
1 publications · 11 citations
1
h-index
1–5