Theoretical Limitations on the Efficient Use of Parallel Memories

DOI10.1109/TC.1978.1675122MaRDI QIDQ4158485zbMATH OpenFDO

Authors Henry D. Shapiro

Publication date 1978

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.1978.1675122

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45)

Cited in

(12)

• On translating one polyomino to tile the plane
• An implementation of a nonlinear skewing scheme
• Generalized Latin squares. I
• A linear algorithm to tile the trapezes with \(h_ m\) and \(v_ n\)
• Tiling figures of the plane with two bars
• Generalized Latin squares. II
• Permuting data with the Omega network
• Periodicity of one-dimensional tilings
• On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
• Proving a conjecture on prime double square tiles
• Efficient address generation in a parallel processor
• A survey of known results and research areas for \(n\)-queens

This page was built for publication: Theoretical Limitations on the Efficient Use of Parallel Memories

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