Journals in DBLP

Theor. Comput. Sci.
2002, volume: 281, number: 1-2

1. Giorgio Ausiello
   Selected Papers in honour of Maurice Nivat - Editorial. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:281, n:1-2, pp:1- [Journal]
   
2. Pierre-Louis Curien
   Une breve biographie scientifique de Maurice Nivat. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:281, n:1-2, pp:3-23 [Journal]
   
3. Grzegorz Rozenberg, Arto Salomaa
   ICALP, EATCS and Maurice Nivat. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:281, n:1-2, pp:25-30 [Journal]
   
4. André Arnold
   Nivat's processes and their synchronization. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:281, n:1-2, pp:31-36 [Journal]
   
5. Cyril Banderier, Philippe Flajolet
   Basic analytic combinatorics of directed lattice paths. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:281, n:1-2, pp:37-80 [Journal]
   
6. Danièle Beauquier, Jean-Claude Fournier
   Groups and tilings. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:281, n:1-2, pp:81-97 [Journal]
   
7. Jean Berstel, Laurent Vuillon
   Coding rotations on intervals. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:281, n:1-2, pp:99-107 [Journal]
   
8. Gérard Boudol, Ilaria Castellani
   Noninterference for concurrent programs and thread systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:281, n:1-2, pp:109-130 [Journal]
   
9. Roberto Bruni, Ugo Montanari
   Dynamic connectors for concurrency. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2002, v:281, n:1-2, pp:131-176 [Journal]
   
10. Bruno Courcelle, Teodor Knapik
    The evaluation of first-order substitution is monadic second-order compatible. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:177-206 [Journal]
    
11. Guy Cousineau
    Tilings as a programming exercise. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:207-217 [Journal]
    
12. Max Dauchet, Sophie Tison, Marc Tommasi
    Reduction de la non-linearite des morphismes d'arbres Recognizable tree-languages and non-linear morphisms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:219-233 [Journal]
    
13. Alberto Del Lungo
    Reconstructing permutation matrices from diagonal sums. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:235-249 [Journal]
    
14. Marianne Delorme, Jacques Mazoyer
    Reconnaissance parallele des langages rationnels sur automates cellulaires plans. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:251-289 [Journal]
    
15. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos
    Counting H-colorings of partial k-trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:291-309 [Journal]
    
16. Bruno Durand
    De la logique aux pavages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:311-324 [Journal]
    
17. Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg
    Gene assembly through cyclic graph decomposition. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:325-349 [Journal]
    
18. Luca Ferrari, Elisa Pergola, Renzo Pinzani, Simone Rinaldi
    An algebraic characterization of the set of succession rules. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:351-367 [Journal]
    
19. Paul Gastin, Michael W. Mislove
    A truly concurrent semantics for a process algebra using resource pomsets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:369-421 [Journal]
    
20. Serge Grigorieff
    Modelization of deterministic rational relations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:423-453 [Journal]
    
21. Peter Gritzmann, Sven de Vries
    On the algorithmic inversion of the discrete Radon transform. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:455-469 [Journal]
    
22. Mitsuhiro Okada
    A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:471-498 [Journal]
    
23. Teodor Rus
    A unified language processing methodology. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:499-536 [Journal]
    
24. Arto Salomaa
    Uni-transitional Watson-Crick D0L systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:537-553 [Journal]
    
25. Géraud Sénizergues
    L(A)=L(B)? A simplified decidability proof. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:555-608 [Journal]
    
26. Gérard P. Huet
    Srl Yantra Geometry. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:281, n:1-2, pp:609-628 [Journal]