{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T05:58:01Z","timestamp":1768715881686,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,6,7]],"date-time":"2015-06-07T00:00:00Z","timestamp":1433635200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Science Centre, Poland","award":["DEC-2013\/09\/B\/ST1\/04275"],"award-info":[{"award-number":["DEC-2013\/09\/B\/ST1\/04275"]}]},{"name":"National Science Centre, Poland","award":["DEC-2013\/09\/B\/ST1\/04275"],"award-info":[{"award-number":["DEC-2013\/09\/B\/ST1\/04275"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s11075-015-0006-6","type":"journal-article","created":{"date-parts":[[2015,6,5]],"date-time":"2015-06-05T23:21:44Z","timestamp":1433546504000},"page":"505-518","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On the optimal robust solution of IVPs with noisy information"],"prefix":"10.1007","volume":"71","author":[{"given":"Boles\u0142aw","family":"Kacewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Przyby\u0142owicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,7]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/j.jco.2010.07.002","volume":"27","author":"T Daun","year":"2011","unstructured":"Daun, T.: On the randomized solution of initial value problems. J. Complexity 27, 300\u2013311 (2011)","journal-title":"J. Complexity"},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.jco.2007.09.002","volume":"24","author":"S Heinrich","year":"2008","unstructured":"Heinrich, S., Milla, B.: The randomized complexity of initial value problems. J. Complexity 24, 77\u201388 (2008)","journal-title":"J. Complexity"},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF01379663","volume":"45","author":"B Kacewicz","year":"1984","unstructured":"Kacewicz, B.: How to increase the order to get minimal-error algorithms for systems of ODE. Numer. Math. 45, 93\u2013104 (1984)","journal-title":"Numer. Math."},{"key":"6_CR4","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/0885-064X(88)90016-7","volume":"4","author":"B Kacewicz","year":"1988","unstructured":"Kacewicz, B.: Minimum asymptotic error of algorithms for solving ODE. J. Complexity 4, 373\u2013389 (1988)","journal-title":"J. Complexity"},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1016\/j.jco.2006.03.001","volume":"22","author":"B Kacewicz","year":"2006","unstructured":"Kacewicz, B.: Almost optimal solution of initial-value problems by randomized and quantum algorithms. J. Complexity 22, 676\u2013690 (2006)","journal-title":"J. Complexity"},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0885-064X(88)90009-X","volume":"4","author":"B Kacewicz","year":"1988","unstructured":"Kacewicz, B., Milanese, M., Vicino, A.: Conditionally optimal algorithms and estimation of reduced order models. J. Complexity 4, 73\u201385 (1988)","journal-title":"J. Complexity"},{"key":"6_CR7","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1006\/jcom.1993.1008","volume":"9","author":"B Kacewicz","year":"1993","unstructured":"Kacewicz, B., Plaskota, L.: The minimal cost of approximating linear operators using perturbed information \u2013 the asymptotic setting. J. Complexity 9, 113\u2013134 (1993)","journal-title":"J. Complexity"},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.jco.2014.07.002","volume":"31","author":"B Kacewicz","year":"2015","unstructured":"Kacewicz, B., Przyby\u0142owicz, P.: Complexity of the derivative-free solution of systems of IVPs with unknown singularity hypersurface. J. Complexity 31, 75\u201397 (2015)","journal-title":"J. Complexity"},{"key":"6_CR9","volume-title":"Deterministic and stochastic error bounds in numerical analysis, Lecture Notes in Math","author":"E Novak","year":"1349","unstructured":"Novak, E.: Deterministic and stochastic error bounds in numerical analysis, Lecture Notes in Math. Springer, Berlin (1349)"},{"key":"6_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511600814","volume-title":"Noisy information and computational complexity","author":"L Plaskota","year":"1996","unstructured":"Plaskota, L.: Noisy information and computational complexity. Cambridge University Press, Cambridge (1996a)"},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1006\/jcom.1996.0026","volume":"12","author":"L Plaskota","year":"1996","unstructured":"Plaskota, L.: Worst case complexity of problems with random information noise. J. Complexity 12, 416\u2013439 (1996b)","journal-title":"J. Complexity"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Plaskota, L.: Noisy information: optimality, complexity, tractability. In: Dick, J., Kuo, F.Y., Peters, G.W., Sloan, I.H. (eds.) Monte Carlo and quasi-Monte Carlo Methods, pp. 173\u2013209. Springer (2012)","DOI":"10.1007\/978-3-642-41095-6_7"},{"key":"6_CR13","volume-title":"Information\u2013based complexity","author":"JF Traub","year":"1988","unstructured":"Traub, J.F., Wasilkowski, G.W., Wo\u017aniakowski, H.: Information\u2013based complexity. Academic, New York (1988)"},{"key":"6_CR14","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1006\/jcom.1996.0027","volume":"12","author":"AG Werschulz","year":"1996","unstructured":"Werschulz, A.G.: The complexity of definite elliptic problems with noisy data. J. Complexity 12, 440\u2013473 (1996)","journal-title":"J. Complexity"},{"key":"6_CR15","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1006\/jcom.1997.0456","volume":"13","author":"AG Werschulz","year":"1997","unstructured":"Werschulz, A.G.: The complexity of indefinite elliptic problems with noisy data. J. Complexity 13, 457\u2013479 (1997)","journal-title":"J. Complexity"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-015-0006-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-015-0006-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-015-0006-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T04:27:34Z","timestamp":1566793654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-015-0006-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,7]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["6"],"URL":"https:\/\/doi.org\/10.1007\/s11075-015-0006-6","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,7]]}}}