Deborah Joseph - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2002

Beyond tandem repeats: complex pattern structures and distant regions of similarityAmy M. Hauth, Deborah Joseph. ismb 2002: 31-37

1994

Collapsing Degrees in Subexponential TimeDeborah Joseph, Randall Pruim, Paul Young. cocoon 1994: 367-382

1993

On Sparse Spanners of Weighted GraphsIngo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph, José Soares. dcg, 9:81-100, 1993.

Relativized Isomorphisms of NP-Complete SetsJudy Goldsmith, Deborah Joseph. cc, 3:186-205, 1993.

A Note on Bi-immunity and p-Closeness of p-Cheatable Sets in P/PoyJudy Goldsmith, Deborah Joseph, Paul Young. jcss, 46(3):349-362, 1993.

Using Self-Reducibilities to Characterize Polynomial TimeJudy Goldsmith, Deborah Joseph, Paul Young. iandc, 104(2):288-308, June 1993.

1992

Minimum Vertex Hulls for Polyhedral DomainsGautam Das, Deborah Joseph. TCS, 103(1):107-135, 1992.

Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval GraphsDeborah Joseph, Joao Meidanis, Prasoon Tiwari. swat 1992: 326-337

1991

Near-Testable SetsJudy Goldsmith, Lane A. Hemachandra, Deborah Joseph, Paul Young. SICOMP, 20(3):506-523, 1991.

1990

Generating Sparse Spanners for Weighted GraphsIngo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph. swat 1990: 26-37

Strong Separations for the Boolean Hierarchy over RPDanilo Bruschi, Deborah Joseph, Paul Young. ijfcs, 1(3):201-218, 1990.

Minimum Vertex Hulls for Polyhedral DomainsGautam Das, Deborah Joseph. STACS 1990: 126-137

Kolmogorov Complexity, Restrited Nondeterminism and Generalized SpectraDeborah Joseph, Meera Sitharam. STACS 1990: 152-164

1989

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

A Structural Overview of NP Optimization ProblemsDanilo Bruschi, Deborah Joseph, Paul Young. oa 1989: 205-231

Which Triangulations Approximate the Complete Graph?Gautam Das, Deborah Joseph. oa 1989: 168-192

1988

The Structural Complexity Column, guest authorsDeborah Joseph, Paul Young. eatcs, 36:66-84, 1988.

1987

Near-testable, P-cheatable, and P-terse setsJudy Goldsmith, Deborah Joseph, Paul Young. coco 1987: 50-59

1986

Three Results on the Polynomial Isomorphism of Complete SetsJudy Goldsmith, Deborah Joseph. focs 1986: 390-397

1985

On the Movement of Robot Arms in 2-Dimensional Bounded RegionsJohn E. Hopcroft, Deborah Joseph, Sue Whitesides. SICOMP, 14(2):315-333, 1985.

Some Remarks on Witness Functions for Nonpolynomial and Noncomplete Sets in NPDeborah Joseph, Paul Young. TCS, 39:225-237, 1985.

1984

Movement Problems for 2-Dimensional LinkagesJohn E. Hopcroft, Deborah Joseph, Sue Whitesides. SICOMP, 13(3):610-629, 1984.

1983

Polynomial Time Computations in Models of ETDeborah Joseph. jcss, 26(3):311-338, 1983.

1982

On the Movement of Robot Arms in 2-Dimensional Bounded RegionsJohn E. Hopcroft, Deborah Joseph, Sue Whitesides. focs 1982: 280-289

Corrigendum: Independence Results in Computer Science?Deborah Joseph, Paul Young. jcss, 24(3):378, 1982.

1981

A Survey of Some Recent Results on Computational Complexity in Weak Theories of ArithmeticDeborah Joseph, Paul Young. mfcs 1981: 46-60

Fast Programs for Initial Segments and Polynomial Time Computation in Weak Models of Arithmetic (Preliminary Abstract)Deborah Joseph, Paul Young. stoc 1981: 55-61

Independence Results in Computer Science?Deborah Joseph, Paul Young. jcss, 23(2):205-222, 1981.

1980

Independence Results in Computer Science? (Preliminary Version)Deborah Joseph, Paul Young. stoc 1980: 58-69

Sign in or sign up to see more results.

runs on WebDSL