Manuel Stoeckl

11 papers A* 3A 2Journal 6
YearRankTypeTitle / Venue / Authors
2024 A conf
Finding Missing Items Requires Strong Forms of Randomness.
CCC
Amit Chakrabarti, Manuel Stoeckl
2024 A* conf
Low-Memory Algorithms for Online Edge Coloring.
ICALP
Prantar Ghosh, Manuel Stoeckl
2023 A* conf
Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms.
PODS
Sepehr Assadi, Amit Chakrabarti, Prantar Ghosh, Manuel Stoeckl
2023 J jnl
Low-Memory Algorithms for Online and W-Streaming Edge Coloring.
CoRR
Prantar Ghosh, Manuel Stoeckl
2023 A* conf
Streaming algorithms for the missing item finding problem.
SODA
Manuel Stoeckl
2023 J jnl
When a random tape is not enough: lower bounds for a problem in adversarially robust streaming.
CoRR
Amit Chakrabarti, Manuel Stoeckl
2022 A conf
Adversarially Robust Coloring for Graph Streams.
ITCS
Amit Chakrabarti, Prantar Ghosh, Manuel Stoeckl
2022 J jnl
Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms.
CoRR
Sepehr Assadi, Amit Chakrabarti, Prantar Ghosh, Manuel Stoeckl
2022 J jnl
Streaming algorithms for the missing item finding problem.
CoRR
Manuel Stoeckl
2021 J jnl
Adversarially Robust Coloring for Graph Streams.
CoRR
Amit Chakrabarti, Prantar Ghosh, Manuel Stoeckl
2021 J jnl
The Element Extraction Problem and the Cost of Determinism and Limited Adaptivity in Linear Queries.
CoRR
Amit Chakrabarti, Manuel Stoeckl