Cite

    Alessandro Arlotto et al.. “An adaptive O(log n)‐optimal policy for the online selection of a monotone subsequence from a random sample.” Random structures & algorithms, vol. 52, no. 1, 2018, pp. 41–53. http://access.bl.uk/ark:/81055/vdc_100054076803.0x000032