Forbes D. Lewis

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