| Publication | Date of Publication | Type |
|---|
Computing the well-founded semantics faster
Logic Programming and Nonmonotonic Reasoning | 2022-08-30 | Paper |
| scientific article; zbMATH DE number 6118223 (Why is no real title available?) | 2012-12-23 | Paper |
| Probabilistic analysis of satisfiability algorithms | 2011-03-09 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2009-07-24 | Paper |
| Extending existential quantification in conjuctions of BDDs | 2008-06-18 | Paper |
A sharp threshold for the renameable-Horn and the \(q\)-Horn properties
Discrete Applied Mathematics | 2006-01-10 | Paper |
Typical case complexity of satisfiability algorithms and the threshold phenomenon
Discrete Applied Mathematics | 2006-01-10 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-15 | Paper |
On good algorithms for determining unsatisfiability of propositional formulas
Discrete Applied Mathematics | 2003-09-15 | Paper |
A perspective on certain polynomial-time solvable classes of satisfiability
Discrete Applied Mathematics | 2003-03-09 | Paper |
Some interesting research directions in satisfiability
Annals of Mathematics and Artificial Intelligence | 2002-06-27 | Paper |
Results related to threshold phenomena research in satisfiability: Lower bounds
Theoretical Computer Science | 2002-03-03 | Paper |
| scientific article; zbMATH DE number 1560340 (Why is no real title available?) | 2001-06-05 | Paper |
An algorithm for the class of pure implicational formulas
Discrete Applied Mathematics | 2000-01-17 | Paper |
The probability of pure literals
Journal Of Logic And Computation | 1999-10-31 | Paper |
| scientific article; zbMATH DE number 1113994 (Why is no real title available?) | 1998-06-02 | Paper |
| scientific article; zbMATH DE number 1113992 (Why is no real title available?) | 1998-03-02 | Paper |
Average case results for satisfiability algorithms under the random-clause-width model
Annals of Mathematics and Artificial Intelligence | 1997-10-26 | Paper |
Recent work at the interface of logic, combinatorics, and computer science
Annals of Mathematics and Artificial Intelligence | 1997-05-13 | Paper |
On finding solutions for extended Horn formulas
Information Processing Letters | 1997-02-28 | Paper |
Unique satisfiability of Horn sets can be solved in nearly linear time
Discrete Applied Mathematics | 1995-09-06 | Paper |
Work-preserving emulations of shuffle-exchange networks: An analysis of the complex plane diagram
Discrete Applied Mathematics | 1995-07-24 | Paper |
On the occurence of null clauses in random instances of Satisfiability
Discrete Applied Mathematics | 1993-05-16 | Paper |
The analysis of hashing with lazy deletions
Information Sciences | 1992-06-28 | Paper |
Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms
SIAM Journal on Computing | 1992-06-27 | Paper |
Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem
Information Sciences | 1990-01-01 | Paper |
Probabilistic performance of a heurisic for the satisfiability problem
Discrete Applied Mathematics | 1988-01-01 | Paper |
Correction to ``Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem''
Discrete Applied Mathematics | 1987-01-01 | Paper |
Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem
SIAM Journal on Computing | 1986-01-01 | Paper |
An approximation algorithm for the maximum independent set problem in cubic planar graphs
Networks | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4102824 (Why is no real title available?) | 1984-01-01 | Paper |
Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
Discrete Applied Mathematics | 1983-01-01 | Paper |
