References
- Aho , A. V. , Hopcroft , J. E and Ullman , J. D. 1974 . The Design and Analysis of Computer Algorithms , Reading, , MA : Addison-Wesley .
- Ben-Or , M. 1983 . Proc. 15th ACM Symp. on Theory of Computing . Lower Bounds for Algebraic Computation Trees . 1983 . pp. 80 – 86 .
- Fredman , M. L. 1975 . On Computing the Length of Longest Increasing Subsequences . Discrete Mathematics , 11 29 – 35 .
- Gries , D. 1981 . The Science of Programming , NY : Springer-Verlag .
- Lewis C. Tight Ω(n lg n) Lower Bound for Finding a Longest Increasing Subsequence MS Thesis, Wichita State University. 1994