Journals in DBLP

Theor. Comput. Sci.
2001, volume: 268, number: 1

1. Stefano Leonardi, Alberto Marchetti-Spaccamela
   Preface. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:268, n:1, pp:1- [Journal]
   
2. Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel
   A new lower bound for the list update problem in the partial cost model. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:268, n:1, pp:3-16 [Journal]
   
3. Yossi Azar, Oded Regev
   On-line bin-stretching. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:268, n:1, pp:17-41 [Journal]
   
4. Yair Bartal, Moses Charikar, Piotr Indyk
   On page migration and other relaxed task systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:268, n:1, pp:43-66 [Journal]
   
5. Stefan Bischof, Ernst W. Mayr
   On-line scheduling of parallel jobs with runtime restrictions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:268, n:1, pp:67-90 [Journal]
   
6. Esteban Feuerstein, Leen Stougie
   On-line single-server dial-a-ride problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:268, n:1, pp:91-105 [Journal]
   
7. Wlodzimierz Glazek
   Online algorithms for page replication in rings. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:268, n:1, pp:107-117 [Journal]
   
8. Tracy Kimbrel
   Online paging and file caching with expiration times. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:268, n:1, pp:119-131 [Journal]
   
9. John Noga, Steven S. Seiden
   An optimal online algorithm for scheduling two machines with release times. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:268, n:1, pp:133-143 [Journal]
   
10. Marco Riedel
    Online request server matching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:268, n:1, pp:145-160 [Journal]
    
11. Rudolf Fleischer
    On the Bahncard problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:268, n:1, pp:161-174 [Journal]