On‐Line Algorithms

[1]  Leen Stougie,et al.  News from the online traveling repairman , 2003, Theor. Comput. Sci..

[2]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[3]  Anna R. Karlin,et al.  Markov paging , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[4]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[5]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[6]  Vangelis Th. Paschos,et al.  Algorithms for the On-Line Quota Traveling Salesman Problem , 2004, Inf. Process. Lett..

[7]  David S. Johnson,et al.  Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..

[8]  Neal E. Young,et al.  Bounding the diffuse adversary , 1998, SODA '98.

[9]  Moshe Babaioff,et al.  Selling ad campaigns: online algorithms with cancellations , 2009, EC '09.

[10]  Susanne Albers,et al.  On randomized online scheduling , 2002, STOC '02.

[11]  Sandy Irani,et al.  Strongly competitive algorithms for paging with locality of reference , 1992, SODA '92.

[12]  Peter J. Denning,et al.  The working set model for program behavior , 1968, CACM.

[13]  Jeffrey D. Ullman,et al.  Worst-case analysis of memory allocation algorithms , 1972, STOC.

[14]  Jeffrey D. Ullman,et al.  The performance of a memory allocation algorithm , 1971 .

[15]  Leen Stougie,et al.  Algorithms for the On-Line Travelling Salesman1 , 2001, Algorithmica.

[16]  Leen Stougie,et al.  Serving Requests with On-line Routing , 1994, SWAT.

[17]  Laszlo A. Belady,et al.  A Study of Replacement Algorithms for Virtual-Storage Computer , 1966, IBM Syst. J..

[18]  Neal E. Young,et al.  On-Line Paging Against Adversarially Biased Random Inputs , 2000, J. Algorithms.

[19]  Kirk Pruhs,et al.  Online weighted flow time and deadline scheduling , 2001, J. Discrete Algorithms.

[20]  Alejandro López-Ortiz,et al.  On the relative dominance of paging algorithms , 2009, Theor. Comput. Sci..

[21]  Allan Borodin,et al.  An optimal on-line algorithm for metrical task system , 1992, JACM.

[22]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[23]  Susanne Albers,et al.  Better bounds for online scheduling , 1997, STOC '97.

[24]  Gerhard J. Woeginger,et al.  Online Algorithms , 1998, Lecture Notes in Computer Science.

[25]  Allan Borodin,et al.  Competitive paging with locality of reference , 1991, STOC '91.

[26]  Marek Chrobak,et al.  LRU Is Better than FIFO , 1999, SODA '98.

[27]  Aristides Gionis,et al.  The impact of caching on search engines , 2007, SIGIR.

[28]  Amos Fiat,et al.  Truly online paging with locality of reference , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[29]  Eric Torng,et al.  A Unified Analysis of Paging and Caching , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[30]  Giorgio Ausiello,et al.  The online Prize-Collecting Traveling Salesman Problem , 2008, Inf. Process. Lett..

[31]  Luca Becchetti,et al.  Modeling Locality: A Probabilistic Analysis of LRU and FWF , 2004, ESA.

[32]  Sandy Irani,et al.  On-Line Algorithms for the Dynamic Traveling Repair Problem , 2002, SODA '02.

[33]  Neal E. Young,et al.  Thek-server dual and loose competitiveness for paging , 1994, Algorithmica.

[34]  Amos Fiat,et al.  Randomized and multipointer paging with locality of reference , 1995, STOC '95.

[35]  Christos H. Papadimitriou,et al.  Beyond competitive analysis [on-line algorithms] , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[36]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[37]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance , 2000, JACM.

[38]  Mor Harchol-Balter,et al.  Connection Scheduling in Web Servers , 1999, USENIX Symposium on Internet Technologies and Systems.

[39]  Alexander Souza,et al.  On adequate performance measures for paging , 2006, STOC '06.

[40]  Amos Fiat,et al.  Competitive Paging Algorithms , 1991, J. Algorithms.

[41]  Sven Oliver Krumke,et al.  Online Dial-a-Ride Problems: Minimizing the Completion Time , 2000, STACS.

[42]  Shang-Hua Teng,et al.  Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time , 2001, STOC '01.

[43]  Giorgio Ausiello,et al.  On the power of lookahead in on-line server routing problems , 2008, Theor. Comput. Sci..

[44]  Tjark Vredeveld,et al.  Simple optimality proofs for Least Recently Used in the presence of locality of reference , 2009 .

[45]  Anna R. Karlin,et al.  Markov Paging (Extended Abstract) , 1992, FOCS 1992.

[46]  Leen Stougie,et al.  On-line single-server dial-a-ride problems , 2001, Theor. Comput. Sci..

[47]  Luca Becchetti,et al.  Average case and smoothed competitive analysis of the multi-level feedback algorithm , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[48]  Christos H. Papadimitriou,et al.  On the k-server conjecture , 1995, JACM.