We study the problem of finding monotone subsequences in an array from the viewpoint of sublinear algorithms. For fixed k \in \mathbb{N} and \varepsilon > 0, we show that the non-adaptive query complexity of finding a length-k monotone subsequence of f \colon [n] \to \mathbb{R}, assuming that f is \varepsilon-far ... more >>>