Defines the memory-bounded μ-CONGEST model and establishes a tight Θ(n^{1+o(1)}/μ^{1/2}) round complexity for triangle listing, plus efficient streaming algorithm simulations.
Pint: Probabilistic in-band network telemetry
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DC 1years
2025 1verdicts
ACCEPT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Bounded Memory in Distributed Networks
Defines the memory-bounded μ-CONGEST model and establishes a tight Θ(n^{1+o(1)}/μ^{1/2}) round complexity for triangle listing, plus efficient streaming algorithm simulations.