Manuela Fischer
Manuela Fischer
Verified email at inf.ethz.ch
Title
Cited by
Cited by
Year
Sirocco: silent rotors by acoustic optimisation
JG Schepers, A Curvers, S Oerlemans, K Braun, T Lutz, A Herrig, ...
Second International Meeting on Wind Turbine Noise, Lyon, France 2021, 2007
742007
Sublogarithmic distributed algorithms for Lov\'asz local lemma, and the complexity hierarchy
M Fischer, M Ghaffari
arXiv preprint arXiv:1705.04840, 2017
442017
Deterministic distributed edge-coloring via hypergraph maximal matching
M Fischer, M Ghaffari, F Kuhn
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
382017
Improved deterministic distributed matching via rounding
M Fischer
Distributed Computing 33 (3), 279-291, 2020
302020
The complexity of (δ+ 1) coloring in congested clique, massively parallel computation, and centralized local computation
YJ Chang, M Fischer, M Ghaffari, J Uitto, Y Zheng
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
232019
Tight analysis of parallel randomized greedy MIS
M Fischer, A Noever
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
182018
Massively parallel computation of matching and MIS in sparse graphs
S Behnezhad, S Brandt, M Derakhshan, M Fischer, MT Hajiaghayi, ...
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
162019
Matching and MIS for uniformly sparse graphs in the low-memory MPC model
S Brandt, M Fischer, J Uitto
arXiv preprint arXiv:1807.05374, 2018
162018
Breaking the linear-memory barrier in mpc: Fast mis on trees with nϵ memory per machine
S Brandt, M Fischer, J Uitto
arXiv preprint arXiv:1802.06748, 2018
132018
Deterministic distributed matching: Simpler, faster, better
M Fischer, M Ghaffari
arXiv preprint arXiv:1703.00900, 2017
92017
The Complexity of Coloring inCongested Clique, Massively Parallel Computation,and Centralized Local Computation
YJ Chang, M Fischer, M Ghaffari, J Uitto, Y Zheng
arXiv preprint arXiv:1808.08419, 2018
72018
Breaking the Linear-Memory Barrier in : Fast on Trees with Strongly Sublinear Memory
S Brandt, M Fischer, J Uitto
International Colloquium on Structural Information and Communication …, 2019
62019
A simple parallel and distributed sampling technique: local glauber dynamics
M Fischer, M Ghaffari
arXiv preprint arXiv:1802.06676, 2018
62018
Triangle resilience of the square of a Hamilton cycle in random graphs
M Fischer, N Škorić, A Steger, M Trujić
arXiv preprint arXiv:1809.07534, 2018
22018
Matching and mis for uniformly sparse graphs in MPC with low memory
S Brandt, M Fischer, J Uitto
manuscript, 2018
22018
Matching and MIS for Uniformly Sparse Graphs in the Low-Memory MPC Model. arXiv preprint, 2018
S Brandt, M Fischer, J Uitto
arXiv preprint arXiv:1807.05374, 2018
22018
Matching and MIS for uniformly sparse graphs in the low-memory MPC model. CoRR abs/1807.05374 (2018)
S Brandt, M Fischer, J Uitto
arXiv preprint arXiv:1807.05374, 1807
21807
Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with nε Memory per Machine.
M Fischer, J Uitto
arXiv preprint arXiv:1802.06748 4, 2018
12018
Bootstrap percolation with individual thresholds
M Fischer
Bachelor’s Thesis ETHZ (see p. 156), 2014
12014
Tight Analysis of Parallel Randomized Greedy MIS
M Fischer, A Noever
ACM Transactions on Algorithms (TALG) 16 (1), 1-13, 2019
2019
The system can't perform the operation now. Try again later.
Articles 1–20