The following pages link to Demetrios Achlioptas (Q1356725):
Displaying 50 items.
- (Q215096) (redirect page) (← links)
- Solution clustering in random satisfiability (Q978588) (← links)
- The complexity of \(G\)-free colourability (Q1356726) (← links)
- The existence of uniquely \(-G\) colourable graphs (Q1377702) (← links)
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins. (Q1401965) (← links)
- Competitive analysis of randomized paging algorithms (Q1575677) (← links)
- Symmetric graph properties have independent edges (Q1641017) (← links)
- Fast sampling of perfectly uniform satisfying assignments (Q1656573) (← links)
- Fast and flexible probabilistic model counting (Q1656574) (← links)
- Probabilistic model counting with short XORs (Q1680238) (← links)
- Model counting with error-correcting codes (Q2009186) (← links)
- (Q2741510) (← links)
- (Q2768371) (← links)
- Unsatisfiability Bounds for Random CSPs from an Energetic Interpolation Method (Q2843226) (← links)
- Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas (Q2843337) (← links)
- Algorithmic Improvements of the Lovász Local Lemma via Cluster Expansion (Q2957478) (← links)
- Random Walks That Find Perfect Objects and the Lovász Local Lemma (Q3177795) (← links)
- Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract) (Q3191968) (← links)
- Random <i>k</i>‐SAT: Two Moments Suffice to Cross a Sharp Threshold (Q3446816) (← links)
- Symmetric Graph Properties Have Independent Edges (Q3449496) (← links)
- Navigability is a Robust Property (Q3460741) (← links)
- Fast computation of low-rank matrix approximations (Q3546324) (← links)
- On the maximum satisfiability of random formulas (Q3546329) (← links)
- The threshold for random k-SAT is 2 <sup>k</sup> (ln 2 - O(k)) (Q3581271) (← links)
- Tight Lower Bounds for <i>st</i>-Connectivity on the NNJAG Model (Q4268867) (← links)
- On the 2-colorability of random hypergraphs (Q4440429) (← links)
- Two‐coloring random hypergraphs (Q4543631) (← links)
- Focused Stochastic Local Search and the Lovász Local Lemma (Q4575726) (← links)
- Competitive analysis of randomized paging algorithms (Q4595503) (← links)
- (Q4705349) (← links)
- The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘) (Q4821034) (← links)
- Rapid mixing for lattice colourings with fewer colours (Q4968808) (← links)
- Stochastic Control via Entropy Compression (Q5111414) (← links)
- Fast computation of low rank matrix approximations (Q5176019) (← links)
- Random Formulas Have Frozen Variables (Q5189545) (← links)
- A Local Lemma for Focused Stochastic Algorithms (Q5242924) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313025) (← links)
- Machine Learning: ECML 2004 (Q5450721) (← links)
- Learning Theory (Q5473630) (← links)
- (Q5715725) (← links)
- On the solution-space geometry of random constraint satisfaction problems (Q5891921) (← links)
- On the solution‐space geometry of random constraint satisfaction problems (Q5892482) (← links)
- Explosive Percolation in Random Networks (Q5894371) (← links)
- On the bias of traceroute sampling (Q5899511) (← links)
- Almost all graphs with average degree 4 are 3-colorable (Q5901043) (← links)
- The two possible values of the chromatic number of a random graph (Q5901081) (← links)
- On the bias of traceroute sampling (Q5901111) (← links)
- LATIN 2004: Theoretical Informatics (Q5901628) (← links)
- Almost all graphs with average degree 4 are 3-colorable (Q5917586) (← links)
- The two possible values of the chromatic number of a random graph (Q5920569) (← links)
