"An adaptive O(log n)-optimal policy for the online selection ..."

Alessandro Arlotto, Yehua Wei, Xinchang Xie (2018)

> Home

Details and statistics

DOI: 10.1002/RSA.20728

access: closed

type: Journal Article

metadata version: 2020-05-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/ArlottoWX18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/ArlottoWX18
Alessandro Arlotto, Yehua Wei, Xinchang Xie:
An adaptive O(log n)-optimal policy for the online selection of a monotone subsequence from a random sample. Random Struct. Algorithms 52(1): 41-53 (2018)

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.