Journals in DBLP

Bulletin of the EATCS
1984, volume: 23, number:

1. Cristian Calude, Ion Chitescu
   A class of nuniversal P Marti-Löf tests. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 1984, v:23, n:, pp:15-21 [Journal]
   
2. Robert P. Daley, Carl H. Smith
   On the complextiy of inductive inference. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 1984, v:23, n:, pp:22-27 [Journal]
   
3. Alain Finkel
   Petri Nets and monogenous FIFO nets. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 1984, v:23, n:, pp:28-30 [Journal]
   
4. Rusins Freivalds
   An answer to an open problem. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 1984, v:23, n:, pp:31-32 [Journal]
   
5. Juraj Hromkovic
   On the power of Yao-Rivest technique. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 1984, v:23, n:, pp:33-34 [Journal]
   
6. Ivan Korec
   Two kinds of processors are sufficient and large operating alphabets are needed for regular trellis automata languages. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 1984, v:23, n:, pp:35-41 [Journal]
   
7. Kurt Lautenbach, Anastasia Pagnoni
   On the various high-level Petri Nets and their invariatnts. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 1984, v:23, n:, pp:42-58 [Journal]
   
8. Arjen K. Lenstra
   Polynomial - time algorithms for the factorization of polynomials. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 1984, v:23, n:, pp:59-75 [Journal]