Graph k-Coloring in Sublinear Average Time
with Edward Pyne, Ronitt Rubinfeld, Asaf Shapira, and Shlomo Tauber.
FOCS 2026 (IEEE Foundations of Computer Science)
Quality control in sublinear time: a case study via random graphs [paper] [slides]
with Ronitt Rubinfeld and Madhu Sudan.
FOCS 2026 (IEEE Foundations of Computer Science)
Learning and Testing Convex Functions [paper]
with Renato Ferreira Pinto Jr., Elchanan Mossel, and Shivam Nadimpalli.
RANDOM 2026 (International Conference on Randomization and Computation)
Finding the root in random nearest neighbor trees [paper]
with Anna Brandenberger, Elchanan Mossel, and Madhu Sudan.
Random Structures & Algorithms, 2026
A Fast Coloring Oracle for Average Case Hypergraphs [paper]
with Edward Pyne, Ronitt Rubinfeld, Asaf Shapira, and Shlomo Tauber.
RANDOM 2025 (International Conference on Randomization and Computation)
Characterizing the Distinguishability of Product Distributions through Multicalibration [paper] [slides] [talk]
with Aaron (Louie) Putterman and Salil Vadhan.
CCC 2025 (Computational Complexity Conference)
Errors are Robustly Tamed in Cumulative Knowledge Processes [paper] [slides]
with Anna Brandenberger, Elchanan Mossel, and Madhu Sudan.
PNAS 2025 (Proceedings of the National Academy of Sciences)
COLT 2024 (Conference on Learning Theory)
Uniformity Testing over Hypergrids with Subcube Conditioning [paper] [slides]
with Xi Chen.
SODA 2024 (Symposium on Discrete Algorithms)
Beyond Worst Case Local Computation Algorithms [paper]
with Amartya Shankha Biswas, Ruidi Cao, Edward Pyne, Ronitt Rubinfeld, Asaf Shapira, and Shlomo Tauber.
All author names are listed alphabetically, as is the convention in theoretical computer science and mathematics.