Bounds on Oblivious, Conservative Matrix Transposition Networks

Dwork, Cynthia

dc.contributor.author	Dwork, Cynthia	en_US
dc.date.accessioned	2007-04-23T16:46:48Z
dc.date.available	2007-04-23T16:46:48Z
dc.date.issued	1983-04	en_US
dc.identifier.citation	http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR83-537	en_US
dc.identifier.uri	https://hdl.handle.net/1813/6378
dc.description.abstract	A matrix transposition network of depth $k$ is shown to require $\theta (kn^{1+1/k})$ edges.	en_US
dc.format.extent	338488 bytes
dc.format.extent	102154 bytes
dc.format.mimetype	application/pdf
dc.format.mimetype	application/postscript
dc.language.iso	en_US	en_US
dc.publisher	Cornell University	en_US
dc.subject	computer science	en_US
dc.subject	technical report	en_US
dc.title	Bounds on Oblivious, Conservative Matrix Transposition Networks	en_US
dc.type	technical report	en_US