"Tight Bounds on the Complexity of Parallel Sorting."

Frank Thomson Leighton (1985)

> Home

Details and statistics

DOI: 10.1109/TC.1985.5009385

access: closed

type: Journal Article

metadata version: 2017-05-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tc/Leighton85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tc/Leighton85
Frank Thomson Leighton:
Tight Bounds on the Complexity of Parallel Sorting. IEEE Trans. Computers 34(4): 344-354 (1985)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.