Hash Table Implementations
Hash Table Implementations is a method in computer science that belongs to the class of symbol table implementations, distinguished by its use of a hash function to map keys to array indices, enabling efficient insertion, deletion, and lookup operations.
305
Publications
96.1K
Citations
821
Authors
314
Institutions
Publications per year
2017–2026
54
Parents
305
Fast and accurate short read alignment with Burrows–Wheeler transform
Heng Li, Richard Durbin · Bioinformatics · 2009 · 62.8K citations · Full text
A scalable content-addressable network
Sylvia Ratnasamy, Paul Francis, Mark Handley et al. · 2001 · 6.4K citations · Full text
A scalable content-addressable network
Sylvia Ratnasamy, Paul Francis, Mark Handley et al. · ACM SIGCOMM Computer Communication Review · 2001 · 1.8K citations
1–5 of 305
821
6
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 821
314
University of California, Berkeley
Berkeley, United States
7 h-index
15 publications
1.8K citations
University of California San Diego
San Diego, United States
6 h-index
11 publications
1.2K citations
Princeton University
Princeton, United States
6 h-index
16 publications
1.7K citations
Carnegie Mellon University
Pittsburgh, United States
6 h-index
13 publications
4.1K citations
University of Arizona
Tucson, United States
5 h-index
6 publications
250 citations
ETH Zurich
Zurich, Switzerland
5 h-index
11 publications
545 citations
Georgia Institute of Technology
Atlanta, United States
5 h-index
9 publications
438 citations
RMIT University
Melbourne, Australia
5 h-index
10 publications
348 citations
1–8 of 314
9 publications · 736 citations
9
h-index
8 publications · 68.8K citations
8
h-index
Repository · 5 publications · 127 citations
5
h-index
TON · 5 publications · 314 citations
5
h-index
3 publications · 241 citations
3
h-index
1–5