2 citations · 2 across the 1 of their papers we have counts for
7 papers
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…
Fixed-point cycles and EFX allocations
Benjamin Aram Berendsohn, Simona Boyadzhiyska, László Kozma
We study edge-labelings of the complete bidirected graph with functions from the set to itself. We call a cycle in $\o…
The diameter of caterpillar associahedra
Benjamin Aram Berendsohn
The caterpillar associahedron is a polytope arising from the rotation graph of search trees on a caterpillar tree , generalizing the rotation graph of binary se…
Matrix patterns with bounded saturation function
Benjamin Aram Berendsohn
A 0-1 matrix contains a 0-1 matrix pattern if we can obtain from by deleting rows and/or columns and turning arbitrary 1-entries into 0s. The saturation function $\…
Splay trees on trees
Benjamin Aram Berendsohn, László Kozma
Search trees on trees (STTs) are a far-reaching generalization of binary search trees (BSTs), allowing the efficient exploration of tree-structured domains. (BSTs are the special c…
Geometric group testing
Benjamin Aram Berendsohn, László Kozma
Group testing is concerned with identifying defective items in a set of items, where each test reports whether a specific subset of items contains at least one defective. I…