Chris Calabro

	2009
5		Chris Calabro, Ramamohan Paturi: k-SAT Is No Harder Than Decision-Unique-k-SAT. CSR 2009: 59-70
	2008
4		Chris Calabro: A Lower Bound on the Size of Series-Parallel Graphs Dense in Long Paths. Electronic Colloquium on Computational Complexity (ECCC) 15(110): (2008)
3		Chris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi: The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. J. Comput. Syst. Sci. 74(3): 386-393 (2008)
	2006
2		Chris Calabro, Russell Impagliazzo, Ramamohan Paturi: A Duality between Clause Width and Clause Density for SAT. IEEE Conference on Computational Complexity 2006: 252-260
	2003
1		Chris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi: The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. IEEE Conference on Computational Complexity 2003: 135-

Coauthor Index

1	Russell Impagliazzo	[1] [2] [3]
2	Valentine Kabanets	[1] [3]
3	Ramamohan Paturi	[1] [2] [3] [5]