Concurrent Hash Tables
Concurrent Hash Tables is a specialized type of hash table data structure designed to support efficient and thread-safe access and modification by multiple concurrent processes or threads, typically through fine-grained locking, lock-free, or wait-free synchronization mechanisms.
26
Publications
1.7K
Citations
53
Authors
30
Institutions
Publications per year
2017–2026
8
26
Algorithmic improvements for fast concurrent Cuckoo hashing
Xiaozhou Li, David G. Andersen, Michael Kaminsky et al. · 2014 · 184 citations
Badrish Chandramouli, Guna Prasaad, Donald Kossmann et al. · 2018 · 154 citations
Concurrent tries with efficient non-blocking snapshots
Aleksandar Prokopec, Nathan Bronson, Phil Bagwell et al. · 2012 · 109 citations
1–5 of 26
53
École Polytechnique Fédérale de Lausanne, Switzerland
4 publications · 168 citations
4
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 53
30
Carnegie Mellon University
Pittsburgh, United States
3 h-index
5 publications
1.1K citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
2 h-index
4 publications
282 citations
Intel (United States)
Santa Clara, United States
2 h-index
2 publications
552 citations
Stanford University
Stanford, United States
2 h-index
2 publications
212 citations

Portland State University
Portland, United States
2 h-index
4 publications
218 citations
Microsoft (United States)
Redmond, United States
2 h-index
6 publications
786 citations
Intel (Germany)
Munich, Germany
2 h-index
2 publications
50 citations
Laboratoire d'Informatique de Paris-Nord
Villetaneuse, France
2 h-index
2 publications
119 citations
1–8 of 30
2 publications · 52 citations
2
h-index
TOPC · 1 publications · 29 citations
1
h-index
1 publications · 42 citations
1
h-index
FGCS · 1 publications · 13 citations
1
h-index
1 publications · 30 citations
1
h-index
1–5