Bruce E. Hajek

IEEE Trans. Inf. Theory, 2002

Capacity and reliability function for small peak signal constraints.

[BibT_eX]

[DOI]

Vijay G. Subramanian

IEEE Trans. Inf. Theory, 2002

An information-theoretic and game-theoretic study of timing channels.

[BibT_eX]

[DOI]

James Giles

IEEE Trans. Inf. Theory, 2002

On the use of packet classes in communication networks to enhance congestion pricing based on marks.

[BibT_eX]

[DOI]

Juan Alvarez

IEEE Trans. Autom. Control., 2002

Jointly optimal paging and registration for a symmetric random walk.

[BibT_eX]

[DOI]

Proceedings of the 2002 IEEE Information Theory Workshop, 2002

2000

Large bursts do not cause instability.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2000

1999

Information measures for discrete random fields.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

1998

On variations of queue response for inputs with the same mean and autocorrelation function.

[BibT_eX]

[DOI]

Linhai He

IEEE/ACM Trans. Netw., 1998

Information Theory and Communication Networks: An Unconsummated Union.

[BibT_eX]

[DOI]

Anthony Ephremides

IEEE Trans. Inf. Theory, 1998

1997

Scheduling nonuniform traffic in a packet-switching system with small propagation delay.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 1997

On the capture probability for a large number of stations.

[BibT_eX]

[DOI]

Richard O. LaMaire

IEEE Trans. Commun., 1997

Analysis of Simple Algorithms for Dynamic Load Balancing.

[BibT_eX]

[DOI]

Murat Alanyali

Math. Oper. Res., 1997

1996

Review of 'Discrete Stochastic Processes' (Gallager, R.G.; 1996).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

1995

Scheduling nonuniform traffic in a packet switching system with large propagation delay.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

On Simple Algorithms for Dynamic Load Balancing.

[BibT_eX]

[DOI]

Murat Alanyali

Proceedings of the Proceedings IEEE INFOCOM '95, 1995

1994

On the delay in a multiple-access system with large propagation delay.

[BibT_eX]

[DOI]

Nikolay B. Likhanov

Boris S. Tsybakov

IEEE Trans. Inf. Theory, 1994

Comments on "An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies".

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1994

A simple formula for mean multiplexing delay for independent regenerative sources.

[BibT_eX]

[DOI]

Hervé Dupuis

Queueing Syst. Theory Appl., 1994

Sharper analysis of packet routing on a butterfly.

[BibT_eX]

[DOI]

Andrea Pietracaprina

Networks, 1994

1993

On the average delay for routing subject to independent deflections.

[BibT_eX]

[DOI]

Rene L. Cruz

IEEE Trans. Inf. Theory, 1993

Scheduling with asynchronous service opportunities with applications to multiple satellite systems.

[BibT_eX]

[DOI]

Michael Carr

IEEE Trans. Autom. Control., 1993

Simple Formulas for Multiplexing Delay for Independent Regenerative Sources.

[BibT_eX]

[DOI]

Hervé Dupuis

Proceedings of the Proceedings IEEE INFOCOM '93, The Conference on Computer Communications, Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies, Networking: Foundation for the Future, San Francisco, CA, USA, March 28, 1993

1992

Sequential decoding of low-density parity-check codes by adaptive reordering of parity checks.

[BibT_eX]

[DOI]

Branko Radosavljevic

Erdal Arikan

IEEE Trans. Inf. Theory, 1992

Deflection routing in hypercube networks.

[BibT_eX]

[DOI]

Albert G. Greenberg

IEEE Trans. Commun., 1992

1991

On the maximum tolerable noise for reliable computation by formulas.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

Bounds on Evacuation Time for Deflection Routing.

[BibT_eX]

[DOI]

Distributed Comput., 1991

Packet Routing in Optimal Time on a Butterfly.

[BibT_eX]

[DOI]

Andrea Pietracaprina

Proceedings of the Proceedings IEEE INFOCOM '91, 1991

1990

Performance of global load balancing of local adjustment.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1990

Performance of Shuffle-Like Switching Networks with Deflection.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM '90, 1990

1988

Link scheduling in polynomial time.

[BibT_eX]

[DOI]

Galen H. Sasaki

IEEE Trans. Inf. Theory, 1988

Cooling Schedules for Optimal Annealing.

[BibT_eX]

[DOI]

Math. Oper. Res., 1988

The time complexity of maximum matching by simulated annealing.

[BibT_eX]

[DOI]

Galen H. Sasaki

J. ACM, 1988

1987

Locating the maximum of a simple random sequence by sequential search.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1987

Optimal Dynamic Routing in Single Commodity Networks by Iterative Methods.

[BibT_eX]

[DOI]

Galen H. Sasaki

IEEE Trans. Commun., 1987

1985

Review of 'Approximation and Weak Convergence Methods for Random Processes, with Applications to Stochastic Systems Theory' (Kushner, H.J.; 1984).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1985

Stochastic approximation methods for decentralized control of multiaccess communications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1985

Extremal Splittings of Point Processes.

[BibT_eX]

[DOI]

Math. Oper. Res., 1985

1984

Optimal dynamic routing in communication networks with continuous traffic.

[BibT_eX]

[DOI]

Richard G. Ogier

Networks, 1984

1983

The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks

[BibT_eX]

[DOI]

J. ACM, October, 1983

Balanced Scheduling in a Packet Synchronized spread Spectrum Network.

[BibT_eX]

Proceedings of the Proceedings IEEE INFOCOM 83, San Diego, CA, USA, April 18-21, 1983, 1983

1982

Information of partitions with applications to random access communications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1982

Information-singularity and recoverability of random processes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1982

A new upper bound to the throughput of a multi-access broadcast channel.

[BibT_eX]

[DOI]

Rene L. Cruz

IEEE Trans. Inf. Theory, 1982

1979

Evaluation of an achievable rate region for the broadcast channel.

[BibT_eX]

[DOI]

Michael B. Pursley

IEEE Trans. Inf. Theory, 1979

On the strong information singularity of certain stationary processes (Corresp.).

[BibT_eX]

[DOI]