The SCEAS System
Navigation Menu

Journals in DBLP

Bulletin of the EATCS
1988, volume: 35, number:

  1. Herbert Edelsbrunner
    The computational Geometry Column. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:35, n:, pp:66-68 [Journal]
  2. Hartmut Ehrig
    The Algebraic Specification Column. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:35, n:, pp:69-70 [Journal]
  3. Yuri Gurevich
    Logic in computer Science Column. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:35, n:, pp:71-81 [Journal]
  4. Juris Hartmanis
    The Structural Complexity Column. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:35, n:, pp:82-91 [Journal]
  5. Arto Salomaa
    The formal language theory column. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:35, n:, pp:82-96 [Journal]
  6. Stefano Baratella, Gilberto Filé
    A completeness result for SLDNF resoultion. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:35, n:, pp:97-105 [Journal]
  7. Alberto Bertoni, Nicoletta Sabadini
    Generating functions of trace languages. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:35, n:, pp:106-112 [Journal]
  8. Wilfried Brauer
    On Minimizing Finite Automata. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:35, n:, pp:113-116 [Journal]
  9. Manfred Broy, Martin Wirsing
    Ultra-loose algebraic specifications. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:35, n:, pp:117-127 [Journal]
  10. Irène Guessarian
    Fixpoint strategies for deductive databases. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:35, n:, pp:128-136 [Journal]
  11. Uschi Heuter
    Definite tree languages. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:35, n:, pp:137-142 [Journal]
  12. Thomas Lengauer, Egon Wanke
    Efficient processing of hierarchical graphs for engineering design. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:35, n:, pp:143-157 [Journal]
  13. Antoni Lozano
    NP-Hardness on succinct representation of graphs. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:35, n:, pp:158-162 [Journal]
  14. Peter Padawitz
    Can inductive proofs be automated? [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:35, n:, pp:163-170 [Journal]
  15. Lutz Priese
    Fairness. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:35, n:, pp:171-180 [Journal]
  16. Wolfgang Reisig
    Concurrency is more fundamental than interleaving. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:35, n:, pp:181-184 [Journal]
  17. Harrie C. M. de Swart, W. M. J. Ophelders
    Another tableau based automated theorem prover for classical logic. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:35, n:, pp:185-197 [Journal]
  18. Ingo Wegener
    Prime implicants and parallel complexity. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:35, n:, pp:198-204 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002