Xiaoming Sun, David P. Woodruff. The communication and streaming complexity of computing the longest common and increasing subsequences. In Nikhil Bansal, Kirk Pruhs, Clifford Stein, editors, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007. pages 336-345, SIAM, 2007. [doi]
Abstract is missing.