Analyzing self-adjusting linear list algorithms with deletions and unsuccessful searches

DOI10.1016/0020-0190(96)00064-6MaRDI QIDQ1349960zbMATH OpenOpenAlexFDO

Authors L. C. K. Hui, Chip Martel

Publication date 27 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(96)00064-6

zbMATH Keywords

Analysis of algorithmCompetitive analysisData structuresSelf-adjusting lists

Mathematics Subject Classification ID

Data structures (68P05) Parallel algorithms in computer science (68W10)

Recommendations

• Unsuccessful Search in Self-Adjusting Data Structures
• On linear search heuristics
• Static optimality and dynamic search-optimality in lists and trees
• scientific article; zbMATH DE number 742968
• Self-adjusting binary search trees

Cites work

• Unsuccessful Search in Self-Adjusting Data Structures

Cited in

(1)

• Analysis and experimentation on list update algorithms

This page was built for publication: Analyzing self-adjusting linear list algorithms with deletions and unsuccessful searches

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