Unsolvability Considerations in Computational Complexity - Forbes D. Lewis (STOC, 1970)

Unsolvability Considerations in Computational Complexity. - Forbes D. Lewis (1970)

The use of Lists in the Study of Undecidable Problems in Automata Theory. - Juris Hartmanis; Forbes D. Lewis (J. Comput. Syst. Sci., 1971)

The Enumerability and Invariance of Complexity Classes. - Forbes D. Lewis (J. Comput. Syst. Sci., 1971)

On Computational Reducibility. - Forbes D. Lewis (J. Comput. Syst. Sci., 1976)

Combined complexity classes for finite functions. - Yuri Breitbart; Forbes D. Lewis (RAIRO Theor. Informatics Appl., 1979)

On unsolvability in subrecursive classes of predicates. - Forbes D. Lewis (Notre Dame J. Formal Log., 1979)

Complex Properties of Grammars. - Fred G. Abramson; Yuri Breitbart; Forbes D. Lewis (J. ACM, 1980)

Stateless turing machines and fixed points. - Forbes D. Lewis (Int. J. Parallel Program., 1981)

A Note on Context Free Languages, Complexity Classes, and Diagonalization. - Forbes D. Lewis (Math. Syst. Theory, 1981)

Correct and Provably Efficient Methods for Rectilinear Steiner Spanning Tree Generation. - Forbes D. Lewis; Nancy K. Van Cleave (Great Lakes Computer Science Conference, 1989)

A linear-time heuristic for rectilinear Steiner trees. - Forbes D. Lewis; Wang Chia-Chi Pong; Nancy K. Van Cleave (Great Lakes Symposium on VLSI, 1991)

Optimum Steiner tree generation. - Forbes D. Lewis; Wang Chia-Chi Pong; Nancy K. Van Cleave (Great Lakes Symposium on VLSI, 1992)

A Negative Reinforcement Method for PGA Routing. - Forbes D. Lewis; Wang Chia-Chi Pong (DAC, 1993)

Local improvement in Steiner trees. - Forbes D. Lewis; Wang Chia-Chi Pong; Nancy K. Van Cleave (Great Lakes Symposium on VLSI, 1993)