Deborah Joseph

Publication Activity (10 Years)

Years Active: 1980-2002
Publications (10 Years): 0

Publications

Amy M. Hauth, Deborah Joseph
Beyond tandem repeats: complex pattern structures and distant regions of similarity. ISMB (2002)
Deborah Joseph, Randall Pruim, Paul Young
Collapsing Degrees in Subexponential Time. Computational Complexity Conference (1994)
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) (1993)
Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph, José Soares
On Sparse Spanners of Weighted Graphs. Discret. Comput. Geom. 9 (1993)
Judy Goldsmith, Deborah Joseph, Paul Young
Using Self-Reducibilities to Characterize Polynomial Time Inf. Comput. 104 (2) (1993)
Judy Goldsmith, Deborah Joseph
Relativized Isomorphisms of NP-Complete Sets. Comput. Complex. 3 (1993)
Gautam Das, Deborah Joseph
Minimum Vertex Hulls for Polyhedral Domains. Theor. Comput. Sci. 103 (1) (1992)
Deborah Joseph, Joao Meidanis, Prasoon Tiwari
Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs. SWAT (1992)
Judy Goldsmith, Lane A. Hemachandra, Deborah Joseph, Paul Young
Near-Testable Sets. SIAM J. Comput. 20 (3) (1991)
Danilo Bruschi, Deborah Joseph, Paul Young
Strong Separations for the Boolean Hierarchy over RP. Int. J. Found. Comput. Sci. 1 (3) (1990)
Deborah Joseph, Meera Sitharam
Kolmogorov Complexity, Restrited Nondeterminism and Generalized Spectra. STACS (1990)
Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph
Generating Sparse Spanners for Weighted Graphs. SWAT (1990)
Gautam Das, Deborah Joseph
Minimum Vertex Hulls for Polyhedral Domains. STACS (1990)
Alberto Bertoni, Danilo Bruschi, Deborah Joseph, Meera Sitharam, Paul Young
Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract). FCT (1989)
Danilo Bruschi, Deborah Joseph, Paul Young
A Structural Overview of NP Optimization Problems. Optimal Algorithms (1989)
Gautam Das, Deborah Joseph
Which Triangulations Approximate the Complete Graph?. Optimal Algorithms (1989)
Deborah Joseph, Paul Young
The Structural Complexity Column, guest authors. Bull. EATCS 36 (1988)
Judy Goldsmith, Deborah Joseph, Paul Young
Near-testable, P-cheatable, and P-terse sets. Computational Complexity Conference (1987)
Judy Goldsmith, Deborah Joseph
Three Results on the Polynomial Isomorphism of Complete Sets FOCS (1986)
Deborah Joseph, Paul Young
Some Remarks on Witness Functions for Nonpolynomial and Noncomplete Sets in NP. Theor. Comput. Sci. 39 (1985)
John E. Hopcroft, Deborah Joseph, Sue Whitesides
On the Movement of Robot Arms in 2-Dimensional Bounded Regions. SIAM J. Comput. 14 (2) (1985)
John E. Hopcroft, Deborah Joseph, Sue Whitesides
Movement Problems for 2-Dimensional Linkages. SIAM J. Comput. 13 (3) (1984)
Deborah Joseph
Polynomial Time Computations in Models of ET. J. Comput. Syst. Sci. 26 (3) (1983)
John E. Hopcroft, Deborah Joseph, Sue Whitesides
On the Movement of Robot Arms in 2-Dimensional Bounded Regions FOCS (1982)
Deborah Joseph, Paul Young
Corrigendum: Independence Results in Computer Science? J. Comput. Syst. Sci. 24 (3) (1982)
Deborah Joseph, Paul Young
Fast Programs for Initial Segments and Polynomial Time Computation in Weak Models of Arithmetic (Preliminary Abstract) STOC (1981)
Deborah Joseph, Paul Young
Independence Results in Computer Science? J. Comput. Syst. Sci. 23 (2) (1981)
Deborah Joseph, Paul Young
A Survey of Some Recent Results on Computational Complexity in Weak Theories of Arithmetic. MFCS (1981)
Deborah Joseph, Paul Young
Independence Results in Computer Science? (Preliminary Version) STOC (1980)