Lykouris, Thodoris; Vassilvitskii, Sergei Competitive caching with machine learned advice. (English) Zbl 1499.68415 J. ACM 68, No. 4, Paper No. 24, 25 p. (2021). MSC: 68W27 68T05 PDF BibTeX XML Cite \textit{T. Lykouris} and \textit{S. Vassilvitskii}, J. ACM 68, No. 4, Paper No. 24, 25 p. (2021; Zbl 1499.68415) Full Text: DOI arXiv OpenURL
Azar, Yossi; Ganesh, Arun; Ge, Rong; Panigrahi, Debmalya Online service with delay. (English) Zbl 07475103 ACM Trans. Algorithms 17, No. 3, Article No. 23, 31 p. (2021). MSC: 68-XX PDF BibTeX XML Cite \textit{Y. Azar} et al., ACM Trans. Algorithms 17, No. 3, Article No. 23, 31 p. (2021; Zbl 07475103) Full Text: DOI OpenURL
Katz, Dmitriy; Schieber, Baruch; Shachnai, Hadas Flexible resource allocation to interval jobs. (English) Zbl 1425.90045 Algorithmica 81, No. 8, 3217-3244 (2019). MSC: 90B35 68Q17 68W25 PDF BibTeX XML Cite \textit{D. Katz} et al., Algorithmica 81, No. 8, 3217--3244 (2019; Zbl 1425.90045) Full Text: DOI arXiv OpenURL
Angelopoulos, Spyros; Dorrigiv, Reza; López-Ortiz, Alejandro On the separation and equivalence of paging strategies and other online algorithms. (English) Zbl 1418.68246 Algorithmica 81, No. 3, 1152-1179 (2019). MSC: 68W27 68W40 PDF BibTeX XML Cite \textit{S. Angelopoulos} et al., Algorithmica 81, No. 3, 1152--1179 (2019; Zbl 1418.68246) Full Text: DOI HAL OpenURL
Reineke, Jan; Salinger, Alejandro On the smoothness of paging algorithms. (English) Zbl 1390.68772 Theory Comput. Syst. 62, No. 2, 366-418 (2018). MSC: 68W27 68M20 68W20 PDF BibTeX XML Cite \textit{J. Reineke} and \textit{A. Salinger}, Theory Comput. Syst. 62, No. 2, 366--418 (2018; Zbl 1390.68772) Full Text: DOI arXiv OpenURL
Azar, Yossi; Ganesh, Arun; Ge, Rong; Panigrahi, Debmalya Online service with delay. (English) Zbl 1370.68332 Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 551-563 (2017). MSC: 68W27 90C27 PDF BibTeX XML Cite \textit{Y. Azar} et al., in: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC '17, Montreal, QC, Canada, June 19--23, 2017. New York, NY: Association for Computing Machinery (ACM). 551--563 (2017; Zbl 1370.68332) Full Text: DOI arXiv OpenURL
Böckenhauer, Hans-Joachim; Komm, Dennis; Královič, Rastislav; Královič, Richard; Mömke, Tobias Online algorithms with advice: the tape model. (English) Zbl 1370.68334 Inf. Comput. 254, Part 1, 59-83 (2017). MSC: 68W27 68Q05 90B35 PDF BibTeX XML Cite \textit{H.-J. Böckenhauer} et al., Inf. Comput. 254, Part 1, 59--83 (2017; Zbl 1370.68334) Full Text: DOI OpenURL
Lee, Mun-Kyu; Michaud, Pierre; Sim, Jeong Seop; Nyang, DaeHun A simple proof of optimality for the MIN cache replacement policy. (English) Zbl 1347.68379 Inf. Process. Lett. 116, No. 2, 168-170 (2016). MSC: 68W40 68N25 PDF BibTeX XML Cite \textit{M.-K. Lee} et al., Inf. Process. Lett. 116, No. 2, 168--170 (2016; Zbl 1347.68379) Full Text: DOI Link OpenURL
Kovács, Annamária; Meyer, Ulrich; Moruz, Gabriel; Negoescu, Andrei The optimal structure of algorithms for \(\alpha\)-paging. (English) Zbl 1338.68064 Inf. Process. Lett. 115, No. 12, 932-938 (2015). MSC: 68P20 68W27 PDF BibTeX XML Cite \textit{A. Kovács} et al., Inf. Process. Lett. 115, No. 12, 932--938 (2015; Zbl 1338.68064) Full Text: DOI OpenURL
Dorrigiv, Reza; Ehmsen, Martin R.; López-Ortiz, Alejandro Parameterized analysis of paging and list update algorithms. (English) Zbl 1314.68408 Algorithmica 71, No. 2, 330-353 (2015). MSC: 68W27 68W20 68W40 PDF BibTeX XML Cite \textit{R. Dorrigiv} et al., Algorithmica 71, No. 2, 330--353 (2015; Zbl 1314.68408) Full Text: DOI OpenURL
Epstein, Leah; Imreh, Csanád; Levin, Asaf; Nagy-György, Judit Online file caching with rejection penalties. (English) Zbl 1315.68289 Algorithmica 71, No. 2, 279-306 (2015). MSC: 68W27 68P20 68W20 PDF BibTeX XML Cite \textit{L. Epstein} et al., Algorithmica 71, No. 2, 279--306 (2015; Zbl 1315.68289) Full Text: DOI OpenURL
Brodal, Gerth Stølting; Moruz, Gabriel; Negoescu, Andrei OnlineMin: a fast strongly competitive randomized paging algorithm. (English) Zbl 1328.68311 Theory Comput. Syst. 56, No. 1, 22-40 (2015). MSC: 68W27 68W20 PDF BibTeX XML Cite \textit{G. S. Brodal} et al., Theory Comput. Syst. 56, No. 1, 22--40 (2015; Zbl 1328.68311) Full Text: DOI OpenURL
Boyar, Joan; Gupta, Sushmita; Larsen, Kim S. Relative interval analysis of paging algorithms on access graphs. (English) Zbl 1312.68235 Theor. Comput. Sci. 568, 28-48 (2015). MSC: 68W27 PDF BibTeX XML Cite \textit{J. Boyar} et al., Theor. Comput. Sci. 568, 28--48 (2015; Zbl 1312.68235) Full Text: DOI OpenURL
Azar, Yossi; Englert, Matthias; Gamzu, Iftah; Kidron, Eytan Generalized reordering buffer management. (English) Zbl 1359.68033 Mayr, Ernst W. (ed.) et al., 31st international symposium on theoretical aspects of computer science, STACS’ 14, Lyon, France, March 5–8, 2014. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-65-1). LIPIcs – Leibniz International Proceedings in Informatics 25, 87-98 (2014). MSC: 68M20 68W20 68W27 PDF BibTeX XML Cite \textit{Y. Azar} et al., LIPIcs -- Leibniz Int. Proc. Inform. 25, 87--98 (2014; Zbl 1359.68033) Full Text: DOI OpenURL
Moruz, Gabriel; Negoescu, Andrei; Neumann, Christian; Weichert, Volker Engineering efficient paging algorithms. (English) Zbl 1347.68373 ACM J. Exp. Algorithm. 19, Spec. Iss. 1, Article No. 2.4, 19 p. (2014). MSC: 68W27 68N25 68W40 PDF BibTeX XML Cite \textit{G. Moruz} et al., ACM J. Exp. Algorithm. 19, Article No. 2.4, 19 p. (2014; Zbl 1347.68373) Full Text: DOI OpenURL
Bilardi, Gianfranco; Versaci, Francesco Optimal eviction policies for stochastic address traces. (English) Zbl 1277.68022 Theor. Comput. Sci. 514, 36-60 (2013). MSC: 68M07 68Q87 60K30 60J20 PDF BibTeX XML Cite \textit{G. Bilardi} and \textit{F. Versaci}, Theor. Comput. Sci. 514, 36--60 (2013; Zbl 1277.68022) Full Text: DOI arXiv OpenURL
Koufogiannakis, Christos; Young, Neal E. Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost. (English) Zbl 1285.68215 Algorithmica 66, No. 1, 113-152 (2013). MSC: 68W25 90C27 90C10 90C05 PDF BibTeX XML Cite \textit{C. Koufogiannakis} and \textit{N. E. Young}, Algorithmica 66, No. 1, 113--152 (2013; Zbl 1285.68215) Full Text: DOI OpenURL
López-Ortiz, Alejandro; Salinger, Alejandro Paging for multi-core shared caches. (English) Zbl 1347.68372 Proceedings of the 3rd conference on innovations in theoretical computer science, ITCS’12, Cambridge, MA, USA, January 8–10, 2012. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1115-1). 113-127 (2012). MSC: 68W27 68N25 68Q10 68Q25 68W05 PDF BibTeX XML Cite \textit{A. López-Ortiz} and \textit{A. Salinger}, in: Proceedings of the 3rd conference on innovations in theoretical computer science, ITCS'12, Cambridge, MA, USA, January 8--10, 2012. New York, NY: Association for Computing Machinery (ACM). 113--127 (2012; Zbl 1347.68372) Full Text: DOI OpenURL
Bansal, Nikhil; Buchbinder, Niv; Naor, Joseph (Seffi) A primal-dual randomized algorithm for weighted paging. (English) Zbl 1281.68238 J. ACM 59, No. 4, Article No. 19, 24 p. (2012). MSC: 68W27 68W20 PDF BibTeX XML Cite \textit{N. Bansal} et al., J. ACM 59, No. 4, Article No. 19, 24 p. (2012; Zbl 1281.68238) Full Text: DOI OpenURL
Dorrigiv, Reza; López-Ortiz, Alejandro; Munro, J. Ian On the relative dominance of paging algorithms. (English) Zbl 1171.68046 Theor. Comput. Sci. 410, No. 38-40, 3694-3701 (2009). MSC: 68W05 68W40 PDF BibTeX XML Cite \textit{R. Dorrigiv} et al., Theor. Comput. Sci. 410, No. 38--40, 3694--3701 (2009; Zbl 1171.68046) Full Text: DOI OpenURL
Epstein, Leah; van Stee, Rob; Tamir, Tami Paging with request sets. (English) Zbl 1192.68823 Theory Comput. Syst. 44, No. 1, 67-81 (2009). MSC: 68W05 68M10 PDF BibTeX XML Cite \textit{L. Epstein} et al., Theory Comput. Syst. 44, No. 1, 67--81 (2009; Zbl 1192.68823) Full Text: DOI OpenURL
Dobrev, Stefan; Královič, Rastislav; Pardubská, Dana Measuring the problem-relevant information in input. (English) Zbl 1176.68089 Theor. Inform. Appl. 43, No. 3, 585-613 (2009). MSC: 68Q25 68W40 68Q10 68Q17 PDF BibTeX XML Cite \textit{S. Dobrev} et al., Theor. Inform. Appl. 43, No. 3, 585--613 (2009; Zbl 1176.68089) Full Text: DOI Numdam EuDML OpenURL
Lari, Isabella; Maravalle, Maurizio; Simeone, Bruno Computing sharp bounds for hard clustering problems on trees. (English) Zbl 1169.05381 Discrete Appl. Math. 157, No. 5, 991-1008 (2009). MSC: 05C85 05C05 05C90 68Q25 PDF BibTeX XML Cite \textit{I. Lari} et al., Discrete Appl. Math. 157, No. 5, 991--1008 (2009; Zbl 1169.05381) Full Text: DOI OpenURL
Cai, Zhao-Quan On-line algorithm of loose competitive caching. (Chinese. English summary) Zbl 1181.68314 J. Comput. Appl. 28, No. 10, 2604-2607 (2008). MSC: 68W05 PDF BibTeX XML Cite \textit{Z.-Q. Cai}, J. Comput. Appl. 28, No. 10, 2604--2607 (2008; Zbl 1181.68314) Full Text: DOI OpenURL
Van Roy, Benjamin A short proof of optimality for the MIN cache replacement algorithm. (English) Zbl 1184.68192 Inf. Process. Lett. 102, No. 2-3, 72-73 (2007). MSC: 68N99 68W40 90C39 PDF BibTeX XML Cite \textit{B. Van Roy}, Inf. Process. Lett. 102, No. 2--3, 72--73 (2007; Zbl 1184.68192) Full Text: DOI OpenURL
Bein, Wolfgang; Larmore, Lawrence L.; Noga, John Equitable revisited. (English) Zbl 1151.68743 Arge, Lars (ed.) et al., Algorithms – ESA 2007. 15th annual European symposium, Eilat, Israel, October 8–10, 2007, Proceedings. Berlin: Springer (ISBN 978-3-540-75519-7/pbk). Lecture Notes in Computer Science 4698, 419-426 (2007). MSC: 68W20 68W40 PDF BibTeX XML Cite \textit{W. Bein} et al., Lect. Notes Comput. Sci. 4698, 419--426 (2007; Zbl 1151.68743) Full Text: DOI OpenURL
Epstein, L.; Van Stee, R. Calculating lower bounds for caching problems. (English) Zbl 1130.68041 Computing 80, No. 3, 275-285 (2007). MSC: 68N25 68W40 PDF BibTeX XML Cite \textit{L. Epstein} and \textit{R. Van Stee}, Computing 80, No. 3, 275--285 (2007; Zbl 1130.68041) Full Text: DOI OpenURL
Epstein, Leah; Kleiman, Yanir; Sgall, Jiří; van Stee, Rob Paging with connections: FIFO strikes again. (English) Zbl 1118.68189 Theor. Comput. Sci. 377, No. 1-3, 55-64 (2007). MSC: 68W05 68W40 PDF BibTeX XML Cite \textit{L. Epstein} et al., Theor. Comput. Sci. 377, No. 1--3, 55--64 (2007; Zbl 1118.68189) Full Text: DOI OpenURL
Boyar, Joan; Favrholdt, Lene M.; Larsen, Kim S. The relative worst-order ratio applied to paging. (English) Zbl 1115.68159 J. Comput. Syst. Sci. 73, No. 5, 818-843 (2007). MSC: 68W05 PDF BibTeX XML Cite \textit{J. Boyar} et al., J. Comput. Syst. Sci. 73, No. 5, 818--843 (2007; Zbl 1115.68159) Full Text: DOI Link OpenURL
Panagiotou, Konstantinos; Souza, Alexander On adequate performance measures for paging. (English) Zbl 1301.68024 Kleinberg, Jon M. (ed.), Proceedings of the 38th annual ACM symposium on theory of computing, STOC 2006. Seattle, WA, USA, May 21–23, 2006. New York, NY: ACM Press (ISBN 1-59593-134-1). 487-496 (2006). MSC: 68M07 68M20 68N25 68Q17 68W40 PDF BibTeX XML Cite \textit{K. Panagiotou} and \textit{A. Souza}, in: Proceedings of the 38th annual ACM symposium on theory of computing, STOC 2006. Seattle, WA, USA, May 21--23, 2006. New York, NY: ACM Press. 487--496 (2006; Zbl 1301.68024) Full Text: DOI OpenURL
Feuerstein, Esteban; Seiden, Steven S.; Strejilevich De Loma, Alejandro On multi-threaded metrical task systems. (English) Zbl 1103.68968 J. Discrete Algorithms 4, No. 3, 401-413 (2006). MSC: 68W05 PDF BibTeX XML Cite \textit{E. Feuerstein} et al., J. Discrete Algorithms 4, No. 3, 401--413 (2006; Zbl 1103.68968) Full Text: DOI OpenURL
Mendel, M.; Seiden, Steven S. Online companion caching. (English) Zbl 1073.68020 Theor. Comput. Sci. 324, No. 2-3, 183-200 (2004). MSC: 68M20 PDF BibTeX XML Cite \textit{M. Mendel} and \textit{S. S. Seiden}, Theor. Comput. Sci. 324, No. 2--3, 183--200 (2004; Zbl 1073.68020) Full Text: DOI OpenURL
Bar-Noy, Amotz; Malewicz, Grzegorz Establishing wireless conference calls under delay constraints. (English) Zbl 1292.90074 Proceedings of the 21st annual ACM symposium on principles of distributed computing, PODC ’02, Monterey, CA, USA, July 21–24, 2002. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-485-1). 41-50 (2002). MSC: 90B18 68Q17 68W25 PDF BibTeX XML Cite \textit{A. Bar-Noy} and \textit{G. Malewicz}, in: Proceedings of the 21st annual ACM symposium on principles of distributed computing, PODC '02, Monterey, CA, USA, July 21--24, 2002. New York, NY: Association for Computing Machinery (ACM). 41--50 (2002; Zbl 1292.90074) Full Text: DOI OpenURL
Cohen, E.; Kaplan, H.; Zwick, U. Competitive analysis of the LRFU paging algorithm. (English) Zbl 1016.68168 Algorithmica 33, No. 4, 511-516 (2002). MSC: 68W05 PDF BibTeX XML Cite \textit{E. Cohen} et al., Algorithmica 33, No. 4, 511--516 (2002; Zbl 1016.68168) Full Text: DOI OpenURL
Irani, S. Page replacement with multi-size pages and applications to web caching. (English) Zbl 0994.68184 Algorithmica 33, No. 3, 384-409 (2002). MSC: 68W05 68M10 PDF BibTeX XML Cite \textit{S. Irani}, Algorithmica 33, No. 3, 384--409 (2002; Zbl 0994.68184) Full Text: DOI OpenURL
Feuerstein, E.; Strejilevich de Loma, A. On-line multi-threaded paging. (English) Zbl 0995.68187 Algorithmica 32, No. 1, 36-60 (2002). MSC: 68W05 PDF BibTeX XML Cite \textit{E. Feuerstein} and \textit{A. Strejilevich de Loma}, Algorithmica 32, No. 1, 36--60 (2002; Zbl 0995.68187) Full Text: DOI OpenURL
Kimbrel, T. Online paging and file caching with expiration times. (English) Zbl 0984.68196 Theor. Comput. Sci. 268, No. 1, 119-131 (2001). MSC: 68W05 PDF BibTeX XML Cite \textit{T. Kimbrel}, Theor. Comput. Sci. 268, No. 1, 119--131 (2001; Zbl 0984.68196) Full Text: DOI OpenURL
Bartal, Yair; Grove, Eddie The harmonic \(k\)-server algorithm is competitive. (English) Zbl 1094.68538 J. ACM 47, No. 1, 1-15 (2000). MSC: 68N25 68W20 68W40 PDF BibTeX XML Cite \textit{Y. Bartal} and \textit{E. Grove}, J. ACM 47, No. 1, 1--15 (2000; Zbl 1094.68538) Full Text: DOI OpenURL
Bein, Wolfgang W.; Fleischer, Rudolf; Larmore, Lawrence L. Limited bookmark randomized online algorithms for the paging problem. (English) Zbl 1003.68205 Inf. Process. Lett. 76, No. 4-6, 155-162 (2000). MSC: 68W20 68N25 PDF BibTeX XML Cite \textit{W. W. Bein} et al., Inf. Process. Lett. 76, No. 4--6, 155--162 (2000; Zbl 1003.68205) Full Text: DOI OpenURL
Young, Neal E. On-line paging against adversarially biased random inputs. (English) Zbl 0971.68073 J. Algorithms 37, No. 1, 218-235 (2000). MSC: 68Q25 PDF BibTeX XML Cite \textit{N. E. Young}, J. Algorithms 37, No. 1, 218--235 (2000; Zbl 0971.68073) Full Text: DOI arXiv OpenURL
Koutsoupias, Elias; Papadimitriou, Christos H. Beyond competitive analysis. (English) Zbl 0959.68131 SIAM J. Comput. 30, No. 1, 300-317 (2000). MSC: 68W05 68Q25 PDF BibTeX XML Cite \textit{E. Koutsoupias} and \textit{C. H. Papadimitriou}, SIAM J. Comput. 30, No. 1, 300--317 (2000; Zbl 0959.68131) Full Text: DOI OpenURL
Achlioptas, D.; Chrobak, M.; Noga, J. Competitive analysis of randomized paging algorithms. (English) Zbl 0944.68194 Theor. Comput. Sci. 234, No. 1-2, 203-218 (2000). MSC: 68W05 PDF BibTeX XML Cite \textit{D. Achlioptas} et al., Theor. Comput. Sci. 234, No. 1--2, 203--218 (2000; Zbl 0944.68194) Full Text: DOI OpenURL
Khanna, Sanjeev; Liberatore, Vincenzo On broadcast disk paging. (English) Zbl 0951.68176 SIAM J. Comput. 29, No. 5, 1683-1702 (2000). MSC: 68W05 68Q25 PDF BibTeX XML Cite \textit{S. Khanna} and \textit{V. Liberatore}, SIAM J. Comput. 29, No. 5, 1683--1702 (2000; Zbl 0951.68176) Full Text: DOI OpenURL
Seiden, Steven S. Randomized online multi-threaded paging. (English) Zbl 0946.68155 Nord. J. Comput. 6, No. 2, 148-161 (1999). MSC: 68M20 68N25 68W20 68W27 PDF BibTeX XML Cite \textit{S. S. Seiden}, Nord. J. Comput. 6, No. 2, 148--161 (1999; Zbl 0946.68155) OpenURL
Albers, Susanne; Arora, Sanjeev; Khanna, Sanjeev Page replacement for general caching problems. (English) Zbl 0934.68104 Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms. Baltimore, MD, USA, January 17-19, 1999. Philadelphia, PA: SIAM. 31-40 (1999). MSC: 68W05 PDF BibTeX XML Cite \textit{S. Albers} et al., in: Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms, SODA '99. Baltimore, MD, USA, January 17--19, 1999. Philadelphia, PA: SIAM. 31--40 (1999; Zbl 0934.68104) OpenURL
Chrobak, M.; Noga, J. LRU is better than FIFO. (English) Zbl 0918.68039 Algorithmica 23, No. 2, 180-185 (1999). MSC: 68W10 PDF BibTeX XML Cite \textit{M. Chrobak} and \textit{J. Noga}, Algorithmica 23, No. 2, 180--185 (1999; Zbl 0918.68039) Full Text: DOI OpenURL
Liberatore, Vincenzo Uniform multipaging reduces to paging. (English) Zbl 1339.68043 Inf. Process. Lett. 67, No. 1, 9-12 (1998). MSC: 68N25 68W20 68W27 PDF BibTeX XML Cite \textit{V. Liberatore}, Inf. Process. Lett. 67, No. 1, 9--12 (1998; Zbl 1339.68043) Full Text: DOI Link OpenURL
Breslauer, Dany On competitive on-line paging with lookahead. (English) Zbl 0909.68023 Theor. Comput. Sci. 209, No. 1-2, 365-375 (1998). MSC: 68M99 PDF BibTeX XML Cite \textit{D. Breslauer}, Theor. Comput. Sci. 209, No. 1--2, 365--375 (1998; Zbl 0909.68023) Full Text: DOI OpenURL
Feuerstein, Esteban; Marchetti-Spaccamela, Alberto Memory paging for connectivity and path problems in graphs. (English) Zbl 0907.05050 J. Graph Algorithms Appl. 2, Paper No. 6, 22 p. (1998). MSC: 05C85 05C38 05C40 68R10 PDF BibTeX XML Cite \textit{E. Feuerstein} and \textit{A. Marchetti-Spaccamela}, J. Graph Algorithms Appl. 2, Paper No. 6, 22 p. (1998; Zbl 0907.05050) Full Text: DOI EuDML OpenURL
Torng, E. A unified analysis of paging and caching. (English) Zbl 0895.68058 Algorithmica 20, No. 2, 175-200 (1998). MSC: 68W10 PDF BibTeX XML Cite \textit{E. Torng}, Algorithmica 20, No. 2, 175--200 (1998; Zbl 0895.68058) Full Text: DOI OpenURL
Albers, S. On the influence of lookahead in competitive paging algorithms. (English) Zbl 0879.68046 Algorithmica 18, No. 3, 283-305 (1997). MSC: 68W10 68N25 PDF BibTeX XML Cite \textit{S. Albers}, Algorithmica 18, No. 3, 283--305 (1997; Zbl 0879.68046) Full Text: DOI OpenURL
Irani, Sandy; Karlin, Anna R.; Phillips, Steven Strongly competitive algorithms for paging with locality of reference. (English) Zbl 0856.68075 SIAM J. Comput. 25, No. 3, 477-497 (1996). MSC: 68W15 68R10 PDF BibTeX XML Cite \textit{S. Irani} et al., SIAM J. Comput. 25, No. 3, 477--497 (1996; Zbl 0856.68075) Full Text: DOI OpenURL
Cohen, Ariel; Burkhard, Walter A. A proof of the optimality of the MIN paging algorithm using linear programming duality. (English) Zbl 0857.90079 Oper. Res. Lett. 18, No. 1, 7-13 (1995). MSC: 90C05 PDF BibTeX XML Cite \textit{A. Cohen} and \textit{W. A. Burkhard}, Oper. Res. Lett. 18, No. 1, 7--13 (1995; Zbl 0857.90079) Full Text: DOI OpenURL
Borodin, Allan; Irani, Sandy; Raghavan, Prabhakar; Schieber, Baruch Competitive paging with locality of reference. (English) Zbl 0827.68027 J. Comput. Syst. Sci. 50, No. 2, 244-258 (1995). MSC: 68N25 68W10 PDF BibTeX XML Cite \textit{A. Borodin} et al., J. Comput. Syst. Sci. 50, No. 2, 244--258 (1995; Zbl 0827.68027) Full Text: DOI OpenURL
Irani, Sandy; Karlin, Anna R.; Phillips, Steven Strongly competetive algorithms for paging with locality of reference. (English) Zbl 0834.68049 Frederickson, Greg (ed.), Proceedings of the third annual ACM-SIAM symposium on discrete algorithms, held January 27-29, 1992, in Orlando, FL, USA. Philadelphia, PA: SIAM. 228-236 (1992). MSC: 68Q25 68W10 68R10 PDF BibTeX XML Cite \textit{S. Irani} et al., in: Proceedings of the third annual ACM-SIAM symposium on discrete algorithms, SODA '92, held January 27--29, 1992, in Orlando, FL, USA. Philadelphia, PA: SIAM; New York, NY: ACM. 228--236 (1992; Zbl 0834.68049) OpenURL
Borodin, Allan; Irani, Sandy; Raghavan, Prabhakar; Schieber, Baruch Competitive paging with locality of reference. (English) Zbl 0800.68484 On-line algorithms, Proc. DIMACS Workshop, New Brunswick/NJ (USA) 1991, DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 7, 167-168 (1992). MSC: 68Q25 PDF BibTeX XML Cite \textit{A. Borodin} et al., DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 7, 167--168 (1992; Zbl 0800.68484) OpenURL
Karlin, Anna R.; Phillips, Steven J.; Raghavan, Prabhakar Markov paging. (Extended abstract). (English) Zbl 0915.90250 33rd annual symposium on Foundations of computer science (FOCS). Proceedings, Pittsburgh, PA, USA, October 24–27, 1992. Washington, DC: IEEE Computer Society Press, 208-217 (1992). MSC: 90C40 PDF BibTeX XML Cite \textit{A. R. Karlin} et al., in: 33rd annual symposium on Foundations of computer science (FOCS). Proceedings, Pittsburgh, PA, USA, October 24--27, 1992. Washington, DC: IEEE Computer Society Press. 208--217 (1992; Zbl 0915.90250) OpenURL
McGeoch, Lyle A.; Sleator, Daniel D. A strongly competitive randomized paging algorithm. (English) Zbl 0731.68040 Algorithmica 6, No. 6, 816-825 (1991). MSC: 68W10 68N25 PDF BibTeX XML Cite \textit{L. A. McGeoch} and \textit{D. D. Sleator}, Algorithmica 6, No. 6, 816--825 (1991; Zbl 0731.68040) Full Text: DOI OpenURL
Fiat, Amos; Karp, Richard M.; Luby, Michael; McGeoch, Lyle A.; Sleator, Daniel D.; Young, Neal E. Competitive paging algorithms. (English) Zbl 0753.68018 J. Algorithms 12, No. 4, 685-699 (1991). Reviewer: J.Martyna (Kraków) MSC: 68M20 68N25 68W10 PDF BibTeX XML Cite \textit{A. Fiat} et al., J. Algorithms 12, No. 4, 685--699 (1991; Zbl 0753.68018) Full Text: DOI OpenURL
Manasse, Mark S.; McGeoch, Lyle A.; Sleator, Daniel D. Competitive algorithms for server problems. (English) Zbl 0705.68023 J. Algorithms 11, No. 2, 208-230 (1990). MSC: 68M20 68R10 90B35 68W10 PDF BibTeX XML Cite \textit{M. S. Manasse} et al., J. Algorithms 11, No. 2, 208--230 (1990; Zbl 0705.68023) Full Text: DOI OpenURL
Manasse, Mark S.; McGeoch, Lyle A.; Sleator, Daniel D. Competitive algorithms for on-line problems. (English) Zbl 0796.68042 Graphs and algorithms, Proc. Conference, Boulder/CO 1987, Contemp. Math. 89, 45-53 (1989). MSC: 68M20 68R10 90B35 68W10 PDF BibTeX XML Cite \textit{M. S. Manasse} et al., Contemp. Math. None, 45--53 (1989; Zbl 0796.68042) OpenURL
Spirn, Jeffrey R.; Tsur, Shalom Memory management for B-trees. (English) Zbl 0571.68015 Performance Eval. 5, 159-174 (1985). MSC: 68P05 68P20 PDF BibTeX XML Cite \textit{J. R. Spirn} and \textit{S. Tsur}, Perform. Eval. 5, 159--174 (1985; Zbl 0571.68015) Full Text: DOI OpenURL
Wood, Christopher; Fernandez, Eduardo B.; Lang, Tomas Minimization of demand paging for the LRU stack model of program behavior. (English) Zbl 0504.68014 Inf. Process. Lett. 16, 99-104 (1983). MSC: 68N25 68Q60 PDF BibTeX XML Cite \textit{C. Wood} et al., Inf. Process. Lett. 16, 99--104 (1983; Zbl 0504.68014) Full Text: DOI OpenURL
Hofri, M.; Tzelnic, P. The working set size distribution for the Markov chain model of program behavior. (English) Zbl 0488.68030 SIAM J. Comput. 11, 453-466 (1982). MSC: 68N25 PDF BibTeX XML Cite \textit{M. Hofri} and \textit{P. Tzelnic}, SIAM J. Comput. 11, 453--466 (1982; Zbl 0488.68030) Full Text: DOI OpenURL
Arato, M.; Benczur, A.; Kramli, A. On the solution of optimal performance of page storage hierarchies with an independent reference string. (English) Zbl 0458.68006 Mathematical statistics, Banach Cent. Publ. 6, 9-15 (1980). MSC: 68N25 68W99 PDF BibTeX XML Full Text: EuDML OpenURL
Arora, R.; Subramanian, R. K. SDMRU - a paging algorithm. (English) Zbl 0425.68032 Aust. Comput. J. 11, 122-126 (1979). MSC: 68N25 PDF BibTeX XML Cite \textit{R. Arora} and \textit{R. K. Subramanian}, Aust. Comput. J. 11, 122--126 (1979; Zbl 0425.68032) OpenURL
Fischer, Patrick C.; Probert, Robert L. Storage reorganization techniques for matrix computation in a paging environment. (English) Zbl 0404.68038 Commun. ACM 22, 405-415 (1979). MSC: 68N25 68P05 15A23 68Q25 PDF BibTeX XML Cite \textit{P. C. Fischer} and \textit{R. L. Probert}, Commun. ACM 22, 405--415 (1979; Zbl 0404.68038) Full Text: DOI OpenURL
Gecsei, Jan Performance of optimal variable-space paging algorithms. (English) Zbl 0397.68035 Progress in cybernetics and systems research, Vol. V, Symp. Vienna 1972, 474-478 (1979). MSC: 68W99 PDF BibTeX XML OpenURL
Myagkov, V. N. Class of stochastic replacement algorithms for a two-level computer memory. (English. Russian original) Zbl 0417.68091 Autom. Remote Control 39, 147-153 (1978); translation from Avtom. Telemekh. 1978, No. 1, 179-185 (1978). MSC: 68U99 PDF BibTeX XML Cite \textit{V. N. Myagkov}, Autom. Remote Control 39, 147--153 (1978; Zbl 0417.68091); translation from Avtom. Telemekh. 1978, No. 1, 179--185 (1978) OpenURL