Madhur Tulsiani

Available identifiers

zbMath Open tulsiani.madhurMaRDI QIDQ2802522

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6126248	2024-04-09	Paper
https://portal.mardi4nfdi.de/entity/Q6126329	2024-04-09	Paper
Near-linear time decoding of Ta-Shma’s codes via splittable regularity	2023-11-14	Paper
Ellipsoid fitting up to constant via empirical covariance estimation	2023-07-20	Paper
Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms	2023-04-04	Paper
Concentration of polynomial random matrices via Efron-Stein inequalities	2022-09-06	Paper
List Decoding of Direct Sum Codes	2021-02-02	Paper
Finding Pseudorandom Colorings of Pseudorandom Graphs	2020-11-25	Paper
Explicit SoS lower bounds from high-dimensional expanders	2020-09-10	Paper
From weak to strong LP gaps for all CSPs	2020-05-26	Paper
Approximability of \(p\rightarrow q\) matrix norms: generalized Krivine rounding and hypercontractive hardness	2019-10-15	Paper
From weak to strong linear programming gaps for all constraint satisfaction problems	2018-06-15	Paper
Proving weak approximability without algorithms	2018-04-19	Paper
Approximating Operator Norms via Generalized Krivine Rounding	2018-04-10	Paper
https://portal.mardi4nfdi.de/entity/Q4607924	2018-03-15	Paper
Algorithmic regularity for polynomials and applications	2017-10-05	Paper
On LP-based approximability for strict CSPs	2017-09-29	Paper
Algorithms and hardness for subspace approximation	2017-09-29	Paper
Towards an optimal query efficient PCP?	2017-05-16	Paper
Graph densification	2016-10-07	Paper
Convex relaxations and integrality gaps	2016-04-26	Paper
A characterization of strong approximation resistance	2015-06-26	Paper
CSP gaps and reductions in the lasserre hierarchy	2015-02-04	Paper
Quadratic Goldreich-Levin theorems	2014-07-30	Paper
Quadratic Goldreich-Levin theorems	2014-07-30	Paper
Sampling-based proofs of almost-periodicity results and algorithmic applications	2014-07-01	Paper
The Complexity of Somewhat Approximation Resistant Predicates	2014-07-01	Paper
Linear Programming Hierarchies Suffice for Directed Steiner Tree	2014-06-02	Paper
SDP gaps from pairwise independence	2012-09-27	Paper
Improved pseudorandom generators for depth 2 circuits	2010-09-10	Paper
SDP gaps for 2-to-1 and other Label-Cover variants	2010-09-07	Paper
Time space tradeoffs for attacks against one-way functions and PRGs	2010-08-24	Paper
Optimal Sherali-Adams Gaps from Pairwise Independence	2009-10-28	Paper
https://portal.mardi4nfdi.de/entity/Q3549626	2009-01-05	Paper
New Proofs of the Green-Tao-Ziegler Dense Model Theorem: An Exposition	2008-06-02	Paper

Research outcomes over time

This page was built for person: Madhur Tulsiani