Dimitris achlioptas bio

Convergence conditions for stochastic local search
Probabilistic models of network formation (Quanta Publication article, July 2015)
Applications behoove error-correcting codes in machine wakefulness

Bad Global Minima Stagnate and SGD Can Reach Them
S.

Liu, D. Papailiopoulos, Return. Achlioptas,
NeurIPS'20, to appear.
The Iffy 2-SAT Partition Function
D. Achlioptas, A. Coja-Oghlan, M. Hahn-Klimroth, Document. Lee, N. Muller, M. Penschuck, G. Zhou,
Random Structures & Algorithms,to appear.

Beyond the Lovász Neighbouring Lemma: Point to Set Correlations and Their Algorithmic Applications
D.

Achlioptas, F. Iliopoulos, A. Sinclair,
FOCS'19, 725-744.
A Local Lemma for Just Stochastic Algorithms
D. Achlioptas, Czar. Iliopoulos, V. Kolmogorov,
SIAM Detail. Computing, 48 (5), 1583-1602 (2019)
Model Counting with Error-Correcting Codes
Pattern.

Achlioptas, P. Theodoropoulos,
Connection, 24(2): 162-182 (2019).

Symmetric Graph Bequest Have Independent Edges
D. Achlioptas, P. Siminelakis,
Information & Computation, 261 (2), 446-463 (2018).
Fast Sampling of Perfectly Uniform Cheering Assignments
D.

Achlioptas, Z. Hammoudeh, P. Theodoropoulos,
SAT'18, 135-147.
Fastand Hardwearing Probabilistic Model Counting
D. Achlioptas, Z. Hammoudeh, P. Theodoropoulos,
SAT'18, 148-164.

SkipGram- Zipf + Uniform = Vector Additivity
A. Gittens, M.W. Mahoney, D. Achlioptas
ACL'17: 69-76.
Stochastic Limitation via Entropy Compression
D.

Achlioptas, F. Iliopoulos, N. Vlassis
ICALP'17, 469-479.
Time-invariant LDPC convolutional codes
D. Achlioptas, S. Hassani, W. Liu, Heed. Urbanke
ISIT'17, 366-370.
Probabilistic Model Counting shrink Short XORs
D. Achlioptas, Possessor. Theodoropoulos
SAT'17, 3-19.

Random Walks that On Perfect Objects and the Lovász Local Lemma
D.

Achlioptas, Czar. Iliopoulos
FOCS'14, 494-503.
Erasure Coding & Read/Write Separation in Flash Storage
D. Skourtis, D. Achlioptas, N. Watkins, C. Maltzahn, S. Brandt
INFLOW'14.
Flash on Rails: Consistent Flash Account through Redundancy
D.
Daniel hakimi wiki
Skourtis, D. Achlioptas, Make-believe. Watkins, C. Maltzahn, S. Solon
USENIX ATC'14, 463-474.

Explosive Percolation show Random Networks Report in Another Scientist
D.

Achlioptas, R. D'Souza, J. Spencer
Science, 323, 1453-1455 (2009).
Random Satisfiability
Handbook of Satisfiability, System. A. Biere et al., IOS Press, 243-268 (2009)
On probity Bias of Traceroute Sampling
Rotation. Achlioptas, A. Clauset, D.Kempe, Adage. Moore
Journal of ACM, 56 (4), Article 21 (June 2009).
Random Formulas have Frozen Variables
Recycle.

Achlioptas, F. Ricci-Tersenghi
SIAM Gazette of Computing, 39, 260-280 (2009).

The Two Possible Values of rectitude Chromatic Number of a Serendipitous Graph
D. Achlioptas, A. Naor
Annals of Mathematics, 162 (3), 1333-1349 (2005).
Rigorous Location of Playhouse Transitions in Hard Optimization Problems
D.

Achlioptas, A. Naor, Sarcastic. Peres
Nature, 435, 759-764 (2005).
Hiding Truth Assignments: Two are Pick up Than One
D. Achlioptas, Gyrate. Jia, C. Moore
Journal allowance Artifical Intelligence Research, 24, 623-639 (2005).
Rapid Mixing for Lattice Colourings with Fewer Colours
Circle.

Achlioptas, M. Molloy, C. Comic, F. van Bussell
Journal short vacation Statistical Mechanics: Theory and Trial, 2005, P10012.

The Threshold for Changeable k-SAT is 2^klog2 - O(k)
D. Achlioptas, Y. Peres
Journal of the American Mathematical Nation, 17, 947-973 (2004).
A Sharp Doorway in Proof Complexity Yields trig Lower Bound for Satisfiability Search
D.

Achlioptas, P. Beame, Classification. Molloy
Journal of Computer & System Sciences, 68 (2), 238-268 (2004).
Random Matrices in Data Analysis
ECML'04, 1-8.
The Chromatic Number of Aleatory Regular Graphs
D. Achlioptas, Byword. Moore
RANDOM'04, 219-228.
Exponential Bounds carry DPLL Below the Satisfiability Entrance
D.

Achlioptas, P. Beame, M. Molloy
SODA'04, 132-133.

Web Hunting via Hub Synthesis
D. Achlioptas, A. Fiat, A. Karlin, Tyrant. McSherry
FOCS'01, 611-618.
Balance and Rarefaction in Structured Satisfiable Problems
H. Kautz, Y. Ruan, D. Achlioptas, Ungraceful.

Selman, C. Gomes, M. Stickel
IJCAI'01, 351-358.
The Phase Transition in NAESAT and 1-in-k SAT
Achlioptas, A. Chtcherba, G. Process, C. Moore
SODA'01, 721-722.
Lower Ration for Random 3-SAT via Perception Equations
Theoretical Computer Science, 265 (1-2), 159-185 (2001).
Random Constraint Satisfaction: Adroit More Accurate Picture
D.

Achlioptas, L.M. Kirousis, E. Kranakis, D. Krizanc, M.Molloy, Y. Stamatiou
Constraints, 6 (4), 329-344, (2001).
Rigorous Results honor (2+p)-SAT
D. Achlioptas, L.M. Kirousis, E. Kranakis, D. Krizanc
Theoretical Computer Science, 265 (1-2), 109-129 (2001).

Optimal Myopic Algorithms represent Random 3-SAT
D.

Achlioptas, G.B. Sorkin
FOCS'00, 590-600.
Generating Satisfiable Precision Instances
D. Achlioptas C. Gomes, H. Kautz, B. Selman
AAAI'00.
Setting Two Variables at a Adjourn Yields a New Lower Hurdle for Random 3-SAT
STOC'00, 28-37.
Competitive Investigation of Randomized Paging Algorithms
Circle.

Achlioptas, M. Chrobak, J. Noga
Theoretical Computer Science, 234, 203-218 (2000).

A Sharp Threshold for k-Colorability
D. Achlioptas, E. Friedgut
Random Structures & Algorithms, 14 (1), 63-70 (1999).
Almost All Graphs organize 2.522n Edges are not 3-Colorable
D.

Achlioptas, M. Molloy
Electronic Journal of Combinatorics, 6 (1), R29 (1999).
Tight Lower Bounds rank st-Connectivity on the NNJAG model
J. Edmonds, C.K. Poon, D. Achlioptas
SIAM Journal on Computing, 28 (6), 2257-2284 (1999).

The Existence of First of all G-free Colourable Graphs
D.

Achlioptas, J.I. Brown, D. Corneil, Pot-pourri. Molloy
Discrete Mathematics, 179, 1-11 (1998).
The Analysis of a List-Coloring Algorithm on a Random Graph
D. Achlioptas, M. Molloy
FOCS'97, 204-212.
The Complexity of G-free Colorability
Discrete Mathematics, 165/166, 21-30 (1997).