scientific article; zbMATH DE number 5764793
From MaRDI portal
Publication:3579382
Cited in
(5)- Streaming algorithms with one-sided estimation
- A note on randomized streaming space bounds for the longest increasing subsequence problem
- Estimating the longest increasing sequence in polylogarithmic time
- Streaming and query once space complexity of longest increasing subsequence
- Streaming and small space approximation algorithms for edit distance and longest common subsequence
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579382)