Aarhus University Seal / Aarhus Universitets segl

On the complexity of range searching among curves

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

Standard

On the complexity of range searching among curves. / Afshani, Peyman; Driemel, Anne.

29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. ed. / Artur Czumaj . Association for Computing Machinery, 2018. p. 898-917.

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

Harvard

Afshani, P & Driemel, A 2018, On the complexity of range searching among curves. in A Czumaj (ed.), 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Association for Computing Machinery, pp. 898-917, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, United States, 07/01/2018. https://doi.org/10.1137/1.9781611975031.58

APA

Afshani, P., & Driemel, A. (2018). On the complexity of range searching among curves. In A. Czumaj (Ed.), 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018 (pp. 898-917). Association for Computing Machinery. https://doi.org/10.1137/1.9781611975031.58

CBE

Afshani P, Driemel A. 2018. On the complexity of range searching among curves. Czumaj A, editor. In 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Association for Computing Machinery. pp. 898-917. https://doi.org/10.1137/1.9781611975031.58

MLA

Afshani, Peyman and Anne Driemel "On the complexity of range searching among curves". Czumaj , Artur (ed.). 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Association for Computing Machinery. 2018, 898-917. https://doi.org/10.1137/1.9781611975031.58

Vancouver

Afshani P, Driemel A. On the complexity of range searching among curves. In Czumaj A, editor, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Association for Computing Machinery. 2018. p. 898-917 https://doi.org/10.1137/1.9781611975031.58

Author

Afshani, Peyman ; Driemel, Anne. / On the complexity of range searching among curves. 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. editor / Artur Czumaj . Association for Computing Machinery, 2018. pp. 898-917

Bibtex

@inproceedings{c4fa8ec0591742038936293dd9bfe8b2,
title = "On the complexity of range searching among curves",
author = "Peyman Afshani and Anne Driemel",
year = "2018",
month = jan,
doi = "10.1137/1.9781611975031.58",
language = "English",
pages = "898--917",
editor = "{Czumaj }, {Artur }",
booktitle = "29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018",
publisher = "Association for Computing Machinery",
address = "United States",
note = "29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018 ; Conference date: 07-01-2018 Through 10-01-2018",

}

RIS

TY - GEN

T1 - On the complexity of range searching among curves

AU - Afshani, Peyman

AU - Driemel, Anne

PY - 2018/1

Y1 - 2018/1

UR - http://www.scopus.com/inward/record.url?scp=85045579971&partnerID=8YFLogxK

U2 - 10.1137/1.9781611975031.58

DO - 10.1137/1.9781611975031.58

M3 - Article in proceedings

AN - SCOPUS:85045579971

SP - 898

EP - 917

BT - 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018

A2 - Czumaj , Artur

PB - Association for Computing Machinery

T2 - 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018

Y2 - 7 January 2018 through 10 January 2018

ER -