Author:
Amir Amihood,Lewenstein Moshe,Lewenstein Noa
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. K. Abrahamson. Generalized String Matching. SIAM J. Computing 16 (6), 1039–1051, 1987.
2. T. Akutsu. A Linear Time Pattern Matching Algorithm Between a String and a Tree. Proceedings of the 4th Symposium on Combinatorial Pattern Matching, 1–10, Padova, Italy, 1993.
3. A. Amir, M. Farach, R. Giancarlo, Z. Galil, and K. Park. Dynamic dictionary matching. Journal of Computer and System Sciences, 49(2):208–222, 1994.
4. A. Amir, M. Farach, R.M. Idury, J.A. La Poutré, and A.A. Schiffer. Improved dynamic dictionary matching. Information and Computation, 119(2):258–282, 1995.
5. A. Aviad. Hyper-Talmud: a hypertext system for the Babylonian Talmud and its commentaries. Dept. of Math and Computer Science, Bar-Ilan University, 1993.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献