On the optimality of the counter-scheme for dynamic linear lists

DOI10.1016/0020-0190(91)90040-OzbMATH Open0714.68040OpenAlexW2087748288WikidataQ126557540 ScholiaQ126557540MaRDI QIDQ751280FDOQ751280

Authors: Micha Hofri, Hadas Shachnai 

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90040-o

Recommendations

• The list update problem: Improved bounds for the counter scheme
• Self-organizing lists and independent references: A statistical synergy
• An optimal absorbing list organization strategy with constant memory requirements
• On the limited utility of auxiliary information in the list update problem
• On List Update with Locality of Reference

zbMATH Keywords

analysis of algorithmsoptimal policyindependent reference modellistsreorganizations

Mathematics Subject Classification ID

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

Cites Work

• On self-organizing sequential search heuristics
• A generalized counter scheme
• Reordering heuristics for routing in communications networks
• Self-organizing lists and independent references: A statistical synergy

Cited In (8)

• A new family of randomized algorithms for list accessing
• Adaptive linear list reorganization under a generalized query system
• Towards a nonlinear Schwarz's list
• Lattice-based accumulator with constant time list update and constant time verification
• On the distribution of the search cost for the move-to-front rule with random weights
• Purely Functional Worst Case Constant Time Catenable Sorted Lists
• The Application of Restricted Counter Schemes to Three Models of Linear Search
• A representation for linear lists with movable fingers

This page was built for publication: On the optimality of the counter-scheme for dynamic linear lists

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