-
1
-
-
0015681549
-
Universal noiseless coding
-
Nov.
-
L. D. Davisson, “Universal noiseless coding,” IEEE Trans. Inform. Theory. vol. IT-19. pp. 783–795. Nov. 1973.
-
(1973)
IEEE Trans. Inform. Theory.
, vol.IT-19
, pp. 783-795
-
-
Davisson, L.D.1
-
2
-
-
84937999311
-
Predictive coding:
-
esp. pp. 30–33, Mar
-
P. Elias, “Predictive coding:” IRE Trans. Inform. Theory, vol. IT-I, pp. 16–33, esp. pp. 30–33, Mar, 1955.
-
(1955)
IRE Trans. Inform. Theory
, vol.IT-1
, pp. 16-33
-
-
Elias, P.1
-
3
-
-
0012578418
-
The efficient construction of an unbiased random sequence
-
P. Elias, “The efficient construction of an unbiased random sequence,” Ann. Math. Statist., vol. 43, pp. 865–870, 1972.
-
(1972)
Ann. Math. Statist.
, vol.43
, pp. 865-870
-
-
Elias, P.1
-
4
-
-
0016047467
-
Efficient storage and retrieval by content and address of static files
-
P. Elias, “Efficient storage and retrieval by content and address of static files,” J. Ass. Comput. Mach., vol. 21, pp. 246–260, 1974.
-
(1974)
J. Ass. Comput. Mach.
, vol.21
, pp. 246-260
-
-
Elias, P.1
-
5
-
-
0016114802
-
Minimum times and memories needed to compute the values of a function
-
Oct.
-
P. Elias, “Minimum times and memories needed to compute the values of a function,” J. Comput. Syst. Sci., Oct. 1974.
-
(1974)
J. Comput. Syst. Sci.
-
-
Elias, P.1
-
6
-
-
84939035489
-
Computer updating of a data structure
-
July 15
-
R. A. Flower, “Computer updating of a data structure,” Research Lab. Electron., M.I.T., Cambridge, Mass., Quart. Progress Rep. 110, pp. 147-154., July 15, 1973.
-
(1973)
Research Lab. Electron.
, pp. 147-154
-
-
Flower, R.A.1
-
7
-
-
0002616515
-
Permuting information in idealized two-level storage
-
Miller, Thatcher and Bohlinger, Eds. New York: Plenum
-
R. W. Floyd, “Permuting information in idealized two-level storage,” in Complexity of Computer Computations, Miller, Thatcher and Bohlinger, Eds. New York: Plenum, 1972, pp. 105-109.
-
(1972)
Complexity of Computer Computations
, pp. 105-109
-
-
Floyd, R.W.1
-
9
-
-
49849109565
-
A class of probability distributions on the integers
-
S. W. Golomb, “A class of probability distributions on the integers,” J. Number Theory, vol. 2, pp. 189–192, 1970.
-
(1970)
J. Number Theory
, vol.2
, pp. 189-192
-
-
Golomb, S.W.1
-
13
-
-
0004290881
-
-
Cambridge, Mass.: M.I.T. Press, esp.
-
M. Minsky and S. Papert, Perceptrons. Cambridge, Mass.: M.I.T. Press, 1969, esp. pp. 215–226.
-
(1969)
Perceptrons
, pp. 215-226
-
-
Minsky, M.1
Papert, S.2
-
15
-
-
84939068736
-
Bounds on information retrieval efficiency in static file structures
-
Cambridge, Mass., MAC TR-88, Project MAC
-
T. Welch, “Bounds on information retrieval efficiency in static file structures,” M.I.T., Cambridge, Mass., MAC TR-88, Project MAC, 1971.
-
(1971)
M.I.T.
-
-
Welch, T.1
-
16
-
-
0000375002
-
An upper bound on the entropy series
-
A. D. Wyner, “An upper bound on the entropy series,” Inform. Contr., vol. 20, pp. 176–181, 1972.
-
(1972)
Inform. Contr.
, vol.20
, pp. 176-181
-
-
Wyner, A.D.1
|