Statistics on random trees-Reference-Cited by-同舟云学术

Statistics on random trees

Published:1991 Issue: Volume: Page:186-203
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Casas R.,Díaz J.,Martinez C.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-54233-7_134.pdf

Reference53 articles.

1. L. Albert, R. Casas, J. Díaz, and A. Torrecillas. On unification over unrestricted pairs of trees. Technical Report LSI-89-26, LSI-UPC, Jan 1989.

2. [ACF+91] L. Albert, R. Casas, F. Fages, A. Torrecillas, and P. Zimmermann. Average case analysis of unification algorithms. In C. Choffrut and M. Jantzen, editors, Proceedings STACS-91, pages 196–213. Lecture Notes in Computer Science, Springer-Verlag, 1991.

3. R. Baeza, R. Casas, J. Díaz, and C. Martínez. On the average size of the intersection of binary trees. SIAM Journal on Computing, 1991. To appear. Also available as Tech. Rep. LSI-89-23,LSI-UPC, Nov 1989.

4. J.L. Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9):509–517, 1975.

5. R. Casas, J. Díaz, and C. Martínez, Average-case analysis on simple families of trees using a balanced probability model. In Formal Power Series and Algebraic Combinatorics, pages 101–112. Lecture Notes in Computer Science, Springer-Verlag, 1991.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Average-case analysis of pattern-matching in trees under the BST probability model;Automata, Languages and Programming;1994

2. Analytic analysis of algorithms;Automata, Languages and Programming;1992