keywords algorithms, computational complexity, cryptography, theoretical computer science, lattices, error-correcting codes, post-quantum cryptography, high-dimensional geometry
selected publications conference proceeding Asymptotic Improvements to Provable Algorithms for the Code Equivalence Problem. 1-6. 2025 The more the merrier! On total coding and lattice problems and the complexity of finding multicollisions 2025 Matrix Multiplication Verification Using Coding Theory 2024 Topological k-metrics 2024 journal article Difficulties Constructing Lattices With Exponential Kissing Number From Codes. IEEE Transactions on Information Theory. 7644-7648. 2025 Relating code equivalence to other isomorphism problems. Designs, Codes, and Cryptography. 701-723. 2025 Topological k-metrics. Discrete and Computational Geometry. 2025 Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All ({ell_{{p}}}) Norms. SIAM journal on computing (Print). 1439-1475. 2024
education and training Ph.D., New York University 2017 M.S., University of Colorado Boulder 2012 B.S., University of Wisconsin Madison 2010