{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T20:11:54Z","timestamp":1672690314894},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1984,7,1]],"date-time":"1984-07-01T00:00:00Z","timestamp":457488000000},"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 Processing Letters"],"published-print":{"date-parts":[[1984,7]]},"DOI":"10.1016\/0020-0190(84)90129-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:20:15Z","timestamp":1027657215000},"page":"51-53","source":"Crossref","is-referenced-by-count":3,"title":["A probabilistic lower bound for checking disjointness of sets"],"prefix":"10.1016","volume":"19","author":[{"given":"Udi","family":"Manber","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(84)90129-7_BIB1","series-title":"Information Processing '77","first-page":"839","article-title":"Probabilistic Machines Can Use Less Running Time","author":"Freivalds","year":"1977"},{"key":"10.1016\/0020-0190(84)90129-7_BIB2","first-page":"365","article-title":"Probabilistic encryption & how to play mental poker keeping secret all partial information","author":"Goldwasser","year":"1982","journal-title":"14th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(84)90129-7_BIB3","first-page":"234","article-title":"Probabilistic, nondeterministic, and alternating decision trees","author":"Manber","year":"1982","journal-title":"14th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(84)90129-7_BIB4","first-page":"330","article-title":"Las Vegas is better than determinism in VLSI and distributed computing","author":"Mehlhorn","year":"1982","journal-title":"14th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(84)90129-7_BIB5","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1137\/0209024","article-title":"Probabilistic algorithms in finite fields","volume":"9","author":"Rabin","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(84)90129-7_BIB6","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\/0020-0190(84)90129-7_BIB7","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/0206006","article-title":"A fast Monte Carlo test for primarity","volume":"6","author":"Solovay","year":"1977","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019084901297?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019084901297?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:53:06Z","timestamp":1555073586000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019084901297"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,7]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,7]]}},"alternative-id":["0020019084901297"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(84)90129-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1984,7]]}}}