Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Andreas
    Last name: Galanis
    DBLP: 16/9673
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 36 of 36  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Andreas Galanis, Andreas Göbel 0001, Leslie Ann Goldberg, John Lapinskas, David Richerby.
    Amplifiers for the Moran Process.
    43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy 2016 (0) 2016
    Conference paper
    Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum.
    A Complexity Trichotomy for Approximately Counting List H-Colourings.
    43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy 2016 (0) 2016
    Conference paper
    Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo 0001, Daniel Stefankovic.
    Approximation via Correlation Decay When Strong Spatial Mixing Fails.
    43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy 2016 (0) 2016
    Conference paper
    Andreas Galanis, Leslie Ann Goldberg, Kuan Yang.
    Approximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction Problems.
    44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland 2017 (0) 2017
    Conference paper
    Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic.
    Inapproximability of the Independent Set Polynomial Below the Shearer Threshold.
    44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland 2017 (0) 2017
    Conference paper
    Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang.
    Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings 2011 (0) 2011
    Conference paper
    Andreas Galanis, Daniel Stefankovic, Eric Vigoda, Linji Yang.
    Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain 2014 (0) 2014
    Conference paper
    Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, Eric Vigoda.
    #BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain 2014 (0) 2014
    Conference paper
    Andreas Galanis, Daniel Stefankovic, Eric Vigoda.
    Swendsen-Wang Algorithm on the Mean-Field Potts Model.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA 2015 (0) 2015
    Conference paper
    Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum.
    Approximately Counting H-Colourings is #\mathrm BIS # BIS -Hard.
    Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I 2015 (0) 2015
    Conference paper
    Andreas Galanis, Daniel Stefankovic, Eric Vigoda.
    Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models.
    Combinatorics, Probability Computing 2016, Volume 25 (0) 2016
    Journal article
    Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang.
    Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Andreas Galanis, Daniel Stefankovic, Eric Vigoda.
    Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
    CoRR 2012, Volume 0 (0) 2012
    Journal article
    Andreas Galanis, Daniel Stefankovic, Eric Vigoda.
    Inapproximability for Antiferromagnetic Spin Systems in the Tree Non-Uniqueness Region
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    Andreas Galanis, Daniel Stefankovic, Eric Vigoda.
    BIS-Hardness for Ferromagnetic Potts in the Ordered Phase and Related Results.
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum.
    Approximately Counting H-Colourings is #BIS-Hard.
    CoRR 2015, Volume 0 (0) 2015
    Journal article
    Andreas Galanis, Daniel Stefankovic, Eric Vigoda.
    Swendsen-Wang Algorithm on the Mean-Field Potts Model.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Andreas Galanis, Leslie Ann Goldberg.
    The complexity of approximately counting in 2-spin systems on $k$-uniform bounded-degree hypergraphs.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Andreas Galanis, Andreas Göbel 0001, Leslie Ann Goldberg, John Lapinskas, David Richerby.
    Amplifiers for the Moran Process.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Andreas Galanis, Leslie Ann Goldberg, Kuan Yang.
    Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic.
    Inapproximability of the independent set polynomial below the Shearer threshold.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo 0001, Daniel Stefankovic.
    Approximation via Correlation Decay when Strong Spatial Mixing Fails.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Sejun Park, Yunhun Jang, Andreas Galanis, Jinwoo Shin, Daniel Stefankovic, Eric Vigoda.
    Rapid Mixing Swendsen-Wang Sampler for Stochastic Partitioned Attractive Models.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda.
    Random Walks on Small World Networks.
    CoRR 2017, Volume 0 (0) 2017
    Journal article
    Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic.
    Inapproximability of the independent set polynomial in the complex plane.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Andreas Galanis, Leslie Ann Goldberg.
    The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs.
    Inf. Comput. 2016, Volume 251 (0) 2016
    Conference paper
    Andreas Galanis, Daniel Stefankovic, Eric Vigoda.
    Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region.
    J. ACM 2015, Volume 62 (0) 2015
    Journal article
    Andreas Galanis, Andreas Göbel 0001, Leslie Ann Goldberg, John Lapinskas, David Richerby.
    Amplifiers for the Moran Process.
    J. ACM 2017, Volume 64 (0) 2017
    Conference paper
    Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo 0001, Mark Jerrum, Daniel Stefankovic, Eric Vigoda.
    #BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region.
    J. Comput. Syst. Sci. 2016, Volume 82 (0) 2016
    Conference paper
    Sejun Park, Yunhun Jang, Andreas Galanis, Jinwoo Shin, Daniel Stefankovic, Eric Vigoda.
    Rapid Mixing Swendsen-Wang Sampler for Stochastic Partitioned Attractive Models.
    Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, AISTATS 2017, 20-22 April 2017, Fort Lauderdale, FL, USA 2017 (0) 2017
    Conference paper
    Andreas Galanis, Leslie Ann Goldberg.
    The complexity of approximately counting in 2-spin systems on
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Journal article
    Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang.
    Improved inapproximability results for counting independent sets in the hard-core model.
    Random Struct. Algorithms 2014, Volume 45 (0) 2014
    Conference paper
    Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum.
    Approximately Counting H-Colorings is $\#\mathrm{BIS}$-Hard.
    SIAM J. Comput. 2016, Volume 45 (0) 2016
    Conference paper
    Andreas Galanis, Daniel Stefankovic, Eric Vigoda, Linji Yang.
    Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results.
    SIAM J. Comput. 2016, Volume 45 (0) 2016
    Conference paper
    Andreas Galanis, Daniel Stefankovic, Eric Vigoda.
    Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region.
    Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014 2014 (0) 2014
    Conference paper
    Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum.
    A Complexity Trichotomy for Approximately Counting List
    TOCT 2016, Volume 9 (0) 2017
    Show item 1 to 36 of 36  

    Your query returned 36 matches in the database.