Algorithms for sat and upper bounds on their complexity (2001).

Local Search Algorithms for SAT: Worst-Case Analysis (1998)

Article

New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT (2000)

Algorithms for k-sat based on covering codes (2000).

A New Algorithm for MAX-2-SAT (1999)

Conference Proceedings

Worst-case analysis, 3-sat decision and lower bounds: approaches for improved sat algorithms.

Article

Finding Hard Instances of the Satisfiability Problem: A Survey (1997)

Article

Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms (2005)

Clause shortening combined with pruning yields a new upper bound for deterministic sat algorithms (2005).