|
Journals in DBLP
- Herbert Edelsbrunner
The Computational Geometry Column. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1987, v:33, n:, pp:23-24 [Journal]
- Hartmut Ehrig
The Algebraic Specification Column. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1987, v:33, n:, pp:25-26 [Journal]
- Juris Hartmanis
The Structural Complexity Column. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1987, v:33, n:, pp:26-39 [Journal]
- Jan Paredaens
The Database Theory Column. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1987, v:33, n:, pp:40-41 [Journal]
- Arto Salomaa
The formal Language Theory Column. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1987, v:33, n:, pp:42-53 [Journal]
- David B. Benson
Concurrency and interleaving are equally fundamental. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1987, v:33, n:, pp:54- [Journal]
- Annegret Habel, Hans-Jörg Kreowski, Walter Vogler
Complativle graph properties are decidable for hypergraph replacement graph languages. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1987, v:33, n:, pp:55-61 [Journal]
- Werner Kuich
Unampiguous automata. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1987, v:33, n:, pp:62-66 [Journal]
- Klaus-Jörn Lange, Michael Schudy
A further link between formal languages and complexity theory. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1987, v:33, n:, pp:67-70 [Journal]
- John-Jules Ch. Meyer
Process modalities obtained as fixed points (part 2). [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1987, v:33, n:, pp:71-82 [Journal]
- Edward Ochmanski
A non-invertible PCF language. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1987, v:33, n:, pp:83-84 [Journal]
- Zdzislaw Pawlak
Decision tables - a rough set approach. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1987, v:33, n:, pp:85-95 [Journal]
- Róbert Szelepcsényi
The moethod of focing for nondeterministic automata. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1987, v:33, n:, pp:96-99 [Journal]
- Gerard Tel, Jan van Leeuwen
A non-deterministic algorithm and its analysis. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1987, v:33, n:, pp:100-102 [Journal]
- David Turner
An overview of Miranda. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1987, v:33, n:, pp:103-114 [Journal]
|