| 1991 | ||
|---|---|---|
| j8 | Peter Elias: Error-correcting codes for list decoding. IEEE Transactions on Information Theory 37(1): 5-12 (1991) | |
| 1988 | ||
| j7 | Peter Elias: Zero error capacity under list decoding. IEEE Transactions on Information Theory 34(5): 1070-1074 (1988) | |
| 1987 | ||
| j6 | Peter Elias: Interval and recency rank source coding: Two on-line adaptive variable-length schemes. IEEE Transactions on Information Theory 33(1): 3-10 (1987) | |
| 1983 | ||
| j5 | Peter Elias: Minimax optimal universal codeword sets. IEEE Transactions on Information Theory 29(4): 491-501 (1983) | |
| 1976 | ||
| j4 | Donna J. Brown, Peter Elias: Complexity of acceptors for prefix codes (Corresp.). IEEE Transactions on Information Theory 22(3): 357-359 (1976) | |
| 1975 | ||
| j3 | Peter Elias, Richard A. Flower: The Complexity of Some Simple Retrieval Problems. J. ACM 22(3): 367-379 (1975) | |
| 1974 | ||
| j2 | Peter Elias: Efficient Storage and Retrieval by Content and Address of Static Files. J. ACM 21(2): 246-260 (1974) | |
| j1 | Peter Elias: Minimum Times and Memories Needed to Compute the Values of a Function. J. Comput. Syst. Sci. 9(2): 196-212 (1974) | |
| 1 | Donna J. Brown | |
| 2 | Richard A. Flower |
Data released under the ODC-BY 1.0 license — See also our legal information page