selected publications
-
conference proceeding
- Optimal Lowerbounds for Scketching Graph Cuts 2019
- Spectrally Robust Graph Isomorphism 2018
- Measuring and Understanding Throughput of Network Topologies. 761-772. 2016
-
How to Play Unique Games against a Semi-Random Adversary Study of Semi-Random Models of Unique Games.
Annual Symposium on Foundations of Computer Science.
443-452.
2011
-
Spectral Algorithms for Unique Games.
Computational Complexity.
177-206.
2010
-
Spectral Algorithms for Unique Games.
Proceedings of the Annual IEEE Conference on Computational Complexity.
122-130.
2010
- Subgraph Sparsification and Nearly Optimal Ultrasparsifiers. Annual ACM Symposium on Theory of Computing. 57-65. 2010
- Making classical honest verifier zero knowledge protocols secure against quantum attacks. Lecture Notes in Artificial Intelligence. 592-+. 2008
- Unique Games on Expanding Constraint Graphs are Easy. Annual ACM Symposium on Theory of Computing. 21-28. 2008
-
journal article
- Dimension-Free Ell_p-Maximal Inequalities in Z_{m+1}^n 2018
- ON PARALLEL COMPOSITION OF ZERO-KNOWLEDGE PROOFS WITH BLACK-BOX QUANTUM SIMULATORS. Quantum Information and Computation. 513-532. 2009