Manuel Stoeckl

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Low-Memory Algorithms for Online Edge Coloring.

Prantar Ghosh, Manuel Stoeckl

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Finding Missing Items Requires Strong Forms of Randomness.

Amit Chakrabarti, Manuel Stoeckl

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.

Amit Chakrabarti, Manuel Stoeckl

CoRR, 2023

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

Prantar Ghosh, Manuel Stoeckl

CoRR, 2023

Streaming algorithms for the missing item finding problem.

Manuel Stoeckl

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms.

Sepehr Assadi, Amit Chakrabarti, Prantar Ghosh, Manuel Stoeckl

Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

2022

Adversarially Robust Coloring for Graph Streams.

Amit Chakrabarti, Prantar Ghosh, Manuel Stoeckl

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.

Amit Chakrabarti, Manuel Stoeckl

CoRR, 2021