Author of the publication

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

Caching with expiration times., , , , and . SODA, page 540-547. ACM/SIAM, (2002)Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing., , and . SIAM J. Comput., 43 (3): 1184-1205 (2014)Random Walks in Polytopes and Negative Dependence., , and . ITCS, volume 67 of LIPIcs, page 50:1-50:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)On Geodesically Convex Formulations for the Brascamp-Lieb Constant., and . CoRR, (2018)Hardness of Approximating the Closest Vector Problem with Pre-Processing., , , and . Comput. Complex., 20 (4): 741-753 (2011)On the Fourier spectrum of symmetric Boolean functions., , , , and . Combinatorica, 29 (3): 363-387 (2009)Improved Algorithm for Degree Bounded Survivable Network Design Problem., and . SWAT, volume 6139 of Lecture Notes in Computer Science, page 408-419. Springer, (2010)Fair Online Advertising., , and . CoRR, (2019)The mixing time of the Dikin walk in a polytope - A simple proof., and . Oper. Res. Lett., 44 (5): 630-634 (2016)A Dynamics for Advertising on Networks., , and . WINE, volume 10660 of Lecture Notes in Computer Science, page 88-102. Springer, (2017)