Dagstuhl Seminar Online Algorithms 1996

• Amos Fiat, Gerhard J. Woeginger:
  Competitive Analysis of Algorithms. 1-12
  
• Susanne Albers, Jeffery Westbrook:
  Self-Organizing Data Structures. 13-51
  
• Sandy Irani:
  Competitive Analysis of Paging. 52-73
  
• Marek Chrobak, Lawrence L. Larmore:
  Metrical Task Systems, the Server Problem and the Work Function Algorithm. 74-96
  
• Yair Bartal:
  Distributed Paging. 97-117
  
• James Aspnes:
  Competitive Analysis of Distributed Algorithms. 118-146
  
• János Csirik, Gerhard J. Woeginger:
  On-line Packing and Covering Problems. 147-177
  
• Yossi Azar:
  On-line Load Balancing. 178-195
  
• Jiri Sgall:
  On-line Scheduling. 196-231
  
• Piotr Berman:
  On-line Searching and Navigation. 232-241
  
• Stefano Leonardi:
  On-line Network Routing. 242-267
  
• Bala Kalyanasundaram, Kirk Pruhs:
  On-line Network Optimization Problems. 268-280
  
• Hal A. Kierstead:
  Coloring Graphs On-line. 281-305
  
• Avrim Blum:
  On-line Algorithms in Machine Learning. 306-325
  
• Ran El-Yaniv:
  Competitive Solutions for On-line Financial Problems. 326-372
  
• Anna R. Karlin:
  On the Performance of Competitive Algorithms in Practice. 373-384
  
• Amos Fiat, Gerhard J. Woeginger:
  Competitive Odds and Ends. 385-394
  
• Marek Chrobak, John Noga: Bibliography on Competitive Algorithms. 395-436

Last update Sat May 25 17:43:23 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page