Benjamin Aram Berendsohn

Orcid: 0000-0002-3430-5262

Affiliations:
  • Free University of Berlin, Germany


According to our database1, Benjamin Aram Berendsohn authored at least 10 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Optimization with Pattern-Avoiding Input.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Fast and simple unrooted dynamic forests.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2024

2023
Fast Approximation of Search Trees on Trees with Centroid Trees.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
Fixed-point cycles and EFX allocations.
CoRR, 2022

The Diameter of Caterpillar Associahedra.
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Splay trees on trees.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Fixed-Point Cycles and Approximate EFX Allocations.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Group Testing with Geometric Ranges.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Finding and Counting Permutations via CSPs.
Algorithmica, 2021

2020
Geometric group testing.
CoRR, 2020


  Loading...