{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T10:19:08Z","timestamp":1756462748824,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214083","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"1185-1198","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Tight lower bounds for the online labeling problem"],"prefix":"10.1145","author":[{"given":"Jan","family":"Bul\u00e1nek","sequence":"first","affiliation":[{"name":"Charles University, Prague, Czech Rep"}]},{"given":"Michal","family":"Kouck\u00fd","sequence":"additional","affiliation":[{"name":"Mathematical Institute AS CR, Prague, Czech Rep"}]},{"given":"Michael","family":"Saks","sequence":"additional","affiliation":[{"name":"Rutgers University, Piscataway, NJ, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/227595.227596"},{"key":"e_1_3_2_2_2_1","volume-title":"On online labeling with polynomially many labels. In preparation","author":"Babka Martin","year":"2012","unstructured":"Martin Babka , Jan Bul\u00e1nek , Vladim\u00edr Cun\u00e1t , Michal Kouck\u00fd , and Michael E. Saks . On online labeling with polynomially many labels. In preparation , 2012 . Martin Babka, Jan Bul\u00e1nek, Vladim\u00edr Cun\u00e1t, Michal Kouck\u00fd, and Michael E. Saks. On online labeling with polynomially many labels. In preparation, 2012."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/647912.740822"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701389956"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.04.014"},{"key":"e_1_3_2_2_6_1","first-page":"39","volume-title":"SODA","author":"Brodal Gerth St\u00f8lting","year":"2002","unstructured":"Gerth St\u00f8lting Brodal , Rolf Fagerberg , and Riko Jacob . Cache oblivious search trees via binary trees of small height . In SODA , pages 39 -- 48 , 2002 . Gerth St\u00f8lting Brodal, Rolf Fagerberg, and Riko Jacob. Cache oblivious search trees via binary trees of small height. In SODA, pages 39--48, 2002."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.07.011"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480100315808"},{"key":"e_1_3_2_2_9_1","volume-title":"Lower bounds for smooth list labeling. Manuscript","author":"Dietz Paul F.","year":"2005","unstructured":"Paul F. Dietz , Joel I. Seiferas , and Ju Zhang . Lower bounds for smooth list labeling. Manuscript , 2005 . (Listed in the references of Dietz-SIAM) . Paul F. Dietz, Joel I. Seiferas, and Ju Zhang. Lower bounds for smooth list labeling. Manuscript, 2005. (Listed in the references of Dietz-SIAM)."},{"key":"e_1_3_2_2_10_1","first-page":"173","volume-title":"SWAT","author":"Paul","year":"1990","unstructured":"Paul F. Dietz and Ju Zhang. Lower bounds for monotonic list labeling . In SWAT , pages 173 -- 180 , 1990 . Paul F. Dietz and Ju Zhang. Lower bounds for monotonic list labeling. In SWAT, pages 173--180, 1990."},{"key":"e_1_3_2_2_11_1","volume-title":"New bounds for the controller problem. Distributed Computing, 24(3--4):177--186","author":"Emek Yuval","year":"2011","unstructured":"Yuval Emek and Amos Korman . New bounds for the controller problem. Distributed Computing, 24(3--4):177--186 , 2011 . Yuval Emek and Amos Korman. New bounds for the controller problem. Distributed Computing, 24(3--4):177--186, 2011."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/646235.682700"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281127"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90034-D"}],"event":{"name":"STOC'12: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"New York New York USA","acronym":"STOC'12"},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214083","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214083","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:57Z","timestamp":1750238457000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214083"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":14,"alternative-id":["10.1145\/2213977.2214083","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214083","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}