Journals in DBLP

Bulletin of the EATCS
2005, volume: 87, number:

1. Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
   Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 2005, v:87, n:, pp:47-77 [Journal]
   
2. Peter Høyer, Robert Spalek
   Lower Bounds on Quantum Query Complexity. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 2005, v:87, n:, pp:78-103 [Journal]
   
3. Catuscia Palamidessi, Frank D. Valencia
   Recursion vs Replication in Process Calculi: Expressiveness. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 2005, v:87, n:, pp:105-125 [Journal]
   
4. Barbara König, Vitali Kozioura
   Augur - A Tool for the Analysis of Graph Transformation Systems. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 2005, v:87, n:, pp:126-137 [Journal]
   
5. Julia Padberg
   Integration of the Generic Component Concepts for System Modeling with Adhesive HLR Systems. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 2005, v:87, n:, pp:138-154 [Journal]
   
6. Jan Van den Bussche
   First-order Topology Properties. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 2005, v:87, n:, pp:155-164 [Journal]
   
7. Yasubumi Sakakibara
   Development of a Bacteria Computer: From in silico Finite Automata to in virto AND in vivo. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 2005, v:87, n:, pp:165-178 [Journal]
   
8. Pedro García, Manuel Vazquez de Parga
   A note about mergible states in large NFA. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 2005, v:87, n:, pp:181-184 [Journal]
   
9. Olivier Finkel
   On Decision Problems for Timed Automata. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 2005, v:87, n:, pp:185-190 [Journal]
   
10. Pál Dömösi, Géza Horváth
    The Language of Primitive Words in not Regular: Two Simple Proofs. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2005, v:87, n:, pp:191-194 [Journal]