18 citations · 79 across the 27 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
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.DS2014★ 2 cited
Higher Lower Bounds from the 3SUM Conjecture
Tsvi Kopelowitz, Seth Pettie, Ely Porat
The 3SUM conjecture has proven to be a valuable tool for proving conditional lower bounds on dynamic data structures and graph problems. This line of work was initiated by Pǎtraşcu…
cs.DS2014★ 1 cited
Dynamic Set Intersection
Tsvi Kopelowitz, Seth Pettie, Ely Porat
Consider the problem of maintaining a family of dynamic sets subject to insertions, deletions, and set-intersection reporting queries: given , report every member of…