Bounds on the costs of data encodings
暂无分享,去创建一个
[1] Calvin C. Gotlieb,et al. Choosing a storage schema , 2004, Acta Informatica.
[2] L. H. Harper. Optimal Assignments of Numbers to Vertices , 1964 .
[3] Richard J. Lipton,et al. Preserving average proximity in arrays , 1978, CACM.
[4] Donald E. Knuth,et al. The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .
[5] Richard J. Lipton,et al. Space and Time Hierarchies for Classes of Control Structures and Data Structures , 1976, JACM.
[6] L. H. Harper. Optimal numberings and isoperimetric problems on graphs , 1966 .
[7] John L. Pfaltz. Representing Graphs by Knuth Trees , 1975, JACM.
[8] Arnold L. Rosenberg,et al. Preserving Proximity in Arrays , 1975, SIAM J. Comput..
[9] Arnold L. Rosenberg,et al. Encoding Data Structures in Trees , 1979, JACM.
[10] Arnold L. Rosenberg. Data encodings and their costs , 2004, Acta Informatica.