A note on randomized streaming space bounds for the longest increasing subsequence problem (Q413292): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2011.12.008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2074139744 / rank | |||
Normal rank | |||
Revision as of 21:10, 19 March 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
