Forbes D. Lewis

Proceedings of the Third Great Lakes Symposium on Design Automation of High Performance VLSI Systems, 1993

A Negative Reinforcement Method for PGA Routing.

[BibT_eX]

[DOI]

Proceedings of the 30th Design Automation Conference. Dallas, 1993

1992

Optimum Steiner tree generation.

[BibT_eX]

[DOI]

Proceedings of the Second Great Lakes Symposium on VLSI, 1992

1991

A linear-time heuristic for rectilinear Steiner trees.

[BibT_eX]

[DOI]

Proceedings of the First Great Lakes Symposium on VLSI, 1991

1989

Correct and Provably Efficient Methods for Rectilinear Steiner Spanning Tree Generation.

[BibT_eX]

[DOI]

Proceedings of the Computing in the 90's, 1989

1981

A Note on Context Free Languages, Complexity Classes, and Diagonalization.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1981

Stateless turing machines and fixed points.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 1981

1980

Complex Properties of Grammars.

[BibT_eX]

[DOI]

Fred G. Abramson

Yuri Breitbart

J. ACM, 1980

1979

On unsolvability in subrecursive classes of predicates.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1979

Combined complexity classes for finite functions.

[BibT_eX]

[DOI]

Yuri Breitbart

RAIRO Theor. Informatics Appl., 1979

1976

On Computational Reducibility.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1976

1971

The Enumerability and Invariance of Complexity Classes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1971

The use of Lists in the Study of Undecidable Problems in Automata Theory.

[BibT_eX]

[DOI]

Juris Hartmanis

J. Comput. Syst. Sci., 1971

1970

Unsolvability Considerations in Computational Complexity.

[BibT_eX]

PhD thesis, 1970

Unsolvability Considerations in Computational Complexity

[BibT_eX]

[DOI]