{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T01:10:08Z","timestamp":1683162608132},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1993,3]]},"DOI":"10.1007\/bf01990341","type":"journal-article","created":{"date-parts":[[2005,8,4]],"date-time":"2005-08-04T14:46:20Z","timestamp":1123166780000},"page":"29-45","source":"Crossref","is-referenced-by-count":3,"title":["An efficient implicit data structure for relation testing and searching in partially ordered sets"],"prefix":"10.1007","volume":"33","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","reference":[{"key":"BF01990341_CR1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0020-0190(84)90098-X","volume":"19","author":"H. Alt","year":"1984","unstructured":"H. Alt, K. Mehlhorn and J. I. Munro,Partial match retrieval in implicit data structures, Inf. Proc. Lett., 19, 1984, pp. 61\u201366.","journal-title":"Inf. Proc. Lett."},{"key":"BF01990341_CR2","first-page":"996","volume":"29","author":"M. D. Atkinson","year":"1986","unstructured":"M. D. Atkinson, J. R. Sack, N. Santoro and T. Strothotte,Min-max heaps and generalized priority queues, Comm. A.C.M., 29, 1986, pp. 996\u20131000.","journal-title":"Comm. A.C.M."},{"key":"BF01990341_CR3","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0304-3975(88)90018-7","volume":"58","author":"A. Borodin","year":"1988","unstructured":"A. Borodin, F. E. Fich, F. Meyer auf der Heide, E. Upfal and A. Wigderson,A tradeoff between search and update time for the implicit dictionary problem, Theoret. Comp. Sci., 58, 1988, pp. 57\u201368.","journal-title":"Theoret. Comp. Sci."},{"key":"BF01990341_CR4","doi-asserted-by":"crossref","first-page":"600","DOI":"10.2307\/2371374","volume":"63","author":"B. Dushnik","year":"1941","unstructured":"B. Dushnik and E. Miller,Partially ordered sets, Amer. J. Math., 63, 1941, pp. 600\u2013610.","journal-title":"Amer. J. Math."},{"key":"BF01990341_CR5","doi-asserted-by":"crossref","first-page":"80","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, 1983, pp. 80\u201394.","journal-title":"J. Ass. Comp. Mach."},{"key":"BF01990341_CR6","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0304-3975(91)90262-Z","volume":"84","author":"G. Gambosi","year":"1991","unstructured":"G. Gambosi, E. Nardelli and M. Talamo,A pointer-free data structure for merging heaps and min-max heaps, Theoret. Comp. Sci., 84, 1991, pp. 107\u2013126.","journal-title":"Theoret. Comp. Sci."},{"key":"BF01990341_CR7","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1007\/3-540-18088-5_35","volume":"267","author":"G. Gambosi","year":"1987","unstructured":"G. Gambosi, J. Ne\u0161etril and M. Talamo,Posets, boolean representation and quick path searching, Proc. 14th ICALP Conf., Lect. Not. in Comp. Sci., 267, Springer Verlag, 1987, pp. 404\u2013424.","journal-title":"Proc. 14th ICALP Conf., Lect. Not. in Comp. Sci."},{"key":"BF01990341_CR8","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0304-3975(90)90125-2","volume":"70","author":"G. Gambosi","year":"1990","unstructured":"G. Gambosi, J. Ne\u0161etril and M. Talamo,On locally presented posets, Theoret. Comp. Sci., 70, 1990, pp. 251\u2013260.","journal-title":"Theoret. Comp. Sci."},{"key":"BF01990341_CR9","doi-asserted-by":"crossref","unstructured":"G. Jacobson,Space-efficient static trees and graphs, Proc. 30th Symp. on Found. of Comp. Sci., 1989, pp. 549\u2013554.","DOI":"10.1109\/SFCS.1989.63533"},{"key":"BF01990341_CR10","doi-asserted-by":"crossref","unstructured":"S. Kannan, M. Naor and S. Rudich,Implicit representation of graphs, Proc. 20th Symp. on Theory of Computing, 1988, pp. 334\u2013343.","DOI":"10.1145\/62212.62244"},{"key":"BF01990341_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0028969","volume":"349","author":"F. Meyer","year":"1989","unstructured":"F. Meyer auf der Heide,On genuinely time bounded computations, Proc. 6th STACS, Lect. Not. in Comp. Sci., 349, Springer-Verlag, 1989, pp. 1\u201316.","journal-title":"Proc. 6th STACS, Lect. Not. in Comp. Sci."},{"key":"BF01990341_CR12","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0022-0000(86)90043-7","volume":"33","author":"J. I. Munro","year":"1986","unstructured":"J. I. Munro,An implicit data structure supporting insertion, deletion and search in O (log2 n)time, J. Comp. Syst. Sci., 33, 1986, pp. 66\u201374.","journal-title":"J. Comp. Syst. Sci."},{"key":"BF01990341_CR13","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0022-0000(80)90037-9","volume":"21","author":"J. I. Munro","year":"1980","unstructured":"J. I. Munro and H. Suwanda,Implicit data structures for fast search and update, J. Comp. Syst. Sci., 21, 1980, pp. 236\u2013250.","journal-title":"J. Comp. Syst. Sci."},{"key":"BF01990341_CR14","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF00264229","volume":"22","author":"J. R. Sack","year":"1985","unstructured":"J. R. Sack and T. Strothotte,An algorithm for merging heaps, Acta Inf., 22, 1985, pp. 171\u2013186.","journal-title":"Acta Inf."}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01990341.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01990341\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01990341","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T00:47:41Z","timestamp":1683161261000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01990341"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF01990341"],"URL":"https:\/\/doi.org\/10.1007\/bf01990341","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}