Optimal in-place transposition of rectangular matrices

Optimal in-place transposition of rectangular matrices

Given a rectangular m × n matrix stored as a two-dimensional array, we want to transpose it in place and measure the cost by the number of memory writes and the number of auxiliary cells used. We propose a transposition algorithm with optimal complexity O ( m n ) using only min ( m , n ) auxiliary m...

Full description

Saved in:
Bibliographic Details
Published in:Journal of Complexity Vol. 25; no. 4; pp. 377 - 384
Main Authors: Tretyakov, A.A., Tyrtyshnikov, E.E.
Format: Journal Article
Language:English
Published: Elsevier Inc 01-08-2009
Subjects:
Data rearrangement
In-place algorithms
Rectangular matrices
Transposition
Transposition
Data rearrangement
Rectangular matrices
In-place algorithms
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Given a rectangular m × n matrix stored as a two-dimensional array, we want to transpose it in place and measure the cost by the number of memory writes and the number of auxiliary cells used. We propose a transposition algorithm with optimal complexity O ( m n ) using only min ( m , n ) auxiliary memory cells.
ISSN:0885-064X
1090-2708
DOI:10.1016/j.jco.2009.02.008