Journals in DBLP

Theor. Comput. Sci.
2005, volume: 340, number: 3

1. Mogens Nielsen, Branislav Rovan
   Introduction - Combined TCSA/TCSB issue - mathematical foundations of computer science 2000. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:340, n:3, pp:457-458 [Journal]
   
2. Mariangiola Dezani-Ciancaglini, Furio Honsell, Yoko Motohama
   Compositional characterisations of lambda-terms using intersection types. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:340, n:3, pp:459-495 [Journal]
   
3. Arnaud Durand, Miki Hermann, Phokion G. Kolaitis
   Subtractive reductions and complete problems for counting complexity classes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:340, n:3, pp:496-513 [Journal]
   
4. Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis
   Radiocoloring in planar graphs: Complexity and approximations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:340, n:3, pp:514-538 [Journal]
   
5. Ugo Montanari, Marco Pistore
   Structured coalgebras and minimal HD-automata for the pi-calculus. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:340, n:3, pp:539-576 [Journal]
   
6. David Peleg
   Informative labeling schemes for graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:340, n:3, pp:577-593 [Journal]
   
7. Petr Savický, Detlef Sieling
   A hierarchy result for read-once branching programs with restricted parity nondeterminism. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:340, n:3, pp:594-605 [Journal]
   
8. Lucian Wischik, Philippa Gardner
   Explicit fusions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:340, n:3, pp:606-630 [Journal]