{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T15:20:41Z","timestamp":1771514441395,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319286839","type":"print"},{"value":"9783319286846","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-28684-6_15","type":"book-chapter","created":{"date-parts":[[2016,1,12]],"date-time":"2016-01-12T10:32:03Z","timestamp":1452594723000},"page":"170-182","source":"Crossref","is-referenced-by-count":4,"title":["On the Smoothness of Paging Algorithms"],"prefix":"10.1007","author":[{"given":"Jan","family":"Reineke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"Salinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,13]]},"reference":[{"issue":"2","key":"15_CR1","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"5","author":"LA Belady","year":"1966","unstructured":"Belady, L.A.: A study of replacement algorithms for virtual-storage computer. IBM Syst. J. 5(2), 78\u2013101 (1966)","journal-title":"IBM Syst. J."},{"issue":"2","key":"15_CR2","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1147\/sj.92.0078","volume":"9","author":"RL Mattson","year":"1970","unstructured":"Mattson, R.L., Gecsei, J., Slutz, D.R., Traiger, I.L.: Evaluation techniques for storage hierarchies. IBM Syst. J. 9(2), 78\u2013117 (1970)","journal-title":"IBM Syst. J."},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/321623.321632","volume":"18","author":"A Aho","year":"1971","unstructured":"Aho, A., Denning, P., Ullman, J.: Principles of optimal page replacement. J. ACM 18(1), 80\u201393 (1971)","journal-title":"J. ACM"},{"issue":"2","key":"15_CR4","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1985)","journal-title":"Commun. ACM"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1007\/BF01759073","volume":"6","author":"L McGeoch","year":"1991","unstructured":"McGeoch, L., Sleator, D.: A strongly competitive randomized paging algorithm. Algorithmica 6, 816\u2013825 (1991). doi:\n                    10.1007\/BF01759073","journal-title":"Algorithmica"},{"issue":"1\u20132","key":"15_CR6","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0304-3975(98)00116-9","volume":"234","author":"D Achlioptas","year":"2000","unstructured":"Achlioptas, D., Chrobak, M., Noga, J.: Competitive analysis of randomized paging algorithms. Theoret. Comput. Sci. 234(1\u20132), 203\u2013218 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"15_CR7","doi-asserted-by":"publisher","first-page":"36:1","DOI":"10.1145\/1347375.1347389","volume":"7","author":"R Wilhelm","year":"2008","unstructured":"Wilhelm, R., et al.: The worst-case execution-time problem-overview of methods and survey of tools. ACM Trans. Embed. Comput. Syst. 7(3), 36:1\u201336:53 (2008)","journal-title":"ACM Trans. Embed. Comput. Syst."},{"issue":"4","key":"15_CR8","doi-asserted-by":"publisher","first-page":"82:1","DOI":"10.1145\/2560033","volume":"13","author":"P Axer","year":"2014","unstructured":"Axer, P., et al.: Building timing predictable embedded systems. ACM Trans. Embed. Comput. Syst. 13(4), 82:1\u201382:37 (2014)","journal-title":"ACM Trans. Embed. Comput. Syst."},{"issue":"8","key":"15_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/2240236.2240262","volume":"55","author":"S Chaudhuri","year":"2012","unstructured":"Chaudhuri, S., Gulwani, S., Lublinerman, R.: Continuity and robustness of programs. Commun. ACM 55(8), 107\u2013115 (2012)","journal-title":"Commun. ACM"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11787006_1","volume-title":"Automata, Languages and Programming","author":"C Dwork","year":"2006","unstructured":"Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 1\u201312. Springer, Heidelberg (2006)"},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/2756550","volume":"18","author":"G Doychev","year":"2015","unstructured":"Doychev, G., et al.: CacheAudit: a tool for the static analysis of cache side channels. ACM Trans. Inf. Syst. Secur. 18(1), 4:1\u20134:32 (2015)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Doyen, L., Henzinger, T., Legay, A., Nickovic, D.: Robustness of sequential circuits. In: ACSD 2010, pp. 77\u201384 (2010)","DOI":"10.1109\/ACSD.2010.26"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Kleene, S.: Representation of events in nerve nets and finite automata. In: Automata Studies, Princeton University Press, Princeton (1956)","DOI":"10.1515\/9781400882618-002"},{"issue":"3","key":"15_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1109\/PGEC.1963.263534","volume":"12","author":"M Perles","year":"1963","unstructured":"Perles, M., Rabin, M., Shamir, E.: The theory of definite automata. IEEE Trans. Electron. Comput. 12(3), 233\u2013243 (1963)","journal-title":"IEEE Trans. Electron. Comput."},{"key":"15_CR15","unstructured":"Liu, C.L.: Some memory aspects of finite automata. Technical report 411, Massachusetts Institute of Technology, May 1963"},{"issue":"1s","key":"15_CR16","doi-asserted-by":"publisher","first-page":"42:1","DOI":"10.1145\/2435227.2435238","volume":"12","author":"J Reineke","year":"2013","unstructured":"Reineke, J., Grund, D.: Sensitivity of cache replacement policies. ACM Trans. Embed. Comput. Syst. 12(1s), 42:1\u201342:18 (2013)","journal-title":"ACM Trans. Embed. Comput. Syst."},{"issue":"2s","key":"15_CR17","doi-asserted-by":"publisher","first-page":"94:1","DOI":"10.1145\/2465787.2465796","volume":"12","author":"FJ Cazorla","year":"2013","unstructured":"Cazorla, F.J., et al.: PROARTIS: probabilistically analyzable real-time systems. ACM Trans. Embed. Comput. Syst. 12(2s), 94:1\u201394:26 (2013)","journal-title":"ACM Trans. Embed. Comput. Syst."},{"key":"15_CR18","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, New York (1998)"},{"issue":"4","key":"15_CR19","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/0196-6774(91)90041-V","volume":"12","author":"A Fiat","year":"1991","unstructured":"Fiat, A., Karp, R.M., Luby, M., McGeoch, L.A., Sleator, D.D., Young, N.E.: Competitive paging algorithms. J. Algorithms 12(4), 685\u2013699 (1991)","journal-title":"J. Algorithms"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Reineke, J., Salinger, A.: On the smoothness of paging algorithms, October 2015. \n                    arxiv:1510.03362","DOI":"10.1007\/978-3-319-28684-6_15"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-28684-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T09:37:26Z","timestamp":1559381846000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28684-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319286839","9783319286846"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28684-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}