Benjamin Aram Berendsohn

activity

20192026

most citedMatrix patterns with bounded saturation function

2 citations · 5 across the 10 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

cs.DS2022

Fast approximation of search trees on trees with centroid trees

Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan +1

Search trees on trees (STTs) generalize the fundamental binary search tree (BST) data structure: in STTs the underlying search space is an arbitrary tree, whereas in BSTs it is a p…

cs.DS2022

Fixed-point cycles and EFX allocations

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

We study edge-labelings of the complete bidirected graph $K \leftrightarrow_{n}$ with functions from the set $[d] = {1, \dots, d}$ to itself. We call a cycle in $\o…