PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Galanis, Andreas"

Author of the publication

copydeleteadd this publication to your clipboard
Approximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction Problems.

, , and . ICALP, volume 80 of LIPIcs, page 27:1-27:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)

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.

PD Dr. Andreas Heßelmann University of Stuttgart

A density-fitting implementation of the density-based basis-set correction method, , , , , and . Journal of computational chemistry, 45 (15): 1247-1253 (2024)

Univ. -Prof. Dr. -Ing. Andreas Strohmayer University of Stuttgart

Editorial: Innovation in aviation and space for opening new horizons, , and . Aircraft engineering and aerospace technology, 96 (1): 1 (2024)

Univ. -Prof. Dr. Andreas Kronenburg University of Stuttgart

Carrier-Phase DNS of Ignition and Combustion of Iron Particles in a Turbulent Mixing Layer, , , , , , , , , and 2 other author(s). Flow turbulence and combustion, 112 (4): 1083–1103 (2024)

Prof. Dr. Andreas Hotho

Ontology-based Text Document Clustering., , and . KI, 16 (4): 48-54 (2002)
Ontology-based Text Document Clustering., , and . KI, 16 (4): 48-54 (2002)Clustern mit Hintergrundwissen.. Karlsruhe Institute of Technology, (2004)

Junior-Prof. Dr.-Ing. Andreas Pott

 

Other publications of authors with the same name

The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs., and . Inf. Comput., (2016)A Complexity Trichotomy for Approximately Counting List H-Colorings., , and . TOCT, 9 (2): 9:1-9:22 (2017)Amplifiers for the Moran Process., , , , and . ICALP, volume 55 of LIPIcs, page 62:1-62:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)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 fuer Informatik, (2017)Improved inapproximability results for counting independent sets in the hard-core model., , , , and . Random Struct. Algorithms, 45 (1): 78-110 (2014)BIS-Hardness for Ferromagnetic Potts in the Ordered Phase and Related Results., , and . CoRR, (2013)A note on the high-fugacity hard-core model on bounded-degree bipartite expander graphs., , and . CoRR, (2019)Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems., , and . CoRR, (2016)Uniqueness for the 3-State Antiferromagnetic Potts Model on the Tree., , and . CoRR, (2018)Fast Algorithms at Low Temperatures via Markov Chains., , , , , and . APPROX-RANDOM, volume 145 of LIPIcs, page 41:1-41:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)