Alexandra Kolla

Institute of Computing Technology — China

Computer Science · Physical Sciences

10h-index547citations56works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(21), Advanced Graph Theory Research(20), Markov Chains and Monte Carlo Methods(8), Quantum Computing Algorithms and Architecture(7), Graph theory and applications(7)

Publications56 total

Energy-Efficient VM Allocation Using Elite Sparrow Search Algorithm and MU/MMT Policies
2025
A Sublinear Algorithm for Path Feasibility Among Rectangular Obstacles
arXiv (Cornell University)·2025Open Access
Monogamy of Entanglement Bounds and Improved Approximation Algorithms for Qudit Hamiltonians
arXiv (Cornell University)·2024Open Access
Algorithms for the ferromagnetic Potts model on expanders
Combinatorics Probability Computing·2024Open Access
Special Section on the Fifty-Ninth Annual IEEE Symposium on Foundations of Computer Science (2018)
SIAM Journal on Computing·2023Open Access
Approximation Algorithms for Quantum Max-$d$-Cut
arXiv (Cornell University)·2023Open Access
A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs
arXiv (Cornell University)·2023Open Access
A quantum advantage over classical for local max cut
arXiv (Cornell University)·2023· 1 citedOpen Access
Algorithms for the ferromagnetic Potts model on expanders
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)·2022· 8 cited
Committees
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)·2022Open Access
Computational thresholds for the fixed-magnetization Ising model
2022· 3 cited
Algorithms for the ferromagnetic Potts model on expanders
arXiv (Cornell University)·2022Open Access
Computational thresholds for the fixed-magnetization Ising model
arXiv (Cornell University)·2021Open Access
Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming
SIAM Journal on Discrete Mathematics·2021Open Access
FOCS 2020 Program Committee
2020Open Access
Spectral aspects of symmetric matrix signings
Discrete Optimization·2020· 1 cited
Efficient algorithms for the Potts model on small-set expanders
arXiv (Cornell University)·2020· 10 citedOpen Access
Lower Bounds for Max-Cut via Semidefinite Programming
Lecture notes in computer science·2020· 2 cited
Statistical Physics Approaches to Unique Games
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2019· 3 citedOpen Access
Dimension-Free <i>L</i> <i>p</i>-Maximal Inequalities for Spherical Means in ℤ<i>m</i>+1<i>N</i>
International Mathematics Research Notices·2019
page 1 of 3Next →

Frequent Co-authors

Luca Trevisan(8), Naman Agarwal(7), Charles Carlson(7), Ewan Davies(7), Charlie Carlson(7), Ankit Singla(5), P. Brighten Godfrey(5), Yury Makarychev(4), Guy Kindler(4), Rahul Jain(4), Karthekeyan Chandrasekaran(4), Sangeetha Abdu Jyothi(3), Shang‐Hua Teng(3), Nicolás Fraiman(3), Aditya Potukuchi(3), Corrine Yap(3), Vivek Madan(3), Gatis Midrijānis(3), Ben W. Reichardt(3), Zackary Jorquera(3)