A Duality between Clause Width and Clause Density for SAT. - Chris Calabro; Russell Impagliazzo; Ramamohan Paturi (CCC, 2006)

A Lower Bound on the Size of Series-Parallel Graphs Dense in Long Paths. - Chris Calabro (Electron. Colloquium Comput. Complex., 2008)

The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. - Chris Calabro; Russell Impagliazzo; Valentine Kabanets; Ramamohan Paturi (J. Comput. Syst. Sci., 2008)

k-SAT Is No Harder Than Decision-Unique-k-SAT. - Chris Calabro; Ramamohan Paturi (CSR, 2009)

The Complexity of Satisfiability of Small Depth Circuits. - Chris Calabro; Russell Impagliazzo; Ramamohan Paturi (IWPEC, 2009)

The exponential complexity of satisfiability problems. - Chris Calabro (2009)

On the Exact Complexity of Evaluating Quantified k -CNF. - Chris Calabro; Russell Impagliazzo; Ramamohan Paturi (Algorithmica, 2013)