Manuel Stoeckl

Orcid: 0000-0001-8189-0516

According to our database1, Manuel Stoeckl authored at least 8 papers between 2021 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Low-Memory Algorithms for Online Edge Coloring.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Finding Missing Items Requires Strong Forms of Randomness.
Proceedings of the 39th Computational Complexity Conference, 2024

2023
When a random tape is not enough: lower bounds for a problem in adversarially robust streaming.
CoRR, 2023

Low-Memory Algorithms for Online and W-Streaming Edge Coloring.
CoRR, 2023

Streaming algorithms for the missing item finding problem.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms.
Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

2022
Adversarially Robust Coloring for Graph Streams.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021
The Element Extraction Problem and the Cost of Determinism and Limited Adaptivity in Linear Queries.
CoRR, 2021


  Loading...