Pages that link to "Item:Q5390602"
From MaRDI portal
The following pages link to Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence (Q5390602):
Displayed 8 items.
- A note on randomized streaming space bounds for the longest increasing subsequence problem (Q413292) (← links)
- On the monotonicity of a data stream (Q1677498) (← links)
- Space-efficient algorithms for longest increasing subsequence (Q1987516) (← links)
- Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy (Q2796207) (← links)
- Space-Efficient Algorithms for Longest Increasing Subsequence (Q3304143) (← links)
- (Q5090444) (← links)
- Estimating the Longest Increasing Sequence in Polylogarithmic Time (Q5737810) (← links)
- (Q5743415) (← links)