The SCEAS System
Navigation Menu

Journals in DBLP

Electr. Notes Theor. Comput. Sci.
1995, volume: 2, number:

  1. Michel Bauderon
    Parallel rewriting of graphs through the pullback approach. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  2. Richard Kennaway
    Infinitary rewriting and cyclic graphs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  3. Zurab Khasidashvili, Vincent van Oostrom
    Context-sensitive conditional expression reduction systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  4. Martin Korff, Leila Ribeiro
    Concurrent derivations as single pushout graph grammar processes. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  5. Hans-Jörg Kreowski
    Specification and programming (by graph transformation). [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  6. Sabine Kuske
    Implementing beta-reduction by hypergraph rewriting. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  7. Igor Litovsky, Yves Métivier, Eric Sopena
    Checking global graph properties by means of local computations: the majority problem. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  8. Miquel Monserrat, Francesc Rosselló, Joan Torrens, Gabriel Valiente
    Hypergraph rewriting using conformisms. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  9. Marinus J. Plasmeijer
    CLEAN: a programming environment based on term graph rewriting. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  10. Yves-Marie Quemener, Thierry Jéron
    Model-checking of infinite Kripke structures defined by simple graph grammars. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  11. Georg Schied, Klaus Barthelmann
    Linear types for higher order processes with first class directed channels. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  12. Hans Jürgen Schneider
    A note on outward and inward productions in the categorical graph-grammar approach and Delta-grammars. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  13. Detlef Seese
    Linear time computable problems and logical descriptions. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  14. Duncan Shand, Simon Brock
    Proofs as graphs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  15. M. Ronan Sleep
    SEMAGRAPH: the theory and practice of term graph rewriting. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  16. Gabriele Taentzer, Andy Schürr
    DIEGO, another step towards a module concept for graph transformation systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  17. Thomas Johnsson
    Graph reduction, and how to avoid it. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  18. Dirk Janssens
    Process languages for ESM systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  19. Peter Heimann, Gregor Joeris, Carl-Arndt Krapp, Bernhard Westfechtel
    A programmed graph rewriting system for software process management. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  20. Richard Banach
    DPO rewriting and abstract semantics via opfibrations. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  21. Erik Barendsen, Sjaak Smetsers
    A derivation system for uniqueness typing. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  22. Eike Best, Maciej Koutny
    Using net refinement to compute the fixpoint of a recursive. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  23. Simon Brock, Gerald Ostheimer
    A process semantics for functional programming. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  24. David Clark, Richard Kennaway
    Some properties of non-orthogonal term graph rewriting systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  25. Andrea Corradini
    Concurrent computing: from Petri nets to graph grammars. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  26. Andrea Corradini, Reiko Heckel
    A compositional approach to structuring and refinement of typed graph grammars. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  27. Andrea Corradini, Ugo Montanari
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  28. Bruno Courcelle
    Logic and graphs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  29. Anke Drappa, Ralf Melchisedech
    The use of graph grammar in a software engineering education tool. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  30. Frank Drewes
    Semirings and tree-to-graph-to-tree transductions. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  31. Hartmut Ehrig
    Introduction to COMPUGRAPH. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  32. Gregor Engels, Andy Schürr
    Encapsulated hierarchical graphs, graph types, and meta types. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  33. Annegret Habel, Detlef Plump
    Unification, rewriting, and narrowing on term graphs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  34. Reiko Heckel, Annika Wagner
    Ensuring consistency of conditional graph rewriting - a constructive approach. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  35. Chris Wadsworth
    Graph reduction: a retrospective. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [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