default search action
Alexandra Kolla
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c19]Charlie Carlson, Ewan Davies
, Alexandra Kolla, Aditya Potukuchi:
A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs. ICALP 2024: 35:1-35:18 - 2023
- [j8]Elette Boyle, Vincent Cohen-Addad, Alexandra Kolla, Mikkel Thorup
Special Section on the Fifty-Ninth Annual IEEE Symposium on Foundations of Computer Science (2018). SIAM J. Comput. 52(6): S18- (2023) - [i19]Charlie Carlson, Ewan Davies, Alexandra Kolla, Aditya Potukuchi:
Approximately counting independent sets in dense bipartite graphs via subspace enumeration. CoRR abs/2307.09533 (2023) - 2022
- [c18]Charlie Carlson, Ewan Davies
Algorithms for the ferromagnetic Potts model on expanders. FOCS 2022: 344-355 - [c17]Charlie Carlson, Ewan Davies
Computational thresholds for the fixed-magnetization Ising model. STOC 2022: 1459-1472 - [i18]Charlie Carlson, Ewan Davies, Nicolas Fraiman, Alexandra Kolla, Aditya Potukuchi, Corrine Yap:
Algorithms for the ferromagnetic Potts model on expanders. CoRR abs/2204.01923 (2022) - 2021
- [j7]Charles Carlson, Alexandra Kolla, Ray Li
Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming. SIAM J. Discret. Math. 35(3): 1557-1568 (2021) - [i17]Charlie Carlson, Ewan Davies, Alexandra Kolla, Will Perkins:
Computational thresholds for the fixed-magnetization Ising model. CoRR abs/2111.03033 (2021) - 2020
- [j6]Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla:
Spectral aspects of symmetric matrix signings. Discret. Optim. 37: 100582 (2020) - [c16]Matthew Coulson, Ewan Davies
Statistical Physics Approaches to Unique Games. CCC 2020: 13:1-13:27 - [c15]Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan:
Lower Bounds for Max-Cut via Semidefinite Programming. LATIN 2020: 479-490 - [i16]Charles Carlson, Ewan Davies, Alexandra Kolla:
Efficient algorithms for the Potts model on small-set expanders. CoRR abs/2003.01154 (2020)
2010 – 2019
- 2019
- [j5]Naman Agarwal, Karthekeyan Chandrasekaran, Alexandra Kolla, Vivek Madan:
On the Expansion of Group-Based Lifts. SIAM J. Discret. Math. 33(3): 1338-1373 (2019) - [c14]Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla:
Spectral Aspects of Symmetric Matrix Signings. MFCS 2019: 81:1-81:13 - [c13]Charles Carlson, Alexandra Kolla, Nikhil Srivastava, Luca Trevisan
Optimal Lower Bounds for Sketching Graph Cuts. SODA 2019: 2565-2569 - [i15]Matthew Coulson, Ewan Davies, Alexandra Kolla, Viresh Patel, Guus Regts:
Statistical physics approaches to Unique Games. CoRR abs/1911.01504 (2019) - 2018
- [c12]Alexandra Kolla, Ioannis Koutis
Spectrally Robust Graph Isomorphism. ICALP 2018: 84:1-84:13 - [i14]Alexandra Kolla, Ioannis Koutis, Vivek Madan, Ali Kemal Sinop:
Spectrally Robust Graph Isomorphism. CoRR abs/1805.00181 (2018) - [i13]Charles Carlson, Alexandra Kolla, Luca Trevisan:
A Ramsey-type Theorem on the Max-Cut Value of d-Regular Graphs. CoRR abs/1810.10044 (2018) - 2017
- [c11]Naman Agarwal, Karthekeyan Chandrasekaran, Alexandra Kolla, Vivek Madan:
On the Expansion of Group-Based Lifts. APPROX-RANDOM 2017: 24:1-24:13 - [i12]Charles Carlson, Alexandra Kolla, Nikhil Srivastava, Luca Trevisan:
Optimal Lower Bounds for Sketching Graph Cuts. CoRR abs/1712.10261 (2017) - 2016
- [c10]Sangeetha Abdu Jyothi
Measuring and understanding throughput of network topologies. SC 2016: 761-772 - [c9]Guy Kindler, Alexandra Kolla, Luca Trevisan:
Approximation of non-boolean 2CSP. SODA 2016: 1705-1714 - [i11]Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Alexandra Kolla:
Largest Eigenvalue and Invertibility of Symmetric Matrix Signings. CoRR abs/1611.03624 (2016) - 2015
- [j4]Naman Agarwal, Guy Kindler, Alexandra Kolla, Luca Trevisan:
Unique Games on the Hypercube. Chic. J. Theor. Comput. Sci. 2015 (2015) - [i10]Guy Kindler, Alexandra Kolla, Luca Trevisan:
Approximation of non-boolean 2CSP. CoRR abs/1504.00681 (2015) - [i9]Naman Agarwal, Afonso S. Bandeira, Konstantinos Koiliaris, Alexandra Kolla:
Multisection in the Stochastic Block Model using Semidefinite Programming. CoRR abs/1507.02323 (2015) - 2014
- [j3]Aram W. Harrow
Dimension-Free L2 Maximal Inequality for Spherical Means in the Hypercube. Theory Comput. 10: 55-75 (2014) - [c8]Ankit Singla, Philip Brighten Godfrey, Alexandra Kolla:
High Throughput Data Center Topology Design. NSDI 2014: 29-41 - [c7]Sangeetha Abdu Jyothi
Measuring throughput of data center network topologies. SIGMETRICS 2014: 597-598 - [i8]Sangeetha Abdu Jyothi, Ankit Singla, Brighten Godfrey, Alexandra Kolla:
Measuring and Understanding Throughput of Network Topologies. CoRR abs/1402.2531 (2014) - [i7]Naman Agarwal, Guy Kindler, Alexandra Kolla, Luca Trevisan:
Unique Games on the Hypercube. CoRR abs/1405.1374 (2014) - 2013
- [i6]Ankit Singla, Brighten Godfrey, Alexandra Kolla:
High Throughput Data Center Topology Design. CoRR abs/1309.7066 (2013) - [i5]Naman Agarwal, Alexandra Kolla, Vivek Madan:
Small Lifts of Expander Graphs are Expanding. CoRR abs/1311.3268 (2013) - 2011
- [j2]Alexandra Kolla:
Spectral Algorithms for Unique Games. Comput. Complex. 20(2): 177-206 (2011) - [c6]Alexandra Kolla, James Lee:
Sparsest Cut on Quotients of the Hypercube. CATS 2011: 11-22 - [c5]Alexandra Kolla, Konstantin Makarychev, Yury Makarychev:
How to Play Unique Games Against a Semi-random Adversary: Study of Semi-random Models of Unique Games. FOCS 2011: 443-452 - [i4]Alexandra Kolla:
Spectral Algorithms for Unique Games. CoRR abs/1102.2300 (2011) - [i3]Alexandra Kolla, Konstantin Makarychev, Yury Makarychev:
How to Play Unique Games against a Semi-Random Adversary. CoRR abs/1104.3806 (2011) - 2010
- [c4]Alexandra Kolla:
Spectral Algorithms for Unique Games. CCC 2010: 122-130 - [c3]Alexandra Kolla, Yury Makarychev, Amin Saberi, Shang-Hua Teng:
Subgraph sparsification and nearly optimal ultrasparsifiers. STOC 2010: 57-66 - [i2]Alexandra Kolla:
Spectral Algorithms for Unique Games. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [b1]Alexandra Kolla:
Merging Techniques for Combinatorial Optimization: Spectral Graph Theory and Semidefinite Programming. University of California, Berkeley, USA, 2009 - [j1]Rahul Jain, Alexandra Kolla, Gatis Midrijanis, Ben W. Reichardt:
On parallel composition of zero-knowledge proofs with black-box quantum simulators. Quantum Inf. Comput. 9(5&6): 513-532 (2009) - [i1]Alexandra Kolla, Yury Makarychev, Amin Saberi, Shang-Hua Teng:
Subgraph Sparsification and Nearly Optimal Ultrasparsifiers. CoRR abs/0912.1623 (2009) - 2008
- [c2]Sean Hallgren, Alexandra Kolla, Pranab Sen, Shengyu Zhang:
Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks. ICALP (2) 2008: 592-603 - [c1]Sanjeev Arora, Subhash Khot, Alexandra Kolla, David Steurer
Unique games on expanding constraint graphs are easy: extended abstract. STOC 2008: 21-28
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: