Madhur Tulsiani

From MaRDI portal
Person:2802522



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
scientific article; zbMATH DE number 7829254 (Why is no real title available?)2024-04-09Paper
scientific article; zbMATH DE number 7829320 (Why is no real title available?)
(available as arXiv preprint)
2024-04-09Paper
Near-linear time decoding of Ta-Shma’s codes via splittable regularity
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
2023-11-14Paper
Ellipsoid fitting up to constant via empirical covariance estimation2023-07-20Paper
Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms
SIAM Journal on Computing
2023-04-04Paper
Concentration of polynomial random matrices via Efron-Stein inequalities2022-09-06Paper
List Decoding of Direct Sum Codes
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms
2021-02-02Paper
Finding Pseudorandom Colorings of Pseudorandom Graphs2020-11-25Paper
Explicit SoS lower bounds from high-dimensional expanders2020-09-10Paper
From weak to strong LP gaps for all CSPs
(available as arXiv preprint)
2020-05-26Paper
Approximability of \(p\rightarrow q\) matrix norms: generalized Krivine rounding and hypercontractive hardness
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-10-15Paper
From weak to strong linear programming gaps for all constraint satisfaction problems
Theory of Computing
2018-06-15Paper
Proving weak approximability without algorithms2018-04-19Paper
Approximating Operator Norms via Generalized Krivine Rounding2018-04-10Paper
scientific article; zbMATH DE number 6850352 (Why is no real title available?)2018-03-15Paper
Algorithmic regularity for polynomials and applications
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms
2017-10-05Paper
On LP-based approximability for strict CSPs2017-09-29Paper
Algorithms and hardness for subspace approximation2017-09-29Paper
Towards an optimal query efficient PCP?
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
2017-05-16Paper
Graph densification
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
2016-10-07Paper
Convex relaxations and integrality gaps
International Series in Operations Research & Management Science
2016-04-26Paper
A characterization of strong approximation resistance
Proceedings of the forty-sixth annual ACM symposium on Theory of computing
2015-06-26Paper
CSP gaps and reductions in the lasserre hierarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
2015-02-04Paper
Quadratic Goldreich-Levin theorems
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
2014-07-30Paper
Quadratic Goldreich-Levin theorems
SIAM Journal on Computing
2014-07-30Paper
Sampling-based proofs of almost-periodicity results and algorithmic applications
Automata, Languages, and Programming
2014-07-01Paper
The Complexity of Somewhat Approximation Resistant Predicates
Automata, Languages, and Programming
2014-07-01Paper
Linear Programming Hierarchies Suffice for Directed Steiner Tree
Integer Programming and Combinatorial Optimization
2014-06-02Paper
SDP gaps from pairwise independence
Theory of Computing
2012-09-27Paper
Improved pseudorandom generators for depth 2 circuits
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
2010-09-10Paper
SDP gaps for 2-to-1 and other Label-Cover variants
Automata, Languages and Programming
2010-09-07Paper
Time space tradeoffs for attacks against one-way functions and PRGs
Advances in Cryptology – CRYPTO 2010
2010-08-24Paper
Optimal Sherali-Adams Gaps from Pairwise Independence
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
2009-10-28Paper
scientific article; zbMATH DE number 5485464 (Why is no real title available?)2009-01-05Paper
New Proofs of the Green-Tao-Ziegler Dense Model Theorem: An Exposition2008-06-02Paper


Research outcomes over time


This page was built for person: Madhur Tulsiani