Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks. - Sean Hallgren; Alexandra Kolla; Pranab Sen; Shengyu Zhang (ICALP (2), 2008)

Unique games on expanding constraint graphs are easy: extended abstract. - Sanjeev Arora; Subhash Khot; Alexandra Kolla; David Steurer; Madhur Tulsiani; Nisheeth K. Vishnoi (STOC, 2008)

On parallel composition of zero-knowledge proofs with black-box quantum simulators. - Rahul Jain 001; Alexandra Kolla; Gatis Midrijanis; Ben W. Reichardt (Quantum Inf. Comput., 2009)

Merging Techniques for Combinatorial Optimization: Spectral Graph Theory and Semidefinite Programming. - Alexandra Kolla (2009)

Spectral Algorithms for Unique Games. - Alexandra Kolla (CCC, 2010)

Subgraph sparsification and nearly optimal ultrasparsifiers. - Alexandra Kolla; Yury Makarychev; Amin Saberi; Shang-Hua Teng (STOC, 2010)

Sparsest Cut on Quotients of the Hypercube. - Alexandra Kolla; James Lee (CATS, 2011)

How to Play Unique Games Against a Semi-random Adversary: Study of Semi-random Models of Unique Games. - Alexandra Kolla; Konstantin Makarychev; Yury Makarychev (FOCS, 2011)

How to Play Unique Games against a Semi-Random Adversary - Alexandra Kolla; Konstantin Makarychev; Yury Makarychev (CoRR, 2011)

Small Lifts of Expander Graphs are Expanding. - Naman Agarwal; Alexandra Kolla; Vivek Madan (CoRR, 2013)

High Throughput Data Center Topology Design. - Ankit Singla; Philip Brighten Godfrey; Alexandra Kolla (NSDI, 2014)

Measuring throughput of data center network topologies. - Sangeetha Abdu Jyothi; Ankit Singla; Brighten Godfrey; Alexandra Kolla (SIGMETRICS, 2014)

Dimension-Free L2 Maximal Inequality for Spherical Means in the Hypercube. - Aram W. Harrow; Alexandra Kolla; Leonard J. Schulman (Theory Comput., 2014)

Unique Games on the Hypercube. - Naman Agarwal; Guy Kindler; Alexandra Kolla; Luca Trevisan 001 (Chic. J. Theor. Comput. Sci., 2015)

Multisection in the Stochastic Block Model using Semidefinite Programming. - Naman Agarwal; Afonso S. Bandeira; Konstantinos Koiliaris; Alexandra Kolla (CoRR, 2015)

Measuring and understanding throughput of network topologies. - Sangeetha Abdu Jyothi; Ankit Singla; Brighten Godfrey; Alexandra Kolla (SC, 2016)

Approximation of non-boolean 2CSP. - Guy Kindler; Alexandra Kolla; Luca Trevisan 001 (SODA, 2016)

Largest Eigenvalue and Invertibility of Symmetric Matrix Signings. - Charles Carlson 002; Karthekeyan Chandrasekaran; Hsien-Chih Chang; Alexandra Kolla (CoRR, 2016)

On the Expansion of Group-Based Lifts. - Naman Agarwal; Karthekeyan Chandrasekaran; Alexandra Kolla; Vivek Madan (APPROX-RANDOM, 2017)

Spectrally Robust Graph Isomorphism. - Alexandra Kolla; Ioannis Koutis; Vivek Madan; Ali Kemal Sinop (ICALP, 2018)

A Ramsey-type Theorem on the Max-Cut Value of d-Regular Graphs. - Charles Carlson 002; Alexandra Kolla; Luca Trevisan 001 (CoRR, 2018)

Spectral Aspects of Symmetric Matrix Signings. - Charles Carlson 002; Karthekeyan Chandrasekaran; Hsien-Chih Chang; Naonori Kakimura; Alexandra Kolla (MFCS, 2019)

Optimal Lower Bounds for Sketching Graph Cuts. - Charles Carlson 002; Alexandra Kolla; Nikhil Srivastava; Luca Trevisan 001 (SODA, 2019)

Statistical Physics Approaches to Unique Games. - Matthew Coulson; Ewan Davies; Alexandra Kolla; Viresh Patel; Guus Regts (CCC, 2020)

Lower Bounds for Max-Cut via Semidefinite Programming. - Charles Carlson 002; Alexandra Kolla; Ray Li; Nitya Mani; Benny Sudakov; Luca Trevisan 001 (LATIN, 2020)

Efficient algorithms for the Potts model on small-set expanders. - Charles Carlson 002; Ewan Davies; Alexandra Kolla (CoRR, 2020)

Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming. - Charles Carlson 002; Alexandra Kolla; Ray Li; Nitya Mani; Benny Sudakov; Luca Trevisan 001 (SIAM J. Discret. Math., 2021)

Algorithms for the ferromagnetic Potts model on expanders. - Charlie Carlson; Ewan Davies; Nicolas Fraiman; Alexandra Kolla; Aditya Potukuchi; Corrine Yap (FOCS, 2022)

Computational thresholds for the fixed-magnetization Ising model. - Charlie Carlson; Ewan Davies; Alexandra Kolla; Will Perkins 001 (STOC, 2022)

Approximately counting independent sets in dense bipartite graphs via subspace enumeration. - Charlie Carlson; Ewan Davies; Alexandra Kolla; Aditya Potukuchi (CoRR, 2023)

Special Section on the Fifty-Ninth Annual IEEE Symposium on Foundations of Computer Science (2018). - Elette Boyle; Vincent Cohen-Addad; Alexandra Kolla; Mikkel Thorup (SIAM J. Comput., 2023)

A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs. - Charlie Carlson; Ewan Davies; Alexandra Kolla; Aditya Potukuchi (ICALP, 2024)