default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEsther Ezra
Person information
- affiliation: Bar-Ilan University, Department of Computer Science, Israel
- affiliation (former): Georgia Institute of Technology, School of Mathematics, Atlanta, GA, USA
- affiliation (former): New York University, Department of Computer Science, NY, USA
- affiliation (PhD 2007): Tel-Aviv University, Department of Computer Science, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c33]Pankaj K. Agarwal
, Esther Ezra, Micha Sharir:
Semi-Algebraic Off-Line Range Searching and Biclique Partitions in the Plane. SoCG 2024: 4:1-4:15- [c32]Pankaj K. Agarwal, Esther Ezra, Micha Sharir:
Lower Envelopes of Surface Patches in 3-Space. ESA 2024: 6:1-6:17 - [c31]Pankaj K. Agarwal, Esther Ezra, Micha Sharir:
Vertical Decomposition in 3D and 4D with Applications to Line Nearest-Neighbor Searching in 3D. SODA 2024: 150-170 - [i19]Pankaj K. Agarwal, Esther Ezra, Micha Sharir:
Semi-Algebraic Off-line Range Searching and Biclique Partitions in the Plane. CoRR abs/2403.12276 (2024) - 2023
- [j28]Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir:
Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model. Comput. Geom. 109: 101945 (2023) - [j27]Boris Aronov, Esther Ezra, Micha Sharir, Guy Zigdon:
Time and space efficient collinearity indexing. Comput. Geom. 110: 101963 (2023) - [c30]Pankaj K. Agarwal, Esther Ezra:
Line Intersection Searching Amid Unit Balls in 3-Space. SoCG 2023: 5:1-5:14 - [i18]Pankaj K. Agarwal, Esther Ezra, Micha Sharir:
Vertical Decomposition in 3D and 4D with Applications to Line Nearest-Neighbor Searching in 3D. CoRR abs/2311.01597 (2023) - 2022
- [j26]Boris Aronov, Esther Ezra, Micha Sharir:
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets: Collinearity Testing and Related Problems. Discret. Comput. Geom. 68(4): 997-1048 (2022) - [j25]Esther Ezra, Micha Sharir:
On Ray Shooting for Triangles in 3-Space and Related Problems. SIAM J. Comput. 51(4): 1065-1095 (2022) - [j24]Esther Ezra, Orit E. Raz, Micha Sharir, Joshua Zahl:
Counting and Cutting Rich Lenses in Arrangements of Circles. SIAM J. Discret. Math. 36(2): 958-974 (2022) - [c29]Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Matthew J. Katz, Micha Sharir:
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems. SoCG 2022: 4:1-4:14 - [c28]Esther Ezra, Micha Sharir:
Intersection Searching Amid Tetrahedra in 4-Space and Efficient Continuous Collision Detection. ESA 2022: 51:1-51:17 - [i17]Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Matthew J. Katz, Micha Sharir:
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems. CoRR abs/2203.10241 (2022) - [i16]Esther Ezra, Micha Sharir:
Intersection Searching amid Tetrahedra in Four Dimensions. CoRR abs/2208.06703 (2022) - 2021
- [j23]Boris Aronov, Anirudh Donakonda, Esther Ezra, Rom Pinchasi:
On pseudo-disk hypergraphs. Comput. Geom. 92: 101687 (2021) - [j22]Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Joshua Zahl:
Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications. SIAM J. Comput. 50(2): 760-787 (2021) - [c27]Esther Ezra:
On 3SUM-hard Problems in the Decision Tree Model. CiE 2021: 178-188 - [c26]Esther Ezra, Micha Sharir:
On Ray Shooting for Triangles in 3-Space and Related Problems. SoCG 2021: 34:1-34:15 - [c25]Esther Ezra, Orit E. Raz, Micha Sharir, Joshua Zahl:
On Rich Lenses in Planar Arrangements of Circles and Related Problems. SoCG 2021: 35:1-35:15 - [c24]Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir:
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. ISAAC 2021: 3:1-3:15 - [i15]Esther Ezra, Micha Sharir:
On Ray Shooting for Triangles in 3-Space and Related Problems. CoRR abs/2102.07310 (2021) - [i14]Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir:
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. CoRR abs/2109.07587 (2021) - 2020
- [j21]Esther Ezra, Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location. Discret. Comput. Geom. 64(1): 109-173 (2020) - [j20]Boris Aronov, Esther Ezra, Joshua Zahl:
Constructive Polynomial Partitioning for Algebraic Curves in ℝ3 with Applications. SIAM J. Comput. 49(6): 1109-1127 (2020) - [c23]Boris Aronov, Esther Ezra, Micha Sharir:
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets. SoCG 2020: 8:1-8:14 - [i13]Boris Aronov, Esther Ezra, Micha Sharir:
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets. CoRR abs/2003.09533 (2020) - [i12]Esther Ezra, Orit E. Raz, Micha Sharir, Joshua Zahl:
On rich lenses in planar arrangements of circles and related problems. CoRR abs/2012.04204 (2020)
2010 – 2019
- 2019
- [j19]Esther Ezra, Micha Sharir:
A Nearly Quadratic Bound for Point-Location in Hyperplane Arrangements, in the Linear Decision Tree Model. Discret. Comput. Geom. 61(4): 735-755 (2019) - [j18]Esther Ezra, Shachar Lovett:
On the Beck-Fiala conjecture for random set systems. Random Struct. Algorithms 54(4): 665-675 (2019) - [c22]Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Joshua Zahl:
An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications. SoCG 2019: 5:1-5:14 - [c21]Boris Aronov, Esther Ezra, Joshua Zahl:
Constructive Polynomial Partitioning for Algebraic Curves in R3 with Applications. SODA 2019: 2636-2648 - [p1]Pankaj K. Agarwal, Esther Ezra, Kyle Fox:
Geometric Optimization Revisited. Computing and Software Science 2019: 66-84 - [i11]Boris Aronov, Esther Ezra, Joshua Zahl:
Constructive Polynomial Partitioning for Algebraic Curves in R3 with Applications. CoRR abs/1904.09526 (2019) - 2018
- [i10]Boris Aronov, Anirudh Donakonda, Esther Ezra, Rom Pinchasi:
On Pseudo-disk Hypergraphs. CoRR abs/1802.08799 (2018) - [i9]Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Joshua Zahl:
An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications. CoRR abs/1812.10269 (2018) - 2017
- [c20]Esther Ezra, Micha Sharir:
A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM. SoCG 2017: 41:1-41:15 - [i8]Esther Ezra, Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location. CoRR abs/1712.02913 (2017) - 2016
- [j17]Kunal Dutta, Esther Ezra, Arijit Ghosh:
Two Proofs for Shallow Packings. Discret. Comput. Geom. 56(4): 910-939 (2016) - [j16]Esther Ezra:
A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension. SIAM J. Comput. 45(1): 84-101 (2016) - [c19]Esther Ezra, Shachar Lovett:
On the Beck-Fiala Conjecture for Random Set Systems. APPROX-RANDOM 2016: 29:1-29:10 - [i7]Esther Ezra, Micha Sharir:
The Decision Tree Complexity for k-SUM is at most Nearly Quadratic. CoRR abs/1607.04336 (2016) - 2015
- [c18]Kunal Dutta, Esther Ezra, Arijit Ghosh:
Two Proofs for Shallow Packings. SoCG 2015: 96-110 - [c17]Guy Grebla, Alon Efrat, Esther Ezra, Rom Pinchasi, Swaminathan Sankararaman:
Data recovery after geographic correlated attacks. DRCN 2015: 65-72 - [i6]Esther Ezra, Shachar Lovett:
On the Beck-Fiala Conjecture for Random Set Systems. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j15]Nir Ailon, Ron Begleiter, Esther Ezra:
Active learning using smooth relative regret approximations with applications. J. Mach. Learn. Res. 15(1): 885-920 (2014) - [j14]Boris Aronov, Mark de Berg, Esther Ezra, Micha Sharir:
Improved Bounds for the Union of Locally Fat Objects in the Plane. SIAM J. Comput. 43(2): 543-572 (2014) - [c16]Esther Ezra:
A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension. SODA 2014: 1378-1388 - [i5]Esther Ezra:
Shallow Packings in Geometry. CoRR abs/1412.5215 (2014) - 2013
- [j13]Esther Ezra, Wolfgang Mulzer:
Convex hull of points lying on lines in time after preprocessing. Comput. Geom. 46(4): 417-434 (2013) - [c15]Esther Ezra:
Small-size relative (p, ε)-approximations for well-behaved range spaces. SoCG 2013: 233-242 - [i4]Esther Ezra:
A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension. CoRR abs/1307.8139 (2013) - 2012
- [j12]Pankaj K. Agarwal, Esther Ezra, Micha Sharir:
Near-Linear Approximation Algorithms for Geometric Hitting Sets. Algorithmica 63(1-2): 1-25 (2012) - [c14]Nir Ailon, Ron Begleiter, Esther Ezra:
Active Learning Using Smooth Relative Regret Approximations with Applications. COLT 2012: 19.1-19.20 - [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. Discret. Comput. Geom. 45(1): 45-64 (2011) - [c13]Esther Ezra, Wolfgang Mulzer:
Convex hull of imprecise points in o(n log n) time after preprocessing. SCG 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)
2000 – 2009
- 2009
- [j8]Esther Ezra, János Pach, Micha Sharir:
On Regular Vertices of the Union of Planar Convex Objects. Discret. Comput. Geom. 41(2): 216-231 (2009) - [j7]Esther Ezra, Micha Sharir:
On the union of fat tetrahedra in three dimensions. J. ACM 57(1): 2:1-2:23 (2009) - [c11]Pankaj K. Agarwal, Esther Ezra, Micha Sharir:
Near-linear approximation algorithms for geometric hitting sets. SCG 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]Esther Ezra:
On the Union of Cylinders in Three Dimensions. FOCS 2008: 179-188 - 2007
- [b1]Esther Ezra:
Geometric arrangements: substructures and algorithms. Tel Aviv University, Israel, 2007 - [j5]Esther Ezra, Micha Sharir:
A Single Cell in an Arrangement of Convex Polyhedra in \Bbb R3. Discret. Comput. Geom. 37(1): 21-41 (2007) - [c7]Esther Ezra, János Pach, Micha Sharir:
On regular vertices on the union of planar objects. SCG 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. SCG 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. SCG 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. SCG 2004: 210-219 - [c2]Eti Ezra, Micha Sharir:
Output-sensitive construction of the union of triangles. SODA 2004: 420-429 - 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 J. Exp. Algorithmics 5: 13 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
