Journals in DBLP

Theor. Comput. Sci.
2002, volume: 287, number: 2

1. Jaroslav Nesetril
   Preface. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:287, n:2, pp:355-357 [Journal]
   
2. Ali Akhavi
   Random lattices, threshold phenomena and efficient reduction algorithms. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:287, n:2, pp:359-385 [Journal]
   
3. Eric Anderson, Marek Chrobak, John Noga, Jiri Sgall, Gerhard J. Woeginger
   Solution of a problem in DNA computing. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:287, n:2, pp:387-391 [Journal]
   
4. Eric J. Anderson, Kirsten Hildrum, Anna R. Karlin, April Rasala, Michael E. Saks
   On list update and work function algorithms. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:287, n:2, pp:393-418 [Journal]
   
5. Yossi Azar, Oded Regev, Jiri Sgall, Gerhard J. Woeginger
   Off-line temporary tasks assignment. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:287, n:2, pp:419-428 [Journal]
   
6. Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela
   Approximation algorithms for routing and call scheduling in all-optical chains and rings. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:287, n:2, pp:429-448 [Journal]
   
7. Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
   The impact of information on broadcasting time in linear radio networks. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:287, n:2, pp:449-471 [Journal]
   
8. Limor Drori, David Peleg
   Faster exact solutions for some NP-hard problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:287, n:2, pp:473-499 [Journal]
   
9. Daniele V. Finocchiaro, Marco Pellegrini
   On computing the diameter of a point set in high dimensional Euclidean space. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:287, n:2, pp:501-514 [Journal]
   
10. Philippe Flajolet, Kostas P. Hatzis, Sotiris E. Nikoletseas, Paul G. Spirakis
    On the robustness of interconnections in random graphs: a symbolic approach. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:2, pp:515-534 [Journal]
    
11. Yair Frankel, Philip D. MacKenzie, Moti Yung
    Adaptively secure distributed public-key systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:2, pp:535-561 [Journal]
    
12. Arlette Gaillard, Heinz Gröflin, Alan J. Hoffman, William R. Pulleyblank
    On the submodular matrix representation of a digraph. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:2, pp:563-570 [Journal]
    
13. Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa
    A strategy for searching with different access costs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:2, pp:571-584 [Journal]
    
14. Jaroslav Nesetril, Claude Tardif
    Density via duality. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:2, pp:585-591 [Journal]
    
15. Pierre Nicodème, Bruno Salvy, Philippe Flajolet
    Motif statistics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:2, pp:593-617 [Journal]