Journals in DBLP

Theor. Comput. Sci.
2004, volume: 324, number: 2-3

1. Amos Fiat, Sandy Irani
   Foreword. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:324, n:2-3, pp:133-135 [Journal]
   
2. Avrim Blum, Vijay Kumar, Atri Rudra, Felix Wu
   Online learning in online auctions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:324, n:2-3, pp:137-146 [Journal]
   
3. John E. Augustine, Steven S. Seiden
   Linear time approximation schemes for vehicle scheduling problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:324, n:2-3, pp:147-160 [Journal]
   
4. Alexander Kesselman, Yishay Mansour
   Harmonic buffer management policy for shared memory switches. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:324, n:2-3, pp:161-182 [Journal]
   
5. Manor Mendel, Steven S. Seiden
   Online companion caching. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:324, n:2-3, pp:183-200 [Journal]
   
6. Tomás Feder, Rajeev Motwani, Rina Panigrahy, Steven S. Seiden, Rob van Stee, An Zhu
   Combining request scheduling with web caching. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:324, n:2-3, pp:201-218 [Journal]
   
7. Rudolf Fleischer, Wodzimierz Glazek, Steven S. Seiden
   New results for online page replication. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:324, n:2-3, pp:219-251 [Journal]
   
8. Ronny Lempel, Shlomo Moran
   Competitive caching of query results in search engines. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:324, n:2-3, pp:253-271 [Journal]
   
9. Prosenjit Bose, Pat Morin
   Competitive online routing in geometric graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:324, n:2-3, pp:273-288 [Journal]
   
10. Marek Chrobak, Jiri Sgall
    The weighted 2-server problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:324, n:2-3, pp:289-312 [Journal]
    
11. Baruch Awerbuch, Yossi Azar, Yair Bartal
    On-line generalized Steiner problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:324, n:2-3, pp:313-324 [Journal]
    
12. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs
    Semi-clairvoyant scheduling. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:324, n:2-3, pp:325-335 [Journal]
    
13. Yair Bartal, Elias Koutsoupias
    On the competitive ratio of the work function algorithm for the k-server problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:324, n:2-3, pp:337-345 [Journal]
    
14. Elias Koutsoupias, David Scot Taylor
    The CNN problem and other k-server variants. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:324, n:2-3, pp:347-359 [Journal]
    
15. Peter P. Chen, Guoli Ding
    The best expert versus the smartest algorithm. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:324, n:2-3, pp:361-380 [Journal]