"Estimating the Longest Increasing Subsequence in Nearly Optimal Time."

Alexandr Andoni et al. (2022)

> Home

Details and statistics

DOI: 10.1109/FOCS54457.2022.00073

access: closed

type: Conference or Workshop Paper

metadata version: 2022-12-31

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/focs/AndoniNS022
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/AndoniNS022
Alexandr Andoni, Negev Shekel Nosatzki, Sandip Sinha, Clifford Stein:
Estimating the Longest Increasing Subsequence in Nearly Optimal Time. FOCS 2022: 708-719

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.