![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Fabian Frei
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner:
Finding Optimal Solutions with Neighborly Help. Algorithmica 86(6): 1921-1947 (2024) - [c13]Fabian Frei
, Ran Gelles
, Ahmed Ghazy
, Alexandre Nolin
:
Brief Announcement: Content-Oblivious Leader Election on Rings. PODC 2024: 549-552 - [c12]Hans-Joachim Böckenhauer, Fabian Frei, Peter Rossmanith:
Removable Online Knapsack and Advice. STACS 2024: 18:1-18:17 - [i12]Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki:
Hitting Meets Packing: How Hard Can it Be? CoRR abs/2402.14927 (2024) - [i11]Fabian Frei, Ran Gelles, Ahmed Ghazy, Alexandre Nolin:
Content-Oblivious Leader Election on Rings. CoRR abs/2405.03646 (2024) - [i10]Fabian Frei, Matthias Gehnen, Dennis Komm, Rastislav Královic, Richard Královic, Peter Rossmanith, Moritz Stocker:
Tree Coloring: Random Order and Predictions. CoRR abs/2405.18151 (2024) - 2023
- [j4]Fabian Frei
, Juraj Hromkovic, Rastislav Královic, Richard Královic:
Two-Way Non-Uniform Finite Automata. Int. J. Found. Comput. Sci. 34(2&3): 145-162 (2023) - [j3]Fabian Frei
, Koichi Wada:
Efficient deterministic MapReduce algorithms for parallelizable problems. J. Parallel Distributed Comput. 177: 28-38 (2023) - [c11]Elisabet Burjons
, Fabian Frei
, Matthias Gehnen
, Henri Lotze
, Daniel Mock
, Peter Rossmanith
:
Delaying Decisions and Reservation Costs. COCOON (1) 2023: 371-383 - [c10]Fabian Frei, David Wehner:
Bounds for c-Ideal Hashing. FCT 2023: 205-220 - [c9]Hans-Joachim Böckenhauer
, Fabian Frei
, Walter Unger, David Wehner
:
Zero-Memory Graph Exploration with Unknown Inports. SIROCCO 2023: 246-261 - [i9]Fabian Frei, David Wehner:
Bounds for c-Ideal Hashing. CoRR abs/2301.13832 (2023) - [i8]Hans-Joachim Böckenhauer, Fabian Frei, Walter Unger, David Wehner:
Zero-Memory Graph Exploration with Unknown Inports. CoRR abs/2301.13860 (2023) - [i7]Elisabet Burjons, Fabian Frei, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith:
Delaying Decisions and Reservation Costs. CoRR abs/2307.07284 (2023) - 2022
- [j2]Fabian Frei
, Edith Hemaspaandra
, Jörg Rothe
:
Complexity of stability. J. Comput. Syst. Sci. 123: 103-121 (2022) - [c8]Hans-Joachim Böckenhauer
, Fabian Frei
, Silvan Horvath
:
Priority Algorithms with Advice for Disjoint Path Allocation Problems (Extended Abstract). ICS 2022: 25-36 - [i6]Hans-Joachim Böckenhauer, Fabian Frei, Silvan Horvath:
Priority Algorithms with Advice for Disjoint Path Allocation Problems. CoRR abs/2202.10254 (2022) - 2021
- [b1]Fabian Frei:
Beneath, Behind, and Beyond Common Complexity Classes. ETH Zurich, Zürich, Switzerland, 2021 - [c7]Fabian Frei, Juraj Hromkovic, Richard Královic, Rastislav Královic:
Two-Way Non-uniform Finite Automata. DLT 2021: 155-166 - [c6]Fabian Frei, Peter Rossmanith, David Wehner:
An Open Pouring Problem. FUN 2021: 14:1-14:9 - [c5]Elisabet Burjons
, Fabian Frei, Martin Raszyk:
From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata. LICS 2021: 1-13 - 2020
- [j1]Fabian Frei, Juraj Hromkovic, Juhani Karhumäki:
Roots and Powers in Regular Languages: Recognizing Nonregular Properties by Finite Automata. Fundam. Informaticae 175(1-4): 173-185 (2020) - [c4]Fabian Frei
, Edith Hemaspaandra
, Jörg Rothe:
Complexity of Stability. ISAAC 2020: 19:1-19:14 - [i5]Hans-Joachim Böckenhauer
, Jan Dreier, Fabian Frei, Peter Rossmanith:
Advice for Online Knapsack With Removable Items. CoRR abs/2005.01867 (2020) - [i4]Elisabet Burjons, Fabian Frei, Martin Raszyk:
From Functional Nondeterministic Transducers to Deterministic Two-Tape Automata. CoRR abs/2005.13710 (2020)
2010 – 2019
- 2019
- [c3]Fabian Frei, Koichi Wada:
Efficient Circuit Simulation in MapReduce. ISAAC 2019: 52:1-52:21 - [c2]Elisabet Burjons
, Fabian Frei, Edith Hemaspaandra, Dennis Komm
, David Wehner:
Finding Optimal Solutions With Neighborly Help. MFCS 2019: 78:1-78:14 - [i3]Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner:
Finding Optimal Solutions With Neighborly Help. CoRR abs/1906.10078 (2019) - [i2]Fabian Frei, Koichi Wada:
Efficient Circuit Simulation in MapReduce. CoRR abs/1907.01624 (2019) - [i1]Fabian Frei, Edith Hemaspaandra, Jörg Rothe:
Complexity of Stability. CoRR abs/1910.00305 (2019) - 2018
- [c1]Elisabet Burjons
, Fabian Frei, Jasmin Smula, David Wehner:
Length-Weighted Disjoint Path Allocation - Advice and Parametrization. Adventures Between Lower Bounds and Higher Altitudes 2018: 231-256
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-24 20:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint