The Complexity of Trie Index Construction
暂无分享,去创建一个
[1] Edward Fredkin,et al. Trie memory , 1960, Commun. ACM.
[2] S. B. Yao. Tree structures construction using key densities , 1975, ACM '75.
[3] P. A. D. deMaine,et al. Storage optimization of tree structured files representing descriptor sets , 1971, SIGFIDET '71.
[4] Ronald L. Rivest,et al. Constructing Optimal Binary Decision Trees is NP-Complete , 1976, Inf. Process. Lett..
[5] Dennis G. Severance,et al. Identifier Search Mechanisms: A Survey and Generalized Model , 1974, CSUR.
[6] V. Rajaraman,et al. A Distributed Index Sequential Access Method , 1976, Inf. Process. Lett..
[7] Journal of the Association for Computing Machinery , 1961, Nature.
[8] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[9] Donald E. Knuth,et al. The art of computer programming: V.1.: Fundamental algorithms , 1997 .
[10] Jürg Nievergelt,et al. Binary Search Trees and File Organization , 1974, CSUR.
[11] Mario Schkolnick,et al. Secondary index optimization , 1975, SIGMOD '75.
[12] Rene De La Briandais. File searching using variable length keys , 1959, IRE-AIEE-ACM Computer Conference.
[13] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .