(Noisy) gap cycle counting strikes back: random order streaming lower bounds for connected components and beyond (Q6499223)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: (Noisy) gap cycle counting strikes back: random order streaming lower bounds for connected components and beyond |
scientific article; zbMATH DE number 7844582
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | (Noisy) gap cycle counting strikes back: random order streaming lower bounds for connected components and beyond |
scientific article; zbMATH DE number 7844582 |
Statements
(Noisy) gap cycle counting strikes back: random order streaming lower bounds for connected components and beyond (English)
0 references
8 May 2024
0 references
communication complexity
0 references
connected components
0 references
graph streaming
0 references
random order streams
0 references
0 references
0 references
