Benjamin Aram Berendsohn

According to our database, Benjamin Aram Berendsohn authored at least 16 papers between 2019 and 2026.

Collaborative distances:

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

2026

Fast decremental tree sums in forests.

Benjamin Aram Berendsohn, Marek Sokolowski

CoRR, May, 2026

Universally Optimal Decremental Tree Minima.

Benjamin Aram Berendsohn

CoRR, February, 2026

2025

Permutation patterns in streams.

Benjamin Aram Berendsohn

CoRR, July, 2025

Balanced TSP partitioning.

Benjamin Aram Berendsohn, Hwi Kim, László Kozma

CoRR, April, 2025

Optimal Antimatroid Sorting.

Benjamin Aram Berendsohn

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024

Optimization with Pattern-Avoiding Input.

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

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Fast and simple unrooted dynamic forests.

Benjamin Aram Berendsohn

Proceedings of the 26th Symposium on Algorithm Engineering and Experiments, 2024

2023

An exact characterization of saturation for permutation matrices.

Benjamin Aram Berendsohn

Comb. Theory, 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

2020

Geometric group testing.

Benjamin Aram Berendsohn, László Kozma

CoRR, 2020

2019

Finding and Counting Permutations via CSPs.

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

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019