On the paging-complexity of periodic arrangements

DOI10.1016/0304-3975(77)90035-4zbMath0357.68066OpenAlexW1988139629MaRDI QIDQ1239004

H.-G. Stork

Publication date: 1977

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

Full work available at URL: https://doi.org/10.1016/0304-3975(77)90035-4

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items (2)

A theorem on linear diophantine equations and the paging-complexity of loop-chains ⋮ FIFO-optimal placement on pages of independently referenced sectors

Cites Work

• A theorem on linear diophantine equations and the paging-complexity of loop-chains
• Organizing matrices and matrix operations for paged memory systems
• Principles of Optimal Page Replacement
• Unnamed Item
• Unnamed Item

This page was built for publication: On the paging-complexity of periodic arrangements