Notice: Unexpected clearActionName after getActionName already called in /var/www/html/includes/context/RequestContext.php on line 338
Demetrios Achlioptas - MaRDI portal

Demetrios Achlioptas

From MaRDI portal
(Redirected from Person:215096)
Person:1356725

Available identifiers

zbMath Open achlioptas.dimitrisWikidataQ102232798 ScholiaQ102232798MaRDI QIDQ1356725

List of research outcomes

PublicationDate of PublicationType
The Lov\'{a}sz Local Lemma is Not About Probability2021-11-16Paper
Stochastic Control via Entropy Compression2020-05-27Paper
The random 2-SAT partition function2020-02-10Paper
Model counting with error-correcting codes2019-11-27Paper
A Local Lemma for Focused Stochastic Algorithms2019-11-08Paper
Rapid mixing for lattice colourings with fewer colours2019-07-09Paper
Fast sampling of perfectly uniform satisfying assignments2018-08-10Paper
Fast and flexible probabilistic model counting2018-08-10Paper
Random Walks That Find Perfect Objects and the Lovász Local Lemma2018-08-02Paper
Focused Stochastic Local Search and the Lovász Local Lemma2018-07-16Paper
Symmetric graph properties have independent edges2018-06-14Paper
Beyond the Lovasz Local Lemma: Point to Set Correlations and Their Algorithmic Applications2018-05-05Paper
Competitive analysis of randomized paging algorithms2017-12-05Paper
Probabilistic model counting with short XORs2017-11-15Paper
Algorithmic Improvements of the Lovász Local Lemma via Cluster Expansion2017-01-26Paper
Navigability is a Robust Property2016-01-08Paper
On the bias of traceroute sampling2015-11-11Paper
Symmetric Graph Properties Have Independent Edges2015-11-04Paper
Fast computation of low rank matrix approximations2015-02-27Paper
On the solution-space geometry of random constraint satisfaction problems2014-11-25Paper
Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)2014-09-26Paper
Unsatisfiability Bounds for Random CSPs from an Energetic Interpolation Method2013-08-12Paper
Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas2013-08-12Paper
Explosive Percolation in Random Networks2011-11-30Paper
On the solution‐space geometry of random constraint satisfaction problems2011-05-11Paper
The threshold for random k-SAT is 2 k (ln 2 - O(k))2010-08-16Paper
On the bias of traceroute sampling2010-08-16Paper
The two possible values of the chromatic number of a random graph2010-08-15Paper
Almost all graphs with average degree 4 are 3-colorable2010-08-05Paper
Solution clustering in random satisfiability2010-06-25Paper
Random Formulas Have Frozen Variables2010-03-17Paper
LATIN 2004: Theoretical Informatics2009-05-07Paper
Fast computation of low-rank matrix approximations2008-12-21Paper
On the maximum satisfiability of random formulas2008-12-21Paper
Machine Learning: ECML 20042008-03-14Paper
Algorithmic barriers from phase transitions2008-03-14Paper
Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold2007-06-26Paper
Learning Theory2006-06-22Paper
The two possible values of the chromatic number of a random graph2006-06-19Paper
https://portal.mardi4nfdi.de/entity/Q57157252006-01-04Paper
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques2005-08-25Paper
Almost all graphs with average degree 4 are 3-colorable2004-11-18Paper
The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘)2004-10-07Paper
On the 2-colorability of random hypergraphs2003-12-17Paper
Database-friendly random projections: Johnson-Lindenstrauss with binary coins.2003-08-19Paper
Two‐coloring random hypergraphs2002-08-08Paper
Rigorous results for random (\(2+p)\)-SAT2002-03-03Paper
Lower bounds for random 3-SAT via differential equations2002-03-03Paper
Random constraint satisfaction: A more accurate picture2002-02-10Paper
https://portal.mardi4nfdi.de/entity/Q27683712002-01-30Paper
https://portal.mardi4nfdi.de/entity/Q27415102001-09-24Paper
Competitive analysis of randomized paging algorithms2000-08-21Paper
https://portal.mardi4nfdi.de/entity/Q47053491999-12-19Paper
Tight Lower Bounds for st-Connectivity on the NNJAG Model1999-10-28Paper
The complexity of \(G\)-free colourability1998-11-05Paper
The existence of uniquely \(-G\) colourable graphs1998-03-24Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Demetrios Achlioptas