I am a third year CS PhD student at EPFL working with Michael Kapralov. I am broadly interested in theoretical computer science. One direction of my current work is applying spectral graph theory to sublinear algorithm design. Another branch is optimization the memory/runtime of LLM inference, emphasizing algorithms with strong theoretical guarantees.
Spectral Clustering with Side Information
In the ACM–SIAM Symposium on Discrete Algorithms (SODA), 2026
Spectral clustering in birthday paradox time
In the ACM–SIAM Symposium on Discrete Algorithms (SODA), 2026
Streaming Attention Approximation via Discrepancy Theory
In Advances in Neural Information Processing Systems (NeurIPS), 2025 (Spotlight)
A KV‑cache compression method based on discrepancy theory, offering provable approximation guarantees and strong empirical performance on long‑context benchmarks
A new Andrews--Crandall-type identity and the number of integer solutions to \(x^2+2y^2+2z^2=n\)
In Ramanujan Journal 63 (2024), no. 4, 969-994