Lawrence H. Landweber

Paul Barford, Lawrence H. Landweber: Bench-style network research in an Internet Instance Laboratory. Computer Communication Review 33(3): 21-26 (2003)

Haruhisa Ishida, Lawrence H. Landweber: Introduction to the Special Issue on Internetworking. Commun. ACM 36(8): 28-30 (1993)

Robert T. Olsen, Lawrence H. Landweber: Design and Implementation of a Fast Virtual Channel Establishment Method for ATM Networks. INFOCOM 1993: 617-627

Yaoshuang Qu, Lawrence H. Landweber, Miron Livny: Parallelring: a token ring LAN with concurrent multiple transmissions and message destination removal. IEEE Transactions on Communications 40(4): 738-745 (1992)

Amarnath Mukherjee, Lawrence H. Landweber, Theodore Faber: Dynamic Time Windows and Generalized Virtual Clock: Combined Closed-Loop/Open-Loop Congestion Control. INFOCOM 1992: 322-332

Theodore Faber, Lawrence H. Landweber, Amarnath Mukherjee: Dynamic Time Windows: Packet Admission control with Feedback. SIGCOMM 1992: 124-135

C. Allan Cargille, Robert A. Hagens, Alf Hansen, Lawrence H. Landweber: The Internet X.400 Pilot Project. Computer Networks and ISDN Systems 23(1-3): 97-100 (1991)

Amarnath Mukherjee, Lawrence H. Landweber, John C. Strikwerda: Simultaneous Analysis of Flow and Error Control Strategies With Congestion-Dependent Errors. SIGMETRICS 1990: 86-95

Amarnath Mukherjee, Lawrence H. Landweber, John C. Strikwerda: Evaluation of Retransmission Strategies in a Local Area Network Environment. SIGMETRICS 1989: 98-107

Lawrence H. Landweber: U.S academic/research networks. ICCC 1988: 419-423

Cheng Song, Lawrence H. Landweber: Optimizing bulk data transfer performance: a packet train model. SIGCOMM 1988: 134-145

David P. Anderson, Lawrence H. Landweber: A grammar-based methodology for protocol specification and implementation. SIGCOMM 1985: 63-70

David P. Anderson, Lawrence H. Landweber: Protocol Specification by Real-Time Attribute Grammars. PSTV 1984: 457-465

Lawrence H. Landweber: The Computer Science Network. AI Magazine 3(4): 40-41 (1982)

Marvin H. Solomon, Lawrence H. Landweber, Donald Neuhengen: The CSNET Name Server. Computer Networks 6(3): 161-172 (1982)

Marvin H. Solomon, Lawrence H. Landweber, Donald Neuhengen: The Design of the CSNET Name Server. Berkeley Workshop 1982: 311-327

Lawrence H. Landweber, Marvin H. Solomon: Use of Multiple Networks in CSNET. COMPCON 1982: 398-402

Harry R. Lewis, Barbara B. Simons, Walter A. Burkhard, Lawrence H. Landweber (Eds.): Proceedings of the 14th Annual ACM Symposium on Theory of Computing, May 5-7, 1982, San Francisco, California, USA. ACM 1982, isbn 0-89791-070-2

Lawrence H. Landweber, Richard J. Lipton, Edward L. Robertson: On the Structure of Sets in NP and Other Complexity Classes. Theor. Comput. Sci. 15: 181-200 (1981)

Lawrence H. Landweber, Edward L. Robertson: Properties of Conflict-Free and Persistent Petri Nets. J. ACM 25(3): 352-364 (1978)

Neil D. Jones, Lawrence H. Landweber, Y. Edmund Lien: Complexity of Some Problems in Petri Nets. Theor. Comput. Sci. 4(3): 277-299 (1977)

Christoph M. Hoffmann, Lawrence H. Landweber: A Completeness Theorem for Straight-Line Programs with Structured Variables. J. ACM 23(1): 203-220 (1976)

Christoph M. Hoffmann, Lawrence H. Landweber: Axiomatic Equivalence of Programs with Structured Variables. SWAT (FOCS) 1974: 78-83

Lawrence H. Landweber, Edward L. Robertson: Recursive Properties of Abstract Complexity Classes. J. ACM 19(2): 296-308 (1972)

Frederick A. Hosch, Lawrence H. Landweber: Finite Delay Solutions for Sequential Conditions. ICALP 1972: 45-60

Lawrence H. Landweber, Edward L. Robertson: Recursive Properties of Abstract Complexity Classes (Preliminary Version). STOC 1970: 31-36

J. Richard Büchi, Lawrence H. Landweber: Definability in the Monadic Second-Order Theory of Successor. J. Symb. Log. 34(2): 166-170 (1969)

Lawrence H. Landweber: Decision Problems for omega-Automata. Mathematical Systems Theory 3(4): 376-384 (1969)

Lawrence H. Landweber: Synthesis algorithms for sequential machines. IFIP Congress (1) 1968: 300-304