Mihir Singhal

Orcid: 0000-0001-8194-6997

According to our database1, Mihir Singhal authored at least 13 papers between 2020 and 2024.

Collaborative distances:

Timeline

2020
2021
2022
2023
2024
0
1
2
3
4
5
6
7
4
1
1
2
2
2
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Optimal quantile estimation: beyond the comparison model.
Electron. Colloquium Comput. Complex., 2024

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

Tight bounds for stream decodable error-correcting codes.
CoRR, 2024

Omnipredictors for Regression and the Approximate Rank of Convex Functions.
CoRR, 2024

Locally Computing Edge Orientations.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Omnipredictors for regression and the approximate rank of convex functions.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023
Unimodality of a refinement of Lassalle's sequence.
Discret. Math., July, 2023

2022
Erdős-Littlewood-Offord problem with arbitrary probabilities.
Discret. Math., 2022

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

2021
Lower bounds for superpatterns and universal sequences.
J. Comb. Theory A, 2021

Families with no perfect matchings.
Comb. Theory, 2021

2020
Tetris is NP-hard even with <i>O</i>(1) Rows or Columns.
J. Inf. Process., 2020

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


  Loading...