Lawrence Hugh Landweber
Affiliations: | 1967- | Computer Sciences | University of Wisconsin, Madison, Madison, WI |
Website:
http://pages.cs.wisc.edu/~lhl/Google:
"Lawrence Landweber"Bio:
Parents
Sign in to add mentor| Julius Richard Büchi | grad student | 1967 | Purdue (MathTree) | |
| (A Design Algorithm for Sequential Machines and Definability in Monadic Second Order Arithmetic) | ||||
Children
Sign in to add trainee| Edward L. Robertson | grad student | 1970 | UW Madison |
| Christoph M. Hoffmann | grad student | 1974 | UW Madison |
| David P. Anderson | grad student | 1985 | UW Madison (Astronomy Tree) |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Landweber LH, Lipton RJ, Robertson EL. (1981) On the structure of sets in NP and other complexity classes Theoretical Computer Science. 15: 181-200 |
| Landweber LH, Robertson EL. (1978) Properties of Conflict-Free and Persistent Petri Nts Journal of the Acm (Jacm). 25: 352-364 |
| Jones ND, Landweber LH, Edmund Lien Y. (1977) Complexity of some problems in Petri nets Theoretical Computer Science. 4: 277-299 |
| Hoffmann CM, Landweber LH. (1976) A Completeness Theorem for Straight-Line Programs with Structured Variables Journal of the Acm (Jacm). 23: 203-220 |
| Landweber LH, Robertson EL. (1972) RECURSIVE PROPERTIES OF ABSTRACT COMPLEXITY CLASSES J Assoc Comput Mach. 19: 296-308 |