Stuart A. Kurtz

According to our database, Stuart A. Kurtz authored at least 35 papers between 1983 and 2017.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2017

Lemonade from Lemons: Harnessing Device Wearout to Create Limited-Use Security Architectures.

Zhaoxia Deng, Ariel Feldman, Stuart A. Kurtz, Frederic T. Chong

Proceedings of the 44th Annual International Symposium on Computer Architecture, 2017

2007

The Undecidability of the Generalized Collatz Problem.

Stuart A. Kurtz, Janos Simon

Proceedings of the Theory and Applications of Models of Computation, 2007

2004

Every polynomial-time 1-degree collapses if and only if P = PSPACE.

Stephen A. Fenner, Stuart A. Kurtz, James S. Royer

J. Symb. Log., 2004

2003

An oracle builder's toolkit.

Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz, Lide Li

Inf. Comput., 2003

2001

On the role of search for learning from examples.

Stuart A. Kurtz, Carl H. Smith, Rolf Wiehagen

J. Exp. Theor. Artif. Intell., 2001

1998

On the Relative Sizes of Learnable Sets.

Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan

Theor. Comput. Sci., 1998

1996

The Isomorphism Conjecture Holds Relative to an Oracle.

Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz

SIAM J. Comput., 1996

Active transport in biological computing.

Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer, Janos Simon

Proceedings of the DNA Based Computers, 1996

1995

The Isomorphism Conjecture Fails Relative to a Random Oracle.

Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer

J. ACM, 1995

Measure, Category and Learning Theory.

Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994

The infinite version of an open communication complexity problem is independent of the axioms of set theory.

Lance Fortnow, Stuart A. Kurtz, Duke Whang

SIGACT News, 1994

Gap-Definable Counting Classes.

Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz

J. Comput. Syst. Sci., 1994

Extremes in the Degrees of Inferability.

Lance Fortnow, William I. Gasarch, Sanjay Jain, Efim B. Kinber, Martin Kummer, Stuart A. Kurtz, Mark Pleszkovich, Theodore A. Slaman, Robert Solovay, Frank Stephan

Ann. Pure Appl. Log., 1994

1993

On A-Truth-Table-Hard Languages.

Steven Homer, Stuart A. Kurtz, James S. Royer

Theor. Comput. Sci., 1993

An Oarcle Builder's Toolkit.

Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz, Lide Li

Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

1992

Degrees of Inferability.

Peter Cholak, Efim B. Kinber, Rodney G. Downey, Martin Kummer, Lance Fortnow, Stuart A. Kurtz, William I. Gasarch, Theodore A. Slaman

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

Average Dependence and Random Oracles.

Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer

Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992

1991

Connecting Formal Semantics to Constructive Intuitions.

Stuart A. Kurtz, John C. Mitchell, Michael J. O'Donnell

Proceedings of the Constructivity in Computer Science, 1991

1990

A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs.

Joan Boyar, Stuart A. Kurtz, Mark W. Krentel

J. Cryptol., 1990

1989

The Isomorphism Conjecture Fails Relative to a Random Oracle (Extended Abstract)

Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Every Polynomial-Time 1-Degree Collapses iff P=PSPACE

Stephen A. Fenner, Stuart A. Kurtz, James S. Royer

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

On the Role of Search for Learning.

Stuart A. Kurtz, Carl H. Smith

Proceedings of the Second Annual Workshop on Computational Learning Theory, 1989

The Isomorphism Conjecture Fails Relative to a Random Oracle (abstract).

Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer

Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989

A Refutation of Barzdins' Conjecture.

Stuart A. Kurtz, Carl H. Smith

Proceedings of the Analogical and Inductive Inference, 1989

1988

Collapsing Degrees.

Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer

J. Comput. Syst. Sci., 1988

On the Power of 1-way Functions (Abstract).

Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer

Proceedings of the Advances in Cryptology, 1988

Prudence in Language Learning.

Stuart A. Kurtz, James S. Royer

Proceedings of the First Annual Workshop on Computational Learning Theory, 1988

1987

A Note on Randomized Polynomial Time.

Stuart A. Kurtz

SIAM J. Comput., 1987

How to Prove Representation-Independent Independence Results.

Stuart A. Kurtz, Michael J. O'Donnell, James S. Royer

Inf. Process. Lett., 1987

Progress on collapsing degrees.

Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer

Proceedings of the Second Annual Conference on Structure in Complexity Theory, 1987

1986

Recursion theory and ordered groups.

Rodney G. Downey, Stuart A. Kurtz

Ann. Pure Appl. Log., 1986

Collapsing Degrees (Extended Abstract)

Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985

Sparse Sets in NP - P: Relativizations.

Stuart A. Kurtz

SIAM J. Comput., 1985

1983

On the Random Oracle Hypothesis

Stuart A. Kurtz

Inf. Control., April, 1983

Notions of Weak Genericity.

Stuart A. Kurtz

J. Symb. Log., 1983