4 citations · 4 across the 3 of their papers we have counts for
16 papers · 1 filter
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…
Analysis of Smooth Heaps and Slim Heaps
Maria Hartmann, László Kozma, Corwin Sinnamon +1
The smooth heap is a recently introduced self-adjusting heap [Kozma, Saranurak, 2018] similar to the pairing heap [Fredman, Sedgewick, Sleator, Tarjan, 1986]. The smooth heap was o…
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…
Exact exponential algorithms for two poset problems
László Kozma
Partially ordered sets (posets) are fundamental combinatorial objects with important applications in computer science. Perhaps the most natural algorithmic task, given a size- p…
Finding and counting permutations via CSPs
Benjamin Aram Berendsohn, László Kozma, Dániel Marx
Permutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of Knuth on stack-sorting (1…