| An introduction to the general theory of algorithms M Machtey, P Young Elsevier Science Inc., 1978 | 595 | 1978 |
| Computing as a discipline DE Comer, D Gries, MC Mulder, A Tucker, AJ Turner, PR Young, ... Communications of the ACM 32 (1), 9-23, 1989 | 236 | 1989 |
| Some remarks on witness functions for nonpolynomial and noncomplete sets in NP D Joseph, P Young Theoretical Computer Science 39, 225-237, 1985 | 125 | 1985 |
| Report of the ACM task force on the core of Computer Science PJ Denning, DE Comer, D Gries, MC Mulder, A Tucker, AJ Turner, ... ACM, 1988 | 64 | 1988 |
| Reductions among polynomial isomorphism types SR Mahaney, P Young Theoretical Computer Science 39, 207-224, 1985 | 61 | 1985 |
| Some structural properties of polynomial reducibilities and sets in NP P Young Proceedings of the fifteenth annual ACM symposium on Theory of computing …, 1983 | 58 | 1983 |
| Properties of polynomial reducibilities and stars in NP P Young Proceedings of the... annual ACM Symposium on Theory of Computing 15, 392, 1983 | 58 | 1983 |
| Easy constructions in complexity theory: Gap and speed-up theorems P Young Proceedings of the American Mathematical Society 37 (2), 555-563, 1973 | 53 | 1973 |
| Linear orderings under one-one reducibility PR Young The Journal of Symbolic Logic 31 (01), 70-85, 1996 | 49 | 1996 |
| Toward a theory of enumerations PR Young Journal of the ACM (JACM) 16 (2), 328-348, 1969 | 49 | 1969 |
| Juris Hartmanis: Fundamental contributions to isomorphism problems P Young Complexity Theory Retrospective, 28-58, 1990 | 48 | 1990 |
| Near-testable sets J Goldsmith, LA Hemachandra, D Joseph, P Young SIAM Journal on Computing 20 (3), 506-523, 1991 | 44 | 1991 |
| A structural overview of NP optimization problems D Bruschi, D Joseph, P Young Algorithms Review 2 (1), 1-26, 1991 | 42 | 1991 |
| A structural overview of NP optimization problems D Bruschi, D Joseph, P Young Optimal Algorithms, 205-231, 1989 | 42 | 1989 |
| Self-reducible, P-selective, near-testable, and P-cheatable sets: The effect of internal structure on the complexity of a set J Goldsmith, D Joseph, P Young University of Wisconsin-Madison, Computer Sciences Department, 1988 | 42 | 1988 |
| How reductions to sparse sets collapse the polynomial-time hierarchy: a primer; part I: polynomial-time Turing reductions P Young ACM SIGACT News 23 (3), 107-117, 1992 | 34 | 1992 |
| Computing as a discipline: preliminary report of the ACM task force on the core of computer science P Denning, DE Comer, D Gries, MC Mulder, AB Tucker, AJ Turner, ... ACM SIGCSE Bulletin 20 (1), 41-41, 1988 | 34 | 1988 |
| Self-reducibility: Effects of internal structure on computational complexity D Joseph, P Young Complexity Theory Retrospective, 82-107, 1990 | 32 | 1990 |
| Self-reducibility: the effects of structure on complexity DA Joseph, P Young University of Wisconsin-Madison, Computer Sciences Department, 1988 | 32* | 1988 |
| Independence results in Computer Science?(Preliminary Version) D Joseph, P Young Proceedings of the twelfth annual ACM symposium on Theory of computing, 58-69, 1980 | 31 | 1980 |
