Fabian Frei

Orcid: 0000-0002-1368-3205

According to our database1, Fabian Frei authored at least 27 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Finding Optimal Solutions with Neighborly Help.
Algorithmica, June, 2024

Transformations of probability distributions.
Theor. Comput. Sci., 2024

Tree Coloring: Random Order and Predictions.
CoRR, 2024

Content-Oblivious Leader Election on Rings.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

Brief Announcement: Distinct Gathering Under Round Robin.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

Removable Online Knapsack and Advice.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Gathering Semi-Synchronously Scheduled Two-State Robots.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2024

Invited Paper: Gathering Oblivious Robots in the Plane.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2024

Brief Announcement: Content-Oblivious Leader Election on Rings.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges.
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Hitting Meets Packing: How Hard Can It Be?
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023
Efficient deterministic MapReduce algorithms for parallelizable problems.
J. Parallel Distributed Comput., July, 2023

Two-Way Non-Uniform Finite Automata.
Int. J. Found. Comput. Sci., 2023

Zero-Memory Graph Exploration with Unknown Inports.
Proceedings of the Structural Information and Communication Complexity, 2023

Bounds for c-Ideal Hashing.
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

Delaying Decisions and Reservation Costs.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022
Complexity of stability.
J. Comput. Syst. Sci., 2022

Priority Algorithms with Advice for Disjoint Path Allocation Problems.
CoRR, 2022

Priority Algorithms with Advice for Disjoint Path Allocation Problems (Extended Abstract).
Proceedings of the New Trends in Computer Technologies and Applications, 2022

2021
Beneath, Behind, and Beyond Common Complexity Classes.
PhD thesis, 2021

From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

An Open Pouring Problem.
Proceedings of the 10th International Conference on Fun with Algorithms, 2021

2020
Roots and Powers in Regular Languages: Recognizing Nonregular Properties by Finite Automata.
Fundam. Informaticae, 2020

From Functional Nondeterministic Transducers to Deterministic Two-Tape Automata.
CoRR, 2020

Advice for Online Knapsack With Removable Items.
CoRR, 2020

2019
Efficient Circuit Simulation in MapReduce.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018
Length-Weighted Disjoint Path Allocation - Advice and Parametrization.
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018


  Loading...