Parallel Searching is a computational method within parallel algorithms that identifies the position or existence of a target element in a data structure by simultaneously executing multiple search operations across distributed or concurrent processing units, distinguished from sequential searching by its use of parallelism to reduce time complexity.
1.2K
Publications
68.4K
Citations
3K
Authors
1K
Institutions
Publications per year
2017–2026
203
Parents
Publications
1.2K
1–5 of 1.2K
Authors
3K
- UV
10
h-index
- ZG
10
h-index
- RE
7
h-index
- TG
7
h-index
- WF
7
h-index
1–5 of 3K
Institutions
1K
Carnegie Mellon University
Pittsburgh, United States
18 h-index
37 publications
9.3K citations
IBM (United States)
Armonk, United States
17 h-index
31 publications
3.7K citations
University of California, Berkeley
Berkeley, United States
16 h-index
29 publications
2.9K citations
Tel Aviv University
Tel Aviv, Israel
16 h-index
38 publications
3.7K citations
University of Maryland, College Park
College Park, United States
15 h-index
34 publications
1.9K citations
University of Minnesota
Minneapolis, United States
15 h-index
34 publications
1.3K citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
15 h-index
34 publications
2.2K citations
Purdue University West Lafayette
West Lafayette, United States
13 h-index
28 publications
908 citations
1–8 of 1K
Venues
- IEEE Transactions on Parallel and Distributed Systems
TPDS · 21 publications · 690 citations
16
h-index
- Parallel Computing
16 publications · 623 citations
13
h-index
- Journal of Parallel and Distributed Computing
17 publications · 402 citations
13
h-index
- SIAM Journal on Computing
12 publications · 1.1K citations
12
h-index
- arXiv (Cornell University)
Repository · 12 publications · 482 citations
12
h-index
1–5