Average-case analysis of equality of binary trees under the BST probability model-Reference-Cited by-同舟云学术

Average-case analysis of equality of binary trees under the BST probability model

Published:1991 Issue: Volume: Page:350-359
ISSN:0302-9743
Container-title:Fundamentals of Computation Theory
language:
Short-container-title:

Author:

Martínez C.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-54458-5_79.pdf

Reference12 articles.

1. M. Abramowitz and I.A. Stegun. Handbook of Mathematical Functions. Dover Publications, New York, 1964.

2. 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.

3. R. Casas, J. Díaz, and J.M. Steyaert. Average-case analysis of Robinson's unification algorithm with two different variables. Information Processing Letters, 31:227–232, June 1989.

4. R. Casas, M.I. Fernández, and J.M. Steyaert. Algebraic simplification in computer algebra: an analysis of bottom-up algorithms. Theoretical Computer Science, 74:273–298, 1990.

5. R. Courant and D. Hilbert. Methods of Mathematical Physics, volume 2. InterScience J. Wiley, 1962.

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

1. Psi-series method for equality of random trees and quadratic convolution recurrences;Random Structures & Algorithms;2012-05-11

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

3. Statistics on random trees;Automata, Languages and Programming;1991