Unique games on expanding constraint graphs are easy S Arora, SA Khot, A Kolla, D Steurer, M Tulsiani, NK Vishnoi Proceedings of the fortieth annual ACM symposium on Theory of computing, 21-28, 2008 | 115 | 2008 |

Subgraph sparsification and nearly optimal ultrasparsifiers A Kolla, Y Makarychev, A Saberi, SH Teng Proceedings of the forty-second ACM symposium on Theory of computing, 57-66, 2010 | 63 | 2010 |

Measuring and understanding throughput of network topologies SA Jyothi, A Singla, PB Godfrey, A Kolla SC'16: Proceedings of the International Conference for High Performance …, 2016 | 55 | 2016 |

High throughput data center topology design A Singla, PB Godfrey, A Kolla 11th {USENIX} Symposium on Networked Systems Design and Implementation …, 2014 | 55 | 2014 |

Spectral algorithms for unique games A Kolla computational complexity 20 (2), 177-206, 2011 | 52 | 2011 |

Multisection in the stochastic block model using semidefinite programming N Agarwal, AS Bandeira, K Koiliaris, A Kolla Compressed Sensing and its Applications, 125-162, 2017 | 42 | 2017 |

How to play unique games against a semi-random adversary: Study of semi-random models of unique games A Kolla, K Makarychev, Y Makarychev 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 443-452, 2011 | 38 | 2011 |

Making classical honest verifier zero knowledge protocols secure against quantum attacks S Hallgren, A Kolla, P Sen, S Zhang International Colloquium on Automata, Languages, and Programming, 592-603, 2008 | 21 | 2008 |

Playing random and expanding unique games A Kolla, M Tulsiani Unpublished manuscript available from the authors’ webpages, to appear in …, 2007 | 15 | 2007 |

Dimension-free L2 maximal inequality for spherical means in the hypercube AW Harrow, A Kolla, LJ Schulman arXiv preprint arXiv:1209.4148, 2012 | 11 | 2012 |

Measuring throughput of data center network topologies SA Jyothi, A Singla, PB Godfrey, A Kolla The 2014 ACM international conference on Measurement and modeling of …, 2014 | 9 | 2014 |

Multisection in the stochastic block model using semidefinite programming. arXiv 1507.02323 N Agarwal, AS Bandeira, K Koiliaris, A Kolla July, 2015 | 8 | 2015 |

Optimal lower bounds for sketching graph cuts C Carlson, A Kolla, N Srivastava, L Trevisan Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 6 | 2019 |

Approximation of non-boolean 2CSP G Kindler, A Kolla, L Trevisan Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 5 | 2016 |

Small lifts of expander graphs are expanding N Agarwal, A Kolla, V Madan arXiv preprint arXiv:1311.3268, 2013 | 5 | 2013 |

On the expansion of group-based lifts N Agarwal, K Chandrasekaran, A Kolla, V Madan Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2017 | 4 | 2017 |

On the expansion of group-based lifts N Agarwal, K Chandrasekaran, A Kolla, V Madan arXiv preprint arXiv:1311.3268, 2013 | 4 | 2013 |

Sparsest cut on quotients of the hypercube A Kolla, JR Lee Proceedings of the Seventeenth Computing: The Australasian Theory Symposium …, 2011 | 4 | 2011 |

On parallel composition of zero-knowledge proofs with black-box quantum simulators R Jain, A Kolla, G Midrijanis, BW Reichardt arXiv preprint quant-ph/0607211, 2006 | 3 | 2006 |

Efficient algorithms for the Potts model on small-set expanders C Carlson, E Davies, A Kolla arXiv preprint arXiv:2003.01154, 2020 | 2 | 2020 |