{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:25Z","timestamp":1725663505572},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540520481"},{"type":"electronic","value":"9783540468721"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-52048-1_48","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:19:47Z","timestamp":1330204787000},"page":"252-266","source":"Crossref","is-referenced-by-count":0,"title":["An efficient implicit data structure for path testing and searching in rooted trees and forests"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Gambosi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Protasi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Talamo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"21_CR1","first-page":"2","volume":"19","author":"H. Alt","year":"1984","unstructured":"H. Alt,K. Melhorn,J.I. Munro \"Partial match retrieval in implicit data structures\" Inf. Proc; Lett., 19, 2, (1984).","journal-title":"Inf. Proc; Lett."},{"key":"21_CR2","first-page":"10","volume":"29","author":"M.D. Atkinson","year":"1986","unstructured":"M.D. Atkinson,J.R. Sack,N. Santoro,T. Strohotte \"Min-Max heaps and generalized priority queues\" Comm.A.C.M., 29,10, (1986).","journal-title":"Comm.A.C.M."},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"A.Borodin,F.E.Fich,F.Meyer auf der Heide,E.Upfal, A.Widgerson \"A tradeoff between search and update time for the implicit dictionary problem\" Proc. 13th ICALP Conf., Lect. Not. in Comp. Sci., 226, Springer Verlag, (1986).","DOI":"10.1007\/3-540-16761-7_54"},{"key":"21_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322358.322364","volume":"30","author":"G.N. Frederickson","year":"1983","unstructured":"G.N. Frederickson \"Implicit data structures for the dictionary problem\" J. Ass. Comp. Mach., 30,1, (1983).","journal-title":"J. Ass. Comp. Mach."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"G.Gambosi,E.Nardelli,M.Talamo \"A pointer-free data structure for merging heaps and min-max heaps\" Proc.16th ICALP Conf., Lect. Not. in Comp. Sci., 372, Springer Verlag, (1989).","DOI":"10.1007\/BFb0035773"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-0000(86)90040-1","volume":"33","author":"J.I. Munro","year":"1986","unstructured":"J.I. Munro \"An implicit data structure supporting insertion, deletion and search in O(log2n) time\" J. Comp. Syst. Sci., 33, 1, (1986).","journal-title":"J. Comp. Syst. Sci."},{"key":"21_CR7","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0022-0000(80)90037-9","volume":"21","author":"J.I. Munro","year":"1980","unstructured":"J.I. Munro, H. Suwanda \"Implicit data structures for fast search and update\" J. Comp. Syst. Sci., 21, 2, (1980).","journal-title":"J. Comp. Syst. Sci."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"J.R.Sack, T.Strothotte \"An algorithm for merging heaps\" Act. Inf., 22, (1985).","DOI":"10.1007\/BF00264229"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52048-1_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T03:03:34Z","timestamp":1640919814000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52048-1_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540520481","9783540468721"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-52048-1_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}