Bounds on Oblivious, Conservative Matrix Transposition Networks

Collections
Computer Science Technical Reports
Author
Dwork, Cynthia
Abstract

A matrix transposition network of depth $k$ is shown to require $\theta (kn^{1+1/k})$ edges.

Date Issued
1983-04
Publisher
Cornell University
Keywords
•
Previously Published as
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR83-537
Type
technical report