| Bounded indistinguishability and the complexity of recovering secrets A Bogdanov, Y Ishai, E Viola, C Williamson Annual International Cryptology Conference, 593-618, 2016 | 52 | 2016 |
| Approximate bounded indistinguishability A Bogdanov, C Williamson 44th International Colloquium on Automata, Languages, and Programming (ICALP …, 2017 | 18 | 2017 |
| Approximate degree, secret sharing, and concentration phenomena A Bogdanov, NS Mande, J Thaler, C Williamson arXiv preprint arXiv:1906.00326, 2019 | 6 | 2019 |
| Spectral graph theory, expanders, and ramanujan graphs C Williamson University of Washington, 2014 | 6 | 2014 |
| An Overview of the Thue-Morse Sequence C Williamson Washington: Department Of Mathematics, University of Washington, 2012 | 6 | 2012 |
| Sharp indistinguishability bounds from non-uniform approximations C Williamson arXiv preprint arXiv:2103.07842, 2021 | 1 | 2021 |
| Bounds on Geometric Eigenvalues of Graphs M Radcliffe, C Williamson arXiv preprint arXiv:1501.03436, 2015 | 1 | 2015 |
