A Better Algorithm for Random k-SAT
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On the random satisfiable process
Combinatorics, Probability and Computing
On random betweenness constraints
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Public-key cryptography from different assumptions
Proceedings of the forty-second ACM symposium on Theory of computing
Phase transition for the mixing time of the Glauber dynamics for coloring regular trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Reconstruction threshold for the hardcore model
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
A Better Algorithm for Random $k$-SAT
SIAM Journal on Computing
The decimation process in random k-SAT
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
The condensation transition in random hypergraph 2-coloring
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A simple algorithm for random colouring G(n, d/n) using (2 + ε)d colours
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The set of solutions of random XORSAT formulae
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On independent sets in random graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Coloring random graphs online without creating monochromatic subgraphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Phase transition for Glauber dynamics for independent sets on regular trees
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On belief propagation guided decimation for random k-SAT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Catching the k-NAESAT threshold
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The freezing threshold for k-colourings of a random graph
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Exponential lower bounds for DPLL algorithms on satisfiable random 3-CNF formulas
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Unsatisfiability bounds for random CSPs from an energetic interpolation method
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Going after the k-SAT threshold
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Average-case complexity of backtrack search for coloring sparse random graphs
Journal of Computer and System Sciences
| Hi-index | 0.00 |
N/A