scientific article

zbMath0755.68063MaRDI QIDQ4016521

Gaston H. Gonnet, Ricardo A. Baeza-Yates

Publication date: 16 January 1993

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

zbMATH Keywords

search treesdigital treesaverage casematrix recurrences

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items

Sublinear approximate string matching and biological applications ⋮ Bottom-up mergesort -- A detailed analysis ⋮ An improved version of cuckoo hashing: average case analysis of construction cost and search operations ⋮ An object-oriented environment for developing finite element codes for multi-disciplinary applications ⋮ Weighted height of random trees ⋮ Faster suffix sorting ⋮ Improved bounds for the expected behaviour of AVL trees ⋮ Page usage in a quadtree index ⋮ Analytic variations on quadtrees ⋮ A note on the height of the \(k\)th element in a heap ⋮ The analysis of heuristics for search trees ⋮ On the expected height of fringe-blanced trees