Alexandra Kolla

According to our database1, Alexandra Kolla authored at least 31 papers between 2008 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Special Section on the Fifty-Ninth Annual IEEE Symposium on Foundations of Computer Science (2018).
SIAM J. Comput., December, 2023

Approximately counting independent sets in dense bipartite graphs via subspace enumeration.
CoRR, 2023

2022
Computational thresholds for the fixed-magnetization Ising model.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Algorithms for the ferromagnetic Potts model on expanders.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming.
SIAM J. Discret. Math., 2021

2020
Spectral aspects of symmetric matrix signings.
Discret. Optim., 2020

Efficient algorithms for the Potts model on small-set expanders.
CoRR, 2020

Lower Bounds for Max-Cut via Semidefinite Programming.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Statistical Physics Approaches to Unique Games.
Proceedings of the 35th Computational Complexity Conference, 2020

2019
On the Expansion of Group-Based Lifts.
SIAM J. Discret. Math., 2019

Optimal Lower Bounds for Sketching Graph Cuts.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
A Ramsey-type Theorem on the Max-Cut Value of d-Regular Graphs.
CoRR, 2018

Spectrally Robust Graph Isomorphism.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2016
Largest Eigenvalue and Invertibility of Symmetric Matrix Signings.
CoRR, 2016

Approximation of non-boolean 2CSP.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Measuring and understanding throughput of network topologies.
Proceedings of the International Conference for High Performance Computing, 2016

2015
Multisection in the Stochastic Block Model using Semidefinite Programming.
CoRR, 2015

Unique Games on the Hypercube.
Chic. J. Theor. Comput. Sci., 2015

2014
Dimension-Free L<sub>2</sub> Maximal Inequality for Spherical Means in the Hypercube.
Theory Comput., 2014

Measuring throughput of data center network topologies.
Proceedings of the ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2014

High Throughput Data Center Topology Design.
Proceedings of the 11th USENIX Symposium on Networked Systems Design and Implementation, 2014

2013
Small Lifts of Expander Graphs are Expanding.
CoRR, 2013

2011
How to Play Unique Games against a Semi-Random Adversary
CoRR, 2011

Spectral Algorithms for Unique Games.
Comput. Complex., 2011

How to Play Unique Games Against a Semi-random Adversary: Study of Semi-random Models of Unique Games.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Sparsest Cut on Quotients of the Hypercube.
Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010
Subgraph sparsification and nearly optimal ultrasparsifiers.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

2009
Merging Techniques for Combinatorial Optimization: Spectral Graph Theory and Semidefinite Programming.
PhD thesis, 2009

On parallel composition of zero-knowledge proofs with black-box quantum simulators.
Quantum Inf. Comput., 2009

2008
Unique games on expanding constraint graphs are easy: extended abstract.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008


  Loading...