( en | de | ru )

 

Disambiguation of "Guruswami, Venkatesan"

Author of the publication

copydeleteadd this publication to your clipboard
Approximability of p → q Matrix Norms: Generalized Krivine Rounding and Hypercontractive Hardness.

, , , , and . SODA, page 1358-1368. SIAM, (2019)

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.

Venkatesan Guruswami

Venkatesan Guruswami

Chandrasekara Venkatesan

Radhika Venkatesan

Aravind Venkatesan

 

Other publications of authors with the same name

The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231)., , and . Dagstuhl Reports, 8 (6): 1-18 (2018)Strongly refuting all semi-random Boolean CSPs., , and . CoRR, (2020)Linear Shannon Capacity of Cayley Graphs., and . CoRR, (2020)General Strong Polarization., , , , and . J. ACM, 69 (2): 11:1-11:67 (2022)The Power of the Combined Basic LP and Affine Relaxation for Promise CSPs., , , and . Electron. Colloquium Comput. Complex., (2020)Revisiting a Lower Bound on the Redundancy of Linear Batch Codes., and . Electron. Colloquium Comput. Complex., (2021)Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations., , and . SIAM J. Comput., 51 (3): 577-626 (2022)Beating Fredman-Komlós for Perfect k-Hashing., and . ICALP, volume 132 of LIPIcs, page 92:1-92:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On expanding the toolkit of locality-based coded computation to the coordinates of inputs., , and . ISIT, page 2171-2176. IEEE, (2023)d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors., and . ICALP, volume 168 of LIPIcs, page 62:1-62:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)