Journals in DBLP

Theor. Comput. Sci.
1999, volume: 221, number: 1-2

1. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
   Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-offs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1999, v:221, n:1-2, pp:3-18 [Journal]
   
2. Yair Bartal, Stefano Leonardi
   On-Line Routing in All-Optical Networks. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1999, v:221, n:1-2, pp:19-39 [Journal]
   
3. Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
   Enumerative Sequences of Leaves and Nodes in Rational Trees. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1999, v:221, n:1-2, pp:41-60 [Journal]
   
4. Bruno Durand
   Tilings and Quasiperiodicity. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1999, v:221, n:1-2, pp:61-75 [Journal]
   
5. Péter L. Erdös, Michael Anthony Steel, László A. Székely, Tandy Warnow
   A Few Logs Suffice to Build (almost) All Trees: Part II. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1999, v:221, n:1-2, pp:77-118 [Journal]
   
6. Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Milena Mihail, Pino Persiano
   Optimal Wavelength Routing on Directed Fiber Trees. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1999, v:221, n:1-2, pp:119-137 [Journal]
   
7. Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
   Improving Spanning Trees by Upgrading Nodes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1999, v:221, n:1-2, pp:139-155 [Journal]
   
8. Giovanni Manzini, Luciano Margara
   A Complete and Efficiently Computable Topological Classification of D-dimensional Linear Cellular Automata over Zm. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1999, v:221, n:1-2, pp:157-177 [Journal]
   
9. Krzysztof R. Apt
   The Essence of Constraint Propagation. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1999, v:221, n:1-2, pp:179-210 [Journal]
   
10. Ahmed Bouajjani, Peter Habermehl
    Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:221, n:1-2, pp:211-250 [Journal]
    
11. Olaf Burkart, Bernhard Steffen
    Model Checking the Full Modal mu-Calculus for Infinite Sequential Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:221, n:1-2, pp:251-270 [Journal]
    
12. Erik P. de Vink, Jan J. M. M. Rutten
    Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:221, n:1-2, pp:271-293 [Journal]
    
13. Pietro Di Gianantonio
    An Abstract Data Type for Real Numbers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:221, n:1-2, pp:295-326 [Journal]
    
14. Yuxi Fu
    Variations on Mobile Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:221, n:1-2, pp:327-368 [Journal]
    
15. Thomas A. Henzinger, Peter W. Kopke
    Discrete-Time Control for Rectangular Hybrid Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:221, n:1-2, pp:369-392 [Journal]
    
16. Kohei Honda, Nobuko Yoshida
    Game-Theoretic Analysis of Call-by-Value Computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:221, n:1-2, pp:393-456 [Journal]
    
17. Davide Sangiorgi
    The Name Discipline of Uniform Receptiveness. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:221, n:1-2, pp:457-493 [Journal]