default search action
Dagstuhl Seminar Online Algorithms 1996
- Amos Fiat, Gerhard J. Woeginger:
Online Algorithms, The State of the Art (the book grow out of a Dagstuhl Seminar, June 1996). Lecture Notes in Computer Science 1442, Springer 1998, ISBN 3-540-64917-4 - Amos Fiat, Gerhard J. Woeginger:
Competitive Analysis of Algorithms. 1-12 - Susanne Albers, Jeffery R. 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 - Jirí 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. Online Algorithms 1996: 395-436
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.