A deterministic semi-streaming algorithm achieves an O(Δ)-coloring in O(√log Δ) passes, the first with linear palette size and sublogarithmic passes.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
For a uniform random Boolean function on p bits, its low-degree Fourier coefficients uniquely determine it with high probability precisely when d exceeds p/2 by an O(sqrt(p log p)) window.
citing papers explorer
-
Faster Deterministic Streaming Vertex Coloring
A deterministic semi-streaming algorithm achieves an O(Δ)-coloring in O(√log Δ) passes, the first with linear palette size and sublogarithmic passes.
-
Low-Degree Fourier Threshold for Random Boolean Functions
For a uniform random Boolean function on p bits, its low-degree Fourier coefficients uniquely determine it with high probability precisely when d exceeds p/2 by an O(sqrt(p log p)) window.