Alexandra Kolla

I am an Associate Professor at the Computer Science Department at CU Boulder.
I got my PhD at U.C. Berkeley. My advisor was Umesh Vazirani. After that, I did a postdoc at the Institute for Advanced Study and at Microsoft Research in Redmond. Before joining CU Boulder, I was a professor at UIUC.

Research interests: Spectral Graph Theory, Algorithms, Complexity, Convex Programming, Quantum Computing.

I am particularly interested in the use of spectral methods in graph algorithms
and more so in developing new spectral techniques that use the full power
of graph spectra (for example, see this paper). I believe that such techniques
will help shed light into various unanswered complexity questions, like
the Unique Games Conjecture.

Contact Information:
Alexandra.kolla [at] colorado [dot] edu
#122 ECES
Engineering Building,

CU Boulder Campus

Teaching at CU

Fall 2018, Complexity Theory, CSCI 7000-005.

Spring 2018, Discrete Structures, CSCI 2824.


      1. A Ramsey-Type theorem on the Max-Cut value of d-Regular graphs. With Charles Carlson and Luca Trevisan.
        Submitted, 2018.

      2. Optimal Lowerbounds for Scketching Graph Cuts. With Charles Carlson, Nikhil Srivastava, and Luca Trevisan.
        To Appear in SODA, 2019.

      3. Dimension-Free \Ell_p-Maximal Inequalities in Z_{m+1}^n. With Jordan Greenblatt and Ben Krause.
        To Appear, Journal of International Mathematics Research Notices, 2018.

      4. Spectrally Robust Graph Isomorphism. With Yannis Koutis, Vivek Madan, Ali Sinop.
        ICALP, 2018.

      5. Invertibility and Largest Eigenvalue of Symmetric Matrix Signings. With Charles Carlson, Karthekeyan Chandrasekaran and Hsien-Chih Chang.
        Submitted, 2018.

      6. On the Expansion of Group-Based Lifts. With Naman Agarwal, Karthekeyan Chandrasekaran and Vivek Madan.
        RANDOM, 2017.

      7. Measuring and Understanding Throughput of Network Topologies. With Sangeetha Abdu Jyothi, Ankit Singla and P. Brighten Godfrey.
        ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis 2016 (SC'16).

      8. Approximation of Non-Boolean 2-CSP. With Guy Kindler and Luca Trevisan.
        SODA, 2016.

      9. Multisection in the Stochastic Block Model Using Semidefinite Programming. With Naman Agarwal, Afonso Bandeira and Konstantinos Koiliaris.
        Book chapter in the book ``Compressed Sensing and its Applications'', Birkhauser; Auflage, 2016.

      10. Unique Games on The Hypercube. With Naman Agarwal, Guy Kindler and Luca Trevisan.
        Published in The Chicago Journal of Theoretical Computer Science, 2014.

      11. Measuring and Understanding Throughput of Network Topologies. With Sanjeetha Abdu Jyothi, Ankit Singla and Brighten Godfrey.
        Short Paper, SIGMETRICS 2014.

      12. Small Lifts of Expander Graphs are Expanding. With Naman Agarwal and Vivek Madhan.
        Submitted, 2014.

      13. High Throughput Data Center Topology Design.
        With Ankit Singla and Brighten Godfrey.
        NSDI 2014.

      14. Specta of Random Graphs With Planted Partitions.
        With Sanjoy Dasgupta and Konstantinos Koiliaris.
        Manuscript, 2013.

      15. Maximal Inequality for Sperical Means on the Hypercube.
        With Aram Harrow and Leonard Schulman.
        Published in the Special Issue of the Journal of Theory of Computing, 2013.
        Appeared on popular mathematics blog.

      16. How to Play Unique Games Against a Semi-Random Adversary.
        With Konstantin Makarychev and Yury Makarychev.
        FOCS 2011.

      17. Sparsest Cut on quotients of the hypercube.
        With James Lee.
        CATS 2011.

      18. Spectral Algorithms for Unique Games.
        CCC 2010. Invited to CCC 2010 journal, Special Issue.

      19. Subgraph Sparsification and Nearly Optimal Ultrasparsifiers.
        With Yury Makarychev, Amin Saberi, Shang-hua Teng.
        STOC 2010.

      20. Unique Games on Expanding Constraint Graphs are Easy.
        With Sanjeev Arora, Subhash Khot, David Steurer, Madhur Tulsiani and Nisheeth Vishnoi.
        STOC 2008.

      21. Playing Unique Games Using Graph Spectra.
        With Madhur Tulsiani.
        Manuscript, 2007.

      22. Making classical honest verifier protocols secure against quantum attacks.
        with Sean Hallgren, Pranab Sen and Shengyu Zhang.

      23. On parallel composition of zero-knowledge proofs with black-box quantum simulators
        with Rahul Jain, Gatis Midrijanis, and Ben Reichardt.
        QIC Journal, 2007.

      P.h.D Thesis

      1. Merging Techniques for Combinatorial Optimization: Spectral Graph Theory and Semidefinite Programming.


        1. Naman Agarwal: Masters Student, 2012 - 2014.
        2. David Hannasch: Masters Student, 2012 - 2014.
        3. Konstantinos Koiliaris: PhD Student, 2013 - 2016.
        4. Charles Carlson: PhD Student, 2016 - Present.
        5. Hsien Chih-Chang: Research Assistant, 2015-2017.


      Program Comittees

      1. SODA 2014
      2. FOCS 2016
      3. FOCS 2018