| |
| 1993 | ||
|---|---|---|
| 9 | EE | Forbes D. Lewis, Wang Chia-Chi Pong: A Negative Reinforcement Method for PGA Routing. DAC 1993: 601-605 |
| 1989 | ||
| 8 | Forbes D. Lewis, N. Van Cleave: Correct and Provably Efficient Methods for Rectilinear Steiner Spanning Tree Generation. Great Lakes Computer Science Conference 1989: 329-335 | |
| 1981 | ||
| 7 | Forbes D. Lewis: A Note on Context Free Languages, Complexity Classes, and Diagonalization. Mathematical Systems Theory 14: 223-227 (1981) | |
| 1980 | ||
| 6 | EE | Fred G. Abramson, Yuri Breitbart, Forbes D. Lewis: Complex Properties of Grammars. J. ACM 27(3): 484-498 (1980) |
| 1979 | ||
| 5 | Yuri Breitbart, Forbes D. Lewis: Combined complexity classes for finite functions. ITA 13(1): (1979) | |
| 1976 | ||
| 4 | Forbes D. Lewis: On Computational Reducibility. J. Comput. Syst. Sci. 12(1): 122-131 (1976) | |
| 1971 | ||
| 3 | Juris Hartmanis, Forbes D. Lewis: The use of Lists in the Study of Undecidable Problems in Automata Theory. J. Comput. Syst. Sci. 5(1): 54-66 (1971) | |
| 2 | Forbes D. Lewis: The Enumerability and Invariance of Complexity Classes. J. Comput. Syst. Sci. 5(3): 286-303 (1971) | |
| 1970 | ||
| 1 | Forbes D. Lewis: Unsolvability Considerations in Computational Complexity STOC 1970: 22-30 | |
| 1 | Fred G. Abramson | [6] |
| 2 | Yuri Breitbart | [5] [6] |
| 3 | N. Van Cleave | [8] |
| 4 | Juris Hartmanis | [3] |
| 5 | Wang Chia-Chi Pong | [9] |