Maximum Size of a Family of Pairwise Graph-Different Permutations. - Louis Golowich; Chiheon Kim; Richard Zhou (Electron. J. Comb., 2017)

New classes of set-sequential trees. - Louis Golowich; Chiheon Kim (Discret. Math., 2020)

On the Computational Properties of Obviously Strategy-Proof Mechanisms. - Louis Golowich; Shengwu Li (CoRR, 2021)

Improved Product-Based High-Dimensional Expanders. - Louis Golowich (Electron. Colloquium Comput. Complex., 2021)

A New Berry-Esseen Theorem for Expander Walks. - Louis Golowich (Electron. Colloquium Comput. Complex., 2022)

Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs. - Louis Golowich; Salil P. Vadhan (Electron. Colloquium Comput. Complex., 2022)

From Grassmannian to Simplicial High-Dimensional Expanders. - Louis Golowich (Electron. Colloquium Comput. Complex., 2023)

New Explicit Constant-Degree Lossless Expanders. - Louis Golowich (Electron. Colloquium Comput. Complex., 2023)

Quantum Locally Recoverable Codes. - Louis Golowich; Venkatesan Guruswami (Electron. Colloquium Comput. Complex., 2023)

NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes. - Louis Golowich; Tali Kaufman (Electron. Colloquium Comput. Complex., 2023)

Decoding Quasi-Cyclic Quantum LDPC Codes. - Louis Golowich; Venkatesan Guruswami (FOCS, 2024)

Approaching the Quantum Singleton Bound with Approximate Error Correction. - Thiago Bergamaschi; Louis Golowich; Sam Gunn (STOC, 2024)

Quantum LDPC Codes of Almost Linear Distance via Homological Products. - Louis Golowich; Venkatesan Guruswami (CoRR, 2024)

Quantum LDPC Codes of Almost Linear Distance via Iterated Homological Products. - Louis Golowich; Venkatesan Guruswami (CCC, 2025)

Asymptotically Good Quantum Codes with Transversal Non-Clifford Gates. - Louis Golowich; Venkatesan Guruswami (STOC, 2025)

Quantum LDPC Codes with Transversal Non-Clifford Gates via Products of Algebraic Codes. - Louis Golowich; Ting-Chun Lin (STOC, 2025)