{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T01:10:40Z","timestamp":1772068240594,"version":"3.50.1"},"reference-count":4,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"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":6894,"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":[[1994,9]]},"DOI":"10.1016\/0304-3975(94)90181-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"415-429","source":"Crossref","is-referenced-by-count":12,"title":["Randomization, derandomization and antirandomization: three games"],"prefix":"10.1016","volume":"131","author":[{"given":"J.","family":"Spencer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90181-3_BIB1","series-title":"The Probabilistic Method","author":"Alon","year":"1992"},{"key":"10.1016\/0304-3975(94)90181-3_BIB2","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","article-title":"Probabilistic construction of deterministic algorithms: approximating packiing integer programs","volume":"37","author":"Raghavan","year":"1988","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0304-3975(94)90181-3_BIB3","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1090\/S0002-9947-1985-0784009-0","article-title":"Six standard deviations suffice","volume":"289","author":"Spencer","year":"1985","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(94)90181-3_BIB4","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0304-3975(92)90270-P","article-title":"Ulam's searching problem with a fixed number of lies","volume":"95","author":"Spencer","year":"1992","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901813?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901813?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:28:24Z","timestamp":1555129704000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594901813"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["0304397594901813"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90181-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}