Benjamin Aram Berendsohn

AG Theoretische Informatik
Institut für Informatik
Freie Universität Berlin

Room 121
Takustraße 9
14159 Berlin

Publications & Preprints

Benjamin Aram Berendsohn.
Fast and simple unrooted dynamic forests.
2024 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX)
[arxiv 2023] [ALENEX 2024]

Benjamin Aram Berendsohn, László Kozma, Michal Opler.
Optimization with pattern-avoiding input.
(Accepted to STOC '24)
[arxiv 2023]

Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, László Kozma.
Fast approximation of search trees on trees with centroid trees.
50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
[ICALP 2023]
Full version: [arxiv 2022]

Benjamin Aram Berendsohn, Simona Boyadzhiyska, László Kozma.
Fixed-point cycles and EFX allocations.
47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
[arxiv 2022] [MFCS 2022]

Benjamin Aram Berendsohn.
The diameter of caterpillar associahedra.
18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)
[arxiv 2021] [SWAT 2022]

Benjamin Aram Berendsohn.
An exact characterization of saturation for permutation matrices.
Combinatorial Theory 3(1) (2023)
[arxiv 2021] [CT 2023]
Superseded draft: [arxiv 2020]

Benjamin Aram Berendsohn, László Kozma.
Splay trees on trees.
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
[arxiv 2020] [SODA 2022]

Benjamin Aram Berendsohn, László Kozma.
Group Testing with Geometric Ranges.
2022 IEEE International Symposium on Information Theory (ISIT)
[ISIT 2022]
Full version: [arxiv 2020]

Benjamin Aram Berendsohn, László Kozma, Dániel Marx.
Finding and Counting Permutations via CSPs.
Algorithmica 83 (2021)
[arxiv 2019] [IPEC 2019] [Algorithmica 2021]

Benjamin Aram Berendsohn.
Complexity of permutation pattern matching.
Master's thesis (2019)
Erratum: Problems/algorithms called on-line in the thesis are actually streaming problems/algorithms.