Edgar N. Gilbert

Affiliations:
  • Bell Labs


According to our database1, Edgar N. Gilbert authored at least 21 papers between 1960 and 2001.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2001
Optimal Carrier Sharing in Wireless TDMA.
J. Interconnect. Networks, 2001

1997
An Approximate Model of Processor Communication Rings Under Heavy Load.
Inf. Process. Lett., 1997

1995
Coding with digits of unequal cost.
IEEE Trans. Inf. Theory, 1995

1993
Increased information rate by oversampling.
IEEE Trans. Inf. Theory, 1993

1992
The Lempel-Ziv algorithm and message complexity.
IEEE Trans. Inf. Theory, 1992

Paths through a maze of rectangles.
Networks, 1992

Scheduling Checks and Saves.
INFORMS J. Comput., 1992

1989
A solvable routing problem.
Networks, 1989

1988
Retrials and balks.
IEEE Trans. Inf. Theory, 1988

1987
Polling and Greedy Servers on a Line.
Queueing Syst. Theory Appl., 1987

1986
A continuous polling system with constant service times.
IEEE Trans. Inf. Theory, 1986

Analysis of a Conveyor Queue in a Flexible Manufacturing System.
Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, 1986

1985
On the Expected Relative Performance of List Scheduling.
Oper. Res., 1985

1984
Dynamic, First-Fit Packings in Two or More Dimensions
Inf. Control., April, 1984

1982
Multigram codes.
IEEE Trans. Inf. Theory, 1982

1980
Random Colorings of a Lattice of Squares in the Plane.
SIAM J. Algebraic Discret. Methods, 1980

1975
Line-of-sight paths over random terrain.
Bell Syst. Tech. J., 1975

1971
Codes based on inaccurate source probabilities.
IEEE Trans. Inf. Theory, 1971

1969
How Good is Morse Code?
Inf. Control., June, 1969

1963
Cyclically permutable error-correcting codes.
IEEE Trans. Inf. Theory, 1963

1960
Synchronization of binary messages.
IRE Trans. Inf. Theory, 1960


  Loading...