Theoretical Limitations on the Efficient Use of Parallel Memories

DOI10.1109/TC.1978.1675122zbMath0379.68043MaRDI QIDQ4158485

Henry D. Shapiro

Publication date: 1978

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

Mathematics Subject Classification ID

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

Related Items (12)

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

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