Author:
Belazzougui Djamal,Pierrot Adeline,Raffinot Mathieu,Vialette Stéphane
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. AdelsonVelskii, M., Landis, E.M.: An algorithm for the organization of information. Defense Technical Information Center (1963)
2. Ahal, S., Rabinovich, Y.: On Complexity of the Subpattern Problem. SJDM 22(2), 629–649 (2008)
3. Aho, A.V., Corasick, M.J.: Efficient string matching: An aid to bibliographic search. Commun. ACM 18(6), 333–340 (1975)
4. Andersson, A., Thorup, M.: Dynamic ordered sets with exponential search trees. J. ACM 54(3), 13 (2007)
5. Bayer, R.: Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Informatica 1(4), 290–306 (1972)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献