Journals in DBLP

Bulletin of the EATCS
1998, volume: 66, number:

1. Eric Allender
   News from the Isomorphism Front. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 1998, v:66, n:, pp:73- [Journal]
   
2. Hartmut Ehrig
   EATCS Mini-Track of FM'99. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 1998, v:66, n:, pp:83-84 [Journal]
   
3. Julia Padberg
   Classification of Petri Nets Using Adjoint Functors. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 1998, v:66, n:, pp:85-91 [Journal]
   
4. Bent Thomsen, Lone Leth Thomsen
   Towards Global Computations Guided by Concurrency Theory. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 1998, v:66, n:, pp:92-99 [Journal]
   
5. Mika Hirvensalo
   An Introduction to Quantum Computing. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 1998, v:66, n:, pp:100-121 [Journal]
   
6. Erzsébet Csuhaj-Varjú, Arto Salomaa
   Networks of Language Processors: Parallel Communicating Systems. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 1998, v:66, n:, pp:122-138 [Journal]
   
7. Cristian Calude, Elena Calude, Catalina Stefanescu
   Computational Complementarity for Mealy Automata. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 1998, v:66, n:, pp:139-149 [Journal]
   
8. Ann Q. Gates, Vladik Kreinovich, Luc Longpré
   Kolmogorov Complexity Justifies Software Engineering Heuristics. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 1998, v:66, n:, pp:150-154 [Journal]
   
9. Ekkart Kindler, Michael Weber
   The Dimensions of Petri Nets: The Petri Net Cube. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 1998, v:66, n:, pp:155-165 [Journal]
   
10. Misha Koshelev
    Towards the Use of Aesthetics in Decision Making: Kolmogorov Complexity Formalizes Birkhoff's Idea. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1998, v:66, n:, pp:166-170 [Journal]
    
11. Enno Ohlebusch
    Modularity of Termination for Disjoint Term Graph Rewrite Systems: A Simple Proof. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1998, v:66, n:, pp:171-177 [Journal]
    
12. Ludwig Staiger
    The Hausdorff Measure of Regular omega-languages is Computable. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1998, v:66, n:, pp:178-182 [Journal]