The following pages link to Demetrios Achlioptas (Q1356725):
Displaying 21 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)
- Focused Stochastic Local Search and the Lovász Local Lemma (Q4575726) (← links)
- Stochastic Control via Entropy Compression (Q5111414) (← links)
- The random 2-SAT partition function (Q6334473) (← links)
