Independence Results in Computer Science? (Preliminary Version) - Deborah Joseph; Paul Young (STOC, 1980)

A Survey of Some Recent Results on Computational Complexity in Weak Theories of Arithmetic. - Deborah Joseph; Paul Young (MFCS, 1981)

Fast Programs for Initial Segments and Polynomial Time Computation in Weak Models of Arithmetic (Preliminary Abstract) - Deborah Joseph; Paul Young (STOC, 1981)

Independence Results in Computer Science? - Deborah Joseph; Paul Young (J. Comput. Syst. Sci., 1981)

Corrigendum: Independence Results in Computer Science? - Deborah Joseph; Paul Young (J. Comput. Syst. Sci., 1982)

Polynomial Time Computations in Models of ET. - Deborah Joseph (J. Comput. Syst. Sci., 1983)

Movement Problems for 2-Dimensional Linkages. - John E. Hopcroft; Deborah Joseph; Sue Whitesides (SIAM J. Comput., 1984)

On the Movement of Robot Arms in 2-Dimensional Bounded Regions. - John E. Hopcroft; Deborah Joseph; Sue Whitesides (SIAM J. Comput., 1985)

Some Remarks on Witness Functions for Nonpolynomial and Noncomplete Sets in NP. - Deborah Joseph; Paul Young (Theor. Comput. Sci., 1985)

Three Results on the Polynomial Isomorphism of Complete Sets - Judy Goldsmith; Deborah Joseph (FOCS, 1986)

Self-Reducible, P-Selectlve, Near-Testable, Near-Testable, and P-Cheatable Sets: The Effect of Internal Structure on the Complexity of a Set. - Judy Goldsmith; Deborah Joseph; Paul Young (SCT, 1987)

The Structural Complexity Column, guest authors. - Deborah Joseph; Paul Young (Bull. EATCS, 1988)

Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract). - Alberto Bertoni; Danilo Bruschi; Deborah Joseph; Meera Sitharam; Paul Young (FCT, 1989)

A Structural Overview of NP Optimization Problems. - Danilo Bruschi; Deborah Joseph; Paul Young (Optimal Algorithms, 1989)

Which Triangulations Approximate the Complete Graph?. - Gautam Das 001; Deborah Joseph (Optimal Algorithms, 1989)

Kolmogorov Complexity, Restrited Nondeterminism and Generalized Spectra. - Deborah Joseph; Meera Sitharam (STACS, 1990)

Generating Sparse Spanners for Weighted Graphs. - Ingo Althöfer; Gautam Das 001; David P. Dobkin; Deborah Joseph (SWAT, 1990)

Strong Separations for the Boolean Hierarchy over RP. - Danilo Bruschi; Deborah Joseph; Paul Young (Int. J. Found. Comput. Sci., 1990)

Near-Testable Sets. - Judy Goldsmith; Lane A. Hemachandra; Deborah Joseph; Paul Young (SIAM J. Comput., 1991)

Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs. - Deborah Joseph; Joao Meidanis; Prasoon Tiwari (SWAT, 1992)

Minimum Vertex Hulls for Polyhedral Domains. - Gautam Das 001; Deborah Joseph (Theor. Comput. Sci., 1992)

Relativized Isomorphisms of NP-Complete Sets. - Judy Goldsmith; Deborah Joseph (Comput. Complex., 1993)

On Sparse Spanners of Weighted Graphs. - Ingo Althöfer; Gautam Das 001; David P. Dobkin; Deborah Joseph; José Soares (Discret. Comput. Geom., 1993)

A Note on Bi-immunity and p-Closeness of p-Cheatable Sets in P/Poy. - Judy Goldsmith; Deborah Joseph; Paul Young (J. Comput. Syst. Sci., 1993)

Using Self-Reducibilities to Characterize Polynomial Time - Judy Goldsmith; Deborah Joseph; Paul Young (Inf. Comput., 1993)

Collapsing Degrees in Subexponential Time. - Deborah Joseph; Randall J. Pruim; Paul Young (SCT, 1994)

Beyond tandem repeats: complex pattern structures and distant regions of similarity. - Amy M. Hauth; Deborah Joseph (ISMB, 2002)