Algorithmic research for the 21st century

[1]  S. Muthukrishnan,et al.  Data streams: algorithms and applications , 2005, SODA '03.

[2]  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..

[3]  Lyle A. McGeoch,et al.  Competitive Algorithms for Server Problems , 1990, J. Algorithms.

[4]  Jon Kleinberg,et al.  Authoritative sources in a hyperlinked environment , 1998, SODA '98.

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

[6]  Monika Henzinger.  Algorithmic Aspects of Web Search Engines , 2004, ESA.

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

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

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

[10]  Jon M. Kleinberg,et al.  The Web as a Graph: Measurements, Models, and Methods , 1999, COCOON.

[11]  Matteo Frigo,et al.  Cache-oblivious algorithms , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[12]  Prabhakar Raghavan,et al.  Computing on data streams , 1999, External Memory Algorithms.

[13]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[14]  Jeffrey Scott Vitter,et al.  Algorithms for parallel memory, I: Two-level memories , 2005, Algorithmica.

[15]  S. Muthukrishnan,et al.  Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries , 2001, VLDB.

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

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

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

[19]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[20]  Gerth Stølting Brodal,et al.  On the limits of cache-obliviousness , 2003, STOC '03.

[21]  M Maarten Lipmann,et al.  On-line routing , 2003 .

[22]  Mihalis Yannakakis,et al.  Searching a Fixed Graph , 1996, ICALP.

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

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

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

[26]  Naveen Sivadasan,et al.  Topology matters: Smoothed competitiveness of metrical task systems , 2004, Theor. Comput. Sci..

[27]  Jeffrey Scott Vitter,et al.  Algorithms for parallel memory, II: Hierarchical multilevel memories , 1992, Algorithmica.

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

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

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

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

[32]  Gerhard J. Woeginger,et al.  Developments from a June 1996 seminar on Online algorithms: the state of the art , 1998 .

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

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

[35]  William R. Burley,et al.  Traversing Layered Graphs Using the Work Function Algorithm , 1996, J. Algorithms.

[36]  Michael Mitzenmacher,et al.  A Brief History of Generative Models for Power Law and Lognormal Distributions , 2004, Internet Math..

[37]  D. Spielman,et al.  Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time , 2004 .

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

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