"A Tighter Upper Bound on the Worst Case Behavior of Conway's Parallel ..."

Alejandro A. Schäffer (1988)

> Home

Details and statistics

DOI: 10.1016/0196-6774(88)90024-7

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/Schaffer88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/Schaffer88
Alejandro A. Schäffer:
A Tighter Upper Bound on the Worst Case Behavior of Conway's Parallel Sorting Algorithm. J. Algorithms 9(3): 321-342 (1988)

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.