2002 |
28 | | Amy M. Hauth,
Deborah Joseph:
Beyond tandem repeats: complex pattern structures and distant regions of similarity.
ISMB 2002: 31-37 |
1994 |
27 | | Deborah Joseph,
Randall Pruim,
Paul Young:
Collapsing Degrees in Subexponential Time.
Structure in Complexity Theory Conference 1994: 367-382 |
1993 |
26 | | Judy Goldsmith,
Deborah Joseph:
Relativized Isomorphisms of NP-Complete Sets.
Computational Complexity 3: 186-205 (1993) |
25 | | Ingo Althöfer,
Gautam Das,
David P. Dobkin,
Deborah Joseph,
José Soares:
On Sparse Spanners of Weighted Graphs.
Discrete & Computational Geometry 9: 81-100 (1993) |
24 | | Judy Goldsmith,
Deborah Joseph,
Paul Young:
Using Self-Reducibilities to Characterize Polynomial Time
Inf. Comput. 104(2): 288-308 (1993) |
23 | | 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 |
22 | | Deborah Joseph,
Joao Meidanis,
Prasoon Tiwari:
Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs.
SWAT 1992: 326-337 |
21 | | Gautam Das,
Deborah Joseph:
Minimum Vertex Hulls for Polyhedral Domains.
Theor. Comput. Sci. 103(1): 107-135 (1992) |
1991 |
20 | | Judy Goldsmith,
Lane A. Hemachandra,
Deborah Joseph,
Paul Young:
Near-Testable Sets.
SIAM J. Comput. 20(3): 506-523 (1991) |
1990 |
19 | | Gautam Das,
Deborah Joseph:
Minimum Vertex Hulls for Polyhedral Domains.
STACS 1990: 126-137 |
18 | | Deborah Joseph,
Meera Sitharam:
Kolmogorov Complexity, Restrited Nondeterminism and Generalized Spectra.
STACS 1990: 152-164 |
17 | | Ingo Althöfer,
Gautam Das,
David P. Dobkin,
Deborah Joseph:
Generating Sparse Spanners for Weighted Graphs.
SWAT 1990: 26-37 |
16 | | Danilo Bruschi,
Deborah Joseph,
Paul Young:
Strong Separations for the Boolean Hierarchy over RP.
Int. J. Found. Comput. Sci. 1(3): 201-218 (1990) |
1989 |
15 | | Alberto Bertoni,
Danilo Bruschi,
Deborah Joseph,
Meera Sitharam,
Paul Young:
Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract).
FCT 1989: 35-46 |
14 | | Gautam Das,
Deborah Joseph:
Which Triangulations Approximate the Complete Graph?.
Optimal Algorithms 1989: 168-192 |
13 | | Danilo Bruschi,
Deborah Joseph,
Paul Young:
A Structural Overview of NP Optimization Problems.
Optimal Algorithms 1989: 205-231 |
1988 |
12 | | Deborah Joseph,
Paul Young:
The Structural Complexity Column, guest authors.
Bulletin of the EATCS 36: 66-84 (1988) |
1986 |
11 | | Judy Goldsmith,
Deborah Joseph:
Three Results on the Polynomial Isomorphism of Complete Sets
FOCS 1986: 390-397 |
1985 |
10 | | 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) |
9 | | Deborah Joseph,
Paul Young:
Some Remarks on Witness Functions for Nonpolynomial and Noncomplete Sets in NP.
Theor. Comput. Sci. 39: 225-237 (1985) |
1984 |
8 | | John E. Hopcroft,
Deborah Joseph,
Sue Whitesides:
Movement Problems for 2-Dimensional Linkages.
SIAM J. Comput. 13(3): 610-629 (1984) |
1983 |
7 | | Deborah Joseph:
Polynomial Time Computations in Models of ET.
J. Comput. Syst. Sci. 26(3): 311-338 (1983) |
1982 |
6 | | John E. Hopcroft,
Deborah Joseph,
Sue Whitesides:
On the Movement of Robot Arms in 2-Dimensional Bounded Regions
FOCS 1982: 280-289 |
5 | | Deborah Joseph,
Paul Young:
Corrigendum: Independence Results in Computer Science?
J. Comput. Syst. Sci. 24(3): 378 (1982) |
1981 |
4 | | Deborah Joseph,
Paul Young:
A Survey of Some Recent Results on Computational Complexity in Weak Theories of Arithmetic.
MFCS 1981: 46-60 |
3 | | Deborah Joseph,
Paul Young:
Fast Programs for Initial Segments and Polynomial Time Computation in Weak Models of Arithmetic (Preliminary Abstract)
STOC 1981: 55-61 |
2 | | Deborah Joseph,
Paul Young:
Independence Results in Computer Science?
J. Comput. Syst. Sci. 23(2): 205-222 (1981) |
1980 |
1 | | Deborah Joseph,
Paul Young:
Independence Results in Computer Science? (Preliminary Version)
STOC 1980: 58-69 |