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, Simona Boyadzhiyska, László Kozma.
Fixed-point cycles and EFX allocations.
[arxiv 2022]

Benjamin Aram Berendsohn.
The diameter of caterpillar associahedra.
[arxiv 2021]

Benjamin Aram Berendsohn.
An exact characterization of saturation for permutation matrices.
[arxiv 2021]
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.
Geometric group testing.
[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)
Errata: Problems/algorithms called on-line in the thesis are actually streaming problems/algorithms.
[pdf]