default search action
Robert G. Gallager
Person information
- affiliation: MIT, Cambridge, USA
- award (2004): Dijkstra Prize
- award (2003): Marconi Prize
- award (1990): IEEE Medal of Honor
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
- [j39]Robert G. Gallager, Baris Nakiboglu
:
Variations on a theme by Schalkwijk and Kailath. IEEE Trans. Inf. Theory 56(1): 6-17 (2010)
2000 – 2009
- 2008
- [j38]Baris Nakiboglu
Error Exponents for Variable-Length Block Codes With Feedback and Cost Constraints. IEEE Trans. Inf. Theory 54(3): 945-963 (2008) - [i2]Robert G. Gallager, Baris Nakiboglu:
Variations on a theme by Schalkwijk and Kailath. CoRR abs/0812.2709 (2008) - 2007
- [j37]Shashi Borade, Lizhong Zheng, Robert G. Gallager:
Amplify-and-Forward in Wireless Relay Networks: Rate, Diversity, and Network Size. IEEE Trans. Inf. Theory 53(10): 3302-3318 (2007) - 2006
- [j36]Poompat Saengudomlert, Eytan H. Modiano, Robert G. Gallager:
On-line routing and wavelength assignment for dynamic traffic in WDM ring and torus networks. IEEE/ACM Trans. Netw. 14(2): 330-340 (2006) - [c11]Baris Nakiboglu
Error Exponents for Variable-length block codes with feedback and cost constraints. ISIT 2006: 74-78 - [i1]Baris Nakiboglu, Robert G. Gallager:
Error Exponents for Variable-length Block Codes with Feedback and Cost Constraints. CoRR abs/cs/0612097 (2006) - 2005
- [j35]Poompat Saengudomlert, Eytan H. Modiano, Robert G. Gallager:
Dynamic wavelength assignment for WDM all-optical tree networks. IEEE/ACM Trans. Netw. 13(4): 895-905 (2005) - 2004
- [c10]Can Emre Koksal, Robert G. Gallager, Charles E. Rohrs:
Rate Quantization and Service Quality over Single Crossbar Switches. INFOCOM 2004: 1962-1973 - 2003
- [j34]Balaji Prabhakar, Robert G. Gallager:
Entropy and the timing capacity of discrete queues. IEEE Trans. Inf. Theory 49(2): 357-370 (2003) - [c9]Poompat Saengudomlert, Eytan H. Modiano, Robert G. Gallager:
On-line routing and wavelength assignment for dynamic traffic in WDM ring and torus networks. INFOCOM 2003: 1805-1815 - 2002
- [j33]Muriel Médard, Robert G. Gallager:
Bandwidth scaling for fading multipath channels. IEEE Trans. Inf. Theory 48(4): 840-852 (2002) - [j32]Randall A. Berry
Communication over fading channels with delay constraints. IEEE Trans. Inf. Theory 48(5): 1135-1149 (2002) - [c8]Poompat Saengudomlert, Eytan H. Modiano, Robert G. Gallager:
An On-Line Routing and Wavelength Assignment Algorithm for Dynamic Traffic in a WDM Bidirectional Ring. JCIS 2002: 1331-1334 - 2001
- [j31]Robert G. Gallager:
Claude E. Shannon: A retrospective on his life, work, and impact. IEEE Trans. Inf. Theory 47(7): 2681-2695 (2001)
1990 – 1999
- 1998
- [c7]Robert G. Gallager, Muriel Médard, Richard A. Barry, Steven G. Finn:
Multicast automatic protection switching in arbitrary redundant graphs. ICC 1998: 640-644 - 1997
- [j30]Serap A. Savari, Robert G. Gallager:
Generalized Tunstall codes for sources with memory. IEEE Trans. Inf. Theory 43(2): 658-668 (1997) - 1996
- [j29]Ivan P. Kaminow, Chris R. Doerr, Corrado Dragone, Tom Koch, Uzi Koren, Adel A. M. Saleh, Alan J. Kirby, Cüneyt M. Özveren, B. Schofield, Robert E. Thomas, Richard A. Barry, Daniel M. Castagnozzi, Vincent W. S. Chan, B. Roe Hemenway Jr., Douglas Marquis, Salil A. Parikh, Mark L. Stevens, Eric A. Swanson, Steven G. Finn, Robert G. Gallager:
A Wideband All-Optical WDM Network (Invited Paper). IEEE J. Sel. Areas Commun. 14(5): 780-799 (1996) - [c6]Angela L. Chiu, Robert G. Gallager:
Full Utilization, Fairness and Bounded Access Delay on High Speed Bus Networks. ICNP 1996: 154-161 - 1995
- [j28]I. Emre Telatar, Robert G. Gallager:
Combining Queueing Theory with Information Theory for Multiaccess. IEEE J. Sel. Areas Commun. 13(6): 963-969 (1995) - [j27]David N. C. Tse, Robert G. Gallager, John N. Tsitsiklis:
Statistical Multiplexing of Multiple Time-Scale Markov Streams. IEEE J. Sel. Areas Commun. 13(6): 1028-1038 (1995) - [j26]Rajesh K. Pankaj, Robert G. Gallager:
Wavelength requirements of all-optical networks. IEEE/ACM Trans. Netw. 3(3): 269-280 (1995) - 1994
- [j25]Serap A. Savari, Robert G. Gallager:
Arithmetic coding for finite-state noiseless channels. IEEE Trans. Inf. Theory 40(1): 100-107 (1994) - [j24]Jane M. Simmons, Robert G. Gallager:
Design of error detection scheme for class C service in ATM. IEEE/ACM Trans. Netw. 2(1): 80-88 (1994) - [j23]Abhay K. Parekh, Robert G. Gallager:
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case. IEEE/ACM Trans. Netw. 2(2): 137-150 (1994) - 1993
- [j22]Abhay K. Parekh, Robert G. Gallager:
A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Trans. Netw. 1(3): 344-357 (1993) - [c5]Abhay K. Parekh, Robert G. Gallager:
A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case. INFOCOM 1993: 521-530 - 1992
- [b1]Dimitri P. Bertsekas, Robert G. Gallager:
Data Networks, Second Edition. Prentice Hall 1992, ISBN 978-0-13-201674-2, pp. I-XIX, 1-556 - [c4]Serap A. Savari, Robert G. Gallager:
Arithmetic Coding for Memoryless Cost Channels. Data Compression Conference 1992: 92-101 - [c3]Abhay K. Parekh, Robert G. Gallager:
A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks - The Single Node Case. INFOCOM 1992: 915-924 - 1991
- [j21]Robert G. Gallager:
Review of 'Silicon Dreams - Information, Man, and Machine' (Lucky, R.W.; 1989). IEEE Trans. Inf. Theory 37(1): 226 (1991)
1980 – 1989
- 1989
- [j20]John Michael Spinelli, Robert G. Gallager:
Event driven topology broadcast without sequence numbers. IEEE Trans. Commun. 37(5): 468-474 (1989) - 1988
- [j19]Robert G. Gallager:
Finding parity in a simple broadcast network. IEEE Trans. Inf. Theory 34(2): 176-180 (1988) - 1987
- [j18]Baruch Awerbuch, Robert G. Gallager:
A new distributed algorithm to find breadth first search trees. IEEE Trans. Inf. Theory 33(3): 315-322 (1987) - 1986
- [c2]Ellen L. Hahne, Robert G. Gallager:
Round Robin Scheduling for Fair Flow Control in Data Communication Networks. ICC 1986: 103-107 - 1985
- [j17]Robert G. Gallager:
A perspective on multiaccess channels. IEEE Trans. Inf. Theory 31(2): 124-142 (1985) - [c1]Baruch Awerbuch, Robert G. Gallager:
Distributed BFS Algorithms. FOCS 1985: 250-256 - 1984
- [j16]G. David Forney Jr., Robert G. Gallager, Gordon R. Lang, Fred M. Longstaff, Shahid U. Qureshi:
Efficient Modulation for Band-Limited Channels. IEEE J. Sel. Areas Commun. 2(5): 632-647 (1984) - [j15]Dimitri P. Bertsekas, Eli Gafni, Robert G. Gallager:
Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks. IEEE Trans. Commun. 32(8): 911-919 (1984) - 1983
- [j14]Robert G. Gallager, Pierre A. Humblet, Philip M. Spira:
A Distributed Algorithm for Minimum-Weight Spanning Trees. ACM Trans. Program. Lang. Syst. 5(1): 66-77 (1983)
1970 – 1979
- 1978
- [j13]Roger J. Camrass, Robert G. Gallager:
Encoding message lengths for data transmission (Corresp.). IEEE Trans. Inf. Theory 24(4): 495-496 (1978) - [j12]Robert G. Gallager:
Variations on a theme by Huffman. IEEE Trans. Inf. Theory 24(6): 668-674 (1978) - 1977
- [j11]Robert G. Gallager:
A Minimum Delay Routing Algorithm Using Distributed Computation. IEEE Trans. Commun. 25(1): 73-85 (1977) - 1976
- [j10]Robert G. Gallager:
Basic limits on protocol information in data communication networks. IEEE Trans. Inf. Theory 22(4): 385-398 (1976) - 1975
- [j9]Robert G. Gallager, David C. van Voorhis:
Optimal source codes for geometrically distributed integer alphabets (Corresp.). IEEE Trans. Inf. Theory 21(2): 228-230 (1975) - 1974
- [j8]Robert G. Gallager:
Tree encoding for symmetric sources with a distortion measure. IEEE Trans. Inf. Theory 20(1): 65-76 (1974) - 1973
- [j7]Robert G. Gallager:
The random coding bound is tight for the average code (Corresp.). IEEE Trans. Inf. Theory 19(2): 244-246 (1973) - 1971
- [j6]Robert G. Gallager, James L. Massey, G. David Forney Jr.:
Arthur Kohlenberg 1924-1970 (Obituary). IEEE Trans. Inf. Theory 17(2): 126 (1971)
1960 – 1969
- 1969
- [j5]Robert G. Gallager, Carl W. Helstrom:
A bound on the probability that a Gaussian process exceeds a given function (Corresp.). IEEE Trans. Inf. Theory 15(1): 163-166 (1969) - 1967
- [j4]Claude E. Shannon, Robert G. Gallager, Elwyn R. Berlekamp:
Lower Bounds to Error Probability for Coding on Discrete Memorylless Channels. I. Inf. Control. 10(1): 65-103 (1967) - [j3]Claude E. Shannon, Robert G. Gallager, Elwyn R. Berlekamp:
Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. II. Inf. Control. 10(5): 522-552 (1967) - 1965
- [j2]Robert G. Gallager:
A simple derivation of the coding theorem and some applications. IEEE Trans. Inf. Theory 11(1): 3-18 (1965) - 1962
- [j1]Robert G. Gallager:
Low-density parity-check codes. IRE Trans. Inf. Theory 8(1): 21-28 (1962)
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 2024-04-25 05:56 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 and maintained by:
the dblp computer science bibliography is funded and supported by: