[{"type":"report","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"18961","language":[{"iso":"eng"}],"citation":{"chicago":"Lukovszki, Tamás, and A. Benczúr. <i>A Degree O(Log Log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing</i>. Paderborn, 2002.","ieee":"T. Lukovszki and A. Benczúr, <i>A Degree O(log log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing</i>. Paderborn, 2002.","ama":"Lukovszki T, Benczúr A. <i>A Degree O(Log Log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing</i>. Paderborn; 2002.","apa":"Lukovszki, T., &#38; Benczúr, A. (2002). <i>A Degree O(log log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing</i>. Paderborn.","bibtex":"@book{Lukovszki_Benczúr_2002, place={Paderborn}, title={A Degree O(log log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing}, author={Lukovszki, Tamás and Benczúr, A.}, year={2002} }","short":"T. Lukovszki, A. Benczúr, A Degree O(Log Log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing, Paderborn, 2002.","mla":"Lukovszki, Tamás, and A. Benczúr. <i>A Degree O(Log Log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing</i>. 2002."},"place":"Paderborn","year":"2002","date_created":"2020-09-03T13:16:48Z","author":[{"first_name":"Tamás","last_name":"Lukovszki","full_name":"Lukovszki, Tamás"},{"full_name":"Benczúr, A.","last_name":"Benczúr","first_name":"A."}],"date_updated":"2022-01-06T06:53:55Z","title":"A Degree O(log log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing"},{"publication":"Proc. IST Mobile & Wireless Telecommunications Summit 2002.","type":"conference","status":"public","_id":"1921","department":[{"_id":"75"}],"user_id":"15572","year":"2002","citation":{"bibtex":"@inproceedings{Ngo-Quynh_Karl_Wolisz_Rebensburg_2002, title={New Scheduling Algorithm for Providing Proportional Jitter in  Differentiated Service Network }, booktitle={Proc. IST Mobile &#38; Wireless Telecommunications Summit 2002.}, author={Ngo-Quynh, Thu and Karl, Holger and Wolisz, Adam and Rebensburg, Klaus}, year={2002} }","short":"T. Ngo-Quynh, H. Karl, A. Wolisz, K. Rebensburg, in: Proc. IST Mobile &#38; Wireless Telecommunications Summit 2002., 2002.","mla":"Ngo-Quynh, Thu, et al. “New Scheduling Algorithm for Providing Proportional Jitter in  Differentiated Service Network .” <i>Proc. IST Mobile &#38; Wireless Telecommunications Summit 2002.</i>, 2002.","apa":"Ngo-Quynh, T., Karl, H., Wolisz, A., &#38; Rebensburg, K. (2002). New Scheduling Algorithm for Providing Proportional Jitter in  Differentiated Service Network . In <i>Proc. IST Mobile &#38; Wireless Telecommunications Summit 2002.</i>","ieee":"T. Ngo-Quynh, H. Karl, A. Wolisz, and K. Rebensburg, “New Scheduling Algorithm for Providing Proportional Jitter in  Differentiated Service Network ,” in <i>Proc. IST Mobile &#38; Wireless Telecommunications Summit 2002.</i>, 2002.","chicago":"Ngo-Quynh, Thu, Holger Karl, Adam Wolisz, and Klaus Rebensburg. “New Scheduling Algorithm for Providing Proportional Jitter in  Differentiated Service Network .” In <i>Proc. IST Mobile &#38; Wireless Telecommunications Summit 2002.</i>, 2002.","ama":"Ngo-Quynh T, Karl H, Wolisz A, Rebensburg K. New Scheduling Algorithm for Providing Proportional Jitter in  Differentiated Service Network . In: <i>Proc. IST Mobile &#38; Wireless Telecommunications Summit 2002.</i> ; 2002."},"date_updated":"2022-01-06T06:54:00Z","date_created":"2018-03-28T11:36:45Z","author":[{"full_name":"Ngo-Quynh, Thu","last_name":"Ngo-Quynh","first_name":"Thu"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"},{"last_name":"Wolisz","full_name":"Wolisz, Adam","first_name":"Adam"},{"first_name":"Klaus","full_name":"Rebensburg, Klaus","last_name":"Rebensburg"}],"title":"New Scheduling Algorithm for Providing Proportional Jitter in  Differentiated Service Network "},{"volume":115,"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2020-08-24T11:36:55Z","author":[{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"}],"date_updated":"2022-01-06T06:53:26Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","title":"Zur Berechenbarkeit reeller geometrischer Probleme","related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20020101320"}]},"publication_identifier":{"isbn":["3-935433-24-7"]},"intvolume":"       115","citation":{"apa":"Ziegler, M. (2002). <i>Zur Berechenbarkeit reeller geometrischer Probleme</i> (Vol. 115). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","bibtex":"@book{Ziegler_2002, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Zur Berechenbarkeit reeller geometrischer Probleme}, volume={115}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Ziegler, Martin}, year={2002}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Ziegler, Martin. <i>Zur Berechenbarkeit reeller geometrischer Probleme</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.","short":"M. Ziegler, Zur Berechenbarkeit reeller geometrischer Probleme, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.","ieee":"M. Ziegler, <i>Zur Berechenbarkeit reeller geometrischer Probleme</i>, vol. 115. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.","chicago":"Ziegler, Martin. <i>Zur Berechenbarkeit reeller geometrischer Probleme</i>. Vol. 115. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.","ama":"Ziegler M. <i>Zur Berechenbarkeit reeller geometrischer Probleme</i>. Vol 115. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2002."},"year":"2002","department":[{"_id":"63"},{"_id":"26"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","_id":"18169","language":[{"iso":"ger"}],"type":"dissertation","status":"public","abstract":[{"text":"Die Implementierung von Algorithmen zur Lösung geometrischer Probleme im Euklidischen Raum (z.B. Berechnung der konvexen Hülle oder des Durchschnitts zweier Polyeder) stellt sich oftmals als hochgradig nichttrivial heraus. Ob und unter welchen Voraussetzungen die verursachenden numerischen Instabilitäten überhaupt ini den Griff zu kriegen oder vielmehr dem Problem inhärent sind, untersucht diese Arbeit in einem auf Turing zurückgehenden Rechenmodell. Im Gegensatz zu algebraischen Ansätzen geht jenes nicht von der Verfügbarkeit exakter Tests auf z.B. Gleichheit reeller Zahlen aus, sondern berücksichtigt die auf Digitalcomputern tatsächlich realisierbare Approximation durch rationale Zahlen. In diesem Rahmen werden beweisbar stabile Algorithmen zum Lösen linearer Gleichungssysteme, zur Matrix-Diagonalisierung und zur linearen wie nichtlinearen Optimierung präsentiert. Als wichtiges technisches Hilfsmittel dient ein neuer Berechenbarkeitsbegriff für reguläre unendliche Mengen reller Zahlen, der sich aus dem systematischen Vergleich verschiedener der Literatur entnommener ad-hoc Ansätze ergibt.","lang":"ger"},{"text":"Quite often, the implementation of well-known algorithms for solving geometric problems in Euclidean space (such as convex hull computation or intersecting two polyhedra) turns out to be a highly nontrivial task. Whether and under what prerequisites the underlying numerical numerical instabilities can be avoided or are rather inherent to the problem is investigated by the present work in a model of computation dating back to Alan Turing himself. Other than algebraic approaches, this does not rely on (volatile) exact tests for, e.g., equality of real numbers but reflects the property of actual digital computers to only approximate real numbers by rationals. In this framework, we devise and present provably stable algorithms for solving systems of linear equations, matrix diagonalization, and lineare as well as non-linear optimization. As major technical tool, a new notion of computability for regular infinite sets of real numbers is introduced that arises from formalizing and systematically comparing several ad-hoc notions found in previous literature.","lang":"eng"}]},{"publication":"Mathematical Logic Quarterly (MLQ)","type":"journal_article","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"18176","language":[{"iso":"eng"}],"issue":"S1","publication_identifier":{"issn":["0942-5616","1521-3870"]},"publication_status":"published","page":"157-181","intvolume":"        48","citation":{"ieee":"M. Ziegler, “Computability on Regular Subsets of Euclidean Space,” <i>Mathematical Logic Quarterly (MLQ)</i>, vol. 48, no. S1, pp. 157–181, 2002.","chicago":"Ziegler, Martin. “Computability on Regular Subsets of Euclidean Space.” <i>Mathematical Logic Quarterly (MLQ)</i> 48, no. S1 (2002): 157–81. <a href=\"https://doi.org/10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4\">https://doi.org/10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4</a>.","ama":"Ziegler M. Computability on Regular Subsets of Euclidean Space. <i>Mathematical Logic Quarterly (MLQ)</i>. 2002;48(S1):157-181. doi:<a href=\"https://doi.org/10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4\">10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4</a>","apa":"Ziegler, M. (2002). Computability on Regular Subsets of Euclidean Space. <i>Mathematical Logic Quarterly (MLQ)</i>, <i>48</i>(S1), 157–181. <a href=\"https://doi.org/10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4\">https://doi.org/10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4</a>","short":"M. Ziegler, Mathematical Logic Quarterly (MLQ) 48 (2002) 157–181.","bibtex":"@article{Ziegler_2002, title={Computability on Regular Subsets of Euclidean Space}, volume={48}, DOI={<a href=\"https://doi.org/10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4\">10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4</a>}, number={S1}, journal={Mathematical Logic Quarterly (MLQ)}, author={Ziegler, Martin}, year={2002}, pages={157–181} }","mla":"Ziegler, Martin. “Computability on Regular Subsets of Euclidean Space.” <i>Mathematical Logic Quarterly (MLQ)</i>, vol. 48, no. S1, 2002, pp. 157–81, doi:<a href=\"https://doi.org/10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4\">10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4</a>."},"year":"2002","volume":48,"date_created":"2020-08-24T12:05:40Z","author":[{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"}],"date_updated":"2022-01-06T06:53:26Z","doi":"10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4","title":"Computability on Regular Subsets of Euclidean Space"},{"language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"18177","status":"public","abstract":[{"lang":"eng","text":"Consider the classical point location problem: for a fixed arrangement of m hyperplanes and its induced partition of d-space report, upon input of some point, which face it lies in. With sufficient memory, this is easy to solve in logarithmic time O(log m). But how fast can algorithms (formalized as Linear Decision Trees) of *minimum* size be? The present work gives lower and upper bounds for the time complexity of point location under this constraint. They show that, in addition to m, the maximum number w of walls of a cell turns out to be a crucial parameter. We also consider a relaxation of the strict minimum-size condition allowing for constant factor overhead."}],"publication":"Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG'02)","type":"conference","title":"Point Location Algorithms of Minimum Size","date_created":"2020-08-24T12:09:15Z","author":[{"full_name":"Ziegler, Martin","last_name":"Ziegler","first_name":"Martin"},{"first_name":"Valentina","full_name":"Damerow, Valentina","last_name":"Damerow"},{"first_name":"Lukas","full_name":"Finschi, Lukas","last_name":"Finschi"}],"date_updated":"2022-01-06T06:53:26Z","citation":{"chicago":"Ziegler, Martin, Valentina Damerow, and Lukas Finschi. “Point Location Algorithms of Minimum Size.” In <i>Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02)</i>, 2002.","ieee":"M. Ziegler, V. Damerow, and L. Finschi, “Point Location Algorithms of Minimum Size,” in <i>Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02)</i>, 2002.","ama":"Ziegler M, Damerow V, Finschi L. Point Location Algorithms of Minimum Size. In: <i>Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02)</i>. ; 2002.","short":"M. Ziegler, V. Damerow, L. Finschi, in: Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02), 2002.","bibtex":"@inproceedings{Ziegler_Damerow_Finschi_2002, title={Point Location Algorithms of Minimum Size}, booktitle={Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02)}, author={Ziegler, Martin and Damerow, Valentina and Finschi, Lukas}, year={2002} }","mla":"Ziegler, Martin, et al. “Point Location Algorithms of Minimum Size.” <i>Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02)</i>, 2002.","apa":"Ziegler, M., Damerow, V., &#38; Finschi, L. (2002). Point Location Algorithms of Minimum Size. In <i>Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02)</i>."},"year":"2002","publication_status":"published"},{"date_updated":"2022-01-06T06:53:26Z","author":[{"first_name":"Vasco","full_name":"Brattka, Vasco","last_name":"Brattka"},{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"}],"date_created":"2020-08-24T12:11:07Z","title":"Computability of Linear Equations","doi":"10.1007/978-0-387-35608-2_9","publication_status":"published","year":"2002","place":"Boston, MA","page":"95-106","citation":{"ama":"Brattka V, Ziegler M. Computability of Linear Equations. In: <i>Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science</i>. Boston, MA; 2002:95-106. doi:<a href=\"https://doi.org/10.1007/978-0-387-35608-2_9\">10.1007/978-0-387-35608-2_9</a>","ieee":"V. Brattka and M. Ziegler, “Computability of Linear Equations,” in <i>Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science</i>, 2002, pp. 95–106.","chicago":"Brattka, Vasco, and Martin Ziegler. “Computability of Linear Equations.” In <i>Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science</i>, 95–106. Boston, MA, 2002. <a href=\"https://doi.org/10.1007/978-0-387-35608-2_9\">https://doi.org/10.1007/978-0-387-35608-2_9</a>.","apa":"Brattka, V., &#38; Ziegler, M. (2002). Computability of Linear Equations. In <i>Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science</i> (pp. 95–106). Boston, MA. <a href=\"https://doi.org/10.1007/978-0-387-35608-2_9\">https://doi.org/10.1007/978-0-387-35608-2_9</a>","short":"V. Brattka, M. Ziegler, in: Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, Boston, MA, 2002, pp. 95–106.","bibtex":"@inproceedings{Brattka_Ziegler_2002, place={Boston, MA}, title={Computability of Linear Equations}, DOI={<a href=\"https://doi.org/10.1007/978-0-387-35608-2_9\">10.1007/978-0-387-35608-2_9</a>}, booktitle={Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science}, author={Brattka, Vasco and Ziegler, Martin}, year={2002}, pages={95–106} }","mla":"Brattka, Vasco, and Martin Ziegler. “Computability of Linear Equations.” <i>Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science</i>, 2002, pp. 95–106, doi:<a href=\"https://doi.org/10.1007/978-0-387-35608-2_9\">10.1007/978-0-387-35608-2_9</a>."},"_id":"18179","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication":"Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science","type":"conference","abstract":[{"lang":"eng","text":"Do the solutions of linear equations depend computably on their coefficients? Implicitly, this has been one of the central questions in linear algebra since the very beginning of the subject and the famous Gauß algorithm is one of its numerical answers. Today there exists a tremendous number of algorithms which solve this problem for different types of linear equations. However, actual implementations in floating point arithmetic keep exhibiting numerical instabilities for ill-conditioned inputs. This situation raises the question which of these instabilities are intrinsic, thus caused by the very nature of the problem, and which are just side effects of specific algorithms. To approach this principle question we revisit linear equations from the rigorous point of view of computability. Therefore we apply methods of computable analysis, which is the Turing machine based theory of computable real number functions. It turns out that, given the coefficients of a system of linear equations, we can compute the space of solutions, if and only if the dimension of the solution space is known in advance. Especially, this explains why there cannot exist any stable algorithms under weaker assumptions."}],"status":"public"},{"_id":"18369","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication":"Simulation und Visualisierung","type":"conference","abstract":[{"lang":"eng","text":"Visualising is a method used to help experiencing and understanding causal cohesions in simulation processes. For this purpose, tools for visualising are already implemented in prevalent simulation systems. The user creates his simulation model and generates a 3-dimensional (2,5-dimensional) visualising by means of the simulation system. This helps examining the process which makes it easier for the viewer to “understand” it. Simulation tools usually only provide the opportunity for a unidirectional visualising. In a 3-dimensional surrounding the viewer can not implement an interaction with the simulation while the system is running. Though an interaction during the simulation run enables the user to gain a better understanding of causal cohesions. Solutions via HLA are sophisticated and therefore rather suited for extensive projects.\r\nWe present a distributed system consisting of a commercial manufacturing simulation tool, a coupling module and a walkthrough system. The distributed system in conjunctions with the coupling module guarantees generality and a wide field of applications of the walkthrough system. Further it guarantees flexibility and selection of the specialized graphics hardware for the walkthrough system. A further contribution of this paper is the solution of the time synchronisation problem caused by simulation tool and walkthrough system.\r\n"}],"status":"public","publisher":"SCS European Publishing House","date_updated":"2022-01-06T06:53:30Z","date_created":"2020-08-26T13:01:43Z","author":[{"first_name":"Bengt","last_name":"Mueck","full_name":"Mueck, Bengt"},{"last_name":"Dangelmaier","full_name":"Dangelmaier, Wilhelm","first_name":"Wilhelm"},{"id":"146","full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"},{"full_name":"Klemisch, Wolfram","last_name":"Klemisch","first_name":"Wolfram"}],"title":"Bi-directional Coupling of Simulation Tools with a Walkthrough-System","year":"2002","place":"Ghent, BE","page":"71-84","citation":{"apa":"Mueck, B., Dangelmaier, W., Fischer, M., &#38; Klemisch, W. (2002). Bi-directional Coupling of Simulation Tools with a Walkthrough-System. In <i>Simulation und Visualisierung</i> (pp. 71–84). Ghent, BE: SCS European Publishing House.","mla":"Mueck, Bengt, et al. “Bi-Directional Coupling of Simulation Tools with a Walkthrough-System.” <i>Simulation Und Visualisierung</i>, SCS European Publishing House, 2002, pp. 71–84.","bibtex":"@inproceedings{Mueck_Dangelmaier_Fischer_Klemisch_2002, place={Ghent, BE}, title={Bi-directional Coupling of Simulation Tools with a Walkthrough-System}, booktitle={Simulation und Visualisierung}, publisher={SCS European Publishing House}, author={Mueck, Bengt and Dangelmaier, Wilhelm and Fischer, Matthias and Klemisch, Wolfram}, year={2002}, pages={71–84} }","short":"B. Mueck, W. Dangelmaier, M. Fischer, W. Klemisch, in: Simulation Und Visualisierung, SCS European Publishing House, Ghent, BE, 2002, pp. 71–84.","ieee":"B. Mueck, W. Dangelmaier, M. Fischer, and W. Klemisch, “Bi-directional Coupling of Simulation Tools with a Walkthrough-System,” in <i>Simulation und Visualisierung</i>, 2002, pp. 71–84.","chicago":"Mueck, Bengt, Wilhelm Dangelmaier, Matthias Fischer, and Wolfram Klemisch. “Bi-Directional Coupling of Simulation Tools with a Walkthrough-System.” In <i>Simulation Und Visualisierung</i>, 71–84. Ghent, BE: SCS European Publishing House, 2002.","ama":"Mueck B, Dangelmaier W, Fischer M, Klemisch W. Bi-directional Coupling of Simulation Tools with a Walkthrough-System. In: <i>Simulation Und Visualisierung</i>. Ghent, BE: SCS European Publishing House; 2002:71-84."}},{"date_updated":"2022-01-06T06:53:40Z","author":[{"first_name":"Micah","full_name":"Adler, Micah","last_name":"Adler"},{"last_name":"Räcke","full_name":"Räcke, Harald","first_name":"Harald"},{"full_name":"Sivadasan, Naveen","last_name":"Sivadasan","first_name":"Naveen"},{"first_name":"Christian","full_name":"Sohler, Christian","last_name":"Sohler"},{"full_name":"Vöcking, Berthold","last_name":"Vöcking","first_name":"Berthold"}],"date_created":"2020-08-28T12:04:12Z","title":"Randomized Pursuit-Evasion in Graphs","doi":"10.1007/3-540-45465-9_77","publication_identifier":{"isbn":["9783540438649","9783540454656"],"issn":["0302-9743"]},"publication_status":"published","place":"Berlin, Heidelberg","year":"2002","citation":{"apa":"Adler, M., Räcke, H., Sivadasan, N., Sohler, C., &#38; Vöcking, B. (2002). Randomized Pursuit-Evasion in Graphs. In <i>Proceedings of the 29th International Colloquium on Automata, Languages and Programming</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45465-9_77\">https://doi.org/10.1007/3-540-45465-9_77</a>","bibtex":"@inproceedings{Adler_Räcke_Sivadasan_Sohler_Vöcking_2002, place={Berlin, Heidelberg}, title={Randomized Pursuit-Evasion in Graphs}, DOI={<a href=\"https://doi.org/10.1007/3-540-45465-9_77\">10.1007/3-540-45465-9_77</a>}, booktitle={Proceedings of the 29th International Colloquium on Automata, Languages and Programming}, author={Adler, Micah and Räcke, Harald and Sivadasan, Naveen and Sohler, Christian and Vöcking, Berthold}, year={2002} }","short":"M. Adler, H. Räcke, N. Sivadasan, C. Sohler, B. Vöcking, in: Proceedings of the 29th International Colloquium on Automata, Languages and Programming, Berlin, Heidelberg, 2002.","mla":"Adler, Micah, et al. “Randomized Pursuit-Evasion in Graphs.” <i>Proceedings of the 29th International Colloquium on Automata, Languages and Programming</i>, 2002, doi:<a href=\"https://doi.org/10.1007/3-540-45465-9_77\">10.1007/3-540-45465-9_77</a>.","ama":"Adler M, Räcke H, Sivadasan N, Sohler C, Vöcking B. Randomized Pursuit-Evasion in Graphs. In: <i>Proceedings of the 29th International Colloquium on Automata, Languages and Programming</i>. Berlin, Heidelberg; 2002. doi:<a href=\"https://doi.org/10.1007/3-540-45465-9_77\">10.1007/3-540-45465-9_77</a>","ieee":"M. Adler, H. Räcke, N. Sivadasan, C. Sohler, and B. Vöcking, “Randomized Pursuit-Evasion in Graphs,” in <i>Proceedings of the 29th International Colloquium on Automata, Languages and Programming</i>, 2002.","chicago":"Adler, Micah, Harald Räcke, Naveen Sivadasan, Christian Sohler, and Berthold Vöcking. “Randomized Pursuit-Evasion in Graphs.” In <i>Proceedings of the 29th International Colloquium on Automata, Languages and Programming</i>. Berlin, Heidelberg, 2002. <a href=\"https://doi.org/10.1007/3-540-45465-9_77\">https://doi.org/10.1007/3-540-45465-9_77</a>."},"_id":"18566","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication":"Proceedings of the 29th International Colloquium on Automata, Languages and Programming","type":"conference","abstract":[{"lang":"eng","text":"We analyze a randomized pursuit-evasion game on graphs. This game is played by two players, a hunter and a rabbit. Let G be any connected, undirected graph with n nodes. The game is played in rounds and in each round both the hunter and the rabbit are located at a node of the graph. Between rounds both the hunter and the rabbit can stay at the current node or move to another node. The hunter is assumed to be restricted to the graph G: in every round, the hunter can move using at most one edge. For the rabbit we investigate two models: in one model the rabbit is restricted to the same graph as the hunter, and in the other model the rabbit is unrestricted, i.e., it can jump to an arbitrary node in every round.\r\n\r\nWe say that the rabbit is caught as soon as hunter and rabbit are located at the same node in a round. The goal of the hunter is to catch the rabbit in as few rounds as possible, whereas the rabbit aims to maximize the number of rounds until it is caught. Given a randomized hunter strategy for G, the escape length for that strategy is the worst case expected number of rounds it takes the hunter to catch the rabbit, where the worst case is with regards to all (possibly randomized) rabbit strategies. Our main result is a hunter strategy for general graphs with an escape length of only O\r\n(n log (diam(G))) against restricted as well as unrestricted rabbits. This bound is close to optimal since Ω(n) is a trivial lower bound on the escape length in both models. Furthermore, we prove that our upper bound is optimal up to constant factors against unrestricted rabbits."}],"status":"public"},{"_id":"7785","series_title":"Electronic Notes in Theoretical Computer Science","user_id":"52534","department":[{"_id":"66"}],"language":[{"iso":"eng"}],"type":"conference_editor","editor":[{"last_name":"Heckel","full_name":"Heckel, Reiko","first_name":"Reiko"},{"first_name":"T.","last_name":"Mens","full_name":"Mens, T."},{"full_name":"Wermelinger, M.","last_name":"Wermelinger","first_name":"M."}],"status":"public","date_updated":"2022-01-06T07:03:46Z","publisher":"Elsevier","date_created":"2019-02-19T19:07:45Z","volume":72,"title":"Proceedings of the workshop on Software Evolution through Transformations, satellite of the ICGT 2002 conference, Barcelona (Spain)","issue":"4","year":"2002","citation":{"ieee":"R. Heckel, T. Mens, and M. Wermelinger, Eds., <i>Proceedings of the workshop on Software Evolution through Transformations, satellite of the ICGT 2002 conference, Barcelona (Spain)</i>, vol. 72, no. 4. Elsevier, 2002.","chicago":"Heckel, Reiko, T. Mens, and M. Wermelinger, eds. <i>Proceedings of the Workshop on Software Evolution through Transformations, Satellite of the ICGT 2002 Conference, Barcelona (Spain)</i>. Vol. 72. Electronic Notes in Theoretical Computer Science. Elsevier, 2002.","ama":"Heckel R, Mens T, Wermelinger M, eds. <i>Proceedings of the Workshop on Software Evolution through Transformations, Satellite of the ICGT 2002 Conference, Barcelona (Spain)</i>. Vol 72. Elsevier; 2002.","apa":"Heckel, R., Mens, T., &#38; Wermelinger, M. (Eds.). (2002). <i>Proceedings of the workshop on Software Evolution through Transformations, satellite of the ICGT 2002 conference, Barcelona (Spain)</i> (Vol. 72). Elsevier.","bibtex":"@book{Heckel_Mens_Wermelinger_2002, series={Electronic Notes in Theoretical Computer Science}, title={Proceedings of the workshop on Software Evolution through Transformations, satellite of the ICGT 2002 conference, Barcelona (Spain)}, volume={72}, number={4}, publisher={Elsevier}, year={2002}, collection={Electronic Notes in Theoretical Computer Science} }","mla":"Heckel, Reiko, et al., editors. <i>Proceedings of the Workshop on Software Evolution through Transformations, Satellite of the ICGT 2002 Conference, Barcelona (Spain)</i>. Vol. 72, no. 4, Elsevier, 2002.","short":"R. Heckel, T. Mens, M. Wermelinger, eds., Proceedings of the Workshop on Software Evolution through Transformations, Satellite of the ICGT 2002 Conference, Barcelona (Spain), Elsevier, 2002."},"intvolume":"        72"},{"title":"Proceedings of the 4th Young Researchers Workshop, satellite of the 4th International Symposium on Generative and Component-Based Engineering (GCSE '02), Pittsburgh, PA (USA)","date_updated":"2022-01-06T07:03:46Z","date_created":"2019-02-19T19:08:18Z","year":"2002","citation":{"ama":"Clauss M, Hanenberg S, John I, Mehner K, Van Der Straeten R, eds. <i>Proceedings of the 4th Young Researchers Workshop, Satellite of the 4th International Symposium on Generative and Component-Based Engineering (GCSE ’02), Pittsburgh, PA (USA)</i>.; 2002.","chicago":"Clauss, M., S. Hanenberg, I. John, Katharina Mehner, and Ragnhild Van Der Straeten, eds. <i>Proceedings of the 4th Young Researchers Workshop, Satellite of the 4th International Symposium on Generative and Component-Based Engineering (GCSE ’02), Pittsburgh, PA (USA)</i>. IESE-Report, 2002.","ieee":"M. Clauss, S. Hanenberg, I. John, K. Mehner, and R. Van Der Straeten, Eds., <i>Proceedings of the 4th Young Researchers Workshop, satellite of the 4th International Symposium on Generative and Component-Based Engineering (GCSE ’02), Pittsburgh, PA (USA)</i>, no. 053.02/E. 2002.","short":"M. Clauss, S. Hanenberg, I. John, K. Mehner, R. Van Der Straeten, eds., Proceedings of the 4th Young Researchers Workshop, Satellite of the 4th International Symposium on Generative and Component-Based Engineering (GCSE ’02), Pittsburgh, PA (USA), 2002.","bibtex":"@book{Clauss_Hanenberg_John_Mehner_Van Der Straeten_2002, series={IESE-Report}, title={Proceedings of the 4th Young Researchers Workshop, satellite of the 4th International Symposium on Generative and Component-Based Engineering (GCSE ’02), Pittsburgh, PA (USA)}, number={053.02/E}, year={2002}, collection={IESE-Report} }","mla":"Clauss, M., et al., editors. <i>Proceedings of the 4th Young Researchers Workshop, Satellite of the 4th International Symposium on Generative and Component-Based Engineering (GCSE ’02), Pittsburgh, PA (USA)</i>. no. 053.02/E, 2002.","apa":"Clauss, M., Hanenberg, S., John, I., Mehner, K., &#38; Van Der Straeten, R. (Eds.). (2002). <i>Proceedings of the 4th Young Researchers Workshop, satellite of the 4th International Symposium on Generative and Component-Based Engineering (GCSE ’02), Pittsburgh, PA (USA)</i>."},"issue":"053.02/E","language":[{"iso":"eng"}],"_id":"7786","department":[{"_id":"66"}],"user_id":"52534","series_title":"IESE-Report","editor":[{"full_name":"Clauss, M.","last_name":"Clauss","first_name":"M."},{"last_name":"Hanenberg","full_name":"Hanenberg, S.","first_name":"S."},{"last_name":"John","full_name":"John, I.","first_name":"I."},{"first_name":"Katharina","full_name":"Mehner, Katharina","last_name":"Mehner"},{"full_name":"Van Der Straeten, Ragnhild","last_name":"Van Der Straeten","first_name":"Ragnhild"}],"status":"public","type":"conference_editor"},{"type":"conference","publication":"Proceedings of the 1st International Conference on Graph Transformation (ICGT 2002), Barcelona (Spain)","status":"public","series_title":"LNCS","user_id":"52534","department":[{"_id":"66"}],"_id":"7895","language":[{"iso":"eng"}],"citation":{"ieee":"L. Baresi and R. Heckel, “Tutorial Introduction to Graph Transformation: A Software Engineering Perspective,” in <i>Proceedings of the 1st International Conference on Graph Transformation (ICGT 2002), Barcelona (Spain)</i>, 2002, vol. 2505, pp. 402–429.","chicago":"Baresi, Luciano, and Reiko Heckel. “Tutorial Introduction to Graph Transformation: A Software Engineering Perspective.” In <i>Proceedings of the 1st International Conference on Graph Transformation (ICGT 2002), Barcelona (Spain)</i>, 2505:402–29. LNCS. Berlin/Heidelberg: Springer, 2002. <a href=\"https://groups.uni-paderborn.de/fg-engels/Publications/10.1007/b100934\">https://groups.uni-paderborn.de/fg-engels/Publications/10.1007/b100934</a>.","ama":"Baresi L, Heckel R. Tutorial Introduction to Graph Transformation: A Software Engineering Perspective. In: <i>Proceedings of the 1st International Conference on Graph Transformation (ICGT 2002), Barcelona (Spain)</i>. Vol 2505. LNCS. Berlin/Heidelberg: Springer; 2002:402-429. doi:<a href=\"https://groups.uni-paderborn.de/fg-engels/Publications/10.1007/b100934\">https://groups.uni-paderborn.de/fg-engels/Publications/10.1007/b100934</a>","bibtex":"@inproceedings{Baresi_Heckel_2002, place={Berlin/Heidelberg}, series={LNCS}, title={Tutorial Introduction to Graph Transformation: A Software Engineering Perspective}, volume={2505}, DOI={<a href=\"https://groups.uni-paderborn.de/fg-engels/Publications/10.1007/b100934\">https://groups.uni-paderborn.de/fg-engels/Publications/10.1007/b100934</a>}, booktitle={Proceedings of the 1st International Conference on Graph Transformation (ICGT 2002), Barcelona (Spain)}, publisher={Springer}, author={Baresi, Luciano and Heckel, Reiko}, year={2002}, pages={402–429}, collection={LNCS} }","short":"L. Baresi, R. Heckel, in: Proceedings of the 1st International Conference on Graph Transformation (ICGT 2002), Barcelona (Spain), Springer, Berlin/Heidelberg, 2002, pp. 402–429.","mla":"Baresi, Luciano, and Reiko Heckel. “Tutorial Introduction to Graph Transformation: A Software Engineering Perspective.” <i>Proceedings of the 1st International Conference on Graph Transformation (ICGT 2002), Barcelona (Spain)</i>, vol. 2505, Springer, 2002, pp. 402–29, doi:<a href=\"https://groups.uni-paderborn.de/fg-engels/Publications/10.1007/b100934\">https://groups.uni-paderborn.de/fg-engels/Publications/10.1007/b100934</a>.","apa":"Baresi, L., &#38; Heckel, R. (2002). Tutorial Introduction to Graph Transformation: A Software Engineering Perspective. In <i>Proceedings of the 1st International Conference on Graph Transformation (ICGT 2002), Barcelona (Spain)</i> (Vol. 2505, pp. 402–429). Berlin/Heidelberg: Springer. <a href=\"https://groups.uni-paderborn.de/fg-engels/Publications/10.1007/b100934\">https://groups.uni-paderborn.de/fg-engels/Publications/10.1007/b100934</a>"},"intvolume":"      2505","page":"402-429","year":"2002","place":"Berlin/Heidelberg","date_created":"2019-02-21T10:55:19Z","author":[{"first_name":"Luciano","full_name":"Baresi, Luciano","last_name":"Baresi"},{"last_name":"Heckel","full_name":"Heckel, Reiko","first_name":"Reiko"}],"volume":2505,"publisher":"Springer","date_updated":"2022-01-06T07:03:47Z","doi":"https://groups.uni-paderborn.de/fg-engels/Publications/10.1007/b100934","title":"Tutorial Introduction to Graph Transformation: A Software Engineering Perspective"},{"citation":{"ieee":"R. Depke, G. Engels, M. Langham, B. Lütkemeier, and S. Thöne, “Process-Oriented, Consistent Integration of Software Components,” in <i>Proceedings of the conference on Prolonging Software Life: Development and Redevelopment (COMPSAC 2002), Oxford (England)</i>, 2002, pp. 13–18.","chicago":"Depke, Ralph, Gregor Engels, Matthew Langham, Björn Lütkemeier, and Sebastian Thöne. “Process-Oriented, Consistent Integration of Software Components.” In <i>Proceedings of the Conference on Prolonging Software Life: Development and Redevelopment (COMPSAC 2002), Oxford (England)</i>, 13–18. Washington, DC, USA: IEEE Computer Society, 2002. <a href=\"http://dx.doi.org/10.1109/CMPSAC.2002.1044527\">http://dx.doi.org/10.1109/CMPSAC.2002.1044527</a>.","ama":"Depke R, Engels G, Langham M, Lütkemeier B, Thöne S. Process-Oriented, Consistent Integration of Software Components. In: <i>Proceedings of the Conference on Prolonging Software Life: Development and Redevelopment (COMPSAC 2002), Oxford (England)</i>. Washington, DC, USA: IEEE Computer Society; 2002:13-18. doi:<a href=\"http://dx.doi.org/10.1109/CMPSAC.2002.1044527\">http://dx.doi.org/10.1109/CMPSAC.2002.1044527</a>","apa":"Depke, R., Engels, G., Langham, M., Lütkemeier, B., &#38; Thöne, S. (2002). Process-Oriented, Consistent Integration of Software Components. In <i>Proceedings of the conference on Prolonging Software Life: Development and Redevelopment (COMPSAC 2002), Oxford (England)</i> (pp. 13–18). Washington, DC, USA: IEEE Computer Society. <a href=\"http://dx.doi.org/10.1109/CMPSAC.2002.1044527\">http://dx.doi.org/10.1109/CMPSAC.2002.1044527</a>","bibtex":"@inproceedings{Depke_Engels_Langham_Lütkemeier_Thöne_2002, place={Washington, DC, USA}, title={Process-Oriented, Consistent Integration of Software Components}, DOI={<a href=\"http://dx.doi.org/10.1109/CMPSAC.2002.1044527\">http://dx.doi.org/10.1109/CMPSAC.2002.1044527</a>}, booktitle={Proceedings of the conference on Prolonging Software Life: Development and Redevelopment (COMPSAC 2002), Oxford (England)}, publisher={IEEE Computer Society}, author={Depke, Ralph and Engels, Gregor and Langham, Matthew and Lütkemeier, Björn and Thöne, Sebastian}, year={2002}, pages={13–18} }","short":"R. Depke, G. Engels, M. Langham, B. Lütkemeier, S. Thöne, in: Proceedings of the Conference on Prolonging Software Life: Development and Redevelopment (COMPSAC 2002), Oxford (England), IEEE Computer Society, Washington, DC, USA, 2002, pp. 13–18.","mla":"Depke, Ralph, et al. “Process-Oriented, Consistent Integration of Software Components.” <i>Proceedings of the Conference on Prolonging Software Life: Development and Redevelopment (COMPSAC 2002), Oxford (England)</i>, IEEE Computer Society, 2002, pp. 13–18, doi:<a href=\"http://dx.doi.org/10.1109/CMPSAC.2002.1044527\">http://dx.doi.org/10.1109/CMPSAC.2002.1044527</a>."},"page":"13-18","place":"Washington, DC, USA","year":"2002","date_created":"2019-02-21T10:55:46Z","author":[{"first_name":"Ralph","last_name":"Depke","full_name":"Depke, Ralph"},{"first_name":"Gregor","id":"107","full_name":"Engels, Gregor","last_name":"Engels"},{"first_name":"Matthew","full_name":"Langham, Matthew","last_name":"Langham"},{"first_name":"Björn","last_name":"Lütkemeier","full_name":"Lütkemeier, Björn"},{"first_name":"Sebastian","last_name":"Thöne","full_name":"Thöne, Sebastian"}],"publisher":"IEEE Computer Society","date_updated":"2022-01-06T07:03:47Z","doi":"http://dx.doi.org/10.1109/CMPSAC.2002.1044527","title":"Process-Oriented, Consistent Integration of Software Components","type":"conference","publication":"Proceedings of the conference on Prolonging Software Life: Development and Redevelopment (COMPSAC 2002), Oxford (England)","status":"public","user_id":"52534","department":[{"_id":"66"}],"_id":"7896","language":[{"iso":"eng"}]},{"type":"conference","publication":"Proceedings of the 5th International Conference on The Unified Modeling Language (UML 2002), Dresden (Germany)","status":"public","series_title":"LNCS","user_id":"52534","department":[{"_id":"66"}],"_id":"7897","language":[{"iso":"eng"}],"citation":{"ieee":"G. Engels, R. Heckel, J. Küster, and L. Groenewegen, “Consistency-Preserving Model Evolution through Transformations,” in <i>Proceedings of the 5th International Conference on The Unified Modeling Language (UML 2002), Dresden (Germany)</i>, 2002, vol. 2460, pp. 212–226.","chicago":"Engels, Gregor, Reiko Heckel, Jochen Küster, and Luuk Groenewegen. “Consistency-Preserving Model Evolution through Transformations.” In <i>Proceedings of the 5th International Conference on The Unified Modeling Language (UML 2002), Dresden (Germany)</i>, 2460:212–26. LNCS. Berlin/Heidelberg: Springer, 2002.","ama":"Engels G, Heckel R, Küster J, Groenewegen L. Consistency-Preserving Model Evolution through Transformations. In: <i>Proceedings of the 5th International Conference on The Unified Modeling Language (UML 2002), Dresden (Germany)</i>. Vol 2460. LNCS. Berlin/Heidelberg: Springer; 2002:212-226.","apa":"Engels, G., Heckel, R., Küster, J., &#38; Groenewegen, L. (2002). Consistency-Preserving Model Evolution through Transformations. In <i>Proceedings of the 5th International Conference on The Unified Modeling Language (UML 2002), Dresden (Germany)</i> (Vol. 2460, pp. 212–226). Berlin/Heidelberg: Springer.","bibtex":"@inproceedings{Engels_Heckel_Küster_Groenewegen_2002, place={Berlin/Heidelberg}, series={LNCS}, title={Consistency-Preserving Model Evolution through Transformations}, volume={2460}, booktitle={Proceedings of the 5th International Conference on The Unified Modeling Language (UML 2002), Dresden (Germany)}, publisher={Springer}, author={Engels, Gregor and Heckel, Reiko and Küster, Jochen and Groenewegen, Luuk}, year={2002}, pages={212–226}, collection={LNCS} }","mla":"Engels, Gregor, et al. “Consistency-Preserving Model Evolution through Transformations.” <i>Proceedings of the 5th International Conference on The Unified Modeling Language (UML 2002), Dresden (Germany)</i>, vol. 2460, Springer, 2002, pp. 212–26.","short":"G. Engels, R. Heckel, J. Küster, L. Groenewegen, in: Proceedings of the 5th International Conference on The Unified Modeling Language (UML 2002), Dresden (Germany), Springer, Berlin/Heidelberg, 2002, pp. 212–226."},"intvolume":"      2460","page":"212-226","year":"2002","place":"Berlin/Heidelberg","date_created":"2019-02-21T10:56:48Z","author":[{"last_name":"Engels","full_name":"Engels, Gregor","id":"107","first_name":"Gregor"},{"full_name":"Heckel, Reiko","last_name":"Heckel","first_name":"Reiko"},{"last_name":"Küster","full_name":"Küster, Jochen","first_name":"Jochen"},{"first_name":"Luuk","last_name":"Groenewegen","full_name":"Groenewegen, Luuk"}],"volume":2460,"date_updated":"2022-01-06T07:03:47Z","publisher":"Springer","title":"Consistency-Preserving Model Evolution through Transformations"},{"title":"Consistent Interaction Of Software Components","date_created":"2019-02-21T10:57:29Z","author":[{"last_name":"Engels","id":"107","full_name":"Engels, Gregor","first_name":"Gregor"},{"first_name":"Jochen","last_name":"Küster","full_name":"Küster, Jochen"},{"first_name":"Luuk","full_name":"Groenewegen, Luuk","last_name":"Groenewegen"}],"volume":6,"publisher":"IOS Press","date_updated":"2022-01-06T07:03:47Z","citation":{"bibtex":"@inproceedings{Engels_Küster_Groenewegen_2002, title={Consistent Interaction Of Software Components}, volume={6}, number={4}, booktitle={Proceedings of the conference on Integrated Design and Process Technology (IDPT 2002), Pasadena, CA (USA)}, publisher={IOS Press}, author={Engels, Gregor and Küster, Jochen and Groenewegen, Luuk}, year={2002}, pages={2–22} }","mla":"Engels, Gregor, et al. “Consistent Interaction Of Software Components.” <i>Proceedings of the Conference on Integrated Design and Process Technology (IDPT 2002), Pasadena, CA (USA)</i>, vol. 6, no. 4, IOS Press, 2002, pp. 2–22.","short":"G. Engels, J. Küster, L. Groenewegen, in: Proceedings of the Conference on Integrated Design and Process Technology (IDPT 2002), Pasadena, CA (USA), IOS Press, 2002, pp. 2–22.","apa":"Engels, G., Küster, J., &#38; Groenewegen, L. (2002). Consistent Interaction Of Software Components. In <i>Proceedings of the conference on Integrated Design and Process Technology (IDPT 2002), Pasadena, CA (USA)</i> (Vol. 6, pp. 2–22). IOS Press.","ieee":"G. Engels, J. Küster, and L. Groenewegen, “Consistent Interaction Of Software Components,” in <i>Proceedings of the conference on Integrated Design and Process Technology (IDPT 2002), Pasadena, CA (USA)</i>, 2002, vol. 6, no. 4, pp. 2–22.","chicago":"Engels, Gregor, Jochen Küster, and Luuk Groenewegen. “Consistent Interaction Of Software Components.” In <i>Proceedings of the Conference on Integrated Design and Process Technology (IDPT 2002), Pasadena, CA (USA)</i>, 6:2–22. IOS Press, 2002.","ama":"Engels G, Küster J, Groenewegen L. Consistent Interaction Of Software Components. In: <i>Proceedings of the Conference on Integrated Design and Process Technology (IDPT 2002), Pasadena, CA (USA)</i>. Vol 6. IOS Press; 2002:2-22."},"intvolume":"         6","page":"2-22","year":"2002","issue":"4","language":[{"iso":"eng"}],"user_id":"52534","department":[{"_id":"66"}],"_id":"7898","status":"public","type":"conference","publication":"Proceedings of the conference on Integrated Design and Process Technology (IDPT 2002), Pasadena, CA (USA)"},{"language":[{"iso":"eng"}],"user_id":"52534","department":[{"_id":"66"}],"_id":"7899","status":"public","type":"conference","publication":"Proceedings of the Sixth International Conference on Integrated Design and Process Technology (IDPT 2002), Pasadena, CA (USA)","title":"Testing the Consistency of Dynamic UML Diagrams","date_created":"2019-02-21T10:58:02Z","author":[{"id":"107","full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"},{"first_name":"Jan","full_name":"Hendrik Hausmann, Jan","last_name":"Hendrik Hausmann"},{"first_name":"Reiko","last_name":"Heckel","full_name":"Heckel, Reiko"},{"last_name":"Sauer","id":"447","full_name":"Sauer, Stefan","first_name":"Stefan"}],"date_updated":"2022-01-06T07:03:47Z","citation":{"ieee":"G. Engels, J. Hendrik Hausmann, R. Heckel, and S. Sauer, “Testing the Consistency of Dynamic UML Diagrams,” in <i>Proceedings of the Sixth International Conference on Integrated Design and Process Technology (IDPT 2002), Pasadena, CA (USA)</i>, 2002.","chicago":"Engels, Gregor, Jan Hendrik Hausmann, Reiko Heckel, and Stefan Sauer. “Testing the Consistency of Dynamic UML Diagrams.” In <i>Proceedings of the Sixth International Conference on Integrated Design and Process Technology (IDPT 2002), Pasadena, CA (USA)</i>, 2002.","ama":"Engels G, Hendrik Hausmann J, Heckel R, Sauer S. Testing the Consistency of Dynamic UML Diagrams. In: <i>Proceedings of the Sixth International Conference on Integrated Design and Process Technology (IDPT 2002), Pasadena, CA (USA)</i>. ; 2002.","bibtex":"@inproceedings{Engels_Hendrik Hausmann_Heckel_Sauer_2002, title={Testing the Consistency of Dynamic UML Diagrams}, booktitle={Proceedings of the Sixth International Conference on Integrated Design and Process Technology (IDPT 2002), Pasadena, CA (USA)}, author={Engels, Gregor and Hendrik Hausmann, Jan and Heckel, Reiko and Sauer, Stefan}, year={2002} }","short":"G. Engels, J. Hendrik Hausmann, R. Heckel, S. Sauer, in: Proceedings of the Sixth International Conference on Integrated Design and Process Technology (IDPT 2002), Pasadena, CA (USA), 2002.","mla":"Engels, Gregor, et al. “Testing the Consistency of Dynamic UML Diagrams.” <i>Proceedings of the Sixth International Conference on Integrated Design and Process Technology (IDPT 2002), Pasadena, CA (USA)</i>, 2002.","apa":"Engels, G., Hendrik Hausmann, J., Heckel, R., &#38; Sauer, S. (2002). Testing the Consistency of Dynamic UML Diagrams. In <i>Proceedings of the Sixth International Conference on Integrated Design and Process Technology (IDPT 2002), Pasadena, CA (USA)</i>."},"year":"2002"},{"date_updated":"2022-01-06T07:03:47Z","publisher":"Springer","volume":2505,"author":[{"last_name":"Gyapay","full_name":"Gyapay, Szilvia","first_name":"Szilvia"},{"first_name":"Reiko","full_name":"Heckel, Reiko","last_name":"Heckel"},{"full_name":"Varró, Dániel","last_name":"Varró","first_name":"Dániel"}],"date_created":"2019-02-21T10:58:36Z","title":"Graph Transformation with Time: Causality and Logical Clocks","year":"2002","place":"Berlin/Heidelberg","page":"120-134","intvolume":"      2505","citation":{"ama":"Gyapay S, Heckel R, Varró D. Graph Transformation with Time: Causality and Logical Clocks. In: <i>Proceedings of the First International Conference on Graph Transformation (ICGT 2002), Barcelona (Spain)</i>. Vol 2505. LNCS. Berlin/Heidelberg: Springer; 2002:120-134.","ieee":"S. Gyapay, R. Heckel, and D. Varró, “Graph Transformation with Time: Causality and Logical Clocks,” in <i>Proceedings of the First International Conference on Graph Transformation (ICGT 2002), Barcelona (Spain)</i>, 2002, vol. 2505, pp. 120–134.","chicago":"Gyapay, Szilvia, Reiko Heckel, and Dániel Varró. “Graph Transformation with Time: Causality and Logical Clocks.” In <i>Proceedings of the First International Conference on Graph Transformation (ICGT 2002), Barcelona (Spain)</i>, 2505:120–34. LNCS. Berlin/Heidelberg: Springer, 2002.","apa":"Gyapay, S., Heckel, R., &#38; Varró, D. (2002). Graph Transformation with Time: Causality and Logical Clocks. In <i>Proceedings of the First International Conference on Graph Transformation (ICGT 2002), Barcelona (Spain)</i> (Vol. 2505, pp. 120–134). Berlin/Heidelberg: Springer.","mla":"Gyapay, Szilvia, et al. “Graph Transformation with Time: Causality and Logical Clocks.” <i>Proceedings of the First International Conference on Graph Transformation (ICGT 2002), Barcelona (Spain)</i>, vol. 2505, Springer, 2002, pp. 120–34.","bibtex":"@inproceedings{Gyapay_Heckel_Varró_2002, place={Berlin/Heidelberg}, series={LNCS}, title={Graph Transformation with Time: Causality and Logical Clocks}, volume={2505}, booktitle={Proceedings of the First International Conference on Graph Transformation (ICGT 2002), Barcelona (Spain)}, publisher={Springer}, author={Gyapay, Szilvia and Heckel, Reiko and Varró, Dániel}, year={2002}, pages={120–134}, collection={LNCS} }","short":"S. Gyapay, R. Heckel, D. Varró, in: Proceedings of the First International Conference on Graph Transformation (ICGT 2002), Barcelona (Spain), Springer, Berlin/Heidelberg, 2002, pp. 120–134."},"_id":"7900","department":[{"_id":"66"}],"user_id":"52534","series_title":"LNCS","language":[{"iso":"eng"}],"publication":"Proceedings of the First International Conference on Graph Transformation (ICGT 2002), Barcelona (Spain)","type":"conference","status":"public"},{"page":"105-155 ","citation":{"short":"J. Hendrik Hausmann, R. Heckel, G. Taentzer, in: Proceedings of the 24th International Conference on Software Engineering (ICSE 2002), Orlando, FL (USA), ACM Press, New York, NY, USA, 2002, pp. 105–155.","mla":"Hendrik Hausmann, Jan, et al. “Detecting Conflicting Functional Requirements in a Use Case Driven Approach: A Static Analysis Technique Based on Graph Transformation.” <i>Proceedings of the 24th International Conference on Software Engineering (ICSE 2002), Orlando, FL (USA)</i>, ACM Press, 2002, pp. 105–55, doi:<a href=\"http://doi.acm.org/10.1145/581339.581355\">http://doi.acm.org/10.1145/581339.581355</a>.","bibtex":"@inproceedings{Hendrik Hausmann_Heckel_Taentzer_2002, place={New York, NY, USA}, title={Detecting conflicting functional requirements in a use case driven approach: A static analysis technique based on graph transformation}, DOI={<a href=\"http://doi.acm.org/10.1145/581339.581355\">http://doi.acm.org/10.1145/581339.581355</a>}, booktitle={Proceedings of the 24th International Conference on Software Engineering (ICSE 2002), Orlando, FL (USA)}, publisher={ACM Press}, author={Hendrik Hausmann, Jan and Heckel, Reiko and Taentzer, Gabriele}, year={2002}, pages={105–155} }","apa":"Hendrik Hausmann, J., Heckel, R., &#38; Taentzer, G. (2002). Detecting conflicting functional requirements in a use case driven approach: A static analysis technique based on graph transformation. In <i>Proceedings of the 24th International Conference on Software Engineering (ICSE 2002), Orlando, FL (USA)</i> (pp. 105–155). New York, NY, USA: ACM Press. <a href=\"http://doi.acm.org/10.1145/581339.581355\">http://doi.acm.org/10.1145/581339.581355</a>","chicago":"Hendrik Hausmann, Jan, Reiko Heckel, and Gabriele Taentzer. “Detecting Conflicting Functional Requirements in a Use Case Driven Approach: A Static Analysis Technique Based on Graph Transformation.” In <i>Proceedings of the 24th International Conference on Software Engineering (ICSE 2002), Orlando, FL (USA)</i>, 105–55. New York, NY, USA: ACM Press, 2002. <a href=\"http://doi.acm.org/10.1145/581339.581355\">http://doi.acm.org/10.1145/581339.581355</a>.","ieee":"J. Hendrik Hausmann, R. Heckel, and G. Taentzer, “Detecting conflicting functional requirements in a use case driven approach: A static analysis technique based on graph transformation,” in <i>Proceedings of the 24th International Conference on Software Engineering (ICSE 2002), Orlando, FL (USA)</i>, 2002, pp. 105–155.","ama":"Hendrik Hausmann J, Heckel R, Taentzer G. Detecting conflicting functional requirements in a use case driven approach: A static analysis technique based on graph transformation. In: <i>Proceedings of the 24th International Conference on Software Engineering (ICSE 2002), Orlando, FL (USA)</i>. New York, NY, USA: ACM Press; 2002:105-155. doi:<a href=\"http://doi.acm.org/10.1145/581339.581355\">http://doi.acm.org/10.1145/581339.581355</a>"},"place":"New York, NY, USA","year":"2002","author":[{"first_name":"Jan","full_name":"Hendrik Hausmann, Jan","last_name":"Hendrik Hausmann"},{"full_name":"Heckel, Reiko","last_name":"Heckel","first_name":"Reiko"},{"first_name":"Gabriele","last_name":"Taentzer","full_name":"Taentzer, Gabriele"}],"date_created":"2019-02-21T10:59:09Z","publisher":"ACM Press","date_updated":"2022-01-06T07:03:47Z","doi":"http://doi.acm.org/10.1145/581339.581355","title":"Detecting conflicting functional requirements in a use case driven approach: A static analysis technique based on graph transformation","publication":"Proceedings of the 24th International Conference on Software Engineering (ICSE 2002), Orlando, FL (USA)","type":"conference","status":"public","department":[{"_id":"66"}],"user_id":"52534","_id":"7901","language":[{"iso":"eng"}]},{"department":[{"_id":"66"}],"user_id":"52534","_id":"7902","language":[{"iso":"eng"}],"publication":"Proceedings of the conference on Integrated Design & Process Technology (IDPT 2002), Pasadena, CA (USA)","type":"conference","status":"public","author":[{"first_name":"Reiko","last_name":"Heckel","full_name":"Heckel, Reiko"},{"last_name":"Chouikha","full_name":"Chouikha, Mourad","first_name":"Mourad"}],"date_created":"2019-02-21T10:59:49Z","publisher":"Society of Design and Process Science","date_updated":"2022-01-06T07:03:47Z","title":"Compositional Control Synthesis for Discrete Event Systems: An Approach based on Open Petri Nets","page":"63-77","citation":{"ieee":"R. Heckel and M. Chouikha, “Compositional Control Synthesis for Discrete Event Systems: An Approach based on Open Petri Nets,” in <i>Proceedings of the conference on Integrated Design &#38; Process Technology (IDPT 2002), Pasadena, CA (USA)</i>, 2002, pp. 63–77.","chicago":"Heckel, Reiko, and Mourad Chouikha. “Compositional Control Synthesis for Discrete Event Systems: An Approach Based on Open Petri Nets.” In <i>Proceedings of the Conference on Integrated Design &#38; Process Technology (IDPT 2002), Pasadena, CA (USA)</i>, 63–77. Grandview, TX, USA: Society of Design and Process Science, 2002.","ama":"Heckel R, Chouikha M. Compositional Control Synthesis for Discrete Event Systems: An Approach based on Open Petri Nets. In: <i>Proceedings of the Conference on Integrated Design &#38; Process Technology (IDPT 2002), Pasadena, CA (USA)</i>. Grandview, TX, USA: Society of Design and Process Science; 2002:63-77.","bibtex":"@inproceedings{Heckel_Chouikha_2002, place={Grandview, TX, USA}, title={Compositional Control Synthesis for Discrete Event Systems: An Approach based on Open Petri Nets}, booktitle={Proceedings of the conference on Integrated Design &#38; Process Technology (IDPT 2002), Pasadena, CA (USA)}, publisher={Society of Design and Process Science}, author={Heckel, Reiko and Chouikha, Mourad}, year={2002}, pages={63–77} }","short":"R. Heckel, M. Chouikha, in: Proceedings of the Conference on Integrated Design &#38; Process Technology (IDPT 2002), Pasadena, CA (USA), Society of Design and Process Science, Grandview, TX, USA, 2002, pp. 63–77.","mla":"Heckel, Reiko, and Mourad Chouikha. “Compositional Control Synthesis for Discrete Event Systems: An Approach Based on Open Petri Nets.” <i>Proceedings of the Conference on Integrated Design &#38; Process Technology (IDPT 2002), Pasadena, CA (USA)</i>, Society of Design and Process Science, 2002, pp. 63–77.","apa":"Heckel, R., &#38; Chouikha, M. (2002). Compositional Control Synthesis for Discrete Event Systems: An Approach based on Open Petri Nets. In <i>Proceedings of the conference on Integrated Design &#38; Process Technology (IDPT 2002), Pasadena, CA (USA)</i> (pp. 63–77). Grandview, TX, USA: Society of Design and Process Science."},"place":"Grandview, TX, USA","year":"2002"},{"language":[{"iso":"eng"}],"_id":"7903","department":[{"_id":"66"}],"user_id":"52534","status":"public","publication":"Proceedings of the First International Conference on Graph Transformation (ICGT 2002), Barcelona (Spain)","type":"conference","title":"Confluence of Typed Attributed Graph Transformation Systems","publisher":"Springer","date_updated":"2022-01-06T07:03:47Z","author":[{"full_name":"Heckel, Reiko","last_name":"Heckel","first_name":"Reiko"},{"full_name":"Küster, Jochen","last_name":"Küster","first_name":"Jochen"},{"last_name":"Taentzer","full_name":"Taentzer, Gabriele","first_name":"Gabriele"}],"date_created":"2019-02-21T11:00:30Z","place":"Berlin/Heidelberg","year":"2002","page":"161-176","citation":{"apa":"Heckel, R., Küster, J., &#38; Taentzer, G. (2002). Confluence of Typed Attributed Graph Transformation Systems. In <i>Proceedings of the First International Conference on Graph Transformation (ICGT 2002), Barcelona (Spain)</i> (pp. 161–176). Berlin/Heidelberg: Springer.","bibtex":"@inproceedings{Heckel_Küster_Taentzer_2002, place={Berlin/Heidelberg}, title={Confluence of Typed Attributed Graph Transformation Systems}, booktitle={Proceedings of the First International Conference on Graph Transformation (ICGT 2002), Barcelona (Spain)}, publisher={Springer}, author={Heckel, Reiko and Küster, Jochen and Taentzer, Gabriele}, year={2002}, pages={161–176} }","mla":"Heckel, Reiko, et al. “Confluence of Typed Attributed Graph Transformation Systems.” <i>Proceedings of the First International Conference on Graph Transformation (ICGT 2002), Barcelona (Spain)</i>, Springer, 2002, pp. 161–76.","short":"R. Heckel, J. Küster, G. Taentzer, in: Proceedings of the First International Conference on Graph Transformation (ICGT 2002), Barcelona (Spain), Springer, Berlin/Heidelberg, 2002, pp. 161–176.","ama":"Heckel R, Küster J, Taentzer G. Confluence of Typed Attributed Graph Transformation Systems. In: <i>Proceedings of the First International Conference on Graph Transformation (ICGT 2002), Barcelona (Spain)</i>. Berlin/Heidelberg: Springer; 2002:161-176.","chicago":"Heckel, Reiko, Jochen Küster, and Gabriele Taentzer. “Confluence of Typed Attributed Graph Transformation Systems.” In <i>Proceedings of the First International Conference on Graph Transformation (ICGT 2002), Barcelona (Spain)</i>, 161–76. Berlin/Heidelberg: Springer, 2002.","ieee":"R. Heckel, J. Küster, and G. Taentzer, “Confluence of Typed Attributed Graph Transformation Systems,” in <i>Proceedings of the First International Conference on Graph Transformation (ICGT 2002), Barcelona (Spain)</i>, 2002, pp. 161–176."}},{"intvolume":"      2269","page":"163-175","citation":{"chicago":"Mehner, Katharina. “JaVis: A UML-Based Visualization and Debugging Environment for Concurrent Java Programs.” In <i>Proceedings of the International Seminar on Software Visualization, Dagstuhl (Germany)</i>, 2269:163–75. LNCS. Berlin/Heidelberg: Springer, 2002.","ieee":"K. Mehner, “JaVis: A UML-Based Visualization and Debugging Environment for Concurrent Java Programs,” in <i>Proceedings of the International Seminar on Software Visualization, Dagstuhl (Germany)</i>, 2002, vol. 2269, pp. 163–175.","ama":"Mehner K. JaVis: A UML-Based Visualization and Debugging Environment for Concurrent Java Programs. In: <i>Proceedings of the International Seminar on Software Visualization, Dagstuhl (Germany)</i>. Vol 2269. LNCS. Berlin/Heidelberg: Springer; 2002:163-175.","apa":"Mehner, K. (2002). JaVis: A UML-Based Visualization and Debugging Environment for Concurrent Java Programs. In <i>Proceedings of the International Seminar on Software Visualization, Dagstuhl (Germany)</i> (Vol. 2269, pp. 163–175). Berlin/Heidelberg: Springer.","short":"K. Mehner, in: Proceedings of the International Seminar on Software Visualization, Dagstuhl (Germany), Springer, Berlin/Heidelberg, 2002, pp. 163–175.","bibtex":"@inproceedings{Mehner_2002, place={Berlin/Heidelberg}, series={LNCS}, title={JaVis: A UML-Based Visualization and Debugging Environment for Concurrent Java Programs}, volume={2269}, booktitle={Proceedings of the International Seminar on Software Visualization, Dagstuhl (Germany)}, publisher={Springer}, author={Mehner, Katharina}, year={2002}, pages={163–175}, collection={LNCS} }","mla":"Mehner, Katharina. “JaVis: A UML-Based Visualization and Debugging Environment for Concurrent Java Programs.” <i>Proceedings of the International Seminar on Software Visualization, Dagstuhl (Germany)</i>, vol. 2269, Springer, 2002, pp. 163–75."},"place":"Berlin/Heidelberg","year":"2002","volume":2269,"author":[{"last_name":"Mehner","full_name":"Mehner, Katharina","first_name":"Katharina"}],"date_created":"2019-02-21T11:01:07Z","publisher":"Springer","date_updated":"2022-01-06T07:03:47Z","title":"JaVis: A UML-Based Visualization and Debugging Environment for Concurrent Java Programs","publication":"Proceedings of the International Seminar on Software Visualization, Dagstuhl (Germany)","type":"conference","status":"public","department":[{"_id":"66"}],"series_title":"LNCS","user_id":"52534","_id":"7904","language":[{"iso":"eng"}]}]