[{"_id":"8268","language":[{"iso":"eng"}],"series_title":"Bilateral Seminars of the International Bureau","publisher":"Forschungszentrum Jülich GmbH","user_id":"52534","volume":26,"title":"GRAPHIT: Graphical Support and Integration of Formal and Semiformal Methods for Software Specification and Development","status":"public","year":"1995","author":[{"full_name":"Bardohl, Bernhard","first_name":"Bernhard","last_name":"Bardohl"},{"full_name":"Bardohl, Roswitha","first_name":"Roswitha","last_name":"Bardohl"},{"first_name":"Paulo","last_name":"Castro","full_name":"Castro, Paulo"},{"full_name":"Ehrig, Hartmut","first_name":"Hartmut","last_name":"Ehrig"},{"full_name":"Heckel, Reiko","first_name":"Reiko","last_name":"Heckel"},{"full_name":"Ribeiro, Leila","last_name":"Ribeiro","first_name":"Leila"},{"first_name":"Daltro","last_name":"Nunes","full_name":"Nunes, Daltro"},{"full_name":"Martini, Alfio","first_name":"Alfio","last_name":"Martini"}],"date_updated":"2022-01-06T07:03:52Z","intvolume":"        26","date_created":"2019-03-04T11:52:19Z","type":"conference","department":[{"_id":"66"}],"publication":"Proceedings of the 3rd German-Brazilian Workshop on Information Technology (1995), Berlin (Germany)","citation":{"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.","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."},"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."}]},{"page":"101-109","language":[{"iso":"eng"}],"_id":"8269","series_title":"Electronic Notes in Theoretical Computer Science","publisher":"Elsevier","user_id":"52534","doi":"http://dx.doi.org/10.1016/S1571-0661(05)80186-0","year":"1995","status":"public","title":"Encapsulated Hierarchical Graphs, Graph Types, and Meta Types","author":[{"full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels","id":"107"},{"first_name":"Andy","last_name":"Schürr","full_name":"Schürr, Andy"}],"date_updated":"2022-01-06T07:03:52Z","date_created":"2019-03-04T11:52:20Z","place":"Amsterdam, The Netherlands","type":"conference","department":[{"_id":"66"}],"publication":"Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)","citation":{"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>.","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>","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>","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>.","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."},"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":"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>."},"publication":"Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)","date_created":"2019-03-04T11:52:21Z","department":[{"_id":"66"}],"type":"conference","author":[{"last_name":"Heckel","first_name":"Reiko","full_name":"Heckel, Reiko"},{"full_name":"Wagner, Annika","first_name":"Annika","last_name":"Wagner"}],"title":"Ensuring Consistency of Conditional Graph Grammars - A constructive Approach","year":"1995","status":"public","intvolume":"         2","date_updated":"2022-01-06T07:03:53Z","_id":"8270","series_title":"Electronic Notes in Theoretical Computer Science","language":[{"iso":"eng"}],"publisher":"Elsevier","page":"118-126","volume":2,"user_id":"52534","doi":"http://dx.doi.org/10.1016/S1571-0661(05)80188-4"},{"citation":{"mla":"Kremer, H. Hugo. “Existenzgründung.” <i>Meisterprüfung - Lernen für die Praxis - Unternehmensführung 1</i>, edited by U. Braukmann et al., 1st ed., 1995, pp. 19–94.","apa":"Kremer, H.-H. (1995). Existenzgründung. In U. Braukmann, A. Diettrich, H.-H. Kremer, P. F. E. Sloane, &#38; E. Stickling (Eds.), <i>Meisterprüfung - Lernen für die Praxis - Unternehmensführung 1</i> (1st ed., pp. 19–94). Düsseldorf.","ieee":"H.-H. Kremer, “Existenzgründung,” in <i>Meisterprüfung - Lernen für die Praxis - Unternehmensführung 1</i>, 1st ed., U. Braukmann, A. Diettrich, H.-H. Kremer, P. F. E. Sloane, and E. Stickling, Eds. Düsseldorf, 1995, pp. 19–94.","chicago":"Kremer, H.-Hugo. “Existenzgründung.” In <i>Meisterprüfung - Lernen für die Praxis - Unternehmensführung 1</i>, edited by U. Braukmann, A. Diettrich, H.-H. Kremer, P.F.E. Sloane, and E. Stickling, 1st ed., 19–94. Düsseldorf, 1995.","ama":"Kremer H-H. Existenzgründung. In: Braukmann U, Diettrich A, Kremer H-H, Sloane PFE, Stickling E, eds. <i>Meisterprüfung - Lernen für die Praxis - Unternehmensführung 1</i>. 1st ed. Düsseldorf; 1995:19-94.","short":"H.-H. Kremer, in: U. Braukmann, A. Diettrich, H.-H. Kremer, P.F.E. Sloane, E. Stickling (Eds.), Meisterprüfung - Lernen für die Praxis - Unternehmensführung 1, 1st ed., Düsseldorf, 1995, pp. 19–94.","bibtex":"@inbook{Kremer_1995, place={Düsseldorf}, edition={1}, title={Existenzgründung}, booktitle={Meisterprüfung - Lernen für die Praxis - Unternehmensführung 1}, author={Kremer, H.-Hugo}, editor={Braukmann, U. and Diettrich, A. and Kremer, H.-H. and Sloane, P.F.E. and Stickling, E.Editors}, year={1995}, pages={19–94} }"},"publication":"Meisterprüfung - Lernen für die Praxis - Unternehmensführung 1","place":"Düsseldorf","date_created":"2019-03-06T11:11:56Z","department":[{"_id":"211"}],"type":"book_chapter","author":[{"id":"15280","last_name":"Kremer","first_name":"H.-Hugo","full_name":"Kremer, H.-Hugo"}],"title":"Existenzgründung","status":"public","year":"1995","date_updated":"2022-01-06T07:03:53Z","_id":"8354","edition":"1","language":[{"iso":"ger"}],"page":"19-94","editor":[{"last_name":"Braukmann","first_name":"U.","full_name":"Braukmann, U."},{"first_name":"A.","last_name":"Diettrich","full_name":"Diettrich, A."},{"full_name":"Kremer, H.-H.","last_name":"Kremer","first_name":"H.-H."},{"full_name":"Sloane, P.F.E.","first_name":"P.F.E.","last_name":"Sloane"},{"last_name":"Stickling","first_name":"E.","full_name":"Stickling, E."}],"user_id":"44715"},{"publication_status":"published","date_updated":"2022-01-06T06:52:52Z","title":"Symmetry Breaking Bifurcations of Chaotic Attractors","status":"public","year":"1995","author":[{"last_name":"Aston","first_name":"Philip J.","full_name":"Aston, Philip J."},{"full_name":"Dellnitz, Michael","first_name":"Michael","last_name":"Dellnitz"}],"publication_identifier":{"issn":["0218-1274","1793-6551"]},"user_id":"15701","doi":"10.1142/s021812749500123x","page":"1643-1676","_id":"16510","language":[{"iso":"eng"}],"abstract":[{"text":"<jats:p> In an array of coupled oscillators, synchronous chaos may occur in the sense that all the oscillators behave identically although the corresponding motion is chaotic. When a parameter is varied this fully symmetric dynamical state can lose its stability, and the main purpose of this paper is to investigate which type of dynamical behavior is expected to be observed once the loss of stability has occurred. The essential tool is a classification of Lyapunov exponents based on the symmetry of the underlying problem. This classification is crucial in the derivation of the analytical results but it also allows an efficient computation of the dominant Lyapunov exponent associated with each symmetry type. We show how these dominant exponents determine the stability of invariant sets possessing various instantaneous symmetries, and this leads to the idea of symmetry breaking bifurcations of chaotic attractors. Finally, the results and ideas are illustrated for several systems of coupled oscillators. </jats:p>","lang":"eng"}],"publication":"International Journal of Bifurcation and Chaos","citation":{"bibtex":"@article{Aston_Dellnitz_1995, title={Symmetry Breaking Bifurcations of Chaotic Attractors}, DOI={<a href=\"https://doi.org/10.1142/s021812749500123x\">10.1142/s021812749500123x</a>}, journal={International Journal of Bifurcation and Chaos}, author={Aston, Philip J. and Dellnitz, Michael}, year={1995}, pages={1643–1676} }","chicago":"Aston, Philip J., and Michael Dellnitz. “Symmetry Breaking Bifurcations of Chaotic Attractors.” <i>International Journal of Bifurcation and Chaos</i>, 1995, 1643–76. <a href=\"https://doi.org/10.1142/s021812749500123x\">https://doi.org/10.1142/s021812749500123x</a>.","ama":"Aston PJ, Dellnitz M. Symmetry Breaking Bifurcations of Chaotic Attractors. <i>International Journal of Bifurcation and Chaos</i>. 1995:1643-1676. doi:<a href=\"https://doi.org/10.1142/s021812749500123x\">10.1142/s021812749500123x</a>","short":"P.J. Aston, M. Dellnitz, International Journal of Bifurcation and Chaos (1995) 1643–1676.","ieee":"P. J. Aston and M. Dellnitz, “Symmetry Breaking Bifurcations of Chaotic Attractors,” <i>International Journal of Bifurcation and Chaos</i>, pp. 1643–1676, 1995.","apa":"Aston, P. J., &#38; Dellnitz, M. (1995). Symmetry Breaking Bifurcations of Chaotic Attractors. <i>International Journal of Bifurcation and Chaos</i>, 1643–1676. <a href=\"https://doi.org/10.1142/s021812749500123x\">https://doi.org/10.1142/s021812749500123x</a>","mla":"Aston, Philip J., and Michael Dellnitz. “Symmetry Breaking Bifurcations of Chaotic Attractors.” <i>International Journal of Bifurcation and Chaos</i>, 1995, pp. 1643–76, doi:<a href=\"https://doi.org/10.1142/s021812749500123x\">10.1142/s021812749500123x</a>."},"type":"journal_article","department":[{"_id":"101"}],"date_created":"2020-04-15T07:23:50Z"},{"department":[{"_id":"101"}],"type":"journal_article","date_created":"2020-04-15T08:25:12Z","citation":{"mla":"Dellnitz, M., and C. Heinrich. “Admissible Symmetry Increasing Bifurcations.” <i>Nonlinearity</i>, 1995, pp. 1039–66, doi:<a href=\"https://doi.org/10.1088/0951-7715/8/6/009\">10.1088/0951-7715/8/6/009</a>.","ama":"Dellnitz M, Heinrich C. Admissible symmetry increasing bifurcations. <i>Nonlinearity</i>. 1995:1039-1066. doi:<a href=\"https://doi.org/10.1088/0951-7715/8/6/009\">10.1088/0951-7715/8/6/009</a>","bibtex":"@article{Dellnitz_Heinrich_1995, title={Admissible symmetry increasing bifurcations}, DOI={<a href=\"https://doi.org/10.1088/0951-7715/8/6/009\">10.1088/0951-7715/8/6/009</a>}, journal={Nonlinearity}, author={Dellnitz, M and Heinrich, C}, year={1995}, pages={1039–1066} }","apa":"Dellnitz, M., &#38; Heinrich, C. (1995). Admissible symmetry increasing bifurcations. <i>Nonlinearity</i>, 1039–1066. <a href=\"https://doi.org/10.1088/0951-7715/8/6/009\">https://doi.org/10.1088/0951-7715/8/6/009</a>","ieee":"M. Dellnitz and C. Heinrich, “Admissible symmetry increasing bifurcations,” <i>Nonlinearity</i>, pp. 1039–1066, 1995.","chicago":"Dellnitz, M, and C Heinrich. “Admissible Symmetry Increasing Bifurcations.” <i>Nonlinearity</i>, 1995, 1039–66. <a href=\"https://doi.org/10.1088/0951-7715/8/6/009\">https://doi.org/10.1088/0951-7715/8/6/009</a>.","short":"M. Dellnitz, C. Heinrich, Nonlinearity (1995) 1039–1066."},"publication":"Nonlinearity","user_id":"15701","doi":"10.1088/0951-7715/8/6/009","_id":"16532","language":[{"iso":"eng"}],"page":"1039-1066","publication_status":"published","date_updated":"2022-01-06T06:52:52Z","author":[{"last_name":"Dellnitz","first_name":"M","full_name":"Dellnitz, M"},{"last_name":"Heinrich","first_name":"C","full_name":"Heinrich, C"}],"publication_identifier":{"issn":["0951-7715","1361-6544"]},"title":"Admissible symmetry increasing bifurcations","year":"1995","status":"public"},{"publication_status":"published","date_updated":"2022-01-06T06:52:52Z","author":[{"first_name":"M","last_name":"Dellnitz","full_name":"Dellnitz, M"},{"full_name":"Melbourne, I","last_name":"Melbourne","first_name":"I"}],"publication_identifier":{"issn":["0951-7715","1361-6544"]},"year":"1995","title":"A note on the shadowing lemma and symmetric periodic points","status":"public","user_id":"15701","doi":"10.1088/0951-7715/8/6/010","_id":"16542","language":[{"iso":"eng"}],"page":"1067-1075","citation":{"bibtex":"@article{Dellnitz_Melbourne_1995, title={A note on the shadowing lemma and symmetric periodic points}, DOI={<a href=\"https://doi.org/10.1088/0951-7715/8/6/010\">10.1088/0951-7715/8/6/010</a>}, journal={Nonlinearity}, author={Dellnitz, M and Melbourne, I}, year={1995}, pages={1067–1075} }","ama":"Dellnitz M, Melbourne I. A note on the shadowing lemma and symmetric periodic points. <i>Nonlinearity</i>. 1995:1067-1075. doi:<a href=\"https://doi.org/10.1088/0951-7715/8/6/010\">10.1088/0951-7715/8/6/010</a>","mla":"Dellnitz, M., and I. Melbourne. “A Note on the Shadowing Lemma and Symmetric Periodic Points.” <i>Nonlinearity</i>, 1995, pp. 1067–75, doi:<a href=\"https://doi.org/10.1088/0951-7715/8/6/010\">10.1088/0951-7715/8/6/010</a>.","short":"M. Dellnitz, I. Melbourne, Nonlinearity (1995) 1067–1075.","chicago":"Dellnitz, M, and I Melbourne. “A Note on the Shadowing Lemma and Symmetric Periodic Points.” <i>Nonlinearity</i>, 1995, 1067–75. <a href=\"https://doi.org/10.1088/0951-7715/8/6/010\">https://doi.org/10.1088/0951-7715/8/6/010</a>.","ieee":"M. Dellnitz and I. Melbourne, “A note on the shadowing lemma and symmetric periodic points,” <i>Nonlinearity</i>, pp. 1067–1075, 1995.","apa":"Dellnitz, M., &#38; Melbourne, I. (1995). A note on the shadowing lemma and symmetric periodic points. <i>Nonlinearity</i>, 1067–1075. <a href=\"https://doi.org/10.1088/0951-7715/8/6/010\">https://doi.org/10.1088/0951-7715/8/6/010</a>"},"publication":"Nonlinearity","department":[{"_id":"101"}],"type":"journal_article","date_created":"2020-04-15T08:46:30Z"},{"citation":{"ama":"Dellnitz M, Field M, Golubitsky M, Ma J, Hohmann A. Cycling Chaos. <i>International Journal of Bifurcation and Chaos</i>. 1995:1243-1247. doi:<a href=\"https://doi.org/10.1142/s0218127495000909\">10.1142/s0218127495000909</a>","bibtex":"@article{Dellnitz_Field_Golubitsky_Ma_Hohmann_1995, title={Cycling Chaos}, DOI={<a href=\"https://doi.org/10.1142/s0218127495000909\">10.1142/s0218127495000909</a>}, journal={International Journal of Bifurcation and Chaos}, author={Dellnitz, Michael and Field, Michael and Golubitsky, Martin and Ma, Jun and Hohmann, Andreas}, year={1995}, pages={1243–1247} }","mla":"Dellnitz, Michael, et al. “Cycling Chaos.” <i>International Journal of Bifurcation and Chaos</i>, 1995, pp. 1243–47, doi:<a href=\"https://doi.org/10.1142/s0218127495000909\">10.1142/s0218127495000909</a>.","chicago":"Dellnitz, Michael, Michael Field, Martin Golubitsky, Jun Ma, and Andreas Hohmann. “Cycling Chaos.” <i>International Journal of Bifurcation and Chaos</i>, 1995, 1243–47. <a href=\"https://doi.org/10.1142/s0218127495000909\">https://doi.org/10.1142/s0218127495000909</a>.","short":"M. Dellnitz, M. Field, M. Golubitsky, J. Ma, A. Hohmann, International Journal of Bifurcation and Chaos (1995) 1243–1247.","apa":"Dellnitz, M., Field, M., Golubitsky, M., Ma, J., &#38; Hohmann, A. (1995). Cycling Chaos. <i>International Journal of Bifurcation and Chaos</i>, 1243–1247. <a href=\"https://doi.org/10.1142/s0218127495000909\">https://doi.org/10.1142/s0218127495000909</a>","ieee":"M. Dellnitz, M. Field, M. Golubitsky, J. Ma, and A. Hohmann, “Cycling Chaos,” <i>International Journal of Bifurcation and Chaos</i>, pp. 1243–1247, 1995."},"publication":"International Journal of Bifurcation and Chaos","date_created":"2020-04-15T09:04:16Z","department":[{"_id":"101"}],"type":"journal_article","publication_identifier":{"issn":["0218-1274","1793-6551"]},"author":[{"first_name":"Michael","last_name":"Dellnitz","full_name":"Dellnitz, Michael"},{"first_name":"Michael","last_name":"Field","full_name":"Field, Michael"},{"last_name":"Golubitsky","first_name":"Martin","full_name":"Golubitsky, Martin"},{"full_name":"Ma, Jun","first_name":"Jun","last_name":"Ma"},{"full_name":"Hohmann, Andreas","first_name":"Andreas","last_name":"Hohmann"}],"year":"1995","title":"Cycling Chaos","status":"public","date_updated":"2022-01-06T06:52:52Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"16550","page":"1243-1247","doi":"10.1142/s0218127495000909","user_id":"15701"},{"date_created":"2020-04-15T09:05:30Z","type":"journal_article","department":[{"_id":"101"}],"publication":"International Journal of Bifurcation and Chaos","citation":{"mla":"Dellnitz, Michael, et al. “Spirals in Scalar Reaction–Diffusion Equations.” <i>International Journal of Bifurcation and Chaos</i>, 1995, pp. 1487–501, doi:<a href=\"https://doi.org/10.1142/s0218127495001149\">10.1142/s0218127495001149</a>.","bibtex":"@article{Dellnitz_Golubitsky_Hohmann_Stewart_1995, title={Spirals in Scalar Reaction–Diffusion Equations}, DOI={<a href=\"https://doi.org/10.1142/s0218127495001149\">10.1142/s0218127495001149</a>}, journal={International Journal of Bifurcation and Chaos}, author={Dellnitz, Michael and Golubitsky, Martin and Hohmann, Andreas and Stewart, Ian}, year={1995}, pages={1487–1501} }","ama":"Dellnitz M, Golubitsky M, Hohmann A, Stewart I. Spirals in Scalar Reaction–Diffusion Equations. <i>International Journal of Bifurcation and Chaos</i>. 1995:1487-1501. doi:<a href=\"https://doi.org/10.1142/s0218127495001149\">10.1142/s0218127495001149</a>","ieee":"M. Dellnitz, M. Golubitsky, A. Hohmann, and I. Stewart, “Spirals in Scalar Reaction–Diffusion Equations,” <i>International Journal of Bifurcation and Chaos</i>, pp. 1487–1501, 1995.","apa":"Dellnitz, M., Golubitsky, M., Hohmann, A., &#38; Stewart, I. (1995). Spirals in Scalar Reaction–Diffusion Equations. <i>International Journal of Bifurcation and Chaos</i>, 1487–1501. <a href=\"https://doi.org/10.1142/s0218127495001149\">https://doi.org/10.1142/s0218127495001149</a>","short":"M. Dellnitz, M. Golubitsky, A. Hohmann, I. Stewart, International Journal of Bifurcation and Chaos (1995) 1487–1501.","chicago":"Dellnitz, Michael, Martin Golubitsky, Andreas Hohmann, and Ian Stewart. “Spirals in Scalar Reaction–Diffusion Equations.” <i>International Journal of Bifurcation and Chaos</i>, 1995, 1487–1501. <a href=\"https://doi.org/10.1142/s0218127495001149\">https://doi.org/10.1142/s0218127495001149</a>."},"abstract":[{"lang":"eng","text":"<jats:p> Spiral patterns have been observed experimentally, numerically, and theoretically in a variety of systems. It is often believed that these spiral wave patterns can occur only in systems of reaction–diffusion equations. We show, both theoretically (using Hopf bifurcation techniques) and numerically (using both direct simulation and continuation of rotating waves) that spiral wave patterns can appear in a single reaction–diffusion equation [ in u(x, t)] on a disk, if one assumes \"spiral\" boundary conditions (u<jats:sub>r</jats:sub> = mu<jats:sub>θ</jats:sub>). Spiral boundary conditions are motivated by assuming that a solution is infinitesimally an Archimedian spiral near the boundary. It follows from a bifurcation analysis that for this form of spirals there are no singularities in the spiral pattern (technically there is no spiral tip) and that at bifurcation there is a steep gradient between the \"red\" and \"blue\" arms of the spiral. </jats:p>"}],"page":"1487-1501","language":[{"iso":"eng"}],"_id":"16551","user_id":"15701","doi":"10.1142/s0218127495001149","status":"public","year":"1995","title":"Spirals in Scalar Reaction–Diffusion Equations","publication_identifier":{"issn":["0218-1274","1793-6551"]},"author":[{"last_name":"Dellnitz","first_name":"Michael","full_name":"Dellnitz, Michael"},{"first_name":"Martin","last_name":"Golubitsky","full_name":"Golubitsky, Martin"},{"full_name":"Hohmann, Andreas","first_name":"Andreas","last_name":"Hohmann"},{"first_name":"Ian","last_name":"Stewart","full_name":"Stewart, Ian"}],"publication_status":"published","date_updated":"2022-01-06T06:52:52Z"},{"department":[{"_id":"63"}],"type":"journal_article","date_created":"2020-04-15T11:28:35Z","citation":{"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} }","short":"D. Breslauer, A. Czumaj, D.P. Dubhashi, F. Meyer auf der Heide, Information Processing Letters (1995) 103–110.","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>","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>.","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.","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>","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>."},"publication":"Information Processing Letters","user_id":"15415","doi":"10.1016/s0020-0190(97)00032-x","_id":"16566","language":[{"iso":"eng"}],"page":"103-110","publication_status":"published","date_updated":"2022-01-06T06:52:52Z","publication_identifier":{"issn":["0020-0190"]},"author":[{"first_name":"Dany","last_name":"Breslauer","full_name":"Breslauer, Dany"},{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"last_name":"Dubhashi","first_name":"Devdatt P.","full_name":"Dubhashi, Devdatt P."},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"title":"Transforming comparison model lower bounds to the parallel-random-access-machine","status":"public","year":"1995"},{"doi":"10.1090/fic/004/05","user_id":"15701","_id":"16611","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:53Z","publication_status":"published","publication_identifier":{"isbn":["9780821803264","9781470429720"]},"author":[{"full_name":"Golubitsky, Martin","last_name":"Golubitsky","first_name":"Martin"},{"full_name":"Marsden, Jerrold","last_name":"Marsden","first_name":"Jerrold"},{"last_name":"Stewart","first_name":"Ian","full_name":"Stewart, Ian"},{"first_name":"Michael","last_name":"Dellnitz","full_name":"Dellnitz, Michael"}],"year":"1995","status":"public","title":"The constrained Liapunov-Schmidt procedure and periodic orbits","department":[{"_id":"101"}],"type":"book_chapter","place":"Providence, Rhode Island","date_created":"2020-04-16T08:02:13Z","citation":{"mla":"Golubitsky, Martin, et al. “The Constrained Liapunov-Schmidt Procedure and Periodic Orbits.” <i>Normal Forms and Homoclinic Chaos</i>, 1995, doi:<a href=\"https://doi.org/10.1090/fic/004/05\">10.1090/fic/004/05</a>.","ama":"Golubitsky M, Marsden J, Stewart I, Dellnitz M. The constrained Liapunov-Schmidt procedure and periodic orbits. In: <i>Normal Forms and Homoclinic Chaos</i>. Providence, Rhode Island; 1995. doi:<a href=\"https://doi.org/10.1090/fic/004/05\">10.1090/fic/004/05</a>","bibtex":"@inbook{Golubitsky_Marsden_Stewart_Dellnitz_1995, place={Providence, Rhode Island}, title={The constrained Liapunov-Schmidt procedure and periodic orbits}, DOI={<a href=\"https://doi.org/10.1090/fic/004/05\">10.1090/fic/004/05</a>}, booktitle={Normal Forms and Homoclinic Chaos}, author={Golubitsky, Martin and Marsden, Jerrold and Stewart, Ian and Dellnitz, Michael}, year={1995} }","apa":"Golubitsky, M., Marsden, J., Stewart, I., &#38; Dellnitz, M. (1995). The constrained Liapunov-Schmidt procedure and periodic orbits. In <i>Normal Forms and Homoclinic Chaos</i>. Providence, Rhode Island. <a href=\"https://doi.org/10.1090/fic/004/05\">https://doi.org/10.1090/fic/004/05</a>","ieee":"M. Golubitsky, J. Marsden, I. Stewart, and M. Dellnitz, “The constrained Liapunov-Schmidt procedure and periodic orbits,” in <i>Normal Forms and Homoclinic Chaos</i>, Providence, Rhode Island, 1995.","chicago":"Golubitsky, Martin, Jerrold Marsden, Ian Stewart, and Michael Dellnitz. “The Constrained Liapunov-Schmidt Procedure and Periodic Orbits.” In <i>Normal Forms and Homoclinic Chaos</i>. Providence, Rhode Island, 1995. <a href=\"https://doi.org/10.1090/fic/004/05\">https://doi.org/10.1090/fic/004/05</a>.","short":"M. Golubitsky, J. Marsden, I. Stewart, M. Dellnitz, in: Normal Forms and Homoclinic Chaos, Providence, Rhode Island, 1995."},"publication":"Normal Forms and Homoclinic Chaos"},{"user_id":"15415","doi":"10.1007/3-540-59042-0_81","language":[{"iso":"eng"}],"_id":"16704","publication_status":"published","date_updated":"2022-01-06T06:52:54Z","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Berthold","last_name":"Vöcking","full_name":"Vöcking, Berthold"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540590422","9783540491750"]},"title":"A packet routing protocol for arbitrary networks","status":"public","year":"1995","department":[{"_id":"63"}],"type":"book_chapter","date_created":"2020-04-16T13:36:32Z","place":"Berlin, Heidelberg","citation":{"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>","short":"F. Meyer auf der Heide, B. Vöcking, in: STACS 95, Berlin, Heidelberg, 1995.","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>.","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>.","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>"},"publication":"STACS 95"},{"year":"1995","title":"Shared memory simulations with triple-logarithmic delay","status":"public","publication_identifier":{"isbn":["9783540603139","9783540449133"],"issn":["0302-9743","1611-3349"]},"author":[{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Stemann, Volker","first_name":"Volker","last_name":"Stemann"}],"date_updated":"2022-01-06T06:52:54Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"16705","doi":"10.1007/3-540-60313-1_133","user_id":"15415","publication":"Lecture Notes in Computer Science","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>."},"place":"Berlin, Heidelberg","date_created":"2020-04-16T13:40:52Z","type":"book_chapter","department":[{"_id":"63"}]},{"date_updated":"2022-01-06T06:52:54Z","publication_status":"published","title":"Optimal trade-offs between size and slowdown for universal parallel networks","status":"public","year":"1995","publication_identifier":{"isbn":["0897917170"]},"author":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Storch, Martin","first_name":"Martin","last_name":"Storch"},{"last_name":"Wanka","first_name":"Rolf","full_name":"Wanka, Rolf"}],"doi":"10.1145/215399.215430","user_id":"15415","language":[{"iso":"eng"}],"_id":"16706","publication":"Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures  - SPAA '95","citation":{"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.","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>.","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.","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} }"},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-16T13:47:15Z"},{"department":[{"_id":"63"}],"type":"conference","date_created":"2020-04-16T13:49:13Z","citation":{"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>.","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>","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} }","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>","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>.","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>.","short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995."},"publication":"Proceedings Third Israel Symposium on the Theory of Computing and Systems","user_id":"15415","doi":"10.1109/istcs.1995.377051","language":[{"iso":"eng"}],"_id":"16707","publication_status":"published","date_updated":"2022-01-06T06:52:54Z","author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Stemann","first_name":"Volker","full_name":"Stemann, Volker"}],"publication_identifier":{"isbn":["0818669152"]},"status":"public","year":"1995","title":"Improved optimal shared memory simulations, and the power of reconfiguration"},{"title":"Hot-potato routing on multi-dimensional tori","status":"public","year":"1995","author":[{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Westermann, Matthias","last_name":"Westermann","first_name":"Matthias"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540606185","9783540484875"]},"publication_status":"published","date_updated":"2022-01-06T06:52:55Z","_id":"16717","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1007/3-540-60618-1_77","publication":"Graph-Theoretic Concepts in Computer Science","citation":{"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>","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} }","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>.","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.","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>","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."},"date_created":"2020-04-17T07:46:18Z","place":"Berlin, Heidelberg","type":"book_chapter","department":[{"_id":"63"}]},{"citation":{"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>","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} }","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>.","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>","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."},"publication":"Lecture Notes in Computer Science","place":"Berlin, Heidelberg","date_created":"2020-04-27T13:59:05Z","department":[{"_id":"63"}],"type":"book_chapter","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"]},"status":"public","year":"1995","title":"Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model","date_updated":"2022-01-06T06:52:58Z","publication_status":"published","_id":"16874","language":[{"iso":"eng"}],"doi":"10.1007/3-540-60313-1_131","user_id":"15415"},{"department":[{"_id":"78"}],"type":"journal_article","date_created":"2019-07-10T09:23:10Z","extern":"1","citation":{"chicago":"Platzner, Marco, Bernhard Rinner, and Reinhold Weiss. “Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation.” <i>J.UCS Journal of Universal Computer Science</i> 12 (1995): 811–20.","short":"M. Platzner, B. Rinner, R. Weiss, J.UCS Journal of Universal Computer Science 12 (1995) 811–820.","ieee":"M. Platzner, B. Rinner, and R. Weiss, “Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation,” <i>J.UCS Journal of Universal Computer Science</i>, vol. 12, pp. 811–820, 1995.","apa":"Platzner, M., Rinner, B., &#38; Weiss, R. (1995). Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation. <i>J.UCS Journal of Universal Computer Science</i>, <i>12</i>, 811–820.","bibtex":"@article{Platzner_Rinner_Weiss_1995, title={Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation}, volume={12}, journal={J.UCS Journal of Universal Computer Science}, publisher={Springer}, author={Platzner, Marco and Rinner, Bernhard and Weiss, Reinhold}, year={1995}, pages={811–820} }","ama":"Platzner M, Rinner B, Weiss R. Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation. <i>JUCS Journal of Universal Computer Science</i>. 1995;12:811-820.","mla":"Platzner, Marco, et al. “Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation.” <i>J.UCS Journal of Universal Computer Science</i>, vol. 12, Springer, 1995, pp. 811–20."},"publication":"J.UCS Journal of Universal Computer Science","volume":12,"user_id":"398","_id":"10610","language":[{"iso":"eng"}],"publisher":"Springer","page":"811-820","intvolume":"        12","date_updated":"2022-01-06T06:50:47Z","author":[{"last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco","id":"398"},{"first_name":"Bernhard","last_name":"Rinner","full_name":"Rinner, Bernhard"},{"full_name":"Weiss, Reinhold","last_name":"Weiss","first_name":"Reinhold"}],"status":"public","title":"Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation","year":"1995"},{"oa":"1","department":[{"_id":"54"}],"type":"conference","date_created":"2019-07-12T05:27:40Z","abstract":[{"text":"Clustering techniques have been integrated at different levels into the training procedure of a continuous-density hidden Markov model (HMM) speech recognizer. These clustering techniques can be used in two ways. First acoustically similar states are tied together. It will help to reduce the number of parameters but also allow to train otherwise rarely seen states together with more robust ones (state-tying). Secondly densities are clustered across states, this reduces the number of densities while at the same time keeping the best performances of our recognizer (density-clustering). We have applied these techniques both to word-based small-vocabulary and phoneme-based large-vocabulary recognition tasks. On the WSJ task, we could achieve a reduction of the word error rate by 7%. On the TI/NIST-connected digit task, the number of parameters was reduced by a factor 2-3 while keeping the same string error rate.","lang":"eng"}],"citation":{"ama":"Dugast C, Beyerlein P, Haeb-Umbach R. Application of Clustering Techniques to Mixture Density Modelling for Continuous-Speech Recognition. In: <i>ICASSP, Detroit</i>. ; 1995.","bibtex":"@inproceedings{Dugast_Beyerlein_Haeb-Umbach_1995, title={Application of Clustering Techniques to Mixture Density Modelling for Continuous-Speech Recognition}, booktitle={ICASSP, Detroit}, author={Dugast, Christian and Beyerlein, Peter and Haeb-Umbach, Reinhold}, year={1995} }","mla":"Dugast, Christian, et al. “Application of Clustering Techniques to Mixture Density Modelling for Continuous-Speech Recognition.” <i>ICASSP, Detroit</i>, 1995.","chicago":"Dugast, Christian, Peter Beyerlein, and Reinhold Haeb-Umbach. “Application of Clustering Techniques to Mixture Density Modelling for Continuous-Speech Recognition.” In <i>ICASSP, Detroit</i>, 1995.","short":"C. Dugast, P. Beyerlein, R. Haeb-Umbach, in: ICASSP, Detroit, 1995.","apa":"Dugast, C., Beyerlein, P., &#38; Haeb-Umbach, R. (1995). Application of Clustering Techniques to Mixture Density Modelling for Continuous-Speech Recognition. In <i>ICASSP, Detroit</i>.","ieee":"C. Dugast, P. Beyerlein, and R. Haeb-Umbach, “Application of Clustering Techniques to Mixture Density Modelling for Continuous-Speech Recognition,” in <i>ICASSP, Detroit</i>, 1995."},"publication":"ICASSP, Detroit","user_id":"44006","language":[{"iso":"eng"}],"_id":"11757","main_file_link":[{"open_access":"1","url":"https://groups.uni-paderborn.de/nt/pubs/1995/ICASSP_1995_Haeb_paper.pdf"}],"date_updated":"2022-01-06T06:51:08Z","author":[{"full_name":"Dugast, Christian","first_name":"Christian","last_name":"Dugast"},{"last_name":"Beyerlein","first_name":"Peter","full_name":"Beyerlein, Peter"},{"id":"242","full_name":"Haeb-Umbach, Reinhold","first_name":"Reinhold","last_name":"Haeb-Umbach"}],"status":"public","year":"1995","title":"Application of Clustering Techniques to Mixture Density Modelling for Continuous-Speech Recognition"},{"date_created":"2019-07-12T05:27:48Z","department":[{"_id":"54"}],"type":"journal_article","citation":{"ama":"Gamm S, Haeb-Umbach R. User interface design of voice controlled consumer electronics. <i>Philips Journal of Research</i>. 1995.","short":"S. Gamm, R. Haeb-Umbach, Philips Journal of Research (1995).","chicago":"Gamm, Stephan, and Reinhold Haeb-Umbach. “User Interface Design of Voice Controlled Consumer Electronics.” <i>Philips Journal of Research</i>, 1995.","bibtex":"@article{Gamm_Haeb-Umbach_1995, title={User interface design of voice controlled consumer electronics}, journal={Philips Journal of Research}, author={Gamm, Stephan and Haeb-Umbach, Reinhold}, year={1995} }","mla":"Gamm, Stephan, and Reinhold Haeb-Umbach. “User Interface Design of Voice Controlled Consumer Electronics.” <i>Philips Journal of Research</i>, 1995.","apa":"Gamm, S., &#38; Haeb-Umbach, R. (1995). User interface design of voice controlled consumer electronics. <i>Philips Journal of Research</i>.","ieee":"S. Gamm and R. Haeb-Umbach, “User interface design of voice controlled consumer electronics,” <i>Philips Journal of Research</i>, 1995."},"publication":"Philips Journal of Research","abstract":[{"text":"Today speech recognition of a small vocabulary can be realized so cost-effectively that the technology can penetrate into consumer electronics. But, as first applications that failed on the market show, it is by no means obvious how to incorporate voice control in a user interface. This paper addresses the issue of how to design a voice control so that the user perceives it as a benefit. User interface guidelines that are adapted or specific to voice control are presented. Then the process of designing a voice control in the user-centred approach is described. By means of two examples, the car stereo and telephone answering machine, it is shown how this is turned into practice.","lang":"eng"}],"language":[{"iso":"eng"}],"_id":"11764","user_id":"44006","author":[{"full_name":"Gamm, Stephan","first_name":"Stephan","last_name":"Gamm"},{"id":"242","full_name":"Haeb-Umbach, Reinhold","last_name":"Haeb-Umbach","first_name":"Reinhold"}],"title":"User interface design of voice controlled consumer electronics","status":"public","year":"1995","date_updated":"2022-01-06T06:51:08Z"}]