Parallel Dictionary Lookup
Parallel Dictionary Lookup is a parallel computing method that accelerates the retrieval of entries from a dictionary data structure by simultaneously querying multiple segments of the dictionary across distributed processing units.
8
Publications
230
Citations
19
Authors
9
Institutions
Publications per year
2017–2026
0
Parents
8
Parallel algorithms for data compression
M. E. Gonzalez Smith, James A. Storer · Journal of the ACM · 1985 · 76 citations · Full text
An optimal parallel dictionary
Martin Dietzfelbinger, Friedhelm Meyer auf der Heide · 1989 · 22 citations · Full text
1–5 of 8
19
1
h-index
Rutgers, The State University of New Jersey, United States
1 publications · 14 citations
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 19
9
IBM (United States)
Armonk, United States
2 h-index
3 publications
128 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
1 h-index
2 publications
114 citations

University of Central Florida
Orlando, United States
1 h-index
1 publications
11 citations

Brandeis University
Waltham, United States
1 h-index
2 publications
152 citations
Politecnico di Milano
Milan, Italy
1 h-index
1 publications
57 citations

Paderborn University
Paderborn, Germany
1 h-index
2 publications
44 citations
University of Sheffield
Sheffield, United Kingdom
1 h-index
2 publications
44 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
1 h-index
3 publications
39 citations
1–8 of 9
Conference · 1 publications · 15 citations
1
h-index
1 publications · 11 citations
1
h-index
JACM · 1 publications · 76 citations
1
h-index
1 publications · 13 citations
1
h-index
1 publications · 57 citations
1
h-index
1–5