A Fast Computer Method for Matrix Transposing

DOI10.1109/T-C.1972.223584zbMath0238.65017OpenAlexW2043106819MaRDI QIDQ5649368

J.-O. Eklundh

Publication date: 1972

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

Full work available at URL: https://doi.org/10.1109/t-c.1972.223584

Mathematics Subject Classification ID

Related Items (5)

Two dimensional fast Fourier transform for large data matrices ⋮ Transposition of an \(\ell \times \ell\) matrix requires \(\Omega\) (log \(\ell)\) reversals on conservative Turing machines ⋮ More efficient oblivious transfer extensions ⋮ Matrix transpose on meshes with wormhole and XY routing ⋮ A general transposition method for a matrix on auxiliary store

This page was built for publication: A Fast Computer Method for Matrix Transposing