{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:27:34Z","timestamp":1758274054623},"reference-count":16,"publisher":"Elsevier BV","issue":"1-4","license":[{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1999,3]]},"DOI":"10.1016\/s0020-0255(99)80001-2","type":"journal-article","created":{"date-parts":[[2003,4,24]],"date-time":"2003-04-24T21:23:41Z","timestamp":1051219421000},"page":"41-52","source":"Crossref","is-referenced-by-count":1,"title":["Intersection reporting on two collections of disjoint sets"],"prefix":"10.1016","volume":"114","author":[{"given":"Carlo","family":"Gaibisso","sequence":"first","affiliation":[]},{"given":"Enrico","family":"Nardelli","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0255(99)80001-2_bib1","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1137\/0215072","article-title":"On the single operation worst-case time complexity of disjoint set union problems","volume":"15","author":"Blum","year":"1986","journal-title":"SIAM Journal on Computing"},{"issue":"7","key":"10.1016\/S0020-0255(99)80001-2_bib2","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/79204.79209","article-title":"Constraint logic programming languages","volume":"33","author":"Cohen","year":"1990","journal-title":"Communication of ACM"},{"key":"10.1016\/S0020-0255(99)80001-2_bib3","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0020-0255(99)80001-2_bib4","article-title":"Algorithms for the Set Union and Intersection Problem","author":"Gaibisso","year":"1995"},{"issue":"3","key":"10.1016\/S0020-0255(99)80001-2_bib5","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/116873.116878","article-title":"Data structures and algorithms for disjoint set union problems","volume":"23","author":"Galil","year":"1991","journal-title":"ACM Computing Surveys"},{"issue":"4","key":"10.1016\/S0020-0255(99)80001-2_bib6","first-page":"357","article-title":"An introduction to spatial database systems","volume":"3","author":"G\u00fcting","year":"1994","journal-title":"The VLDB Journal (special Issue on Spatial Database Systems)"},{"key":"10.1016\/S0020-0255(99)80001-2_bib7","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","article-title":"Constraint logic programming: A survey","volume":"19\u201320","author":"Jaffar","year":"1994","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0020-0255(99)80001-2_bib8","article-title":"Algorithmic issues in concurrent and constraints logic programming","author":"Nardelli","year":"1996"},{"key":"10.1016\/S0020-0255(99)80001-2_bib9","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0020-0255(99)80001-2_bib10","article-title":"Concurrent Constraint Programming Languages","author":"Saraswat","year":"1989"},{"key":"10.1016\/S0020-0255(99)80001-2_bib11","series-title":"17th ACM Symposium on Principles of Programming Languages (POPL'90)","article-title":"Concurrent constraint programming","author":"Saraswat","year":"1990"},{"key":"10.1016\/S0020-0255(99)80001-2_bib12","series-title":"Concurrent Constraint Programming","author":"Saraswat","year":"1993"},{"key":"10.1016\/S0020-0255(99)80001-2_bib13","series-title":"22nd LITP Spring School in Theoretical Computer Science","article-title":"Constraint Logic Programming: State of the art and research themes","author":"Smolta","year":"1995"},{"key":"10.1016\/S0020-0255(99)80001-2_bib14","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/0022-0000(79)90042-4","article-title":"A class of algorithms which require nonlinear time to maintain disjoint sets","volume":"18","author":"Tarjan","year":"1979","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"10.1016\/S0020-0255(99)80001-2_bib15","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/62.2160","article-title":"Worst-case analysis of set union algorithms","volume":"31","author":"Tarjan","year":"1984","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0020-0255(99)80001-2_bib16","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/359460.359478","article-title":"A data structure for manipulating priority queues","volume":"21","author":"Vuillemin","year":"1978","journal-title":"Comm. ACM"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025599800012?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025599800012?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:21:42Z","timestamp":1556043702000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025599800012"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":16,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["S0020025599800012"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(99)80001-2","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}