Deborah Joseph

Proceedings of the Tenth International Conference on Intelligent Systems for Molecular Biology, 2002

1994

Collapsing Degrees in Subexponential Time.

[BibT_eX]

[DOI]

Randall Pruim

Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994

1993

Using Self-Reducibilities to Characterize Polynomial Time

[BibT_eX]

[DOI]

Inf. Comput., June, 1993

A Note on Bi-immunity and p-Closeness of p-Cheatable Sets in P/Poy.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1993

On Sparse Spanners of Weighted Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1993

Relativized Isomorphisms of NP-Complete Sets.

[BibT_eX]

[DOI]

Comput. Complex., 1993

1992

Minimum Vertex Hulls for Polyhedral Domains.

[BibT_eX]

[DOI]

Gautam Das

Theor. Comput. Sci., 1992

Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs.

[BibT_eX]

[DOI]

Joao Meidanis

Prasoon Tiwari

Proceedings of the Algorithm Theory, 1992

1991

Near-Testable Sets.

[BibT_eX]

[DOI]

SIAM J. Comput., 1991

1990

Strong Separations for the Boolean Hierarchy over RP.

[BibT_eX]

[DOI]

Danilo Bruschi

Int. J. Found. Comput. Sci., 1990

Generating Sparse Spanners for Weighted Graphs.

[BibT_eX]

[DOI]

Proceedings of the SWAT 90, 1990

Kolmogorov Complexity, Restrited Nondeterminism and Generalized Spectra.

[BibT_eX]

[DOI]

Meera Sitharam

Proceedings of the STACS 90, 1990

1989

Which Triangulations Approximate the Complete Graph?.

[BibT_eX]

[DOI]

Gautam Das

Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

A Structural Overview of NP Optimization Problems.

[BibT_eX]

[DOI]

Danilo Bruschi

Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1989

1988

The Structural Complexity Column, guest authors.

[BibT_eX]

Bull. EATCS, 1988

1987

Self-Reducible, P-Selectlve, Near-Testable, Near-Testable, and P-Cheatable Sets: The Effect of Internal Structure on the Complexity of a Set.

[BibT_eX]

[DOI]

Proceedings of the Second Annual Conference on Structure in Complexity Theory, 1987

1986

Three Results on the Polynomial Isomorphism of Complete Sets

[BibT_eX]

[DOI]

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985

Some Remarks on Witness Functions for Nonpolynomial and Noncomplete Sets in NP.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

On the Movement of Robot Arms in 2-Dimensional Bounded Regions.

[BibT_eX]

[DOI]

John E. Hopcroft

Sue Whitesides

SIAM J. Comput., 1985

1984

Movement Problems for 2-Dimensional Linkages.

[BibT_eX]

[DOI]

John E. Hopcroft

Sue Whitesides

SIAM J. Comput., 1984

1983

Polynomial Time Computations in Models of ET.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1983

1982

Corrigendum: Independence Results in Computer Science?

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1982

1981

Independence Results in Computer Science?

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1981

Fast Programs for Initial Segments and Polynomial Time Computation in Weak Models of Arithmetic (Preliminary Abstract)

[BibT_eX]

[DOI]

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

A Survey of Some Recent Results on Computational Complexity in Weak Theories of Arithmetic.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1980

Independence Results in Computer Science? (Preliminary Version)

[BibT_eX]

[DOI]