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

DOI10.1007/BF02276755MaRDI QIDQ1232178zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3311772 (Why is no real title available?)
• scientific article; zbMATH DE number 3088173 (Why is no real title available?)
• On the paging-complexity of periodic arrangements

Cited in

(1)

• On the paging-complexity of periodic arrangements

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

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