Journals in DBLP

Theor. Comput. Sci.
2001, volume: 258, number: 1-2

1. Franck van Breugel
   An introduction to metric semantics: operational and denotational models for programming and specification languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:258, n:1-2, pp:1-98 [Journal]
   
2. Manfred Broy, Gheorghe Stefanescu
   The algebra of stream processing functions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:258, n:1-2, pp:99-129 [Journal]
   
3. Joost Engelfriet, Tjalling Gelsema
   Structural inclusion in the pi-calculus with replication. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:258, n:1-2, pp:131-168 [Journal]
   
4. Ken Mano, Mizuhito Ogawa
   Unique normal form property of compatible term rewriting systems: a new proof of Chew's theorem. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:258, n:1-2, pp:169-208 [Journal]
   
5. Athanassios Tzouvaras
   Objects and their lambda calculus. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:258, n:1-2, pp:209-232 [Journal]
   
6. Gaétan Hains, Frédéric Loulergue, John Mullins
   Concrete data structures and functional parallel programming. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:258, n:1-2, pp:233-267 [Journal]
   
7. Giorgio Delzanno, Maurizio Martelli
   Proofs as computations in linear logic. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:258, n:1-2, pp:269-297 [Journal]
   
8. Lars Birkedal, Mads Tofte
   A constraint-based region inference algorithm. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:258, n:1-2, pp:299-392 [Journal]
   
9. Flavio Corradini, Dino Di Cola
   On testing urgency through laziness over processes with durational actions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:258, n:1-2, pp:393-407 [Journal]
   
10. Petr Jancar, Antonín Kucera, Richard Mayr
    Deciding bisimulation-like equivalences with finite-state processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:258, n:1-2, pp:409-433 [Journal]
    
11. Bernhard Gramlich
    On interreduction of semi-complete term rewriting systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:258, n:1-2, pp:435-451 [Journal]
    
12. Franck Seynhaeve, Sophie Tison, Marc Tommasi, Ralf Treinen
    Grid structures and undecidable constraint theories. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:258, n:1-2, pp:453-490 [Journal]
    
13. E. Allen Emerson, Charanjit S. Jutla, A. Prasad Sistla
    On model checking for the µ-calculus and its fragments. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:258, n:1-2, pp:491-522 [Journal]
    
14. Stefan Brass, Jürgen Dix, Ilkka Niemelä, Teodor C. Przymusinski
    On the equivalence of the static and disjunctive well-founded semantics and its computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:258, n:1-2, pp:523-553 [Journal]
    
15. Shashi Shekhar, Weili Wu
    Optimal placement of data replicas in distributed database with majority voting protocol. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:258, n:1-2, pp:555-571 [Journal]
    
16. Philippe Darondeau
    On the Petri net realization of context-free graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:258, n:1-2, pp:573-598 [Journal]