Concurrent Trie Structures
Concurrent Trie Structures is a parallel data structure that extends the trie abstraction to support efficient, thread-safe insertions, deletions, and lookups in shared-memory concurrent environments through fine-grained synchronization and structural modifications enabling high levels of parallelism.
9
Publications
440
Citations
15
Authors
8
Institutions
Publications per year
2017–2026
1
Parents
9
Concurrent tries with efficient non-blocking snapshots
Aleksandar Prokopec, Nathan Bronson, Phil Bagwell et al. · 2012 · 109 citations
Non-blocking Patricia Tries with Replace Operations
Niloufar Shafiei · 2013 · 33 citations · Full text
Concurrent tries with efficient non-blocking snapshots
Aleksandar Prokopec, Nathan Bronson, Phil Bagwell et al. · ACM SIGPLAN Notices · 2012 · 32 citations · Full text
Rotem Oshman, Nir Shavit · 2013 · 30 citations · Full text
1–5 of 9
15
3
h-index
École Polytechnique Fédérale de Lausanne, Switzerland
3 publications · 152 citations
3
h-index
2
h-index
2
h-index
1
h-index
1–5 of 15
8
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
2 h-index
4 publications
282 citations
California Institute of Technology
Pasadena, United States
1 h-index
1 publications
182 citations
Massachusetts Institute of Technology
Cambridge, United States
1 h-index
1 publications
30 citations
INESC TEC
Porto, Portugal
1 h-index
2 publications
30 citations

York University
Toronto, Canada
1 h-index
1 publications
33 citations
Stanford University
Stanford, United States
1 h-index
1 publications
109 citations

Universidade do Porto
Porto, Portugal
1 h-index
2 publications
30 citations

University of Toronto
Toronto, Canada
1 h-index
1 publications
30 citations
1–8 of 8
Repository · 1 publications · 16 citations
1
h-index
MICPRO · 1 publications · 182 citations
1
h-index
1 publications · 15 citations
1
h-index
1 publications · 32 citations
1
h-index
Conference · 1 publications · 12 citations
1
h-index
1–5