The following pages link to Benjamin Aram Berendsohn (Q2041984):
Displaying 8 items.
- Finding and counting permutations via CSPs (Q2041985) (← links)
- Finding and Counting Permutations via CSPs (Q5875533) (← links)
- An exact characterization of saturation for permutation matrices (Q5886259) (← links)
- The diameter of caterpillar associahedra (Q6381205) (← links)
- Fast and simple unrooted dynamic forests (Q6545383) (← links)
- Splay trees on trees (Q6575149) (← links)
- Fixed-point cycles and approximate EFX allocations (Q6584009) (← links)
- Fast approximation of search trees on trees with centroid trees (Q6638011) (← links)
