Parallel Hash Search
Parallel Hash Search is a parallel search method that employs distributed hash tables and concurrent probing to accelerate the lookup of keys across shared or distributed memory architectures by exploiting data-level parallelism.
7
Publications
276
Citations
22
Authors
13
Institutions
Publications per year
2017–2026
4
Parents
7
H-INDEX: Hash-Indexing for Parallel Triangle Counting on GPUs
Santosh Pandey, Xiaoye Sherry Li, Aydın Buluç et al. · 2019 · 42 citations
1–5 of 7
22
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 22
13
University of Louisiana at Lafayette
Lafayette, United States
1 h-index
1 publications
15 citations
Kharkov Technologies
Kharkiv, Ukraine
1 h-index
2 publications
66 citations

Masaryk University
Brno, Czechia
1 h-index
1 publications
12 citations

V. N. Karazin Kharkiv National University
Kharkiv, Ukraine
1 h-index
5 publications
165 citations
Institute of Information Technologies
Sofia, Bulgaria
1 h-index
2 publications
66 citations
Tokyo Institute of Technology
Tokyo, Japan
1 h-index
3 publications
45 citations

Stevens Institute of Technology
Hoboken, United States
1 h-index
2 publications
84 citations

Lawrence Berkeley National Laboratory
Berkeley, United States
1 h-index
2 publications
84 citations
1–8 of 13
Conference · 1 publications · 33 citations
1
h-index
1 publications · 11 citations
1
h-index
TON · 1 publications · 15 citations
1
h-index
1 publications · 11 citations
1–4