An efficient implementation of trie structures
暂无分享,去创建一个
[1] John A. Dundas,et al. Implementing dynamic minimal‐prefix tries , 1991, Softw. Pract. Exp..
[2] Jun-Ichi Aoe,et al. A practical method for compressing sparse matrices with variant entries , 1990, Int. J. Comput. Math..
[3] Robert E. Tarjan,et al. Storing a sparse table , 1979, CACM.
[4] Edward Fredkin,et al. Trie memory , 1960, Commun. ACM.
[5] Junich Aoe,et al. A practical method for reducing sparse matrices with invariant entries , 1982 .
[6] Kurt Maly. Compressed tries , 1976, CACM.
[7] Jun-Ichi Aoe. An Efficient Implementation of Static String Pattern Matching Machines , 1989, IEEE Trans. Software Eng..
[8] Jun-ichi Aoe,et al. A Method for Improving String Pattern Matching Machines , 1984, IEEE Transactions on Software Engineering.
[9] Donald E. Knuth,et al. The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .
[10] James L. Peterson,et al. Computer programs for spelling correction , 1980 .
[11] Donald E. Knuth,et al. The art of computer programming: V.1.: Fundamental algorithms , 1997 .