Lower bounds on streaming algorithms for approximating the length of the longest increasing subsequence

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2007, Pages 294-304

  Gál, Anna ^a   Gopalan, Parikshit ^b  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION FACTORS; CONSTANT-FACTOR APPROXIMATION; DETERMINISTIC DATA; DIRECT SUM; LONGEST INCREASING SUBSEQUENCE (LIS); LOWER BOUNDS; OPEN PROBLEMS; PROPERTY (S); STREAMING ALGORITHMS; UPPER BOUNDS;

COMMUNICATION; COMPUTER SCIENCE; CONTROL THEORY; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS; MILITARY DATA PROCESSING; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 46749098351     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389501     Document Type: Conference Paper

References (18)

1. M. Ajtai, T. Jayram, R. Kumar, and D. Sivakumar. Approximate counting of inversions in a data stream. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 370-379, 2002.
2. D. Aldous and P. Diaconis. Longest increasing subsequences: From patience sorting to the Baik-Deift-Johansson theorem. Bulletin of the American Mathematical Society, 36:413-432, 1999.
3. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. In Proc. 28th ACM Symp. on Theory of Computing, pages 20-29, 1996.
4. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In Proceedings of the 21st ACM Symposium on Principles of Databases Systems, pages 1-16, 2002.
5. Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. Journal of Computer and System Sciences, 68(4):702-732, 2004.
6. A. Chakrabarti. Personal communication, 2007.
7. A. Chakrabarti, S. Khot, and X. Sun. Near-optimal lower bounds on the multiparty communication complexity of set-disjointness. In Proceedings of the 18th Annual IEEE Conference on Computational Complexity (CCC), pages 107-117, 2003.
8. nd IEEE Symposium on Foundations of Computer Science, pages 270-278, 2001.
9. G. Cormode, S. Muthukrishnan, and S. C. Sahinalp. Permutation editing and matching via embeddings. In Proceedings of 28th International Colloquium on Automata, Languages and Programming, pages 481-492, 2001.
10. th ACM-SIAM Symposium on Discrete Algorithms, 2007.
11. A. Gupta and F. Zane. Counting inversions in lists. In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms, pages 253-254, 2003.
12. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997.
13. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
14. D. Liben-Nowell, E. Vee, and A. Zhu. Finding longest increasing and common subsequences in streaming data. Journal of Combinatorial Optimization, 11(2):155-175, 2006.
15. S. Muthukrishnan. Data Streams: Algorithms and Applications. Now Publishers Inc., 2005.
16. P. Pevzner. Computational Molecular Biology. Elsevier Science Ltd., 2003.
17. th annual ACM symposium on Theory of computing, pages 360-369, 2002.
18. X. Sun and D. P. Woodruff. The communication and streaming complexity of computing the longest common and increasing subsequences. In Proceedings of the 18th ACM-SIAM Annual Symposium on Discrete Algorithms, 2007.