R. Casas, J. Díaz, C. Martinez  Home/Search
Context Related
| lsi.upc.es/~conrado/re...LSI919.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lsi.upc.es/~conrado/re...techreps (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we give a survey of the symbolic operator methods to do statistics on random trees. We present some examples and apply the techniques to find their asymptotic behaviour. 1 Introduction Let us consider a class E of combinatorial objects, let A be an algorithm defined over the class E, and let denote the complexity measure we are interested in. Such a class E of combinatorial objects consists on a set, usually denoted by the same name as the class, and a size measure j \Delta j ... (Update)
Context of citations to this paper: More
.... [76, 2] simplification [10] unification [1] common subexpression factorization [34] and term rewriting techniques [11] See also [9] for an interesting survey. Another important case of application is to the Cayley function y = ze y . This function shows up in the...
Cited by: More
Asymptotic Enumeration Methods - Odlyzko (1996) (Correct)
Analytic Analysis of Algorithms - Flajolet (1992) (Correct)
Active bibliography (related documents): More All
1.2: Average-case Analysis of Equality of Binary Trees Under the.. - Martínez (1994) (Correct)
1.0: Philippe Flajolet's Research In Analysis Of Algorithms.. - Prodinger, Szpankowski (1998) (Correct)
0.8: Average-case Analysis on Simple Families of Trees Using a.. - Casas, Díaz, Martínez (1991) (Correct)
Similar documents based on text: More All
0.1: Convergence properties of the inverse Column-Updating method - Lopes, Martinez (1995) (Correct)
0.1: Developing The Statistical Parameters For Simultaneous.. - Govindan Kannan Michael (Correct)
0.1: A New Method For Large-Scale Box Constrained Convex.. - Friedlander, Martinez (1995) (Correct)
Related documents from co-citation: More All
5: Central and local limit theorems applied to asymptotic enumeration (context) - Bender - 1973
4: A logical approach to asymptotic combinatorics (context) - Compton - 1987
3: The Art of Computer Programming Vol (context) - Knuth - 1968
BibTeX entry: (Update)
Casas, R., Diaz, J., and Martinez, C. Statistics on random trees. In Automata, Languages, and Programming (1991), J. Leach Albert et al., Ed., vol. 510 of Lecture Notes in Computer Science, pp. 186--203. Proceedings of the 18th ICALP Conference, Madrid, July 1991. http://citeseer.ist.psu.edu/257799.html More
@inproceedings{ casas91statistics,
author = "R. Casas and J. Diaz and C. Martinez",
title = "Statistics on Random Trees",
booktitle = "Automata, Languages, and Programming",
volume = "510",
editor = "J. {Leach~Albert et al.}",
pages = "186--203",
year = "1991",
url = "citeseer.ist.psu.edu/257799.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1989
1749 An Introduction to Probability Theory and its Applications (context) - Feller - 1968
634 A machine-oriented logic based on the resolution principle (context) - Robinson - 1965
442 Concrete Mathematics (context) - Graham, Knuth et al. - 1989
346 Multidimensional binary search trees used for associative se.. (context) - Bentley - 1975
306 Methods of Mathematical Physics (context) - Courant, Hilbert - 1962
172 Applied and Computational Complex Analysis (context) - Henrici - 1977
157 The Art of Computer Programming: Sorting and Searching (context) - Knuth - 1973
157 Advanced Combinatorics (context) - Comtet - 1974
154 Combinatorial Enumerations (context) - Goulden, Jackson - 1983
151 Singularity analysis of generating functions (context) - Flajolet, Odlyzko - 1990
98 Asymptotics and Special Functions (context) - Olver - 1974
85 Mathematics for the Analysis of Algorithms (context) - Greene, Knuth - 1982
70 Average-case analysis of algorithms and data structures - Vitter, Flajolet - 1990
66 The Art of Computer Programming: Fundamental Algorithms (context) - Knuth - 1968
61 Oxford University Press (context) - Titchmarsh, of - 1939
51 Ordinary Differential Equations (context) - Ince - 1956
42 A note on the height of binary search trees (context) - Devroye - 1986
35 The average height of binary trees and other simple trees (context) - Flajolet, Odlyzko - 1982
34 Data structures (context) - Mehlhorn, Tsakalidis - 1990
33 Asymptotic Methods in Analysis (context) - De Bruijn - 1981
26 Rinehart and Winston (context) - Purdom, Brown et al. - 1985
21 Oxford University Press (context) - Hardy - 1949
13 Asymptotic expansions for the coefficients of analytic funct.. (context) - Harris, Schoenfeld - 1968
13 Mathematical methods in the analysis of algorithms and data .. (context) - Flajolet - 1988
13 Patterns and pattern-matching in trees: An analysis (context) - Steyaert, Flajolet - 1983
13 A generalization of stirling's formula (context) - Hayman - 1956
13 of random m-ary search trees. Random structures and algorith.. (context) - Devroye, height - 1990
12 Complexity analysis of term-rewriting systems (context) - Choppy, Kaplan et al. - 1989
11 A complexity calculus for recursive tree algorithms (context) - Flajolet, Steyaert - 1987
10 Average case analysis of unification algorithms (context) - Albert, Casas et al. - 1991
10 Asymptotic expansions for the coefficients of analytic gener.. - Odlyzko, Richmond - 1985
9 Periodic oscillations of coefficients of power series that s.. (context) - Odlyzko - 1982
9 The Average Height of Planted Plane Trees (context) - De Bruijn, Knuth et al. - 1972
9 Analytic variations on the common subexpression problem - Flajolet, Sipala et al. - 1990
8 Analyse d'algorithmes de manipulation d'arbres et de fichier.. (context) - Flajolet - 1981
6 the average internal path length of m-ary search trees (context) - Mahmoud - 1986
5 the most probable shape of a search tree grown from a random.. (context) - Mahmoud, Pittel - 1984
5 Random tree models in the analysis of algorithms (context) - Flajolet - 1987
4 Partial Differential Equations (context) - Copson - 1975
4 Texts and Monographs in Computer Science (context) - Hofri, of - 1987
4 Average-case analysis of Robinson's unification algorithm wi.. (context) - Casas, D'iaz et al. - 1989
3 Lambda-upsilon-omega the 1989 cookbook - Flajolet, Salvy et al. - 1989
2 Bottom-up recursion in trees (context) - Casas, Steyaert - 1986
2 Algebraic simplification in computer algebra: an analysis of.. (context) - Casas, Fern'andez et al. - 1990
1 On unification over unrestricted pairs of trees (context) - Albert, Casas et al. - 1989
1 Some considerations on the ratio of compactification of bina.. (context) - Casas, D'iaz et al. - 1983
1 Average-case analysis on simple families of trees using a ba.. - Casas, D'iaz et al. - 1991
1 Annals of Discrete Mathematics (context) - Casas, D'iaz et al. - 1985
1 Partial match retrival of multidimensional data (context) - Flajolet, Puech - 1986
1 Average-case analysis of equality of binary trees under the .. (context) - Mart'inez - 1991
Documents on the same site (http://www.lsi.upc.es/~conrado/research/techreps.html): More
Average-case Analysis of Equality of Binary Trees Under the.. - Martínez (1994) (Correct)
A Top-Down Design of a Parallel Dictionary using Skip.. - Gabarro.. (1994) (Correct)
On the Number of Descendants and Ascendants in Random.. - Martínez.. (1997) (Correct)
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