An asymptotic theory for Cauchy–Euler differential equations with applications to the analysis of algorithms
References (117)
Some average measures in m-ary search trees
Inform. Process. Lett.
(1987)Height balance distribution of search trees
Inform. Process. Lett.
(1991)- et al.
The asymptotic distributions of the remedians
J. Statist. Plann. Inference
(1993) On the use of the method of moments for the study of additive functions
J. Number Theory
(1991)- et al.
The average height of binary trees and other simple trees
J. Comput. System Sci.
(1982) - et al.
A multivariate view of random bucket digital search trees
J. Algorithms
(2002) - et al.
3 is a more promising algorithmic parameter than 2
Comput. Math. Appl.
(1998) Sorting tree, nestling tree and inverse permutation
Inform. Process. Lett.
(1977)On rotations in fringe-balanced binary trees
Inform. Process. Lett.
(1998)- et al.
Analysis of the space of search trees under the random insertion algorithm
J. Algorithms
(1989)
Probabilistic analysis of bucket recursive trees
Theoret. Comput. Sci.
(1995)
Large deviations for quicksort
J. Algorithms
(1996)
A space-efficient on-line method of computing quantile estimates
J. Algorithms
(1981)
The analysis of a fringe heuristic for binary search trees
J. Algorithms
(1985)
A hybrid of quicksort with O(nlogn) worst case complexity
Inform. Process. Lett.
(1982)
Engineering quicksort
Comput. Lang.
(1996)
The Life and Times of the Central Limit Theorem
(1974)
Leapfrogging samplesort
General balanced trees
J. Algorithms
(1999)
SPOOLES: an object-oriented sparse matrix library
Improving quicksort performance with a codeword data structure
IEEE Trans. Software Engrg.
(1989)
An efficient algorithm for the approximate median selection problem
Advanced Mathematical Methods for Scientists and Engineers
(1999)
Engineering a sort function
Software–Pract. Exper.
(1993)
Fast algorithms for sorting and searching strings
Varieties of increasing trees
Probability and Measure
(1995)
Analysis of a tree sorting method and some properties of a set of trees
Transitional behaviors of the average cost of quicksort with median-of-(2t+1)
Algorithmica
(2001)
Phase changes in random m-ary search trees and generalized quicksort
Random Structures Algorithms
(2001)
Distribution of the number of consecutive records
Random Structures Algorithms
(2000)
Advanced Combinatorics. The Art of Finite and Infinite Expansions, revised and enlarged edition
(1974)
Best sorting algorithms for nearly sorted lists
Comm. ACM
(1980)
Introduction to Algorithms
(1990)
The ninther and its relatives: summary measures useful in geomorphology
Z. Geomorph.
(1992)
Improving time and space efficiency in generalized binary search trees
Acta Inform.
(1987)
Moment inequalities for random variables in computational geometry
Computing
(1983)
Universal limit laws for depths in random trees
SIAM J. Comput.
(1999)
Limit laws for sums of functions of subtrees of random binary search trees
SIAM J. Comput.
(2002)
Perfect simulation from the quicksort limit distribution
Electron. Comm. Probab.
(2000)
Application of the method of moments in probability and statistics
Supercritical CO2 extraction for total fat analysis of food products
J. Food Sci.
(1999)
Exploiting partial order with quicksort
Software—Pract. Exp.
(1984)
Phase Transitions in Combinatorial Problems
Theoret. Comput. Sci.
(2001)
Quicksort without a stack
On the distribution of binary search trees under the random permutation model
Random Structures Algorithms
(1996)
Cited by (0)
- 1
Partially supported by National Science Council of ROC under the Grant NSC-90-2115-M-133-001.
- 2
Partially supported by National Science Council of ROC under the Grants NSC-90-2118-M-001-034 and NSC-90-2118-M-001-028.
Copyright © 2002 Elsevier Science (USA). All rights reserved.