[{"author":[{"first_name":"Christian","last_name":"Geiger","full_name":"Geiger, Christian"},{"full_name":"Lehrenfeld, Georg","last_name":"Lehrenfeld","first_name":"Georg"},{"first_name":"Wolfgang","last_name":"Müller","full_name":"Müller, Wolfgang","id":"16243"}],"title":"Authoring Communicating Agents in Virtual Environments","status":"public","year":"1998","date_updated":"2023-01-24T11:44:10Z","_id":"39499","language":[{"iso":"eng"}],"user_id":"5786","citation":{"apa":"Geiger, C., Lehrenfeld, G., &#38; Müller, W. (1998). Authoring Communicating Agents in Virtual Environments. <i>Proceedings of the Annual Conference for the Computer Human Interaction</i>.","ieee":"C. Geiger, G. Lehrenfeld, and W. Müller, “Authoring Communicating Agents in Virtual Environments,” 1998.","short":"C. Geiger, G. Lehrenfeld, W. Müller, in: Proceedings of the Annual Conference for the Computer Human Interaction, Adelaide, Australia, 1998.","chicago":"Geiger, Christian, Georg Lehrenfeld, and Wolfgang Müller. “Authoring Communicating Agents in Virtual Environments.” In <i>Proceedings of the Annual Conference for the Computer Human Interaction</i>. Adelaide, Australia, 1998.","mla":"Geiger, Christian, et al. “Authoring Communicating Agents in Virtual Environments.” <i>Proceedings of the Annual Conference for the Computer Human Interaction</i>, 1998.","ama":"Geiger C, Lehrenfeld G, Müller W. Authoring Communicating Agents in Virtual Environments. In: <i>Proceedings of the Annual Conference for the Computer Human Interaction</i>. ; 1998.","bibtex":"@inproceedings{Geiger_Lehrenfeld_Müller_1998, place={Adelaide, Australia}, title={Authoring Communicating Agents in Virtual Environments}, booktitle={Proceedings of the Annual Conference for the Computer Human Interaction}, author={Geiger, Christian and Lehrenfeld, Georg and Müller, Wolfgang}, year={1998} }"},"publication":"Proceedings of the Annual Conference for the Computer Human Interaction","abstract":[{"text":"3D-graphics popularity has steadily increased in a\r\nnumber of areas such as entertainment, scienti c vi-\r\nsualization, simulation, and virtual reality. Despite\r\nthis rapid growth the authoring of animated 3D objects\r\nin virtual environments is stil l by no means trivial.\r\nThis article presents new concepts of the animated 3D\r\nprogramming language SAM (Solid Agents in Motion)\r\nand its programming environment. In SAM, the main\r\nsyntactic objects like agents, rules, and messages are\r\nrepresented as 3D objects. The design of a SAM pro-\r\ngram is supported by a dedicated 3D structure editor.\r\nThe editor al lows the de nition and spatial arrange-\r\nment of SAM agents in a 3D scene by direct manipu-\r\nlation. The paper gives a number of SAM examples,\r\ndemonstrating the authoring of simple animated vir-\r\ntual 3D scenarios.","lang":"eng"}],"date_created":"2023-01-24T11:44:06Z","place":"Adelaide, Australia","department":[{"_id":"672"}],"type":"conference"},{"publication_identifier":{"isbn":["0-8186-8712-6"]},"author":[{"full_name":"Geiger, Christian","last_name":"Geiger","first_name":"Christian"},{"id":"16243","first_name":"Wolfgang","last_name":"Müller","full_name":"Müller, Wolfgang"},{"full_name":"Rosenbach, W.","first_name":"W.","last_name":"Rosenbach"}],"conference":{"name":"1998 IEEE Symposium on Visual Languages","location":"Halifax, Canada"},"title":"SAM - An Animated 3D Programming Language","year":"1998","status":"public","date_updated":"2023-01-24T11:39:35Z","language":[{"iso":"eng"}],"_id":"39493","user_id":"5786","doi":"10.1109/VL.1998.706167","citation":{"ama":"Geiger C, Müller W, Rosenbach W. SAM - An Animated 3D Programming Language. In: <i>Proceedings of the IEEE Symposium on Visual Languages</i>. ; 1998. doi:<a href=\"https://doi.org/10.1109/VL.1998.706167\">10.1109/VL.1998.706167</a>","bibtex":"@inproceedings{Geiger_Müller_Rosenbach_1998, place={Halifax, Canada}, title={SAM - An Animated 3D Programming Language}, DOI={<a href=\"https://doi.org/10.1109/VL.1998.706167\">10.1109/VL.1998.706167</a>}, booktitle={Proceedings of the IEEE Symposium on Visual Languages}, author={Geiger, Christian and Müller, Wolfgang and Rosenbach, W.}, year={1998} }","mla":"Geiger, Christian, et al. “SAM - An Animated 3D Programming Language.” <i>Proceedings of the IEEE Symposium on Visual Languages</i>, 1998, doi:<a href=\"https://doi.org/10.1109/VL.1998.706167\">10.1109/VL.1998.706167</a>.","short":"C. Geiger, W. Müller, W. Rosenbach, in: Proceedings of the IEEE Symposium on Visual Languages, Halifax, Canada, 1998.","chicago":"Geiger, Christian, Wolfgang Müller, and W. Rosenbach. “SAM - An Animated 3D Programming Language.” In <i>Proceedings of the IEEE Symposium on Visual Languages</i>. Halifax, Canada, 1998. <a href=\"https://doi.org/10.1109/VL.1998.706167\">https://doi.org/10.1109/VL.1998.706167</a>.","apa":"Geiger, C., Müller, W., &#38; Rosenbach, W. (1998). SAM - An Animated 3D Programming Language. <i>Proceedings of the IEEE Symposium on Visual Languages</i>. 1998 IEEE Symposium on Visual Languages, Halifax, Canada. <a href=\"https://doi.org/10.1109/VL.1998.706167\">https://doi.org/10.1109/VL.1998.706167</a>","ieee":"C. Geiger, W. Müller, and W. Rosenbach, “SAM - An Animated 3D Programming Language,” presented at the 1998 IEEE Symposium on Visual Languages, Halifax, Canada, 1998, doi: <a href=\"https://doi.org/10.1109/VL.1998.706167\">10.1109/VL.1998.706167</a>."},"publication":"Proceedings of the IEEE Symposium on Visual Languages","abstract":[{"lang":"eng","text":"This article presents the animated visual 3D programming language SAM (Solid Agents in Motion) for parallel systems specification and animation. A SAM program is a set of interacting agents synchronously exchanging messages. The agent's behaviour is specified by means of production rules with a condition and a sequence of actions each. Actions are linearly ordered and execute when matching a rule. In SAM, main syntactic objects like agents, rules, and messages are 3D. These objects can have an abstract and a concrete, solid 3D presentation. While the abstract representation is for programming and debugging, the concrete representation is for animated 3D end-user presentations. After outlining the concepts of SAM this article gives two programming examples of 3D micro worlds and an overview of the programming environment."}],"date_created":"2023-01-24T11:39:30Z","place":"Halifax, Canada","department":[{"_id":"672"}],"type":"conference","keyword":["Animation","Computer languages","Solids","Concrete","Application software","Virtual reality","Programming profession","Switches","Visualization","Debugging"]},{"series_title":"Simulation und Visualisierung 98","_id":"39489","language":[{"iso":"eng"}],"user_id":"5786","author":[{"full_name":"Geiger, Christian","last_name":"Geiger","first_name":"Christian"},{"id":"16243","full_name":"Müller, Wolfgang","last_name":"Müller","first_name":"Wolfgang"}],"status":"public","year":"1998","title":"Visuelle Spezifikation, Modellierung und Animation im Systementwurf","date_updated":"2023-01-24T11:37:19Z","place":"Magdeburg, Germany","date_created":"2023-01-24T11:37:14Z","department":[{"_id":"672"}],"type":"conference","citation":{"mla":"Geiger, Christian, and Wolfgang Müller. <i>Visuelle Spezifikation, Modellierung Und Animation Im Systementwurf</i>. 1998.","ama":"Geiger C, Müller W. Visuelle Spezifikation, Modellierung und Animation im Systementwurf. Published online 1998.","bibtex":"@article{Geiger_Müller_1998, place={Magdeburg, Germany}, series={Simulation und Visualisierung 98}, title={Visuelle Spezifikation, Modellierung und Animation im Systementwurf}, author={Geiger, Christian and Müller, Wolfgang}, year={1998}, collection={Simulation und Visualisierung 98} }","apa":"Geiger, C., &#38; Müller, W. (1998). <i>Visuelle Spezifikation, Modellierung und Animation im Systementwurf</i>.","ieee":"C. Geiger and W. Müller, “Visuelle Spezifikation, Modellierung und Animation im Systementwurf.” Magdeburg, Germany, 1998.","chicago":"Geiger, Christian, and Wolfgang Müller. “Visuelle Spezifikation, Modellierung Und Animation Im Systementwurf.” Simulation Und Visualisierung 98. Magdeburg, Germany, 1998.","short":"C. Geiger, W. Müller, (1998)."}},{"date_created":"2020-09-22T12:46:17Z","type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"citation":{"ieee":"A. Bäumker, <i>Communication Efficient Parallel Searching</i>, vol. 28. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","apa":"Bäumker, A. (1997). <i>Communication Efficient Parallel Searching</i> (Vol. 28). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","chicago":"Bäumker, Armin. <i>Communication Efficient Parallel Searching</i>. Vol. 28. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","short":"A. Bäumker, Communication Efficient Parallel Searching, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","mla":"Bäumker, Armin. <i>Communication Efficient Parallel Searching</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","bibtex":"@book{Bäumker_1997, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Communication Efficient Parallel Searching}, volume={28}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Bäumker, Armin}, year={1997}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Bäumker A. <i>Communication Efficient Parallel Searching</i>. Vol 28. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1997."},"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"19631","language":[{"iso":"eng"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","volume":28,"year":"1997","status":"public","title":"Communication Efficient Parallel Searching","author":[{"full_name":"Bäumker, Armin","first_name":"Armin","last_name":"Bäumker"}],"publication_identifier":{"isbn":["3-931466-27-2"]},"date_updated":"2022-01-06T06:54:09Z","intvolume":"        28"},{"date_updated":"2022-01-06T06:54:09Z","intvolume":"        27","status":"public","title":"Communication and I/O Efficient Parallel Data Structures","year":"1997","author":[{"full_name":"Dittrich, Wolfgang","last_name":"Dittrich","first_name":"Wolfgang"}],"publication_identifier":{"isbn":["3-931466-26-4"]},"user_id":"5786","volume":27,"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"19636","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"citation":{"mla":"Dittrich, Wolfgang. <i>Communication and I/O Efficient Parallel Data Structures</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","ama":"Dittrich W. <i>Communication and I/O Efficient Parallel Data Structures</i>. Vol 27. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1997.","bibtex":"@book{Dittrich_1997, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Communication and I/O Efficient Parallel Data Structures}, volume={27}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Dittrich, Wolfgang}, year={1997}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","apa":"Dittrich, W. (1997). <i>Communication and I/O Efficient Parallel Data Structures</i> (Vol. 27). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"W. Dittrich, <i>Communication and I/O Efficient Parallel Data Structures</i>, vol. 27. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","chicago":"Dittrich, Wolfgang. <i>Communication and I/O Efficient Parallel Data Structures</i>. Vol. 27. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","short":"W. Dittrich, Communication and I/O Efficient Parallel Data Structures, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997."},"type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"date_created":"2020-09-22T12:53:00Z"},{"language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","publication_identifier":{"isbn":["3-931466-34-5"]},"author":[{"full_name":"Strothmann, Willy-Bernhard","last_name":"Strothmann","first_name":"Willy-Bernhard"}],"year":"1997","title":"Bounded Degree Spanning Trees","intvolume":"        35","date_updated":"2022-01-06T06:54:09Z","date_created":"2020-09-22T12:57:53Z","file":[{"file_id":"19638","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2020-09-22T12:57:43Z","file_name":"pub-hni-468.pdf","file_size":1172216,"access_level":"closed","date_created":"2020-09-22T12:57:43Z","creator":"koala"}],"department":[{"_id":"63"},{"_id":"26"}],"type":"dissertation","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"19637","volume":35,"ddc":["000"],"user_id":"5786","status":"public","has_accepted_license":"1","supervisor":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"citation":{"ama":"Strothmann W-B. <i>Bounded Degree Spanning Trees</i>. Vol 35. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1997.","bibtex":"@book{Strothmann_1997, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Bounded Degree Spanning Trees}, volume={35}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Strothmann, Willy-Bernhard}, year={1997}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Strothmann, Willy-Bernhard. <i>Bounded Degree Spanning Trees</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","short":"W.-B. Strothmann, Bounded Degree Spanning Trees, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","chicago":"Strothmann, Willy-Bernhard. <i>Bounded Degree Spanning Trees</i>. Vol. 35. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","apa":"Strothmann, W.-B. (1997). <i>Bounded Degree Spanning Trees</i> (Vol. 35). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"W.-B. Strothmann, <i>Bounded Degree Spanning Trees</i>, vol. 35. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997."},"file_date_updated":"2020-09-22T12:57:43Z"},{"type":"conference","department":[{"_id":"63"}],"date_created":"2020-10-05T07:13:42Z","abstract":[{"lang":"eng","text":"Given a connected graph $G$, let a $dT$-spanning tree of $G$ be a spanning tree of $G$ of maximum degree bounded by $dT$. It is well known that for each $dT ge 2$ the problem of deciding whether a connected graph has a $dT$-spanning tree is NP-complete. In this paper we investigate this problem when additionally connectivity and maximum degree of the graph are given. A complete characterization of this problem for 2- and 3-connected graphs, for planar graphs, and for $dT=2$ is provided. Our first result is that given a biconnected graph of maximum degree $2dT-2$, we can find its $dT$-spanning tree in time $O(m+n^3/2)$. For graphs of higher connectivity we design a polynomial-time algorithm that finds a $dT$-spanning tree in any $k$-connected graph of maximum degree $k(dT-2)+2$. On the other hand, we prove that deciding whether a $k$-connected graph of maximum degree $k(dT-2)+3$ has a $dT$-spanning tree is NP-complete, provided $k le 3$. For arbitrary $k ge 3$ we show that verifying whether a $k$-connected graph of maximum degree $k(dT-1)$ has a $dT$-spanning tree is NP-complete. In particular, we prove that the Hamiltonian path (cycle) problem is NP-complete for $k$-connected $k$-regular graphs, if $k>2$. This extends the well known result for $k=3$ and fully characterizes the case $dT=2$. For planar graphs it is NP-complete to decide whether a $k$-connected planar graph of maximum degree $dG$ has a $dT$-spanning tree for $k=1$ and $dG > dT ge 2$, for $k=2$ and $dG > 2(dT-1) ge 2$, and for $k=3$ and $dG > dT = 2$. On the other hand, we show how to find in polynomial (linear or almost linear) time a $dT$-spanning tree for all other parameters of $k$, $dG$, and $dT$."}],"publication":"Proceedings of the Fifth Annual European Symposium on Algorithms (ESA'97)","citation":{"mla":"Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning Trees.” <i>Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)</i>, 1997, doi:<a href=\"https://doi.org/10.1007/3-540-63397-9_9\">10.1007/3-540-63397-9_9</a>.","ama":"Czumaj A, Strothmann W-B. Bounded degree spanning trees. In: <i>Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)</i>. ; 1997. doi:<a href=\"https://doi.org/10.1007/3-540-63397-9_9\">10.1007/3-540-63397-9_9</a>","bibtex":"@inproceedings{Czumaj_Strothmann_1997, title={Bounded degree spanning trees}, DOI={<a href=\"https://doi.org/10.1007/3-540-63397-9_9\">10.1007/3-540-63397-9_9</a>}, booktitle={Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)}, author={Czumaj, Artur and Strothmann, Willy-Bernhard}, year={1997} }","apa":"Czumaj, A., &#38; Strothmann, W.-B. (1997). Bounded degree spanning trees. <i>Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)</i>. <a href=\"https://doi.org/10.1007/3-540-63397-9_9\">https://doi.org/10.1007/3-540-63397-9_9</a>","ieee":"A. Czumaj and W.-B. Strothmann, “Bounded degree spanning trees,” 1997, doi: <a href=\"https://doi.org/10.1007/3-540-63397-9_9\">10.1007/3-540-63397-9_9</a>.","short":"A. Czumaj, W.-B. Strothmann, in: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997.","chicago":"Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning Trees.” In <i>Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)</i>, 1997. <a href=\"https://doi.org/10.1007/3-540-63397-9_9\">https://doi.org/10.1007/3-540-63397-9_9</a>."},"user_id":"15415","doi":"10.1007/3-540-63397-9_9","language":[{"iso":"eng"}],"_id":"19869","publication_status":"published","date_updated":"2022-01-06T06:54:14Z","title":"Bounded degree spanning trees","status":"public","year":"1997","author":[{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"full_name":"Strothmann, Willy-Bernhard","last_name":"Strothmann","first_name":"Willy-Bernhard"}],"publication_identifier":{"isbn":["9783540633976","9783540695363"],"issn":["0302-9743","1611-3349"]}},{"publication":"Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings","citation":{"apa":"Rensink, A., &#38; Wehrheim, H. (1997). Dependency-Based Action Refinement. In I. Pr{\\’{\\i}}vara &#38; P. Ruzicka (Eds.), <i>Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS’97, Bratislava, Slovakia, August 25-29, 1997, Proceedings</i> (pp. 468--477). <a href=\"https://doi.org/10.1007/BFb0029990\">https://doi.org/10.1007/BFb0029990</a>","ieee":"A. Rensink and H. Wehrheim, “Dependency-Based Action Refinement,” in <i>Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS’97, Bratislava, Slovakia, August 25-29, 1997, Proceedings</i>, 1997, pp. 468--477.","short":"A. Rensink, H. Wehrheim, in: I. Pr{\\’{\\i}}vara, P. Ruzicka (Eds.), Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS’97, Bratislava, Slovakia, August 25-29, 1997, Proceedings, 1997, pp. 468--477.","chicago":"Rensink, Arend, and Heike Wehrheim. “Dependency-Based Action Refinement.” In <i>Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS’97, Bratislava, Slovakia, August 25-29, 1997, Proceedings</i>, edited by Igor Pr{\\’{\\i}}vara and Peter Ruzicka, 468--477. Lecture Notes in Computer Science, 1997. <a href=\"https://doi.org/10.1007/BFb0029990\">https://doi.org/10.1007/BFb0029990</a>.","mla":"Rensink, Arend, and Heike Wehrheim. “Dependency-Based Action Refinement.” <i>Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS’97, Bratislava, Slovakia, August 25-29, 1997, Proceedings</i>, edited by Igor Pr{\\’{\\i}}vara and Peter Ruzicka, 1997, pp. 468--477, doi:<a href=\"https://doi.org/10.1007/BFb0029990\">10.1007/BFb0029990</a>.","ama":"Rensink A, Wehrheim H. Dependency-Based Action Refinement. In: Pr{\\’{\\i}}vara I, Ruzicka P, eds. <i>Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS’97, Bratislava, Slovakia, August 25-29, 1997, Proceedings</i>. Lecture Notes in Computer Science. ; 1997:468--477. doi:<a href=\"https://doi.org/10.1007/BFb0029990\">10.1007/BFb0029990</a>","bibtex":"@inproceedings{Rensink_Wehrheim_1997, series={Lecture Notes in Computer Science}, title={Dependency-Based Action Refinement}, DOI={<a href=\"https://doi.org/10.1007/BFb0029990\">10.1007/BFb0029990</a>}, booktitle={Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS’97, Bratislava, Slovakia, August 25-29, 1997, Proceedings}, author={Rensink, Arend and Wehrheim, Heike}, editor={Pr{\\’{\\i}}vara, Igor and Ruzicka, PeterEditors}, year={1997}, pages={468--477}, collection={Lecture Notes in Computer Science} }"},"type":"conference","department":[{"_id":"77"}],"date_created":"2018-06-14T07:40:10Z","date_updated":"2022-01-06T06:59:07Z","year":"1997","title":"Dependency-Based Action Refinement","status":"public","author":[{"first_name":"Arend","last_name":"Rensink","full_name":"Rensink, Arend"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"user_id":"29719","doi":"10.1007/BFb0029990","editor":[{"full_name":"Pr{\\'{\\i}}vara, Igor","last_name":"Pr{\\'{\\i}}vara","first_name":"Igor"},{"first_name":"Peter","last_name":"Ruzicka","full_name":"Ruzicka, Peter"}],"page":"468--477","series_title":"Lecture Notes in Computer Science","_id":"3258"},{"publication":"Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings","citation":{"apa":"Rensink, A., &#38; Wehrheim, H. (1997). Dependency-Based Action Refinement. In I. Pr{\\’{\\i}}vara &#38; P. Ruzicka (Eds.), <i>Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS’97, Bratislava, Slovakia, August 25-29, 1997, Proceedings</i> (pp. 468--477). <a href=\"https://doi.org/10.1007/BFb0029990\">https://doi.org/10.1007/BFb0029990</a>","ieee":"A. Rensink and H. Wehrheim, “Dependency-Based Action Refinement,” in <i>Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS’97, Bratislava, Slovakia, August 25-29, 1997, Proceedings</i>, 1997, pp. 468--477.","short":"A. Rensink, H. Wehrheim, in: I. Pr{\\’{\\i}}vara, P. Ruzicka (Eds.), Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS’97, Bratislava, Slovakia, August 25-29, 1997, Proceedings, 1997, pp. 468--477.","chicago":"Rensink, Arend, and Heike Wehrheim. “Dependency-Based Action Refinement.” In <i>Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS’97, Bratislava, Slovakia, August 25-29, 1997, Proceedings</i>, edited by Igor Pr{\\’{\\i}}vara and Peter Ruzicka, 468--477. Lecture Notes in Computer Science, 1997. <a href=\"https://doi.org/10.1007/BFb0029990\">https://doi.org/10.1007/BFb0029990</a>.","mla":"Rensink, Arend, and Heike Wehrheim. “Dependency-Based Action Refinement.” <i>Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS’97, Bratislava, Slovakia, August 25-29, 1997, Proceedings</i>, edited by Igor Pr{\\’{\\i}}vara and Peter Ruzicka, 1997, pp. 468--477, doi:<a href=\"https://doi.org/10.1007/BFb0029990\">10.1007/BFb0029990</a>.","ama":"Rensink A, Wehrheim H. Dependency-Based Action Refinement. In: Pr{\\’{\\i}}vara I, Ruzicka P, eds. <i>Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS’97, Bratislava, Slovakia, August 25-29, 1997, Proceedings</i>. Lecture Notes in Computer Science. ; 1997:468--477. doi:<a href=\"https://doi.org/10.1007/BFb0029990\">10.1007/BFb0029990</a>","bibtex":"@inproceedings{Rensink_Wehrheim_1997, series={Lecture Notes in Computer Science}, title={Dependency-Based Action Refinement}, DOI={<a href=\"https://doi.org/10.1007/BFb0029990\">10.1007/BFb0029990</a>}, booktitle={Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS’97, Bratislava, Slovakia, August 25-29, 1997, Proceedings}, author={Rensink, Arend and Wehrheim, Heike}, editor={Pr{\\’{\\i}}vara, Igor and Ruzicka, PeterEditors}, year={1997}, pages={468--477}, collection={Lecture Notes in Computer Science} }"},"date_created":"2018-06-14T07:43:09Z","type":"conference","department":[{"_id":"77"}],"status":"public","title":"Dependency-Based Action Refinement","year":"1997","author":[{"full_name":"Rensink, Arend","first_name":"Arend","last_name":"Rensink"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"date_updated":"2022-01-06T06:59:07Z","page":"468--477","series_title":"Lecture Notes in Computer Science","_id":"3259","doi":"10.1007/BFb0029990","user_id":"29719","editor":[{"first_name":"Igor","last_name":"Pr{\\'{\\i}}vara","full_name":"Pr{\\'{\\i}}vara, Igor"},{"last_name":"Ruzicka","first_name":"Peter","full_name":"Ruzicka, Peter"}]},{"status":"public","has_accepted_license":"1","_id":"3029","publisher":"Springer Berlin Heidelberg","page":"53-63","user_id":"25078","ddc":["000"],"citation":{"bibtex":"@inbook{Blömer_1997, place={Berlin, Heidelberg}, title={Denesting by bounded degree radicals}, DOI={<a href=\"https://doi.org/10.1007/3-540-63397-9_5\">10.1007/3-540-63397-9_5</a>}, booktitle={Algorithms — ESA ’97}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes}, year={1997}, pages={53–63} }","chicago":"Blömer, Johannes. “Denesting by Bounded Degree Radicals.” In <i>Algorithms — ESA ’97</i>, 53–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. <a href=\"https://doi.org/10.1007/3-540-63397-9_5\">https://doi.org/10.1007/3-540-63397-9_5</a>.","ama":"Blömer J. Denesting by bounded degree radicals. In: <i>Algorithms — ESA ’97</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 1997:53-63. doi:<a href=\"https://doi.org/10.1007/3-540-63397-9_5\">10.1007/3-540-63397-9_5</a>","short":"J. Blömer, in: Algorithms — ESA ’97, Springer Berlin Heidelberg, Berlin, Heidelberg, 1997, pp. 53–63.","ieee":"J. Blömer, “Denesting by bounded degree radicals,” in <i>Algorithms — ESA ’97</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 1997, pp. 53–63.","mla":"Blömer, Johannes. “Denesting by Bounded Degree Radicals.” <i>Algorithms — ESA ’97</i>, Springer Berlin Heidelberg, 1997, pp. 53–63, doi:<a href=\"https://doi.org/10.1007/3-540-63397-9_5\">10.1007/3-540-63397-9_5</a>.","apa":"Blömer, J. (1997). Denesting by bounded degree radicals. In <i>Algorithms — ESA ’97</i> (pp. 53–63). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/3-540-63397-9_5\">https://doi.org/10.1007/3-540-63397-9_5</a>"},"file_date_updated":"2018-06-05T08:31:35Z","place":"Berlin, Heidelberg","author":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540633976","9783540695363"]},"title":"Denesting by bounded degree radicals","year":"1997","publication_status":"published","date_updated":"2022-01-06T06:58:52Z","doi":"10.1007/3-540-63397-9_5","publication":"Algorithms — ESA '97","date_created":"2018-06-05T08:30:40Z","file":[{"access_level":"closed","file_size":1656133,"file_name":"DenestingByBoundedDegreeRevised.pdf","date_updated":"2018-06-05T08:31:35Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"3030","creator":"feidens","date_created":"2018-06-05T08:31:35Z"}],"department":[{"_id":"64"}],"type":"book_chapter"},{"_id":"3033","page":"407-419","doi":"10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y","user_id":"25078","author":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"},{"first_name":"Richard","last_name":"Karp","full_name":"Karp, Richard"},{"full_name":"Welzl, Emo","first_name":"Emo","last_name":"Welzl"}],"title":"The rank of sparse random matrices over finite fields","year":"1997","status":"public","date_updated":"2022-01-06T06:58:52Z","publication_status":"published","date_created":"2018-06-05T08:34:49Z","department":[{"_id":"64"}],"type":"journal_article","keyword":["random matrices","rank","finite fields"],"citation":{"mla":"Blömer, Johannes, et al. “The Rank of Sparse Random Matrices over Finite Fields.” <i>Random Structures \\&#38; Algorithms</i>, no. 4, 1997, pp. 407–19, doi:<a href=\"https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y\">10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y</a>.","ama":"Blömer J, Karp R, Welzl E. The rank of sparse random matrices over finite fields. <i>Random Structures \\&#38; Algorithms</i>. 1997;(4):407-419. doi:<a href=\"https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y\">10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y</a>","bibtex":"@article{Blömer_Karp_Welzl_1997, title={The rank of sparse random matrices over finite fields}, DOI={<a href=\"https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y\">10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y</a>}, number={4}, journal={Random Structures \\&#38; Algorithms}, author={Blömer, Johannes and Karp, Richard and Welzl, Emo}, year={1997}, pages={407–419} }","apa":"Blömer, J., Karp, R., &#38; Welzl, E. (1997). The rank of sparse random matrices over finite fields. <i>Random Structures \\&#38; Algorithms</i>, (4), 407–419. <a href=\"https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y\">https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y</a>","ieee":"J. Blömer, R. Karp, and E. Welzl, “The rank of sparse random matrices over finite fields,” <i>Random Structures \\&#38; Algorithms</i>, no. 4, pp. 407–419, 1997.","short":"J. Blömer, R. Karp, E. Welzl, Random Structures \\&#38; Algorithms (1997) 407–419.","chicago":"Blömer, Johannes, Richard Karp, and Emo Welzl. “The Rank of Sparse Random Matrices over Finite Fields.” <i>Random Structures \\&#38; Algorithms</i>, no. 4 (1997): 407–19. <a href=\"https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y\">https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y</a>."},"issue":"4","publication":"Random Structures \\& Algorithms","extern":"1"},{"file_date_updated":"2020-09-03T12:59:44Z","citation":{"apa":"Strothmann, W.-B., &#38; Lukovszki, T. (1997). <i>Decremental Biconnectivity on Planar Graphs</i>. Paderborn.","ieee":"W.-B. Strothmann and T. Lukovszki, <i>Decremental Biconnectivity on Planar Graphs</i>. Paderborn, 1997.","short":"W.-B. Strothmann, T. Lukovszki, Decremental Biconnectivity on Planar Graphs, Paderborn, 1997.","chicago":"Strothmann, Willy-Bernhard, and Tamás Lukovszki. <i>Decremental Biconnectivity on Planar Graphs</i>. Paderborn, 1997.","mla":"Strothmann, Willy-Bernhard, and Tamás Lukovszki. <i>Decremental Biconnectivity on Planar Graphs</i>. 1997.","ama":"Strothmann W-B, Lukovszki T. <i>Decremental Biconnectivity on Planar Graphs</i>. Paderborn; 1997.","bibtex":"@book{Strothmann_Lukovszki_1997, place={Paderborn}, title={Decremental Biconnectivity on Planar Graphs}, author={Strothmann, Willy-Bernhard and Lukovszki, Tamás}, year={1997} }"},"abstract":[{"lang":"eng","text":"In this paper we present a (randomized) algorithm for maintaining the biconnected components of a dynamic planar graph of $n$ vertices under deletions of edges. The biconnected components can be maintained under any sequence of edge deletions in a total of $O(n log n)$ time, with high probability. This gives $O(log n)$ amortized time per edge deletion, which improves previous (deterministic) results due to Giammarresi and Italiano, where $O(n log^2 n)$ amortized time is needed. Our work describes a simplification of the data structures from [GiIt96] and uses dynamic perfect hashing to reduce the running time. As in the paper by Giammarresi and Italiano, we only need $O(n)$ space. Finally we describe some simply additional operations on the decremental data structure. By aid of them this the data structure is applicable for finding efficiently a $Delta$-spanning tree in a biconnected planar graph with a maximum degree $2Delta-2$ do to Czumaj and Strothmann."}],"file":[{"file_name":"pub-hni-901.pdf","file_size":222106,"access_level":"closed","relation":"main_file","date_updated":"2020-09-03T12:59:44Z","file_id":"18957","content_type":"application/pdf","success":1,"creator":"koala","date_created":"2020-09-03T12:59:44Z"}],"place":"Paderborn","date_created":"2020-09-03T12:59:56Z","type":"report","department":[{"_id":"63"}],"year":"1997","title":"Decremental Biconnectivity on Planar Graphs","status":"public","author":[{"first_name":"Willy-Bernhard","last_name":"Strothmann","full_name":"Strothmann, Willy-Bernhard"},{"full_name":"Lukovszki, Tamás","first_name":"Tamás","last_name":"Lukovszki"}],"date_updated":"2022-01-06T06:53:55Z","has_accepted_license":"1","language":[{"iso":"eng"}],"_id":"18955","ddc":["000"],"user_id":"15415"},{"year":"1997","status":"public","title":"Encoding a Triangulation as a Permutation of its Point Set","author":[{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"},{"full_name":"Denny, Markus","first_name":"Markus","last_name":"Denny"}],"date_updated":"2022-01-06T06:53:40Z","page":"39-43","_id":"18575","language":[{"iso":"eng"}],"user_id":"15415","publication":"Proceedings of the 9th Canadian Conference on Computational Geometry","citation":{"mla":"Sohler, Christian, and Markus Denny. “Encoding a Triangulation as a Permutation of Its Point Set.” <i>Proceedings of the 9th Canadian Conference on Computational Geometry</i>, 1997, pp. 39–43.","ama":"Sohler C, Denny M. Encoding a Triangulation as a Permutation of its Point Set. In: <i>Proceedings of the 9th Canadian Conference on Computational Geometry</i>. ; 1997:39-43.","bibtex":"@inproceedings{Sohler_Denny_1997, title={Encoding a Triangulation as a Permutation of its Point Set}, booktitle={Proceedings of the 9th Canadian Conference on Computational Geometry}, author={Sohler, Christian and Denny, Markus}, year={1997}, pages={39–43} }","apa":"Sohler, C., &#38; Denny, M. (1997). Encoding a Triangulation as a Permutation of its Point Set. In <i>Proceedings of the 9th Canadian Conference on Computational Geometry</i> (pp. 39–43).","ieee":"C. Sohler and M. Denny, “Encoding a Triangulation as a Permutation of its Point Set,” in <i>Proceedings of the 9th Canadian Conference on Computational Geometry</i>, 1997, pp. 39–43.","chicago":"Sohler, Christian, and Markus Denny. “Encoding a Triangulation as a Permutation of Its Point Set.” In <i>Proceedings of the 9th Canadian Conference on Computational Geometry</i>, 39–43, 1997.","short":"C. Sohler, M. Denny, in: Proceedings of the 9th Canadian Conference on Computational Geometry, 1997, pp. 39–43."},"date_created":"2020-08-28T14:14:57Z","type":"conference","department":[{"_id":"63"}]},{"status":"public","has_accepted_license":"1","publisher":"IEEE Computer Society","_id":"2175","urn":"21759","page":"326--332","user_id":"14955","ddc":["040"],"citation":{"mla":"Bock, Stefan, et al. “Optimal Wormhole Routing in the (n, d)-Torus.” <i>IPPS</i>, IEEE Computer Society, 1997, pp. 326--332.","bibtex":"@inproceedings{Bock_Meyer auf der Heide_Scheideler_1997, title={Optimal Wormhole Routing in the (n, d)-Torus}, booktitle={IPPS}, publisher={IEEE Computer Society}, author={Bock, Stefan and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1997}, pages={326--332} }","ama":"Bock S, Meyer auf der Heide F, Scheideler C. Optimal Wormhole Routing in the (n, d)-Torus. In: <i>IPPS</i>. IEEE Computer Society; 1997:326--332.","ieee":"S. Bock, F. Meyer auf der Heide, and C. Scheideler, “Optimal Wormhole Routing in the (n, d)-Torus,” in <i>IPPS</i>, 1997, pp. 326--332.","apa":"Bock, S., Meyer auf der Heide, F., &#38; Scheideler, C. (1997). Optimal Wormhole Routing in the (n, d)-Torus. In <i>IPPS</i> (pp. 326--332). IEEE Computer Society.","chicago":"Bock, Stefan, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Optimal Wormhole Routing in the (n, d)-Torus.” In <i>IPPS</i>, 326--332. IEEE Computer Society, 1997.","short":"S. Bock, F. Meyer auf der Heide, C. Scheideler, in: IPPS, IEEE Computer Society, 1997, pp. 326--332."},"file_date_updated":"2018-04-12T07:11:50Z","oa":"1","author":[{"full_name":"Bock, Stefan","last_name":"Bock","first_name":"Stefan"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"title":"Optimal Wormhole Routing in the (n, d)-Torus","year":"1997","date_updated":"2022-01-06T06:55:13Z","language":[{"iso":"eng"}],"publication":"IPPS","date_created":"2018-04-03T09:11:47Z","file":[{"date_updated":"2018-04-12T07:11:50Z","relation":"main_file","file_size":88749,"access_level":"open_access","file_name":"IPPS97.pdf","content_type":"application/pdf","file_id":"2284","creator":"florida","date_created":"2018-04-12T07:07:20Z"}],"department":[{"_id":"79"},{"_id":"63"}],"type":"conference"},{"ddc":["040"],"user_id":"14955","_id":"2179","language":[{"iso":"eng"}],"urn":"21792","page":"170--179","has_accepted_license":"1","date_updated":"2022-01-06T06:55:13Z","author":[{"first_name":"Michele","last_name":"Flammini","full_name":"Flammini, Michele"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"year":"1997","status":"public","title":"Simple, Efficient Routing Schemes for All-Optical Networks","oa":"1","department":[{"_id":"79"},{"_id":"63"}],"type":"conference","date_created":"2018-04-03T09:17:10Z","file":[{"file_name":"SPAA97.pdf","file_size":365709,"access_level":"open_access","relation":"main_file","date_updated":"2018-04-12T07:11:32Z","file_id":"2283","content_type":"application/pdf","creator":"florida","date_created":"2018-04-12T07:06:34Z"}],"citation":{"mla":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” <i>SPAA</i>, 1997, pp. 170--179.","bibtex":"@inproceedings{Flammini_Scheideler_1997, title={Simple, Efficient Routing Schemes for All-Optical Networks}, booktitle={SPAA}, author={Flammini, Michele and Scheideler, Christian}, year={1997}, pages={170--179} }","ama":"Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical Networks. In: <i>SPAA</i>. ; 1997:170--179.","ieee":"M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” in <i>SPAA</i>, 1997, pp. 170--179.","apa":"Flammini, M., &#38; Scheideler, C. (1997). Simple, Efficient Routing Schemes for All-Optical Networks. In <i>SPAA</i> (pp. 170--179).","chicago":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” In <i>SPAA</i>, 170--179, 1997.","short":"M. Flammini, C. Scheideler, in: SPAA, 1997, pp. 170--179."},"publication":"SPAA","file_date_updated":"2018-04-12T07:11:32Z"},{"citation":{"mla":"Engels, Gregor, editor. <i>Themenheft: Softwaretechnik</i>. Vol. 12, no. 4, Springer, 1997, doi:<a href=\"http://dx.doi.org/10.1007/s004500050085\">http://dx.doi.org/10.1007/s004500050085</a>.","bibtex":"@book{Engels_1997, place={Berlin/Heidelberg}, series={Informatik: Forschung und Entwicklung}, title={Themenheft: Softwaretechnik}, volume={12}, DOI={<a href=\"http://dx.doi.org/10.1007/s004500050085\">http://dx.doi.org/10.1007/s004500050085</a>}, number={4}, publisher={Springer}, year={1997}, collection={Informatik: Forschung und Entwicklung} }","ama":"Engels G, ed. <i>Themenheft: Softwaretechnik</i>. Vol 12. Berlin/Heidelberg: Springer; 1997. doi:<a href=\"http://dx.doi.org/10.1007/s004500050085\">http://dx.doi.org/10.1007/s004500050085</a>","ieee":"G. Engels, Ed., <i>Themenheft: Softwaretechnik</i>, vol. 12, no. 4. Berlin/Heidelberg: Springer, 1997.","apa":"Engels, G. (Ed.). (1997). <i>Themenheft: Softwaretechnik</i> (Vol. 12). Berlin/Heidelberg: Springer. <a href=\"http://dx.doi.org/10.1007/s004500050085\">http://dx.doi.org/10.1007/s004500050085</a>","chicago":"Engels, Gregor, ed. <i>Themenheft: Softwaretechnik</i>. Vol. 12. Informatik: Forschung Und Entwicklung. Berlin/Heidelberg: Springer, 1997. <a href=\"http://dx.doi.org/10.1007/s004500050085\">http://dx.doi.org/10.1007/s004500050085</a>.","short":"G. Engels, ed., Themenheft: Softwaretechnik, Springer, Berlin/Heidelberg, 1997."},"issue":"4","place":"Berlin/Heidelberg","date_created":"2019-02-19T19:15:50Z","department":[{"_id":"66"}],"type":"conference_editor","year":"1997","status":"public","title":"Themenheft: Softwaretechnik","intvolume":"        12","date_updated":"2022-01-06T07:03:46Z","publisher":"Springer","_id":"7795","series_title":"Informatik: Forschung und Entwicklung","language":[{"iso":"eng"}],"editor":[{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"}],"volume":12,"doi":"http://dx.doi.org/10.1007/s004500050085","user_id":"52534"},{"status":"public","_id":"7839","publisher":"Springer","page":"327-343","editor":[{"full_name":"Jazayeri, M.","first_name":"M.","last_name":"Jazayeri"},{"last_name":"Schauer","first_name":"H.","full_name":"Schauer, H."}],"volume":1301,"user_id":"52534","citation":{"short":"G. Engels, R. Heckel, G. Taentzer, H. Ehrig, in: M. Jazayeri, H. Schauer (Eds.), Proceedings European Software Engineering Conference (ESEC 1997), Zürich (Switzerland), Springer, Berlin/Heidelberg, 1997, pp. 327–343.","chicago":"Engels, Gregor, Reiko Heckel, Gabriele Taentzer, and Hartmut Ehrig. “A View-Oriented Approach to System Modelling Using Graph Transformations.” In <i>Proceedings European Software Engineering Conference (ESEC 1997), Zürich (Switzerland)</i>, edited by M. Jazayeri and H. Schauer, 1301:327–43. Berlin/Heidelberg: Springer, 1997. <a href=\"http://dx.doi.org/10.1007/3-540-63531-9\">http://dx.doi.org/10.1007/3-540-63531-9</a>.","apa":"Engels, G., Heckel, R., Taentzer, G., &#38; Ehrig, H. (1997). A View-Oriented Approach to System Modelling Using Graph Transformations. In M. Jazayeri &#38; H. Schauer (Eds.), <i>Proceedings European Software Engineering Conference (ESEC 1997), Zürich (Switzerland)</i> (Vol. 1301, pp. 327–343). Berlin/Heidelberg: Springer. <a href=\"http://dx.doi.org/10.1007/3-540-63531-9\">http://dx.doi.org/10.1007/3-540-63531-9</a>","ieee":"G. Engels, R. Heckel, G. Taentzer, and H. Ehrig, “A View-Oriented Approach to System Modelling Using Graph Transformations,” in <i>Proceedings European Software Engineering Conference (ESEC 1997), Zürich (Switzerland)</i>, 1997, vol. 1301, pp. 327–343.","ama":"Engels G, Heckel R, Taentzer G, Ehrig H. A View-Oriented Approach to System Modelling Using Graph Transformations. In: Jazayeri M, Schauer H, eds. <i>Proceedings European Software Engineering Conference (ESEC 1997), Zürich (Switzerland)</i>. Vol 1301. Berlin/Heidelberg: Springer; 1997:327-343. doi:<a href=\"http://dx.doi.org/10.1007/3-540-63531-9\">http://dx.doi.org/10.1007/3-540-63531-9</a>","bibtex":"@inproceedings{Engels_Heckel_Taentzer_Ehrig_1997, place={Berlin/Heidelberg}, title={A View-Oriented Approach to System Modelling Using Graph Transformations}, volume={1301}, DOI={<a href=\"http://dx.doi.org/10.1007/3-540-63531-9\">http://dx.doi.org/10.1007/3-540-63531-9</a>}, booktitle={Proceedings European Software Engineering Conference (ESEC 1997), Zürich (Switzerland)}, publisher={Springer}, author={Engels, Gregor and Heckel, Reiko and Taentzer, Gabriele and Ehrig, Hartmut}, editor={Jazayeri, M. and Schauer, H.Editors}, year={1997}, pages={327–343} }","mla":"Engels, Gregor, et al. “A View-Oriented Approach to System Modelling Using Graph Transformations.” <i>Proceedings European Software Engineering Conference (ESEC 1997), Zürich (Switzerland)</i>, edited by M. Jazayeri and H. Schauer, vol. 1301, Springer, 1997, pp. 327–43, doi:<a href=\"http://dx.doi.org/10.1007/3-540-63531-9\">http://dx.doi.org/10.1007/3-540-63531-9</a>."},"place":"Berlin/Heidelberg","author":[{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"},{"full_name":"Heckel, Reiko","last_name":"Heckel","first_name":"Reiko"},{"full_name":"Taentzer, Gabriele","last_name":"Taentzer","first_name":"Gabriele"},{"first_name":"Hartmut","last_name":"Ehrig","full_name":"Ehrig, Hartmut"}],"year":"1997","title":"A View-Oriented Approach to System Modelling Using Graph Transformations","intvolume":"      1301","date_updated":"2022-01-06T07:03:47Z","language":[{"iso":"eng"}],"doi":"http://dx.doi.org/10.1007/3-540-63531-9","publication":"Proceedings European Software Engineering Conference (ESEC 1997), Zürich (Switzerland)","abstract":[{"text":"The idea of a combined reference model- and view-based specification approach has been proposed recently in the software engineering community. In this paper we present a specification technique based on graph transformations which supports such a development approach. The use of graphs and graph transformations supports an intuitive understanding and an integration of static and dynamic aspects on a well-defined semantical base. On this background, formal notions of view and view relation are developed and the behaviour of views is described by a loose semantics. We define a construction for automatic view integration which assumes that the dependencies between different views are described by a reference model. The views and the reference model are kept consistent manually, which is the task of a model manager. All concepts and results are illustrated at the well-known example of a banking system.","lang":"eng"}],"date_created":"2019-02-20T14:06:52Z","department":[{"_id":"66"}],"type":"conference"},{"abstract":[{"lang":"ger","text":"Vorteile von Laserkristallen in Slab-Geometrie gegenüber Stäben liegen in einer Reduktion der thermisch induzierten Linsenwirkung und der spannungsinduzierten Depolarisation durch einen zick-zack-förmigen Strahlverlauf innerhalb des Kristalls. Durch die Analyse der durch die Anordnung der Pumpquellen und die Dotierungskonzentration bestimmten Temperatur- und Spannungsverteilungen mit Hilfe eines Finite-Element-Modells und die Berechnung der resultierenden optischen Eigenschaften lassen sich die genannten Zielgrößen optimieren. Die Verfahren wurden auf am Laser Zentrum Hannover e.V. entwickelte Nd:YAG-Stab- und Slablaser angewandt und ermöglichten die Entwicklung diodengepumpter Festkörperlaser-Systeme mit Ausgangsleistungen von mehr als 750W bei guter Strahlqualität. Modellerweiterungen unter Berücksichtigung der Wechselwirkung zwischen Lasermoden und aktivem Material werden diskutiert. Diese Arbeit wird gefördert durch das BMBF, FKZ: 13 N 6361"}],"citation":{"apa":"Depke, R., Knoke, S., Schöne, W., Tünnermann, A., &#38; Welling, H. (1997). Thermooptische Effekte in Nd:YAG-Slablasern. In <i>Verhandlungen der Deutschen Physikalischen Gesellschaft</i> (Vol. 32). Weinheim, Germany: Physik-Verlag.","mla":"Depke, Ralph, et al. “Thermooptische Effekte in Nd:YAG-Slablasern.” <i>Verhandlungen Der Deutschen Physikalischen Gesellschaft</i>, vol. 32, no. 3, Physik-Verlag, 1997.","ieee":"R. Depke, S. Knoke, W. Schöne, A. Tünnermann, and H. Welling, “Thermooptische Effekte in Nd:YAG-Slablasern,” in <i>Verhandlungen der Deutschen Physikalischen Gesellschaft</i>, 1997, vol. 32, no. 3.","chicago":"Depke, Ralph, Stefan Knoke, Wolfram Schöne, Andreas Tünnermann, and H. Welling. “Thermooptische Effekte in Nd:YAG-Slablasern.” In <i>Verhandlungen Der Deutschen Physikalischen Gesellschaft</i>, Vol. 32. Weinheim, Germany: Physik-Verlag, 1997.","ama":"Depke R, Knoke S, Schöne W, Tünnermann A, Welling H. Thermooptische Effekte in Nd:YAG-Slablasern. In: <i>Verhandlungen Der Deutschen Physikalischen Gesellschaft</i>. Vol 32. Weinheim, Germany: Physik-Verlag; 1997.","short":"R. Depke, S. Knoke, W. Schöne, A. Tünnermann, H. Welling, in: Verhandlungen Der Deutschen Physikalischen Gesellschaft, Physik-Verlag, Weinheim, Germany, 1997.","bibtex":"@inproceedings{Depke_Knoke_Schöne_Tünnermann_Welling_1997, place={Weinheim, Germany}, title={Thermooptische Effekte in Nd:YAG-Slablasern}, volume={32}, number={3}, booktitle={Verhandlungen der Deutschen Physikalischen Gesellschaft}, publisher={Physik-Verlag}, author={Depke, Ralph and Knoke, Stefan and Schöne, Wolfram and Tünnermann, Andreas and Welling, H.}, year={1997} }"},"issue":"3","publication":"Verhandlungen der Deutschen Physikalischen Gesellschaft","department":[{"_id":"66"}],"type":"conference","place":"Weinheim, Germany","date_created":"2019-02-20T14:07:44Z","intvolume":"        32","date_updated":"2022-01-06T07:03:47Z","author":[{"full_name":"Depke, Ralph","first_name":"Ralph","last_name":"Depke"},{"full_name":"Knoke, Stefan","first_name":"Stefan","last_name":"Knoke"},{"first_name":"Wolfram","last_name":"Schöne","full_name":"Schöne, Wolfram"},{"full_name":"Tünnermann, Andreas","last_name":"Tünnermann","first_name":"Andreas"},{"last_name":"Welling","first_name":"H.","full_name":"Welling, H."}],"status":"public","title":"Thermooptische Effekte in Nd:YAG-Slablasern","year":"1997","volume":32,"user_id":"52534","_id":"7840","publisher":"Physik-Verlag","language":[{"iso":"eng"}]},{"type":"conference","department":[{"_id":"66"}],"place":"London, UK","date_created":"2019-02-20T14:08:31Z","publication":"Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS 1997), Bratislava (Slovakia)","citation":{"mla":"Heckel, Reiko, et al. “Integrating the Specification Techniques of Graph Transformation and Temporal Logic.” <i>Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS 1997), Bratislava (Slovakia)</i>, Springer, 1997, pp. 219–28, doi:<a href=\"http://dx.doi.org/10.1007/BFb0029965\">http://dx.doi.org/10.1007/BFb0029965</a>.","ama":"Heckel R, Ehrig H, Wolter U, Corradini A. Integrating the Specification Techniques of Graph Transformation and Temporal Logic. In: <i>Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS 1997), Bratislava (Slovakia)</i>. LNCS. London, UK: Springer; 1997:219-228. doi:<a href=\"http://dx.doi.org/10.1007/BFb0029965\">http://dx.doi.org/10.1007/BFb0029965</a>","bibtex":"@inproceedings{Heckel_Ehrig_Wolter_Corradini_1997, place={London, UK}, series={LNCS}, title={Integrating the Specification Techniques of Graph Transformation and Temporal Logic}, DOI={<a href=\"http://dx.doi.org/10.1007/BFb0029965\">http://dx.doi.org/10.1007/BFb0029965</a>}, booktitle={Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS 1997), Bratislava (Slovakia)}, publisher={Springer}, author={Heckel, Reiko and Ehrig, Hartmut and Wolter, Uwe and Corradini, Andrea}, year={1997}, pages={219–228}, collection={LNCS} }","apa":"Heckel, R., Ehrig, H., Wolter, U., &#38; Corradini, A. (1997). Integrating the Specification Techniques of Graph Transformation and Temporal Logic. In <i>Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS 1997), Bratislava (Slovakia)</i> (pp. 219–228). London, UK: Springer. <a href=\"http://dx.doi.org/10.1007/BFb0029965\">http://dx.doi.org/10.1007/BFb0029965</a>","ieee":"R. Heckel, H. Ehrig, U. Wolter, and A. Corradini, “Integrating the Specification Techniques of Graph Transformation and Temporal Logic,” in <i>Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS 1997), Bratislava (Slovakia)</i>, 1997, pp. 219–228.","chicago":"Heckel, Reiko, Hartmut Ehrig, Uwe Wolter, and Andrea Corradini. “Integrating the Specification Techniques of Graph Transformation and Temporal Logic.” In <i>Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS 1997), Bratislava (Slovakia)</i>, 219–28. LNCS. London, UK: Springer, 1997. <a href=\"http://dx.doi.org/10.1007/BFb0029965\">http://dx.doi.org/10.1007/BFb0029965</a>.","short":"R. Heckel, H. Ehrig, U. Wolter, A. Corradini, in: Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS 1997), Bratislava (Slovakia), Springer, London, UK, 1997, pp. 219–228."},"doi":"http://dx.doi.org/10.1007/BFb0029965","user_id":"52534","page":"219-228","publisher":"Springer","_id":"7841","series_title":"LNCS","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:47Z","title":"Integrating the Specification Techniques of Graph Transformation and Temporal Logic","status":"public","year":"1997","author":[{"full_name":"Heckel, Reiko","last_name":"Heckel","first_name":"Reiko"},{"last_name":"Ehrig","first_name":"Hartmut","full_name":"Ehrig, Hartmut"},{"full_name":"Wolter, Uwe","last_name":"Wolter","first_name":"Uwe"},{"full_name":"Corradini, Andrea","last_name":"Corradini","first_name":"Andrea"}]},{"date_created":"2019-02-20T14:09:17Z","department":[{"_id":"66"}],"type":"conference","citation":{"bibtex":"@inproceedings{Knoke_Depke_Schöne_Brozek_Tünnermann_Welling_1997, title={Einfrequenzbetrieb von Nd:YAG-Stablasersystemen hoher Ausgangsleistung}, volume={32}, number={3}, booktitle={Verhandlungen der Deutschen Physikalischen Gesellschaft, Weinheim (Germany)}, publisher={Physik-Verlag}, author={Knoke, Stefan and Depke, Ralph and Schöne, Wolfram and Brozek, O.S. and Tünnermann, Andreas and Welling, H.}, year={1997} }","ama":"Knoke S, Depke R, Schöne W, Brozek OS, Tünnermann A, Welling H. Einfrequenzbetrieb von Nd:YAG-Stablasersystemen hoher Ausgangsleistung. In: <i>Verhandlungen Der Deutschen Physikalischen Gesellschaft, Weinheim (Germany)</i>. Vol 32. Physik-Verlag; 1997.","mla":"Knoke, Stefan, et al. “Einfrequenzbetrieb von Nd:YAG-Stablasersystemen Hoher Ausgangsleistung.” <i>Verhandlungen Der Deutschen Physikalischen Gesellschaft, Weinheim (Germany)</i>, vol. 32, no. 3, Physik-Verlag, 1997.","chicago":"Knoke, Stefan, Ralph Depke, Wolfram Schöne, O.S. Brozek, Andreas Tünnermann, and H. Welling. “Einfrequenzbetrieb von Nd:YAG-Stablasersystemen Hoher Ausgangsleistung.” In <i>Verhandlungen Der Deutschen Physikalischen Gesellschaft, Weinheim (Germany)</i>, Vol. 32. Physik-Verlag, 1997.","short":"S. Knoke, R. Depke, W. Schöne, O.S. Brozek, A. Tünnermann, H. Welling, in: Verhandlungen Der Deutschen Physikalischen Gesellschaft, Weinheim (Germany), Physik-Verlag, 1997.","ieee":"S. Knoke, R. Depke, W. Schöne, O. S. Brozek, A. Tünnermann, and H. Welling, “Einfrequenzbetrieb von Nd:YAG-Stablasersystemen hoher Ausgangsleistung,” in <i>Verhandlungen der Deutschen Physikalischen Gesellschaft, Weinheim (Germany)</i>, 1997, vol. 32, no. 3.","apa":"Knoke, S., Depke, R., Schöne, W., Brozek, O. S., Tünnermann, A., &#38; Welling, H. (1997). Einfrequenzbetrieb von Nd:YAG-Stablasersystemen hoher Ausgangsleistung. In <i>Verhandlungen der Deutschen Physikalischen Gesellschaft, Weinheim (Germany)</i> (Vol. 32). Physik-Verlag."},"issue":"3","publication":"Verhandlungen der Deutschen Physikalischen Gesellschaft, Weinheim (Germany)","_id":"7842","publisher":"Physik-Verlag","language":[{"iso":"eng"}],"volume":32,"user_id":"52534","author":[{"first_name":"Stefan","last_name":"Knoke","full_name":"Knoke, Stefan"},{"full_name":"Depke, Ralph","last_name":"Depke","first_name":"Ralph"},{"last_name":"Schöne","first_name":"Wolfram","full_name":"Schöne, Wolfram"},{"first_name":"O.S.","last_name":"Brozek","full_name":"Brozek, O.S."},{"last_name":"Tünnermann","first_name":"Andreas","full_name":"Tünnermann, Andreas"},{"last_name":"Welling","first_name":"H.","full_name":"Welling, H."}],"year":"1997","status":"public","title":"Einfrequenzbetrieb von Nd:YAG-Stablasersystemen hoher Ausgangsleistung","intvolume":"        32","date_updated":"2022-01-06T07:03:47Z"}]