A generalized counter scheme

DOI10.1016/0304-3975(81)90098-0zbMath0468.68076OpenAlexW2008276409MaRDI QIDQ1156492

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

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• On self-organizing sequential search heuristics
• An Account of Self-Organizing Systems
• Heuristics That Dynamically Organize Data Structures
• On a model for storage and search
• An extension of a theorem concerning an interesting Markov chain
• On Serial Files with Relocatable Records
• The stationary distribution of an interesting Markov chain

This page was built for publication: A generalized counter scheme