Correction to probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem

Results related to threshold phenomena research in satisfiability: lower bounds

Theoretical Computer Science - Phase transitions in combinatorial problems

Typical case complexity of satisfiability algorithms and the threshold phenomenon

Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions

On the satisfiability threshold of formulas with three literals per clause

Theoretical Computer Science

Theoretical analysis of Davis-Putnam procedure and propositional satisfiability

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Typical case complexity of Satisfiability Algorithms and the threshold phenomenon

Discrete Applied Mathematics