Published in: LIPIcs, Volume 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Omer Gold and Micha Sharir. Dominance Product and High-Dimensional Closest Pair under L_infty. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 39:1-39:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{gold_et_al:LIPIcs.ISAAC.2017.39, author = {Gold, Omer and Sharir, Micha}, title = {{Dominance Product and High-Dimensional Closest Pair under L\underlineinfty}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {39:1--39:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.39}, URN = {urn:nbn:de:0030-drops-82268}, doi = {10.4230/LIPIcs.ISAAC.2017.39}, annote = {Keywords: Closest Pair, Dominance Product, L\underlineinfty Proximity, Rectangular Matrix Multiplication} }
Published in: LIPIcs, Volume 87, 25th Annual European Symposium on Algorithms (ESA 2017)
Omer Gold and Micha Sharir. Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 42:1-42:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{gold_et_al:LIPIcs.ESA.2017.42, author = {Gold, Omer and Sharir, Micha}, title = {{Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {42:1--42:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.42}, URN = {urn:nbn:de:0030-drops-78364}, doi = {10.4230/LIPIcs.ESA.2017.42}, annote = {Keywords: 3SUM, k-SUM, Linear Degeneracy, Linear Decision Trees, Fractional Cascading} }
Published in: LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Omer Gold and Micha Sharir. Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 25:1-25:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{gold_et_al:LIPIcs.ICALP.2017.25, author = {Gold, Omer and Sharir, Micha}, title = {{Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier}}, booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, pages = {25:1--25:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-041-5}, ISSN = {1868-8969}, year = {2017}, volume = {80}, editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.25}, URN = {urn:nbn:de:0030-drops-73820}, doi = {10.4230/LIPIcs.ICALP.2017.25}, annote = {Keywords: Dynamic Time Warping, Geometric Edit Distance, Time Series, Points Matching, Geometric Matching} }
Feedback for Dagstuhl Publishing