1998 |
21 | | Lance Fortnow,
Judy Goldsmith,
Matthew A. Levy,
Stephen R. Mahaney:
L-Printable Sets.
SIAM J. Comput. 28(1): 137-151 (1998) |
1997 |
20 | | Vivek Gore,
Mark Jerrum,
Sampath Kannan,
Z. Sweedyk,
Stephen R. Mahaney:
A Quasi-Polynomial-Time Algorithm for Sampling Words from a Context-Free Language.
Inf. Comput. 134(1): 59-74 (1997) |
1996 |
19 | EE | Lance Fortnow,
Judy Goldsmith,
Stephen R. Mahaney:
L-Printable Sets.
IEEE Conference on Computational Complexity 1996: 97-106 |
1995 |
18 | | Sampath Kannan,
Z. Sweedyk,
Stephen R. Mahaney:
Counting and Random Generation of Strings in Regular Languages.
SODA 1995: 551-557 |
17 | EE | Stuart A. Kurtz,
Stephen R. Mahaney,
James S. Royer:
The Isomorphism Conjecture Fails Relative to a Random Oracle.
J. ACM 42(2): 401-420 (1995) |
1992 |
16 | | Stuart A. Kurtz,
Stephen R. Mahaney,
James S. Royer:
Average Dependence and Random Oracles.
Structure in Complexity Theory Conference 1992: 306-317 |
1989 |
15 | | Stuart A. Kurtz,
Stephen R. Mahaney,
James S. Royer:
The Isomorphism Conjecture Fails Relative to a Random Oracle (Extended Abstract)
STOC 1989: 157-166 |
14 | | Stuart A. Kurtz,
Stephen R. Mahaney,
James S. Royer:
The Isomorphism Conjecture Fails Relative to a Random Oracle (abstract).
Structure in Complexity Theory Conference 1989: 2 |
13 | | Neil Immerman,
Stephen R. Mahaney:
Relativizing Relativized Computations.
Theor. Comput. Sci. 68(3): 267-276 (1989) |
1988 |
12 | EE | Stuart A. Kurtz,
Stephen R. Mahaney,
James S. Royer:
On the Power of 1-way Functions (Abstract).
CRYPTO 1988: 578-579 |
11 | | Stuart A. Kurtz,
Stephen R. Mahaney,
James S. Royer:
Collapsing Degrees.
J. Comput. Syst. Sci. 37(2): 247-268 (1988) |
1986 |
10 | | Stuart A. Kurtz,
Stephen R. Mahaney,
James S. Royer:
Collapsing Degrees (Extended Abstract)
FOCS 1986: 380-389 |
9 | | Brenda S. Baker,
Steven Fortune,
Stephen R. Mahaney:
Polygon Containment under Translation.
J. Algorithms 7(4): 532-548 (1986) |
1985 |
8 | | Stephen R. Mahaney,
Fred B. Schneider:
Inexact Agreement: Accuracy, Precision, and Graceful Degradation.
PODC 1985: 237-249 |
7 | | Stephen R. Mahaney,
Paul Young:
Reductions Among Polynomial Isomorphism Types.
Theor. Comput. Sci. 39: 207-224 (1985) |
1982 |
6 | | Stephen R. Mahaney:
Sparse Complete Sets of NP: Solution of a Conjecture of Berman and Hartmanis.
J. Comput. Syst. Sci. 25(2): 130-143 (1982) |
1981 |
5 | | Stephen R. Mahaney:
On the Number of P-Isomorphism Classes of NP-Complete Sets
FOCS 1981: 271-278 |
4 | | Juris Hartmanis,
Stephen R. Mahaney:
Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata.
SIAM J. Comput. 10(2): 383-390 (1981) |
1980 |
3 | | Stephen R. Mahaney:
Sparse Complete Sets for NP: Solution of a Conjecture of Berman and Hartmanis
FOCS 1980: 54-60 |
2 | | Juris Hartmanis,
Stephen R. Mahaney:
An Eassay about Research on Sparse NP Complete Sets.
MFCS 1980: 40-57 |
1978 |
1 | | Juris Hartmanis,
Neil Immerman,
Stephen R. Mahaney:
One-Way Log-Tape Reductions
FOCS 1978: 65-72 |