Parinya Chalermsook, Mayank Goswami, László Kozma 0002, Kurt Mehlhorn, Thatchaphol Saranurak. Greedy Is an Almost Optimal Deque. In Frank Dehne, Jörg-Rüdiger Sack, Ulrike Stege, editors, Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings. Volume 9214 of Lecture Notes in Computer Science, pages 152-165, Springer, 2015. [doi]
@inproceedings{ChalermsookG0MS15,
title = {Greedy Is an Almost Optimal Deque},
author = {Parinya Chalermsook and Mayank Goswami and László Kozma 0002 and Kurt Mehlhorn and Thatchaphol Saranurak},
year = {2015},
doi = {10.1007/978-3-319-21840-3_13},
url = {http://dx.doi.org/10.1007/978-3-319-21840-3_13},
researchr = {https://researchr.org/publication/ChalermsookG0MS15},
cites = {0},
citedby = {0},
pages = {152-165},
booktitle = {Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings},
editor = {Frank Dehne and Jörg-Rüdiger Sack and Ulrike Stege},
volume = {9214},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-21839-7},
}