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)

Mathematics Subject Classification ID

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

Cited in

(12)

• Proving a conjecture on prime double square tiles
• On translating one polyomino to tile the plane
• A survey of known results and research areas for \(n\)-queens
• 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
• Efficient address generation in a parallel processor
• On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
• Generalized Latin squares. II
• An implementation of a nonlinear skewing scheme
• Periodicity of one-dimensional tilings
• Permuting data with the Omega network

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)