Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS - United States
doi 10.1109/focs.2007.4389501
Full Text
Open PDFAbstract
Available in full text
Categories
Date
October 1, 2007
Authors
Publisher
IEEE