( en | de | ru )

 

Disambiguation of "Tulsiani, Madhur"

Author of the publication

copydeleteadd this publication to your clipboard
Explicit Abelian Lifts and Quantum LDPC Codes.

, , , , and . ITCS, volume 215 of LIPIcs, page 88:1-88:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Shubham Tulsiani

 

Other publications of authors with the same name

On the Optimality of a Class of LP-based Algorithms., , , and . Electron. Colloquium Comput. Complex., (2009)Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution., , and . Electron. Colloquium Comput. Complex., (2008)The Complexity of Somewhat Approximation Resistant Predicates., , and . Electron. Colloquium Comput. Complex., (2012)Separating the NP-Hardness of the Grothendieck Problem from the Little-Grothendieck Problem., , and . ITCS, volume 215 of LIPIcs, page 22:1-22:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)List Decoding of Direct Sum Codes., , , , and . SODA, page 1412-1425. SIAM, (2020)Near-linear time decoding of Ta-Shma's codes via splittable regularity., , and . STOC, page 1527-1536. ACM, (2021)Towards an optimal query efficient PCP?, , and . ITCS, page 173-186. ACM, (2013)Optimal Sherali-Adams Gaps from Pairwise Independence., , and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 125-139. Springer, (2009)Proving Weak Approximability Without Algorithms., and . APPROX-RANDOM, volume 60 of LIPIcs, page 20:1-20:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Quadratic Goldreich-Levin Theorems., and . FOCS, page 619-628. IEEE Computer Society, (2011)