{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:30:08Z","timestamp":1725564608049},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212362"},{"type":"electronic","value":"9783540247494"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24749-4_44","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T19:01:54Z","timestamp":1283972514000},"page":"501-512","source":"Crossref","is-referenced-by-count":5,"title":["A Randomized Competitive Algorithm for Evaluating Priced AND\/OR Trees"],"prefix":"10.1007","author":[{"given":"Eduardo Sany","family":"Laber","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"44_CR1","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1145\/2402.322383","volume":"30","author":"M. Tarsi","year":"1983","unstructured":"Tarsi, M.: Optimal search on some game trees. Journal of the ACM\u00a030, 389\u2013396 (1983)","journal-title":"Journal of the ACM"},{"key":"44_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(85)90210-5","volume":"38","author":"M. Snir","year":"1985","unstructured":"Snir, M.: Lower bounds on probabilistic linear decision trees. Theoretical Computer Science\u00a038, 69\u201382 (1985)","journal-title":"Theoretical Computer Science"},{"key":"44_CR3","first-page":"29","volume-title":"27th Annual Symposium on Foundations of Computer Science","author":"M. Saks","year":"1986","unstructured":"Saks, M., Wigderson, A.: Probabilistic Boolean decision trees and the complexity of evaluating game trees. In: 27th Annual Symposium on Foundations of Computer Science, Toronto, Ontario, Canada, pp. 29\u201338. IEEE, Los Alamitos (1986)"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"Charikar, F., Guruswami, K., Raghavan, S.: Query strategies for priced information. JCSS: Journal of Computer and System Sciences\u00a064 (2002)","DOI":"10.1006\/jcss.2002.1828"},{"key":"44_CR5","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/292481.277627","volume":"23","author":"J.M. Hellerstein","year":"1998","unstructured":"Hellerstein, J.M.: Optimization techniques for queries with expensive methods. ACM Transactions on Database Systems\u00a023, 113\u2013157 (1998)","journal-title":"ACM Transactions on Database Systems"},{"key":"44_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/978-3-540-24698-5_5","volume-title":"LATIN 2004: Theoretical Informatics","author":"E. Laber","year":"2004","unstructured":"Laber, E., Carmo, R., Kohayakawa, Y.: Query priced information on database: The conjunctive case. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 6\u201315. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","STACS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24749-4_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T05:33:58Z","timestamp":1559626438000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24749-4_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212362","9783540247494"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24749-4_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}