Deterministic Parallel Algorithms
Deterministic Parallel Algorithms is a computational model in parallel complexity theory that belongs to the class of parallel algorithms characterized by producing identical output for a given input across all executions, distinguished from probabilistic or nondeterministic variants by its reliance solely on deterministic transitions and absence of random choices during computation.
90
Publications
5.9K
Citations
190
Authors
97
Institutions
Publications per year
2017–2026
8
90
Parallelism in random access machines
Steven Fortune, James Wyllie · 1978 · 885 citations
A type and effect system for deterministic parallel Java
Robert L. Bocchino, Vikram Adve, Danny Dig et al. · ACM SIGPLAN Notices · 2009 · 296 citations
A type and effect system for deterministic parallel Java
Robert L. Bocchino, Vikram Adve, Danny Dig et al. · 2009 · 261 citations
1–5 of 90
190
3
h-index
University of Illinois Urbana-Champaign, United States
3 publications · 598 citations
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 190
97

Tel Aviv University
Tel Aviv, Israel
7 h-index
9 publications
377 citations
Stanford University
Stanford, United States
6 h-index
11 publications
470 citations
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
11 publications
1.1K citations
University of Washington
Seattle, United States
4 h-index
4 publications
172 citations
IBM Research - Almaden
San Jose, United States
4 h-index
5 publications
95 citations
Columbia University
New York, United States
3 h-index
9 publications
475 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
26 publications
5.8K citations

Weizmann Institute of Science
Rehovot, Israel
3 h-index
4 publications
253 citations
1–8 of 97
9 publications · 272 citations
9
h-index
4 publications · 390 citations
4
h-index
2 publications · 156 citations
2
h-index
Repository · 2 publications · 23 citations
2
h-index
1 publications · 193 citations
1
h-index
1–5