1. Erdős, P., Szekeres, G.: A combinatorial problem in geometry. Compositio Math. 2, 463–470 (1935)
2. Bespamyatnikh, S., Segal, M.: Enumerating longest increasing subsequences and patience sorting. Information Processing Letters 76, 7–11 (2000)
3. McColl, W.F.: General purpose parallel computing. In: Lectures on parallel computation, pp. 337–391. Cambridge University Press, New York (1993)
4. Garcia, T., Myoupo, J., Semé, D.: A work-optimal CGM algorithm for the longest increasing subsequence problem. In: Proc. PDPTA (2001)
5. Nakashima, T., Fujiwara, A.: A cost optimal parallel algorithm for patience sorting. Parallel Processing Letters 16(1), 39–52 (2006)