Lawrence H. Landweber

Affiliations:
  • University of Wisconsin, Madison, USA


According to our database1, Lawrence H. Landweber authored at least 37 papers between 1968 and 2019.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of three.

Awards

ACM Fellow

ACM Fellow 1996, "Lawrence H. Landweber has been a pioneer in the development of computer networks to support research and education. Accomplishments include his founding role in CSNET, the first community-based network, and his contribution to the internationalization of the Internet.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019

2014
GENI: A federated testbed for innovative network experiments.
Comput. Networks, 2014

2003
Bench-style network research in an Internet Instance Laboratory.
Comput. Commun. Rev., 2003

1993
Introduction to the Special Issue on Internetworking.
Commun. ACM, 1993

Design and Implementation of a Fast Virtual Channel Establishment Method for ATM Networks.
Proceedings of the Proceedings IEEE INFOCOM '93, The Conference on Computer Communications, Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies, Networking: Foundation for the Future, San Francisco, CA, USA, March 28, 1993

1992
Parallelring: a token ring LAN with concurrent multiple transmissions and message destination removal.
IEEE Trans. Commun., 1992

Computer networking courses at the University of Wisconsin - Madison.
Comput. Commun. Rev., 1992

Dynamic Time Windows: Packet Admission control with Feedback.
Proceedings of the Conference on Communications Architecture & Protocols, 1992

Dynamic Time Windows and Generalized Virtual Clock: Combined Closed-Loop/Open-Loop Congestion Control.
Proceedings of the Proceedings IEEE INFOCOM '92, 1992

1991
The Internet X.400 Pilot Project.
Comput. Networks ISDN Syst., 1991

1990
An ISO TP4-TP0 Gateway.
Comput. Commun. Rev., 1990

Simultaneous Analysis of Flow and Error Control Strategies With Congestion-Dependent Errors.
Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems, 1990

1989
Evaluation of Retransmission Strategies in a Local Area Network Environment.
Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, 1989

1988
Optimizing bulk data transfer performance: a packet train model.
Proceedings of the ACM Symposium on Communications Architectures and Protocols, 1988

U.S academic/research networks.
Proceedings of the Computer Communication Technologies for the 90's, Proceedings of the Ninth International Conference on Computer Communication, Tel Aviv, Israel, October 30, 1988

1986
Research computer networks and their interconnection.
IEEE Commun. Mag., 1986

1985
A grammar-based methodology for protocol specification and implementation.
Proceedings of the Ninth Symposium on Data Communications, 1985

1984
Protocol Specification by Real-Time Attribute Grammars.
Proceedings of the Protocol Specification, 1984

1983
Architecture of the CSNET name server.
Proceedings of the symposium on Communications Architectures & Protocols, 1983

1982
CSNET: a tool for researchers in theoretical computer science.
SIGACT News, 1982

The CSNET Name Server.
Comput. Networks, 1982

The Computer Science Network.
AI Mag., 1982

Use of Multiple Networks in CSNET.
Proceedings of the COMPCON'82, 1982

The Design of the CSNET Name Server.
Proceedings of the Sixth Berkeley Workshop on Distributed Data Management and Computer Networks, 1982

1981
On the Structure of Sets in NP and Other Complexity Classes.
Theor. Comput. Sci., 1981

1979
Theory Net: An electronic mail system.
Proceedings of the 1979 Annual Conference, Detroit, Michigan, USA, October 29-31, 1979., 1979

1978
Properties of Conflict-Free and Persistent Petri Nets.
J. ACM, 1978

1977
Complexity of Some Problems in Petri Nets.
Theor. Comput. Sci., 1977

Theory in the Computer Science and Engineering Curriculum: Why, What, When, and Where.
Computer, 1977

1976
A Completeness Theorem for Straight-Line Programs with Structured Variables.
J. ACM, 1976

1974
Axiomatic Equivalence of Programs with Structured Variables
Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974

1972
Recursive Properties of Abstract Complexity Classes.
J. ACM, 1972

Finite Delay Solutions for Sequential Conditions.
Proceedings of the Automata, 1972

1970
Recursive Properties of Abstract Complexity Classes (Preliminary Version)
Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, 1970

1969
Decision Problems for omega-Automata.
Math. Syst. Theory, 1969

Definability in the Monadic Second-Order Theory of Successor.
J. Symb. Log., 1969

1968
Synthesis algorithms for sequential machines.
Proceedings of the Information Processing, Proceedings of IFIP Congress 1968, Edinburgh, UK, 5-10 August 1968, Volume 1, 1968


  Loading...