1. Linear-time algorithms for testing the satisfiability of propositional horn formulae
2. Study of Fine-grained Nested Parallelism in CDCL SAT Solvers
3. Simon Kasif . 1990. On the parallel complexity of discrete relaxation in constraint satisfaction networks. Artificial Intelligence 45, 3 ( 1990 ), 275–286. Simon Kasif. 1990. On the parallel complexity of discrete relaxation in constraint satisfaction networks. Artificial Intelligence 45, 3 (1990), 275–286.
4. Kurt Mehlhorn and Peter Sanders . 2008. Algorithms and Data Structures: The Basic Toolbox (1 ed.) . Springer Publishing Company, Inc orporated, New York, U.S.A. Kurt Mehlhorn and Peter Sanders. 2008. Algorithms and Data Structures: The Basic Toolbox (1 ed.). Springer Publishing Company, Incorporated, New York, U.S.A.
5. Cristopher Moore , Gabriel Istrate , Demetrios Demopoulos , and Moshe Y Vardi . 2007. A continuous–discontinuous second-order transition in the satisfiability of random Horn-SAT formulas. Random Structures & Algorithms 31, 2 ( 2007 ), 173–185. Cristopher Moore, Gabriel Istrate, Demetrios Demopoulos, and Moshe Y Vardi. 2007. A continuous–discontinuous second-order transition in the satisfiability of random Horn-SAT formulas. Random Structures & Algorithms 31, 2 (2007), 173–185.