Name
Title | Citations | PageRank | Year |
|---|---|---|---|
| No Time To Hash: On Super-Efficient Entropy Accumulation | 0 | 0.34 | 2021 |
| Unifying Presampling via Concentration Bounds | 0 | 0.34 | 2021 |
| Non-malleable Codes for Decision Trees. | 0 | 0.34 | 2019 |
| Testing $k$-Monotonicity: The Rise and Fall of Boolean Functions | 0 | 0.34 | 2019 |
| Complete Classification of Generalized Santha-Vazirani Sources. | 0 | 0.34 | 2017 |
| Threshold Secret Sharing Requires a Linear Size Alphabet. | 6 | 0.47 | 2016 |
| Rational Sumchecks. | 0 | 0.34 | 2016 |
| Testing k-Monotonicity. | 3 | 0.41 | 2016 |
| Negation-Limited Formulas. | 0 | 0.34 | 2015 |
| The Power of Negations in Cryptography. | 0 | 0.34 | 2015 |
| The Power of Negations in Cryptography. | 7 | 0.67 | 2014 |