R. Casas, J. D'iaz, and M. Verges. On counting BECs. Annals of Discrete Mathematics, 25:109--124, 1985. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Statistics on Random Trees - Casas, Díaz, Martinez (1991) (2 citations) Self-citation (Casas) (Correct)
....For instance, Theorem 4.4. The average cost of running the simplification algorithm for an idempotent law on binary trees of size n is asymptotically linear as n tends to infinity. Many other statistics have been done on trees using this techniques. The tree compaction problem was studied in [CDV85, CDSV83] where it was introduced a nice generation of compacted trees. The analytical value was finally obtained in [FSS90] where they prove that the expected size of the maximally compacted representation of a random tree of size n is asymptotically c n p log n (1 O(1= log n) In the ....
R. Casas, J. D'iaz, and M. Verges. On counting BECs. Annals of Discrete Mathematics, 25:109--124, 1985.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC