Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. G. M. Adel’son-Vel’skii and E. M. Landis. An algorithm for the organization of information. Soviet Mathematics Doklady, 3:1259–1263, 1962.
2. R. Bayer. Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Informatica, 1:290–306, 1972.
3. Dan Benanav, Deepak Kapur, and Paliath Narendran. Complexity of matching problems. Journal of Symbolic Computation, 3(1–2):203–216, February 1987.
4. Peter Borovanský, Claude Kirchner, Helèné Kirchner, and Pierre-Etienne Moreau. ELAN from a rewriting logic point of view. Journal of Theoretical Computer Science, 285(2):155–185, August 2002.
5. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and J.F. Quesada. Maude: specification and programming in rewriting logic. Journal of Theoretical Computer Science, 285(2):187–243, August 2002.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献