Time Bounded Random Access Machines. - Stephen A. Cook; Robert A. Reckhow (J. Comput. Syst. Sci., 1973)

On the Lengths of Proofs in the Propositional Calculus (Preliminary Version) - Stephen A. Cook; Robert A. Reckhow (STOC, 1974)

Corrections for "On the lengths of proofs in the propositional calculus preliminary version". - Stephen A. Cook; Robert A. Reckhow (SIGACT News, 1974)

The Relative Efficiency of Propositional Proof Systems. - Stephen A. Cook; Robert A. Reckhow (J. Symb. Log., 1979)

Covering a Simple Orthogonal Polygon with a Minimum Number of Orthogonally Convex Polygons. - Robert A. Reckhow; Joseph C. Culberson (SCG, 1987)

Covering Polygons Is Hard (Preliminary Abstract) - Joseph C. Culberson; Robert A. Reckhow (FOCS, 1988)

Orthogonally Convex Coverings of Orthogonal Polygons without Holes. - Joseph C. Culberson; Robert A. Reckhow (J. Comput. Syst. Sci., 1989)

Covering Polygons Is Hard. - Joseph C. Culberson; Robert A. Reckhow (J. Algorithms, 1994)

The Relative Efficiency of Propositional Proof Systems. - Stephen A. Cook; Robert A. Reckhow (Logic, Automata, and Computational Complexity, 2023)