Cite
HARVARD Citation
Arlotto, A. et al. (2018). An adaptive O(log n)‐optimal policy for the online selection of a monotone subsequence from a random sample. Random structures & algorithms. 52 (1), pp. 41-53. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Arlotto, A. et al. (2018). An adaptive O(log n)‐optimal policy for the online selection of a monotone subsequence from a random sample. Random structures & algorithms. 52 (1), pp. 41-53. [Online].