Journals in DBLP

Inf. Comput.
2002, volume: 178, number: 1

1. Toshihiko Kurata
   Intersection and Singleton Type Assignment Characterizing Finite Böhm-Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 2002, v:178, n:1, pp:1-11 [Journal]
   
2. Arnaud Durand
   Linear Time and the Power of One First-Order Universal Quantifier. [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 2002, v:178, n:1, pp:12-22 [Journal]
   
3. Furio Honsell, Donald Sannella
   Prelogical Relations. [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 2002, v:178, n:1, pp:23-43 [Journal]
   
4. Eike Best, Raymond R. Devillers, Maciej Koutny
   The Box Algebra = Petri Nets + Process Expressions. [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 2002, v:178, n:1, pp:44-100 [Journal]
   
5. Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
   Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 2002, v:178, n:1, pp:101-131 [Journal]
   
6. Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
   Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 2002, v:178, n:1, pp:132-148 [Journal]
   
7. Peter Møller Neergaard, Morten Heine Sørensen
   Conservation and Uniform Normalization in Lambda Calculi with Erasing Reductions. [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 2002, v:178, n:1, pp:149-179 [Journal]
   
8. Irek Ulidowski, Iain Phillips
   Ordered SOS Process Languages for Branching and Eager Bisimulations. [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 2002, v:178, n:1, pp:180-213 [Journal]
   
9. Marta Arias, Roni Khardon
   Learning Closed Horn Expressions. [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 2002, v:178, n:1, pp:214-240 [Journal]
   
10. Michael V. Vyugin, Vladimir V. V'yugin
    On Complexity of Easy Predictable Sequences. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:178, n:1, pp:241-252 [Journal]
    
11. Mikael Goldmann, Alexander Russell
    The Complexity of Solving Equations over Finite Groups. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:178, n:1, pp:253-262 [Journal]
    
12. Beate Bollig, Martin Sauerhoff, Ingo Wegener
    On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:178, n:1, pp:263-278 [Journal]
    
13. Amir Pnueli, Yoav Rodeh, Ofer Strichman, Michael Siegel
    The Small Model Property: How Small Can It Be? [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:178, n:1, pp:279-293 [Journal]
    
14. Salvador Lucas
    Context-Sensitive Rewriting Strategies. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:178, n:1, pp:294-343 [Journal]