Esther Ezra

Orcid: 0000-0001-8133-1335

Affiliations:
  • Bar-Ilan University, Department of Computer Science, Israel
  • Georgia Institute of Technology, School of Mathematics, Atlanta, GA, USA (former)
  • New York University, Department of Computer Science, NY, USA (former)
  • Tel-Aviv University, Department of Computer Science, Israel (PhD 2007)


According to our database1, Esther Ezra authored at least 56 papers between 2000 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Semi-Algebraic Off-line Range Searching and Biclique Partitions in the Plane.
CoRR, 2024

Vertical Decomposition in 3D and 4D with Applications to Line Nearest-Neighbor Searching in 3D.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Time and space efficient collinearity indexing.
Comput. Geom., 2023

Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model.
Comput. Geom., 2023

Line Intersection Searching Amid Unit Balls in 3-Space.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022
Counting and Cutting Rich Lenses in Arrangements of Circles.
SIAM J. Discret. Math., 2022

On Ray Shooting for Triangles in 3-Space and Related Problems.
SIAM J. Comput., 2022

Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets: Collinearity Testing and Related Problems.
Discret. Comput. Geom., 2022

Intersection Searching amid Tetrahedra in Four Dimensions.
CoRR, 2022

Intersection Searching Amid Tetrahedra in 4-Space and Efficient Continuous Collision Detection.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021
Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications.
SIAM J. Comput., 2021

On pseudo-disk hypergraphs.
Comput. Geom., 2021

On Rich Lenses in Planar Arrangements of Circles and Related Problems.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

On 3SUM-hard Problems in the Decision Tree Model.
Proceedings of the Connecting with Computability, 2021

2020
Constructive Polynomial Partitioning for Algebraic Curves in ℝ<sup>3</sup> with Applications.
SIAM J. Comput., 2020

Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location.
Discret. Comput. Geom., 2020

Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019
Geometric Optimization Revisited.
Proceedings of the Computing and Software Science - State of the Art and Perspectives, 2019

A Nearly Quadratic Bound for Point-Location in Hyperplane Arrangements, in the Linear Decision Tree Model.
Discret. Comput. Geom., 2019

An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2017
A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension.
SIAM J. Comput., 2016

Two Proofs for Shallow Packings.
Discret. Comput. Geom., 2016

The Decision Tree Complexity for k-SUM is at most Nearly Quadratic.
CoRR, 2016

2015
On the Beck-Fiala Conjecture for Random Set Systems.
Electron. Colloquium Comput. Complex., 2015

Data recovery after geographic correlated attacks.
Proceedings of the 11th International Conference on the Design of Reliable Communication Networks, 2015

2014
Improved Bounds for the Union of Locally Fat Objects in the Plane.
SIAM J. Comput., 2014

Shallow Packings in Geometry.
CoRR, 2014

2013
Convex hull of points lying on lines in time after preprocessing.
Comput. Geom., 2013

Small-size relative (<i>p</i>, ε)-approximations for well-behaved range spaces.
Proceedings of the Symposium on Computational Geometry 2013, 2013

2012
Active Learning Using Smooth Relative Regret Approximations with Applications.
Proceedings of the COLT 2012, 2012

Small-Size Relative (p,Epsilon)-Approximations for Well-Behaved Range Spaces
CoRR, 2012

Near-Linear Approximation Algorithms for Geometric Hitting Sets.
Algorithmica, 2012

2011
On the Union of Cylinders in Three Dimensions.
Discret. Comput. Geom., 2011

A New Active Learning Scheme with Applications to Learning to Rank from Pairwise Preferences
CoRR, 2011

Convex Hull of Imprecise Points in o(n \log{n}) Time after Preprocessing
CoRR, 2011

Improved Bound for the Union of Fat Triangles.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Convex hull of imprecise points in <i>o(n log n)</i> time after preprocessing.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes.
SIAM J. Comput., 2010

A note about weak epsilon-nets for axis-parallel boxes in d-space.
Inf. Process. Lett., 2010

2009
On the union of fat tetrahedra in three dimensions.
J. ACM, 2009

On Regular Vertices of the Union of Planar Convex Objects.
Discret. Comput. Geom., 2009

Small-size epsilon-nets for axis-parallel rectangles and boxes.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Efficient Sensor Placement for Surveillance Problems.
Proceedings of the Distributed Computing in Sensor Systems, 2009

2008
On the performance of the ICP algorithm.
Comput. Geom., 2008

2007
Geometric arrangements: substructures and algorithms
PhD thesis, 2007

A Single Cell in an Arrangement of Convex Polyhedra in \Bbb <i>R</i><sup>3</sup>.
Discret. Comput. Geom., 2007

Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

On regular vertices on the union of planar objects.
Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006
On the ICP algorithm.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005
Output-Sensitive Construction of the Union of Triangles.
SIAM J. Comput., 2005

Counting and representing intersections among triangles in three dimensions.
Comput. Geom., 2005

Almost tight bound for a single cell in an arrangement of convex polyhedra in R<sup>3</sup>.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004
Speeding up the incremental construction of the union of geometric objects in practice.
Comput. Geom., 2004

2000
The Design and Implementation of Planar Maps in CGAL.
ACM J. Exp. Algorithmics, 2000


  Loading...