| Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models A Galanis, D Štefankovič, E Vigoda Combinatorics, Probability and Computing 25 (4), 500-559, 2016 | 130 | 2016 |
| Inapproximability for antiferromagnetic spin systems in the tree nonuniqueness region A Galanis, D Štefankovič, E Vigoda Journal of the ACM (JACM) 62 (6), 50, 2015 | 90 | 2015 |
| Improved inapproximability results for counting independent sets in the hard‐core model A Galanis, Q Ge, D Štefankovič, E Vigoda, L Yang Random Structures & Algorithms 45 (1), 78-110, 2014 | 67 | 2014 |
| Ferromagnetic Potts model: Refined# BIS-hardness and related results A Galanis, D Stefankovic, E Vigoda, L Yang SIAM Journal on Computing 45 (6), 2004-2065, 2016 | 62 | 2016 |
| # BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region JY Cai, A Galanis, LA Goldberg, H Guo, M Jerrum, D Štefankovič, ... Journal of Computer and System Sciences 82 (5), 690-711, 2016 | 46 | 2016 |
| Rapid mixing for colorings via spectral independence Z Chen, A Galanis, D Štefankovič, E Vigoda Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 43 | 2021 |
| Swendsen‐Wang algorithm on the mean‐field Potts model A Galanis, D Štefankovič, E Vigoda Random Structures & Algorithms 54 (1), 82-147, 2019 | 40 | 2019 |
| Inapproximability of the independent set polynomial in the complex plane I Bezáková, A Galanis, LA Goldberg, D Stefankovic SIAM Journal on Computing 49 (5), STOC18-395-STOC18-448, 2019 | 35 | 2019 |
| Amplifiers for the Moran process A Galanis, A Göbel, LA Goldberg, J Lapinskas, D Richerby Journal of the ACM (JACM) 64 (1), 5, 2017 | 35 | 2017 |
| Fast algorithms at low temperatures via Markov chains Z Chen, A Galanis, LA Goldberg, W Perkins, J Stewart, E Vigoda Random Structures & Algorithms 58 (2), 294-321, 2021 | 31 | 2021 |
| Approximation via correlation decay when strong spatial mixing fails I Bezáková, A Galanis, LA Goldberg, H Guo, D Stefankovic SIAM Journal on Computing 48 (2), 279-349, 2019 | 30 | 2019 |
| Approximately Counting -Colorings is -Hard A Galanis, LA Goldberg, M Jerrum SIAM Journal on Computing 45 (3), 680-711, 2016 | 24 | 2016 |
| Sampling in uniqueness from the Potts and random-cluster models on random regular graphs A Blanca, A Galanis, LA Goldberg, D Stefankovic, E Vigoda, K Yang arXiv preprint arXiv:1804.08111, 2018 | 19 | 2018 |
| Counting solutions to random CNF formulas A Galanis, LA Goldberg, H Guo, K Yang SIAM Journal on Computing 50 (6), 1701-1738, 2021 | 18 | 2021 |
| Fast algorithms for general spin systems on bipartite expanders A Galanis, LA Goldberg, J Stewart ACM Transactions on Computation Theory (TOCT) 13 (4), 1-18, 2021 | 15 | 2021 |
| A Complexity Trichotomy for Approximately Counting List H-Colorings A Galanis, LA Goldberg, M Jerrum ACM Transactions on Computation Theory (TOCT) 9 (2), 9, 2017 | 12 | 2017 |
| The complexity of approximating the matching polynomial in the complex plane I Bezáková, A Galanis, LA Goldberg, D Štefankovič ACM Transactions on Computation Theory (TOCT) 13 (2), 1-37, 2021 | 11 | 2021 |
| Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs P Buys, A Galanis, V Patel, G Regts Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 11 | 2021 |
| The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs A Galanis, LA Goldberg Information and Computation 251, 36-66, 2016 | 11 | 2016 |
| The complexity of approximating the complex-valued Potts model A Galanis, LA Goldberg, A Herrera-Poyatos computational complexity 31 (1), 1-94, 2022 | 9 | 2022 |
Leslie Ann GoldbergProfessor of Computer Science, University of OxfordVerified email at cs.ox.ac.uk
