"Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence."

Nairen Cao, Shang-En Huang, Hsin-Hao Su (2023)

> Home

Details and statistics

DOI: 10.1145/3558481.3591078

access: closed

type: Conference or Workshop Paper

metadata version: 2023-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/spaa/CaoHS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/spaa/CaoHS23
Nairen Cao, Shang-En Huang, Hsin-Hao Su:
Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence. SPAA 2023: 249-259

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.