Eti Ezra
List of publications from the DBLP Bibliography Server - FAQ| 2013 | ||
|---|---|---|
| j14 | Esther Ezra, Wolfgang Mulzer: Convex hull of points lying on lines in time after preprocessing. Comput. Geom. 46(4): 417-434 (2013) | |
| 2012 | ||
| j13 | Pankaj K. Agarwal, Esther Ezra, Micha Sharir: Near-Linear Approximation Algorithms for Geometric Hitting Sets. Algorithmica 63(1-2): 1-25 (2012) | |
| j12 | Nir Ailon, Ron Begleiter, Esther Ezra: Active Learning Using Smooth Relative Regret Approximations with Applications. Journal of Machine Learning Research - Proceedings Track 23: 19.1-19.20 (2012) | |
| i3 | Esther Ezra: Small-Size Relative (p,Epsilon)-Approximations for Well-Behaved Range Spaces. CoRR abs/1212.2303 (2012) | |
| 2011 | ||
| j11 | Esther Ezra: On the Union of Cylinders in Three Dimensions. Discrete & Computational Geometry 45(1): 45-64 (2011) | |
| c13 | Esther Ezra, Wolfgang Mulzer: Convex hull of imprecise points in o(n log n) time after preprocessing. Symposium on Computational Geometry 2011: 11-20 | |
| c12 | Esther Ezra, Boris Aronov, Micha Sharir: Improved Bound for the Union of Fat Triangles. SODA 2011: 1778-1785 | |
| i2 | Esther Ezra, Wolfgang Mulzer: Convex Hull of Imprecise Points in o(n \log{n}) Time after Preprocessing. CoRR abs/1102.2008 (2011) | |
| i1 | Nir Ailon, Ron Begleiter, Esther Ezra: A New Active Learning Scheme with Applications to Learning to Rank from Pairwise Preferences. CoRR abs/1110.2136 (2011) | |
| 2010 | ||
| j10 | Esther Ezra: A note about weak epsilon-nets for axis-parallel boxes in d-space. Inf. Process. Lett. 110(18-19): 835-840 (2010) | |
| j9 | Boris Aronov, Esther Ezra, Micha Sharir: Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes. SIAM J. Comput. 39(7): 3248-3282 (2010) | |
| 2009 | ||
| j8 | Esther Ezra, János Pach, Micha Sharir: On Regular Vertices of the Union of Planar Convex Objects. Discrete & Computational Geometry 41(2): 216-231 (2009) | |
| j7 | ||
| c11 | Pankaj K. Agarwal, Esther Ezra, Micha Sharir: Near-linear approximation algorithms for geometric hitting sets. Symposium on Computational Geometry 2009: 23-32 | |
| c10 | Pankaj K. Agarwal, Esther Ezra, Shashidhara K. Ganjugunte: Efficient Sensor Placement for Surveillance Problems. DCOSS 2009: 301-314 | |
| c9 | Boris Aronov, Esther Ezra, Micha Sharir: Small-size epsilon-nets for axis-parallel rectangles and boxes. STOC 2009: 639-648 | |
| 2008 | ||
| j6 | Esther Ezra, Micha Sharir, Alon Efrat: On the performance of the ICP algorithm. Comput. Geom. 41(1-2): 77-93 (2008) | |
| c8 | ||
| 2007 | ||
| j5 | Esther Ezra, Micha Sharir: A Single Cell in an Arrangement of Convex Polyhedra in \Bbb R3. Discrete & Computational Geometry 37(1): 21-41 (2007) | |
| c7 | Esther Ezra, János Pach, Micha Sharir: On regular vertices on the union of planar objects. Symposium on Computational Geometry 2007: 220-226 | |
| c6 | Esther Ezra, Micha Sharir: Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions. FOCS 2007: 525-535 | |
| 2006 | ||
| c5 | Esther Ezra, Micha Sharir, Alon Efrat: On the ICP algorithm. Symposium on Computational Geometry 2006: 95-104 | |
| 2005 | ||
| j4 | Esther Ezra, Micha Sharir: Counting and representing intersections among triangles in three dimensions. Comput. Geom. 32(3): 196-215 (2005) | |
| j3 | Esther Ezra, Micha Sharir: Output-Sensitive Construction of the Union of Triangles. SIAM J. Comput. 34(6): 1331-1351 (2005) | |
| c4 | Esther Ezra: Almost tight bound for a single cell in an arrangement of convex polyhedra in R3. Symposium on Computational Geometry 2005: 22-31 | |
| 2004 | ||
| j2 | Eti Ezra, Dan Halperin, Micha Sharir: Speeding up the incremental construction of the union of geometric objects in practice. Comput. Geom. 27(1): 63-85 (2004) | |
| c3 | Esther Ezra, Micha Sharir: Counting and representing intersections among triangles in three dimensions. Symposium on Computational Geometry 2004: 210-219 | |
| c2 | ||
| 2002 | ||
| c1 | Eti Ezra, Dan Halperin, Micha Sharir: Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice. ESA 2002: 473-484 | |
| 2000 | ||
| j1 | Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan, Eti Ezra: The Design and Implementation of Planar Maps in CGAL. ACM Journal of Experimental Algorithmics 5: 13 (2000) | |
Colors in the list of coauthors
Last update Sun May 19 03:32:23 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page