scientific article; zbMATH DE number 1540682
From MaRDI portal
Publication:4519900
zbMath0985.68015MaRDI QIDQ4519900
Publication date: 5 December 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Searching and sorting (68P10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Probability theory and stochastic processes (60-XX)
Related Items (29)
Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform ⋮ Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme ⋮ Replacement sort revisited: The ``gold standard unearthed! ⋮ How robust are average complexity measures? A statistical case study ⋮ Software complexity: a statistical case study through insertion sort ⋮ The middle pivot element algorithm ⋮ Running time of the treapsort algorithm ⋮ On the variety of shapes in digital trees ⋮ Analysis of multiple quickselect variants. ⋮ DEGREE PROFILE OF m-ARY SEARCH TREES: A VEHICLE FOR DATA STRUCTURE COMPRESSION ⋮ A general limit theorem for recursive algorithms and combinatorial structures ⋮ Random binary trees: from the average case analysis to the asymptotics of distributions ⋮ On edge-weighted recursive trees and inversions in random permutations ⋮ Approximating the distribution function of risk ⋮ Analysis of swaps in radix selection ⋮ Distributional analysis of swaps in quick select ⋮ Singularity analysis, Hadamard products, and tree recurrences ⋮ D?E?K=(1000)8 ⋮ On a multivariate contraction method for random recursive structures with applications to Quicksort ⋮ Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees ⋮ The oscillatory distribution of distances in random tries ⋮ Mixed Poisson approximation of node depth distributions in random binary search trees ⋮ Asymptotic distribution of two-protected nodes in random binary search trees ⋮ Distribution of the size of random hash trees, pebbled hash trees and \(N\)-trees ⋮ Rapid Multipole Graph Drawing on the GPU ⋮ QuickXsort: a fast sorting scheme in theory and practice ⋮ Limit laws for the Randić index of random binary tree models ⋮ Imbalance in random digital trees ⋮ Asymptotic analysis of (3, 2, 1)-shell sort
This page was built for publication:
