A note on randomized streaming space bounds for the longest increasing subsequence problem (Q413292)

From MaRDI portal
Revision as of 03:19, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    4 May 2012
    0 references
    communication complexity
    0 references
    data streams
    0 references
    longest increasing subsequence
    0 references
    lower bounds
    0 references

    Identifiers