{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T02:35:39Z","timestamp":1648866939873},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"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":5860,"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":[[1997,7]]},"DOI":"10.1016\/s0304-3975(96)00279-4","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"347-356","source":"Crossref","is-referenced-by-count":1,"title":["A 32log 3-competitive algorithm for the counterfeit coin problem"],"prefix":"10.1016","volume":"181","author":[{"given":"Peng-Jun","family":"Wan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qifan","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dean","family":"Kelley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00279-4_BIB1","doi-asserted-by":"crossref","first-page":"136","DOI":"10.2307\/2312882","article-title":"Balance scale sorting","volume":"70","author":"Cairns","year":"1963","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0304-3975(96)00279-4_BIB2","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1137\/S0097539793246690","article-title":"On competitive group testing","volume":"23","author":"Du","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(96)00279-4_BIB3","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0020-0190(94)90122-8","article-title":"A new competitive algorithm for the counterfeit coin problem","volume":"51","author":"Hu","year":"1994","journal-title":"Inform. Process Lett."},{"key":"10.1016\/S0304-3975(96)00279-4_BIB4","series-title":"A competitive algorithm for the counterfeit coin problem","author":"Hu","year":"1992"},{"key":"10.1016\/S0304-3975(96)00279-4_BIB5","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Comm. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002794?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002794?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:25:40Z","timestamp":1556508340000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596002794"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,7]]}},"alternative-id":["S0304397596002794"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00279-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,7]]}}}