| |
| 1994 | ||
|---|---|---|
| 8 | Joseph C. Culberson, Robert A. Reckhow: Covering Polygons Is Hard. J. Algorithms 17(1): 2-44 (1994) | |
| 1989 | ||
| 7 | Joseph C. Culberson, Robert A. Reckhow: Orthogonally Convex Coverings of Orthogonal Polygons without Holes. J. Comput. Syst. Sci. 39(2): 166-204 (1989) | |
| 1988 | ||
| 6 | Joseph C. Culberson, Robert A. Reckhow: Covering Polygons Is Hard (Preliminary Abstract) FOCS 1988: 601-611 | |
| 1987 | ||
| 5 | EE | Robert A. Reckhow, Joseph C. Culberson: Covering a Simple Orthogonal Polygon with a Minimum Number of Orthogonally Convex Polygons. Symposium on Computational Geometry 1987: 268-277 |
| 1979 | ||
| 4 | Stephen A. Cook, Robert A. Reckhow: The Relative Efficiency of Propositional Proof Systems. J. Symb. Log. 44(1): 36-50 (1979) | |
| 1974 | ||
| 3 | Stephen A. Cook, Robert A. Reckhow: On the Lengths of Proofs in the Propositional Calculus (Preliminary Version) STOC 1974: 135-148 | |
| 1973 | ||
| 2 | Stephen A. Cook, Robert A. Reckhow: Time Bounded Random Access Machines. J. Comput. Syst. Sci. 7(4): 354-375 (1973) | |
| 1972 | ||
| 1 | Stephen A. Cook, Robert A. Reckhow: Time-Bounded Random Access Machines STOC 1972: 73-80 | |
| 1 | Stephen A. Cook | [1] [2] [3] [4] |
| 2 | Joseph C. Culberson | [5] [6] [7] [8] |