Show simple item record

dc.contributor.authorDwork, Cynthiaen_US
dc.date.accessioned2007-04-23T16:46:48Z
dc.date.available2007-04-23T16:46:48Z
dc.date.issued1983-04en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR83-537en_US
dc.identifier.urihttps://hdl.handle.net/1813/6378
dc.description.abstractA matrix transposition network of depth $k$ is shown to require $\theta (kn^{1+1/k})$ edges.en_US
dc.format.extent338488 bytes
dc.format.extent102154 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleBounds on Oblivious, Conservative Matrix Transposition Networksen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics