Journals in DBLP

Theor. Comput. Sci.
2006, volume: 350, number: 2-3

1. Donald Sannella
   Preface. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:350, n:2-3, pp:163- [Journal]
   
2. Mikolaj Bojanczyk, Thomas Colcombet
   Tree-walking automata cannot be determinized. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:350, n:2-3, pp:164-173 [Journal]
   
3. Anuj Dawar, Erich Grädel, Stephan Kreutzer
   Backtracking games and inflationary fixed points. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:350, n:2-3, pp:174-187 [Journal]
   
4. Yuxin Deng, Davide Sangiorgi
   Towards an algebraic theory of typed mobile processes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:350, n:2-3, pp:188-212 [Journal]
   
5. Claudia Faggian
   Interactive observability in Ludics: The geometry of tests. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:350, n:2-3, pp:213-233 [Journal]
   
6. Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong
   Syntactic control of concurrency. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:350, n:2-3, pp:234-251 [Journal]
   
7. Esfandiar Haghverdi, Philip J. Scott
   A categorical model for the geometry of interaction. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:350, n:2-3, pp:252-274 [Journal]
   
8. Jack A. Laird
   A calculus of coroutines. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:350, n:2-3, pp:275-291 [Journal]
   
9. Keye Martin
   Entropy as a fixed point. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:350, n:2-3, pp:292-324 [Journal]
   
10. Nicole Schweikardt
    On the expressive power of monadic least fixed point logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:350, n:2-3, pp:325-344 [Journal]
    
11. Olivier Serre
    Games with winning conditions of high Borel complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:350, n:2-3, pp:345-372 [Journal]