Manuela Fischer
Orcid: 0000-0002-0125-8957Affiliations:
- ETH Zurich, Switzerland
According to our database1,
Manuela Fischer
authored at least 24 papers
between 2017 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
2022
J. Comb. Theory B, 2022
Proceedings of the 36th International Symposium on Distributed Computing, 2022
Proceedings of the 36th International Symposium on Distributed Computing, 2022
Deterministic (1+<i>ε</i>)-approximate maximum matching with poly(1/<i>ε</i>) passes in the semi-streaming model and beyond.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022
2021
Breaking the linear-memory barrier in MPC: Fast MIS on trees with strongly sublinear memory.
Theor. Comput. Sci., 2021
Deterministic (1+ε)-Approximate Maximum Matching with poly(1/ε) Passes in the Semi-Streaming Model.
CoRR, 2021
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021
2020
2019
The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019
2018
Simple Graph Coloring Algorithms for Congested Clique and Massively Parallel Computation.
CoRR, 2018
Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with n<sup>ε</sup> Memory per Machine.
CoRR, 2018
Proceedings of the 32nd International Symposium on Distributed Computing, 2018
2017
Sublogarithmic Distributed Algorithms for Lovász Local Lemma, and the Complexity Hierarchy.
Proceedings of the 31st International Symposium on Distributed Computing, 2017
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017