A theorem on linear diophantine equations and the paging-complexity of loop-chains

DOI10.1007/BF02276755zbMath0342.68015OpenAlexW363630082MaRDI QIDQ1232178

H.-G. Stork

Publication date: 1976

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02276755

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Linear Diophantine equations (11D04) General topics in the theory of software (68N01)

Related Items (1)

On the paging-complexity of periodic arrangements

Cites Work

• On the paging-complexity of periodic arrangements
• Unnamed Item
• Unnamed Item

This page was built for publication: A theorem on linear diophantine equations and the paging-complexity of loop-chains