A generalized counter scheme

DOI10.1016/0304-3975(81)90098-0MaRDI QIDQ1156492zbMATH OpenOpenAlexFDO

Authors S. H. Smith

Publication date 1981

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(81)90098-0

zbMATH Keywords

performance of accessing records in a linked listre-arrangementtransposition heuristic

Mathematics Subject Classification ID

Theory of software (68N99) Discrete mathematics in relation to computer science (68R99)

Cites work

• An Account of Self-Organizing Systems
• An extension of a theorem concerning an interesting Markov chain
• Heuristics That Dynamically Organize Data Structures
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3059214 (Why is no real title available?)
• On a model for storage and search
• On self-organizing sequential search heuristics
• On Serial Files with Relocatable Records
• The stationary distribution of an interesting Markov chain

Cited in

(1)

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

This page was built for publication: A generalized counter scheme

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