{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T18:00:37Z","timestamp":1718301637509},"reference-count":16,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9694,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1987]]},"DOI":"10.1016\/0304-3975(87)90010-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"267-282","source":"Crossref","is-referenced-by-count":6,"title":["A probabilistic distributed algorithm for set intersection and its analysis"],"prefix":"10.1016","volume":"49","author":[{"given":"Thomas G.","family":"Kurtz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Udi","family":"Manber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(87)90010-7_BIB1","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","article-title":"Universal classes of hash functions","volume":"18","author":"Carter","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(87)90010-7_BIB2","unstructured":"T. Darden and T.G. Kurtz, Nearly deterministic Markov processes near a stable point (to appear)."},{"key":"10.1016\/0304-3975(87)90010-7_BIB3","first-page":"76","article-title":"Probabilistic counting","author":"Flajolet","year":"1983","journal-title":"Proc. 24th Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(87)90010-7_BIB4","series-title":"Martingale Limit Theory and its Applications","author":"Hall","year":"1980"},{"key":"10.1016\/0304-3975(87)90010-7_BIB5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BFb0120765","article-title":"Limit theorems and diffusion approximations for density dependent Markov chains","volume":"5","author":"Kurtz","year":"1976","journal-title":"Math. Programming Stud."},{"key":"10.1016\/0304-3975(87)90010-7_BIB6","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-4149(78)90020-0","article-title":"Strong approximations theorems for density dependent Markov chains","volume":"6","author":"Kurtz","year":"1978","journal-title":"Stochastic Process. Appl."},{"key":"10.1016\/0304-3975(87)90010-7_BIB7","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0020-0190(84)90129-7","article-title":"A probabilistic lower bound for checking disjointness of sets","volume":"19","author":"Manber","year":"1984","journal-title":"Inform. Process Lett."},{"key":"10.1016\/0304-3975(87)90010-7_BIB8","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1145\/3828.3838","article-title":"The complexity of problems on probabilistic, nondeterministic, and alternating decision trees","volume":"32","author":"Manber","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(87)90010-7_BIB9","first-page":"330","article-title":"Las Vegas is better than determinism in VLSI and distributed computing","author":"Mehlhorn","year":"1982","journal-title":"Proc. 14th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(87)90010-7_BIB10","doi-asserted-by":"crossref","first-page":"938","DOI":"10.1145\/4221.4259","article-title":"Applications of Ramsey's Theorem to decision tree complexity","volume":"32","author":"Moran","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(87)90010-7_BIB11","series-title":"Tech. Rept. TR-15\u201381","article-title":"Fingerprinting by random polynomials","author":"Rabin","year":"1981"},{"key":"10.1016\/0304-3975(87)90010-7_BIB12","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1145\/321724.321730","article-title":"On the optimality of some set algorithms","volume":"19","author":"Reingold","year":"1972","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(87)90010-7_BIB13","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0022-0000(82)90045-9","article-title":"Finding the median distributively","author":"Rodeh","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(87)90010-7_BIB14","series-title":"Introduction to Stochastic Dynamic Programming","author":"Ross","year":"1983"},{"key":"10.1016\/0304-3975(87)90010-7_BIB15","first-page":"118","article-title":"The complexity of approximate counting","author":"Stockmeyer","year":"1983","journal-title":"Proc. 15th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(87)90010-7_BIB16","first-page":"175","article-title":"New classes and applications of hash functions","author":"Wegman","year":"1979","journal-title":"Proc. 20th Ann. Symp. on Foundations of Computer Science"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587900107?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587900107?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:51:37Z","timestamp":1555113097000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397587900107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":16,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1987]]}},"alternative-id":["0304397587900107"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(87)90010-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1987]]}}}