default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Galanis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j25]Ivona Bezáková
, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs. ACM Trans. Algorithms 20(1): 7:1-7:26 (2024)- [c32]Andreas Galanis, Alkis Kalavasis, Anthimos Vardis Kandiros:
On Sampling from Ising Models with Spectral Constraints. APPROX/RANDOM 2024: 70:1-70:14 - [c31]Andreas Galanis, Alkis Kalavasis, Anthimos Vardis Kandiros:
Learning Hard-Constrained Models with One Sample. SODA 2024: 3184-3196 - [i36]Andreas Galanis, Alkis Kalavasis, Anthimos Vardis Kandiros:
On Sampling from Ising Models with Spectral Constraints. CoRR abs/2407.07645 (2024) - 2023
- [j24]Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Implementations and the independent set polynomial below the Shearer threshold. Theor. Comput. Sci. 939: 194-215 (2023) - [c30]Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova:
Sampling from the Random Cluster Model on Random Regular Graphs at All Temperatures via Glauber Dynamics. APPROX/RANDOM 2023: 64:1-64:12 - [i35]Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova:
Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics. CoRR abs/2305.13239 (2023) - [i34]Andreas Galanis, Alkis Kalavasis, Anthimos Vardis Kandiros:
Learning Hard-Constrained Models with One Sample. CoRR abs/2311.03332 (2023) - 2022
- [j23]Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos:
The complexity of approximating the complex-valued Potts model. Comput. Complex. 31(1): 2 (2022) - [j22]Andreas Galanis, Leslie Ann Goldberg, James Stewart:
Fast mixing via polymers for random graphs with unbounded degree. Inf. Comput. 285(Part): 104894 (2022) - [j21]Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos:
The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs. SIAM J. Discret. Math. 36(3): 2159-2204 (2022) - [j20]Andreas Galanis, Heng Guo, Jiaheng Wang:
Inapproximability of Counting Hypergraph Colourings. ACM Trans. Comput. Theory 14(3-4): 1-33 (2022) - [c29]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs. ICALP 2022: 21:1-21:16 - [c28]Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelomanana, Daniel Stefankovic, Eric Vigoda:
Metastability of the Potts Ferromagnet on Random Regular Graphs. ICALP 2022: 45:1-45:20 - [c27]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Approximating Observables Is as Hard as Counting. ICALP 2022: 63:1-63:18 - [c26]Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region. SODA 2022: 2198-2207 - [i33]Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelomanana, Daniel Stefankovic, Eric Vigoda:
Metastability of the Potts ferromagnet on random regular graphs. CoRR abs/2202.05777 (2022) - [i32]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Approximating observables is as hard as counting. CoRR abs/2206.11606 (2022) - [i31]Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Andrés Herrera-Poyatos:
Fast sampling of satisfying assignments from random k-SAT. CoRR abs/2206.15308 (2022) - 2021
- [j19]Andreas Galanis, Leslie Ann Goldberg, Kuan Yang:
Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems. J. Comput. Syst. Sci. 115: 187-213 (2021) - [j18]Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, Eric Vigoda:
Fast algorithms at low temperatures via Markov chains. Random Struct. Algorithms 58(2): 294-321 (2021) - [j17]Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Kuan Yang:
Counting Solutions to Random CNF Formulas. SIAM J. Comput. 50(6): 1701-1738 (2021) - [j16]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
The Complexity of Approximating the Matching Polynomial in the Complex Plane. ACM Trans. Comput. Theory 13(2): 13:1-13:37 (2021) - [j15]Andreas Galanis, Leslie Ann Goldberg, James Stewart:
Fast Algorithms for General Spin Systems on Bipartite Expanders. ACM Trans. Comput. Theory 13(4): 25:1-25:18 (2021) - [c25]Andreas Galanis, Leslie Ann Goldberg, James Stewart:
Fast Mixing via Polymers for Random Graphs with Unbounded Degree. APPROX-RANDOM 2021: 36:1-36:13 - [c24]Pjotr Buys, Andreas Galanis, Viresh Patel, Guus Regts:
Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs. SODA 2021: 1508-1519 - [c23]Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Rapid Mixing for Colorings via Spectral Independence. SODA 2021: 1548-1557 - [i30]Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos:
The complexity of approximating the complex-valued Ising model on bounded degree graphs. CoRR abs/2105.00287 (2021) - [i29]Andreas Galanis, Leslie Ann Goldberg, James Stewart:
Fast mixing via polymers for random graphs with unbounded degree. CoRR abs/2105.00524 (2021) - [i28]Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region. CoRR abs/2105.01784 (2021) - [i27]Andreas Galanis, Heng Guo, Jiaheng Wang:
Inapproximability of counting hypergraph colourings. CoRR abs/2107.05486 (2021) - [i26]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Fast sampling via spectral independence beyond bounded-degree graphs. CoRR abs/2111.04066 (2021) - 2020
- [j14]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Inapproximability of the Independent Set Polynomial in the Complex Plane. SIAM J. Comput. 49(5) (2020) - [j13]Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic, Eric Vigoda, Kuan Yang:
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. SIAM J. Discret. Math. 34(1): 742-793 (2020) - [j12]Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda:
Random Walks on Small World Networks. ACM Trans. Algorithms 16(3): 37:1-37:33 (2020) - [c22]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
The complexity of approximating averages on bounded-degree graphs. FOCS 2020: 1345-1355 - [c21]Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Kuan Yang:
Counting Solutions to Random CNF Formulas. ICALP 2020: 53:1-53:14 - [c20]Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos:
The Complexity of Approximating the Complex-Valued Potts Model. MFCS 2020: 36:1-36:14 - [c19]Andreas Galanis, Leslie Ann Goldberg, James Stewart:
Fast Algorithms for General Spin Systems on Bipartite Expanders. MFCS 2020: 37:1-37:14 - [i25]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
The complexity of approximating averages on bounded-degree graphs. CoRR abs/2004.09238 (2020) - [i24]Andreas Galanis, Leslie Ann Goldberg, James Stewart:
Fast algorithms for general spin systems on bipartite expanders. CoRR abs/2004.13442 (2020) - [i23]Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos:
The complexity of approximating the complex-valued Potts model. CoRR abs/2005.01076 (2020) - [i22]Pjotr Buys, Andreas Galanis, Viresh Patel, Guus Regts:
Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs. CoRR abs/2006.14828 (2020) - [i21]Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Rapid Mixing for Colorings via Spectral Independence. CoRR abs/2007.08058 (2020)
2010 – 2019
- 2019
- [j11]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Swendsen-Wang algorithm on the mean-field Potts model. Random Struct. Algorithms 54(1): 82-147 (2019) - [j10]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic:
Approximation via Correlation Decay When Strong Spatial Mixing Fails. SIAM J. Comput. 48(2): 279-349 (2019) - [c18]Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, Eric Vigoda:
Fast Algorithms at Low Temperatures via Markov Chains. APPROX-RANDOM 2019: 41:1-41:14 - [c17]Charilaos Efthymiou, Andreas Galanis, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Improved Strong Spatial Mixing for Colorings on Trees. APPROX-RANDOM 2019: 48:1-48:16 - [c16]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
The Complexity of Approximating the Matching Polynomial in the Complex Plane. ICALP 2019: 22:1-22:13 - [i20]Andreas Galanis, Leslie Ann Goldberg, James Stewart:
A note on the high-fugacity hard-core model on bounded-degree bipartite expander graphs. CoRR abs/1901.06653 (2019) - [i19]Charilaos Efthymiou, Andreas Galanis, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Improved Strong Spatial Mixing for Colorings on Trees. CoRR abs/1909.07059 (2019) - [i18]Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Kuan Yang:
Counting solutions to random CNF formulas. CoRR abs/1911.07020 (2019) - 2018
- [c15]Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic, Eric Vigoda, Kuan Yang:
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. APPROX-RANDOM 2018: 33:1-33:15 - [c14]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Inapproximability of the independent set polynomial in the complex plane. STOC 2018: 1234-1240 - [i17]Andreas Galanis, Leslie Ann Goldberg, Kuan Yang:
Uniqueness for the 3-State Antiferromagnetic Potts Model on the Tree. CoRR abs/1804.03514 (2018) - [i16]Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic, Eric Vigoda, Kuan Yang:
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. CoRR abs/1804.08111 (2018) - [i15]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
The complexity of approximating the matching polynomial in the complex plane. CoRR abs/1807.04930 (2018) - 2017
- [j9]Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby:
Amplifiers for the Moran Process. J. ACM 64(1): 5:1-5:90 (2017) - [j8]Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum:
A Complexity Trichotomy for Approximately Counting List H-Colorings. ACM Trans. Comput. Theory 9(2): 9:1-9:22 (2017) - [c13]Sejun Park, Yunhun Jang, Andreas Galanis, Jinwoo Shin, Daniel Stefankovic, Eric Vigoda:
Rapid Mixing Swendsen-Wang Sampler for Stochastic Partitioned Attractive Models. AISTATS 2017: 440-449 - [c12]Andreas Galanis, Leslie Ann Goldberg, Kuan Yang:
Approximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction Problems. ICALP 2017: 27:1-27:14 - [c11]Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Inapproximability of the Independent Set Polynomial Below the Shearer Threshold. ICALP 2017: 28:1-28:13 - [i14]Sejun Park, Yunhun Jang, Andreas Galanis, Jinwoo Shin, Daniel Stefankovic, Eric Vigoda:
Rapid Mixing Swendsen-Wang Sampler for Stochastic Partitioned Attractive Models. CoRR abs/1704.02232 (2017) - [i13]Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda:
Random Walks on Small World Networks. CoRR abs/1707.02467 (2017) - [i12]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Inapproximability of the independent set polynomial in the complex plane. CoRR abs/1711.00282 (2017) - 2016
- [j7]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models. Comb. Probab. Comput. 25(4): 500-559 (2016) - [j6]Andreas Galanis, Leslie Ann Goldberg:
The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs. Inf. Comput. 251: 36-66 (2016) - [j5]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. J. Comput. Syst. Sci. 82(5): 690-711 (2016) - [j4]Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum:
Approximately Counting H-Colorings is $\#\mathrm{BIS}$-Hard. SIAM J. Comput. 45(3): 680-711 (2016) - [j3]Andreas Galanis, Daniel Stefankovic, Eric Vigoda, Linji Yang:
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results. SIAM J. Comput. 45(6): 2004-2065 (2016) - [c10]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic:
Approximation via Correlation Decay When Strong Spatial Mixing Fails. ICALP 2016: 45:1-45:13 - [c9]Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum:
A Complexity Trichotomy for Approximately Counting List H-Colourings. ICALP 2016: 46:1-46:13 - [c8]Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby:
Amplifiers for the Moran Process. ICALP 2016: 62:1-62:13 - [c7]Andreas Galanis, Leslie Ann Goldberg:
The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs. SODA 2016: 458-468 - [i11]Andreas Galanis, Leslie Ann Goldberg, Kuan Yang:
Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems. CoRR abs/1610.04055 (2016) - [i10]Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Inapproximability of the independent set polynomial below the Shearer threshold. CoRR abs/1612.05832 (2016) - 2015
- [j2]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region. J. ACM 62(6): 50:1-50:60 (2015) - [c6]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Swendsen-Wang Algorithm on the Mean-Field Potts Model. APPROX-RANDOM 2015: 815-828 - [c5]Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum:
Approximately Counting H-Colourings is #\mathrm BIS # BIS -Hard. ICALP (1) 2015: 529-541 - [i9]Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum:
Approximately Counting H-Colourings is #BIS-Hard. CoRR abs/1502.01335 (2015) - [i8]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Swendsen-Wang Algorithm on the Mean-Field Potts Model. CoRR abs/1502.06593 (2015) - [i7]Andreas Galanis, Leslie Ann Goldberg:
The complexity of approximately counting in 2-spin systems on $k$-uniform bounded-degree hypergraphs. CoRR abs/1505.06146 (2015) - [i6]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic:
Approximation via Correlation Decay when Strong Spatial Mixing Fails. CoRR abs/1510.09193 (2015) - [i5]Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby:
Amplifiers for the Moran Process. CoRR abs/1512.05632 (2015) - 2014
- [j1]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 45(1): 78-110 (2014) - [c4]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. APPROX-RANDOM 2014: 582-595 - [c3]Andreas Galanis, Daniel Stefankovic, Eric Vigoda, Linji Yang:
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results. APPROX-RANDOM 2014: 677-691 - [c2]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region. STOC 2014: 823-831 - 2013
- [i4]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Inapproximability for Antiferromagnetic Spin Systems in the Tree Non-Uniqueness Region. CoRR abs/1305.2902 (2013) - [i3]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
BIS-Hardness for Ferromagnetic Potts in the Ordered Phase and Related Results. CoRR abs/1311.4839 (2013) - 2012
- [i2]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models. CoRR abs/1203.2226 (2012) - 2011
- [c1]Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang:
Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model. APPROX-RANDOM 2011: 567-578 - [i1]Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang:
Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model. CoRR abs/1105.5131 (2011)
Coauthor Index
[j25] [j24] [c30] [i35] [j23] [j22] [j21] [c29] [c28] [i33] [i31] [j19] [j18] [j17] [j16] [j15] [c25] [i30] [i29] [i26] [j14] [j13] [j12] [c21] [c20] [c19] [i24] [i23] [j10] [c18] [c16] [i20] [i18] [c15] [c14] [i17] [i16] [i15] [j9] [j8] [c12] [c11] [i13] [i12] [j6] [j5] [j4] [c10] [c9] [c8] [c7] [i11] [i10] [c5] [i9] [i7] [i6] [i5] [c4]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-18 01:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
