default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdgar N. Gilbert
Person information
- affiliation: Bell Labs
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2001
[j20]Sem C. Borst, Edward G. Coffman Jr., Edgar N. Gilbert, Philip A. Whiting, Peter M. Winkler:
Optimal Carrier Sharing in Wireless TDMA. J. Interconnect. Networks 2(2): 189-211 (2001)
1990 – 1999
- 1997
- [j19]Edward G. Coffman Jr., Leopold Flatto, Edgar N. Gilbert, Albert G. Greenberg:
An Approximate Model of Processor Communication Rings Under Heavy Load. Inf. Process. Lett. 64(2): 61-67 (1997) - 1995
- [j18]Edgar N. Gilbert:
Coding with digits of unequal cost. IEEE Trans. Inf. Theory 41(2): 596-600 (1995) - 1993
- [j17]Edgar N. Gilbert:
Increased information rate by oversampling. IEEE Trans. Inf. Theory 39(6): 1973-1976 (1993) - 1992
- [j16]Leonid B. Boguslavsky, Edward G. Coffman Jr., Edgar N. Gilbert, Alexander Y. Kreinin:
Scheduling Checks and Saves. INFORMS J. Comput. 4(1): 60-69 (1992) - [j15]Edward G. Coffman Jr., Edgar N. Gilbert:
Paths through a maze of rectangles. Networks 22(4): 349-367 (1992) - [j14]Edgar N. Gilbert, T. T. Kadota:
The Lempel-Ziv algorithm and message complexity. IEEE Trans. Inf. Theory 38(6): 1839-1842 (1992)
1980 – 1989
- 1989
- [j13]Edgar N. Gilbert:
A solvable routing problem. Networks 19(5): 587-594 (1989) - 1988
- [j12]Edgar N. Gilbert:
Retrials and balks. IEEE Trans. Inf. Theory 34(6): 1502-1508 (1988) - 1987
- [j11]Edward G. Coffman Jr., Edgar N. Gilbert:
Polling and Greedy Servers on a Line. Queueing Syst. Theory Appl. 2(2): 115-145 (1987) - 1986
- [j10]Edward G. Coffman Jr., Edgar N. Gilbert:
A continuous polling system with constant service times. IEEE Trans. Inf. Theory 32(4): 584-591 (1986) - [c1]Edward G. Coffman Jr., Erol Gelenbe, Edgar N. Gilbert:
Analysis of a Conveyor Queue in a Flexible Manufacturing System. SIGMETRICS 1986: 204-223 - 1985
- [j9]Edward G. Coffman Jr., Edgar N. Gilbert:
On the Expected Relative Performance of List Scheduling. Oper. Res. 33(3): 548-561 (1985) - 1984
- [j8]Edward G. Coffman Jr., Edgar N. Gilbert:
Dynamic, First-Fit Packings in Two or More Dimensions. Inf. Control. 61(1): 1-14 (1984) - 1982
- [j7]Edgar N. Gilbert, Clyde L. Monma:
Multigram codes. IEEE Trans. Inf. Theory 28(2): 346- (1982) - 1980
- [j6]Edgar N. Gilbert:
Random Colorings of a Lattice of Squares in the Plane. SIAM J. Algebraic Discret. Methods 1(2): 152-159 (1980)
1970 – 1979
- 1975
- [j5]Edgar N. Gilbert:
Line-of-sight paths over random terrain. Bell Syst. Tech. J. 54(4): 735-765 (1975) - 1971
- [j4]Edgar N. Gilbert:
Codes based on inaccurate source probabilities. IEEE Trans. Inf. Theory 17(3): 304-314 (1971)
1960 – 1969
- 1969
- [j3]Edgar N. Gilbert:
How Good is Morse Code? Inf. Control. 14(6): 559-565 (1969) - 1963
- [j2]Edgar N. Gilbert:
Cyclically permutable error-correcting codes. IEEE Trans. Inf. Theory 9(3): 175-182 (1963) - 1960
- [j1]Edgar N. Gilbert:
Synchronization of binary messages. IRE Trans. Inf. Theory 6(4): 470-477 (1960)
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-05-02 21:45 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:
