Deborah Joseph

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