article · Theoretical Computer Science · 1993

Average-case analysis of unification algorithms

Luc Albert, Rafael Monroy Casas, François Fages

Cited by 11Abstract and details only

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

Albert, L., Casas, R. M., & Fages, F. (1993). Average-case analysis of unification algorithms. Theoretical Computer Science, 113(1), 3–34. https://doi.org/10.1016/0304-3975(93)90208-b

MLA 9

Albert, Luc, et al. “Average-case analysis of unification algorithms.” Theoretical Computer Science, vol. 113, no. 1, 1993, pp. 3–34, https://doi.org/10.1016/0304-3975(93)90208-b.

Chicago

Albert, Luc, Rafael Monroy Casas, and François Fages. 1993. “Average-case analysis of unification algorithms.” Theoretical Computer Science 113 (1): 3–34. https://doi.org/10.1016/0304-3975(93)90208-b.

Harvard

Albert, L., Casas, R.M. and Fages, F. (1993) ‘Average-case analysis of unification algorithms’, Theoretical Computer Science, 113(1), pp. 3–34. Available at: https://doi.org/10.1016/0304-3975(93)90208-b.

BibTeX

@article{albert1993average,
  title = {{Average-case analysis of unification algorithms}},
  author = {Albert, Luc and Casas, Rafael Monroy and Fages, François},
  journal = {Theoretical Computer Science},
  volume = {113},
  number = {1},
  pages = {3--34},
  year = {1993},
  doi = {10.1016/0304-3975(93)90208-b}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.