default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLawrence H. Landweber
Person information
- affiliation: University of Wisconsin, Madison, USA
- award (2012): Internet Hall of Fame
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2010 – 2019
- 2019
[c18]Dmitry Duplyakin, Robert Ricci, Aleksander Maricq, Gary Wong, Jonathon Duerig, Eric Eide, Leigh Stoller, Mike Hibler, David Johnson, Kirk Webb, Aditya Akella, Kuang-Ching Wang, Glenn Ricart, Larry Landweber, Chip Elliott, Michael Zink, Emmanuel Cecchet, Snigdhaswin Kar, Prabodh Mishra:
The Design and Operation of CloudLab. USENIX ATC 2019: 1-14- 2014
- [j19]Mark Berman, Jeffrey S. Chase, Lawrence H. Landweber, Akihiro Nakao
, Max Ott, Dipankar Raychaudhuri, Robert Ricci, Ivan Seskar:
GENI: A federated testbed for innovative network experiments. Comput. Networks 61: 5-23 (2014)
2000 – 2009
- 2003
- [j18]Paul Barford, Lawrence H. Landweber:
Bench-style network research in an Internet Instance Laboratory. Comput. Commun. Rev. 33(3): 21-26 (2003)
1990 – 1999
- 1993
- [j17]Haruhisa Ishida, Lawrence H. Landweber:
Introduction to the Special Issue on Internetworking. Commun. ACM 36(8): 28-30 (1993) - [c17]Robert T. Olsen, Lawrence H. Landweber:
Design and Implementation of a Fast Virtual Channel Establishment Method for ATM Networks. INFOCOM 1993: 617-627 - 1992
- [j16]Lawrence H. Landweber:
Computer networking courses at the University of Wisconsin - Madison. Comput. Commun. Rev. 22(1): 52-61 (1992) - [j15]Yaoshuang Qu, Lawrence H. Landweber, Miron Livny:
Parallelring: a token ring LAN with concurrent multiple transmissions and message destination removal. IEEE Trans. Commun. 40(4): 738-745 (1992) - [c16]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 - [c15]Theodore Faber, Lawrence H. Landweber, Amarnath Mukherjee:
Dynamic Time Windows: Packet Admission control with Feedback. SIGCOMM 1992: 124-135 - 1991
- [j14]C. Allan Cargille, Robert A. Hagens, Alf Hansen, Lawrence H. Landweber:
The Internet X.400 Pilot Project. Comput. Networks ISDN Syst. 23(1-3): 97-100 (1991) - 1990
- [j13]Lawrence H. Landweber, Mitchell Tasman, Wengyik Yeong:
An ISO TP4-TP0 Gateway. Comput. Commun. Rev. 20(2): 16-21 (1990) - [c14]Amarnath Mukherjee, Lawrence H. Landweber, John C. Strikwerda:
Simultaneous Analysis of Flow and Error Control Strategies With Congestion-Dependent Errors. SIGMETRICS 1990: 86-95
1980 – 1989
- 1989
- [c13]Amarnath Mukherjee, Lawrence H. Landweber, John C. Strikwerda:
Evaluation of Retransmission Strategies in a Local Area Network Environment. SIGMETRICS 1989: 98-107 - [e4]Lawrence H. Landweber:
Proceedings of the ACM Symposium on Communications Architectures & Protocols, SIGCOMM 1989, Austin, TX, USA, September 19-22, 1989. ACM 1989, ISBN 0-89791-332-9 [contents] - 1988
- [c12]Lawrence H. Landweber:
U.S academic/research networks. ICCC 1988: 419-423 - [c11]Cheng Song, Lawrence H. Landweber:
Optimizing bulk data transfer performance: a packet train model. SIGCOMM 1988: 134-145 - 1986
- [j12]Lawrence H. Landweber, Dennis M. Jennings, Ira Fuchs:
Research computer networks and their interconnection. IEEE Commun. Mag. 24(6): 5-17 (1986) - 1985
- [c10]David P. Anderson, Lawrence H. Landweber:
A grammar-based methodology for protocol specification and implementation. SIGCOMM 1985: 63-70 - 1984
- [c9]David P. Anderson, Lawrence H. Landweber:
Protocol Specification by Real-Time Attribute Grammars. PSTV 1984: 457-465 - [e3]Ken Kennedy, Mary S. Van Deusen, Larry Landweber:
Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, Salt Lake City, Utah, USA, January 1984. ACM Press 1984, ISBN 0-89791-125-3 [contents] - 1983
- [c8]Larry Landweber, Michael J. Litzkow, Donald Neuhengen, M. Soloman:
Architecture of the CSNET name server. SIGCOMM 1983: 146-153 - [e2]John R. Wright, Larry Landweber, Alan J. Demers, Tim Teitelbaum:
Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages, Austin, Texas, USA, January 1983. ACM Press 1983, ISBN 0-89791-090-7 [contents] - 1982
- [j11]Lawrence H. Landweber:
The Computer Science Network. AI Mag. 3(4): 40-41 (1982) - [j10]Marvin H. Solomon, Lawrence H. Landweber, Donald Neuhengen:
The CSNET Name Server. Comput. Networks 6(3): 161-172 (1982) - [j9]Lawrence H. Landweber:
CSNET: a tool for researchers in theoretical computer science. SIGACT News 14(3): 21-22 (1982) - [c7]Marvin H. Solomon, Lawrence H. Landweber, Donald Neuhengen:
The Design of the CSNET Name Server. Berkeley Workshop 1982: 311-327 - [c6]Lawrence H. Landweber, Marvin H. Solomon:
Use of Multiple Networks in CSNET. COMPCON 1982: 398-402 - [e1]Harry R. Lewis, Barbara B. Simons, Walter A. Burkhard, Lawrence H. Landweber:
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, May 5-7, 1982, San Francisco, California, USA. ACM 1982, ISBN 0-89791-067-2 [contents] - 1981
- [j8]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)
1970 – 1979
- 1979
- [c5]Larry Landweber:
Theory Net: An electronic mail system. ACM Annual Conference 1979: 158 - 1978
- [j7]Lawrence H. Landweber, Edward L. Robertson:
Properties of Conflict-Free and Persistent Petri Nets. J. ACM 25(3): 352-364 (1978) - 1977
- [j6]Bruce H. Barnes, George I. Davida, Richard A. DeMillo, Larry Landweber, Harold S. Stone:
Theory in the Computer Science and Engineering Curriculum: Why, What, When, and Where. Computer 10(12): 106-108 (1977) - [j5]Neil D. Jones, Lawrence H. Landweber, Y. Edmund Lien:
Complexity of Some Problems in Petri Nets. Theor. Comput. Sci. 4(3): 277-299 (1977) - 1976
- [j4]Christoph M. Hoffmann, Lawrence H. Landweber:
A Completeness Theorem for Straight-Line Programs with Structured Variables. J. ACM 23(1): 203-220 (1976) - 1974
- [c4]Christoph M. Hoffmann, Lawrence H. Landweber:
Axiomatic Equivalence of Programs with Structured Variables. SWAT 1974: 78-83 - 1972
- [j3]Lawrence H. Landweber, Edward L. Robertson:
Recursive Properties of Abstract Complexity Classes. J. ACM 19(2): 296-308 (1972) - [c3]Frederick A. Hosch, Lawrence H. Landweber:
Finite Delay Solutions for Sequential Conditions. ICALP 1972: 45-60 - 1970
- [c2]Lawrence H. Landweber, Edward L. Robertson:
Recursive Properties of Abstract Complexity Classes (Preliminary Version). STOC 1970: 31-36
1960 – 1969
- 1969
- [j2]J. Richard Büchi, Lawrence H. Landweber:
Definability in the Monadic Second-Order Theory of Successor. J. Symb. Log. 34(2): 166-170 (1969) - [j1]Lawrence H. Landweber:
Decision Problems for omega-Automata. Math. Syst. Theory 3(4): 376-384 (1969) - 1968
- [c1]Lawrence H. Landweber:
Synthesis algorithms for sequential machines. IFIP Congress (1) 1968: 300-304
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-03-31 23:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
