default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManuela Fischer
Person information
- affiliation: ETH Zurich, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c14]Manuela Fischer, Magnús M. Halldórsson, Yannic Maus:
Fast Distributed Brooks' Theorem. SODA 2023: 2567-2588- [c13]Manuela Fischer
, Jeff Giliberti, Christoph Grunau:
Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs. SPAA 2023: 89-100 - [i13]Jeff Giliberti, Manuela Fischer, Christoph Grunau:
Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs. CoRR abs/2301.11205 (2023) - 2022
- [j6]Manuela Fischer, Nemanja Skoric, Angelika Steger, Milos Trujic:
Triangle resilience of the square of a Hamilton cycle in random graphs. J. Comb. Theory B 152: 171-220 (2022) - [c12]Manuela Fischer, Slobodan Mitrovic, Jara Uitto:
Deterministic (1+ε)-approximate maximum matching with poly(1/ε) passes in the semi-streaming model and beyond. STOC 2022: 248-260 - [c11]Alkida Balliu, Sebastian Brandt, Manuela Fischer, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto:
Exponential Speedup over Locality in MPC with Optimal Memory. DISC 2022: 9:1-9:21 - [c10]Manuela Fischer, Jeff Giliberti, Christoph Grunau:
Improved Deterministic Connectivity in Massively Parallel Computation. DISC 2022: 22:1-22:17 - [i12]Manuela Fischer, Jeff Giliberti, Christoph Grunau:
Improved Deterministic Connectivity in Massively Parallel Computation. CoRR abs/2206.01568 (2022) - [i11]Alkida Balliu, Sebastian Brandt, Manuela Fischer, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto:
Exponential Speedup Over Locality in MPC with Optimal Memory. CoRR abs/2208.09453 (2022) - [i10]Manuela Fischer, Yannic Maus, Magnús M. Halldórsson:
Fast Distributed Brooks' Theorem. CoRR abs/2211.07606 (2022) - 2021
- [b1]Manuela Fischer:
Local Algorithms for Classic Graph Problems. ETH Zurich, Zürich, Switzerland, 2021 - [j5]Sebastian Brandt, Manuela Fischer, Jara Uitto:
Breaking the linear-memory barrier in MPC: Fast MIS on trees with strongly sublinear memory. Theor. Comput. Sci. 849: 22-34 (2021) - [c9]MohammadHossein Bateni, Hossein Esfandiari, Manuela Fischer, Vahab S. Mirrokni:
Extreme k-Center Clustering. AAAI 2021: 3941-3949 - [i9]Manuela Fischer, Slobodan Mitrovic, Jara Uitto:
Deterministic (1+ε)-Approximate Maximum Matching with poly(1/ε) Passes in the Semi-Streaming Model. CoRR abs/2106.04179 (2021) - 2020
- [j4]Manuela Fischer:
Improved deterministic distributed matching via rounding. Distributed Comput. 33(3-4): 279-291 (2020) - [j3]Manuela Fischer, Andreas Noever:
Tight Analysis of Parallel Randomized Greedy MIS. ACM Trans. Algorithms 16(1): 6:1-6:13 (2020)
2010 – 2019
- 2019
- [j2]Sebastian Brandt, Manuela Fischer, Jara Uitto:
SIROCCO 2019 Review. SIGACT News 50(4): 46-47 (2019) - [c8]Yi-Jun Chang, Manuela Fischer, Mohsen Ghaffari, Jara Uitto, Yufan Zheng:
The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation. PODC 2019: 471-480 - [c7]Soheil Behnezhad, Sebastian Brandt, Mahsa Derakhshan, Manuela Fischer, MohammadTaghi Hajiaghayi, Richard M. Karp, Jara Uitto:
Massively Parallel Computation of Matching and MIS in Sparse Graphs. PODC 2019: 481-490 - [c6]Sebastian Brandt, Manuela Fischer, Jara Uitto:
Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with Strongly Sublinear Memory. SIROCCO 2019: 124-138 - 2018
- [c5]Manuela Fischer, Andreas Noever:
Tight Analysis of Parallel Randomized Greedy MIS. SODA 2018: 2152-2160 - [c4]Manuela Fischer, Mohsen Ghaffari:
A Simple Parallel and Distributed Sampling Technique: Local Glauber Dynamics. DISC 2018: 26:1-26:11 - [i8]Manuela Fischer, Mohsen Ghaffari:
A Simple Parallel and Distributed Sampling Technique: Local Glauber Dynamics. CoRR abs/1802.06676 (2018) - [i7]Manuela Fischer, Jara Uitto:
Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with nε Memory per Machine. CoRR abs/1802.06748 (2018) - [i6]Sebastian Brandt, Manuela Fischer, Jara Uitto:
Matching and MIS for Uniformly Sparse Graphs in the Low-Memory MPC Model. CoRR abs/1807.05374 (2018) - [i5]Manuela Fischer, Mohsen Ghaffari, Jara Uitto:
Simple Graph Coloring Algorithms for Congested Clique and Massively Parallel Computation. CoRR abs/1808.08419 (2018) - 2017
- [j1]Manuela Fischer, Yannic Maus:
DISC 2017 Review. SIGACT News 48(4): 94-99 (2017) - [c3]Manuela Fischer, Mohsen Ghaffari, Fabian Kuhn:
Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching. FOCS 2017: 180-191 - [c2]Manuela Fischer:
Improved Deterministic Distributed Matching via Rounding. DISC 2017: 17:1-17:15 - [c1]Manuela Fischer, Mohsen Ghaffari:
Sublogarithmic Distributed Algorithms for Lovász Local Lemma, and the Complexity Hierarchy. DISC 2017: 18:1-18:16 - [i4]Manuela Fischer, Mohsen Ghaffari:
Deterministic Distributed Matching: Simpler, Faster, Better. CoRR abs/1703.00900 (2017) - [i3]Manuela Fischer, Mohsen Ghaffari, Fabian Kuhn:
Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching. CoRR abs/1704.02767 (2017) - [i2]Manuela Fischer, Mohsen Ghaffari:
Sublogarithmic Distributed Algorithms for Lovász Local lemma, and the Complexity Hierarchy. CoRR abs/1705.04840 (2017) - [i1]Manuela Fischer, Andreas Noever:
Tight Analysis of Randomized Greedy MIS. CoRR abs/1707.05124 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
