|
Search the dblp DataBase
Lawrence H. Landweber:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Neil D. Jones, Lawrence H. Landweber, Y. Edmund Lien
Complexity of Some Problems in Petri Nets. [Citation Graph (2, 0)][DBLP] Theor. Comput. Sci., 1977, v:4, n:3, pp:277-299 [Journal]
- Marvin H. Solomon, Lawrence H. Landweber, Donald Neuhengen
The Design of the CSNET Name Server. [Citation Graph (0, 0)][DBLP] Berkeley Workshop, 1982, pp:311-327 [Conf]
- Lawrence H. Landweber, Marvin H. Solomon
Use of Multiple Networks in CSNET. [Citation Graph (0, 0)][DBLP] COMPCON, 1982, pp:398-402 [Conf]
- Christoph M. Hoffmann, Lawrence H. Landweber
Axiomatic Equivalence of Programs with Structured Variables [Citation Graph (0, 0)][DBLP] FOCS, 1974, pp:78-83 [Conf]
- Frederick A. Hosch, Lawrence H. Landweber
Finite Delay Solutions for Sequential Conditions. [Citation Graph (0, 0)][DBLP] ICALP, 1972, pp:45-60 [Conf]
- Lawrence H. Landweber
U.S academic/research networks. [Citation Graph (0, 0)][DBLP] ICCC, 1988, pp:419-423 [Conf]
- Lawrence H. Landweber
Synthesis algorithms for sequential machines. [Citation Graph (0, 0)][DBLP] IFIP Congress (1), 1968, pp:300-304 [Conf]
- Amarnath Mukherjee, Lawrence H. Landweber, Theodore Faber
Dynamic Time Windows and Generalized Virtual Clock: Combined Closed-Loop/Open-Loop Congestion Control. [Citation Graph (0, 0)][DBLP] INFOCOM, 1992, pp:322-332 [Conf]
- Robert T. Olsen, Lawrence H. Landweber
Design and Implementation of a Fast Virtual Channel Establishment Method for ATM Networks. [Citation Graph (0, 0)][DBLP] INFOCOM, 1993, pp:617-627 [Conf]
- David P. Anderson, Lawrence H. Landweber
Protocol Specification by Real-Time Attribute Grammars. [Citation Graph (0, 0)][DBLP] PSTV, 1984, pp:457-465 [Conf]
- David P. Anderson, Lawrence H. Landweber
A grammar-based methodology for protocol specification and implementation. [Citation Graph (0, 0)][DBLP] SIGCOMM, 1985, pp:63-70 [Conf]
- Theodore Faber, Lawrence H. Landweber, Amarnath Mukherjee
Dynamic Time Windows: Packet Admission control with Feedback. [Citation Graph (0, 0)][DBLP] SIGCOMM, 1992, pp:124-135 [Conf]
- Cheng Song, Lawrence H. Landweber
Optimizing bulk data transfer performance: a packet train model. [Citation Graph (0, 0)][DBLP] SIGCOMM, 1988, pp:134-145 [Conf]
- Amarnath Mukherjee, Lawrence H. Landweber, John C. Strikwerda
Evaluation of Retransmission Strategies in a Local Area Network Environment. [Citation Graph (0, 0)][DBLP] SIGMETRICS, 1989, pp:98-107 [Conf]
- Amarnath Mukherjee, Lawrence H. Landweber, John C. Strikwerda
Simultaneous Analysis of Flow and Error Control Strategies With Congestion-Dependent Errors. [Citation Graph (0, 0)][DBLP] SIGMETRICS, 1990, pp:86-95 [Conf]
- Lawrence H. Landweber, Edward L. Robertson
Recursive Properties of Abstract Complexity Classes (Preliminary Version) [Citation Graph (0, 0)][DBLP] STOC, 1970, pp:31-36 [Conf]
- Lawrence H. Landweber
The Computer Science Network. [Citation Graph (0, 0)][DBLP] AI Magazine, 1982, v:3, n:4, pp:40-41 [Journal]
- Haruhisa Ishida, Lawrence H. Landweber
Introduction to the Special Issue on Internetworking. [Citation Graph (0, 0)][DBLP] Commun. ACM, 1993, v:36, n:8, pp:28-30 [Journal]
- Paul Barford, Lawrence H. Landweber
Bench-style network research in an Internet Instance Laboratory. [Citation Graph (0, 0)][DBLP] Computer Communication Review, 2003, v:33, n:3, pp:21-26 [Journal]
- C. Allan Cargille, Robert A. Hagens, Alf Hansen, Lawrence H. Landweber
The Internet X.400 Pilot Project. [Citation Graph (0, 0)][DBLP] Computer Networks and ISDN Systems, 1991, v:23, n:1-3, pp:97-100 [Journal]
- Marvin H. Solomon, Lawrence H. Landweber, Donald Neuhengen
The CSNET Name Server. [Citation Graph (0, 0)][DBLP] Computer Networks, 1982, v:6, n:3, pp:161-172 [Journal]
- Christoph M. Hoffmann, Lawrence H. Landweber
A Completeness Theorem for Straight-Line Programs with Structured Variables. [Citation Graph (0, 0)][DBLP] J. ACM, 1976, v:23, n:1, pp:203-220 [Journal]
- Lawrence H. Landweber, Edward L. Robertson
Recursive Properties of Abstract Complexity Classes. [Citation Graph (0, 0)][DBLP] J. ACM, 1972, v:19, n:2, pp:296-308 [Journal]
- Lawrence H. Landweber, Edward L. Robertson
Properties of Conflict-Free and Persistent Petri Nets. [Citation Graph (0, 0)][DBLP] J. ACM, 1978, v:25, n:3, pp:352-364 [Journal]
- J. Richard Büchi, Lawrence H. Landweber
Definability in the Monadic Second-Order Theory of Successor. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1969, v:34, n:2, pp:166-170 [Journal]
- Lawrence H. Landweber
Decision Problems for omega-Automata. [Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1969, v:3, n:4, pp:376-384 [Journal]
- Lawrence H. Landweber, Richard J. Lipton, Edward L. Robertson
On the Structure of Sets in NP and Other Complexity Classes. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1981, v:15, n:, pp:181-200 [Journal]
Search in 0.004secs, Finished in 0.005secs
|