Conrado Martínez, Helmut Prodinger  Home/Search
Context Related
| lsi.upc.es/dept/techreps/...R971.ps.gz lsi.upc.es/~conrado/...LSI971R.ps.gz lsi.upc.es/dept/techreps/...R971.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/links/a...reports1997 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider here the probabilistic analysis of the number of descendants and the number of ascendants of a given internal node in a random search tree. The performance of several important algorithms on search trees is closely related to these quantities. For instance, the cost of a successful search is proportional to the number of ascendants of the sought element. On the other hand, the probabilistic behavior of the number of descendants is relevant for the analysis of paged data structures... (Update)
Similar documents based on text: More All
0.9: On the Number of Descendants and Ascendants in Random Search.. - -->, Panholzer (1998) (Correct)
0.7: Descendants and Ascendants in Binary Trees - Panholzer, Prodinger (1997) (Correct)
0.5: Optimal Sampling Strategies in Quicksort and Quickselect - Martínez, Roura (1998) (Correct)
BibTeX entry: (Update)
Mart'inez (Conrado), Panholzer (Alois), and Prodinger (Helmut). -- On the number of descendants and ascendants in random search trees. Electronic Journal of Combinatorics, vol. 5, n 1, 1998, pp. Research Paper 20, 36 pp. (electronic). http://citeseer.ist.psu.edu/conrado97number.html More
@misc{ conrado98number,
author = "M. Conrado and P. Alois and P. Helmut and - On",
title = "the number of descendants and ascendants in random search trees",
text = "Mart'inez (Conrado), Panholzer (Alois), and Prodinger (Helmut). -- On the
number of descendants and ascendants in random search trees. Electronic
Journal of Combinatorics, vol. 5, n 1, 1998, pp. Research Paper 20, 36 pp.
(electronic).",
year = "1998",
url = "citeseer.ist.psu.edu/conrado97number.html" }
Citations (may not include all citations):442 Concrete Mathematics (context) - Graham, Knuth et al. - 1989
157 The Art of Computer Programming: Sorting and Searching (context) - Knuth - 1973
151 Singularity analysis of generating functions (context) - Flajolet, Odlyzko - 1990
130 Evolution of Random Search Trees (context) - Mahmoud - 1992
124 A dichromatic framework for balanced trees (context) - Guibas, Sedgewick - 1978
108 An Introduction to the Analysis of Algorithms (context) - Sedgewick, Flajolet - 1996
70 Average-case analysis of algorithms and data structures - Vitter, Flajolet - 1990
63 An algorithm for the organization of information (context) - Adel'son-Vel'skii, Landis - 1962
60 Gfun: a Maple package for the manipulation of generating and.. - Salvy, Zimmermann - 1994
55 Randomized search trees (context) - Aragon, Seidel - 1989
43 Handbook of Algorithms and Data Structures - In Pascal and C (context) - Gonnet, Baeza-Yates - 1991
36 emes limites pour les structures combinatoires et les foncti.. (context) - Hwang - 1994
23 Exact and asymptotic distributions in digital and binary sea.. (context) - Louchard - 1987
18 General combinatorial schemas: Gaussian limit distributions .. - Flajolet, Soria - 1993
14 Analysis of Hoare's FIND algorithm with median-of-three part.. - Kirschenhofer, Mart'inez et al. - 1995
13 The analysis of a fringe heuristic for binary search trees (context) - Poblete, Munro - 1985
12 New York (context) - Sedgewick, Garland - 1978
10 Page usage in a quadtree index - Hoshi, Flajolet - 1992
9 Comparisons in Hoare's Find algorithm (context) - Kirschenhofer, Prodinger - 1996
7 The analysis of heuristics for search trees (context) - Poblete - 1993
7 Randomization of search trees by subtree size (context) - Roura, Mart'inez - 1996
5 Probabilistic analysis of some searching and sorting algorit.. (context) - Lent - 1996
5 Locally balanced binary trees (context) - Walker, Wood - 1976
5 Mathematics of Operations Research (context) - Brown, Shubert et al. - 1984
4 More combinatorial properties of certain trees (context) - Lynch - 1965
4 Randomized binary search technique (context) - Arora, Dent - 1969
3 An Investigation into the Principles of the Classification a.. (context) - Bell - 1965
1 osungsmethoden und L¨osungen (context) - Kamke - 1977
Documents on the same site (http://www-lsi.upc.es/links/alcom-it/reports-1997.html): More
Parallel Dictionaries with Local Rules on AVL and Brother Trees - Gabarró, Messeguer (1998) (Correct)
Randomized Binary Search Trees - Martínez, Roura (1997) (Correct)
A Dichotomy Theorem for Learning Quantified Boolean Formulas - Dalmau (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