Author:
Andersson Arne,Nilsson Stefan
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. A. Amir, G. Benson, and M. Farach. Efficient pattern matching with scaling. Journal of Algorithms, 13(1), 1992.
2. A. Amir, G. Benson, and M. Farach. Let sleeping files lie: pattern matching in z-compressed files. In Proc. of 5th Symposium on Discrete Algorithms, 1994.
3. A. Andersson and S. Nilsson. Improved behaviour of tries by adaptive branching. Information Processing Letters, 46:295–300, 1993.
4. A. Andersson and S. Nilsson. Efficient implementation of suffix trees. Technical Report, Dept. of Computer Science, Lund University, 1994.
5. L. Devroye. A note on the average depth of tries. Computing, 28:367–371, 1982.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Inverted Treaps;ACM Transactions on Information Systems;2017-06-09
2. Compressing IP Forwarding Tables: Realizing Information-Theoretical Space Bounds and Fast Lookups Simultaneously;2014 IEEE 22nd International Conference on Network Protocols;2014-10
3. Advanced Data Structures;2008
4. Multibit Tries;Packet Forwarding Technologies;2007-12-17
5. On the average depth of asymmetric LC-tries;Information Processing Letters;2005-11