Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
Deterministic extractors for small-space sources | Journal of Computer and System Sciences |
| 9 | 2011 |
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds | computational complexity |
| 5 | 2011 |
On the Complexity of Succinct Zero-Sum Games | computational complexity |
| 7 | 2008 |
Error-bounded probabilistic computations between MA and AM | Journal of Computer and System Sciences |
| 8 | 2006 |
Pseudorandomness for Approximate Counting and Sampling | computational complexity |
| 15 | 2006 |
Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
Communication Complexity of Statistical Distance | ACM Transactions on Computation Theory |
| 1 | 2018 |
Quantum random number generators | Reviews of Modern Physics |
| 25 | 2017 |
Category | Category Repetition |
---|---|
Science: Physics | 1 |
Science: Mathematics: Instruments and machines: Electronic computers. Computer science | 1 |