Journals in DBLP

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

1. Laura Recalde, Enrique Teruel, Manuel Silva
   Structure theory of multi-level deterministically synchronized sequential processes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:254, n:1-2, pp:1-33 [Journal]
   
2. Anna Ingólfsdóttir, Andrea Schalk
   A fully abstract denotational model for observational precongruence. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:254, n:1-2, pp:35-61 [Journal]
   
3. François Monin, Marianne Simonot
   An ordinal measure based procedure for termination of functions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:254, n:1-2, pp:63-94 [Journal]
   
4. Pedro Resende
   Quantales, finite observations and strong bisimulation. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:254, n:1-2, pp:95-149 [Journal]
   
5. Tristan Crolard
   Subtractive logic. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:254, n:1-2, pp:151-185 [Journal]
   
6. R. Ramesh, I. V. Ramakrishnan, R. C. Sekar
   Automata-driven efficient subterm unification. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:254, n:1-2, pp:187-223 [Journal]
   
7. Jan Springintveld, Frits W. Vaandrager, Pedro R. D'Argenio
   Testing timed automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:254, n:1-2, pp:225-257 [Journal]
   
8. Christophe Raffalli
   Completeness, minimal logic and programs extraction. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:254, n:1-2, pp:259-271 [Journal]
   
9. Salvatore Ruggieri
   exists-Universal termination of logic programs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:254, n:1-2, pp:273-296 [Journal]
   
10. Rachid Guerraoui, André Schiper
    Genuine atomic multicast in asynchronous distributed systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:254, n:1-2, pp:297-316 [Journal]
    
11. Stefano Guerrini, Andrea Masini
    Parsing MELL proof nets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:254, n:1-2, pp:317-335 [Journal]
    
12. Xiao Jun Chen, Rocco De Nicola
    Algebraic characterizations of trace and decorated trace equivalences over tree-like structures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:254, n:1-2, pp:337-361 [Journal]
    
13. Jan Van den Bussche
    Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:254, n:1-2, pp:363-377 [Journal]
    
14. Lars Jenner, Walter Vogler
    Fast asynchronous systems in dense time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:254, n:1-2, pp:379-422 [Journal]
    
15. Luc Vandeurzen, Marc Gyssens, Dirk Van Gucht
    On the expressiveness of linear-constraint query languages for spatial databases. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:254, n:1-2, pp:423-463 [Journal]
    
16. Konstantinos F. Sagonas, Terrance Swift, David Scott Warren
    The limits of fixed-order computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:254, n:1-2, pp:465-499 [Journal]
    
17. Joost-Pieter Katoen, Christel Baier, Diego Latella
    Metric semantics for true concurrent real time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:254, n:1-2, pp:501-542 [Journal]
    
18. Marcelo F. Frias, Roger D. Maddux
    Completeness of a relational calculus for program schemes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:254, n:1-2, pp:543-556 [Journal]
    
19. B. Thomsen, Samson Abramsky
    A fully abstract denotational semantics for the calculus of higher-order communicating systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:254, n:1-2, pp:557-589 [Journal]
    
20. Paul Spruit, Roel Wieringa, John-Jules Ch. Meyer
    Regular database update logics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:254, n:1-2, pp:591-661 [Journal]
    
21. Panos Rondogiannis
    Stratified negation in temporal logic programming and the cycle-sum test. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:254, n:1-2, pp:663-676 [Journal]
    
22. Dieter Probst, Thomas Studer
    How to normalize the Jay. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:254, n:1-2, pp:677-681 [Journal]
    
23. Mark Levene, George Loizou
    Guaranteeing no interaction between functional dependencies and tree-like inclusion dependencies. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:254, n:1-2, pp:683-690 [Journal]
    
24. Marco Bernardo, Roberto Gorrieri
    Corrigendum to ``A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities and time'' - [TCS 202 (1998) 1-54]. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:254, n:1-2, pp:691-694 [Journal]