Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence

Anna Gál, Parikshit Gopalan. Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence. SIAM Journal on Computing, 39(8):3463-3479, 2010. [doi]

@article{GalG10,
  title = {Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence},
  author = {Anna Gál and Parikshit Gopalan},
  year = {2010},
  doi = {10.1137/090770801},
  url = {http://dx.doi.org/10.1137/090770801},
  researchr = {https://researchr.org/publication/GalG10},
  cites = {0},
  citedby = {0},
  journal = {SIAM Journal on Computing},
  volume = {39},
  number = {8},
  pages = {3463-3479},
}