Near-quadratic lower bounds for two-pass graph streaming algorithms

DOI10.1109/FOCS46700.2020.00040MaRDI QIDQ6944016zbMATH OpenFDO

Authors Sepehr Assadi, Ran Raz

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS46700.2020.00040

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(8)

• Polynomial pass semi-streaming lower bounds for k-cores and degeneracy
• Rounds vs. communication tradeoffs for maximal independent sets
• A simple (1-)-approximation semi-streaming algorithm for maximum (weighted) matching
• Weighted matching in the random-order streaming and robust communication models
• Parameterized complexity of streaming diameter and connectivity problems
• Sketching approximability of all finite CSPs
• New algorithms and lower bounds for streaming tournaments
• Almost optimal superconstant-pass streaming lower bounds for reachability

This page was built for publication: Near-quadratic lower bounds for two-pass graph streaming algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6944016)