☰

Lawrence Hugh Landweber - Publications

Affiliations: 
1967- Computer Sciences University of Wisconsin, Madison, Madison, WI 
Website:
http://pages.cs.wisc.edu/~lhl/
Tree Info Similar researchers PubMed Report error

5 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
1981 Landweber LH, Lipton RJ, Robertson EL. On the structure of sets in NP and other complexity classes Theoretical Computer Science. 15: 181-200. DOI: 10.1016/0304-3975(81)90069-4  0.555
1978 Landweber LH, Robertson EL. Properties of Conflict-Free and Persistent Petri Nts Journal of the Acm (Jacm). 25: 352-364. DOI: 10.1145/322077.322079  0.538
1977 Jones ND, Landweber LH, Edmund Lien Y. Complexity of some problems in Petri nets Theoretical Computer Science. 4: 277-299. DOI: 10.1016/0304-3975(77)90014-7  0.333
1976 Hoffmann CM, Landweber LH. A Completeness Theorem for Straight-Line Programs with Structured Variables Journal of the Acm (Jacm). 23: 203-220. DOI: 10.1145/321921.321940  0.476
1972 Landweber LH, Robertson EL. RECURSIVE PROPERTIES OF ABSTRACT COMPLEXITY CLASSES J Assoc Comput Mach. 19: 296-308. DOI: 10.1145/321694.321702  0.549
Show low-probability matches.