Mihir Singhal

According to our database, Mihir Singhal authored at least 16 papers between 2020 and 2026.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2026

Improved Local Computation Algorithms for Greedy Set Cover via Retroactive Updates.

Slobodan Mitrovic, Srikkanth Ramachandran, Ronitt Rubinfeld, Mihir Singhal

CoRR, March, 2026

One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches.

Edith Cohen, Jelani Nelson, Tamás Sarlós, Mihir Singhal, Uri Stemmer

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

The communication complexity of distributed estimation.

Parikshit Gopalan, Raghu Meka, Prasad Raghavendra, Mihir Singhal, Avi Wigderson

CoRR, November, 2025

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries.

Edith Cohen, Mihir Singhal, Uri Stemmer

Proceedings of the Forty-second International Conference on Machine Learning, 2025

Tight Bounds for Stream Decodable Error-Correcting Codes.

Meghal Gupta, Venkatesan Guruswami, Mihir Singhal

Proceedings of the 40th Computational Complexity Conference, 2025

2024

Omnipredictors for Regression and the Approximate Rank of Convex Functions.

Parikshit Gopalan, Princewill Okoroafor, Prasad Raghavendra, Abhishek Shetty, Mihir Singhal

CoRR, 2024

Optimal Quantile Estimation: Beyond the Comparison Model.

Meghal Gupta, Mihir Singhal, Hongxun Wu

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Locally Computing Edge Orientations.

Slobodan Mitrovic, Ronitt Rubinfeld, Mihir Singhal

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Omnipredictors for regression and the approximate rank of convex functions.

Parikshit Gopalan, Princewill Okoroafor, Prasad Raghavendra, Abhishek Sherry, Mihir Singhal

Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023

Unimodality of a refinement of Lassalle's sequence.

Mihir Singhal

Discret. Math., July, 2023

2022

Erdős-Littlewood-Offord problem with arbitrary probabilities.

Mihir Singhal

Discret. Math., 2022

Low-Degree Multicalibration.

Parikshit Gopalan, Michael P. Kim, Mihir Singhal, Shengjia Zhao

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021

Lower bounds for superpatterns and universal sequences.

Zachary Chroman, Matthew Kwan, Mihir Singhal

J. Comb. Theory A, 2021

Families with no perfect matchings.

Mihir Singhal

Comb. Theory, 2021

2020

Tetris is NP-hard even with <i>O</i>(1) Rows or Columns.

Sualeh Asif, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Jayson Lynch, Mihir Singhal

J. Inf. Process., 2020

Tetris is NP-hard even with $O(1)$ rows or columns.

Sualeh Asif, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Jayson Lynch, Mihir Singhal

CoRR, 2020