Estimating the sortedness of a data stream
From MaRDI portal
Recommendations
- On the monotonicity of a data stream
- A polylogarithmic space deterministic streaming algorithm for approximating distance to monotonicity
- Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance
- Estimating the longest increasing sequence in polylogarithmic time
- Computing and Combinatorics
Cited in
(17)- On the monotonicity of a data stream
- Space-efficient algorithms for longest increasing subsequence
- Approximate sorting of data streams with limited storage
- Streaming algorithms with one-sided estimation
- Space-efficient algorithms for longest increasing subsequence
- Approximate sorting of data streams with limited storage
- A note on randomized streaming space bounds for the longest increasing subsequence problem
- scientific article; zbMATH DE number 2079346 (Why is no real title available?)
- A polylogarithmic space deterministic streaming algorithm for approximating distance to monotonicity
- Lower bounds on streaming algorithms for approximating the length of the longest increasing subsequence
- Estimating the longest increasing sequence in polylogarithmic time
- Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance
- Improved algorithm for permutation testing
- Streaming and query once space complexity of longest increasing subsequence
- Streaming algorithms for geometric Steiner forest
- Improving order with queues
- Streaming and small space approximation algorithms for edit distance and longest common subsequence
This page was built for publication: Estimating the sortedness of a data stream
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934610)
