A note on randomized streaming space bounds for the longest increasing subsequence problem (Q413292): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The space complexity of approximating the frequency moments / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3579382 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2934610 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3425115 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Private vs. common random bits in communication complexity / rank | |||
Normal rank | |||
Latest revision as of 04:19, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on randomized streaming space bounds for the longest increasing subsequence problem |
scientific article |
Statements
A note on randomized streaming space bounds for the longest increasing subsequence problem (English)
0 references
4 May 2012
0 references
communication complexity
0 references
data streams
0 references
longest increasing subsequence
0 references
lower bounds
0 references
0 references
