A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
Finding the length of the longest increasing subsequence (LIS) is a classic algorithmic problem. Let n denote the size of the array. Simple O(n log n) algorithms are known for this problem. What can a sublinear time algorithm achieve? We develop a polylogarithmic time randomized algorithm that for any constant δ > 0, estimates the length of the LIS of an array upto an additive error of δn. More precisely, the running time of the algorithm is (log n) c (1/δ) O(1/δ) where the exponent c isdoi:10.1137/130942152 fatcat:udn5bxlqv5ainczf3ma55mlngm