Seguir
Mihir Singhal
Mihir Singhal
UC Berkeley
E-mail confirmado em berkeley.edu - Página inicial
Título
Citado por
Citado por
Ano
Low-degree multicalibration
P Gopalan, MP Kim, MA Singhal, S Zhao
Conference on Learning Theory, 3193-3234, 2022
372022
Tetris is NP-hard even with O (1) rows or columns
S Asif, M Coulombe, ED Demaine, ML Demaine, A Hesterberg, J Lynch, ...
Journal of Information Processing 28, 942-958, 2020
14*2020
Lower bounds for superpatterns and universal sequences
Z Chroman, M Kwan, M Singhal
Journal of Combinatorial Theory, Series A 182, 105467, 2021
72021
Computations associated with the resonance arrangement
Z Chroman, M Singhal
arXiv preprint arXiv:2106.09940, 2021
62021
Erdos-Littlewood-Offord problem with arbitrary probabilities
M Singhal
Discrete Mathematics 345 (11), 113005, 2022
52022
Unimodality of a refinement of Lassalle's sequence
M Singhal
Discrete Mathematics 346 (7), 113317, 2023
42023
Omnipredictors for regression and the approximate rank of convex functions
P Gopalan, P Okoroafor, P Raghavendra, A Shetty, M Singhal
The Thirty Seventh Annual Conference on Learning Theory, 2027-2070, 2024
22024
Optimal quantile estimation: beyond the comparison model
M Gupta, M Singhal, H Wu
arXiv preprint arXiv:2404.03847, 2024
12024
Tight bounds for stream decodable error-correcting codes
M Gupta, V Guruswami, M Singhal
arXiv preprint arXiv:2407.06446, 2024
2024
Locally Computing Edge Orientations
S Mitrović, R Rubinfeld, M Singhal
32nd Annual European Symposium on Algorithms (ESA 2024), 2024
2024
Families with no perfect matchings
M Singhal
Combinatorial Theory 1, 2021
2021
Generalizations of Hall-Littlewood Polynomials
M Singhal, C Ryba
2017
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–12