Journals in DBLP

Theor. Comput. Sci.
2000, volume: 247, number: 1-2

1. Manfred Droste, Paul Gastin, Dietrich Kuske
   Asynchronous cellular automata for pomsets. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:247, n:1-2, pp:1-38 [Journal]
   
2. Thomas Ehrhard
   Parallel and serial hypercoherences. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:247, n:1-2, pp:39-81 [Journal]
   
3. Ian Mackie
   Interaction nets for linear logic. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:247, n:1-2, pp:83-140 [Journal]
   
4. Catherine Oriat
   Detecting equivalence of modular specifications with categorical diagrams. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:247, n:1-2, pp:141-190 [Journal]
   
5. Zoran Ognjanovic, Miodrag Raskovic
   Some first-order probability logics. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:247, n:1-2, pp:191-212 [Journal]
   
6. Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks
   On the totalk-diameter of connection networks. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:247, n:1-2, pp:213-228 [Journal]
   
7. Jens Blanck
   Domain representations of topological spaces. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:247, n:1-2, pp:229-255 [Journal]
   
8. Rym Mili, Jules Desharnais, Marc Frappier, Ali Mili
   Semantic distance between specifications. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:247, n:1-2, pp:257-276 [Journal]
   
9. Sabine Broda, Luís Damas
   On principal types of combinators. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:247, n:1-2, pp:277-290 [Journal]
   
10. Wim H. Hesselink
    A generalization of Naundorf's fixpoint theorem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:247, n:1-2, pp:291-296 [Journal]