Publication:2934610
From MaRDI portal
zbMath1302.68125MaRDI QIDQ2934610
Robert Krauthgamer, Ravi Kumar, T. S. Jayram, Parikshit Gopalan
Publication date: 18 December 2014
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items
On the monotonicity of a data stream, Space-Efficient Algorithms for Longest Increasing Subsequence, A note on randomized streaming space bounds for the longest increasing subsequence problem, Improved algorithm for permutation testing, Space-efficient algorithms for longest increasing subsequence, Estimating the Longest Increasing Sequence in Polylogarithmic Time, Streaming Algorithms with One-Sided Estimation