Parallel Searching Algorithms
Parallel Searching Algorithms is a computational methodology within parallel computation that fundamentally consists of simultaneous exploration strategies to locate specific elements or patterns in a data structure by distributing the search task across multiple processing units, thereby differentiating it from sequential search techniques through concurrent execution.
221
Publications
13.6K
Citations
523
Authors
265
Institutions
Publications per year
2017–2026
21
Parents
221
DNA Solution of Hard Computational Problems
Richard J. Lipton · Science · 1995 · 1.1K citations
A learning algorithm for boltzmann machines
David H. Ackley, Geoffrey E. Hinton, Terrence J. Sejnowski · Cognitive Science · 1985 · 743 citations · Full text
Dmitri G. Fedorov, Ryan M. Olson, Kazuo Kitaura et al. · Journal of Computational Chemistry · 2004 · 266 citations
1–5 of 221
523
6
h-index
4
h-index
4
h-index
4
h-index
4
h-index
1–5 of 523
265

University of Minnesota
Minneapolis, United States
6 h-index
12 publications
478 citations
University of Maryland, College Park
College Park, United States
5 h-index
10 publications
395 citations
The University of Texas at Austin
Austin, United States
5 h-index
12 publications
661 citations

University of Alberta
Edmonton, Canada
5 h-index
11 publications
296 citations
University of California, Los Angeles
Los Angeles, United States
4 h-index
7 publications
375 citations
Carnegie Mellon University
Pittsburgh, United States
4 h-index
6 publications
8.2K citations
The University of Tokyo
Tokyo, Japan
4 h-index
6 publications
111 citations
North Carolina State University
Raleigh, United States
4 h-index
8 publications
276 citations
1–8 of 265
5 publications · 147 citations
5
h-index
4 publications · 178 citations
4
h-index
TPAMI · 4 publications · 209 citations
4
h-index
PRL · 3 publications · 141 citations
3
h-index
3 publications · 90 citations
3
h-index
1–5