1. Trie memory
2. The Art of Computer Programming, vol. I, Fundamental Algorithms, pp. 295–304; vol. III, Sorting and Searching, pp. 481–505, Addison-Wesley, Reading, Mass., 1973.
3. A Method for Improving String Pattern Matching Machines
4. Implementing dynamic minimal-prefix tries
5. and , ‘An efficient implementation of static string pattern matching machines’, Proc. First Int. Conf. on Supercomputing, December 1985, pp. 491–498.