Mihir Singhal

According to our database, Mihir Singhal authored at least 7 papers between 2020 and 2024.

Collaborative distances:

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

2024

Omnipredictors for Regression and the Approximate Rank of Convex Functions.

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

CoRR, 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, Ser. A, 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