Published in APPROX 2026 (International Conference on Approximation Algorithms for Combinatorial Optimization Problems), 2026
This paper is about the Binary Gap Covering Radius Problem which interpolates between the Covering Radius Problem and the Linear Discrepancy problem.
Recommended citation: You can find the BibTeX on the arxiv page.
Download Paper | Download Slides
Published:
This is a poster presentation talk targeting prospective PhD students — posters at the venue generally were about the research being done by various labs and PhD students in the department of Computer Science at the University of Colorado - Boulder. The topic of my poster is deriving hardness of approximation results for the covering radius problem in lattices under various L-p norms. At this poster session, I was awarded a “Best Work in Progress” poster presentation award.
Undergraduate course, University of Michigan - Ann Arbor, 2023
I was a teaching assistant for the University of Michigan - Ann Arbor introduction to algorithms and complexity course targeting undergraduates in the computer science major.
Undergraduate course, University of Michigan - Ann Arbor, 2023
I was a teaching assistant for the University of Michigan - Ann Arbor algorithms course targeting undergraduates in the computer science major.
Undergraduate course, University of Colorado - Boulder, 2025
I was a teaching assistant for the University of Colorado, Boulder introduction to algorithms course targeting undergraduates in the computer science major.