[{"status":"public","has_accepted_license":"1","_id":"19639","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","volume":46,"user_id":"5786","ddc":["000"],"citation":{"mla":"Vöcking, Berthold. <i>Static and Dynamic Data Management in Networks</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.","ama":"Vöcking B. <i>Static and Dynamic Data Management in Networks</i>. Vol 46. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1998.","bibtex":"@book{Vöcking_1998, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Static and Dynamic Data Management in Networks}, volume={46}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Vöcking, Berthold}, year={1998}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","apa":"Vöcking, B. (1998). <i>Static and Dynamic Data Management in Networks</i> (Vol. 46). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"B. Vöcking, <i>Static and Dynamic Data Management in Networks</i>, vol. 46. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.","short":"B. Vöcking, Static and Dynamic Data Management in Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.","chicago":"Vöcking, Berthold. <i>Static and Dynamic Data Management in Networks</i>. Vol. 46. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998."},"supervisor":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"file_date_updated":"2020-09-22T13:05:04Z","publication_identifier":{"isbn":["3-931466-45-0"]},"author":[{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"}],"title":"Static and Dynamic Data Management in Networks","year":"1998","intvolume":"        46","date_updated":"2022-01-06T06:54:09Z","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"date_created":"2020-09-22T13:05:43Z","file":[{"creator":"koala","date_created":"2020-09-22T13:05:04Z","relation":"main_file","date_updated":"2020-09-22T13:05:04Z","file_name":"pub-hni-478.pdf","file_size":592479,"access_level":"closed","file_id":"19640","content_type":"application/pdf","success":1}],"department":[{"_id":"63"},{"_id":"26"}],"type":"dissertation"},{"user_id":"15415","ddc":["000"],"_id":"19735","language":[{"iso":"eng"}],"has_accepted_license":"1","date_updated":"2022-01-06T06:54:11Z","author":[{"first_name":"Olaf","last_name":"Bonorden","full_name":"Bonorden, Olaf"},{"full_name":"Rieping, Ingo","last_name":"Rieping","first_name":"Ingo"},{"full_name":"von Otte, Ingo","last_name":"von Otte","first_name":"Ingo"},{"full_name":"Juurlink, Bernhardus","last_name":"Juurlink","first_name":"Bernhardus"}],"title":"The Paderborn University BSP (PUB) Library - Design, Implementation and Performance","status":"public","year":"1998","department":[{"_id":"63"}],"type":"report","date_created":"2020-09-28T12:41:20Z","file":[{"creator":"koala","date_created":"2020-09-28T12:41:08Z","date_updated":"2020-09-28T12:41:08Z","relation":"main_file","file_size":255806,"access_level":"closed","file_name":"pub-hni-1350.pdf","content_type":"application/pdf","success":1,"file_id":"19736"}],"abstract":[{"text":"The Paderborn University BSP (PUB) library is a parallel C library based on the BSP model. The basic library supports buffered and unbuffered asynchronous communication between any pair of processors, and a mechanism for synchronizing the processors in a barrier style. In addition, it provides routines for collective communication on arbitrary subsets of processors, partition operations, and a zero-cost synchronization mechanism. Furthermore, some techniques used in the implementation of the PUB library deviate significantly from the techniques used in other BSP libraries.","lang":"eng"}],"citation":{"apa":"Bonorden, O., Rieping, I., von Otte, I., &#38; Juurlink, B. (1998). <i>The Paderborn University BSP (PUB) Library - Design, Implementation and Performance</i>.","ieee":"O. Bonorden, I. Rieping, I. von Otte, and B. Juurlink, <i>The Paderborn University BSP (PUB) Library - Design, Implementation and Performance</i>. 1998.","chicago":"Bonorden, Olaf, Ingo Rieping, Ingo von Otte, and Bernhardus Juurlink. <i>The Paderborn University BSP (PUB) Library - Design, Implementation and Performance</i>, 1998.","short":"O. Bonorden, I. Rieping, I. von Otte, B. Juurlink, The Paderborn University BSP (PUB) Library - Design, Implementation and Performance, 1998.","mla":"Bonorden, Olaf, et al. <i>The Paderborn University BSP (PUB) Library - Design, Implementation and Performance</i>. 1998.","ama":"Bonorden O, Rieping I, von Otte I, Juurlink B. <i>The Paderborn University BSP (PUB) Library - Design, Implementation and Performance</i>.; 1998.","bibtex":"@book{Bonorden_Rieping_von Otte_Juurlink_1998, title={The Paderborn University BSP (PUB) Library - Design, Implementation and Performance}, author={Bonorden, Olaf and Rieping, Ingo and von Otte, Ingo and Juurlink, Bernhardus}, year={1998} }"},"file_date_updated":"2020-09-28T12:41:08Z"},{"author":[{"full_name":"Gehrke, Thomas","last_name":"Gehrke","first_name":"Thomas"},{"full_name":"Huhn, Michaela","first_name":"Michaela","last_name":"Huhn"},{"last_name":"Niebert","first_name":"Peter","full_name":"Niebert, Peter"},{"last_name":"Rensink","first_name":"Arend","full_name":"Rensink, Arend"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"status":"public","year":"1998","title":"A Process Algebra Semantics for {MSC} Including Conditions","date_updated":"2022-01-06T06:59:07Z","_id":"3255","page":"185--196","editor":[{"full_name":"K{\\\"{o}}nig, Hartmut","first_name":"Hartmut","last_name":"K{\\\"{o}}nig"},{"first_name":"Peter","last_name":"Langend{\\\"{o}}rfer","full_name":"Langend{\\\"{o}}rfer, Peter"}],"user_id":"29719","citation":{"chicago":"Gehrke, Thomas, Michaela Huhn, Peter Niebert, Arend Rensink, and Heike Wehrheim. “A Process Algebra Semantics for {MSC} Including Conditions.” In <i>Formale Beschreibungstechniken F{\\\"{u}}r Verteilte Systeme, 8. GI/ITG-Fachgespr{\\\"{a}}ch, Cottbus, 4. Und 5. Juni 1998</i>, edited by Hartmut K{\\\"{o}}nig and Peter Langend{\\\"{o}}rfer, 185--196, 1998.","short":"T. Gehrke, M. Huhn, P. Niebert, A. Rensink, H. Wehrheim, in: H. K{\\\"{o}}nig, P. Langend{\\\"{o}}rfer (Eds.), Formale Beschreibungstechniken F{\\\"{u}}r Verteilte Systeme, 8. GI/ITG-Fachgespr{\\\"{a}}ch, Cottbus, 4. Und 5. Juni 1998, 1998, pp. 185--196.","ieee":"T. Gehrke, M. Huhn, P. Niebert, A. Rensink, and H. Wehrheim, “A Process Algebra Semantics for {MSC} Including Conditions,” in <i>Formale Beschreibungstechniken f{\\\"{u}}r verteilte Systeme, 8. GI/ITG-Fachgespr{\\\"{a}}ch, Cottbus, 4. und 5. Juni 1998</i>, 1998, pp. 185--196.","apa":"Gehrke, T., Huhn, M., Niebert, P., Rensink, A., &#38; Wehrheim, H. (1998). A Process Algebra Semantics for {MSC} Including Conditions. In H. K{\\\"{o}}nig &#38; P. Langend{\\\"{o}}rfer (Eds.), <i>Formale Beschreibungstechniken f{\\\"{u}}r verteilte Systeme, 8. GI/ITG-Fachgespr{\\\"{a}}ch, Cottbus, 4. und 5. Juni 1998</i> (pp. 185--196).","bibtex":"@inproceedings{Gehrke_Huhn_Niebert_Rensink_Wehrheim_1998, title={A Process Algebra Semantics for {MSC} Including Conditions}, booktitle={Formale Beschreibungstechniken f{\\\"{u}}r verteilte Systeme, 8. GI/ITG-Fachgespr{\\\"{a}}ch, Cottbus, 4. und 5. Juni 1998}, author={Gehrke, Thomas and Huhn, Michaela and Niebert, Peter and Rensink, Arend and Wehrheim, Heike}, editor={K{\\\"{o}}nig, Hartmut and Langend{\\\"{o}}rfer, PeterEditors}, year={1998}, pages={185--196} }","ama":"Gehrke T, Huhn M, Niebert P, Rensink A, Wehrheim H. A Process Algebra Semantics for {MSC} Including Conditions. In: K{\\\"{o}}nig H, Langend{\\\"{o}}rfer P, eds. <i>Formale Beschreibungstechniken F{\\\"{u}}r Verteilte Systeme, 8. GI/ITG-Fachgespr{\\\"{a}}ch, Cottbus, 4. Und 5. Juni 1998</i>. ; 1998:185--196.","mla":"Gehrke, Thomas, et al. “A Process Algebra Semantics for {MSC} Including Conditions.” <i>Formale Beschreibungstechniken F{\\\"{u}}r Verteilte Systeme, 8. GI/ITG-Fachgespr{\\\"{a}}ch, Cottbus, 4. Und 5. Juni 1998</i>, edited by Hartmut K{\\\"{o}}nig and Peter Langend{\\\"{o}}rfer, 1998, pp. 185--196."},"publication":"Formale Beschreibungstechniken f{\\\"{u}}r verteilte Systeme, 8. GI/ITG-Fachgespr{\\\"{a}}ch, Cottbus, 4. und 5. Juni 1998","date_created":"2018-06-14T07:34:22Z","department":[{"_id":"77"}],"type":"conference"},{"date_updated":"2022-01-06T06:59:07Z","author":[{"full_name":"Gehrke, Thomas","last_name":"Gehrke","first_name":"Thomas"},{"full_name":"Huhn, Michaela","first_name":"Michaela","last_name":"Huhn"},{"last_name":"Rensink","first_name":"Arend","full_name":"Rensink, Arend"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"status":"public","title":"An Algebraic Semantics for Message Sequence Chart Documents","year":"1998","editor":[{"last_name":"Budkowski","first_name":"Stanislaw","full_name":"Budkowski, Stanislaw"},{"last_name":"R. Cavalli","first_name":"Ana","full_name":"R. Cavalli, Ana"},{"last_name":"Najm","first_name":"Elie","full_name":"Najm, Elie"}],"user_id":"29719","series_title":"{IFIP} Conference Proceedings","_id":"3256","page":"3--18","citation":{"ama":"Gehrke T, Huhn M, Rensink A, Wehrheim H. An Algebraic Semantics for Message Sequence Chart Documents. In: Budkowski S, R. Cavalli A, Najm E, eds. <i>Formal Description Techniques and Protocol Specification, Testing and Verification, {FORTE} {XI} / {PSTV} XVIII’98, {IFIP} {TC6} {WG6.1} Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols {(FORTE} {XI)} and Protocol Specification, Testing and Verification {(PSTV} XVIII), 3-6 November, 1998, Paris, France</i>. {IFIP} Conference Proceedings. ; 1998:3--18.","bibtex":"@inproceedings{Gehrke_Huhn_Rensink_Wehrheim_1998, series={{IFIP} Conference Proceedings}, title={An Algebraic Semantics for Message Sequence Chart Documents}, booktitle={Formal Description Techniques and Protocol Specification, Testing and Verification, {FORTE} {XI} / {PSTV} XVIII’98, {IFIP} {TC6} {WG6.1} Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols {(FORTE} {XI)} and Protocol Specification, Testing and Verification {(PSTV} XVIII), 3-6 November, 1998, Paris, France}, author={Gehrke, Thomas and Huhn, Michaela and Rensink, Arend and Wehrheim, Heike}, editor={Budkowski, Stanislaw and R. Cavalli, Ana and Najm, ElieEditors}, year={1998}, pages={3--18}, collection={{IFIP} Conference Proceedings} }","mla":"Gehrke, Thomas, et al. “An Algebraic Semantics for Message Sequence Chart Documents.” <i>Formal Description Techniques and Protocol Specification, Testing and Verification, {FORTE} {XI} / {PSTV} XVIII’98, {IFIP} {TC6} {WG6.1} Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols {(FORTE} {XI)} and Protocol Specification, Testing and Verification {(PSTV} XVIII), 3-6 November, 1998, Paris, France</i>, edited by Stanislaw Budkowski et al., 1998, pp. 3--18.","short":"T. Gehrke, M. Huhn, A. Rensink, H. Wehrheim, in: S. Budkowski, A. R. Cavalli, E. Najm (Eds.), Formal Description Techniques and Protocol Specification, Testing and Verification, {FORTE} {XI} / {PSTV} XVIII’98, {IFIP} {TC6} {WG6.1} Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols {(FORTE} {XI)} and Protocol Specification, Testing and Verification {(PSTV} XVIII), 3-6 November, 1998, Paris, France, 1998, pp. 3--18.","chicago":"Gehrke, Thomas, Michaela Huhn, Arend Rensink, and Heike Wehrheim. “An Algebraic Semantics for Message Sequence Chart Documents.” In <i>Formal Description Techniques and Protocol Specification, Testing and Verification, {FORTE} {XI} / {PSTV} XVIII’98, {IFIP} {TC6} {WG6.1} Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols {(FORTE} {XI)} and Protocol Specification, Testing and Verification {(PSTV} XVIII), 3-6 November, 1998, Paris, France</i>, edited by Stanislaw Budkowski, Ana R. Cavalli, and Elie Najm, 3--18. {IFIP} Conference Proceedings, 1998.","apa":"Gehrke, T., Huhn, M., Rensink, A., &#38; Wehrheim, H. (1998). An Algebraic Semantics for Message Sequence Chart Documents. In S. Budkowski, A. R. Cavalli, &#38; E. Najm (Eds.), <i>Formal Description Techniques and Protocol Specification, Testing and Verification, {FORTE} {XI} / {PSTV} XVIII’98, {IFIP} {TC6} {WG6.1} Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols {(FORTE} {XI)} and Protocol Specification, Testing and Verification {(PSTV} XVIII), 3-6 November, 1998, Paris, France</i> (pp. 3--18).","ieee":"T. Gehrke, M. Huhn, A. Rensink, and H. Wehrheim, “An Algebraic Semantics for Message Sequence Chart Documents,” in <i>Formal Description Techniques and Protocol Specification, Testing and Verification, {FORTE} {XI} / {PSTV} XVIII’98, {IFIP} {TC6} {WG6.1} Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols {(FORTE} {XI)} and Protocol Specification, Testing and Verification {(PSTV} XVIII), 3-6 November, 1998, Paris, France</i>, 1998, pp. 3--18."},"publication":"Formal Description Techniques and Protocol Specification, Testing and Verification, {FORTE} {XI} / {PSTV} XVIII'98, {IFIP} {TC6} {WG6.1} Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols {(FORTE} {XI)} and Protocol Specification, Testing and Verification {(PSTV} XVIII), 3-6 November, 1998, Paris, France","department":[{"_id":"77"}],"type":"conference","date_created":"2018-06-14T07:35:45Z"},{"date_updated":"2022-01-06T06:59:07Z","status":"public","year":"1998","title":"Partial Order Reductions for Bisimulation Checking","author":[{"full_name":"Huhn, Michaela","last_name":"Huhn","first_name":"Michaela"},{"full_name":"Niebert, Peter","first_name":"Peter","last_name":"Niebert"},{"last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike","id":"573"}],"user_id":"29719","doi":"10.1007/978-3-540-49382-2_26","editor":[{"full_name":"Arvind, Vikraman","first_name":"Vikraman","last_name":"Arvind"},{"first_name":"Ramaswamy","last_name":"Ramanujam","full_name":"Ramanujam, Ramaswamy"}],"page":"271--282","series_title":"Lecture Notes in Computer Science","_id":"3257","publication":"Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings","citation":{"mla":"Huhn, Michaela, et al. “Partial Order Reductions for Bisimulation Checking.” <i>Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings</i>, edited by Vikraman Arvind and Ramaswamy Ramanujam, 1998, pp. 271--282, doi:<a href=\"https://doi.org/10.1007/978-3-540-49382-2_26\">10.1007/978-3-540-49382-2_26</a>.","ama":"Huhn M, Niebert P, Wehrheim H. Partial Order Reductions for Bisimulation Checking. In: Arvind V, Ramanujam R, eds. <i>Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings</i>. Lecture Notes in Computer Science. ; 1998:271--282. doi:<a href=\"https://doi.org/10.1007/978-3-540-49382-2_26\">10.1007/978-3-540-49382-2_26</a>","bibtex":"@inproceedings{Huhn_Niebert_Wehrheim_1998, series={Lecture Notes in Computer Science}, title={Partial Order Reductions for Bisimulation Checking}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-49382-2_26\">10.1007/978-3-540-49382-2_26</a>}, booktitle={Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings}, author={Huhn, Michaela and Niebert, Peter and Wehrheim, Heike}, editor={Arvind, Vikraman and Ramanujam, RamaswamyEditors}, year={1998}, pages={271--282}, collection={Lecture Notes in Computer Science} }","apa":"Huhn, M., Niebert, P., &#38; Wehrheim, H. (1998). Partial Order Reductions for Bisimulation Checking. In V. Arvind &#38; R. Ramanujam (Eds.), <i>Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings</i> (pp. 271--282). <a href=\"https://doi.org/10.1007/978-3-540-49382-2_26\">https://doi.org/10.1007/978-3-540-49382-2_26</a>","ieee":"M. Huhn, P. Niebert, and H. Wehrheim, “Partial Order Reductions for Bisimulation Checking,” in <i>Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings</i>, 1998, pp. 271--282.","short":"M. Huhn, P. Niebert, H. Wehrheim, in: V. Arvind, R. Ramanujam (Eds.), Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings, 1998, pp. 271--282.","chicago":"Huhn, Michaela, Peter Niebert, and Heike Wehrheim. “Partial Order Reductions for Bisimulation Checking.” In <i>Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings</i>, edited by Vikraman Arvind and Ramaswamy Ramanujam, 271--282. Lecture Notes in Computer Science, 1998. <a href=\"https://doi.org/10.1007/978-3-540-49382-2_26\">https://doi.org/10.1007/978-3-540-49382-2_26</a>."},"type":"conference","department":[{"_id":"77"}],"date_created":"2018-06-14T07:37:32Z"},{"author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"full_name":"Trachsler, Beat","last_name":"Trachsler","first_name":"Beat"}],"title":"A lower bound for a class of graph based loss resilient codes","year":"1998","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:58:52Z","publication_status":"published","_id":"3028","ddc":["000"],"user_id":"25078","citation":{"bibtex":"@article{Blömer_Trachsler_1998, title={A lower bound for a class of graph based loss resilient codes}, journal={Technical report/Departement of Computer Science, ETH Zürich}, author={Blömer, Johannes and Trachsler, Beat}, year={1998} }","chicago":"Blömer, Johannes, and Beat Trachsler. “A Lower Bound for a Class of Graph Based Loss Resilient Codes.” <i>Technical Report/Departement of Computer Science, ETH Zürich</i>, 1998.","short":"J. Blömer, B. Trachsler, Technical Report/Departement of Computer Science, ETH Zürich (1998).","ama":"Blömer J, Trachsler B. A lower bound for a class of graph based loss resilient codes. <i>Technical report/Departement of Computer Science, ETH Zürich</i>. 1998.","ieee":"J. Blömer and B. Trachsler, “A lower bound for a class of graph based loss resilient codes,” <i>Technical report/Departement of Computer Science, ETH Zürich</i>, 1998.","mla":"Blömer, Johannes, and Beat Trachsler. “A Lower Bound for a Class of Graph Based Loss Resilient Codes.” <i>Technical Report/Departement of Computer Science, ETH Zürich</i>, 1998.","apa":"Blömer, J., &#38; Trachsler, B. (1998). A lower bound for a class of graph based loss resilient codes. <i>Technical Report/Departement of Computer Science, ETH Zürich</i>."},"publication":"Technical report/Departement of Computer Science, ETH Zürich","file_date_updated":"2018-06-05T08:32:27Z","extern":"1","date_created":"2018-06-05T08:29:47Z","file":[{"date_created":"2018-06-05T08:32:27Z","creator":"feidens","content_type":"application/pdf","success":1,"file_id":"3031","access_level":"closed","file_size":173369,"file_name":"code_lower.pdf","date_updated":"2018-06-05T08:32:27Z","relation":"main_file"}],"department":[{"_id":"64"}],"type":"journal_article"},{"doi":"10.1007/3-540-68530-8_14","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:11Z","publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540648482","9783540685302"]},"author":[{"full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer","id":"146"},{"full_name":"Lukovszki, Tamás","last_name":"Lukovszki","first_name":"Tamás"},{"last_name":"Ziegler","first_name":"Martin","full_name":"Ziegler, Martin"}],"year":"1998","title":"Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time","department":[{"_id":"63"}],"type":"book_chapter","date_created":"2020-07-27T11:42:54Z","file":[{"relation":"main_file","date_updated":"2020-08-27T11:20:38Z","file_name":"hni-id-854.pdf","file_size":266070,"access_level":"closed","file_id":"18442","success":1,"content_type":"application/pdf","creator":"koala","date_created":"2020-08-27T11:20:38Z"}],"abstract":[{"text":"We study algorithmic aspects in the management of geometric scenes in interactive walkthrough animations. We consider arbitrarily large scenes consisting of unit size balls. For a smooth navigation in the scene we have to fulfill hard real time requirements. Therefore, we need algorithms whose running time is independent of the total number of objects in the scene and that use as small space as possible. In this work we focus on one of the basic operations in our walkthrough system: reporting the objects around the visitor within a certain distance. Previously a randomized data structure was presented that supports reporting the balls around the visitor in an output sensitive time and allows insertion and deletion of objects nearly as fast as searching. These results were achieved by exploiting the fact that the visitor moves ''slowly'' through the scene. A serious disadvantage of the aforementioned data structure is a big space overhead and the use of randomization. Our first result is a construction of weak spanners that leads to an improvement of the space requirement of the previously known data structures. Then we develop a deterministic data structure for the searching problem in which insertion of objects are allowed. Our incremental data structure supports O(1+k) reporting time, where k is a certain quantity close to the number of reported objects. The insertion time is similar to the reporting time and the space is linear to the total number of objects.\r\n","lang":"eng"}],"publication":"Algorithms — ESA’ 98","ddc":["000"],"user_id":"15415","_id":"17412","has_accepted_license":"1","status":"public","place":"Berlin, Heidelberg","citation":{"apa":"Fischer, M., Lukovszki, T., &#38; Ziegler, M. (1998). Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. In <i>Algorithms — ESA’ 98</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-68530-8_14\">https://doi.org/10.1007/3-540-68530-8_14</a>","mla":"Fischer, Matthias, et al. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.” <i>Algorithms — ESA’ 98</i>, 1998, doi:<a href=\"https://doi.org/10.1007/3-540-68530-8_14\">10.1007/3-540-68530-8_14</a>.","ieee":"M. Fischer, T. Lukovszki, and M. Ziegler, “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time,” in <i>Algorithms — ESA’ 98</i>, Berlin, Heidelberg, 1998.","chicago":"Fischer, Matthias, Tamás Lukovszki, and Martin Ziegler. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.” In <i>Algorithms — ESA’ 98</i>. Berlin, Heidelberg, 1998. <a href=\"https://doi.org/10.1007/3-540-68530-8_14\">https://doi.org/10.1007/3-540-68530-8_14</a>.","ama":"Fischer M, Lukovszki T, Ziegler M. Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. In: <i>Algorithms — ESA’ 98</i>. Berlin, Heidelberg; 1998. doi:<a href=\"https://doi.org/10.1007/3-540-68530-8_14\">10.1007/3-540-68530-8_14</a>","short":"M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithms — ESA’ 98, Berlin, Heidelberg, 1998.","bibtex":"@inbook{Fischer_Lukovszki_Ziegler_1998, place={Berlin, Heidelberg}, title={Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time}, DOI={<a href=\"https://doi.org/10.1007/3-540-68530-8_14\">10.1007/3-540-68530-8_14</a>}, booktitle={Algorithms — ESA’ 98}, author={Fischer, Matthias and Lukovszki, Tamás and Ziegler, Martin}, year={1998} }"},"file_date_updated":"2020-08-27T11:20:38Z"},{"file":[{"creator":"koala","date_created":"2020-08-27T11:18:26Z","date_updated":"2020-08-27T11:18:26Z","relation":"main_file","file_size":272549,"access_level":"closed","file_name":"hni-id-853.pdf","success":1,"content_type":"application/pdf","file_id":"18440"}],"date_created":"2020-08-12T12:50:56Z","type":"conference","department":[{"_id":"63"}],"publication":"Algorithm Engineering, 2nd International Workshop, {WAE '98}","abstract":[{"lang":"eng","text":"New dynamic search data structures developed recently guarantee constant execution time per search and update, i.e., they fulfil the real-time requirements necessary for interactive walkthrough in large geometric scenes. Yet, superiority or even applicability of these new methods in practice was still an open question.\r\n\r\nTheir prototypical implementation presented in this work uses common libraries on standard stations and thus represents a first strut to bridge this gap. Indeed our experimental results give an indication on the actual performance of these theoretical ideas on real machines and possible bottlenecks in future developments. By special algorithmic enhancements, we can even avoid the otherwise essential preprocessing step.\r\n"}],"language":[{"iso":"eng"}],"year":"1998","title":"A Network Based Approach for Realtime Walkthrough of Massive Models","author":[{"id":"146","first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias"},{"first_name":"Tamas","last_name":"Lukovszki","full_name":"Lukovszki, Tamas"},{"first_name":"Martin ","last_name":"Ziegler","full_name":"Ziegler, Martin "}],"date_updated":"2022-01-06T06:53:21Z","place":"Saarbrücken","file_date_updated":"2020-08-27T11:18:26Z","citation":{"mla":"Fischer, Matthias, et al. “A Network Based Approach for Realtime Walkthrough of Massive Models.” <i>Algorithm Engineering, 2nd International Workshop, {WAE ’98}</i>, Max-Planck-Institut für Informatik, 1998, pp. 133--142.","bibtex":"@inproceedings{Fischer_Lukovszki_Ziegler_1998, place={Saarbrücken}, title={A Network Based Approach for Realtime Walkthrough of Massive Models}, booktitle={Algorithm Engineering, 2nd International Workshop, {WAE ’98}}, publisher={Max-Planck-Institut für Informatik}, author={Fischer, Matthias and Lukovszki, Tamas and Ziegler, Martin }, year={1998}, pages={133--142} }","ama":"Fischer M, Lukovszki T, Ziegler M. A Network Based Approach for Realtime Walkthrough of Massive Models. In: <i>Algorithm Engineering, 2nd International Workshop, {WAE ’98}</i>. Saarbrücken: Max-Planck-Institut für Informatik; 1998:133--142.","ieee":"M. Fischer, T. Lukovszki, and M. Ziegler, “A Network Based Approach for Realtime Walkthrough of Massive Models,” in <i>Algorithm Engineering, 2nd International Workshop, {WAE ’98}</i>, 1998, pp. 133--142.","apa":"Fischer, M., Lukovszki, T., &#38; Ziegler, M. (1998). A Network Based Approach for Realtime Walkthrough of Massive Models. In <i>Algorithm Engineering, 2nd International Workshop, {WAE ’98}</i> (pp. 133--142). Saarbrücken: Max-Planck-Institut für Informatik.","short":"M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithm Engineering, 2nd International Workshop, {WAE ’98}, Max-Planck-Institut für Informatik, Saarbrücken, 1998, pp. 133--142.","chicago":"Fischer, Matthias, Tamas Lukovszki, and Martin  Ziegler. “A Network Based Approach for Realtime Walkthrough of Massive Models.” In <i>Algorithm Engineering, 2nd International Workshop, {WAE ’98}</i>, 133--142. Saarbrücken: Max-Planck-Institut für Informatik, 1998."},"page":"133--142","_id":"17863","publisher":"Max-Planck-Institut für Informatik","user_id":"15415","ddc":["000"],"status":"public","has_accepted_license":"1"},{"citation":{"apa":"Ziegler, M., Fischer, M., &#38; Lukovszki, T. (1998). <i>Multimediale Entdeckungsreisen unserer Welt mit dem Internet</i>.","ieee":"M. Ziegler, M. Fischer, and T. Lukovszki, <i>Multimediale Entdeckungsreisen unserer Welt mit dem Internet</i>. 1998.","short":"M. Ziegler, M. Fischer, T. Lukovszki, Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet, 1998.","chicago":"Ziegler, Martin, Matthias Fischer, and Tamás Lukovszki. <i>Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet</i>, 1998.","mla":"Ziegler, Martin, et al. <i>Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet</i>. 1998.","ama":"Ziegler M, Fischer M, Lukovszki T. <i>Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet</i>.; 1998.","bibtex":"@book{Ziegler_Fischer_Lukovszki_1998, title={Multimediale Entdeckungsreisen unserer Welt mit dem Internet}, author={Ziegler, Martin and Fischer, Matthias and Lukovszki, Tamás}, year={1998} }"},"abstract":[{"lang":"ger","text":"Preis für den Beitrag \"Multimediale Entdeckungsreisen unserer Welt mit dem Internet\""},{"text":"Award for the Article \"Multimedia-based Expedition of our World with the Internet\"","lang":"eng"}],"date_created":"2020-08-24T09:55:41Z","type":"report","department":[{"_id":"63"}],"title":"Multimediale Entdeckungsreisen unserer Welt mit dem Internet","year":"1998","status":"public","author":[{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"},{"full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias","id":"146"},{"full_name":"Lukovszki, Tamás","last_name":"Lukovszki","first_name":"Tamás"}],"date_updated":"2022-01-06T06:53:26Z","language":[{"iso":"eng"}],"_id":"18145","user_id":"15415"},{"date_updated":"2022-01-06T06:53:32Z","year":"1998","title":"On Periodic Comparator Networks","status":"public","author":[{"full_name":"Oesterdiekhoff, Brigitte","last_name":"Oesterdiekhoff","first_name":"Brigitte"}],"user_id":"15415","language":[{"iso":"eng"}],"_id":"18445","supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"citation":{"bibtex":"@book{Oesterdiekhoff_1998, place={Universität Paderborn}, title={On Periodic Comparator Networks}, author={Oesterdiekhoff, Brigitte}, year={1998} }","ama":"Oesterdiekhoff B. <i>On Periodic Comparator Networks</i>. Universität Paderborn; 1998.","mla":"Oesterdiekhoff, Brigitte. <i>On Periodic Comparator Networks</i>. 1998.","short":"B. Oesterdiekhoff, On Periodic Comparator Networks, Universität Paderborn, 1998.","chicago":"Oesterdiekhoff, Brigitte. <i>On Periodic Comparator Networks</i>. Universität Paderborn, 1998.","ieee":"B. Oesterdiekhoff, <i>On Periodic Comparator Networks</i>. Universität Paderborn, 1998.","apa":"Oesterdiekhoff, B. (1998). <i>On Periodic Comparator Networks</i>. Universität Paderborn."},"type":"dissertation","department":[{"_id":"63"}],"place":"Universität Paderborn","date_created":"2020-08-27T11:42:12Z"},{"author":[{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"}],"year":"1998","title":"Universal Continuous Routing Strategies","status":"public","intvolume":"        31","date_updated":"2022-01-06T06:55:10Z","language":[{"iso":"eng"}],"_id":"2168","page":"425--449","volume":31,"doi":"10.1007/s002240000096","user_id":"14955","citation":{"ieee":"C. Scheideler and B. Vöcking, “Universal Continuous Routing Strategies,” <i>Theory Comput. Syst.</i>, vol. 31, no. 4, pp. 425--449, 1998.","mla":"Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.” <i>Theory Comput. Syst.</i>, vol. 31, no. 4, 1998, pp. 425--449, doi:<a href=\"https://doi.org/10.1007/s002240000096\">10.1007/s002240000096</a>.","apa":"Scheideler, C., &#38; Vöcking, B. (1998). Universal Continuous Routing Strategies. <i>Theory Comput. Syst.</i>, <i>31</i>(4), 425--449. <a href=\"https://doi.org/10.1007/s002240000096\">https://doi.org/10.1007/s002240000096</a>","bibtex":"@article{Scheideler_Vöcking_1998, title={Universal Continuous Routing Strategies}, volume={31}, DOI={<a href=\"https://doi.org/10.1007/s002240000096\">10.1007/s002240000096</a>}, number={4}, journal={Theory Comput. Syst.}, author={Scheideler, Christian and Vöcking, Berthold}, year={1998}, pages={425--449} }","ama":"Scheideler C, Vöcking B. Universal Continuous Routing Strategies. <i>Theory Comput Syst</i>. 1998;31(4):425--449. doi:<a href=\"https://doi.org/10.1007/s002240000096\">10.1007/s002240000096</a>","short":"C. Scheideler, B. Vöcking, Theory Comput. Syst. 31 (1998) 425--449.","chicago":"Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.” <i>Theory Comput. Syst.</i> 31, no. 4 (1998): 425--449. <a href=\"https://doi.org/10.1007/s002240000096\">https://doi.org/10.1007/s002240000096</a>."},"issue":"4","publication":"Theory Comput. Syst.","date_created":"2018-04-03T08:59:06Z","department":[{"_id":"79"},{"_id":"63"}],"type":"journal_article"},{"type":"conference","oa":"1","department":[{"_id":"79"},{"_id":"63"}],"file":[{"creator":"florida","date_created":"2018-04-12T07:08:12Z","relation":"main_file","date_updated":"2018-04-12T07:08:12Z","file_name":"SPAA98.pdf","file_size":492778,"access_level":"open_access","file_id":"2285","content_type":"application/pdf"}],"date_created":"2018-04-03T08:59:55Z","publication":"SPAA","file_date_updated":"2018-04-12T07:08:12Z","citation":{"bibtex":"@inproceedings{Adler_Scheideler_1998, title={Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)}, booktitle={SPAA}, author={Adler, Micah and Scheideler, Christian}, year={1998}, pages={259--268} }","ama":"Adler M, Scheideler C. Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). In: <i>SPAA</i>. ; 1998:259--268.","mla":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” <i>SPAA</i>, 1998, pp. 259--268.","short":"M. Adler, C. Scheideler, in: SPAA, 1998, pp. 259--268.","chicago":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” In <i>SPAA</i>, 259--268, 1998.","ieee":"M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract),” in <i>SPAA</i>, 1998, pp. 259--268.","apa":"Adler, M., &#38; Scheideler, C. (1998). Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). In <i>SPAA</i> (pp. 259--268)."},"ddc":["040"],"user_id":"14955","page":"259--268","_id":"2169","language":[{"iso":"eng"}],"urn":"21699","date_updated":"2022-01-06T06:55:10Z","has_accepted_license":"1","status":"public","year":"1998","title":"Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)","author":[{"first_name":"Micah","last_name":"Adler","full_name":"Adler, Micah"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}]},{"date_updated":"2022-01-06T06:55:11Z","has_accepted_license":"1","status":"public","year":"1998","title":"Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)","author":[{"first_name":"Uriel","last_name":"Feige","full_name":"Feige, Uriel"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"user_id":"14955","ddc":["040"],"page":"624--633","_id":"2170","language":[{"iso":"eng"}],"urn":"21705","file_date_updated":"2018-04-12T07:15:50Z","publication":"STOC","citation":{"apa":"Feige, U., &#38; Scheideler, C. (1998). Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). In <i>STOC</i> (pp. 624--633).","ieee":"U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract),” in <i>STOC</i>, 1998, pp. 624--633.","chicago":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” In <i>STOC</i>, 624--633, 1998.","short":"U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633.","mla":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” <i>STOC</i>, 1998, pp. 624--633.","ama":"Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). In: <i>STOC</i>. ; 1998:624--633.","bibtex":"@inproceedings{Feige_Scheideler_1998, title={Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)}, booktitle={STOC}, author={Feige, Uriel and Scheideler, Christian}, year={1998}, pages={624--633} }"},"type":"conference","department":[{"_id":"79"},{"_id":"63"}],"oa":"1","file":[{"date_created":"2018-04-12T07:15:50Z","creator":"florida","content_type":"application/pdf","file_id":"2286","date_updated":"2018-04-12T07:15:50Z","relation":"main_file","file_size":228487,"access_level":"open_access","file_name":"STOC98.pdf"}],"date_created":"2018-04-03T09:00:31Z"},{"user_id":"14955","language":[{"iso":"eng"}],"_id":"21784","date_updated":"2022-01-06T06:55:13Z","status":"public","title":"Dreidimensionale Welten auf flachen Bildschirmen","year":"1998","author":[{"id":"90","full_name":"Domik, Gitta","first_name":"Gitta","last_name":"Domik"},{"first_name":"S.","last_name":"Vollbracht","full_name":"Vollbracht, S."}],"type":"journal_article","department":[{"_id":"65"}],"date_created":"2021-04-25T17:35:26Z","publication":"Zeitschrift Forschungsforum Paderborn","citation":{"short":"G. Domik, S. Vollbracht, Zeitschrift Forschungsforum Paderborn (1998).","ama":"Domik G, Vollbracht S. Dreidimensionale Welten auf flachen Bildschirmen. <i>Zeitschrift Forschungsforum Paderborn</i>. 1998.","chicago":"Domik, Gitta, and S. Vollbracht. “Dreidimensionale Welten Auf Flachen Bildschirmen.” <i>Zeitschrift Forschungsforum Paderborn</i>, 1998.","bibtex":"@article{Domik_Vollbracht_1998, title={Dreidimensionale Welten auf flachen Bildschirmen}, journal={Zeitschrift Forschungsforum Paderborn}, author={Domik, Gitta and Vollbracht, S.}, year={1998} }","apa":"Domik, G., &#38; Vollbracht, S. (1998). Dreidimensionale Welten auf flachen Bildschirmen. <i>Zeitschrift Forschungsforum Paderborn</i>.","mla":"Domik, Gitta, and S. Vollbracht. “Dreidimensionale Welten Auf Flachen Bildschirmen.” <i>Zeitschrift Forschungsforum Paderborn</i>, 1998.","ieee":"G. Domik and S. Vollbracht, “Dreidimensionale Welten auf flachen Bildschirmen,” <i>Zeitschrift Forschungsforum Paderborn</i>, 1998."}},{"date_created":"2021-04-25T17:35:27Z","type":"conference","department":[{"_id":"65"}],"publication":"Proceedings. Computer Graphics International (Cat. No.98EX149)","citation":{"short":"J. D. Stuwe, C. Lenz, G. Domik, in: Proceedings. Computer Graphics International (Cat. No.98EX149), 1998, pp. 111–112.","chicago":"D. Stuwe, J., C. Lenz, and Gitta Domik. “Visualization of Geographic Data Using VRML-an Internet Client, for a Geographic Information System (GIS).” In <i>Proceedings. Computer Graphics International (Cat. No.98EX149)</i>, 1:111–12, 1998. <a href=\"https://doi.org/10.1109/CGI.1998.694258\">https://doi.org/10.1109/CGI.1998.694258</a>.","ieee":"J. D. Stuwe, C. Lenz, and G. Domik, “Visualization of geographic data using VRML-an Internet client, for a geographic information system (GIS),” in <i>Proceedings. Computer Graphics International (Cat. No.98EX149)</i>, 1998, vol. 1, pp. 111–112.","apa":"D. Stuwe, J., Lenz, C., &#38; Domik, G. (1998). Visualization of geographic data using VRML-an Internet client, for a geographic information system (GIS). In <i>Proceedings. Computer Graphics International (Cat. No.98EX149)</i> (Vol. 1, pp. 111–112). <a href=\"https://doi.org/10.1109/CGI.1998.694258\">https://doi.org/10.1109/CGI.1998.694258</a>","bibtex":"@inproceedings{D. Stuwe_Lenz_Domik_1998, title={Visualization of geographic data using VRML-an Internet client, for a geographic information system (GIS)}, volume={1}, DOI={<a href=\"https://doi.org/10.1109/CGI.1998.694258\">10.1109/CGI.1998.694258</a>}, booktitle={Proceedings. Computer Graphics International (Cat. No.98EX149)}, author={D. Stuwe, J. and Lenz, C. and Domik, Gitta}, year={1998}, pages={111–112} }","ama":"D. Stuwe J, Lenz C, Domik G. Visualization of geographic data using VRML-an Internet client, for a geographic information system (GIS). In: <i>Proceedings. Computer Graphics International (Cat. No.98EX149)</i>. Vol 1. ; 1998:111-112. doi:<a href=\"https://doi.org/10.1109/CGI.1998.694258\">10.1109/CGI.1998.694258</a>","mla":"D. Stuwe, J., et al. “Visualization of Geographic Data Using VRML-an Internet Client, for a Geographic Information System (GIS).” <i>Proceedings. Computer Graphics International (Cat. No.98EX149)</i>, vol. 1, 1998, pp. 111–12, doi:<a href=\"https://doi.org/10.1109/CGI.1998.694258\">10.1109/CGI.1998.694258</a>."},"page":"111-112","_id":"21785","language":[{"iso":"eng"}],"doi":"10.1109/CGI.1998.694258","user_id":"14955","volume":1,"title":"Visualization of geographic data using VRML-an Internet client, for a geographic information system (GIS)","status":"public","year":"1998","author":[{"full_name":"D. Stuwe, J.","first_name":"J.","last_name":"D. Stuwe"},{"full_name":"Lenz, C.","first_name":"C.","last_name":"Lenz"},{"full_name":"Domik, Gitta","last_name":"Domik","first_name":"Gitta","id":"90"}],"date_updated":"2022-01-06T06:55:13Z","intvolume":"         1"},{"citation":{"chicago":"Scheideler, Christian. <i>Universal Routing Strategies for Interconnection Networks</i>. Vol. 1390. Lecture Notes in Computer Science, 1998. <a href=\"https://doi.org/10.1007/BFb0052928\">https://doi.org/10.1007/BFb0052928</a>.","short":"C. Scheideler, Universal Routing Strategies for Interconnection Networks, 1998.","apa":"Scheideler, C. (1998). <i>Universal Routing Strategies for Interconnection Networks</i> (Vol. 1390). <a href=\"https://doi.org/10.1007/BFb0052928\">https://doi.org/10.1007/BFb0052928</a>","ieee":"C. Scheideler, <i>Universal Routing Strategies for Interconnection Networks</i>, vol. 1390. 1998.","ama":"Scheideler C. <i>Universal Routing Strategies for Interconnection Networks</i>. Vol 1390.; 1998. doi:<a href=\"https://doi.org/10.1007/BFb0052928\">10.1007/BFb0052928</a>","bibtex":"@book{Scheideler_1998, series={Lecture Notes in Computer Science}, title={Universal Routing Strategies for Interconnection Networks}, volume={1390}, DOI={<a href=\"https://doi.org/10.1007/BFb0052928\">10.1007/BFb0052928</a>}, author={Scheideler, Christian}, year={1998}, collection={Lecture Notes in Computer Science} }","mla":"Scheideler, Christian. <i>Universal Routing Strategies for Interconnection Networks</i>. Vol. 1390, 1998, doi:<a href=\"https://doi.org/10.1007/BFb0052928\">10.1007/BFb0052928</a>."},"date_created":"2018-04-03T09:38:18Z","department":[{"_id":"79"},{"_id":"63"}],"type":"book","publication_identifier":{"isbn":["978-3-540-69792-3"]},"author":[{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"year":"1998","title":"Universal Routing Strategies for Interconnection Networks","status":"public","intvolume":"      1390","date_updated":"2022-01-06T06:55:17Z","series_title":"Lecture Notes in Computer Science","_id":"2185","language":[{"iso":"eng"}],"volume":1390,"user_id":"14955","doi":"10.1007/BFb0052928"},{"volume":218,"editor":[{"last_name":"Engels","first_name":"Gregor","full_name":"Engels, Gregor","id":"107"},{"last_name":"Ehrig","first_name":"Hartmut","full_name":"Ehrig, Hartmut"},{"full_name":"Orejas, Fernando","first_name":"Fernando","last_name":"Orejas"},{"full_name":"Wirsing, M.","last_name":"Wirsing","first_name":"M."}],"user_id":"52534","language":[{"iso":"eng"}],"_id":"7793","publisher":"Schloss Dagstuhl, Leibniz Center for Informatics","series_title":"Dagstuhl-Seminar-Report","intvolume":"       218","date_updated":"2022-01-06T07:03:46Z","year":"1998","status":"public","title":"Semi-Formal and Formal Specification Techniques","department":[{"_id":"66"}],"type":"conference_editor","date_created":"2019-02-19T19:14:00Z","abstract":[{"lang":"eng","text":"During the last 20 years several different formal and semi-formal specification techniques have been successfully developed and used. Applications comprise the specification of simple programs, data types and processes as well as complex hardware and software systems. The variety of specification techniques ranges from formal set theoretical, algebraic, and logic approaches for specifying sequential systems and from Petri-nets, process algebras, automata, and graph grammars for specifying concurrent and distributed behaviors to semi-formal software engineering methods for developing complex systems. Formal and semi-formal approaches have their advantages and disadvantages: the informal diagrammatic methods are easier to understand and to apply but they can be ambiguous. Due to the different nature of the employed diagrams and descriptions it is often difficult to get a comprehensive view of all functional and dynamic properties. On the other hand, the formal approaches are more difficult to learn and require mathematical training. But they provide mathematical rigor for analysis and prototyping of designs. Verification is possible only with formal techniques. Since a few years many researchers and research groups are putting more and more effort in closing this gap by integrating semi-formal and formal specification techniques. Their studies and experiences show the added value of combining semi-formal and formal techniques and at the same time open a whole range of new problems and questions which cannot be asked when studying formalisms in isolation. In this seminar more than 40 scientists came together in 28 talks and two panel discussions to study possibilities and solutions for integrating and validating different formal and semi-formal specification techniques. Similarities and differences of formal and semi-formal specification formalisms as well as possibilities for combining such techniques were discussed. Most talks of this seminar analysed, compared, or integrated at least two such methods. On behalf of all participants the organizers would like to thank the staff of Schloss Dagstuhl for providing an excellent environment to the conference. The support of the TMR programme of the European Community is gratefully acknowledged. Due to this programme it was possible to fund the participation of several young researchers and of three key note speakers."}],"citation":{"ama":"Engels G, Ehrig H, Orejas F, Wirsing M, eds. <i>Semi-Formal and Formal Specification Techniques</i>. Vol 218. Schloss Dagstuhl, Leibniz Center for Informatics; 1998.","bibtex":"@book{Engels_Ehrig_Orejas_Wirsing_1998, series={Dagstuhl-Seminar-Report}, title={Semi-Formal and Formal Specification Techniques}, volume={218}, publisher={Schloss Dagstuhl, Leibniz Center for Informatics}, year={1998}, collection={Dagstuhl-Seminar-Report} }","mla":"Engels, Gregor, et al., editors. <i>Semi-Formal and Formal Specification Techniques</i>. Vol. 218, Schloss Dagstuhl, Leibniz Center for Informatics, 1998.","chicago":"Engels, Gregor, Hartmut Ehrig, Fernando Orejas, and M. Wirsing, eds. <i>Semi-Formal and Formal Specification Techniques</i>. Vol. 218. Dagstuhl-Seminar-Report. Schloss Dagstuhl, Leibniz Center for Informatics, 1998.","short":"G. Engels, H. Ehrig, F. Orejas, M. Wirsing, eds., Semi-Formal and Formal Specification Techniques, Schloss Dagstuhl, Leibniz Center for Informatics, 1998.","apa":"Engels, G., Ehrig, H., Orejas, F., &#38; Wirsing, M. (Eds.). (1998). <i>Semi-Formal and Formal Specification Techniques</i> (Vol. 218). Schloss Dagstuhl, Leibniz Center for Informatics.","ieee":"G. Engels, H. Ehrig, F. Orejas, and M. Wirsing, Eds., <i>Semi-Formal and Formal Specification Techniques</i>, vol. 218. Schloss Dagstuhl, Leibniz Center for Informatics, 1998."}},{"year":"1998","title":"6th International Workshop on Theory and Applications of Graph Transformations (TAGT '98), Paderborn, Selected Papers","status":"public","intvolume":"      1764","date_updated":"2022-01-06T07:03:46Z","_id":"7794","series_title":"LNCS","language":[{"iso":"eng"}],"publisher":"Springer","editor":[{"id":"107","last_name":"Engels","first_name":"Gregor","full_name":"Engels, Gregor"},{"full_name":"Ehrig, Hartmut","first_name":"Hartmut","last_name":"Ehrig"},{"first_name":"Hans-Jörg","last_name":"Kreowski","full_name":"Kreowski, Hans-Jörg"},{"first_name":"Grzegorz","last_name":"Rozenberg","full_name":"Rozenberg, Grzegorz"}],"volume":1764,"user_id":"52534","citation":{"mla":"Engels, Gregor, et al., editors. <i>6th International Workshop on Theory and Applications of Graph Transformations (TAGT ’98), Paderborn, Selected Papers</i>. Vol. 1764, Springer, 1998.","ama":"Engels G, Ehrig H, Kreowski H-J, Rozenberg G, eds. <i>6th International Workshop on Theory and Applications of Graph Transformations (TAGT ’98), Paderborn, Selected Papers</i>. Vol 1764. Berlin/Heidelberg: Springer; 1998.","bibtex":"@book{Engels_Ehrig_Kreowski_Rozenberg_1998, place={Berlin/Heidelberg}, series={LNCS}, title={6th International Workshop on Theory and Applications of Graph Transformations (TAGT ’98), Paderborn, Selected Papers}, volume={1764}, publisher={Springer}, year={1998}, collection={LNCS} }","apa":"Engels, G., Ehrig, H., Kreowski, H.-J., &#38; Rozenberg, G. (Eds.). (1998). <i>6th International Workshop on Theory and Applications of Graph Transformations (TAGT ’98), Paderborn, Selected Papers</i> (Vol. 1764). Berlin/Heidelberg: Springer.","ieee":"G. Engels, H. Ehrig, H.-J. Kreowski, and G. Rozenberg, Eds., <i>6th International Workshop on Theory and Applications of Graph Transformations (TAGT ’98), Paderborn, Selected Papers</i>, vol. 1764. Berlin/Heidelberg: Springer, 1998.","chicago":"Engels, Gregor, Hartmut Ehrig, Hans-Jörg Kreowski, and Grzegorz Rozenberg, eds. <i>6th International Workshop on Theory and Applications of Graph Transformations (TAGT ’98), Paderborn, Selected Papers</i>. Vol. 1764. LNCS. Berlin/Heidelberg: Springer, 1998.","short":"G. Engels, H. Ehrig, H.-J. Kreowski, G. Rozenberg, eds., 6th International Workshop on Theory and Applications of Graph Transformations (TAGT ’98), Paderborn, Selected Papers, Springer, Berlin/Heidelberg, 1998."},"place":"Berlin/Heidelberg","date_created":"2019-02-19T19:14:51Z","department":[{"_id":"66"}],"type":"conference_editor"},{"title":"Ein Ansatz zur Verbesserung des Entwicklungsprozesses von Multimedia-Anwendungen","year":"1998","status":"public","author":[{"full_name":"Depke, Ralph","last_name":"Depke","first_name":"Ralph"},{"full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels","id":"107"},{"full_name":"Mehner, Katharina","last_name":"Mehner","first_name":"Katharina"},{"full_name":"Sauer, Stefan","last_name":"Sauer","first_name":"Stefan","id":"447"},{"last_name":"Wagner","first_name":"Annika","full_name":"Wagner, Annika"}],"date_updated":"2022-01-06T07:03:47Z","intvolume":"        18","page":"12-19","publisher":"GI","_id":"7843","language":[{"iso":"eng"}],"user_id":"52534","volume":18,"publication":"Proceedings of the GI-Fachtagung on Softwaretechnik (1998), Paderborn (Germany)","issue":"3","citation":{"mla":"Depke, Ralph, et al. “Ein Ansatz Zur Verbesserung Des Entwicklungsprozesses von Multimedia-Anwendungen.” <i>Proceedings of the GI-Fachtagung on Softwaretechnik (1998), Paderborn (Germany)</i>, vol. 18, no. 3, GI, 1998, pp. 12–19.","ama":"Depke R, Engels G, Mehner K, Sauer S, Wagner A. Ein Ansatz zur Verbesserung des Entwicklungsprozesses von Multimedia-Anwendungen. In: <i>Proceedings of the GI-Fachtagung on Softwaretechnik (1998), Paderborn (Germany)</i>. Vol 18. GI; 1998:12-19.","bibtex":"@inproceedings{Depke_Engels_Mehner_Sauer_Wagner_1998, title={Ein Ansatz zur Verbesserung des Entwicklungsprozesses von Multimedia-Anwendungen}, volume={18}, number={3}, booktitle={Proceedings of the GI-Fachtagung on Softwaretechnik (1998), Paderborn (Germany)}, publisher={GI}, author={Depke, Ralph and Engels, Gregor and Mehner, Katharina and Sauer, Stefan and Wagner, Annika}, year={1998}, pages={12–19} }","apa":"Depke, R., Engels, G., Mehner, K., Sauer, S., &#38; Wagner, A. (1998). Ein Ansatz zur Verbesserung des Entwicklungsprozesses von Multimedia-Anwendungen. In <i>Proceedings of the GI-Fachtagung on Softwaretechnik (1998), Paderborn (Germany)</i> (Vol. 18, pp. 12–19). GI.","ieee":"R. Depke, G. Engels, K. Mehner, S. Sauer, and A. Wagner, “Ein Ansatz zur Verbesserung des Entwicklungsprozesses von Multimedia-Anwendungen,” in <i>Proceedings of the GI-Fachtagung on Softwaretechnik (1998), Paderborn (Germany)</i>, 1998, vol. 18, no. 3, pp. 12–19.","chicago":"Depke, Ralph, Gregor Engels, Katharina Mehner, Stefan Sauer, and Annika Wagner. “Ein Ansatz Zur Verbesserung Des Entwicklungsprozesses von Multimedia-Anwendungen.” In <i>Proceedings of the GI-Fachtagung on Softwaretechnik (1998), Paderborn (Germany)</i>, 18:12–19. GI, 1998.","short":"R. Depke, G. Engels, K. Mehner, S. Sauer, A. Wagner, in: Proceedings of the GI-Fachtagung on Softwaretechnik (1998), Paderborn (Germany), GI, 1998, pp. 12–19."},"date_created":"2019-02-20T14:09:54Z","type":"conference","department":[{"_id":"66"}]},{"type":"conference","department":[{"_id":"66"}],"date_created":"2019-02-20T14:10:57Z","publication":"Proceedings of the World Conference on Integrated Design and Process Technology (IDPT 1998), Berlin (Germany)","citation":{"apa":"Didrich, K., &#38; Wagner, A. (1998). Integration of Single Pushout Transformation and Functional Programming. In <i>Proceedings of the World Conference on Integrated Design and Process Technology (IDPT 1998), Berlin (Germany)</i> (Vol. 4, pp. 65–73). Society for Design and Process Science.","ieee":"K. Didrich and A. Wagner, “Integration of Single Pushout Transformation and Functional Programming,” in <i>Proceedings of the World Conference on Integrated Design and Process Technology (IDPT 1998), Berlin (Germany)</i>, 1998, vol. 4, pp. 65–73.","chicago":"Didrich, Klaus, and Annika Wagner. “Integration of Single Pushout Transformation and Functional Programming.” In <i>Proceedings of the World Conference on Integrated Design and Process Technology (IDPT 1998), Berlin (Germany)</i>, 4:65–73. Society for Design and Process Science, 1998.","short":"K. Didrich, A. Wagner, in: Proceedings of the World Conference on Integrated Design and Process Technology (IDPT 1998), Berlin (Germany), Society for Design and Process Science, 1998, pp. 65–73.","mla":"Didrich, Klaus, and Annika Wagner. “Integration of Single Pushout Transformation and Functional Programming.” <i>Proceedings of the World Conference on Integrated Design and Process Technology (IDPT 1998), Berlin (Germany)</i>, vol. 4, Society for Design and Process Science, 1998, pp. 65–73.","ama":"Didrich K, Wagner A. Integration of Single Pushout Transformation and Functional Programming. In: <i>Proceedings of the World Conference on Integrated Design and Process Technology (IDPT 1998), Berlin (Germany)</i>. Vol 4. Society for Design and Process Science; 1998:65-73.","bibtex":"@inproceedings{Didrich_Wagner_1998, title={Integration of Single Pushout Transformation and Functional Programming}, volume={4}, booktitle={Proceedings of the World Conference on Integrated Design and Process Technology (IDPT 1998), Berlin (Germany)}, publisher={Society for Design and Process Science}, author={Didrich, Klaus and Wagner, Annika}, year={1998}, pages={65–73} }"},"user_id":"52534","volume":4,"page":"65-73","publisher":"Society for Design and Process Science","_id":"7844","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:47Z","intvolume":"         4","year":"1998","status":"public","title":"Integration of Single Pushout Transformation and Functional Programming","author":[{"full_name":"Didrich, Klaus","first_name":"Klaus","last_name":"Didrich"},{"full_name":"Wagner, Annika","last_name":"Wagner","first_name":"Annika"}]}]