activity
20122026
most citedLimits of Private Learning with Access to Public Data

15 citations · 82 across the 26 of their papers we have counts for

collaborators
Showing cs.CGShow all

2 papers · 1 filter

cs.CG2018

Generalized comparison trees for point-location problems

Daniel M Kane, Shachar Lovett, Shay Moran

Let be an arbitrary family of hyper-planes in -dimensions. We show that the point-location problem for can be solved by a linear decision tree that only uses a special t…

cs.CG2017

Near-optimal linear decision trees for k-SUM and related problems

Daniel M. Kane, Shachar Lovett, Shay Moran

We construct near optimal linear decision trees for a variety of decision problems in combinatorics and discrete geometry. For example, for any constant , we construct linear de…