scientific article; zbMATH DE number 140483

zbMATH Open0766.68018MaRDI QIDQ4028902FDOQ4028902

Authors: Murray Sherk 

Publication date: 28 March 1993

Title of this publication is not available (Why is that?)

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?

zbMATH Keywords

heuristic\(k\)-splayingDICTIONARYself-adjusting \(k\)-ary search treestatic optimality proof

Mathematics Subject Classification ID

Data structures (68P05)

Cited In (15)

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

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)