An asymptotic theory for Cauchy–Euler differential equations with applications to the analysis of algorithms

DOI10.1016/S0196-6774(02)00208-0zbMath1030.68114OpenAlexW2115337421MaRDI QIDQ4799527

Tsung-Hsi Tsai, Hsien-Kuei Hwang, Hua-Huai Chern

Publication date: 23 March 2003

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0196-6774(02)00208-0

zbMATH Keywords

sortinganalysis of algorithmssearchingmethod of momentsbinary search treesquicksortCauchy-Euler differential equationsphase changesconvergence in distributionsasymptotic transfers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Searching and sorting (68P10)

Related Items (16)

Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme ⋮ Distances in random digital search trees ⋮ Revisiting calculation of moments of number of comparisons used by the randomized quick sort algorithm ⋮ Shape Measures of Random Increasing k-trees ⋮ A general limit theorem for recursive algorithms and combinatorial structures ⋮ On the Variety of Shapes on the Fringe of a Random Recursive Tree ⋮ A functional limit theorem for the profile of search trees ⋮ Singularity analysis, Hadamard products, and tree recurrences ⋮ Unnamed Item ⋮ An asymptotic distribution theory for Eulerian recurrences with applications ⋮ Width and mode of the profile for some random trees of logarithmic height ⋮ Asymptotic normality of the number of corners in tableaux associated with the partially asymmetric simple exclusion process ⋮ Limit laws for the Randić index of random binary tree models ⋮ Limit distribution of distances in biased random tries ⋮ A note on the quicksort asymptotics ⋮ Limit distribution of the coefficients of polynomials with only unit roots

Uses Software

• SPOOLES

This page was built for publication: An asymptotic theory for Cauchy–Euler differential equations with applications to the analysis of algorithms