1. Aldous, D., Diaconis, P. Longest increasing subseqeunces: from patience sorting to the Baik-Deift-Johnasson theorem. Bull. Amer. Math. Soc., 36, 413–432 (1999)
2. Baik, J., Deift, P., Johansson, K. On the distribution of the length of the longets increasing subseqeunce in a random permutation. J. Amer. Math. Soc., 12: 1119–1178 (1999)
3. Deift, P. Integrable systems and combinatorial theory. Notices Amer. Math. Soc., 47: 631–640 (2000)
4. Erdös, P., Szerekes, G. A combinatorial theory in geometry. Compoistio Math. 2: 463–470 (1935)
5. Hammersley, J. A few seedlings of research. Proc. Sixth berkeley Symposium on Math. Statis. Probab., University of California Press, Berkeley, CA, 345–394, 1972