Author of the publication

From low-distortion norm embeddings to explicit uncertainty relations and efficient information locking.

, , and . STOC, page 773-782. ACM, (2011)

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.

 

Other publications of authors with the same name

The NOF Multiparty Communication Complexity of Composed Functions., , , and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 13-24. Springer, (2012)Bounds on Lyapunov exponents., , and . CoRR, (2019)Tight Approximation Bounds for Maximum Multi-Coverage., , , and . CoRR, (2019)Robustness of classifiers to uniform $\ell_p$ and Gaussian noise., , and . AISTATS, volume 84 of Proceedings of Machine Learning Research, page 1280-1288. PMLR, (2018)Semidefinite Programs for Randomness Extractors., , and . TQC, volume 44 of LIPIcs, page 73-91. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Quantum Bilinear Optimization., , and . SIAM J. Optimization, 26 (3): 1529-1564 (2016)Tight Approximation Bounds for Maximum Multi-coverage., , , and . IPCO, volume 12125 of Lecture Notes in Computer Science, page 66-77. Springer, (2020)A Lower Bound on the Space Overhead of Fault-Tolerant Quantum Computation., , and . ITCS, volume 215 of LIPIcs, page 68:1-68:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Quasi-Polynomial Time Algorithms for Free Quantum Games in Bounded Dimension., , , and . ICALP, volume 198 of LIPIcs, page 82:1-82:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Approximation algorithms for classical-quantum channel coding., , and . ISIT, page 2569-2573. IEEE, (2019)