The communication and streaming complexity of computing the longest common and increasing subsequences
From MaRDI portal
Recommendations
- Computing and Combinatorics
- Finding longest increasing and common subsequences in streaming data
- Lower bounds on streaming algorithms for approximating the length of the longest increasing subsequence
- A note on randomized streaming space bounds for the longest increasing subsequence problem
- Fast computation of a longest increasing subsequence and application
Cited in
(16)- On the monotonicity of a data stream
- Space-efficient algorithms for longest increasing subsequence
- Fast and longest rollercoasters
- Finding longest increasing and common subsequences in streaming data
- Space-efficient algorithms for longest increasing subsequence
- Communication-Efficient Private Protocols for Longest Common Subsequence
- A note on randomized streaming space bounds for the longest increasing subsequence problem
- Fast and longest rollercoasters
- Sketching, streaming, and fine-grained complexity of (weighted) LCS
- Lower bounds on streaming algorithms for approximating the length of the longest increasing subsequence
- Computing and Combinatorics
- Estimating the longest increasing sequence in polylogarithmic time
- Compressed communication complexity of longest common prefixes
- Streaming and query once space complexity of longest increasing subsequence
- Streaming algorithms for geometric Steiner forest
- Streaming and small space approximation algorithms for edit distance and longest common subsequence
This page was built for publication: The communication and streaming complexity of computing the longest common and increasing subsequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934612)
