No. Title Author Year
1 Union of Hypercubes and 3D Minkowski Sums with Random Sizes Agarwal, Pankaj K. et al. 2018
2 A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM Ezra, Esther et al. 2017
3 Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats Agarwal, Pankaj K. et al. 2017
4 Dominance Product and High-Dimensional Closest Pair under L_infty Gold, Omer et al. 2017
5 Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier Gold, Omer et al. 2017
6 Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points Kaplan, Haim et al. 2017
7 Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy Gold, Omer et al. 2017
8 Output Sensitive Algorithms for Approximate Incidences and Their Applications Aiger, Dror et al. 2017
9 The Algebraic Revolution in Combinatorial and Computational Geometry: State of the Art (Invited Talk) Sharir, Micha 2017
10 Incidences between Points and Lines in Three Dimensions Sharir, Micha et al. 2015
Current Page :
Number of result pages: 2
Number of documents: 12


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI