Algorithms Part9
Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence. Anna GalUT Austin Parikshit GopalanU. Washington.
1 Estimating the longest increasing sequence in polylogarithmic time C. Seshadhri (Sandia National Labs) Joint work with Michael Saks (Rutgers University)
Acm Cheat Sheet
All Running Java Codes for the Questions Asked in Final Evalutions
Introduction to Algorithms: A Creative Approach
Brief Introduction in Problem Solving using Dynamic Programming and Memoization.
Decomposition of densities in individual contributions
A Comparison of Parallel Sorting Algorithms on Different Architectures Nancy M. Amato, Ravishankar Iyer, Sharad Sundaresan and Yan Wu Texas A&M University.
Lecture 14
