2 citations · 5 across the 10 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DS2023
Fast and simple unrooted dynamic forests
Benjamin Aram Berendsohn
A dynamic forest data structure maintains a forest (and associated data like edge weights) under edge insertions and deletions. Dynamic forests are widely used to solve online and…
cs.DS2023
Optimization with pattern-avoiding input
Benjamin Aram Berendsohn, László Kozma, Michal Opler
Permutation pattern-avoidance is a central concept of both enumerative and extremal combinatorics. In this paper we study the effect of permutation pattern-avoidance on the complex…