Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Elias 0001
Person information
- award (2002): IEEE Richard W. Hamming Medal
Other persons with the same name
- Peter Elias 0002
![[0000-0002-2578-6535]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-2578-6535")
(aka: Peter Eliás 0002) — Slovak Academy of Sciences, Mathematical Institute, Slovak Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1991
[j19]Peter Elias:
Error-correcting codes for list decoding. IEEE Trans. Inf. Theory 37(1): 5-12 (1991)
1980 – 1989
- 1988
- [j18]Peter Elias:
Zero error capacity under list decoding. IEEE Trans. Inf. Theory 34(5): 1070-1074 (1988) - 1987
- [j17]Peter Elias:
Interval and recency rank source coding: Two on-line adaptive variable-length schemes. IEEE Trans. Inf. Theory 33(1): 3-10 (1987) - 1983
- [j16]Peter Elias:
Minimax optimal universal codeword sets. IEEE Trans. Inf. Theory 29(4): 491-501 (1983)
1970 – 1979
- 1976
- [j15]Donna J. Brown, Peter Elias:
Complexity of acceptors for prefix codes (Corresp.). IEEE Trans. Inf. Theory 22(3): 357-359 (1976) - 1975
- [j14]Peter Elias, Richard A. Flower:
The Complexity of Some Simple Retrieval Problems. J. ACM 22(3): 367-379 (1975) - [j13]Peter Elias:
Universal codeword sets and representations of the integers. IEEE Trans. Inf. Theory 21(2): 194-203 (1975) - [j12]Peter Elias:
Distinguishable codeword sets for shared memory. IEEE Trans. Inf. Theory 21(4): 392-399 (1975) - 1974
- [j11]Peter Elias:
Efficient Storage and Retrieval by Content and Address of Static Files. J. ACM 21(2): 246-260 (1974) - [j10]Peter Elias:
Minimum Times and Memories Needed to Compute the Values of a Function. J. Comput. Syst. Sci. 9(2): 196-212 (1974) - 1970
- [j9]Peter Elias:
Bounds on performance of optimum quantizers. IEEE Trans. Inf. Theory 16(2): 172-184 (1970)
1960 – 1969
- 1967
- [j8]Peter Elias:
Networks of Gaussian channels with applications to feedback systems. IEEE Trans. Inf. Theory 13(3): 493-501 (1967) - 1961
- [j7]Peter Elias:
Progress in information theory in the USA, 1957-1960. IRE Trans. Inf. Theory 7(3): 128-144 (1961)
1950 – 1959
- 1958
- [j6]Peter Elias:
Computation in the Presence of Noise. IBM J. Res. Dev. 2(4): 346-353 (1958) - 1957
- [j5]Leon Brillouin, E. Colin Cherry, Peter Elias:
A Statement of Editorial Policy. Inf. Control. 1(1): i-ii (1957) - 1956
- [j4]Peter Elias, Amiel Feinstein, Claude E. Shannon:
A note on the maximum flow through a network. IRE Trans. Inf. Theory 2(4): 117-119 (1956) - 1955
- [j3]Peter Elias:
Predictive coding-I. IRE Trans. Inf. Theory 1(1): 16-24 (1955) - [j2]Peter Elias:
Predictive coding-II. IRE Trans. Inf. Theory 1(1): 24-33 (1955) - 1954
- [j1]Peter Elias:
Error-free Coding. Trans. IRE Prof. Group Inf. Theory 4: 29-37 (1954)
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-02-06 23:51 CET 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:
