{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T20:32:44Z","timestamp":1680467564109},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,4,11]],"date-time":"2013-04-11T00:00:00Z","timestamp":1365638400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s00453-013-9772-5","type":"journal-article","created":{"date-parts":[[2013,4,10]],"date-time":"2013-04-10T19:04:22Z","timestamp":1365620662000},"page":"234-246","source":"Crossref","is-referenced-by-count":3,"title":["Approximately Uniform Online Checkpointing with Bounded Memory"],"prefix":"10.1007","volume":"67","author":[{"given":"Lauri","family":"Ahlroth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olli","family":"Pottonen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Schumacher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,4,11]]},"reference":[{"key":"9772_CR1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ipl.2008.09.008","volume":"109","author":"T. Asano","year":"2008","unstructured":"Asano, T.: Online uniformity of integer points on a line. Inf. Process. Lett. 109, 57\u201360 (2008). doi: 10.1016\/j.ipl.2008.09.008","journal-title":"Inf. Process. Lett."},{"key":"9772_CR2","first-page":"1","volume-title":"Proc. 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2002)","author":"B. Babcock","year":"2002","unstructured":"Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: Proc. 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2002), pp. 1\u201316. ACM, New York (2002). doi: 10.1145\/543613.543615"},{"key":"9772_CR3","series-title":"Proceedings in Applied Mathematics","volume-title":"Computational Differentiation: Techniques, Applications, and Tools","author":"J. Benary","year":"1996","unstructured":"Benary, J.: Parallelism in the reverse mode. In: Computational Differentiation: Techniques, Applications, and Tools. Proceedings in Applied Mathematics. SIAM, Philadelphia (1996)"},{"key":"9772_CR4","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1137\/S1064827595294678","volume":"19","author":"M. Berggren","year":"1998","unstructured":"Berggren, M.: Numerical solution of a flow-control problem: vorticity reduction by dynamic boundary action. SIAM J. Sci. Comput. 19, 829\u2013860 (1998). doi: 10.1137\/S1064827595294678","journal-title":"SIAM J. Sci. Comput."},{"key":"9772_CR5","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01294262","volume":"11","author":"M. Bern","year":"1994","unstructured":"Bern, M., Greene, D.H., Raghunathan, A., Sudan, M.: On-line algorithms for locating checkpoints. Algorithmica 11, 33\u201352 (1994). doi: 10.1007\/BF01294262","journal-title":"Algorithmica"},{"key":"9772_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511626371","volume-title":"The Discrepancy Method: Randomness and Complexity","author":"B. Chazelle","year":"2000","unstructured":"Chazelle, B.: The Discrepancy Method: Randomness and Complexity. Cambridge University Press, Cambridge (2000)"},{"key":"9772_CR7","volume-title":"Uniform Distribution of Sequences","author":"L. Kuipers","year":"2006","unstructured":"Kuipers, L., Niederreiter, H.: Uniform Distribution of Sequences. Dover, New York (2006)"},{"key":"9772_CR8","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1561\/0400000002","volume":"1","author":"S. Muthukrishnan","year":"2005","unstructured":"Muthukrishnan, S.: Data streams: algorithms and applications. Found. Trends Theor. Comput. Sci. 1, 117\u2013236 (2005)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"9772_CR9","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1109\/32.57620","volume":"16","author":"V. Nicola","year":"1990","unstructured":"Nicola, V., van Spanje, J.: Comparative analysis of different models of checkpointing and recovery. IEEE Trans. Softw. Eng. 16, 807\u2013821 (1990). doi: 10.1109\/32.57620","journal-title":"IEEE Trans. Softw. Eng."},{"key":"9772_CR10","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970081","volume-title":"Random Number Generation and Quasi-Monte Carlo Methods","author":"H. Niederreiter","year":"1992","unstructured":"Niederreiter, H.: Random Number Generation and Quasi-Monte Carlo Methods. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (1992)"},{"key":"9772_CR11","doi-asserted-by":"crossref","first-page":"1946","DOI":"10.1137\/080718036","volume":"31","author":"P. Stumm","year":"2009","unstructured":"Stumm, P., Walther, A.: Multistage approaches for optimal offline checkpointing. SIAM J. Sci. Comput. 31, 1946\u20131967 (2009). doi: 10.1137\/080718036","journal-title":"SIAM J. Sci. Comput."},{"key":"9772_CR12","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1137\/080742439","volume":"32","author":"P. Stumm","year":"2010","unstructured":"Stumm, P., Walther, A.: New algorithms for optimal online checkpointing. SIAM J. Sci. Comput. 32, 836\u2013854 (2010). doi: 10.1137\/080742439","journal-title":"SIAM J. Sci. Comput."},{"key":"9772_CR13","doi-asserted-by":"crossref","first-page":"2348","DOI":"10.1093\/ietisy\/e89-d.8.2348","volume":"89-D","author":"S. Teramoto","year":"2006","unstructured":"Teramoto, S., Asano, T., Doerr, B., Katoh, N.: Inserting points uniformly at every instance. IEICE Trans. Inf. Syst. 89-D, 2348\u20132356 (2006). doi: 10.1093\/ietisy\/e89-d.8.2348","journal-title":"IEICE Trans. Inf. Syst."},{"key":"9772_CR14","first-page":"813","volume":"38","author":"J.G. Corput van der","year":"1935","unstructured":"van der Corput, J.G.: Verteilungsfunktionen. Proc. K. Ned. Akad. Wet. 38, 813\u2013821 (1935)","journal-title":"Proc. K. Ned. Akad. Wet."},{"key":"9772_CR15","first-page":"135","volume":"73","author":"A. Walther","year":"2004","unstructured":"Walther, A.: Bounding the number of processors and checkpoints needed in time-minimal parallel reversal schedules. Computing 73, 135\u2013154 (2004). doi: 10.1007\/s00607-004-0075-1","journal-title":"Computing"},{"key":"9772_CR16","doi-asserted-by":"crossref","first-page":"976","DOI":"10.1109\/12.620479","volume":"46","author":"A. Ziv","year":"1997","unstructured":"Ziv, A., Bruck, J.: An on-line algorithm for checkpoint placement. IEEE Trans. Comput. 46, 976\u2013985 (1997). doi: 10.1009\/12.620479","journal-title":"IEEE Trans. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9772-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9772-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9772-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:12Z","timestamp":1559137512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9772-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,11]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9772"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9772-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,11]]}}}