Parallel Binary Search
Parallel Binary Search is a parallel algorithmic method that extends the classical binary search paradigm by concurrently evaluating multiple search intervals across distributed or multi-threaded processing units to accelerate the localization of target elements within sorted data structures.
26
Publications
1.1K
Citations
57
Authors
40
Institutions
Publications per year
2017–2026
4
Parents
26
Using multiple hash functions to improve IP lookups
Arndt Bröder, Michael Mitzenmacher · 2002 · 249 citations · Full text
A non-blocking internal binary search tree
Shane Valentine Howley, Jeremy Jones · 2012 · 95 citations
Concurrent Search and Insertion in AVL Trees
Ellis Ellis · IEEE Transactions on Computers · 1980 · 93 citations
TriCore: Parallel Triangle Counting on GPUs
Yang Hu, Hang Liu, H. Howie Huang · 2018 · 72 citations
1–5 of 26
57
2
h-index
2
h-index
2
h-index
2
h-index
1
h-index
1–5 of 57
40

California Maritime Academy
Vallejo, United States
2 h-index
2 publications
92 citations
Sensors (United States)
Los Gatos, United States
2 h-index
2 publications
92 citations
Lockheed Martin (United States)
Bethesda, United States
2 h-index
4 publications
184 citations

Université de Picardie Jules Verne
Amiens, France
2 h-index
4 publications
56 citations
Purdue University West Lafayette
West Lafayette, United States
1 h-index
1 publications
14 citations

Ewha Womans University
Seoul, South Korea
1 h-index
3 publications
189 citations
George Washington University
Washington, United States
1 h-index
2 publications
144 citations

University of Rochester
Rochester, United States
1 h-index
1 publications
93 citations
1–8 of 40
TPDS · 4 publications · 104 citations
4
h-index
2 publications · 156 citations
2
h-index
IJHPCN · 1 publications · 15 citations
1
h-index
1 publications · 16 citations
1
h-index
Repository · 1 publications · 37 citations
1
h-index
1–5