{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T13:51:19Z","timestamp":1648561879250},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,7,1]],"date-time":"1994-07-01T00:00:00Z","timestamp":773020800000},"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":[[1994,7]]},"DOI":"10.1016\/0020-0190(94)00052-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"31-34","source":"Crossref","is-referenced-by-count":1,"title":["Designing algorithms by expectations"],"prefix":"10.1016","volume":"51","author":[{"given":"Joseph","family":"Gil","sequence":"first","affiliation":[]},{"given":"Yossi","family":"Matias","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0020-0190(94)00052-2_BIB1","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/65950.65958","article-title":"Optimal bounds for decision problems on the CRCW PRAM","volume":"36","author":"Beame","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(94)00052-2_BIB2","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/0020-0190(94)00052-2_BIB3","first-page":"271","article-title":"Fast hashing on a PRAM - designing by expectation","author":"Gil","year":"1991","journal-title":"Proc. 2nd Ann. ACM-SIAM Symp. on Discrete Algorithms"},{"key":"10.1016\/0020-0190(94)00052-2_BIB4","first-page":"190","article-title":"Probabilistic recurrence relations","author":"Karp","year":"1991","journal-title":"Proc. 23rd Ann. ACM Symp. on Theory of Computing"},{"issue":"2","key":"10.1016\/0020-0190(94)00052-2_BIB5","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0022-0000(88)90027-X","article-title":"The complexity of parallel search","volume":"36","author":"Karp","year":"1988","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/0020-0190(94)00052-2_BIB6","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1137\/0220002","article-title":"Deterministic sampling - A new technique for fast pattern matching","volume":"20","author":"Vishkin","year":"1991","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000522?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000522?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:51:06Z","timestamp":1555145466000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094000522"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,7]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,7]]}},"alternative-id":["0020019094000522"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00052-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,7]]}}}