Forbes D. Lewis

Publication Activity (10 Years)

Years Active: 1970-1993
Publications (10 Years): 0

Publications

Forbes D. Lewis, Wang Chia-Chi Pong, Nancy K. Van Cleave
Local improvement in Steiner trees. Great Lakes Symposium on VLSI (1993)
Forbes D. Lewis, Wang Chia-Chi Pong
A Negative Reinforcement Method for PGA Routing. DAC (1993)
Forbes D. Lewis, Wang Chia-Chi Pong, Nancy K. Van Cleave
Optimum Steiner tree generation. Great Lakes Symposium on VLSI (1992)
Forbes D. Lewis, Wang Chia-Chi Pong, Nancy K. Van Cleave
A linear-time heuristic for rectilinear Steiner trees. Great Lakes Symposium on VLSI (1991)
Forbes D. Lewis, Nancy K. Van Cleave
Correct and Provably Efficient Methods for Rectilinear Steiner Spanning Tree Generation. Great Lakes Computer Science Conference (1989)
Forbes D. Lewis
A Note on Context Free Languages, Complexity Classes, and Diagonalization. Math. Syst. Theory 14 (1981)
Forbes D. Lewis
Stateless turing machines and fixed points. Int. J. Parallel Program. 10 (3) (1981)
Fred G. Abramson, Yuri Breitbart, Forbes D. Lewis
Complex Properties of Grammars. J. ACM 27 (3) (1980)
Forbes D. Lewis
On unsolvability in subrecursive classes of predicates. Notre Dame J. Formal Log. 20 (1) (1979)
Yuri Breitbart, Forbes D. Lewis
Combined complexity classes for finite functions. RAIRO Theor. Informatics Appl. 13 (1) (1979)
Forbes D. Lewis
On Computational Reducibility. J. Comput. Syst. Sci. 12 (1) (1976)
Forbes D. Lewis
The Enumerability and Invariance of Complexity Classes. J. Comput. Syst. Sci. 5 (3) (1971)
Juris Hartmanis, Forbes D. Lewis
The use of Lists in the Study of Undecidable Problems in Automata Theory. J. Comput. Syst. Sci. 5 (1) (1971)
Forbes D. Lewis
Unsolvability Considerations in Computational Complexity STOC (1970)