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
23 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
19 2021 Efficient algorithms for the Potts model on small-set expanders C Carlson, E Davies, A Kolla
arXiv preprint arXiv:2003.01154, 2020
19 2020 Algorithms for the ferromagnetic Potts model on expanders C Carlson, E Davies, N Fraiman, A Kolla, A Potukuchi, C Yap
Combinatorics, Probability and Computing 33 (4), 487-517, 2024
18 2024 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 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
10 2022 Lower Bounds for Max-Cut in C Carlson, A Kolla, R Li, N Mani, B Sudakov, L Trevisan
SIAM Journal on Discrete Mathematics 35 (3), 1557-1568, 2021
9 * 2021 Improved Distributed Algorithms for Random Colorings C Carlson, D Frishberg, E Vigoda
arXiv preprint arXiv:2309.07859, 2023
5 2023 Flip Dynamics for Sampling Colorings: Improving C Carlson, E Vigoda
arXiv preprint arXiv:2407.04870, 2024
2 2024 Approximation Algorithms for Quantum Max- C Carlson, Z Jorquera, A Kolla, S Kordonowy, S Wayland
arXiv preprint arXiv:2309.10957, 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 Spectral aspects of symmetric matrix signings C Carlson, K Chandrasekaran, HC Chang, N Kakimura, A Kolla
Discrete Optimization 37, 100582, 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 Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree C Carlson, X Chen, W Feng, E Vigoda
arXiv preprint arXiv:2407.04576, 2024
2024 A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs C Carlson, E Davies, A Kolla, A Potukuchi
51st International Colloquium on Automata, Languages, and Programming (ICALP …, 2024
2024 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 A quantum advantage over classical for local max cut C Carlson, Z Jorquera, A Kolla, S Kordonowy
arXiv preprint arXiv:2304.08420, 2023
2023 Comparing a classical and quantum one round algorithm on LocalMaxCut C Carlson, Z Jorquera, A Kolla, S Kordonowy
arXiv preprint arXiv:2304.08420, 2023
2023 Approximate Counting and Expansion CA Carlson
University of Colorado at Boulder, 2023
2023 
Alexandra KollaAssistant Professor of Computer Science, University of Illinois Urbana ChampaignAdresse e-mail validée de illinois.edu
