1. A.V. Aho, J.E. Hopcroft and J.D. Ullman. The design and analysis of computer algorithms. Addison Wesley Pub. Comp. 1974.
2. L. Albert and F. Fages. Average case complexity analysis of the RETE pattern match algorithm. Proceedings of the 15 th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 317, Tampere, Finland, pages 18–37. Springer Verlag, July 1988.
3. L. Albert. Average case complexity analysis of RETE pattern match algorithm and average size of join in Databases. Proceedings of the 9 th conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science 405, Bangalore, India, pages 223–241. Springer Verlag, December 1989.
4. L. Albert. Quelques analyses de complexité en moyenne sur les algorithmes de multi-filtrage, d'unification et de requête multiple. PhD. Thesis N. 1379. Université Paris XI, 1990.
5. L. Albert, R. Casas, J. Diaz and A. Torrecillas. On unification over unrestricted pairs of trees. Submitted to Mathematical Foundations of Computer Science '90, Bratislava, Czechoslovakia, August 1990. Report de Recerca LSI-89-26, universitat politecnica de catalunya, 1989. In Alcom workshop on probabilistic algorithms and average case analysis, Computer Technology Institute, Patras, Greece, March 4–7 1990.