Gap-definable counting classes SA Fenner, LJ Fortnow, SA Kurtz Journal of Computer and System Sciences 48 (1), 116-148, 1994 | 314 | 1994 |

Randomness and genericity in the degrees of unsolvability SA Kurtz University of Illinois at Urbana-Champaign, 1981 | 240 | 1981 |

A discrete logarithm implementation of perfect zero-knowledge blobs JF Boyar, SA Kurtz, MW Krentel Journal of Cryptology 2, 63-76, 1990 | 110 | 1990 |

An oracle builder’s toolkit S Fenner, L Fortnow, SA Kurtz, L Li Information and Computation 182 (2), 95-136, 2003 | 108 | 2003 |

The isomorphism conjecture fails relative to a random oracle SA Kurtz, SR Mahaney, JS Royer Journal of the ACM (JACM) 42 (2), 401-420, 1995 | 107 | 1995 |

On the random oracle hypothesis SA Kurtz Proceedings of the fourteenth annual ACM symposium on Theory of computing …, 1982 | 83 | 1982 |

Extremes in the degrees of inferability L Fortnow, W Gasarch, S Jain, E Kinber, M Kummer, S Kurtz, ... Annals of pure and applied logic 66 (3), 231-276, 1994 | 72 | 1994 |

Notions of weak genericity SA Kurtz The Journal of symbolic logic 48 (3), 764-770, 1983 | 69 | 1983 |

The undecidability of the generalized Collatz problem SA Kurtz, J Simon International Conference on Theory and Applications of Models of Computation …, 2007 | 65 | 2007 |

The structure of complete degrees SA Kurtz, SR Mahaney, JS Royer Complexity Theory Retrospective: In Honor of Juris Hartmanis on the Occasion …, 1990 | 64 | 1990 |

Collapsing degrees SA Kurtz, SR Mahaney, JS Royer Journal of Computer and System Sciences 37 (2), 247-268, 1988 | 62 | 1988 |

Recursion theory and ordered groups RG Downey, SA Kurtz Annals of Pure and Applied Logic 32, 137-151, 1986 | 48 | 1986 |

A relativized failure of the Berman-Hartmanis conjecture SA Kurtz University of Chicago, 1983 | 42 | 1983 |

The isomorphism conjecture holds relative to an oracle S Fenner, L Fortnow, SA Kurtz SIAM Journal on Computing 25 (1), 193-206, 1996 | 38 | 1996 |

Active transport in biological computing SA Kurtz Second Annual Meeting on DNA Based Computers, 111-121, 1996 | 37 | 1996 |

Biological computing SA Kurtz¹, SR Mahaney, JS Royer, J Simon Complexity Theory: Retrospective II 2, 179, 1997 | 35 | 1997 |

Sparse Sets in: Relativizations SA Kurtz SIAM Journal on Computing 14 (1), 113-119, 1985 | 35 | 1985 |

On 1-truth-table-hard languages S Homer, S Kurtz, J Royer Theoretical Computer Science 115 (2), 383-389, 1993 | 27 | 1993 |

On the role of search for learning S Kurtz, CH Smith, R Rivest, D Haussler, M Warmuth Proceedings of the Second Annual Workshop on Computational Learning Theory …, 1989 | 21 | 1989 |

How to prove representation-independent independence results SA Kurtz, MJ O'Donnell, JS Royer Information Processing Letters 24 (1), 5-10, 1987 | 18 | 1987 |