Superlinear lower bounds for multipass graph processing (Q343847)

From MaRDI portal
Revision as of 13:44, 18 April 2024 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Superlinear lower bounds for multipass graph processing
scientific article

    Statements

    title
    Superlinear lower bounds for multipass graph processing (English)
    0 references
    author
    Venkatesan Guruswami
    0 references
    Krzysztof Onak
    0 references
    published in
    Algorithmica
    0 references
    publication date
    29 November 2016
    0 references
    Mathematics Subject Classification ID
    68Q05
    0 references
    05C57
    0 references
    05C85
    0 references
    68P30
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6657215
    0 references
    zbMATH Keywords
    streaming
    0 references
    maximum matching
    0 references
    shortest path
    0 references
    communication complexity
    0 references
    information theory
    0 references
    OpenAlex ID
    W2310290370
    0 references
    arXiv ID
    1212.6925
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q343847&oldid=33300585"
    Powered by MediaWiki