No. Title Author Year
1 A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM Ezra, Esther et al. 2017
2 Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats Agarwal, Pankaj K. et al. 2017
3 Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier Gold, Omer et al. 2017
4 Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points Kaplan, Haim et al. 2017
5 Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy Gold, Omer et al. 2017
6 Output Sensitive Algorithms for Approximate Incidences and Their Applications Aiger, Dror et al. 2017
7 The Algebraic Revolution in Combinatorial and Computational Geometry: State of the Art (Invited Talk) Sharir, Micha 2017
8 Incidences between Points and Lines in Three Dimensions Sharir, Micha et al. 2015
9 Polynomials Vanishing on Cartesian Products: The Elekes-Szabó Theorem Revisited Raz, Orit E. et al. 2015
10 The Number of Unit-Area Triangles in the Plane: Theme and Variations Raz, Orit E. et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 10

DROPS-Home | Fulltext Search | Imprint Published by LZI