( en | de | ru )

 

Disambiguation of "Galanis, Andreas"

Author of the publication

copydeleteadd this publication to your clipboard
A note on the high-fugacity hard-core model on bounded-degree bipartite expander graphs.

, , and . CoRR, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Georgios Galanis

Andreas

Andreas Sarcletti

Die Bedeutung von Praktika und studentischen Erwerbstätigkeiten für den Berufseinstieg.. Uni Bamberg, (2009)

Andreas Ströhl

Die Geste Mensch: Vilém Flussers Kulturtheorie als kommunikationsphilosophischer Zukunftsentwurf. Uni Marburg, (2009)

Andreas Nerlich

Lebensumstände und Krankheiten einer mittelalterlich bis neuzeitlichen Bevölkerung Südddeutschlands: paläopathologische Untersuchungen. Uni München, (2009)
 

Other publications of authors with the same name

Rapid Mixing for Colorings via Spectral Independence., , , and . CoRR, (2020)A Complexity Trichotomy for Approximately Counting List H-Colorings., , and . TOCT, 9 (2): 9:1-9:22 (2017)Inapproximability of the Independent Set Polynomial Below the Shearer Threshold., , and . ICALP, volume 80 of LIPIcs, page 28:1-28:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs., , , and . CoRR, (2020)Learning Hard-Constrained Models with One Sample., , and . SODA, page 3184-3196. SIAM, (2024)Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region., , , and . SODA, page 2198-2207. SIAM, (2022)The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs., and . SODA, page 458-468. SIAM, (2016)Inapproximability of Counting Hypergraph Colourings., , and . ACM Trans. Comput. Theory, 14 (3-4): 1-33 (December 2022)The Complexity of Approximating the Matching Polynomial in the Complex Plane., , , and . ACM Trans. Comput. Theory, 13 (2): 13:1-13:37 (2021)Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs., , , and . ICALP, volume 229 of LIPIcs, page 21:1-21:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)