Author:
Niehren Joachim,Villaret Mateu
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, and Sven Thiel. An efficient algorithm for the configuration problem of dominance graphs. In 12th ACM-SIAM Symposium on Discrete Algorithms, pages 815–824, 2001.
2. R. Backofen, J. Rogers, and K. Vijay-Shanker. A first-order axiomatization of the theory of finite trees. Journal of Logic, Language, and Information, 4:5–39, 1995.
3. Lect Notes Comput Sci;M. Bodirsky,2001
4. Manuel Bodirsky, Katrin Erk, Alexander Koller, and Joachim Niehren. Underspecified beta reduction. In ACL’ 01, pages 74–81, 2001.
5. Hubert Comon. Completion of rewrite systems with membership constraints. Symbolic Computation, 25(4):397–453, 1998. Extends on a paper at ICALP’92.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献