Jeff Jaffe

Bell Labs Tech. J., 2004

2002

A view of telecommunications network evolution.

[BibT_eX]

[DOI]

Mohamed El-Sayed

IEEE Commun. Mag., 2002

1992

Standoff and standoff resolution in deadlock free networks with virtual circuits.

[BibT_eX]

[DOI]

George A. Grover

IEEE Trans. Commun., 1992

1989

Scheduling Arithmetic and Load Operations in Parallel with No Spilling.

[BibT_eX]

[DOI]

David Bernstein

Michael Rodeh

SIAM J. Comput., 1989

Distributed Deadlock Resolution in Store-and-Forward Networks.

[BibT_eX]

[DOI]

Algorithmica, 1989

Maximal Selection in Tandem Networks with Symmetric Hearing Range.

[BibT_eX]

[DOI]

Zvi Rosberg

Algorithmica, 1989

1988

Maximal Throughput in a Tandem Multi-Hop Radio Network.

[BibT_eX]

[DOI]

Zvi Rosberg

Perform. Evaluation, 1988

Hierarchical Clustering with Topology Databases.

[BibT_eX]

[DOI]

Comput. Networks, 1988

Distributed deadlock resolution.

[BibT_eX]

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

High bandwidth metropolitan area networking architecture.

[BibT_eX]

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

1987

Local Distributed Deadlock Detection by Cycle Detection and Clustering.

[BibT_eX]

[DOI]

IEEE Trans. Software Eng., 1987

Distributed Store-and-Forward Deadlock Detection and Resolution Algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1987

Data Communications: The Implications of Communcation Systems for Protocol Design.

[BibT_eX]

[DOI]

Barry C. Goldstein

IBM Syst. J., 1987

1986

Route Setup with Local Indentifiers.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1986

Subtle Design Issues in the Implementation of Distributed Dynamic Routing Algorithms.

[BibT_eX]

[DOI]

Alan E. Baratz

Comput. Networks, 1986

Establishing Virtual Circuits in Large Computer Networks.

[BibT_eX]

[DOI]

Alan E. Baratz

Comput. Networks, 1986

Local distributed deadlock detection by knot detection.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols, 1986

Threshold Design for Dynamic Routing.

[BibT_eX]

Proceedings of the IEEE International Conference on Communications: Integrating the World Through Communications, 1986

Global Distributed Deadlock Detection & Resolution with Finite Buffers.

[BibT_eX]

Proceedings of the IEEE International Conference on Communications: Integrating the World Through Communications, 1986

1985

Automatic Update of Replicated Topology Databases.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1985

Distributed Multi-Destination Routing: The Constraints of Local Information.

[BibT_eX]

[DOI]

SIAM J. Comput., 1985

SNA Networks of Small Systems.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 1985

1984

Point-To-Multipoint Communication Over Broadcast Links.

[BibT_eX]

[DOI]

Inder S. Gopal

IEEE Trans. Commun., 1984

Algorithms for finding paths with multiple constraints.

[BibT_eX]

[DOI]

Networks, 1984

Automatic update of replicated topology data bases.

[BibT_eX]

[DOI]

Comput. Commun. Rev., 1984

A Distributed Protocol For Maintaining Central Network Control.

[BibT_eX]

Proceedings of the IEEE International Conference on Communications: Links for the Future, 1984

1983

Decentralized Simulation of Resource Managers

[BibT_eX]

[DOI]

J. ACM, April, 1983

Routing to Multiple Destinations in Computer Networks.

[BibT_eX]

[DOI]

Kadaba Bharath-Kumar

IEEE Trans. Commun., 1983

SNA Routing: Past, Present, and Possible Future.

[BibT_eX]

[DOI]

Franklin H. Moss

Robert A. Weingarten

IBM Syst. J., 1983

1982

A Responsive Distributed Routing Algorithm for Computer Networks.

[BibT_eX]

[DOI]

Franklin H. Moss

IEEE Trans. Commun., 1982

1981

Flow Control Power is Nondecentralizable.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1981

Bottleneck Flow Control.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1981

A new approach to performance-oriented flow control.

[BibT_eX]

[DOI]

Kadaba Bharath-Kumar

IEEE Trans. Commun., 1981

Flow control power is non-decentralizable.

[BibT_eX]

[DOI]

Perform. Evaluation, 1981

Algorithms for Scheduling Tasks on Unrelated Processors.

[BibT_eX]

[DOI]

Ernest Davis

J. ACM, 1981

1980

Efficient Scheduling of Tasks without Full Use of Processor Resources.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1980

Bounds on the Scheduling of Typed Task Systems.

[BibT_eX]

[DOI]

SIAM J. Comput., 1980

An Analysis of Preemptive Multiprocessor Job Scheduling.

[BibT_eX]

[DOI]

Math. Oper. Res., 1980

The Equivalence of RE Program Schemes and Data Flow Schemes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1980

1979

Parallel computation: synchronization, scheduling, and schemes.

[BibT_eX]

[DOI]

PhD thesis, 1979

1978

A necessary and sufficient pumping lemma for regular languages.

[BibT_eX]

[DOI]

SIGACT News, 1978

Counting Productions in Context-Free Derivations.

[BibT_eX]

[DOI]