2 citations · 4 across the 3 of their papers we have counts for
3 papers
cs.DS2014★ 2 cited
Polynomials: a new tool for length reduction in binary discrete convolutions
Amihood Amir, Oren Kapah, Ely Porat +1
Efficient handling of sparse data is a key challenge in Computer Science. Binary convolutions, such as polynomial multiplication or the Walsh Transform are a useful tool in many ap…
cs.DS2014★ 2 cited
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets
Amihood Amir, Oren Kapah, Tsvi Kopelowitz +2
We introduce and examine the {\em Holiday Gathering Problem} which models the difficulty that couples have when trying to decide with which parents should they spend the holiday. O…
cs.DS2008
Improved Deterministic Length Reduction
Amihood Amir, Klim Efremenko, Oren Kapah +2
This paper presents a new technique for deterministic length reduction. This technique improves the running time of the algorithm presented in \cite{LR07} for performing fast convo…