Esther Ezra

activity

20142023

most citedThe Decision Tree Complexity for

k

-SUM is at most Nearly Quadratic

3 citations · 4 across the 3 of their papers we have counts for

collaborators

2 papers

cs.CG2016★ 3 cited

The Decision Tree Complexity for $k$ -SUM is at most Nearly Quadratic

Esther Ezra, Micha Sharir

Following a recent improvement of Cardinal et al. on the complexity of a linear decision tree for $k$ -SUM, resulting in $O (n^{3} lo g^{3} n)$ linear queries, we present a further impr…

cs.CG2014★ 1 cited

Shallow Packings in Geometry

Esther Ezra

We refine the bound on the packing number, originally shown by Haussler, for shallow geometric set systems. Specifically, let $\V$ be a finite set system defined over an $n$ -point…

The Decision Tree Complexity for k-SUM is at most Nearly Quadratic

Shallow Packings in Geometry

The Decision Tree Complexity for $k$ -SUM is at most Nearly Quadratic