Keyword

weak randomness

Description: A notion of algorithmic randomness for infinite sequences, defined through restricted classes of effective statistical tests in computability theory.
OpenAlex ID: keywords/weak-randomness
1988 · Benny Chor, Oded Goldreich · SIAM Journal on Computing · 644
2001 · Luca Trevisan · Journal of the ACM · 402
2005 · Ran Raz · ACM Symposium on Theory of Computing (STOC) · 210
1985 · Benny Chor, Oded Goldreich · Annual Symposium on Foundations of Computer Science · 117
1999 · Luca Trevisan · ACM Symposium on Theory of Computing (STOC) · 96
2016 · Fernando G. S. L. Brandão, Ravishankar Ramanathan, et al. · Nature Communications · 92
2012 · Jan Bouda, Matej Pivoluska, et al. · Physical Review A · 67
2007 · James L. McInnes, Benny Pinkas · Springer eBooks · 59
2013 · Daniel Wichs · Conference on Innovations in Theoretical Computer Science · 58
1997 · M. Picco · Physical Review Letters · 55
2015 · Piotr Mironowicz, Rodrigo Gallego, et al. · Physical Review A · 36
2014 · Jan Bouda, Marcin Pawłowski, et al. · Physical Review A · 36
1996 · Klaus Ambos-Spies, Elvira Mayordomo, et al. · Lecture notes in computer science · 35
2015 · Gil Cohen · Annual Symposium on Foundations of Computer Science · 33
2006 · Tomasz Komorowski, Lenya Ryzhik · Communications in Mathematical Physics · 30
2010 · Oded Goldreich, Or Sheffet · Computational Complexity · 24
2019 · Chun-Mei Zhang, Wen-Bo Wang, et al. · Optics Letters · 21
2009 · Tony E. Lee, G. Refael, et al. · Physical Review E · 18
2014 · Martin Plesch, Matej Pivoluska · Physics Letters A · 17
1986 · Dung T. Huynh · SIAM Journal on Computing · 17
2007 · Laurent Bienvenu, Wolfgang Merkle · Electronic Notes in Theoretical Computer Science · 12
2024 · Amit Singh Bhati, Antonín Dufka, et al. · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · 11
Works count: 115
Citation count: 2,503
Year
Topic
Type