Volume 130,
Number 1,
1 August 1994
Dynamic and On-Line Algorithms
- Gerhard J. Woeginger:
On-Line Scheduling of Jobs with Fixed Start and End Times.
5-16 BibTeX
- Rajeev Motwani, Steven Phillips, Eric Torng:
Non-Clairvoyant Scheduling.
17-47 BibTeX
- Anja Feldmann, Jiri Sgall, Shang-Hua Teng:
Dynamic Scheduling on Parallel Machines.
49-72 BibTeX
- Yossi Azar, Andrei Z. Broder, Anna R. Karlin:
On-Line Load Balancing.
73-84 BibTeX
- Amos Fiat, Moty Ricklin:
Competitive Algorithms for the Weighted Server Problem.
85-99 BibTeX
- Fabrizio d'Amore, Vincenzo Liberatore:
The List Update Problem and the Retrieval of Sets.
101-123 BibTeX
- Bala Kalyanasundaram, Kirk Pruhs:
Constructing Competitive Tours from Local Information.
125-138 BibTeX
- John Hershberger, Monika Rauch, Subhash Suri:
Data Structures for Two-Edge Connectivity in Planar Graphs.
139-161 BibTeX
- Magnús M. Halldórsson, Mario Szegedy:
Lower Bounds for On-Line Graph Coloring.
163-174 BibTeX
- Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer:
Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling.
175-201 BibTeX
- Peter Bro Miltersen, Sairam Subramanian, Jeffrey Scott Vitter, Roberto Tamassia:
Complexity Models for Incremental Computation.
203-236 BibTeX
Volume 130,
Number 2,
15 August 1994
Copyright © Tue May 27 18:36:37 2008
by Michael Ley (ley@uni-trier.de)
