"Optimal Parallel Selection has Complexity O(Log Log n)."

Miklós Ajtai et al. (1989)

> Home

Details and statistics

DOI: 10.1016/0022-0000(89)90035-4

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jcss/AjtaiKSS89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/AjtaiKSS89
Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi:
Optimal Parallel Selection has Complexity O(Log Log n). J. Comput. Syst. Sci. 38(1): 125-133 (1989)

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.