Near-optimal labeling schemes for nearest common ancestors

Stephen Alstrup; Esben Bistrup Halvorsen; Kasper Green Larsen

doi:10.1137/1.9781611973402.72

Near-optimal labeling schemes for nearest common ancestors

Stephen Alstrup, Esben Bistrup Halvorsen, Kasper Green Larsen

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

20 Citations (Scopus)

Original language	English
Title of host publication	Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
Editors	Chandra Chekuri
Number of pages	11
Publisher	Society for Industrial and Applied Mathematics
Publication date	2014
Pages	972-982
ISBN (Print)	978-1-61197-338-9
ISBN (Electronic)	978-1-61197-340-2
DOIs	https://doi.org/10.1137/1.9781611973402.72
Publication status	Published - 2014
Event	Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms - Portland, United States Duration: 5 Jan 2014 → 7 Jan 2014 Conference number: 25

Conference

Conference	Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
Number	25
Country/Territory	United States
City	Portland
Period	05/01/2014 → 07/01/2014

Access to Document

10.1137/1.9781611973402.72

Cite this

Near-optimal labeling schemes for nearest common ancestors. / Alstrup, Stephen; Halvorsen, Esben Bistrup; Larsen, Kasper Green.

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms . ed. / Chandra Chekuri. Society for Industrial and Applied Mathematics, 2014. p. 972-982.

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Alstrup, S, Halvorsen, EB & Larsen, KG 2014, Near-optimal labeling schemes for nearest common ancestors. in C Chekuri (ed.), Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms . Society for Industrial and Applied Mathematics, pp. 972-982, Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, Portland, United States, 05/01/2014. https://doi.org/10.1137/1.9781611973402.72

@inproceedings{0cc5ee78da84468f9b344bb40d84e305,

title = "Near-optimal labeling schemes for nearest common ancestors",

author = "Stephen Alstrup and Halvorsen, {Esben Bistrup} and Larsen, {Kasper Green}",

year = "2014",

doi = "10.1137/1.9781611973402.72",

language = "English",

isbn = "978-1-61197-338-9",

pages = "972--982",

editor = "Chandra Chekuri",

booktitle = "Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms",

publisher = "Society for Industrial and Applied Mathematics",

address = "United States",

note = "Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ; Conference date: 05-01-2014 Through 07-01-2014",

}

TY - GEN

T1 - Near-optimal labeling schemes for nearest common ancestors

AU - Alstrup, Stephen

AU - Halvorsen, Esben Bistrup

AU - Larsen, Kasper Green

N1 - Conference code: 25

PY - 2014

Y1 - 2014

U2 - 10.1137/1.9781611973402.72

DO - 10.1137/1.9781611973402.72

M3 - Article in proceedings

SN - 978-1-61197-338-9

SP - 972

EP - 982

BT - Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms

A2 - Chekuri, Chandra

PB - Society for Industrial and Applied Mathematics

T2 - Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms

Y2 - 5 January 2014 through 7 January 2014

ER -