Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCharilaos Efthymiou 0001
Person information
- affiliation: University of Warwick, Mathematics and Computer Science, Coventry, UK
- affiliation (habil 2018): Johann Wolfgang Goethe University, Mathematics Institute, Frankfurt, Germany
- affiliation: Georgia Institute of Technology, College of Computing, Atlanta, GA, USA
Other persons with the same name
- Charilaos Efthymiou 0002 — Research Academic Computer Technology Institute, Greece (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2018
[b1]Charilaos Efthymiou:
Phase transitions and dynamics for random constraint satisfaction problems. Frankfurt University, Germany, 2018
Journal Articles
- 2020
- [j7]Charilaos Efthymiou:
Deterministic counting of graph colourings using sequences of subgraphs. Comb. Probab. Comput. 29(4): 555-586 (2020) - 2019
- [j6]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic
, Eric Vigoda, Yitong Yin:
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. SIAM J. Comput. 48(2): 581-643 (2019) - 2018
- [j5]Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari:
Local Convergence of Random Graph Colorings. Comb. 38(2): 341-380 (2018) - 2017
- [j4]Victor Bapst, Amin Coja-Oghlan, Charilaos Efthymiou:
Planting Colourings Silently. Comb. Probab. Comput. 26(3): 338-366 (2017) - 2016
- [j3]Amin Coja-Oghlan, Charilaos Efthymiou, Samuel Hetterich:
On the chromatic number of random regular graphs. J. Comb. Theory, Ser. B 116: 367-439 (2016) - [j2]Charilaos Efthymiou:
A Simple Algorithm for Sampling Colorings of G(n, d/n) Up to The Gibbs Uniqueness Threshold. SIAM J. Comput. 45(6): 2087-2116 (2016) - 2015
- [j1]Amin Coja-Oghlan, Charilaos Efthymiou:
On independent sets in random graphs. Random Struct. Algorithms 47(3): 436-486 (2015)
Conference and Workshop Papers
- 2023
- [c15]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees. APPROX/RANDOM 2023: 33:1-33:16 - [c14]Charilaos Efthymiou, Weiming Feng:
On the Mixing Time of Glauber Dynamics for the Hard-Core and Related Models on G(n, d/n). ICALP 2023: 54:1-54:17 - [c13]Charilaos Efthymiou, Kostas Zampetakis:
Broadcasting with Random Matrices. ICALP 2023: 55:1-55:14 - 2022
- [c12]Charilaos Efthymiou:
On Sampling Symmetric Gibbs Distributions on Sparse Random Graphs and Hypergraphs. ICALP 2022: 57:1-57:16 - 2019
- [c11]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 - 2018
- [c10]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Sampling Random Colorings of Sparse Random Graphs. SODA 2018: 1759-1771 - 2017
- [c9]Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari, Mihyun Kang, Tobias Kapetanopoulos:
Charting the Replica Symmetric Phase. APPROX-RANDOM 2017: 40:1-40:17 - 2016
- [c8]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda, Yitong Yin:
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. FOCS 2016: 704-713 - 2015
- [c7]Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari:
Local Convergence of Random Graph Colorings. APPROX-RANDOM 2015: 726-737 - [c6]Charilaos Efthymiou:
Reconstruction/Non-reconstruction Thresholds for Colourings of General Galton-Watson Trees. APPROX-RANDOM 2015: 756-774 - [c5]Charilaos Efthymiou:
Random Instances of Problems in NP - Algorithms and Statistical Physics. Algorithms, Probability, Networks, and Games 2015: 196-222 - 2014
- [c4]Charilaos Efthymiou:
Switching Colouring of G(n, d/n) for Sampling up to Gibbs Uniqueness Threshold. ESA 2014: 371-381 - [c3]Charilaos Efthymiou:
MCMC sampling colourings and independent sets of G(n, d/n) near uniqueness threshold. SODA 2014: 305-316 - 2012
- [c2]Charilaos Efthymiou:
A simple algorithm for random colouring G(n, d/n) using (2 + ε)d colours. SODA 2012: 272-280 - 2011
- [c1]Amin Coja-Oghlan, Charilaos Efthymiou:
On independent sets in random graphs. SODA 2011: 136-144
Informal and Other Publications
- 2024
- [i20]Charilaos Efthymiou:
Spectral Independence Beyond Uniqueness with. the topological method - An extended view. CoRR abs/2402.11647 (2024) - [i19]Charilaos Efthymiou, Kostas Zampetakis:
On sampling diluted Spin Glasses using Glauber dynamics. CoRR abs/2403.08921 (2024) - 2023
- [i18]Charilaos Efthymiou, Weiming Feng:
On the Mixing Time of Glauber Dynamics for the Hard-core and Related Models on G(n, d/n). CoRR abs/2302.06172 (2023) - [i17]Charilaos Efthymiou, Kostas Zampetakis:
Broadcasting with Random Matrices. CoRR abs/2302.11657 (2023) - [i16]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees. CoRR abs/2307.07727 (2023) - 2022
- [i15]Charilaos Efthymiou:
Spectral Independence Beyond Uniqueness using the topological method. CoRR abs/2211.03753 (2022) - 2020
- [i14]Charilaos Efthymiou:
On sampling symmetric Gibbs distributions on sparse random graphs and hypergraphs. CoRR abs/2007.07145 (2020) - 2019
- [i13]Charilaos Efthymiou, Andreas Galanis, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Improved Strong Spatial Mixing for Colorings on Trees. CoRR abs/1909.07059 (2019) - 2017
- [i12]Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari, Mihyun Kang, Tobias Kapetanopoulos:
Charting the replica symmetric phase. CoRR abs/1704.01043 (2017) - [i11]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Sampling Random Colorings of Sparse Random Graphs. CoRR abs/1707.03796 (2017) - 2016
- [i10]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda, Yitong Yin:
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. CoRR abs/1604.01422 (2016) - [i9]Charilaos Efthymiou:
A simple algorithm for sampling colourings of G(n, d/n) up to Gibbs Uniqueness Threshold. CoRR abs/1609.05934 (2016) - 2015
- [i8]Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari:
Local convergence of random graph colorings. CoRR abs/1501.06301 (2015) - 2014
- [i7]Charilaos Efthymiou:
Reconstruction/Non-reconstruction Thresholds for Colourings of General Galton-Watson Trees. CoRR abs/1406.3617 (2014) - [i6]Victor Bapst, Amin Coja-Oghlan, Charilaos Efthymiou:
Planting colourings silently. CoRR abs/1411.0610 (2014) - 2013
- [i5]Charilaos Efthymiou:
MCMC sampling colourings and independent sets of G(n,d/n) near the uniqueness threshold. CoRR abs/1304.6666 (2013) - 2012
- [i4]Charilaos Efthymiou:
Broadcasting colourings on trees. A combinatorial view. CoRR abs/1206.3538 (2012) - 2011
- [i3]Charilaos Efthymiou:
A simple algorithm for random colouring G(n, d/n) using (2+ε)d colours. CoRR abs/1107.0871 (2011) - 2010
- [i2]Amin Coja-Oghlan, Charilaos Efthymiou:
On independent sets in random graphs. CoRR abs/1007.1378 (2010) - 2009
- [i1]Charilaos Efthymiou:
Deterministic counting of graph colourings using sequences of subgraphs. CoRR abs/0909.5224 (2009)
Coauthor Index
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-05-02 23:57 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:
