scientific article; zbMATH DE number 140483

MaRDI QIDQ4028902zbMATH OpenFDO

Authors Murray Sherk

Publication date 28 March 1993

zbMATH Keywords

\(k\)-splayingDICTIONARYheuristicself-adjusting \(k\)-ary search treestatic optimality proof

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Self-Adjusting k-ary Search Trees
• Self-adjusting binary search trees
• Self-adjusting multi-way search trees
• Path balance heuristic for self-adjusting binary search trees
• Self-adjusting binary search trees: what makes them tick?

Cited in

(15)

• Self-adjusting multi-way search trees
• Key-independent optimality
• Self-adjusting trees in preactice for large text collections
• Path balance heuristic for self-adjusting binary search trees
• Should static search trees ever be unbalanced?
• Self-adjusting binary search trees: what makes them tick?
• Self-adjusting binary search trees
• Unsuccessful Search in Self-Adjusting Data Structures
• scientific article; zbMATH DE number 1953882 (Why is no real title available?)
• Regularity of global attractor for the reaction-diffusion equation
• Self-Adjusting k-ary Search Trees
• Belga B-trees
• Belga B-trees
• Permanence and almost periodic solutions of a discrete ratio-dependent Leslie system with time delays and feedback controls
• On k-dimensional balanced binary trees.

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028902)