Jan Bulánek, Michal Koucký, Michael Saks. Tight lower bounds for the online labeling problem. In Howard J. Karloff, Toniann Pitassi, editors, Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012. pages 1185-1198, ACM, 2012. [doi]
@inproceedings{BulanekKS12,
title = {Tight lower bounds for the online labeling problem},
author = {Jan Bulánek and Michal Koucký and Michael Saks},
year = {2012},
doi = {10.1145/2213977.2214083},
url = {http://doi.acm.org/10.1145/2213977.2214083},
researchr = {https://researchr.org/publication/BulanekKS12},
cites = {0},
citedby = {0},
pages = {1185-1198},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012},
editor = {Howard J. Karloff and Toniann Pitassi},
publisher = {ACM},
isbn = {978-1-4503-1245-5},
}