@inproceedings{2207,
  author       = {{Meyer auf der Heide, Friedhelm and Scheideler, Christian}},
  booktitle    = {{SPAA}},
  pages        = {{137----146}},
  title        = {{{Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)}}},
  year         = {{1995}},
}

@inproceedings{2208,
  author       = {{Meyer auf der Heide, Friedhelm and Scheideler, Christian and Stemann, Volker}},
  booktitle    = {{STACS}},
  pages        = {{267----278}},
  title        = {{{Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations}}},
  year         = {{1995}},
}

@inproceedings{7831,
  abstract     = {{We present a combination of recent extensions to single-pushout graph transformations, as there are attribution, application conditions and amalgamated graph transformations and add a simple transaction concept on top of this formalism. Thereby, we provide the formal basis for several examples, where these concepts are used in combination.}},
  author       = {{Heckel, Reiko and Müller, Jürgen and Taentzer, Gabriele and Wagner, Annika}},
  booktitle    = {{Proceedings of the Colloquium on Graph Transformation and its Application in Computer Science}},
  number       = {{B-19}},
  publisher    = {{Universitat de les Illes Balears}},
  title        = {{{Attributed Graph Transformations with Controlled Application of Rules}}},
  year         = {{1995}},
}

@inproceedings{7832,
  author       = {{Thoben, Wilfried and Appelrath, Hans-Jürgen and Sauer, Stefan}},
  booktitle    = {{Proceedings of the 18th Annual Conference of the Gesellschaft für Klassifikation, Oldenburg (Germany)}},
  pages        = {{412--419}},
  publisher    = {{Springer}},
  title        = {{{Record Linkage of Anonymous Data by Control Numbers}}},
  year         = {{1995}},
}

@inproceedings{7833,
  abstract     = {{Single pushout graph transformations at injective matches are extended by negative application conditions. It is shown, how right-sided application conditions can be transformed into equivalent left-sided ones. Based on this result, conditional derived rules are introduced and a theorem, similiar to the double pushout embedding theorem is shown. Finally, three variants of contextual application conditions are discussed with respect to their expressive power and expected results.}},
  author       = {{Heckel, Reiko}},
  booktitle    = {{Proceedings of the Colloquium on Graph Transformation and its Application in Computer Science}},
  number       = {{B-19}},
  publisher    = {{Universitat de les Illes Balears}},
  title        = {{{Embedding of Conditional Graph Transformations}}},
  year         = {{1995}},
}

@techreport{8194,
  author       = {{Conrad, Mirko and Gajewsky, Magdalena and Holl-Biniasz, Rainer and Rudolf, Michael and Demuth, Jochen and Weber, Stephan and Heckel, Reiko and Müller, Jürgen and Taentzer, Gabriele and Wagner, Annika}},
  title        = {{{Graphische Spezifikation ausgewählter Teile von AGG - einem algebraischen Graphgrammatiksystem}}},
  year         = {{1995}},
}

@techreport{8195,
  abstract     = {{Several object-oriented modeling approaches propose to describe the dynamic behaviour of objects by state transition diagrams. None of them provides precise rules or conditions for the interrelation between the behaviour description of classes and those of their subclasses. In this paper, we discuss this interrelation in detail. It turns out that one has to distinguish between the observable and the invocable behaviour of objects and that different compatibility requirements between the diagrams exist depending on the type of behaviour.}},
  author       = {{Ebert, Jürgen and Engels, Gregor}},
  publisher    = {{University of Koblenz-Landau}},
  title        = {{{Specialization of Object Life Cycle Definitions}}},
  year         = {{1995}},
}

@techreport{8196,
  author       = {{Engels, Gregor and Schürr, Andy}},
  publisher    = {{Vakgroep Informatica, Rijksuniversiteit Leiden}},
  title        = {{{Encapsulated Hierarchical Graphs, Graph Types, and Meta Types}}},
  year         = {{1995}},
}

@inproceedings{8266,
  author       = {{Groenewegen, Luuk and Engels, Gregor}},
  booktitle    = {{Proceedings of the 4th European Workshop on Software Process Technology (EWSPT 1995), Noordwijkerhout (The Netherlands)}},
  pages        = {{189--192}},
  publisher    = {{Springer}},
  title        = {{{Coordination by Behavioural Views and Communication Patterns}}},
  doi          = {{http://dx.doi.org/10.1007/3-540-59205-9_56}},
  volume       = {{913}},
  year         = {{1995}},
}

@inproceedings{8267,
  abstract     = {{Based on a categorical semantics that has been developed for typed graph grammars we uses colimits (pushouts) to model composition and (reverse) graph grammar morphisms to describe refinements of typed graph grammars. Composition of graph grammars w.r.t. common subgrammars is shown to be compatible with the semantics, i.e. the semantics of the composed grammar is obtained as the composition of the semantics of the component grammars. Moreover, the structure of a composed grammar is preserved during a refinement step in the sense that compatible refinements of the components induce a refinement of the composition. The concepts and results are illustrated by an example.}},
  author       = {{Corradini, Andrea and Heckel, Reiko}},
  booktitle    = {{Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)}},
  pages        = {{46--55}},
  publisher    = {{Elsevier}},
  title        = {{{A Compositional Approach to Structuring and Refinement of Typed Graph Grammars}}},
  volume       = {{2}},
  year         = {{1995}},
}

@inproceedings{8268,
  abstract     = {{The overall aim of this paper is a proposal how to bridge the gap between formal specification techniques developed in research projects and semi--formal or informal specifications used in industrial practice. The main idea to overcome these problems is to develop graphical support for formal methods in order to increase acceptance by practitioners and to provide means for integration of formal and semi--formal methods. More specifically suitable concepts will be developed to combine algebraic specifications, Petri Nets, and Graph Grammars with each other and with distinguished graphical components to be used by industrial partners.}},
  author       = {{Bardohl, Bernhard and Bardohl, Roswitha and Castro, Paulo and Ehrig, Hartmut and Heckel, Reiko and Ribeiro, Leila and Nunes, Daltro and Martini, Alfio}},
  booktitle    = {{Proceedings of the 3rd German-Brazilian Workshop on Information Technology (1995), Berlin (Germany)}},
  publisher    = {{Forschungszentrum Jülich GmbH}},
  title        = {{{GRAPHIT: Graphical Support and Integration of Formal and Semiformal Methods for Software Specification and Development}}},
  volume       = {{26}},
  year         = {{1995}},
}

@inproceedings{8269,
  abstract     = {{Currently existing graph grammar-based specification languages have serious problems with supporting any kind of “specification-in-the-large” activities. More precisely, they have deficiencies with respect to modeling hierarchical data structures or specifying meta activities like manipulation of graph schemata. Furthermore, already proposed graph grammar module concepts are still too abstract to be useful in practice. Our contribution addresses these problems by introducing a new hierarchical graph data model with an infinite number of schema, meta-schema, etc. layers. It forms the base for a forthcoming concrete modular graph grammar specification language where in addition information hiding aspects like explicit export and import interfaces are expressible.}},
  author       = {{Engels, Gregor and Schürr, Andy}},
  booktitle    = {{Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)}},
  pages        = {{101--109}},
  publisher    = {{Elsevier}},
  title        = {{{Encapsulated Hierarchical Graphs, Graph Types, and Meta Types}}},
  doi          = {{http://dx.doi.org/10.1016/S1571-0661(05)80186-0}},
  year         = {{1995}},
}

@inproceedings{8270,
  author       = {{Heckel, Reiko and Wagner, Annika}},
  booktitle    = {{Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)}},
  pages        = {{118--126}},
  publisher    = {{Elsevier}},
  title        = {{{Ensuring Consistency of Conditional Graph Grammars - A constructive Approach}}},
  doi          = {{http://dx.doi.org/10.1016/S1571-0661(05)80188-4}},
  volume       = {{2}},
  year         = {{1995}},
}

@article{16566,
  author       = {{Breslauer, Dany and Czumaj, Artur and Dubhashi, Devdatt P. and Meyer auf der Heide, Friedhelm}},
  issn         = {{0020-0190}},
  journal      = {{Information Processing Letters}},
  pages        = {{103--110}},
  title        = {{{Transforming comparison model lower bounds to the parallel-random-access-machine}}},
  doi          = {{10.1016/s0020-0190(97)00032-x}},
  year         = {{1995}},
}

@inbook{16704,
  author       = {{Meyer auf der Heide, Friedhelm and Vöcking, Berthold}},
  booktitle    = {{STACS 95}},
  isbn         = {{9783540590422}},
  issn         = {{0302-9743}},
  title        = {{{A packet routing protocol for arbitrary networks}}},
  doi          = {{10.1007/3-540-59042-0_81}},
  year         = {{1995}},
}

@inbook{16705,
  author       = {{Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783540603139}},
  issn         = {{0302-9743}},
  title        = {{{Shared memory simulations with triple-logarithmic delay}}},
  doi          = {{10.1007/3-540-60313-1_133}},
  year         = {{1995}},
}

@inproceedings{16706,
  author       = {{Meyer auf der Heide, Friedhelm and Storch, Martin and Wanka, Rolf}},
  booktitle    = {{Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures  - SPAA '95}},
  isbn         = {{0897917170}},
  title        = {{{Optimal trade-offs between size and slowdown for universal parallel networks}}},
  doi          = {{10.1145/215399.215430}},
  year         = {{1995}},
}

@inproceedings{16707,
  author       = {{Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}},
  booktitle    = {{Proceedings Third Israel Symposium on the Theory of Computing and Systems}},
  isbn         = {{0818669152}},
  title        = {{{Improved optimal shared memory simulations, and the power of reconfiguration}}},
  doi          = {{10.1109/istcs.1995.377051}},
  year         = {{1995}},
}

@inbook{16717,
  author       = {{Meyer auf der Heide, Friedhelm and Westermann, Matthias}},
  booktitle    = {{Graph-Theoretic Concepts in Computer Science}},
  isbn         = {{9783540606185}},
  issn         = {{0302-9743}},
  title        = {{{Hot-potato routing on multi-dimensional tori}}},
  doi          = {{10.1007/3-540-60618-1_77}},
  year         = {{1995}},
}

@inbook{16874,
  author       = {{Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783540603139}},
  issn         = {{0302-9743}},
  title        = {{{Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model}}},
  doi          = {{10.1007/3-540-60313-1_131}},
  year         = {{1995}},
}