scientific article; zbMATH DE number 1545682

DOI<link itemprop=identifier href="https://doi.org/10.1002/1098-2418(200010/12)17:3/4<403::AID-RSA11>3.0.CO;2-K" /><403::AID-RSA11>3.0.CO;2-K 10.1002/1098-2418(200010/12)17:3/4<403::AID-RSA11>3.0.CO;2-KzbMath0967.68055MaRDI QIDQ4521555

Ralph Neininger

Publication date: 3 September 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

\(K\)-\(d\) trees\(K\)-\(d\)-\(t\) tree

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15) Nonnumerical algorithms (68W05)

Related Items (5)

Limit laws for partial match queries in quadtrees ⋮ A limit process for partial match queries in random quadtrees and 2-d trees ⋮ D?E?K=(1000)8 ⋮ On a multivariate contraction method for random recursive structures with applications to Quicksort ⋮ Partial match queries in random quadtrees

Cites Work

• Unnamed Item
• Some asymptotic theory for the bootstrap
• A fixed point theorem for distributions
• Some properties of a limiting distribution in Quicksort
• A note on the height of binary search trees
• Multidimensional binary search trees used for associative searching
• On the internal path length ofd-dimensional quad trees
• Total Path Length for Random Recursive Trees
• A limit theorem for “quicksort”

This page was built for publication: