Showing 2023Show all
2 papers · 1 filter
cs.DS2023
Finding missing items requires strong forms of randomness
Amit Chakrabarti, Manuel Stoeckl
Adversarially robust streaming algorithms are required to process a stream of elements and produce correct outputs, even when each stream element can be chosen as a function of ear…
cs.DS2023
Low-Memory Algorithms for Online and W-Streaming Edge Coloring
Prantar Ghosh, Manuel Stoeckl
For edge coloring, the online and the W-streaming models seem somewhat orthogonal: the former needs edges to be assigned colors immediately after insertion, typically without any s…