| 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 | 19 | 2019 |
| Improving the smoothed complexity of FLIP for max cut problems A Bibak, C Carlson, K Chandrasekaran ACM Transactions on Algorithms (TALG) 17 (3), 1-38, 2021 | 18 | 2021 |
| Search-and rescue robots for integrated research and education in cyber-physical systems O Lawlor, M Moss, S Kibler, C Carlson, S Bond, S Bogosyan 2013 7th IEEE International Conference on e-Learning in Industrial …, 2013 | 17 | 2013 |
| Efficient algorithms for the Potts model on small-set expanders C Carlson, E Davies, A Kolla arXiv preprint arXiv:2003.01154, 2020 | 16 | 2020 |
| Algorithms for the ferromagnetic Potts model on expanders C Carlson, E Davies, N Fraiman, A Kolla, A Potukuchi, C Yap 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 12 | 2022 |
| Lower Bounds for Max-Cut in -Free Graphs via Semidefinite Programming C Carlson, A Kolla, R Li, N Mani, B Sudakov, L Trevisan SIAM Journal on Discrete Mathematics 35 (3), 1557-1568, 2021 | 9* | 2021 |
| Computational thresholds for the fixed-magnetization Ising model C Carlson, E Davies, A Kolla, W Perkins Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 7 | 2022 |
| Improved Distributed Algorithms for Random Colorings C Carlson, D Frishberg, E Vigoda arXiv preprint arXiv:2309.07859, 2023 | 2 | 2023 |
| Lower bounds for max-cut via semidefinite programming C Carlson, A Kolla, R Li, N Mani, B Sudakov, L Trevisan Latin American Symposium on Theoretical Informatics, 479-490, 2020 | 2 | 2020 |
| Invertibility and largest eigenvalue of symmetric matrix signings C Carlson, K Chandrasekaran, HC Chang, A Kolla arXiv preprint arXiv:1611.03624, 2016 | 2 | 2016 |
| Comparing a classical and quantum one round algorithm on LocalMaxCut C Carlson, Z Jorquera, A Kolla, S Kordonowy arXiv preprint arXiv:2304.08420, 2023 | 1 | 2023 |
| Spectral aspects of symmetric matrix signings C Carlson, K Chandrasekaran, HC Chang, N Kakimura, A Kolla Discrete Optimization 37, 100582, 2020 | 1 | 2020 |
| Approximation Algorithms for Quantum Max--Cut C Carlson, Z Jorquera, A Kolla, S Kordonowy, S Wayland arXiv preprint arXiv:2309.10957, 2023 | | 2023 |
| Approximation Algorithms for Norm Multiway Cut C Carlson, J Jafarov, K Makarychev, Y Makarychev, L Shan arXiv preprint arXiv:2308.08373, 2023 | | 2023 |
| Approximately counting independent sets in dense bipartite graphs via subspace enumeration C Carlson, E Davies, A Kolla, A Potukuchi arXiv preprint arXiv:2307.09533, 2023 | | 2023 |
| Approximate Counting and Expansion CA Carlson University of Colorado at Boulder, 2023 | | 2023 |
| Lower Bounds for Max-Cut in -Free Graphs via Semidefinite Programming C Carlson, A Kolla, R Li, N Mani, B Sudakov, L Trevisan SIAM Journal on Discrete Mathematics 35 (3), 1557-1568, 2021 | | 2021 |
| Some results on symmetric signings CA Carlson University of Illinois at Urbana-Champaign, 2017 | | 2017 |
| Largest Eigenvalue and Invertibility of Symmetric Matrix Signings C Carlson, K Chandrasekaran, HCCA Kolla arXiv preprint arXiv:1611.03624, 2016 | | 2016 |
| A quantum advantage over classical for local max cut C Carlson, Z Jorquera, A Kolla, S Kordonowy | | |
Alexandra KollaAssistant Professor of Computer Science, University of Illinois Urbana ChampaignVerified email at illinois.edu
