Pankaj K. Agarwal, Lars Arge, Ke Yi. An optimal dynamic interval stabbing-max data structure?. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005. pages 803-812, SIAM, 2005. [doi]
@inproceedings{AgarwalAY05:0,
title = {An optimal dynamic interval stabbing-max data structure?},
author = {Pankaj K. Agarwal and Lars Arge and Ke Yi},
year = {2005},
doi = {10.1145/1070432.1070546},
url = {http://doi.acm.org/10.1145/1070432.1070546},
tags = {data-flow},
researchr = {https://researchr.org/publication/AgarwalAY05%3A0},
cites = {0},
citedby = {0},
pages = {803-812},
booktitle = {Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005},
publisher = {SIAM},
isbn = {0-89871-585-7},
}