[{"page":"137--146","_id":"2207","language":[{"iso":"eng"}],"urn":"22075","user_id":"14955","ddc":["040"],"year":"1995","status":"public","title":"Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)","author":[{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"date_updated":"2022-01-06T06:55:24Z","has_accepted_license":"1","file":[{"file_id":"2278","content_type":"application/pdf","relation":"main_file","date_updated":"2018-04-12T07:09:52Z","file_name":"SPAA95.pdf","access_level":"open_access","file_size":284222,"date_created":"2018-04-12T06:56:32Z","creator":"florida"}],"date_created":"2018-04-04T12:43:41Z","type":"conference","department":[{"_id":"79"},{"_id":"63"}],"oa":"1","file_date_updated":"2018-04-12T07:09:52Z","publication":"SPAA","citation":{"ieee":"F. Meyer auf der Heide and C. Scheideler, “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract),” in <i>SPAA</i>, 1995, pp. 137--146.","apa":"Meyer auf der Heide, F., &#38; Scheideler, C. (1995). Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). In <i>SPAA</i> (pp. 137--146).","short":"F. Meyer auf der Heide, C. Scheideler, in: SPAA, 1995, pp. 137--146.","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” In <i>SPAA</i>, 137--146, 1995.","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” <i>SPAA</i>, 1995, pp. 137--146.","bibtex":"@inproceedings{Meyer auf der Heide_Scheideler_1995, title={Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)}, booktitle={SPAA}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1995}, pages={137--146} }","ama":"Meyer auf der Heide F, Scheideler C. Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). In: <i>SPAA</i>. ; 1995:137--146."}},{"file":[{"date_created":"2018-04-12T06:54:40Z","creator":"florida","content_type":"application/pdf","file_id":"2277","date_updated":"2018-04-12T07:09:13Z","relation":"main_file","access_level":"open_access","file_size":407467,"file_name":"STACS95.pdf"}],"date_created":"2018-04-04T12:44:26Z","type":"conference","department":[{"_id":"79"},{"_id":"63"}],"oa":"1","file_date_updated":"2018-04-12T07:09:13Z","publication":"STACS","citation":{"chicago":"Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” In <i>STACS</i>, 267--278, 1995.","short":"F. Meyer auf der Heide, C. Scheideler, V. Stemann, in: STACS, 1995, pp. 267--278.","apa":"Meyer auf der Heide, F., Scheideler, C., &#38; Stemann, V. (1995). Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In <i>STACS</i> (pp. 267--278).","ieee":"F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations,” in <i>STACS</i>, 1995, pp. 267--278.","ama":"Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In: <i>STACS</i>. ; 1995:267--278.","bibtex":"@inproceedings{Meyer auf der Heide_Scheideler_Stemann_1995, title={Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations}, booktitle={STACS}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian and Stemann, Volker}, year={1995}, pages={267--278} }","mla":"Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” <i>STACS</i>, 1995, pp. 267--278."},"page":"267--278","_id":"2208","urn":"22085","language":[{"iso":"eng"}],"user_id":"14955","ddc":["040"],"status":"public","year":"1995","title":"Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"},{"full_name":"Stemann, Volker","first_name":"Volker","last_name":"Stemann"}],"date_updated":"2022-01-06T06:55:24Z","has_accepted_license":"1"},{"citation":{"ama":"Heckel R, Müller J, Taentzer G, Wagner A. Attributed Graph Transformations with Controlled Application of Rules. In: <i>Proceedings of the Colloquium on Graph Transformation and Its Application in Computer Science</i>. Technical Report. Universitat de les Illes Balears; 1995.","bibtex":"@inproceedings{Heckel_Müller_Taentzer_Wagner_1995, series={Technical Report}, title={Attributed Graph Transformations with Controlled Application of Rules}, number={B-19}, booktitle={Proceedings of the Colloquium on Graph Transformation and its Application in Computer Science}, publisher={Universitat de les Illes Balears}, author={Heckel, Reiko and Müller, Jürgen and Taentzer, Gabriele and Wagner, Annika}, year={1995}, collection={Technical Report} }","mla":"Heckel, Reiko, et al. “Attributed Graph Transformations with Controlled Application of Rules.” <i>Proceedings of the Colloquium on Graph Transformation and Its Application in Computer Science</i>, no. B-19, Universitat de les Illes Balears, 1995.","chicago":"Heckel, Reiko, Jürgen Müller, Gabriele Taentzer, and Annika Wagner. “Attributed Graph Transformations with Controlled Application of Rules.” In <i>Proceedings of the Colloquium on Graph Transformation and Its Application in Computer Science</i>. Technical Report. Universitat de les Illes Balears, 1995.","short":"R. Heckel, J. Müller, G. Taentzer, A. Wagner, in: Proceedings of the Colloquium on Graph Transformation and Its Application in Computer Science, Universitat de les Illes Balears, 1995.","apa":"Heckel, R., Müller, J., Taentzer, G., &#38; Wagner, A. (1995). Attributed Graph Transformations with Controlled Application of Rules. In <i>Proceedings of the Colloquium on Graph Transformation and its Application in Computer Science</i>. Universitat de les Illes Balears.","ieee":"R. Heckel, J. Müller, G. Taentzer, and A. Wagner, “Attributed Graph Transformations with Controlled Application of Rules,” in <i>Proceedings of the Colloquium on Graph Transformation and its Application in Computer Science</i>, 1995, no. B-19."},"publication":"Proceedings of the Colloquium on Graph Transformation and its Application in Computer Science","issue":"B-19","abstract":[{"lang":"eng","text":"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."}],"date_created":"2019-02-20T13:59:38Z","department":[{"_id":"66"}],"type":"conference","author":[{"full_name":"Heckel, Reiko","last_name":"Heckel","first_name":"Reiko"},{"last_name":"Müller","first_name":"Jürgen","full_name":"Müller, Jürgen"},{"full_name":"Taentzer, Gabriele","last_name":"Taentzer","first_name":"Gabriele"},{"full_name":"Wagner, Annika","first_name":"Annika","last_name":"Wagner"}],"status":"public","title":"Attributed Graph Transformations with Controlled Application of Rules","year":"1995","date_updated":"2022-01-06T07:03:46Z","language":[{"iso":"eng"}],"_id":"7831","publisher":"Universitat de les Illes Balears","series_title":"Technical Report","user_id":"52534"},{"citation":{"mla":"Thoben, Wilfried, et al. “Record Linkage of Anonymous Data by Control Numbers.” <i>Proceedings of the 18th Annual Conference of the Gesellschaft Für Klassifikation, Oldenburg (Germany)</i>, Springer, 1995, pp. 412–19.","ama":"Thoben W, Appelrath H-J, Sauer S. Record Linkage of Anonymous Data by Control Numbers. In: <i>Proceedings of the 18th Annual Conference of the Gesellschaft Für Klassifikation, Oldenburg (Germany)</i>. Studies in Classification, Data Analysis, and Knowledge Organization. Berlin/Heidelberg: Springer; 1995:412-419.","bibtex":"@inproceedings{Thoben_Appelrath_Sauer_1995, place={Berlin/Heidelberg}, series={Studies in Classification, Data Analysis, and Knowledge Organization}, title={Record Linkage of Anonymous Data by Control Numbers}, booktitle={Proceedings of the 18th Annual Conference of the Gesellschaft für Klassifikation, Oldenburg (Germany)}, publisher={Springer}, author={Thoben, Wilfried and Appelrath, Hans-Jürgen and Sauer, Stefan}, year={1995}, pages={412–419}, collection={Studies in Classification, Data Analysis, and Knowledge Organization} }","apa":"Thoben, W., Appelrath, H.-J., &#38; Sauer, S. (1995). Record Linkage of Anonymous Data by Control Numbers. In <i>Proceedings of the 18th Annual Conference of the Gesellschaft für Klassifikation, Oldenburg (Germany)</i> (pp. 412–419). Berlin/Heidelberg: Springer.","ieee":"W. Thoben, H.-J. Appelrath, and S. Sauer, “Record Linkage of Anonymous Data by Control Numbers,” in <i>Proceedings of the 18th Annual Conference of the Gesellschaft für Klassifikation, Oldenburg (Germany)</i>, 1995, pp. 412–419.","short":"W. Thoben, H.-J. Appelrath, S. Sauer, in: Proceedings of the 18th Annual Conference of the Gesellschaft Für Klassifikation, Oldenburg (Germany), Springer, Berlin/Heidelberg, 1995, pp. 412–419.","chicago":"Thoben, Wilfried, Hans-Jürgen Appelrath, and Stefan Sauer. “Record Linkage of Anonymous Data by Control Numbers.” In <i>Proceedings of the 18th Annual Conference of the Gesellschaft Für Klassifikation, Oldenburg (Germany)</i>, 412–19. Studies in Classification, Data Analysis, and Knowledge Organization. Berlin/Heidelberg: Springer, 1995."},"publication":"Proceedings of the 18th Annual Conference of the Gesellschaft für Klassifikation, Oldenburg (Germany)","department":[{"_id":"66"}],"type":"conference","date_created":"2019-02-20T14:00:22Z","place":"Berlin/Heidelberg","date_updated":"2022-01-06T07:03:46Z","author":[{"full_name":"Thoben, Wilfried","first_name":"Wilfried","last_name":"Thoben"},{"last_name":"Appelrath","first_name":"Hans-Jürgen","full_name":"Appelrath, Hans-Jürgen"},{"last_name":"Sauer","first_name":"Stefan","full_name":"Sauer, Stefan","id":"447"}],"status":"public","year":"1995","title":"Record Linkage of Anonymous Data by Control Numbers","user_id":"52534","_id":"7832","series_title":"Studies in Classification, Data Analysis, and Knowledge Organization","language":[{"iso":"eng"}],"publisher":"Springer","page":"412-419"},{"department":[{"_id":"66"}],"type":"conference","date_created":"2019-02-20T14:01:39Z","abstract":[{"lang":"eng","text":"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."}],"citation":{"chicago":"Heckel, Reiko. “Embedding of Conditional Graph Transformations.” In <i>Proceedings of the Colloquium on Graph Transformation and Its Application in Computer Science</i>. Technical Report. Universitat de les Illes Balears, 1995.","short":"R. Heckel, in: Proceedings of the Colloquium on Graph Transformation and Its Application in Computer Science, Universitat de les Illes Balears, 1995.","apa":"Heckel, R. (1995). Embedding of Conditional Graph Transformations. In <i>Proceedings of the Colloquium on Graph Transformation and its Application in Computer Science</i>. Universitat de les Illes Balears.","ieee":"R. Heckel, “Embedding of Conditional Graph Transformations,” in <i>Proceedings of the Colloquium on Graph Transformation and its Application in Computer Science</i>, 1995, no. B-19.","ama":"Heckel R. Embedding of Conditional Graph Transformations. In: <i>Proceedings of the Colloquium on Graph Transformation and Its Application in Computer Science</i>. Technical Report. Universitat de les Illes Balears; 1995.","bibtex":"@inproceedings{Heckel_1995, series={Technical Report}, title={Embedding of Conditional Graph Transformations}, number={B-19}, booktitle={Proceedings of the Colloquium on Graph Transformation and its Application in Computer Science}, publisher={Universitat de les Illes Balears}, author={Heckel, Reiko}, year={1995}, collection={Technical Report} }","mla":"Heckel, Reiko. “Embedding of Conditional Graph Transformations.” <i>Proceedings of the Colloquium on Graph Transformation and Its Application in Computer Science</i>, no. B-19, Universitat de les Illes Balears, 1995."},"publication":"Proceedings of the Colloquium on Graph Transformation and its Application in Computer Science","issue":"B-19","user_id":"52534","series_title":"Technical Report","_id":"7833","publisher":"Universitat de les Illes Balears","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:46Z","author":[{"last_name":"Heckel","first_name":"Reiko","full_name":"Heckel, Reiko"}],"status":"public","year":"1995","title":"Embedding of Conditional Graph Transformations"},{"citation":{"ama":"Conrad M, Gajewsky M, Holl-Biniasz R, et al. <i>Graphische Spezifikation Ausgewählter Teile von AGG - Einem Algebraischen Graphgrammatiksystem</i>.; 1995.","bibtex":"@book{Conrad_Gajewsky_Holl-Biniasz_Rudolf_Demuth_Weber_Heckel_Müller_Taentzer_Wagner_1995, title={Graphische Spezifikation ausgewählter Teile von AGG - einem algebraischen Graphgrammatiksystem}, 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}, year={1995} }","mla":"Conrad, Mirko, et al. <i>Graphische Spezifikation Ausgewählter Teile von AGG - Einem Algebraischen Graphgrammatiksystem</i>. 1995.","chicago":"Conrad, Mirko, Magdalena Gajewsky, Rainer Holl-Biniasz, Michael Rudolf, Jochen Demuth, Stephan Weber, Reiko Heckel, Jürgen Müller, Gabriele Taentzer, and Annika Wagner. <i>Graphische Spezifikation Ausgewählter Teile von AGG - Einem Algebraischen Graphgrammatiksystem</i>, 1995.","short":"M. Conrad, M. Gajewsky, R. Holl-Biniasz, M. Rudolf, J. Demuth, S. Weber, R. Heckel, J. Müller, G. Taentzer, A. Wagner, Graphische Spezifikation Ausgewählter Teile von AGG - Einem Algebraischen Graphgrammatiksystem, 1995.","apa":"Conrad, M., Gajewsky, M., Holl-Biniasz, R., Rudolf, M., Demuth, J., Weber, S., … Wagner, A. (1995). <i>Graphische Spezifikation ausgewählter Teile von AGG - einem algebraischen Graphgrammatiksystem</i>.","ieee":"M. Conrad <i>et al.</i>, <i>Graphische Spezifikation ausgewählter Teile von AGG - einem algebraischen Graphgrammatiksystem</i>. 1995."},"date_created":"2019-03-03T16:12:49Z","type":"report","department":[{"_id":"66"}],"year":"1995","title":"Graphische Spezifikation ausgewählter Teile von AGG - einem algebraischen Graphgrammatiksystem","status":"public","author":[{"full_name":"Conrad, Mirko","last_name":"Conrad","first_name":"Mirko"},{"full_name":"Gajewsky, Magdalena","first_name":"Magdalena","last_name":"Gajewsky"},{"first_name":"Rainer","last_name":"Holl-Biniasz","full_name":"Holl-Biniasz, Rainer"},{"full_name":"Rudolf, Michael","last_name":"Rudolf","first_name":"Michael"},{"first_name":"Jochen","last_name":"Demuth","full_name":"Demuth, Jochen"},{"full_name":"Weber, Stephan","first_name":"Stephan","last_name":"Weber"},{"full_name":"Heckel, Reiko","last_name":"Heckel","first_name":"Reiko"},{"first_name":"Jürgen","last_name":"Müller","full_name":"Müller, Jürgen"},{"last_name":"Taentzer","first_name":"Gabriele","full_name":"Taentzer, Gabriele"},{"full_name":"Wagner, Annika","last_name":"Wagner","first_name":"Annika"}],"date_updated":"2022-01-06T07:03:52Z","_id":"8194","language":[{"iso":"eng"}],"user_id":"52534"},{"report_number":"19/95","abstract":[{"lang":"eng","text":"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."}],"citation":{"bibtex":"@book{Ebert_Engels_1995, place={Koblenz}, title={Specialization of Object Life Cycle Definitions}, publisher={University of Koblenz-Landau}, author={Ebert, Jürgen and Engels, Gregor}, year={1995} }","ama":"Ebert J, Engels G. <i>Specialization of Object Life Cycle Definitions</i>. Koblenz: University of Koblenz-Landau; 1995.","mla":"Ebert, Jürgen, and Gregor Engels. <i>Specialization of Object Life Cycle Definitions</i>. University of Koblenz-Landau, 1995.","chicago":"Ebert, Jürgen, and Gregor Engels. <i>Specialization of Object Life Cycle Definitions</i>. Koblenz: University of Koblenz-Landau, 1995.","short":"J. Ebert, G. Engels, Specialization of Object Life Cycle Definitions, University of Koblenz-Landau, Koblenz, 1995.","ieee":"J. Ebert and G. Engels, <i>Specialization of Object Life Cycle Definitions</i>. Koblenz: University of Koblenz-Landau, 1995.","apa":"Ebert, J., &#38; Engels, G. (1995). <i>Specialization of Object Life Cycle Definitions</i>. Koblenz: University of Koblenz-Landau."},"department":[{"_id":"66"}],"type":"report","place":"Koblenz","date_created":"2019-03-03T16:12:50Z","date_updated":"2022-01-06T07:03:52Z","author":[{"full_name":"Ebert, Jürgen","first_name":"Jürgen","last_name":"Ebert"},{"id":"107","full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels"}],"year":"1995","status":"public","title":"Specialization of Object Life Cycle Definitions","user_id":"52534","publisher":"University of Koblenz-Landau","_id":"8195","language":[{"iso":"eng"}]},{"citation":{"bibtex":"@book{Engels_Schürr_1995, title={Encapsulated Hierarchical Graphs, Graph Types, and Meta Types}, publisher={Vakgroep Informatica, Rijksuniversiteit Leiden}, author={Engels, Gregor and Schürr, Andy}, year={1995} }","short":"G. Engels, A. Schürr, Encapsulated Hierarchical Graphs, Graph Types, and Meta Types, Vakgroep Informatica, Rijksuniversiteit Leiden, 1995.","ama":"Engels G, Schürr A. <i>Encapsulated Hierarchical Graphs, Graph Types, and Meta Types</i>. Vakgroep Informatica, Rijksuniversiteit Leiden; 1995.","chicago":"Engels, Gregor, and Andy Schürr. <i>Encapsulated Hierarchical Graphs, Graph Types, and Meta Types</i>. Vakgroep Informatica, Rijksuniversiteit Leiden, 1995.","ieee":"G. Engels and A. Schürr, <i>Encapsulated Hierarchical Graphs, Graph Types, and Meta Types</i>. Vakgroep Informatica, Rijksuniversiteit Leiden, 1995.","apa":"Engels, G., &#38; Schürr, A. (1995). <i>Encapsulated Hierarchical Graphs, Graph Types, and Meta Types</i>. Vakgroep Informatica, Rijksuniversiteit Leiden.","mla":"Engels, Gregor, and Andy Schürr. <i>Encapsulated Hierarchical Graphs, Graph Types, and Meta Types</i>. Vakgroep Informatica, Rijksuniversiteit Leiden, 1995."},"report_number":"95-21","date_created":"2019-03-03T16:12:51Z","department":[{"_id":"66"}],"type":"report","author":[{"last_name":"Engels","first_name":"Gregor","full_name":"Engels, Gregor","id":"107"},{"first_name":"Andy","last_name":"Schürr","full_name":"Schürr, Andy"}],"title":"Encapsulated Hierarchical Graphs, Graph Types, and Meta Types","status":"public","year":"1995","date_updated":"2022-01-06T07:03:52Z","language":[{"iso":"eng"}],"_id":"8196","publisher":"Vakgroep Informatica, Rijksuniversiteit Leiden","user_id":"52534"},{"citation":{"mla":"Groenewegen, Luuk, and Gregor Engels. “Coordination by Behavioural Views and Communication Patterns.” <i>Proceedings of the 4th European Workshop on Software Process Technology (EWSPT 1995), Noordwijkerhout (The Netherlands)</i>, vol. 913, Springer, 1995, pp. 189–92, doi:<a href=\"http://dx.doi.org/10.1007/3-540-59205-9_56\">http://dx.doi.org/10.1007/3-540-59205-9_56</a>.","ama":"Groenewegen L, Engels G. Coordination by Behavioural Views and Communication Patterns. In: <i>Proceedings of the 4th European Workshop on Software Process Technology (EWSPT 1995), Noordwijkerhout (The Netherlands)</i>. Vol 913. LNCS. Berlin/Heidelberg: Springer; 1995:189-192. doi:<a href=\"http://dx.doi.org/10.1007/3-540-59205-9_56\">http://dx.doi.org/10.1007/3-540-59205-9_56</a>","bibtex":"@inproceedings{Groenewegen_Engels_1995, place={Berlin/Heidelberg}, series={LNCS}, title={Coordination by Behavioural Views and Communication Patterns}, volume={913}, DOI={<a href=\"http://dx.doi.org/10.1007/3-540-59205-9_56\">http://dx.doi.org/10.1007/3-540-59205-9_56</a>}, booktitle={Proceedings of the 4th European Workshop on Software Process Technology (EWSPT 1995), Noordwijkerhout (The Netherlands)}, publisher={Springer}, author={Groenewegen, Luuk and Engels, Gregor}, year={1995}, pages={189–192}, collection={LNCS} }","apa":"Groenewegen, L., &#38; Engels, G. (1995). Coordination by Behavioural Views and Communication Patterns. In <i>Proceedings of the 4th European Workshop on Software Process Technology (EWSPT 1995), Noordwijkerhout (The Netherlands)</i> (Vol. 913, pp. 189–192). Berlin/Heidelberg: Springer. <a href=\"http://dx.doi.org/10.1007/3-540-59205-9_56\">http://dx.doi.org/10.1007/3-540-59205-9_56</a>","ieee":"L. Groenewegen and G. Engels, “Coordination by Behavioural Views and Communication Patterns,” in <i>Proceedings of the 4th European Workshop on Software Process Technology (EWSPT 1995), Noordwijkerhout (The Netherlands)</i>, 1995, vol. 913, pp. 189–192.","chicago":"Groenewegen, Luuk, and Gregor Engels. “Coordination by Behavioural Views and Communication Patterns.” In <i>Proceedings of the 4th European Workshop on Software Process Technology (EWSPT 1995), Noordwijkerhout (The Netherlands)</i>, 913:189–92. LNCS. Berlin/Heidelberg: Springer, 1995. <a href=\"http://dx.doi.org/10.1007/3-540-59205-9_56\">http://dx.doi.org/10.1007/3-540-59205-9_56</a>.","short":"L. Groenewegen, G. Engels, in: Proceedings of the 4th European Workshop on Software Process Technology (EWSPT 1995), Noordwijkerhout (The Netherlands), Springer, Berlin/Heidelberg, 1995, pp. 189–192."},"publication":"Proceedings of the 4th European Workshop on Software Process Technology (EWSPT 1995), Noordwijkerhout (The Netherlands)","date_created":"2019-03-04T11:52:17Z","place":"Berlin/Heidelberg","department":[{"_id":"66"}],"type":"conference","author":[{"full_name":"Groenewegen, Luuk","last_name":"Groenewegen","first_name":"Luuk"},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"}],"title":"Coordination by Behavioural Views and Communication Patterns","status":"public","year":"1995","intvolume":"       913","date_updated":"2022-01-06T07:03:52Z","_id":"8266","series_title":"LNCS","publisher":"Springer","language":[{"iso":"eng"}],"page":"189-192","volume":913,"user_id":"52534","doi":"http://dx.doi.org/10.1007/3-540-59205-9_56"},{"date_created":"2019-03-04T11:52:18Z","department":[{"_id":"66"}],"type":"conference","citation":{"short":"A. Corradini, R. Heckel, in: Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy), Elsevier, 1995, pp. 46–55.","chicago":"Corradini, Andrea, and Reiko Heckel. “A Compositional Approach to Structuring and Refinement of Typed Graph Grammars.” In <i>Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)</i>, 2:46–55. Electronic Notes in Theoretical Computer Science . Elsevier, 1995.","ieee":"A. Corradini and R. Heckel, “A Compositional Approach to Structuring and Refinement of Typed Graph Grammars,” in <i>Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)</i>, 1995, vol. 2, pp. 46–55.","apa":"Corradini, A., &#38; Heckel, R. (1995). A Compositional Approach to Structuring and Refinement of Typed Graph Grammars. In <i>Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)</i> (Vol. 2, pp. 46–55). Elsevier.","bibtex":"@inproceedings{Corradini_Heckel_1995, series={Electronic Notes in Theoretical Computer Science }, title={A Compositional Approach to Structuring and Refinement of Typed Graph Grammars}, volume={2}, booktitle={Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)}, publisher={Elsevier}, author={Corradini, Andrea and Heckel, Reiko}, year={1995}, pages={46–55}, collection={Electronic Notes in Theoretical Computer Science } }","ama":"Corradini A, Heckel R. A Compositional Approach to Structuring and Refinement of Typed Graph Grammars. In: <i>Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)</i>. Vol 2. Electronic Notes in Theoretical Computer Science . Elsevier; 1995:46-55.","mla":"Corradini, Andrea, and Reiko Heckel. “A Compositional Approach to Structuring and Refinement of Typed Graph Grammars.” <i>Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)</i>, vol. 2, Elsevier, 1995, pp. 46–55."},"publication":"Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)","abstract":[{"text":"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.","lang":"eng"}],"series_title":"Electronic Notes in Theoretical Computer Science ","_id":"8267","publisher":"Elsevier","language":[{"iso":"eng"}],"page":"46-55","volume":2,"user_id":"52534","author":[{"last_name":"Corradini","first_name":"Andrea","full_name":"Corradini, Andrea"},{"last_name":"Heckel","first_name":"Reiko","full_name":"Heckel, Reiko"}],"title":"A Compositional Approach to Structuring and Refinement of Typed Graph Grammars","status":"public","year":"1995","intvolume":"         2","date_updated":"2022-01-06T07:03:52Z"},{"department":[{"_id":"66"}],"type":"conference","date_created":"2019-03-04T11:52:19Z","abstract":[{"lang":"eng","text":"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."}],"citation":{"bibtex":"@inproceedings{Bardohl_Bardohl_Castro_Ehrig_Heckel_Ribeiro_Nunes_Martini_1995, series={Bilateral Seminars of the International Bureau}, title={GRAPHIT: Graphical Support and Integration of Formal and Semiformal Methods for Software Specification and Development}, volume={26}, booktitle={Proceedings of the 3rd German-Brazilian Workshop on Information Technology (1995), Berlin (Germany)}, publisher={Forschungszentrum Jülich GmbH}, author={Bardohl, Bernhard and Bardohl, Roswitha and Castro, Paulo and Ehrig, Hartmut and Heckel, Reiko and Ribeiro, Leila and Nunes, Daltro and Martini, Alfio}, year={1995}, collection={Bilateral Seminars of the International Bureau} }","short":"B. Bardohl, R. Bardohl, P. Castro, H. Ehrig, R. Heckel, L. Ribeiro, D. Nunes, A. Martini, in: Proceedings of the 3rd German-Brazilian Workshop on Information Technology (1995), Berlin (Germany), Forschungszentrum Jülich GmbH, 1995.","ama":"Bardohl B, Bardohl R, Castro P, et al. GRAPHIT: Graphical Support and Integration of Formal and Semiformal Methods for Software Specification and Development. In: <i>Proceedings of the 3rd German-Brazilian Workshop on Information Technology (1995), Berlin (Germany)</i>. Vol 26. Bilateral Seminars of the International Bureau. Forschungszentrum Jülich GmbH; 1995.","chicago":"Bardohl, Bernhard, Roswitha Bardohl, Paulo Castro, Hartmut Ehrig, Reiko Heckel, Leila Ribeiro, Daltro Nunes, and Alfio Martini. “GRAPHIT: Graphical Support and Integration of Formal and Semiformal Methods for Software Specification and Development.” In <i>Proceedings of the 3rd German-Brazilian Workshop on Information Technology (1995), Berlin (Germany)</i>, Vol. 26. Bilateral Seminars of the International Bureau. Forschungszentrum Jülich GmbH, 1995.","ieee":"B. Bardohl <i>et al.</i>, “GRAPHIT: Graphical Support and Integration of Formal and Semiformal Methods for Software Specification and Development,” in <i>Proceedings of the 3rd German-Brazilian Workshop on Information Technology (1995), Berlin (Germany)</i>, 1995, vol. 26.","apa":"Bardohl, B., Bardohl, R., Castro, P., Ehrig, H., Heckel, R., Ribeiro, L., … Martini, A. (1995). GRAPHIT: Graphical Support and Integration of Formal and Semiformal Methods for Software Specification and Development. In <i>Proceedings of the 3rd German-Brazilian Workshop on Information Technology (1995), Berlin (Germany)</i> (Vol. 26). Forschungszentrum Jülich GmbH.","mla":"Bardohl, Bernhard, et al. “GRAPHIT: Graphical Support and Integration of Formal and Semiformal Methods for Software Specification and Development.” <i>Proceedings of the 3rd German-Brazilian Workshop on Information Technology (1995), Berlin (Germany)</i>, vol. 26, Forschungszentrum Jülich GmbH, 1995."},"publication":"Proceedings of the 3rd German-Brazilian Workshop on Information Technology (1995), Berlin (Germany)","volume":26,"user_id":"52534","_id":"8268","publisher":"Forschungszentrum Jülich GmbH","series_title":"Bilateral Seminars of the International Bureau","language":[{"iso":"eng"}],"intvolume":"        26","date_updated":"2022-01-06T07:03:52Z","author":[{"full_name":"Bardohl, Bernhard","last_name":"Bardohl","first_name":"Bernhard"},{"last_name":"Bardohl","first_name":"Roswitha","full_name":"Bardohl, Roswitha"},{"first_name":"Paulo","last_name":"Castro","full_name":"Castro, Paulo"},{"full_name":"Ehrig, Hartmut","first_name":"Hartmut","last_name":"Ehrig"},{"last_name":"Heckel","first_name":"Reiko","full_name":"Heckel, Reiko"},{"full_name":"Ribeiro, Leila","last_name":"Ribeiro","first_name":"Leila"},{"first_name":"Daltro","last_name":"Nunes","full_name":"Nunes, Daltro"},{"first_name":"Alfio","last_name":"Martini","full_name":"Martini, Alfio"}],"status":"public","title":"GRAPHIT: Graphical Support and Integration of Formal and Semiformal Methods for Software Specification and Development","year":"1995"},{"user_id":"52534","doi":"http://dx.doi.org/10.1016/S1571-0661(05)80186-0","_id":"8269","language":[{"iso":"eng"}],"series_title":"Electronic Notes in Theoretical Computer Science","publisher":"Elsevier","page":"101-109","date_updated":"2022-01-06T07:03:52Z","author":[{"id":"107","full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"},{"full_name":"Schürr, Andy","first_name":"Andy","last_name":"Schürr"}],"status":"public","title":"Encapsulated Hierarchical Graphs, Graph Types, and Meta Types","year":"1995","department":[{"_id":"66"}],"type":"conference","date_created":"2019-03-04T11:52:20Z","place":"Amsterdam, The Netherlands","abstract":[{"text":"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.","lang":"eng"}],"citation":{"short":"G. Engels, A. Schürr, in: Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy), Elsevier, Amsterdam, The Netherlands, 1995, pp. 101–109.","chicago":"Engels, Gregor, and Andy Schürr. “Encapsulated Hierarchical Graphs, Graph Types, and Meta Types.” In <i>Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)</i>, 101–9. Electronic Notes in Theoretical Computer Science. Amsterdam, The Netherlands: Elsevier, 1995. <a href=\"http://dx.doi.org/10.1016/S1571-0661(05)80186-0\">http://dx.doi.org/10.1016/S1571-0661(05)80186-0</a>.","ieee":"G. Engels and A. Schürr, “Encapsulated Hierarchical Graphs, Graph Types, and Meta Types,” in <i>Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)</i>, 1995, pp. 101–109.","apa":"Engels, G., &#38; Schürr, A. (1995). Encapsulated Hierarchical Graphs, Graph Types, and Meta Types. In <i>Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)</i> (pp. 101–109). Amsterdam, The Netherlands: Elsevier. <a href=\"http://dx.doi.org/10.1016/S1571-0661(05)80186-0\">http://dx.doi.org/10.1016/S1571-0661(05)80186-0</a>","bibtex":"@inproceedings{Engels_Schürr_1995, place={Amsterdam, The Netherlands}, series={Electronic Notes in Theoretical Computer Science}, title={Encapsulated Hierarchical Graphs, Graph Types, and Meta Types}, DOI={<a href=\"http://dx.doi.org/10.1016/S1571-0661(05)80186-0\">http://dx.doi.org/10.1016/S1571-0661(05)80186-0</a>}, booktitle={Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)}, publisher={Elsevier}, author={Engels, Gregor and Schürr, Andy}, year={1995}, pages={101–109}, collection={Electronic Notes in Theoretical Computer Science} }","ama":"Engels G, Schürr A. Encapsulated Hierarchical Graphs, Graph Types, and Meta Types. In: <i>Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)</i>. Electronic Notes in Theoretical Computer Science. Amsterdam, The Netherlands: Elsevier; 1995:101-109. doi:<a href=\"http://dx.doi.org/10.1016/S1571-0661(05)80186-0\">http://dx.doi.org/10.1016/S1571-0661(05)80186-0</a>","mla":"Engels, Gregor, and Andy Schürr. “Encapsulated Hierarchical Graphs, Graph Types, and Meta Types.” <i>Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)</i>, Elsevier, 1995, pp. 101–09, doi:<a href=\"http://dx.doi.org/10.1016/S1571-0661(05)80186-0\">http://dx.doi.org/10.1016/S1571-0661(05)80186-0</a>."},"publication":"Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)"},{"publication":"Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)","citation":{"short":"R. Heckel, A. Wagner, in: Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy), Elsevier, 1995, pp. 118–126.","chicago":"Heckel, Reiko, and Annika Wagner. “Ensuring Consistency of Conditional Graph Grammars - A Constructive Approach.” In <i>Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)</i>, 2:118–26. Electronic Notes in Theoretical Computer Science. Elsevier, 1995. <a href=\"http://dx.doi.org/10.1016/S1571-0661(05)80188-4\">http://dx.doi.org/10.1016/S1571-0661(05)80188-4</a>.","ieee":"R. Heckel and A. Wagner, “Ensuring Consistency of Conditional Graph Grammars - A constructive Approach,” in <i>Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)</i>, 1995, vol. 2, pp. 118–126.","apa":"Heckel, R., &#38; Wagner, A. (1995). Ensuring Consistency of Conditional Graph Grammars - A constructive Approach. In <i>Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)</i> (Vol. 2, pp. 118–126). Elsevier. <a href=\"http://dx.doi.org/10.1016/S1571-0661(05)80188-4\">http://dx.doi.org/10.1016/S1571-0661(05)80188-4</a>","bibtex":"@inproceedings{Heckel_Wagner_1995, series={Electronic Notes in Theoretical Computer Science}, title={Ensuring Consistency of Conditional Graph Grammars - A constructive Approach}, volume={2}, DOI={<a href=\"http://dx.doi.org/10.1016/S1571-0661(05)80188-4\">http://dx.doi.org/10.1016/S1571-0661(05)80188-4</a>}, booktitle={Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)}, publisher={Elsevier}, author={Heckel, Reiko and Wagner, Annika}, year={1995}, pages={118–126}, collection={Electronic Notes in Theoretical Computer Science} }","ama":"Heckel R, Wagner A. Ensuring Consistency of Conditional Graph Grammars - A constructive Approach. In: <i>Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)</i>. Vol 2. Electronic Notes in Theoretical Computer Science. Elsevier; 1995:118-126. doi:<a href=\"http://dx.doi.org/10.1016/S1571-0661(05)80188-4\">http://dx.doi.org/10.1016/S1571-0661(05)80188-4</a>","mla":"Heckel, Reiko, and Annika Wagner. “Ensuring Consistency of Conditional Graph Grammars - A Constructive Approach.” <i>Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)</i>, vol. 2, Elsevier, 1995, pp. 118–26, doi:<a href=\"http://dx.doi.org/10.1016/S1571-0661(05)80188-4\">http://dx.doi.org/10.1016/S1571-0661(05)80188-4</a>."},"type":"conference","department":[{"_id":"66"}],"date_created":"2019-03-04T11:52:21Z","date_updated":"2022-01-06T07:03:53Z","intvolume":"         2","year":"1995","title":"Ensuring Consistency of Conditional Graph Grammars - A constructive Approach","status":"public","author":[{"first_name":"Reiko","last_name":"Heckel","full_name":"Heckel, Reiko"},{"full_name":"Wagner, Annika","last_name":"Wagner","first_name":"Annika"}],"doi":"http://dx.doi.org/10.1016/S1571-0661(05)80188-4","user_id":"52534","volume":2,"page":"118-126","publisher":"Elsevier","_id":"8270","language":[{"iso":"eng"}],"series_title":"Electronic Notes in Theoretical Computer Science"},{"type":"journal_article","department":[{"_id":"63"}],"date_created":"2020-04-15T11:28:35Z","publication":"Information Processing Letters","citation":{"chicago":"Breslauer, Dany, Artur Czumaj, Devdatt P. Dubhashi, and Friedhelm Meyer auf der Heide. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.” <i>Information Processing Letters</i>, 1995, 103–10. <a href=\"https://doi.org/10.1016/s0020-0190(97)00032-x\">https://doi.org/10.1016/s0020-0190(97)00032-x</a>.","ama":"Breslauer D, Czumaj A, Dubhashi DP, Meyer auf der Heide F. Transforming comparison model lower bounds to the parallel-random-access-machine. <i>Information Processing Letters</i>. 1995:103-110. doi:<a href=\"https://doi.org/10.1016/s0020-0190(97)00032-x\">10.1016/s0020-0190(97)00032-x</a>","short":"D. Breslauer, A. Czumaj, D.P. Dubhashi, F. Meyer auf der Heide, Information Processing Letters (1995) 103–110.","bibtex":"@article{Breslauer_Czumaj_Dubhashi_Meyer auf der Heide_1995, title={Transforming comparison model lower bounds to the parallel-random-access-machine}, DOI={<a href=\"https://doi.org/10.1016/s0020-0190(97)00032-x\">10.1016/s0020-0190(97)00032-x</a>}, journal={Information Processing Letters}, author={Breslauer, Dany and Czumaj, Artur and Dubhashi, Devdatt P. and Meyer auf der Heide, Friedhelm}, year={1995}, pages={103–110} }","mla":"Breslauer, Dany, et al. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.” <i>Information Processing Letters</i>, 1995, pp. 103–10, doi:<a href=\"https://doi.org/10.1016/s0020-0190(97)00032-x\">10.1016/s0020-0190(97)00032-x</a>.","apa":"Breslauer, D., Czumaj, A., Dubhashi, D. P., &#38; Meyer auf der Heide, F. (1995). Transforming comparison model lower bounds to the parallel-random-access-machine. <i>Information Processing Letters</i>, 103–110. <a href=\"https://doi.org/10.1016/s0020-0190(97)00032-x\">https://doi.org/10.1016/s0020-0190(97)00032-x</a>","ieee":"D. Breslauer, A. Czumaj, D. P. Dubhashi, and F. Meyer auf der Heide, “Transforming comparison model lower bounds to the parallel-random-access-machine,” <i>Information Processing Letters</i>, pp. 103–110, 1995."},"user_id":"15415","doi":"10.1016/s0020-0190(97)00032-x","page":"103-110","_id":"16566","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:52:52Z","title":"Transforming comparison model lower bounds to the parallel-random-access-machine","status":"public","year":"1995","author":[{"full_name":"Breslauer, Dany","first_name":"Dany","last_name":"Breslauer"},{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"last_name":"Dubhashi","first_name":"Devdatt P.","full_name":"Dubhashi, Devdatt P."},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"publication_identifier":{"issn":["0020-0190"]}},{"status":"public","title":"A packet routing protocol for arbitrary networks","year":"1995","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540590422","9783540491750"]},"author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"last_name":"Vöcking","first_name":"Berthold","full_name":"Vöcking, Berthold"}],"publication_status":"published","date_updated":"2022-01-06T06:52:54Z","language":[{"iso":"eng"}],"_id":"16704","user_id":"15415","doi":"10.1007/3-540-59042-0_81","publication":"STACS 95","citation":{"chicago":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol for Arbitrary Networks.” In <i>STACS 95</i>. Berlin, Heidelberg, 1995. <a href=\"https://doi.org/10.1007/3-540-59042-0_81\">https://doi.org/10.1007/3-540-59042-0_81</a>.","short":"F. Meyer auf der Heide, B. Vöcking, in: STACS 95, Berlin, Heidelberg, 1995.","ieee":"F. Meyer auf der Heide and B. Vöcking, “A packet routing protocol for arbitrary networks,” in <i>STACS 95</i>, Berlin, Heidelberg, 1995.","apa":"Meyer auf der Heide, F., &#38; Vöcking, B. (1995). A packet routing protocol for arbitrary networks. In <i>STACS 95</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-59042-0_81\">https://doi.org/10.1007/3-540-59042-0_81</a>","bibtex":"@inbook{Meyer auf der Heide_Vöcking_1995, place={Berlin, Heidelberg}, title={A packet routing protocol for arbitrary networks}, DOI={<a href=\"https://doi.org/10.1007/3-540-59042-0_81\">10.1007/3-540-59042-0_81</a>}, booktitle={STACS 95}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold}, year={1995} }","ama":"Meyer auf der Heide F, Vöcking B. A packet routing protocol for arbitrary networks. In: <i>STACS 95</i>. Berlin, Heidelberg; 1995. doi:<a href=\"https://doi.org/10.1007/3-540-59042-0_81\">10.1007/3-540-59042-0_81</a>","mla":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol for Arbitrary Networks.” <i>STACS 95</i>, 1995, doi:<a href=\"https://doi.org/10.1007/3-540-59042-0_81\">10.1007/3-540-59042-0_81</a>."},"date_created":"2020-04-16T13:36:32Z","place":"Berlin, Heidelberg","type":"book_chapter","department":[{"_id":"63"}]},{"date_created":"2020-04-16T13:40:52Z","place":"Berlin, Heidelberg","department":[{"_id":"63"}],"type":"book_chapter","citation":{"ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Shared memory simulations with triple-logarithmic delay,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1995.","mla":"Czumaj, Artur, et al. “Shared Memory Simulations with Triple-Logarithmic Delay.” <i>Lecture Notes in Computer Science</i>, 1995, doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_133\">10.1007/3-540-60313-1_133</a>.","apa":"Czumaj, A., Meyer auf der Heide, F., &#38; Stemann, V. (1995). Shared memory simulations with triple-logarithmic delay. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-60313-1_133\">https://doi.org/10.1007/3-540-60313-1_133</a>","bibtex":"@inbook{Czumaj_Meyer auf der Heide_Stemann_1995, place={Berlin, Heidelberg}, title={Shared memory simulations with triple-logarithmic delay}, DOI={<a href=\"https://doi.org/10.1007/3-540-60313-1_133\">10.1007/3-540-60313-1_133</a>}, booktitle={Lecture Notes in Computer Science}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1995} }","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. Shared memory simulations with triple-logarithmic delay. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1995. doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_133\">10.1007/3-540-60313-1_133</a>","short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.","chicago":"Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Shared Memory Simulations with Triple-Logarithmic Delay.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 1995. <a href=\"https://doi.org/10.1007/3-540-60313-1_133\">https://doi.org/10.1007/3-540-60313-1_133</a>."},"publication":"Lecture Notes in Computer Science","_id":"16705","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1007/3-540-60313-1_133","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540603139","9783540449133"]},"author":[{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Stemann","first_name":"Volker","full_name":"Stemann, Volker"}],"title":"Shared memory simulations with triple-logarithmic delay","year":"1995","status":"public","publication_status":"published","date_updated":"2022-01-06T06:52:54Z"},{"type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-16T13:47:15Z","publication":"Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures  - SPAA '95","citation":{"mla":"Meyer auf der Heide, Friedhelm, et al. “Optimal Trade-Offs between Size and Slowdown for Universal Parallel Networks.” <i>Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95</i>, 1995, doi:<a href=\"https://doi.org/10.1145/215399.215430\">10.1145/215399.215430</a>.","ama":"Meyer auf der Heide F, Storch M, Wanka R. Optimal trade-offs between size and slowdown for universal parallel networks. In: <i>Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95</i>. ; 1995. doi:<a href=\"https://doi.org/10.1145/215399.215430\">10.1145/215399.215430</a>","bibtex":"@inproceedings{Meyer auf der Heide_Storch_Wanka_1995, title={Optimal trade-offs between size and slowdown for universal parallel networks}, DOI={<a href=\"https://doi.org/10.1145/215399.215430\">10.1145/215399.215430</a>}, booktitle={Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’95}, author={Meyer auf der Heide, Friedhelm and Storch, Martin and Wanka, Rolf}, year={1995} }","apa":"Meyer auf der Heide, F., Storch, M., &#38; Wanka, R. (1995). Optimal trade-offs between size and slowdown for universal parallel networks. In <i>Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’95</i>. <a href=\"https://doi.org/10.1145/215399.215430\">https://doi.org/10.1145/215399.215430</a>","ieee":"F. Meyer auf der Heide, M. Storch, and R. Wanka, “Optimal trade-offs between size and slowdown for universal parallel networks,” in <i>Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’95</i>, 1995.","short":"F. Meyer auf der Heide, M. Storch, R. Wanka, in: Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95, 1995.","chicago":"Meyer auf der Heide, Friedhelm, Martin Storch, and Rolf Wanka. “Optimal Trade-Offs between Size and Slowdown for Universal Parallel Networks.” In <i>Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95</i>, 1995. <a href=\"https://doi.org/10.1145/215399.215430\">https://doi.org/10.1145/215399.215430</a>."},"user_id":"15415","doi":"10.1145/215399.215430","_id":"16706","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:52:54Z","title":"Optimal trade-offs between size and slowdown for universal parallel networks","status":"public","year":"1995","publication_identifier":{"isbn":["0897917170"]},"author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Storch, Martin","last_name":"Storch","first_name":"Martin"},{"full_name":"Wanka, Rolf","first_name":"Rolf","last_name":"Wanka"}]},{"language":[{"iso":"eng"}],"_id":"16707","user_id":"15415","doi":"10.1109/istcs.1995.377051","status":"public","title":"Improved optimal shared memory simulations, and the power of reconfiguration","year":"1995","author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Stemann","first_name":"Volker","full_name":"Stemann, Volker"}],"publication_identifier":{"isbn":["0818669152"]},"publication_status":"published","date_updated":"2022-01-06T06:52:54Z","date_created":"2020-04-16T13:49:13Z","type":"conference","department":[{"_id":"63"}],"publication":"Proceedings Third Israel Symposium on the Theory of Computing and Systems","citation":{"bibtex":"@inproceedings{Czumaj_Meyer auf der Heide_Stemann_1995, title={Improved optimal shared memory simulations, and the power of reconfiguration}, DOI={<a href=\"https://doi.org/10.1109/istcs.1995.377051\">10.1109/istcs.1995.377051</a>}, booktitle={Proceedings Third Israel Symposium on the Theory of Computing and Systems}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1995} }","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. Improved optimal shared memory simulations, and the power of reconfiguration. In: <i>Proceedings Third Israel Symposium on the Theory of Computing and Systems</i>. ; 1995. doi:<a href=\"https://doi.org/10.1109/istcs.1995.377051\">10.1109/istcs.1995.377051</a>","mla":"Czumaj, Artur, et al. “Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.” <i>Proceedings Third Israel Symposium on the Theory of Computing and Systems</i>, 1995, doi:<a href=\"https://doi.org/10.1109/istcs.1995.377051\">10.1109/istcs.1995.377051</a>.","short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995.","chicago":"Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.” In <i>Proceedings Third Israel Symposium on the Theory of Computing and Systems</i>, 1995. <a href=\"https://doi.org/10.1109/istcs.1995.377051\">https://doi.org/10.1109/istcs.1995.377051</a>.","ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Improved optimal shared memory simulations, and the power of reconfiguration,” 1995, doi: <a href=\"https://doi.org/10.1109/istcs.1995.377051\">10.1109/istcs.1995.377051</a>.","apa":"Czumaj, A., Meyer auf der Heide, F., &#38; Stemann, V. (1995). Improved optimal shared memory simulations, and the power of reconfiguration. <i>Proceedings Third Israel Symposium on the Theory of Computing and Systems</i>. <a href=\"https://doi.org/10.1109/istcs.1995.377051\">https://doi.org/10.1109/istcs.1995.377051</a>"}},{"publication":"Graph-Theoretic Concepts in Computer Science","citation":{"chicago":"Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.” In <i>Graph-Theoretic Concepts in Computer Science</i>. Berlin, Heidelberg, 1995. <a href=\"https://doi.org/10.1007/3-540-60618-1_77\">https://doi.org/10.1007/3-540-60618-1_77</a>.","short":"F. Meyer auf der Heide, M. Westermann, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 1995.","ieee":"F. Meyer auf der Heide and M. Westermann, “Hot-potato routing on multi-dimensional tori,” in <i>Graph-Theoretic Concepts in Computer Science</i>, Berlin, Heidelberg, 1995.","apa":"Meyer auf der Heide, F., &#38; Westermann, M. (1995). Hot-potato routing on multi-dimensional tori. In <i>Graph-Theoretic Concepts in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-60618-1_77\">https://doi.org/10.1007/3-540-60618-1_77</a>","bibtex":"@inbook{Meyer auf der Heide_Westermann_1995, place={Berlin, Heidelberg}, title={Hot-potato routing on multi-dimensional tori}, DOI={<a href=\"https://doi.org/10.1007/3-540-60618-1_77\">10.1007/3-540-60618-1_77</a>}, booktitle={Graph-Theoretic Concepts in Computer Science}, author={Meyer auf der Heide, Friedhelm and Westermann, Matthias}, year={1995} }","ama":"Meyer auf der Heide F, Westermann M. Hot-potato routing on multi-dimensional tori. In: <i>Graph-Theoretic Concepts in Computer Science</i>. Berlin, Heidelberg; 1995. doi:<a href=\"https://doi.org/10.1007/3-540-60618-1_77\">10.1007/3-540-60618-1_77</a>","mla":"Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.” <i>Graph-Theoretic Concepts in Computer Science</i>, 1995, doi:<a href=\"https://doi.org/10.1007/3-540-60618-1_77\">10.1007/3-540-60618-1_77</a>."},"place":"Berlin, Heidelberg","date_created":"2020-04-17T07:46:18Z","type":"book_chapter","department":[{"_id":"63"}],"title":"Hot-potato routing on multi-dimensional tori","year":"1995","status":"public","publication_identifier":{"isbn":["9783540606185","9783540484875"],"issn":["0302-9743","1611-3349"]},"author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Westermann","first_name":"Matthias","full_name":"Westermann, Matthias"}],"date_updated":"2022-01-06T06:52:55Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"16717","doi":"10.1007/3-540-60618-1_77","user_id":"15415"},{"status":"public","title":"Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model","year":"1995","author":[{"last_name":"Bäumker","first_name":"Armin","full_name":"Bäumker, Armin"},{"last_name":"Dittrich","first_name":"Wolfgang","full_name":"Dittrich, Wolfgang"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540603139","9783540449133"]},"date_updated":"2022-01-06T06:52:58Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"16874","doi":"10.1007/3-540-60313-1_131","user_id":"15415","publication":"Lecture Notes in Computer Science","citation":{"bibtex":"@inbook{Bäumker_Dittrich_Meyer auf der Heide_1995, place={Berlin, Heidelberg}, title={Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model}, DOI={<a href=\"https://doi.org/10.1007/3-540-60313-1_131\">10.1007/3-540-60313-1_131</a>}, booktitle={Lecture Notes in Computer Science}, author={Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm}, year={1995} }","ama":"Bäumker A, Dittrich W, Meyer auf der Heide F. Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1995. doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_131\">10.1007/3-540-60313-1_131</a>","mla":"Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.” <i>Lecture Notes in Computer Science</i>, 1995, doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_131\">10.1007/3-540-60313-1_131</a>.","short":"A. Bäumker, W. Dittrich, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.","chicago":"Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 1995. <a href=\"https://doi.org/10.1007/3-540-60313-1_131\">https://doi.org/10.1007/3-540-60313-1_131</a>.","ieee":"A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1995.","apa":"Bäumker, A., Dittrich, W., &#38; Meyer auf der Heide, F. (1995). Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-60313-1_131\">https://doi.org/10.1007/3-540-60313-1_131</a>"},"place":"Berlin, Heidelberg","date_created":"2020-04-27T13:59:05Z","type":"book_chapter","department":[{"_id":"63"}]}]