default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephen R. Mahaney
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1998
[j10]Lance Fortnow, Judy Goldsmith, Matthew A. Levy, Stephen R. Mahaney:
L-Printable Sets. SIAM J. Comput. 28(1): 137-151 (1998)- 1997
- [j9]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) - [j8]Anne Condon, Faith E. Fich, Greg N. Frederickson, Andrew V. Goldberg, David S. Johnson, Michael C. Loui, Steven Mahaney, Prabhakar Raghavan, John E. Savage, Alan L. Selman, David B. Shmoys
:
Strategic directions in research in theory of computing. SIGACT News 28(3): 75-93 (1997) - 1996
- [c15]Lance Fortnow, Judy Goldsmith, Stephen R. Mahaney:
L-Printable Sets. CCC 1996: 97-106 - [c14]Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer, Janos Simon:
Active transport in biological computing. DNA Based Computers 1996: 171-179 - [c13]Fred S. Roberts, Bernard Chazelle, Stephen R. Mahaney:
Foreword. The Spin Verification System 1996: vii- - 1995
- [j7]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) - [c12]Sampath Kannan, Z. Sweedyk, Stephen R. Mahaney:
Counting and Random Generation of Strings in Regular Languages. SODA 1995: 551-557 - 1992
- [c11]Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer:
Average Dependence and Random Oracles. SCT 1992: 306-317
1980 – 1989
- 1989
- [j6]Neil Immerman, Stephen R. Mahaney:
Relativizing Relativized Computations. Theor. Comput. Sci. 68(3): 267-276 (1989) - [c10]Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer:
The Isomorphism Conjecture Fails Relative to a Random Oracle (abstract). SCT 1989: 2 - [c9]Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer:
The Isomorphism Conjecture Fails Relative to a Random Oracle (Extended Abstract). STOC 1989: 157-166 - 1988
- [j5]Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer:
Collapsing Degrees. J. Comput. Syst. Sci. 37(2): 247-268 (1988) - [c8]Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer:
On the Power of 1-way Functions (Abstract). CRYPTO 1988: 578-579 - 1987
- [c7]Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer:
Progress on collapsing degrees. SCT 1987: 126-131 - 1986
- [j4]Brenda S. Baker, Steven Fortune, Stephen R. Mahaney:
Polygon Containment under Translation. J. Algorithms 7(4): 532-548 (1986) - [c6]Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer:
Collapsing Degrees (Extended Abstract). FOCS 1986: 380-389 - 1985
- [j3]Stephen R. Mahaney, Paul Young:
Reductions Among Polynomial Isomorphism Types. Theor. Comput. Sci. 39: 207-224 (1985) - [c5]Stephen R. Mahaney, Fred B. Schneider:
Inexact Agreement: Accuracy, Precision, and Graceful Degradation. PODC 1985: 237-249 - 1982
- [j2]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
- [b1]Stephen R. Mahaney:
Sparse NP-Complete Sets. Cornell University, USA, 1981 - [j1]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) - [c4]Stephen R. Mahaney:
On the Number of P-Isomorphism Classes of NP-Complete Sets. FOCS 1981: 271-278 - 1980
- [c3]Stephen R. Mahaney:
Sparse Complete Sets for NP: Solution of a Conjecture of Berman and Hartmanis. FOCS 1980: 54-60 - [c2]Juris Hartmanis, Stephen R. Mahaney:
An Eassay about Research on Sparse NP Complete Sets. MFCS 1980: 40-57
1970 – 1979
- 1978
- [c1]Juris Hartmanis, Neil Immerman, Stephen R. Mahaney:
One-Way Log-Tape Reductions. FOCS 1978: 65-72
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
