default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDeborah Joseph
Person information
- affiliation: University of Wisconsin-Madison, Madison, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2002
[c15]Amy M. Hauth, Deborah Joseph:
Beyond tandem repeats: complex pattern structures and distant regions of similarity. ISMB 2002: 31-37
1990 – 1999
- 1994
- [c14]Deborah Joseph, Randall Pruim, Paul Young:
Collapsing Degrees in Subexponential Time. SCT 1994: 367-382 - 1993
- [j14]Judy Goldsmith
, Deborah Joseph:
Relativized Isomorphisms of NP-Complete Sets. Comput. Complex. 3: 186-205 (1993) - [j13]Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph, José Soares:
On Sparse Spanners of Weighted Graphs. Discret. Comput. Geom. 9: 81-100 (1993) - [j12]Judy Goldsmith, Deborah Joseph, Paul Young:
Using Self-Reducibilities to Characterize Polynomial Time. Inf. Comput. 104(2): 288-308 (1993) - [j11]Judy Goldsmith, Deborah Joseph, Paul Young:
A Note on Bi-immunity and p-Closeness of p-Cheatable Sets in P/Poy. J. Comput. Syst. Sci. 46(3): 349-362 (1993) - 1992
- [j10]Gautam Das, Deborah Joseph:
Minimum Vertex Hulls for Polyhedral Domains. Theor. Comput. Sci. 103(1): 107-135 (1992) - [c13]Deborah Joseph, Joao Meidanis, Prasoon Tiwari:
Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs. SWAT 1992: 326-337 - 1991
- [j9]Judy Goldsmith, Lane A. Hemachandra, Deborah Joseph, Paul Young:
Near-Testable Sets. SIAM J. Comput. 20(3): 506-523 (1991) - 1990
- [j8]Danilo Bruschi, Deborah Joseph, Paul Young:
Strong Separations for the Boolean Hierarchy over RP. Int. J. Found. Comput. Sci. 1(3): 201-218 (1990) - [c12]Gautam Das, Deborah Joseph:
Minimum Vertex Hulls for Polyhedral Domains. STACS 1990: 126-137 - [c11]Deborah Joseph, Meera Sitharam:
Kolmogorov Complexity, Restrited Nondeterminism and Generalized Spectra. STACS 1990: 152-164 - [c10]Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph:
Generating Sparse Spanners for Weighted Graphs. SWAT 1990: 26-37
1980 – 1989
- 1989
- [c9]Alberto Bertoni, Danilo Bruschi, Deborah Joseph, Meera Sitharam, Paul Young:
Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract). FCT 1989: 35-46 - [c8]Gautam Das, Deborah Joseph:
Which Triangulations Approximate the Complete Graph?. Optimal Algorithms 1989: 168-192 - [c7]Danilo Bruschi, Deborah Joseph, Paul Young:
A Structural Overview of NP Optimization Problems. Optimal Algorithms 1989: 205-231 - 1988
- [j7]Deborah Joseph, Paul Young:
The Structural Complexity Column, guest authors. Bull. EATCS 36: 66-84 (1988) - 1987
- [c6]Judy Goldsmith, Deborah Joseph, Paul Young:
Self-Reducible, P-Selectlve, Near-Testable, Near-Testable, and P-Cheatable Sets: The Effect of Internal Structure on the Complexity of a Set. SCT 1987: 50-59 - 1986
- [c5]Judy Goldsmith, Deborah Joseph:
Three Results on the Polynomial Isomorphism of Complete Sets. FOCS 1986: 390-397 - 1985
- [j6]John E. Hopcroft, Deborah Joseph, Sue Whitesides:
On the Movement of Robot Arms in 2-Dimensional Bounded Regions. SIAM J. Comput. 14(2): 315-333 (1985) - [j5]Deborah Joseph, Paul Young:
Some Remarks on Witness Functions for Nonpolynomial and Noncomplete Sets in NP. Theor. Comput. Sci. 39: 225-237 (1985) - 1984
- [j4]John E. Hopcroft, Deborah Joseph, Sue Whitesides:
Movement Problems for 2-Dimensional Linkages. SIAM J. Comput. 13(3): 610-629 (1984) - 1983
- [j3]Deborah Joseph:
Polynomial Time Computations in Models of ET. J. Comput. Syst. Sci. 26(3): 311-338 (1983) - 1982
- [j2]Deborah Joseph, Paul Young:
Corrigendum: Independence Results in Computer Science? J. Comput. Syst. Sci. 24(3): 378 (1982) - [c4]John E. Hopcroft, Deborah Joseph, Sue Whitesides:
On the Movement of Robot Arms in 2-Dimensional Bounded Regions. FOCS 1982: 280-289 - 1981
- [j1]Deborah Joseph, Paul Young:
Independence Results in Computer Science? J. Comput. Syst. Sci. 23(2): 205-222 (1981) - [c3]Deborah Joseph, Paul Young:
A Survey of Some Recent Results on Computational Complexity in Weak Theories of Arithmetic. MFCS 1981: 46-60 - [c2]Deborah Joseph, Paul Young:
Fast Programs for Initial Segments and Polynomial Time Computation in Weak Models of Arithmetic (Preliminary Abstract). STOC 1981: 55-61 - 1980
- [c1]Deborah Joseph, Paul Young:
Independence Results in Computer Science? (Preliminary Version). STOC 1980: 58-69
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 2024-05-02 21:01 CEST 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:
