Berendsohn, Benjamin Aram

1. Finding and counting permutations via CSPs
   2019/08/13 by Berendsohn, Benjamin Aram, Kozma, László, Marx, Dániel · 3 citations
   #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics
2. Fast approximation of search trees on trees with centroid trees
   2022/09/16 by Berendsohn, Benjamin Aram, Golinsky, Ishay, Kaplan, Haim +1 · 1 citation
   #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics