Randomness Efficiency
Randomness Efficiency is a computational complexity metric that quantifies the minimal amount of random bits required by a randomized algorithm to achieve a desired level of accuracy or success probability, distinguishing it from related efficiency measures by focusing specifically on the consumption of randomness as a computational resource.
23
Publications
912
Citations
80
Authors
51
Institutions
Publications per year
2017–2026
9
Parents
23
HydRand: Efficient Continuous Distributed Randomness
Philipp Schindler, Aljosha Judmayer, Nicholas Stifter et al. · 2020 · 64 citations · Full text
1–5 of 23
80
Laboratoire de Conception, Optimisation et Modélisation des Systèmes, France
1 publications · 20 citations
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 80
51
Palo Alto Research Center
Palo Alto, United States
1 h-index
1 publications
66 citations
Institut Fourier
Saint-Martin-d'Hères, France
1 h-index
2 publications
34 citations
National Electronics and Computer Technology Center
Pathum Thani, Thailand
1 h-index
4 publications
48 citations
Beijing Jiaotong University
Beijing, China
1 h-index
2 publications
78 citations
Commissariat à l'Énergie Atomique et aux Énergies Alternatives
Paris, France
1 h-index
6 publications
126 citations
Institute of Modern Physics
Lanzhou, China
1 h-index
1 publications
44 citations
University of Maryland, College Park
College Park, United States
1 h-index
2 publications
42 citations
Stanford University
Stanford, United States
1 h-index
2 publications
24 citations
1–8 of 51
2 publications · 211 citations
2
h-index
2 publications · 132 citations
2
h-index
1 publications · 58 citations
1
h-index
1 publications · 44 citations
1
h-index
1 publications · 21 citations
1
h-index
1–5