Manuela Fischer

Available identifiers

Publication	Date of Publication	Type
Fast distributed Brooks' theorem	2024-05-14	Paper
Deterministic (1+ 𝜀 )-approximate maximum matching with poly(1/ 𝜀 ) passes in the semi-streaming model and beyond	2023-12-08	Paper
Sublogarithmic distributed algorithms for Lovász local lemma, and the complexity hierarchy	2023-02-03	Paper
Improved deterministic distributed matching via rounding	2023-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q5090918	2022-07-21	Paper
Tight Analysis of Parallel Randomized Greedy MIS	2021-12-16	Paper
Triangle resilience of the square of a Hamilton cycle in random graphs	2021-11-17	Paper
The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation	2021-01-20	Paper
Massively Parallel Computation of Matching and MIS in Sparse Graphs	2021-01-20	Paper
Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory	2020-12-15	Paper
Improved deterministic distributed matching via rounding	2020-06-15	Paper
Breaking the linear-memory barrier in MPC: fast MIS on trees with strongly sublinear memory	2020-03-03	Paper
https://portal.mardi4nfdi.de/entity/Q4608034	2018-03-15	Paper

This page was built for person: Manuela Fischer