Andreas Galanis
Orcid: 0000-0003-3579-6531
According to our database1,
Andreas Galanis
authored at least 46 papers
between 2013 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
ACM Trans. Algorithms, January, 2024
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
2023
Theor. Comput. Sci., 2023
Sampling from the Random Cluster Model on Random Regular Graphs at All Temperatures via Glauber Dynamics.
Proceedings of the Approximation, 2023
2022
ACM Trans. Comput. Theory, December, 2022
The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs.
SIAM J. Discret. Math., September, 2022
Comput. Complex., 2022
Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
2021
ACM Trans. Comput. Theory, 2021
ACM Trans. Comput. Theory, 2021
Random Struct. Algorithms, 2021
Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems.
J. Comput. Syst. Sci., 2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
2020
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs.
SIAM J. Discret. Math., 2020
SIAM J. Comput., 2020
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
2019
SIAM J. Comput., 2019
Random Struct. Algorithms, 2019
A note on the high-fugacity hard-core model on bounded-degree bipartite expander graphs.
CoRR, 2019
Proceedings of the Approximation, 2019
2018
2017
ACM Trans. Comput. Theory, 2017
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017
2016
SIAM J. Comput., 2016
#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region.
J. Comput. Syst. Sci., 2016
The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs.
Inf. Comput., 2016
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models.
Comb. Probab. Comput., 2016
The complexity of approximately counting in 2-spin systems on <i>k</i>-uniform bounded-degree hypergraphs.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
2015
Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region.
J. ACM, 2015
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015
2014
Improved inapproximability results for counting independent sets in the hard-core model.
Random Struct. Algorithms, 2014
Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region.
Proceedings of the Symposium on Theory of Computing, 2014
2013
CoRR, 2013