Andreas Galanis

From MaRDI portal
Person:269465

Available identifiers

zbMath Open galanis.andreasMaRDI QIDQ269465

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61473462024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q61473492024-01-15Paper
Metastability of the Potts ferromagnet on random regular graphs2023-06-23Paper
Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics2023-05-22Paper
https://portal.mardi4nfdi.de/entity/Q58755052023-02-03Paper
Implementations and the independent set polynomial below the Shearer threshold2022-11-17Paper
The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs2022-09-21Paper
Counting Solutions to Random CNF Formulas2022-08-17Paper
https://portal.mardi4nfdi.de/entity/Q50911712022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50892032022-07-18Paper
The complexity of approximating the complex-valued Potts model2022-04-12Paper
The Complexity of Approximating the Matching Polynomial in the Complex Plane2022-03-22Paper
Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs2022-02-11Paper
https://portal.mardi4nfdi.de/entity/Q50095282021-08-04Paper
Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region2021-05-04Paper
Random Walks on Small World Networks2021-05-03Paper
The complexity of approximating the complex-valued Ising model on bounded degree graphs2021-05-01Paper
Inapproximability of the Independent Set Polynomial in the Complex Plane2020-10-26Paper
Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems2020-10-23Paper
Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs2020-06-26Paper
https://portal.mardi4nfdi.de/entity/Q51113572020-05-27Paper
https://portal.mardi4nfdi.de/entity/Q51113582020-05-27Paper
The complexity of approximating the complex-valued Potts model2020-05-03Paper
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs2020-03-26Paper
A Complexity Trichotomy for Approximately Counting List H -Colorings2019-12-06Paper
Inapproximability of the independent set polynomial in the complex plane2019-08-22Paper
Approximation via Correlation Decay When Strong Spatial Mixing Fails2019-05-07Paper
Swendsen‐Wang algorithm on the mean‐field Potts model2019-02-20Paper
Fast algorithms at low temperatures via Markov chains2019-01-20Paper
Uniqueness for the 3-state antiferromagnetic Potts model on the tree2018-10-25Paper
Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region2018-08-02Paper
Amplifiers for the Moran Process2018-08-02Paper
The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs2018-07-16Paper
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs2018-04-22Paper
https://portal.mardi4nfdi.de/entity/Q45981842017-12-19Paper
A complexity trichotomy for approximately counting list H-colourings2017-12-19Paper
Amplifiers for the Moran Process2017-12-19Paper
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models2017-10-10Paper
Swendsen-Wang Algorithm on the Mean-Field Potts Model2017-08-31Paper
https://portal.mardi4nfdi.de/entity/Q29696472017-03-22Paper
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results2017-03-22Paper
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results2016-12-13Paper
The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs2016-11-18Paper
Approximately Counting $H$-Colorings is $\#\mathrm{BIS}$-Hard2016-06-01Paper
\(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region2016-04-18Paper
Approximately Counting H-Colourings is $$\#\mathrm {BIS}$$-Hard2015-10-27Paper
Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region2015-06-26Paper
Improved inapproximability results for counting independent sets in the hard-core model2014-08-25Paper
Improved inapproximability results for counting independent sets in the hard-core model2011-08-17Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Andreas Galanis