Robert G. Gallager - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 48 from 48

2010

Variations on a theme by Schalkwijk and KailathRobert G. Gallager, Baris Nakiboglu. TIT, 56(1):6-17, 2010. [doi]

2008

Error Exponents for Variable-Length Block Codes With Feedback and Cost ConstraintsBaris Nakiboglu, Robert G. Gallager. TIT, 54(3):945-963, 2008. [doi]

2006

Error Exponents for Variable-length block codes with feedback and cost constraintsBaris Nakiboglu, Robert G. Gallager, Moe Z. Win. isit 2006: 74-78 [doi]

On-line routing and wavelength assignment for dynamic traffic in WDM ring and torus networksPoompat Saengudomlert, Eytan Modiano, Robert G. Gallager. ton, 14(2):330-340, 2006. [doi]

2005

Dynamic wavelength assignment for WDM all-optical tree networksPoompat Saengudomlert, Eytan Modiano, Robert G. Gallager. ton, 13(4):895-905, 2005. [doi]

2004

Rate Quantization and Service Quality over Single Crossbar SwitchesCan Emre Koksal, Robert G. Gallager, Charles E. Rohrs. infocom 2004: 1962-1973 [doi]

2003

On-line routing and wavelength assignment for dynamic traffic in WDM ring and torus networksPoompat Saengudomlert, Eytan Modiano, Robert G. Gallager. infocom 2003: 1805-1815 [doi]

2002

Communication over fading channels with delay constraintsRandall A. Berry, Robert G. Gallager. TIT, 48(5):1135-1149, 2002.

Bandwidth scaling for fading multipath channelsMuriel Médard, Robert G. Gallager. TIT, 48(4):840-852, 2002.

An On-Line Routing and Wavelength Assignment Algorithm for Dynamic Traffic in a WDM Bidirectional RingPoompat Saengudomlert, Eytan Modiano, Robert G. Gallager. jcis 2002: 1331-1334

2001

Claude E. Shannon: A retrospective on his life, work, and impactRobert G. Gallager. TIT, 47(7):2681-2695, 2001.

1998

Multicast automatic protection switching in arbitrary redundant graphsRobert G. Gallager, Muriel Médard, Richard A. Barry, Steven G. Finn. icc 1998: 640-644 [doi]

1997

Generalized Tunstall codes for sources with memorySerap A. Savari, Robert G. Gallager. TIT, 43(2):658-668, 1997.

1996

1995

Wavelength requirements of all-optical networksRajesh K. Pankaj, Robert G. Gallager. ton, 3(3):269-280, 1995. [doi]

Statistical Multiplexing of Multiple Time-Scale Markov StreamsDavid N. C. Tse, Robert G. Gallager, John N. Tsitsiklis. jsac, 13(6):1028-1038, 1995.

Combining Queueing Theory with Information Theory for MultiaccessÌ. Emre Telatar, Robert G. Gallager. jsac, 13(6):963-969, 1995.

1994

A generalized processor sharing approach to flow control in integrated services networks: the multiple node caseAbhay K. Parekh, Robert G. Gallager. ton, 2(2):137-150, 1994. [doi]

Arithmetic coding for finite-state noiseless channelsSerap A. Savari, Robert G. Gallager. TIT, 40(1):100-107, 1994.

Design of error detection scheme for class C service in ATMJane M. Simmons, Robert G. Gallager. ton, 2(1):80-88, 1994. [doi]

1993

A generalized processor sharing approach to flow control in integrated services networks: the single-node caseAbhay K. Parekh, Robert G. Gallager. ton, 1(3):344-357, 1993. [doi]

A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node CaseAbhay K. Parekh, Robert G. Gallager. infocom 1993: 521-530

1992

A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks - The Single Node CaseAbhay K. Parekh, Robert G. Gallager. infocom 1992: 915-924

Arithmetic Coding for Memoryless Cost ChannelsSerap A. Savari, Robert G. Gallager. dcc 1992: 92-101

1991

Review of Silicon Dreams - Information, Man, and Machine (Lucky, R.W.; 1989)Robert G. Gallager. TIT, 37(1):226, 1991.

1989

Event driven topology broadcast without sequence numbersJohn Michael Spinelli, Robert G. Gallager. tcom, 37(5):468-474, 1989. [doi]

1988

Finding parity in a simple broadcast networkRobert G. Gallager. TIT, 34(2):176-180, 1988.

1987

A new distributed algorithm to find breadth first search treesBaruch Awerbuch, Robert G. Gallager. TIT, 33(3):315-322, 1987.

1986

Round Robin Scheduling for Fair Flow Control in Data Communication NetworksEllen L. Hahne, Robert G. Gallager. icc 1986: 103-107

1985

Distributed BFS AlgorithmsBaruch Awerbuch, Robert G. Gallager. focs 1985: 250-256

A perspective on multiaccess channelsRobert G. Gallager. TIT, 31(2):124-142, 1985.

1984

Second Derivative Algorithms for Minimum Delay Distributed Routing in NetworksDimitri P. Bertsekas, Eli Gafni, Robert G. Gallager. tcom, 32(8):911-919, 1984. [doi]

Efficient Modulation for Band-Limited ChannelsG. David Forney Jr., Robert G. Gallager, Gordon R. Lang, Fred M. Longstaff, Shahid U. Qureshi. jsac, 2(5):632-647, 1984. [doi]

1983

A Distributed Algorithm for Minimum-Weight Spanning TreesRobert G. Gallager, Pierre A. Humblet, Philip M. Spira. TOPLAS, 5(1):66-77, 1983. [doi]

1978

Encoding message lengths for data transmission (Corresp.)Roger J. Camrass, Robert G. Gallager. TIT, 24(4):495-496, 1978. [doi]

Variations on a theme by HuffmanRobert G. Gallager. TIT, 24(6):668-674, 1978. [doi]

1977

A Minimum Delay Routing Algorithm Using Distributed ComputationRobert G. Gallager. tcom, 25(1):73-85, 1977. [doi]

1976

Basic limits on protocol information in data communication networksRobert G. Gallager. TIT, 22(4):385-398, 1976. [doi]

1975

Optimal source codes for geometrically distributed integer alphabets (Corresp.)Robert G. Gallager, David C. van Voorhis. TIT, 21(2):228-230, 1975. [doi]

1974

Tree encoding for symmetric sources with a distortion measureRobert G. Gallager. TIT, 20(1):65-76, 1974. [doi]

1973

The random coding bound is tight for the average code (Corresp.)Robert G. Gallager. TIT, 19(2):244-246, 1973. [doi]

1971

Arthur Kohlenberg 1924-1970 (Obituary)Robert G. Gallager, James L. Massey, G. David Forney Jr.. TIT, 17(2):126, 1971. [doi]

1969

A bound on the probability that a Gaussian process exceeds a given function (Corresp.)Robert G. Gallager, Carl W. Helstrom. TIT, 15(1):163-166, 1969. [doi]

1967

Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. IIClaude E. Shannon, Robert G. Gallager, Elwyn R. Berlekamp. iandc, 10(5):522-552, May 1967.

Lower Bounds to Error Probability for Coding on Discrete Memorylless Channels. IClaude E. Shannon, Robert G. Gallager, Elwyn R. Berlekamp. iandc, 10(1):65-103, January 1967.

1965

A simple derivation of the coding theorem and some applicationsRobert G. Gallager. TIT, 11(1):3-18, 1965. [doi]

1962

Low-density parity-check codesRobert G. Gallager. TIT, 8(1):21-28, 1962. [doi]

Sign in or sign up to see more results.

runs on WebDSL