A generalized counter scheme

DOI10.1016/0304-3975(81)90098-0zbMATH Open0468.68076OpenAlexW2008276409MaRDI QIDQ1156492FDOQ1156492

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

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

Cites Work

• Title not available (Why is that?)
• On self-organizing sequential search heuristics
• Title not available (Why is that?)
• On a model for storage and search
• On Serial Files with Relocatable Records
• The stationary distribution of an interesting Markov chain
• Heuristics That Dynamically Organize Data Structures
• An extension of a theorem concerning an interesting Markov chain
• An Account of Self-Organizing Systems

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)