{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T20:06:55Z","timestamp":1676837215429},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"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":10790,"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":[[1984]]},"DOI":"10.1016\/0304-3975(84)90104-x","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T21:44:32Z","timestamp":1034286272000},"page":"85-94","source":"Crossref","is-referenced-by-count":30,"title":["Coping with known patterns of lies in a search game"],"prefix":"10.1016","volume":"33","author":[{"given":"B.","family":"Ravikumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.B.","family":"Lakshmanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(84)90104-X_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(84)90104-X_BIB2","series-title":"Error Correcting Codes","first-page":"61","article-title":"Block coding for the binary symmetric channel with noiseless, delayless feedback","author":"Berlekamp","year":"1968"},{"key":"10.1016\/0304-3975(84)90104-X_BIB3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1145\/322123.322128","article-title":"A counting approach to lower bounds for selection problems","volume":"26","author":"Fussenegger","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(84)90104-X_BIB4","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF00263588","article-title":"Performance bounds on the splitting algorithm for binary testing","volume":"3","author":"Garey","year":"1974","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(84)90104-X_BIB5","series-title":"A Survey of Combinatorial Theory","first-page":"285","article-title":"Combinatorial search problems","author":"Katona","year":"1973"},{"key":"10.1016\/0304-3975(84)90104-X_BIB6","series-title":"Introduction to Combinatorial Mathematics","author":"Liu","year":"1968"},{"key":"10.1016\/0304-3975(84)90104-X_BIB7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0012-365X(77)90149-2","article-title":"The game of N questions on a tree","volume":"17","author":"Rivest","year":"1977","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(84)90104-X_BIB8","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/0022-0000(80)90014-8","article-title":"Coping with errors in binary search procedures","volume":"20","author":"Rivest","year":"1980","journal-title":"J. Comput. System Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758490104X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758490104X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:59:06Z","timestamp":1555192746000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439758490104X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984]]}},"alternative-id":["030439758490104X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(84)90104-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1984]]}}}