M. Dauchet, T. Heuillard, P. Lescanne, and S. Tison, Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems, Information and Computation, vol.88, issue.2, pp.187-201, 1990.
DOI : 10.1016/0890-5401(90)90015-A

M. Oyamaguchi, The Church-Rosser property for ground term-rewriting systems is decidable, Theoretical Computer Science, vol.49, issue.1, pp.43-79, 1987.
DOI : 10.1016/0304-3975(87)90100-9

A. Hayrapetyan and R. Verma, On the complexity of confluence for ground rewrite systems, Bar-Ilan International Symposium on the Foundations of Artificial Intelligence, 2002.

H. Comon, G. Godoy, and R. Nieuwenhuis, The confluence of ground term rewrite systems is decidable in polynomial time, Proceedings 2001 IEEE International Conference on Cluster Computing, 2001.
DOI : 10.1109/SFCS.2001.959904

A. Tiwari, Deciding confluence of certain term rewriting systems in polynomial time, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, pp.447-456, 2002.
DOI : 10.1109/LICS.2002.1029852

G. Godoy, A. Tiwari, and R. Verma, On the Confluence of Linear Shallow Term Rewrite Systems, 20th Intl. Symposium on Theoretical Aspects of Computer Science, 2003.
DOI : 10.1007/3-540-36494-3_9

R. Verma, M. Rusinowitch, and D. Lugiez, Algorithms and reductions for rewriting problems, Proc. of Intl Conference on Rewriting Techniques and Applications, pp.257-276, 1998.
DOI : 10.1007/BFb0052369
URL : https://hal.archives-ouvertes.fr/inria-00073431

M. Oyamaguchi, The reachability and joinability problems for rightground term-rewriting systems, Journal of Information Processing, vol.13, issue.3, pp.347-354, 1990.