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)

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 (J. Inf. Process., 2020)

Families with no perfect matchings. - Mihir Singhal (Comb. Theory, 2021)

Lower bounds for superpatterns and universal sequences. - Zachary Chroman; Matthew Kwan 001; Mihir Singhal (J. Comb. Theory A, 2021)

Low-Degree Multicalibration. - Parikshit Gopalan; Michael P. Kim; Mihir Singhal; Shengjia Zhao (COLT, 2022)

Erdős-Littlewood-Offord problem with arbitrary probabilities. - Mihir Singhal (Discret. Math., 2022)

Unimodality of a refinement of Lassalle's sequence. - Mihir Singhal (Discret. Math., 2023)

Omnipredictors for regression and the approximate rank of convex functions. - Parikshit Gopalan; Princewill Okoroafor; Prasad Raghavendra; Abhishek Sherry; Mihir Singhal (COLT, 2024)

Locally Computing Edge Orientations. - Slobodan Mitrovic; Ronitt Rubinfeld; Mihir Singhal (ESA, 2024)

Omnipredictors for Regression and the Approximate Rank of Convex Functions. - Parikshit Gopalan; Princewill Okoroafor; Prasad Raghavendra; Abhishek Shetty; Mihir Singhal (CoRR, 2024)

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 (CoRR, 2024)

Optimal quantile estimation: beyond the comparison model. - Meghal Gupta; Mihir Singhal; Hongxun Wu (Electron. Colloquium Comput. Complex., 2024)

Tight Bounds for Stream Decodable Error-Correcting Codes. - Meghal Gupta; Venkatesan Guruswami; Mihir Singhal (CCC, 2025)

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries. - Edith Cohen; Mihir Singhal; Uri Stemmer (CoRR, 2025)