{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T23:10:10Z","timestamp":1761174610411},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582182"},{"type":"electronic","value":"9783540485773"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58218-5_12","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:37:11Z","timestamp":1330270631000},"page":"131-142","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A tight lower bound for on-line monotonic list labeling"],"prefix":"10.1007","author":[{"given":"Paul F.","family":"Dietz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joel I.","family":"Seiferas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ju","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"12_CR1","first-page":"111","volume-title":"Lecture Notes in Computer Science, vol. 447","author":"A. Andersson","year":"1990","unstructured":"Andersson, A., Lai, T. W.: Fast updating of well-balanced trees. In: SWAT 90: 2nd Scandinavian Workshop on Algorithm Theory, Proceedings. (Lecture Notes in Computer Science, vol. 447.) Springer, New York Berlin Heidelberg, 1990, pp. 111\u2013121"},{"key":"12_CR2","first-page":"122","volume-title":"Maintaining order in a linked list","author":"P. F. Dietz","year":"1982","unstructured":"Dietz, P. F.: Maintaining order in a linked list. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, New York, 1982, pp. 122\u2013127"},{"key":"12_CR3","first-page":"365","volume-title":"Two algorithms for maintaining order in a list","author":"P. F. Dietz","year":"1987","unstructured":"Dietz, P. F., Sleator, D. D.: Two algorithms for maintaining order in a list. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, New York, 1987, pp. 365\u2013372 (revision to appear in Journal of Computer and System Sciences)"},{"key":"12_CR4","unstructured":"Dietz, P. F., Seiferas, J. I., Zhang, J.: Lower bounds for smooth list labeling, (in preparation)"},{"key":"12_CR5","first-page":"173","volume-title":"Lecture Notes in Computer Science, vol. 447","author":"P. F. Dietz","year":"1990","unstructured":"Dietz, P. F., Zhang, J.: Lower bounds for monotonie list labeling. In: SWAT 90: 2nd Scandinavian Workshop on Algorithm Theory, Proceedings. (Lecture Notes in Computer Science, vol. 447.) Springer, New York Berlin Heidelberg, 1990, pp. 173\u2013180"},{"key":"12_CR6","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/321356.321362","volume":"13","author":"F. C. Hennie","year":"1966","unstructured":"Hennie, F. C., Stearns, R. E.: Two-tape simulation of multitape Turing machines. Journal of the Association for Computing Machinery 13 (1966) 533\u2013546","journal-title":"Journal of the Association for Computing Machinery"},{"key":"12_CR7","volume-title":"Research Report RC 9146","author":"A. Itai","year":"1981","unstructured":"Itai, A., Konheim, A. G., Rodeh, M.: A sparse table implementation of sorted sets. IBM Thomas J. Watson Research Center, Yorktown Heights, New York, Research Report RC 9146, 1981"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF00289142","volume":"21","author":"A. K. Tsakalidis","year":"1984","unstructured":"Tsakalidis, A. K.: Maintaining order in a generalized linked list. Acta Informatica 21 (1984) 101\u2013112","journal-title":"Acta Informatica"},{"key":"12_CR9","volume-title":"Technical Report 481 and Ph. D. Thesis","author":"J. Zhang","year":"1993","unstructured":"Zhang, J.: Density control and on-line labeling problems. Computer Science Department, University of Rochester, Rochester, New York, Technical Report 481 and Ph. D. Thesis, 1993"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT '94"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58218-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:35:57Z","timestamp":1558269357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58218-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582182","9783540485773"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-58218-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"30 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}