Hash Table Performance Analysis
Hash Table Performance Analysis is a methodological framework within algorithmic analysis that characterizes the efficiency and behavior of hash table operations in terms of time complexity, space usage, and collision management under varying input distributions and design parameters.
125
Publications
7.1K
Citations
269
Authors
127
Institutions
Publications per year
2017–2026
10
Parents
125
Rasmus Pagh, Flemming Friche Rodler · Journal of Algorithms · 2004 · 1.1K citations
Scalable high speed IP routing lookups
Marcel Waldvogel, George Varghese, Jon Turner et al. · 1997 · 663 citations · Full text
Performance of hashing-based schemes for Internet load balancing
Zhiruo Cao, Zheng Wang, Ellen Zegura · 2002 · 269 citations
Scalable high speed IP routing lookups
Marcel Waldvogel, George Varghese, Jon Turner et al. · ACM SIGCOMM Computer Communication Review · 1997 · 259 citations
Robert E. Tarjan, Andrew Chi-Chih Yao · Communications of the ACM · 1979 · 207 citations · Full text
1–5 of 125
269
7
h-index
6
h-index
5
h-index
4
h-index
4
h-index
1–5 of 269
127

Washington University in St. Louis
St Louis, United States
5 h-index
11 publications
2.3K citations

University of Waterloo
Waterloo, Canada
5 h-index
5 publications
222 citations

IT University of Copenhagen
Copenhagen, Denmark
4 h-index
5 publications
1.3K citations
ETH Zurich
Zurich, Switzerland
3 h-index
6 publications
2K citations

Harvard University Press
Cambridge, United States
3 h-index
4 publications
324 citations

Hunan University
Changsha, China
3 h-index
13 publications
324 citations
Universidad de la República de Uruguay
Montevideo, Uruguay
3 h-index
3 publications
50 citations
UCLouvain
Louvain-la-Neuve, Belgium
2 h-index
5 publications
109 citations
1–8 of 127
8 publications · 334 citations
8
h-index
5 publications · 505 citations
5
h-index
5 publications · 87 citations
5
h-index
Repository · 4 publications · 138 citations
4
h-index
PVLDB · 3 publications · 165 citations
3
h-index
1–5