{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:23:55Z","timestamp":1725456235134},"publisher-location":"Berlin\/Heidelberg","reference-count":5,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354051516X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0015935","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T01:25:05Z","timestamp":1132709105000},"page":"146-151","source":"Crossref","is-referenced-by-count":3,"title":["Postorder hierarchy for path compressions and set union"],"prefix":"10.1007","author":[{"given":"Martin","family":"Loebl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaroslav","family":"Ne\u0161et\u0159il","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02579170","volume":"2","author":"S. Hart","year":"1986","unstructured":"S. Hart, M. Sharir: Non-linearity of Davenport-Schinzel sequences and of generalized path compression schemes, Combinatorica 6, 2(1986), 151\u2013177; see also proc. 24th FOCS Symposium (1985), 313\u2013319","journal-title":"Combinatorica 6"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"M.Loebl, J.Ne\u0161et\u0159il: Linearity and Unprovability of the set union problem strategies, STOC (1988), 360\u2013366","DOI":"10.1145\/62212.62247"},{"key":"13_CR3","unstructured":"M.Loebl, J.Ne\u0161et\u0159il: (to appear)"},{"key":"13_CR4","unstructured":"J.M.Lucas: Postorder disjoint set union is linear, Rutgers Technical Report (September 1988)"},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1145\/322154.322161","volume":"26","author":"R.E. Tarjan","year":"1979","unstructured":"R.E. Tarjan: Application of Path Compression on Balanced Trees, J.ACM 26 (1979), 690\u2013715.","journal-title":"J.ACM"}],"container-title":["Lecture Notes in Computer Science","Machines, Languages, and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0015935","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T00:25:33Z","timestamp":1586564733000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015935"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354051516X"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/bfb0015935","relation":{},"subject":[]}}