3 citations · 6 across the 7 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024
Counting Permutation Patterns with Multidimensional Trees
Gal Beniamini, Nir Lavee
We consider the well-studied pattern counting problem: given a permutation and an integer , count the number of order-isomorphic occurrences of every pat…
cs.DS2020★ 3 cited
Sparsifying the Operators of Fast Matrix Multiplication Algorithms
Gal Beniamini, Nathan Cheng, Olga Holtz +2
Fast matrix multiplication algorithms may be useful, provided that their running time is good in practice. Particularly, the leading coefficient of their arithmetic complexity need…