( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Outlier Robust Multivariate Polynomial Regression.

, , , , и . ESA, том 308 из LIPIcs, стр. 12:1-12:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)

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.

Venkatesan Guruswami

Venkatesan Guruswami

Chandrasekara Venkatesan

Radhika Venkatesan

Aravind Venkatesan

 

Другие публикации лиц с тем же именем

Exponential Time Approximation for Coloring 3-Colorable Graphs., и . CoRR, (2024)Randomly Punctured Reed-Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields., , и . STOC, стр. 1458-1469. ACM, (2024)Quickly-Decodable Group Testing with Fewer Tests: Price-Scarlett and Cheraghchi-Nakos's Nonadaptive Splitting with Explicit Scalars., , и . CoRR, (2024)Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH., , , , и . Electron. Colloquium Comput. Complex., (2024)Beating Fredman-Komlós for Perfect k-Hashing., и . ICALP, том 132 из LIPIcs, стр. 92:1-92:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors., и . ICALP, том 168 из LIPIcs, стр. 62:1-62:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Isolate and then Identify: Rethinking Adaptive Group Testing., и . ISIT, стр. 3231-3236. IEEE, (2024)Punctured Large Distance Codes, and Many Reed-Solomon Codes, Achieve List-Decoding Capacity., и . Electron. Colloquium Comput. Complex., (2021)Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations., , и . SIAM J. Comput., 51 (3): 577-626 (2022)On expanding the toolkit of locality-based coded computation to the coordinates of inputs., , и . ISIT, стр. 2171-2176. IEEE, (2023)