{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:59:08Z","timestamp":1725544748223},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11682462_17","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T11:50:30Z","timestamp":1140177030000},"page":"142-153","source":"Crossref","is-referenced-by-count":0,"title":["Optimally Adaptive Integration of Univariate Lipschitz Functions"],"prefix":"10.1007","author":[{"given":"Ilya","family":"Baran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dmitriy A.","family":"Katz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Werschulz, A.G.: An overview of information-based complexity. Technical Report CUCS- 022-02, Computer Science Department, Columbia University (2002)"},{"issue":"5","key":"17_CR2","first-page":"555","volume":"3","author":"L. Barabesi","year":"2003","unstructured":"Barabesi, L., Marcheselli, M.: A modified monte carlo integration. International Mathematical Journal\u00a03(5), 555\u2013565 (2003)","journal-title":"International Mathematical Journal"},{"key":"17_CR3","volume-title":"Methods of Numerical Integration","author":"P.J. Davis","year":"1984","unstructured":"Davis, P.J., Rabinowitz, P.: Methods of Numerical Integration, 2nd edn. Academic Press, San Diego (1984)","edition":"2"},{"key":"17_CR4","volume-title":"Information-Based Complexity","author":"J. Traub","year":"1988","unstructured":"Traub, J., Wasilkowski, G., Wo\u017aniakowski, H.: Information-Based Complexity. Academic Press, New York (1988)"},{"key":"17_CR5","unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A., Munro, J.I.: Adaptive set intersections, unions, and differences. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, pp. 743\u2013752 (2000)"},{"issue":"4","key":"17_CR6","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/S0022-0000(03)00026-6","volume":"66","author":"R. Fagin","year":"2003","unstructured":"Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. Journal of Computer and System Sciences\u00a066(4), 614\u2013656 (2003)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1\u20133","key":"17_CR7","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0304-3975(03)00422-5","volume":"310","author":"T. Biedl","year":"2004","unstructured":"Biedl, T., Brejova, B., Demaine, E.D., Hamel, A.M., L\u00f3pez-Ortiz, A., Vina\u0159, T.: Finding hidden independent sets in interval graphs. Theoretical Computer Science\u00a0310(1\u20133), 287\u2013307 (2004)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"17_CR8","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1287\/moor.16.2.334","volume":"16","author":"P. Hansen","year":"1991","unstructured":"Hansen, P., Jaumard, B., Lu, S.H.: On the number of iterations of piyavskii\u2019s global optimization algorithm. Mathematics of Operations Research\u00a016(2), 334\u2013350 (1991)","journal-title":"Mathematics of Operations Research"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0041-5553(72)90115-2","volume":"12","author":"S. Piyavskii","year":"1972","unstructured":"Piyavskii, S.: An algorithm for finding the absolute extremum of a function. USSR Computational Mathematics and Mathematical Physics\u00a012, 57\u201367 (1972)","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Baran, I., Demaine, E.D.: Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve. In: Proceedings of the 20th Annual ACMSymposium on Computational Geometry, Brooklyn, NY (2004) (to appear)","DOI":"10.1145\/997817.997852"},{"key":"17_CR11","unstructured":"Baran, I.: Adaptive algorithms for problems involving black-box lipschitz functions. Master\u2019s thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts (2004), http:\/\/www.mit.edu\/~ibaran\/papers\/mthesis.pdf,ps"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T00:18:34Z","timestamp":1555460314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11682462_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}