Show simple item record

Tight Bounds on the Complexity of Parallel Sorting

dc.contributor.authorLeighton, Tomen_US
dc.date.accessioned2023-03-29T14:25:37Z
dc.date.available2023-03-29T14:25:37Z
dc.date.issued1985-04
dc.identifier.urihttps://hdl.handle.net/1721.1/149082
dc.relation.ispartofseriesMIT-LCS-TM-272
dc.titleTight Bounds on the Complexity of Parallel Sortingen_US
dc.identifier.oclc14711547


Files in this item

Thumbnail
Name:
MIT-LCS-TM-272.pdf
Size:
6.069Mb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record