2 citations · 2 across the 3 of their papers we have counts for
Showing cs.DSShow 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.DS2012
Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting
Tsvi Kopelowitz, Nimrod Talmon
The selection problem, where one wishes to locate the smallest element in an unsorted array of size , is one of the basic problems studied in computer science. The main…
cs.DS2010
Fast, precise and dynamic distance queries
Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz +2
We present an approximate distance oracle for a point set S with n points and doubling dimension λ. For every ε>0, the oracle supports (1+ε)-approximate distance queries in (univer…