( en | de | ru )

 

Disambiguation of "Ezra, Esther"

Author of the publication

copydeleteadd this publication to your clipboard
The Decision Tree Complexity for k-SUM is at most Nearly Quadratic.

, and . CoRR, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Esther Ezra

Ezra Zivier

Ezra Chimombe

Ezra Oscar Feinkuchen

Daniel Stökl Ben Ezra

 

Other publications of authors with the same name

Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions., and . FOCS, page 525-535. IEEE Computer Society, (2007)Active learning using smooth relative regret approximations with applications., , and . J. Mach. Learn. Res., 15 (1): 885-920 (2014)Constructive Polynomial Partitioning for Algebraic Curves in ℝ3 with Applications., , and . SIAM J. Comput., 49 (6): 1109-1127 (2020)On the ICP algorithm., , and . SCG, page 95-104. ACM, (2006)Convex hull of imprecise points in o(n log n) time after preprocessing., and . SCG, page 11-20. ACM, (2011)Near-linear approximation algorithms for geometric hitting sets., , and . SCG, page 23-32. ACM, (2009)The Decision Tree Complexity for k-SUM is at most Nearly Quadratic., and . CoRR, (2016)Efficient Sensor Placement for Surveillance Problems., , and . DCOSS, volume 5516 of Lecture Notes in Computer Science, page 301-314. Springer, (2009)Line Intersection Searching Amid Unit Balls in 3-Space., and . SoCG, volume 258 of LIPIcs, page 5:1-5:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Semi-Algebraic Off-Line Range Searching and Biclique Partitions in the Plane., , and . SoCG, volume 293 of LIPIcs, page 4:1-4:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)