Journals in DBLP

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

1. Viktor K. Sabelfeld
   The tree equivalence of linear recursion schemes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:238, n:1-2, pp:1-29 [Journal]
   
2. Prakash Panangaden, Clark Verbrugge
   Generating irregular partitionable data structures. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:238, n:1-2, pp:31-80 [Journal]
   
3. Markus Roggenbach, Mila E. Majster-Cederbaum
   Towards a unified view of bisimulation: a comparative study. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:238, n:1-2, pp:81-130 [Journal]
   
4. Michael Codish, Vitaly Lagoon
   Type dependencies for logic programs using ACI-unification. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:238, n:1-2, pp:131-159 [Journal]
   
5. Ludwik Czaja
   Process languages and nets. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:238, n:1-2, pp:161-181 [Journal]
   
6. Delia Kesner
   Confluence of extensional and non-extensional lambda-calculi with explicit substitutions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:238, n:1-2, pp:183-220 [Journal]
   
7. Giuliano Pacini, Maria I. Sessa
   Loop checking in SLD-derivations by well-quasi-ordering of goals. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:238, n:1-2, pp:221-246 [Journal]
   
8. Sándor Vágvölgyi
   Congruential complements of ground term rewrite systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:238, n:1-2, pp:247-274 [Journal]
   
9. Wim H. Hesselink, Albert Thijs
   Fixpoint semantics and simulation. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:238, n:1-2, pp:275-311 [Journal]
   
10. Michele Boreale, Luca Trevisan
    A complexity analysis of bisimilarity for value-passing processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:238, n:1-2, pp:313-345 [Journal]
    
11. Petr Savický, Stanislav Zák
    A read-once lower bound and a (1, +k)-hierarchy for branching programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:238, n:1-2, pp:347-362 [Journal]
    
12. Ines Margaria, Maddalena Zacchi
    Generalized filter models. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:238, n:1-2, pp:363-387 [Journal]
    
13. Rocco De Nicola, Rosario Pugliese
    Linda-based applicative and imperative process algebras. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:238, n:1-2, pp:389-437 [Journal]
    
14. Joost-Pieter Katoen, Albert Nymeyer
    Pattern-matching algorithms based on term rewrite systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:238, n:1-2, pp:439-464 [Journal]
    
15. Mingsheng Ying
    Weak confluence and tau-inertness. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:238, n:1-2, pp:465-475 [Journal]
    
16. Noriko H. Arai
    No feasible monotone interpolation for simple combinatorial reasoning. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:238, n:1-2, pp:477-482 [Journal]
    
17. Holger Naundorf
    Strictly causal functions have a unique fixed point. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:238, n:1-2, pp:483-488 [Journal]
    
18. Philippe Besnard, Torsten Schaub
    What is a (non-constructive) non-monotone logical system? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:238, n:1-2, pp:489-494 [Journal]
    
19. Petr Savický, Jiri Sgall
    DNF tautologies with a limited number of occurrences of every variable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:238, n:1-2, pp:495-498 [Journal]