{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:48:44Z","timestamp":1740098924283,"version":"3.37.3"},"publisher-location":"Cham","reference-count":5,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319674278"},{"type":"electronic","value":"9783319674285"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-67428-5_9","type":"book-chapter","created":{"date-parts":[[2017,9,4]],"date-time":"2017-09-04T21:22:24Z","timestamp":1504560144000},"page":"97-102","source":"Crossref","is-referenced-by-count":5,"title":["Tight Bounds for Top Tree Compression"],"prefix":"10.1007","author":[{"given":"Philip","family":"Bille","sequence":"first","affiliation":[]},{"given":"Finn","family":"Fernstr\u00f8m","sequence":"additional","affiliation":[]},{"given":"Inge Li","family":"G\u00f8rtz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,6]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Holm, J., de Lichtenberg, K., Thorup, M.: Minimizing diameters of dynamic trees. In: Proceedings of 24th ICALP, pp. 270\u2013280 (1997)","DOI":"10.1007\/3-540-63165-8_184"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Holm, J., Thorup, M.: Maintaining center and median in dynamic trees. In: Proceedings of 7th SWAT, pp. 46\u201356 (2000)","DOI":"10.1007\/3-540-44985-X_6"},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.ic.2014.12.012","volume":"243","author":"P Bille","year":"2015","unstructured":"Bille, P., G\u00f8rtz, I.L., Landau, G.M., Weimann, O.: Tree compression with top trees. Inform. Comput. 243, 166\u2013177 (2015)","journal-title":"Inform. Comput."},{"issue":"4","key":"9_CR4","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/322217.322228","volume":"27","author":"PJ Downey","year":"1980","unstructured":"Downey, P.J., Sethi, R., Tarjan, R.E.: Variations on the common subexpression problem. J. ACM 27(4), 758\u2013771 (1980)","journal-title":"J. ACM"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"H\u00fcbschle-Schneider, L., Raman, R.: Tree compression with top trees revisited. In: Proceedings of 14th SEA, pp. 15\u201327 (2015)","DOI":"10.1007\/978-3-319-20086-6_2"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67428-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,4]],"date-time":"2017-09-04T21:24:02Z","timestamp":1504560242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67428-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319674278","9783319674285"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67428-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}