Analysis of boolean program models for time-shared, paged environments

DOI10.1145/362912.362918MaRDI QIDQ5566863zbMATH OpenOpenAlexFDO

Authors Thomas C. Lowe

Publication date 1969

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/362912.362918

zbMATH Keywords

numerical analysis

Cited in

(1)

• Applications of graph theory in computer systems

This page was built for publication: Analysis of boolean program models for time-shared, paged environments

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