On Efficient Simulations of Systolic Arrays by Random-Access Machines

DOI10.1137/0216027MaRDI QIDQ3769966zbMATH OpenOpenAlexFDO

Authors Oscar H. Ibarra, Michael A. Palis

Publication date 1987

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0216027

zbMATH Keywords

systolic arraysTuring machineunit-cost random-access machines

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• scientific article; zbMATH DE number 3952010
• The complexity of on-line simulations between multidimensional turing machines and random access machines
• Random access machines with multi-dimensional memories
• Optimal On-Line Simulations of Tree Machines by Random Access Machines
• scientific article; zbMATH DE number 3940732

Cited in

(7)

• scientific article; zbMATH DE number 4014035 (Why is no real title available?)
• scientific article; zbMATH DE number 3940732 (Why is no real title available?)
• scientific article; zbMATH DE number 3952010 (Why is no real title available?)
• scientific article; zbMATH DE number 3986645 (Why is no real title available?)
• scientific article; zbMATH DE number 4060724 (Why is no real title available?)
• The complexity of on-line simulations between multidimensional turing machines and random access machines
• Random access machines with multi-dimensional memories

This page was built for publication: On Efficient Simulations of Systolic Arrays by Random-Access Machines

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