| Pseudorandomness of expander random walks for symmetric functions and permutation branching programs L Golowich, S Vadhan 37th Computational Complexity Conference (CCC 2022), 2022 | 12 | 2022 |
| Improved product-based high-dimensional expanders L Golowich arXiv preprint arXiv:2105.09358, 2021 | 12 | 2021 |
| On the computational properties of obviously strategy-proof mechanisms L Golowich, S Li arXiv preprint arXiv:2101.05149, 2021 | 12 | 2021 |
| New explicit constant-degree lossless expanders L Golowich Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 4 | 2024 |
| Quantum locally recoverable codes L Golowich, V Guruswami arXiv preprint arXiv:2311.08653, 2023 | 3 | 2023 |
| Approaching the quantum singleton bound with approximate error correction T Bergamaschi, L Golowich, S Gunn arXiv preprint arXiv:2212.09935, 2022 | 3 | 2022 |
| New classes of set-sequential trees L Golowich, C Kim Discrete Mathematics 343 (3), 111741, 2020 | 3 | 2020 |
| From Grassmannian to Simplicial High-Dimensional Expanders L Golowich 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 2 | 2023 |
| A new berry-esseen theorem for expander walks L Golowich Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 10-22, 2023 | 2 | 2023 |
| NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes L Golowich, T Kaufman arXiv preprint arXiv:2311.09503, 2023 | 1 | 2023 |
| Maximum size of a family of pairwise graph-different permutations L Golowich, C Kim, R Zhou arXiv preprint arXiv:1702.08579, 2017 | 1 | 2017 |
