BOUNDS ON COSTS OF DATA ENCODINGS

被引:32
作者
ROSENBERG, AL
SNYDER, L
机构
来源
MATHEMATICAL SYSTEMS THEORY | 1978年 / 12卷 / 01期
关键词
D O I
10.1007/BF01776564
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:9 / 39
页数:31
相关论文
共 13 条
[1]  
[Anonymous], 1967, INEQUALITIES
[2]  
DEMILLO RA, C ACM, V21, P228
[3]  
Gotlieb C. C., 1974, Acta Informatica, V3, P297, DOI 10.1007/BF00263586
[4]   OPTIMAL ASSIGNMENTS OF NUMBERS TO VERTICES [J].
HARPER, LH .
JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1964, 12 (01) :131-135
[5]  
Harper LH, 1966, J COMBINATORIAL THEO, V1, P385, DOI [DOI 10.1016/S0021-9800(66)80059-5, 10.1016/S0021-9800(66)80059-5]
[6]  
IORDANSKII MA, 1976, PROBLEMY KIBERNET, V31, P109
[7]  
Knuth Donald E, 1968, ART COMPUTER PROGRAM, V1
[8]   SPACE AND TIME HIERARCHIES FOR CLASSES OF CONTROL STRUCTURES AND DATA-STRUCTURES [J].
LIPTON, RJ ;
EISENSTAT, SC ;
DEMILLO, RA .
JOURNAL OF THE ACM, 1976, 23 (04) :720-732
[9]   REPRESENTING GRAPHS BY KNUTH TREES [J].
PFALTZ, JL .
JOURNAL OF THE ACM, 1975, 22 (03) :361-366
[10]  
Rosenberg A. L., 1975, SIAM Journal on Computing, V4, P443, DOI 10.1137/0204038