Probabilistic Computation
Probabilistic Computation is a computational model that extends deterministic computation by incorporating randomness as a core mechanism, enabling transitions and outcomes to be governed by probability distributions rather than fixed rules.
850
Publications
51.2K
Citations
1.7K
Authors
654
Institutions
Publications per year
2017–2026
158
Parents
850
Probabilistic computations: Toward a unified measure of complexity
Andrew Chi-Chin Yao · 1977 · 892 citations
1–5 of 850
1.7K
12
h-index
12
h-index
11
h-index
Massachusetts Institute of Technology, United States
9 publications · 498 citations
9
h-index
8
h-index
1–5 of 1.7K
654
University of Oxford
Oxford, United Kingdom
21 h-index
49 publications
3.6K citations
Stanford University
Stanford, United States
18 h-index
34 publications
4K citations
Massachusetts Institute of Technology
Cambridge, United States
18 h-index
50 publications
3.6K citations

Centre National de la Recherche Scientifique
Paris, France
16 h-index
35 publications
1.6K citations
Carnegie Mellon University
Pittsburgh, United States
15 h-index
36 publications
2.1K citations
University of Cambridge
Cambridge, United Kingdom
14 h-index
19 publications
1.5K citations
University of California, Berkeley
Berkeley, United States
13 h-index
27 publications
1.9K citations

University of Edinburgh
Edinburgh, United Kingdom
13 h-index
17 publications
913 citations
1–8 of 654
Repository · 50 publications · 3.3K citations
27
h-index
ENTCS · 34 publications · 1K citations
18
h-index
17 publications · 800 citations
16
h-index
12 publications · 950 citations
12
h-index
PACMPL · 15 publications · 483 citations
12
h-index
1–5