Randomized Computation Models
Randomized Computation Models is a theoretical framework in computer science that distinguishes itself from deterministic computation models by incorporating randomness as a fundamental resource in the execution and analysis of algorithms.
16
Publications
544
Citations
35
Authors
29
Institutions
Publications per year
2017–2026
1
Parents
16
The Coin Problem and Pseudorandomness for Branching Programs
Joshua Brody, Elad Verbin · 2010 · 68 citations
1–5 of 16
35
2
h-index
2
h-index
1
h-index
Mitsubishi Electric (United States), United States
1 publications · 51 citations
1
h-index
1
h-index
1–5 of 35
29
Princeton University
Princeton, United States
2 h-index
2 publications
29 citations
Hebrew University of Jerusalem
Jerusalem, Israel
2 h-index
7 publications
153 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
2 h-index
2 publications
45 citations
Technion – Israel Institute of Technology
Haifa, Israel
1 h-index
1 publications
19 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
1 h-index
1 publications
59 citations

Cornell University
Ithaca, United States
1 h-index
1 publications
91 citations

University of New Hampshire
Durham, United States
1 h-index
6 publications
102 citations
Stanford University
Stanford, United States
1 h-index
1 publications
27 citations
1–8 of 29
2 publications · 36 citations
2
h-index
JEP · 1 publications · 17 citations
1
h-index
1 publications · 59 citations
1
h-index
1 publications · 27 citations
1
h-index
JACM · 1 publications · 31 citations
1
h-index
1–5