Of the following, (2) and (3) contain the most important parts of the algorithms.
- S. Eker. Associative matching for linear terms. Technical Report CS-R9224, Center for Mathematics and Computer Science, Amsterdam, July 1992.
- S. M. Eker, Associative-commutative matching via bipartite graph matching, The Computer Journal, Volume 38, Issue 5, 1995, Pages 381–399, https://doi.org/10.1093/comjnl/38.5.381
- S. Eker, Fast matching in combinations of regular equational theories, Electronic Notes in Theoretical Computer Science, 1996, vol. 4, p. 90-109, ISSN 1571-0661, https://doi.org/10.1016/S1571-0661(04)00035-0.
- Eker, S. Single Elementary Associative-Commutative Matching. Journal of Automated Reasoning 28, 35–51 (2002). https://doi.org/10.1023/A:1020122610698
- Eker, S.: Fast sort computations for order-sorted matching and unification. In: Formal Modeling: Actors, Open Systems, Biological Systems - Essays Dedicated to Carolyn Talcott on the Occasion of Her 70th Birthday. vol. 7000, pp. 299–314. Springer LNCS (2011). https://doi.org/10.1007/978-3-642-24933-4_15
- Durán, F., Eker, S., Escobar, S., Martí-Oliet, N., Meseguer, J., Talcott, C.L.: Associative unification and symbolic reasoning modulo associativity in maude. In: Rewriting Logic and Its Applications - 12th International Workshop, WRLA 2018, Held as a Satellite Event of ETAPS, Thessaloniki, Greece, June 14-15, 2018, Proceedings. Lecture Notes in Computer Science, vol. 11152, pp. 98–114. Springer (2018). https://doi.org/10.1007/978-3-319-99840-4_6
- Bouhoula, A., Jouannaud, J.-P., & Meseguer, J. (1997). Specification and proof in membership equational logic. Lecture Notes in Computer Science, 67–92. doi:10.1007/bfb0030589
- Clavel, M., Eker, S., Lincoln, P., & Meseguer, J. (1996). Principles of Maude. Electronic Notes in Theoretical Computer Science, 4, 65-89. doi: 10.1016/S1571-0661(04)00034-9