English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance

Bringmann, K., Driemel, A., Nusser, A., & Psarros, I. (2022). Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance. In S. Naor, & N. Buchbinder (Eds.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 517-550). Philadephia, PA: SIAM. doi:10.1137/1.9781611977073.25.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/21.11116/0000-000C-1D7D-9 Version Permalink: https://hdl.handle.net/21.11116/0000-000E-22A7-F
Genre: Conference Paper
Latex : Tight Bounds for Approximate Near Neighbor Searching for Time Series under the {F}r\'{e}chet Distance

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Bringmann, Karl1, Author                 
Driemel, Anne2, Author
Nusser, André1, Author           
Psarros, Ioannis2, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2022
 Publication Status: Published online
 Pages: 42 p.
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Bringmann_SODA22
DOI: 10.1137/1.9781611977073.25
 Degree: -

Event

show
hide
Title: Thirty-Third Annual ACM-SIAM Symposium on Discrete Algorithms
Place of Event: Virtual
Start-/End Date: 2022-01-09 - 2022-01-12

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
  Abbreviation : SODA 2022
Source Genre: Proceedings
 Creator(s):
Naor, Seffi1, Editor           
Buchbinder, Niv1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Philadephia, PA : SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 517 - 550 Identifier: ISBN: 978-1-61197-707-3