Stephen R. Mahaney

According to our database1, Stephen R. Mahaney authored at least 25 papers between 1978 and 1998.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1998
L-Printable Sets.
SIAM J. Comput., 1998

1997
Strategic directions in research in theory of computing.
SIGACT News, 1997

A Quasi-Polynomial-Time Algorithm for Sampling Words from a Context-Free Language.
Inf. Comput., 1997

1996
Foreword.
Proceedings of the Spin Verification System, 1996

Active transport in biological computing.
Proceedings of the DNA Based Computers, 1996

L-Printable Sets.
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

1995
The Isomorphism Conjecture Fails Relative to a Random Oracle.
J. ACM, 1995

Counting and Random Generation of Strings in Regular Languages.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1992
Average Dependence and Random Oracles.
Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992

1989
Relativizing Relativized Computations.
Theor. Comput. Sci., 1989

The Isomorphism Conjecture Fails Relative to a Random Oracle (Extended Abstract)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

The Isomorphism Conjecture Fails Relative to a Random Oracle (abstract).
Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989

1988
Collapsing Degrees.
J. Comput. Syst. Sci., 1988

On the Power of 1-way Functions (Abstract).
Proceedings of the Advances in Cryptology, 1988

1987
Progress on collapsing degrees.
Proceedings of the Second Annual Conference on Structure in Complexity Theory, 1987

1986
Polygon Containment under Translation.
J. Algorithms, 1986

Collapsing Degrees (Extended Abstract)
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985
Reductions Among Polynomial Isomorphism Types.
Theor. Comput. Sci., 1985

Inexact Agreement: Accuracy, Precision, and Graceful Degradation.
Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985

1982
Sparse Complete Sets of NP: Solution of a Conjecture of Berman and Hartmanis.
J. Comput. Syst. Sci., 1982

1981
Sparse NP-Complete Sets.
PhD thesis, 1981

Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata.
SIAM J. Comput., 1981

On the Number of P-Isomorphism Classes of NP-Complete Sets
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980
An Eassay about Research on Sparse NP Complete Sets.
Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

1978
One-Way Log-Tape Reductions
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978


  Loading...