Deterministic Parallel Search is a parallel search method that systematically explores the solution space using a fixed, predictable sequence of operations across multiple processors without reliance on randomness or probabilistic decisions.
9
Publications
426
Citations
15
Authors
14
Institutions
Publications per year
2017–2026
1
Parents
Publications
9
A parallel algorithmic version of the local lemma
Noga Alon · Random Structures and Algorithms · 1991 · 193 citations
Deterministic parallel list ranking
Richard Anderson, Gary L. Miller · Algorithmica · 1991 · 74 citations
The Locus model of search and its use in image interpretation
Steven M. Rubin, Raj Reddy · 1977 · 25 citations
A parallel algorithmic version of the local lemma
Noga Alon · 2002 · 19 citations
1–5 of 9
Authors
15
- NA
2
h-index
- AP
1
h-index
- RA
1
h-index
- GL
1
h-index
- RR
1
h-index
1–5 of 15
Institutions
14
Tel Aviv University
Tel Aviv, Israel
2 h-index
2 publications
212 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
3 publications
66 citations
Centre de Recherche en Informatique
Fontainebleau, France
1 h-index
2 publications
28 citations
Grant Medical Center
Columbus, United States
1 h-index
1 publications
193 citations
Seattle University
Seattle, United States
1 h-index
1 publications
74 citations
University of Washington
Seattle, United States
1 h-index
1 publications
74 citations
University of Southern California
Los Angeles, United States
1 h-index
1 publications
74 citations
Clark University
Worcester, United States
1 h-index
1 publications
60 citations
1–8 of 14
Venues
- Random Structures and Algorithms
1 publications · 193 citations
1
h-index
- Algorithmica
1 publications · 74 citations
1
h-index
- Trends in Ecology & Evolution
TREE · 1 publications · 60 citations
1
h-index
- Proceedings of the AAAI Conference on Artificial Intelligence
Conference · 1 publications · 16 citations
1
h-index
- Theoretical Computer Science
1 publications · 13 citations
1
h-index
1–5