Benjamin Aram Berendsohn

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Fast and simple unrooted dynamic forests.

Benjamin Aram Berendsohn

CoRR, 2023

Optimization with pattern-avoiding input.

Benjamin Aram Berendsohn, László Kozma, Michal Opler

CoRR, 2023

Fast Approximation of Search Trees on Trees with Centroid Trees.

Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, László Kozma

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Fixed-point cycles and EFX allocations.

Benjamin Aram Berendsohn, Simona Boyadzhiyska, László Kozma

CoRR, 2022

The Diameter of Caterpillar Associahedra.

Benjamin Aram Berendsohn

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Splay trees on trees.

Benjamin Aram Berendsohn, László Kozma

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

Fixed-Point Cycles and Approximate EFX Allocations.

Benjamin Aram Berendsohn, Simona Boyadzhiyska, László Kozma

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Group Testing with Geometric Ranges.

Benjamin Aram Berendsohn, László Kozma

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Finding and Counting Permutations via CSPs.

Benjamin Aram Berendsohn, László Kozma, Dániel Marx

Algorithmica, 2021

2020

Geometric group testing.

Benjamin Aram Berendsohn, László Kozma

CoRR, 2020