| _version_ |
1826193550522449920
|
| author |
Leighton, Tom
|
| author_facet |
Leighton, Tom
|
| author_sort |
Leighton, Tom
|
| collection |
MIT
|
| first_indexed |
2024-09-23T09:40:54Z
|
| id |
mit-1721.1/149082
|
| institution |
Massachusetts Institute of Technology
|
| last_indexed |
2024-09-23T09:40:54Z
|
| publishDate |
2023
|
| record_format |
dspace
|
| spelling |
mit-1721.1/1490822023-03-30T04:09:20Z Tight Bounds on the Complexity of Parallel Sorting Leighton, Tom 2023-03-29T14:25:37Z 2023-03-29T14:25:37Z 1985-04 https://hdl.handle.net/1721.1/149082 14711547 MIT-LCS-TM-272 application/pdf
|
| spellingShingle |
Leighton, Tom
Tight Bounds on the Complexity of Parallel Sorting
|
| title |
Tight Bounds on the Complexity of Parallel Sorting
|
| title_full |
Tight Bounds on the Complexity of Parallel Sorting
|
| title_fullStr |
Tight Bounds on the Complexity of Parallel Sorting
|
| title_full_unstemmed |
Tight Bounds on the Complexity of Parallel Sorting
|
| title_short |
Tight Bounds on the Complexity of Parallel Sorting
|
| title_sort |
tight bounds on the complexity of parallel sorting
|
| url |
https://hdl.handle.net/1721.1/149082
|
| work_keys_str_mv |
AT leightontom tightboundsonthecomplexityofparallelsorting
|