| Variations on a theme by Schalkwijk and Kailath | 30 | 1.84 | 2008 |
| Amplify-and-Forward in Wireless Relay Networks: Rate, Diversity, and Network Size | 79 | 3.34 | 2007 |
| On-line routing and wavelength assignment for dynamic traffic in WDM ring and torus networks | 12 | 0.95 | 2006 |
| Error Exponents for Variable-Length Block Codes With Feedback and Cost Constraints | 12 | 0.92 | 2006 |
| Dynamic wavelength assignment for WDM all-optical tree networks | 9 | 0.76 | 2005 |
| Rate Quantization and Service Quality over Single Crossbar Switches | 11 | 0.69 | 2004 |
| Entropy and the timing capacity of discrete queues | 21 | 2.56 | 2003 |
| An On-Line Routing And Wavelength Assignment Algorithm For Dynamic Traffic In A Wdm Bidirectional Ring | 7 | 0.63 | 2002 |
| Communication over fading channels with delay constraints | 400 | 31.00 | 2002 |
| Bandwidth scaling for fading multipath channels | 91 | 10.67 | 2002 |
| Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs | 147 | 11.10 | 1999 |
| Generalized Tunstall codes for sources with memory | 38 | 2.10 | 1997 |
| A Wideband All-Optical WDM Network (Invited Paper) | 0 | 0.34 | 1996 |
| Full Utilization, Fairness and Bounded Access Delay on High Speed Bus Networks | 0 | 0.34 | 1996 |
| Statistical multiplexing of multiple time-scale Markov streams | 47 | 4.30 | 1995 |
| Combining queueing theory with information theory for multiaccess | 90 | 13.41 | 1995 |
| Wavelength requirements of all-optical networks | 30 | 2.01 | 1995 |
| Arithmetic coding for finite-state noiseless channels | 9 | 1.44 | 1994 |
| Design of error detection scheme for class C service in ATM | 10 | 1.47 | 1994 |
| A generalized processor sharing approach to flow control in integrated services networks—the single node case | 1100 | 143.76 | 1993 |
| A generalized processor sharing approach to flow control in integrated services networks—the single node case | 1100 | 143.76 | 1993 |
| Review of 'Silicon Dreams - Information, Man, and Machine' (Lucky, R.W.; 1989) | 0 | 0.34 | 1991 |
| Event driven topology broadcast without sequence numbers | 27 | 6.42 | 1989 |
| A new distributed algorithm to find breadth first search trees | 65 | 11.18 | 1987 |
| Round Robin Scheduling for Fair Flow Control in Data Communication Networks | 66 | 72.76 | 1986 |
| Distributed BFS algorithms | 18 | 4.09 | 1985 |
| Efficient Modulation for Band-Limited Channels | 245 | 356.05 | 1984 |
| Encoding message lengths for data transmission (Corresp.) | 0 | 0.34 | 1978 |
| The random coding bound is tight for the average code (Corresp.) | 43 | 6.74 | 1973 |
| Arthur Kohlenberg 1924-1970 (Obituary) | 0 | 0.34 | 1971 |
| Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. II | 4 | 0.45 | 1967 |
