[{"page":"187-207","language":[{"iso":"eng"}],"_id":"19726","doi":"10.1016/s0167-8191(02)00218-1","user_id":"15415","status":"public","title":"The Paderborn University BSP (PUB) library","year":"2003","author":[{"full_name":"Bonorden, Olaf","last_name":"Bonorden","first_name":"Olaf"},{"first_name":"Bernhardus","last_name":"Juurlink","full_name":"Juurlink, Bernhardus"},{"full_name":"von Otte, Ingo","last_name":"von Otte","first_name":"Ingo"},{"full_name":"Rieping, Ingo","first_name":"Ingo","last_name":"Rieping"}],"publication_identifier":{"issn":["0167-8191"]},"date_updated":"2022-01-06T06:54:10Z","publication_status":"published","date_created":"2020-09-28T10:39:53Z","type":"journal_article","department":[{"_id":"63"}],"publication":"Parallel Computing","citation":{"apa":"Bonorden, O., Juurlink, B., von Otte, I., &#38; Rieping, I. (2003). The Paderborn University BSP (PUB) library. <i>Parallel Computing</i>, 187–207. <a href=\"https://doi.org/10.1016/s0167-8191(02)00218-1\">https://doi.org/10.1016/s0167-8191(02)00218-1</a>","ieee":"O. Bonorden, B. Juurlink, I. von Otte, and I. Rieping, “The Paderborn University BSP (PUB) library,” <i>Parallel Computing</i>, pp. 187–207, 2003.","short":"O. Bonorden, B. Juurlink, I. von Otte, I. Rieping, Parallel Computing (2003) 187–207.","chicago":"Bonorden, Olaf, Bernhardus Juurlink, Ingo von Otte, and Ingo Rieping. “The Paderborn University BSP (PUB) Library.” <i>Parallel Computing</i>, 2003, 187–207. <a href=\"https://doi.org/10.1016/s0167-8191(02)00218-1\">https://doi.org/10.1016/s0167-8191(02)00218-1</a>.","mla":"Bonorden, Olaf, et al. “The Paderborn University BSP (PUB) Library.” <i>Parallel Computing</i>, 2003, pp. 187–207, doi:<a href=\"https://doi.org/10.1016/s0167-8191(02)00218-1\">10.1016/s0167-8191(02)00218-1</a>.","ama":"Bonorden O, Juurlink B, von Otte I, Rieping I. The Paderborn University BSP (PUB) library. <i>Parallel Computing</i>. 2003:187-207. doi:<a href=\"https://doi.org/10.1016/s0167-8191(02)00218-1\">10.1016/s0167-8191(02)00218-1</a>","bibtex":"@article{Bonorden_Juurlink_von Otte_Rieping_2003, title={The Paderborn University BSP (PUB) library}, DOI={<a href=\"https://doi.org/10.1016/s0167-8191(02)00218-1\">10.1016/s0167-8191(02)00218-1</a>}, journal={Parallel Computing}, author={Bonorden, Olaf and Juurlink, Bernhardus and von Otte, Ingo and Rieping, Ingo}, year={2003}, pages={187–207} }"},"abstract":[{"lang":"eng","text":"The Paderborn University BSP (PUB) library is a C communication library based on the BSP model. The basic library supports buffered as well as unbuffered non-blocking communication between any pair of processors and a mechanism for synchronizing the processors in a barrier style. In addition, PUB provides non-blocking collective communication operations on arbitrary subsets of processors, the ability to partition the processors into independent groups that execute asynchronously from each other, 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."}]},{"volume":2625,"user_id":"15415","doi":"10.1007/3-540-36574-5_12","language":[{"iso":"eng"}],"_id":"19785","intvolume":"      2625","publication_status":"published","date_updated":"2022-01-06T06:54:12Z","author":[{"full_name":"Salzwedel, Kay A.","last_name":"Salzwedel","first_name":"Kay A."}],"publication_identifier":{"issn":["0302-9743"],"isbn":["9783540008835","9783540365747"]},"status":"public","title":"Algorithmic Approaches for Storage Networks","year":"2003","department":[{"_id":"63"}],"type":"journal_article","date_created":"2020-09-30T10:27:11Z","citation":{"ieee":"K. A. Salzwedel, “Algorithmic Approaches for Storage Networks,” <i>Algorithms for Memory Hierarchies</i>, vol. 2625, 2003.","apa":"Salzwedel, K. A. (2003). Algorithmic Approaches for Storage Networks. <i>Algorithms for Memory Hierarchies</i>, <i>2625</i>. <a href=\"https://doi.org/10.1007/3-540-36574-5_12\">https://doi.org/10.1007/3-540-36574-5_12</a>","mla":"Salzwedel, Kay A. “Algorithmic Approaches for Storage Networks.” <i>Algorithms for Memory Hierarchies</i>, vol. 2625, 2003, doi:<a href=\"https://doi.org/10.1007/3-540-36574-5_12\">10.1007/3-540-36574-5_12</a>.","bibtex":"@article{Salzwedel_2003, title={Algorithmic Approaches for Storage Networks}, volume={2625}, DOI={<a href=\"https://doi.org/10.1007/3-540-36574-5_12\">10.1007/3-540-36574-5_12</a>}, journal={Algorithms for Memory Hierarchies}, author={Salzwedel, Kay A.}, year={2003} }","chicago":"Salzwedel, Kay A. “Algorithmic Approaches for Storage Networks.” <i>Algorithms for Memory Hierarchies</i> 2625 (2003). <a href=\"https://doi.org/10.1007/3-540-36574-5_12\">https://doi.org/10.1007/3-540-36574-5_12</a>.","ama":"Salzwedel KA. Algorithmic Approaches for Storage Networks. <i>Algorithms for Memory Hierarchies</i>. 2003;2625. doi:<a href=\"https://doi.org/10.1007/3-540-36574-5_12\">10.1007/3-540-36574-5_12</a>","short":"K.A. Salzwedel, Algorithms for Memory Hierarchies 2625 (2003)."},"publication":"Algorithms for Memory Hierarchies"},{"file":[{"creator":"koala","date_created":"2020-09-30T12:03:57Z","date_updated":"2020-09-30T12:03:57Z","relation":"main_file","file_size":499057,"access_level":"closed","file_name":"pub-hni-908.pdf","content_type":"application/pdf","success":1,"file_id":"19793"}],"date_created":"2020-09-30T12:04:14Z","type":"conference","department":[{"_id":"63"},{"_id":"58"},{"_id":"79"}],"file_date_updated":"2020-09-30T12:03:57Z","publication":"Proceedings of SSGRR 2003","citation":{"short":"C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, U. Rückert, in: Proceedings of SSGRR 2003, 2003.","chicago":"Scheideler, Christian, Kay Salzwedel, Friedhelm Meyer auf der Heide, André Brinkmann, Mario Vodisek, and Ulrich Rückert. “Storage Management as Means to Cope with Exponential Information Growth.” In <i>Proceedings of SSGRR 2003</i>, 2003.","ieee":"C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, and U. Rückert, “Storage Management as Means to cope with Exponential Information Growth,” in <i>Proceedings of SSGRR 2003</i>, 2003.","apa":"Scheideler, C., Salzwedel, K., Meyer auf der Heide, F., Brinkmann, A., Vodisek, M., &#38; Rückert, U. (2003). Storage Management as Means to cope with Exponential Information Growth. In <i>Proceedings of SSGRR 2003</i>.","bibtex":"@inproceedings{Scheideler_Salzwedel_Meyer auf der Heide_Brinkmann_Vodisek_Rückert_2003, title={Storage Management as Means to cope with Exponential Information Growth}, booktitle={Proceedings of SSGRR 2003}, author={Scheideler, Christian and Salzwedel, Kay and Meyer auf der Heide, Friedhelm and Brinkmann, André and Vodisek, Mario and Rückert, Ulrich}, year={2003} }","ama":"Scheideler C, Salzwedel K, Meyer auf der Heide F, Brinkmann A, Vodisek M, Rückert U. Storage Management as Means to cope with Exponential Information Growth. In: <i>Proceedings of SSGRR 2003</i>. ; 2003.","mla":"Scheideler, Christian, et al. “Storage Management as Means to Cope with Exponential Information Growth.” <i>Proceedings of SSGRR 2003</i>, 2003."},"abstract":[{"text":"The advances in Internet technology have led to tremendous improvements in business, education, and science and have changed the way we think, live, and communicate. Information exchange has become ubiquitous by the possibilities offered through modern technologies. We are able to offer information 24 hours a day through our web sites and can leave messages every time and from anywhere in the world. This change in communication has led to new challenges. Enterprises have to deal with an information amount that doubles every year. The technological foundation to cope with this information explosion is given by Storage Area Networks (SANs), which are able to connect a great number of storage systems over a fast interconnection network. However, to be able to use the benefits of a SAN, an easy-to-use and efficient management support has to be given to the storage administrator. In this paper, we will suggest new storage management concepts and we will introduce a new management environment that is able to significantly reduce management costs and increases the performance and resource utilization of the given SAN infrastructure.","lang":"eng"}],"language":[{"iso":"eng"}],"_id":"19790","user_id":"15415","ddc":["000"],"year":"2003","status":"public","title":"Storage Management as Means to cope with Exponential Information Growth","author":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"full_name":"Salzwedel, Kay","first_name":"Kay","last_name":"Salzwedel"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Brinkmann, André","last_name":"Brinkmann","first_name":"André"},{"full_name":"Vodisek, Mario","last_name":"Vodisek","first_name":"Mario"},{"first_name":"Ulrich","last_name":"Rückert","full_name":"Rückert, Ulrich"}],"date_updated":"2022-01-06T06:54:12Z","has_accepted_license":"1"},{"author":[{"full_name":"Rührup, Stefan","first_name":"Stefan","last_name":"Rührup"},{"first_name":"Christian ","last_name":"Schindelhauer","full_name":"Schindelhauer, Christian "},{"last_name":"Volbert","first_name":"Klaus","full_name":"Volbert, Klaus"},{"first_name":"M.","last_name":"Grünewald","full_name":"Grünewald, M."}],"publication_identifier":{"isbn":["0769519261"]},"status":"public","title":"Performance of distributed algorithms for topology control in wireless networks","year":"2003","date_updated":"2022-01-06T06:54:13Z","publication_status":"published","_id":"19806","language":[{"iso":"eng"}],"doi":"10.1109/ipdps.2003.1213107","user_id":"15415","citation":{"chicago":"Rührup, Stefan, Christian  Schindelhauer, Klaus Volbert, and M. Grünewald. “Performance of Distributed Algorithms for Topology Control in Wireless Networks.” In <i>Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2003. <a href=\"https://doi.org/10.1109/ipdps.2003.1213107\">https://doi.org/10.1109/ipdps.2003.1213107</a>.","short":"S. Rührup, C. Schindelhauer, K. Volbert, M. Grünewald, in: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), 2003.","ieee":"S. Rührup, C. Schindelhauer, K. Volbert, and M. Grünewald, “Performance of distributed algorithms for topology control in wireless networks,” 2003, doi: <a href=\"https://doi.org/10.1109/ipdps.2003.1213107\">10.1109/ipdps.2003.1213107</a>.","apa":"Rührup, S., Schindelhauer, C., Volbert, K., &#38; Grünewald, M. (2003). Performance of distributed algorithms for topology control in wireless networks. <i>Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS)</i>. <a href=\"https://doi.org/10.1109/ipdps.2003.1213107\">https://doi.org/10.1109/ipdps.2003.1213107</a>","bibtex":"@inproceedings{Rührup_Schindelhauer_Volbert_Grünewald_2003, title={Performance of distributed algorithms for topology control in wireless networks}, DOI={<a href=\"https://doi.org/10.1109/ipdps.2003.1213107\">10.1109/ipdps.2003.1213107</a>}, booktitle={Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS)}, author={Rührup, Stefan and Schindelhauer, Christian  and Volbert, Klaus and Grünewald, M.}, year={2003} }","ama":"Rührup S, Schindelhauer C, Volbert K, Grünewald M. Performance of distributed algorithms for topology control in wireless networks. In: <i>Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS)</i>. ; 2003. doi:<a href=\"https://doi.org/10.1109/ipdps.2003.1213107\">10.1109/ipdps.2003.1213107</a>","mla":"Rührup, Stefan, et al. “Performance of Distributed Algorithms for Topology Control in Wireless Networks.” <i>Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2003, doi:<a href=\"https://doi.org/10.1109/ipdps.2003.1213107\">10.1109/ipdps.2003.1213107</a>."},"publication":"Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS)","abstract":[{"text":"We try to close the gap between theoretical investigations of wireless network topologies and realistic wireless environments. For point-to-point communication, we examine theoretically well-analyzed sparse graphs, i.e. the Yao-graph, the SparsY-graph, and the SymmY-graph.  We present distributed algorithms that can be used to build up these graphs in time $O(log n)$ per node without the use of any geo-graphical positioning system. Our algorithms are based only on local knowledge and local decisions and make use of power control to establish communication links with low energy-cost.  We compare these algorithms with respect to congestion, dilation, and energy. For congestion we introduce different measures that allow us to investigate the difference between real-world wireless networks and models for wireless communication at a high level of abstraction. For more realistic simulations we extend our simulation  environment SAHNE. We use a realistic transmission model for directed communication that uses sector subdivision.  Finally, our experimental results show that our topologies and algorithms work well in a distributed environment and we give some recommendations for the topology control based on our simulations.","lang":"eng"}],"date_created":"2020-09-30T12:51:22Z","department":[{"_id":"63"},{"_id":"58"}],"type":"conference"},{"date_updated":"2022-01-06T06:54:13Z","author":[{"full_name":"Mahlmann, Peter","first_name":"Peter","last_name":"Mahlmann"}],"year":"2003","title":"Implementierung und Vergleich von Verfahren zum Information Retrieval im World Wide Web","status":"public","user_id":"15415","language":[{"iso":"eng"}],"_id":"19828","citation":{"short":"P. Mahlmann, Implementierung Und Vergleich von Verfahren Zum Information Retrieval Im World Wide Web, 2003.","ama":"Mahlmann P. <i>Implementierung Und Vergleich von Verfahren Zum Information Retrieval Im World Wide Web</i>.; 2003.","chicago":"Mahlmann, Peter. <i>Implementierung Und Vergleich von Verfahren Zum Information Retrieval Im World Wide Web</i>, 2003.","bibtex":"@book{Mahlmann_2003, title={Implementierung und Vergleich von Verfahren zum Information Retrieval im World Wide Web}, author={Mahlmann, Peter}, year={2003} }","mla":"Mahlmann, Peter. <i>Implementierung Und Vergleich von Verfahren Zum Information Retrieval Im World Wide Web</i>. 2003.","apa":"Mahlmann, P. (2003). <i>Implementierung und Vergleich von Verfahren zum Information Retrieval im World Wide Web</i>.","ieee":"P. Mahlmann, <i>Implementierung und Vergleich von Verfahren zum Information Retrieval im World Wide Web</i>. 2003."},"department":[{"_id":"63"}],"type":"mastersthesis","date_created":"2020-10-01T09:55:38Z"},{"page":"113-122","_id":"19833","language":[{"iso":"eng"}],"user_id":"15415","year":"2003","title":"Directed power-variable infrared communication for the mini robot Khepera","status":"public","author":[{"full_name":"Volbert, Klaus","first_name":"Klaus","last_name":"Volbert"},{"first_name":"Matthias","last_name":"Grünewald","full_name":"Grünewald, Matthias"},{"full_name":"Schindelhauer, Christian","first_name":"Christian","last_name":"Schindelhauer"},{"full_name":"Rückert, Ulrich","last_name":"Rückert","first_name":"Ulrich"}],"date_updated":"2022-01-06T06:54:13Z","date_created":"2020-10-01T11:20:47Z","type":"conference","department":[{"_id":"63"},{"_id":"58"}],"publication":"Proceedings of the 2nd International Conference on Autonomous Minirobots for Research and Edutainment","citation":{"bibtex":"@inproceedings{Volbert_Grünewald_Schindelhauer_Rückert_2003, title={Directed power-variable infrared communication for the mini robot Khepera}, booktitle={Proceedings of the 2nd International Conference on Autonomous Minirobots for Research and Edutainment}, author={Volbert, Klaus and Grünewald, Matthias and Schindelhauer, Christian and Rückert, Ulrich}, year={2003}, pages={113–122} }","ama":"Volbert K, Grünewald M, Schindelhauer C, Rückert U. Directed power-variable infrared communication for the mini robot Khepera. In: <i>Proceedings of the 2nd International Conference on Autonomous Minirobots for Research and Edutainment</i>. ; 2003:113-122.","mla":"Volbert, Klaus, et al. “Directed Power-Variable Infrared Communication for the Mini Robot Khepera.” <i>Proceedings of the 2nd International Conference on Autonomous Minirobots for Research and Edutainment</i>, 2003, pp. 113–22.","chicago":"Volbert, Klaus, Matthias Grünewald, Christian Schindelhauer, and Ulrich Rückert. “Directed Power-Variable Infrared Communication for the Mini Robot Khepera.” In <i>Proceedings of the 2nd International Conference on Autonomous Minirobots for Research and Edutainment</i>, 113–22, 2003.","short":"K. Volbert, M. Grünewald, C. Schindelhauer, U. Rückert, in: Proceedings of the 2nd International Conference on Autonomous Minirobots for Research and Edutainment, 2003, pp. 113–122.","ieee":"K. Volbert, M. Grünewald, C. Schindelhauer, and U. Rückert, “Directed power-variable infrared communication for the mini robot Khepera,” in <i>Proceedings of the 2nd International Conference on Autonomous Minirobots for Research and Edutainment</i>, 2003, pp. 113–122.","apa":"Volbert, K., Grünewald, M., Schindelhauer, C., &#38; Rückert, U. (2003). Directed power-variable infrared communication for the mini robot Khepera. In <i>Proceedings of the 2nd International Conference on Autonomous Minirobots for Research and Edutainment</i> (pp. 113–122)."},"abstract":[{"text":"Communication facilities are important in Robotics if several robots have to work together. In this paper, we describe problems and solutions encountered while designing an infrared-based communication device for the mini robot Khepera. In contrast to traditional omnidirectional systems, it features directed, power-variable transmission in eight directions at unit[23.4]kbps up to a range of unit[1m]. It can differentiate incoming data signals from interference from adjacent sectors and can estimate their direction-of-arrival. We model the transmission over the infrared channel and show how interference influences the reception of the data signals. We also describe methods how to reduce these effects. We have tested the performance of the resulted signal processing in a worst case scenario by simulations and in experiments with a prototype implementation. The resulted module is  especially suited for experimental evaluation of ad hoc network protocols and for position estimation.","lang":"eng"}]},{"page":"37-45","language":[{"iso":"eng"}],"_id":"19874","user_id":"15415","title":"ADB-Trees: Controlling the Error of Time-Critical Collision Detection","status":"public","year":"2003","author":[{"first_name":"Jan","last_name":"Klein","full_name":"Klein, Jan"},{"last_name":"Zachmann","first_name":"Gabriel","full_name":"Zachmann, Gabriel"}],"date_updated":"2022-01-06T06:54:14Z","date_created":"2020-10-05T10:30:07Z","type":"conference","department":[{"_id":"63"}],"publication":"Proc. 8th International Fall Workshop Vision, Modeling, and Visualization (VMV 2003)","citation":{"mla":"Klein, Jan, and Gabriel Zachmann. “ADB-Trees: Controlling the Error of Time-Critical Collision Detection.” <i>Proc. 8th International Fall Workshop Vision, Modeling, and Visualization (VMV 2003)</i>, 2003, pp. 37–45.","ama":"Klein J, Zachmann G. ADB-Trees: Controlling the Error of Time-Critical Collision Detection. In: <i>Proc. 8th International Fall Workshop Vision, Modeling, and Visualization (VMV 2003)</i>. ; 2003:37-45.","bibtex":"@inproceedings{Klein_Zachmann_2003, title={ADB-Trees: Controlling the Error of Time-Critical Collision Detection}, booktitle={Proc. 8th International Fall Workshop Vision, Modeling, and Visualization (VMV 2003)}, author={Klein, Jan and Zachmann, Gabriel}, year={2003}, pages={37–45} }","apa":"Klein, J., &#38; Zachmann, G. (2003). ADB-Trees: Controlling the Error of Time-Critical Collision Detection. In <i>Proc. 8th International Fall Workshop Vision, Modeling, and Visualization (VMV 2003)</i> (pp. 37–45).","ieee":"J. Klein and G. Zachmann, “ADB-Trees: Controlling the Error of Time-Critical Collision Detection,” in <i>Proc. 8th International Fall Workshop Vision, Modeling, and Visualization (VMV 2003)</i>, 2003, pp. 37–45.","chicago":"Klein, Jan, and Gabriel Zachmann. “ADB-Trees: Controlling the Error of Time-Critical Collision Detection.” In <i>Proc. 8th International Fall Workshop Vision, Modeling, and Visualization (VMV 2003)</i>, 37–45, 2003.","short":"J. Klein, G. Zachmann, in: Proc. 8th International Fall Workshop Vision, Modeling, and Visualization (VMV 2003), 2003, pp. 37–45."},"abstract":[{"text":"We present a novel framework for hierarchical collision detection that can be applied to virtually all bounding volume (BV) hierarchies. It allows an application to trade quality for speed. Our algorithm yields an estimation of the quality, so that applications can specify the desired quality. In a timecritical system, applications can specify the maximum time budget instead, and quantitatively assess the quality of the results returned by the collision detection afterwards.","lang":"eng"}]},{"publication":" Proc. ACM Symposium on Virtual Reality Software and Technology (VRST 2003)","citation":{"ama":"Klein J,  Zachmann G. Time-Critical Collision Detection Using an Average-Case Approach. In: <i> Proc. ACM Symposium on Virtual Reality Software and Technology (VRST 2003)</i>. ; 2003:22-31. doi:<a href=\"https://doi.org/10.1145/1008653.1008660\">10.1145/1008653.1008660</a>","bibtex":"@inproceedings{Klein_ Zachmann_2003, title={Time-Critical Collision Detection Using an Average-Case Approach}, DOI={<a href=\"https://doi.org/10.1145/1008653.1008660\">10.1145/1008653.1008660</a>}, booktitle={ Proc. ACM Symposium on Virtual Reality Software and Technology (VRST 2003)}, author={Klein, Jan and  Zachmann, Gabriel}, year={2003}, pages={22–31} }","mla":"Klein, Jan, and Gabriel  Zachmann. “Time-Critical Collision Detection Using an Average-Case Approach.” <i> Proc. ACM Symposium on Virtual Reality Software and Technology (VRST 2003)</i>, 2003, pp. 22–31, doi:<a href=\"https://doi.org/10.1145/1008653.1008660\">10.1145/1008653.1008660</a>.","short":"J. Klein, G.  Zachmann, in:  Proc. ACM Symposium on Virtual Reality Software and Technology (VRST 2003), 2003, pp. 22–31.","chicago":"Klein, Jan, and Gabriel  Zachmann. “Time-Critical Collision Detection Using an Average-Case Approach.” In <i> Proc. ACM Symposium on Virtual Reality Software and Technology (VRST 2003)</i>, 22–31, 2003. <a href=\"https://doi.org/10.1145/1008653.1008660\">https://doi.org/10.1145/1008653.1008660</a>.","apa":"Klein, J., &#38;  Zachmann, G. (2003). Time-Critical Collision Detection Using an Average-Case Approach. In <i> Proc. ACM Symposium on Virtual Reality Software and Technology (VRST 2003)</i> (pp. 22–31). <a href=\"https://doi.org/10.1145/1008653.1008660\">https://doi.org/10.1145/1008653.1008660</a>","ieee":"J. Klein and G.  Zachmann, “Time-Critical Collision Detection Using an Average-Case Approach,” in <i> Proc. ACM Symposium on Virtual Reality Software and Technology (VRST 2003)</i>, 2003, pp. 22–31."},"date_created":"2020-10-06T08:31:35Z","type":"conference","department":[{"_id":"63"}],"year":"2003","title":"Time-Critical Collision Detection Using an Average-Case Approach","status":"public","author":[{"first_name":"Jan","last_name":"Klein","full_name":"Klein, Jan"},{"last_name":" Zachmann","first_name":"Gabriel","full_name":" Zachmann, Gabriel"}],"date_updated":"2022-01-06T06:54:14Z","page":"22-31","_id":"19900","language":[{"iso":"eng"}],"doi":"10.1145/1008653.1008660","user_id":"15415"},{"language":[{"iso":"eng"}],"_id":"19952","doi":"10.1137/s0097539702419649","user_id":"15415","title":"Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up","year":"2003","status":"public","author":[{"full_name":"Fomin, Fedor V.","last_name":"Fomin","first_name":"Fedor V."},{"full_name":"Thilikos, Dimitrios M.","first_name":"Dimitrios M.","last_name":"Thilikos"}],"publication_identifier":{"issn":["0097-5397","1095-7111"]},"date_updated":"2022-01-06T06:54:16Z","publication_status":"published","date_created":"2020-10-08T10:31:48Z","type":"conference","department":[{"_id":"63"}],"publication":"Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)","citation":{"ieee":"F. V. Fomin and D. M. Thilikos, “Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up,” in <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>, 2003.","apa":"Fomin, F. V., &#38; Thilikos, D. M. (2003). Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up. In <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>. <a href=\"https://doi.org/10.1137/s0097539702419649\">https://doi.org/10.1137/s0097539702419649</a>","short":"F.V. Fomin, D.M. Thilikos, in: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 2003.","chicago":"Fomin, Fedor V., and Dimitrios M. Thilikos. “Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up.” In <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>, 2003. <a href=\"https://doi.org/10.1137/s0097539702419649\">https://doi.org/10.1137/s0097539702419649</a>.","mla":"Fomin, Fedor V., and Dimitrios M. Thilikos. “Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up.” <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>, 2003, doi:<a href=\"https://doi.org/10.1137/s0097539702419649\">10.1137/s0097539702419649</a>.","bibtex":"@inproceedings{Fomin_Thilikos_2003, title={Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up}, DOI={<a href=\"https://doi.org/10.1137/s0097539702419649\">10.1137/s0097539702419649</a>}, booktitle={Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)}, author={Fomin, Fedor V. and Thilikos, Dimitrios M.}, year={2003} }","ama":"Fomin FV, Thilikos DM. Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up. In: <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>. ; 2003. doi:<a href=\"https://doi.org/10.1137/s0097539702419649\">10.1137/s0097539702419649</a>"},"abstract":[{"text":"Graph minors theory, developed by Robertson & Seymour, provides a list of powerful theoretical results and tools. However, the wide spread opinion in Graph Algorithms community about this theory is that it is mainly of theoretical importance. The main purpose of this paper is to show how very deep min-max and duality theorems from Graph Minors can be used to obtain essential speed-up to many known algorithms on different domination problems.","lang":"eng"}]},{"publication":"Proceedings of 5. GI-Informatiktage 2003","citation":{"ama":"Terbahl M, Krokowski J. Verteiltes Rendern durch dynamische Bildaufteilung. In: <i>Proceedings of 5. GI-Informatiktage 2003</i>. ; 2003.","bibtex":"@inproceedings{Terbahl_Krokowski_2003, place={Bad Schussenried, Germany}, title={Verteiltes Rendern durch dynamische Bildaufteilung}, booktitle={Proceedings of 5. GI-Informatiktage 2003}, author={Terbahl, Martina and Krokowski, Jens}, year={2003} }","mla":"Terbahl, Martina, and Jens Krokowski. “Verteiltes Rendern Durch Dynamische Bildaufteilung.” <i>Proceedings of 5. GI-Informatiktage 2003</i>, 2003.","chicago":"Terbahl, Martina, and Jens Krokowski. “Verteiltes Rendern Durch Dynamische Bildaufteilung.” In <i>Proceedings of 5. GI-Informatiktage 2003</i>. Bad Schussenried, Germany, 2003.","short":"M. Terbahl, J. Krokowski, in: Proceedings of 5. GI-Informatiktage 2003, Bad Schussenried, Germany, 2003.","apa":"Terbahl, M., &#38; Krokowski, J. (2003). Verteiltes Rendern durch dynamische Bildaufteilung. <i>Proceedings of 5. GI-Informatiktage 2003</i>.","ieee":"M. Terbahl and J. Krokowski, “Verteiltes Rendern durch dynamische Bildaufteilung,” 2003."},"place":"Bad Schussenried, Germany","date_created":"2021-09-13T12:06:43Z","type":"conference","department":[{"_id":"63"}],"status":"public","title":"Verteiltes Rendern durch dynamische Bildaufteilung","year":"2003","author":[{"full_name":"Terbahl, Martina","first_name":"Martina","last_name":"Terbahl"},{"full_name":"Krokowski, Jens","first_name":"Jens","last_name":"Krokowski"}],"date_updated":"2022-01-06T06:56:13Z","_id":"24273","language":[{"iso":"eng"}],"user_id":"15415"},{"citation":{"short":"M. Ziegler, in: Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA, 2003, pp. 47–64.","chicago":"Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.” In <i>Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA</i>, 47–64, 2003.","ieee":"M. Ziegler, “Stability versus Speed in a Computable Algebraic Model,” in <i>Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA</i>, 2003, pp. 47–64.","apa":"Ziegler, M. (2003). Stability versus Speed in a Computable Algebraic Model. <i>Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA</i>, 47–64.","bibtex":"@inproceedings{Ziegler_2003, title={Stability versus Speed in a Computable Algebraic Model}, booktitle={Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA}, author={Ziegler, Martin}, year={2003}, pages={47–64} }","ama":"Ziegler M. Stability versus Speed in a Computable Algebraic Model. In: <i>Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA</i>. ; 2003:47-64.","mla":"Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.” <i>Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA</i>, 2003, pp. 47–64."},"publication":"Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA","date_created":"2021-10-15T11:00:14Z","department":[{"_id":"63"},{"_id":"26"}],"type":"conference","author":[{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"}],"title":"Stability versus Speed in a Computable Algebraic Model","status":"public","year":"2003","date_updated":"2022-01-06T06:57:18Z","language":[{"iso":"eng"}],"_id":"26263","page":"47-64","user_id":"15415"},{"date_created":"2021-10-15T12:13:22Z","department":[{"_id":"63"},{"_id":"26"}],"type":"conference","citation":{"mla":"Ziegler, Martin. “Computable Operators on Regular Sets.” <i>Computability and Complexity in Analysis</i>, vol. 302-8/2003, 2003, pp. 389–406.","ama":"Ziegler M. Computable Operators on Regular Sets. In: <i>Computability and Complexity in Analysis</i>. Vol 302-8/2003. Informatik Berichte. ; 2003:389-406.","bibtex":"@inproceedings{Ziegler_2003, series={Informatik Berichte}, title={Computable Operators on Regular Sets}, volume={302–8/2003}, booktitle={Computability and Complexity in Analysis}, author={Ziegler, Martin}, year={2003}, pages={389–406}, collection={Informatik Berichte} }","apa":"Ziegler, M. (2003). Computable Operators on Regular Sets. <i>Computability and Complexity in Analysis</i>, <i>302-8/2003</i>, 389–406.","ieee":"M. Ziegler, “Computable Operators on Regular Sets,” in <i>Computability and Complexity in Analysis</i>, 2003, vol. 302–8/2003, pp. 389–406.","chicago":"Ziegler, Martin. “Computable Operators on Regular Sets.” In <i>Computability and Complexity in Analysis</i>, 302-8/2003:389–406. Informatik Berichte, 2003.","short":"M. Ziegler, in: Computability and Complexity in Analysis, 2003, pp. 389–406."},"publication":"Computability and Complexity in Analysis","_id":"26277","series_title":"Informatik Berichte","language":[{"iso":"eng"}],"page":"389-406","volume":"302-8/2003","user_id":"15415","author":[{"last_name":"Ziegler","first_name":"Martin","full_name":"Ziegler, Martin"}],"title":"Computable Operators on Regular Sets","year":"2003","status":"public","date_updated":"2022-01-06T06:57:18Z"},{"publication":"ESA","citation":{"mla":"Damerow, Valentina, et al. “Smoothed Motion Complexity.” <i>ESA</i>, vol. 2832, Springer, 2003, pp. 161--171, doi:<a href=\"https://doi.org/10.1007/978-3-540-39658-1_17\">10.1007/978-3-540-39658-1_17</a>.","ama":"Damerow V, Meyer auf der Heide F, Räcke H, Scheideler C, Sohler C. Smoothed Motion Complexity. In: <i>ESA</i>. Vol 2832. Lecture Notes in Computer Science. Springer; 2003:161--171. doi:<a href=\"https://doi.org/10.1007/978-3-540-39658-1_17\">10.1007/978-3-540-39658-1_17</a>","bibtex":"@inproceedings{Damerow_Meyer auf der Heide_Räcke_Scheideler_Sohler_2003, series={Lecture Notes in Computer Science}, title={Smoothed Motion Complexity}, volume={2832}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-39658-1_17\">10.1007/978-3-540-39658-1_17</a>}, booktitle={ESA}, publisher={Springer}, author={Damerow, Valentina and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian}, year={2003}, pages={161--171}, collection={Lecture Notes in Computer Science} }","apa":"Damerow, V., Meyer auf der Heide, F., Räcke, H., Scheideler, C., &#38; Sohler, C. (2003). Smoothed Motion Complexity. In <i>ESA</i> (Vol. 2832, pp. 161--171). Springer. <a href=\"https://doi.org/10.1007/978-3-540-39658-1_17\">https://doi.org/10.1007/978-3-540-39658-1_17</a>","ieee":"V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, and C. Sohler, “Smoothed Motion Complexity,” in <i>ESA</i>, 2003, vol. 2832, pp. 161--171.","short":"V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, in: ESA, Springer, 2003, pp. 161--171.","chicago":"Damerow, Valentina, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, and Christian Sohler. “Smoothed Motion Complexity.” In <i>ESA</i>, 2832:161--171. Lecture Notes in Computer Science. Springer, 2003. <a href=\"https://doi.org/10.1007/978-3-540-39658-1_17\">https://doi.org/10.1007/978-3-540-39658-1_17</a>."},"type":"conference","department":[{"_id":"79"},{"_id":"63"}],"date_created":"2018-04-03T05:37:10Z","date_updated":"2022-01-06T06:54:52Z","intvolume":"      2832","year":"2003","title":"Smoothed Motion Complexity","status":"public","author":[{"full_name":"Damerow, Valentina","last_name":"Damerow","first_name":"Valentina"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Räcke, Harald","last_name":"Räcke","first_name":"Harald"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"last_name":"Sohler","first_name":"Christian","full_name":"Sohler, Christian"}],"doi":"10.1007/978-3-540-39658-1_17","user_id":"14955","volume":2832,"page":"161--171","_id":"2128","language":[{"iso":"eng"}],"publisher":"Springer","series_title":"Lecture Notes in Computer Science"},{"publication":"ICALP","date_created":"2018-04-03T05:38:36Z","file":[{"relation":"main_file","date_updated":"2018-04-12T09:04:48Z","file_name":"ICALP-03.pdf","access_level":"open_access","file_size":154427,"file_id":"2307","content_type":"application/pdf","creator":"florida","date_created":"2018-04-12T09:04:48Z"}],"department":[{"_id":"79"},{"_id":"63"}],"type":"conference","author":[{"full_name":"Awerbuch, Baruch","last_name":"Awerbuch","first_name":"Baruch"},{"first_name":"André","last_name":"Brinkmann","full_name":"Brinkmann, André"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"title":"Anycasting in Adversarial Systems: Routing and Admission Control","year":"2003","intvolume":"      2719","date_updated":"2022-01-06T06:54:53Z","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"citation":{"chicago":"Awerbuch, Baruch, André Brinkmann, and Christian Scheideler. “Anycasting in Adversarial Systems: Routing and Admission Control.” In <i>ICALP</i>, 2719:1153--1168. Lecture Notes in Computer Science. Springer, 2003.","short":"B. Awerbuch, A. Brinkmann, C. Scheideler, in: ICALP, Springer, 2003, pp. 1153--1168.","apa":"Awerbuch, B., Brinkmann, A., &#38; Scheideler, C. (2003). Anycasting in Adversarial Systems: Routing and Admission Control. In <i>ICALP</i> (Vol. 2719, pp. 1153--1168). Springer.","ieee":"B. Awerbuch, A. Brinkmann, and C. Scheideler, “Anycasting in Adversarial Systems: Routing and Admission Control,” in <i>ICALP</i>, 2003, vol. 2719, pp. 1153--1168.","ama":"Awerbuch B, Brinkmann A, Scheideler C. Anycasting in Adversarial Systems: Routing and Admission Control. In: <i>ICALP</i>. Vol 2719. Lecture Notes in Computer Science. Springer; 2003:1153--1168.","bibtex":"@inproceedings{Awerbuch_Brinkmann_Scheideler_2003, series={Lecture Notes in Computer Science}, title={Anycasting in Adversarial Systems: Routing and Admission Control}, volume={2719}, booktitle={ICALP}, publisher={Springer}, author={Awerbuch, Baruch and Brinkmann, André and Scheideler, Christian}, year={2003}, pages={1153--1168}, collection={Lecture Notes in Computer Science} }","mla":"Awerbuch, Baruch, et al. “Anycasting in Adversarial Systems: Routing and Admission Control.” <i>ICALP</i>, vol. 2719, Springer, 2003, pp. 1153--1168."},"file_date_updated":"2018-04-12T09:04:48Z","oa":"1","status":"public","has_accepted_license":"1","_id":"2129","urn":"21297","publisher":"Springer","page":"1153--1168","volume":2719,"ddc":["040"],"user_id":"14955"},{"type":"conference","department":[{"_id":"63"}],"date_created":"2020-07-28T08:05:14Z","publication":"15th European Simulation Symposium (ESS 2003)","citation":{"chicago":"Mueck, Bengt, Wilhelm Dangelmaier, and Matthias Fischer. “Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment.” In <i>15th European Simulation Symposium (ESS 2003)</i>, 367–71. SCS - Europe, 2003.","short":"B. Mueck, W. Dangelmaier, M. Fischer, in: 15th European Simulation Symposium (ESS 2003), SCS - Europe, 2003, pp. 367–371.","apa":"Mueck, B., Dangelmaier, W., &#38; Fischer, M. (2003). Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment. In <i>15th European Simulation Symposium (ESS 2003)</i> (pp. 367–371). SCS - Europe.","ieee":"B. Mueck, W. Dangelmaier, and M. Fischer, “Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment,” in <i>15th European Simulation Symposium (ESS 2003)</i>, 2003, pp. 367–371.","ama":"Mueck B, Dangelmaier W, Fischer M. Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment. In: <i>15th European Simulation Symposium (ESS 2003)</i>. SCS - Europe; 2003:367-371.","bibtex":"@inproceedings{Mueck_Dangelmaier_Fischer_2003, title={Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment}, booktitle={15th European Simulation Symposium (ESS 2003)}, publisher={SCS - Europe}, author={Mueck, Bengt and Dangelmaier, Wilhelm and Fischer, Matthias}, year={2003}, pages={367–371} }","mla":"Mueck, Bengt, et al. “Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment.” <i>15th European Simulation Symposium (ESS 2003)</i>, SCS - Europe, 2003, pp. 367–71."},"user_id":"15415","page":"367-371","language":[{"iso":"eng"}],"_id":"17423","publisher":"SCS - Europe","date_updated":"2022-01-06T06:53:11Z","status":"public","title":"Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment","year":"2003","author":[{"first_name":"Bengt","last_name":"Mueck","full_name":"Mueck, Bengt"},{"full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier","first_name":"Wilhelm"},{"id":"146","full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"}]},{"user_id":"15415","page":"813–822","language":[{"iso":"eng"}],"_id":"18791","date_updated":"2022-01-06T06:53:52Z","year":"2003","title":"Sublinear Approximation of Euclidean Minimum Spanning Tree","status":"public","author":[{"last_name":"Magen","first_name":"Avner","full_name":"Magen, Avner"},{"full_name":"Ergun, Funda","last_name":"Ergun","first_name":"Funda"},{"full_name":"Sohler, Christian","last_name":"Sohler","first_name":"Christian"},{"last_name":"Rubinfeld","first_name":"Ronitt","full_name":"Rubinfeld, Ronitt"},{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"full_name":"Newman, Ilan","last_name":"Newman","first_name":"Ilan"},{"full_name":"Fortnow, Lance","last_name":"Fortnow","first_name":"Lance"}],"publication_identifier":{"isbn":["0898715385"]},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-09-01T14:15:33Z","abstract":[{"text":"We consider the problem of finding the weight of a Euclidean minimum spanning tree for a set of n points in ℝd. We focus on the situation when the input point set is supported by certain basic (and commonly used) geometric data structures that can provide efficient access to the input in a structured way. We present an algorithm that estimates with high probability the weight of a Euclidean minimum spanning tree of a set of points to within 1 + ε using only \\~{O}(√ poly(1/ε)) queries for constant d. The algorithm assumes that the input is supported by a minimal bounding cube enclosing it, by orthogonal range queries, and by cone approximate nearest neighbors queries.","lang":"eng"}],"publication":"Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)","citation":{"chicago":"Magen, Avner, Funda Ergun, Christian Sohler, Ronitt Rubinfeld, Artur Czumaj, Ilan Newman, and Lance Fortnow. “Sublinear Approximation of Euclidean Minimum Spanning Tree.” In <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>, 813–822, 2003.","short":"A. Magen, F. Ergun, C. Sohler, R. Rubinfeld, A. Czumaj, I. Newman, L. Fortnow, in: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 2003, pp. 813–822.","apa":"Magen, A., Ergun, F., Sohler, C., Rubinfeld, R., Czumaj, A., Newman, I., &#38; Fortnow, L. (2003). Sublinear Approximation of Euclidean Minimum Spanning Tree. In <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i> (pp. 813–822).","ieee":"A. Magen <i>et al.</i>, “Sublinear Approximation of Euclidean Minimum Spanning Tree,” in <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>, 2003, pp. 813–822.","ama":"Magen A, Ergun F, Sohler C, et al. Sublinear Approximation of Euclidean Minimum Spanning Tree. In: <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>. ; 2003:813–822.","bibtex":"@inproceedings{Magen_Ergun_Sohler_Rubinfeld_Czumaj_Newman_Fortnow_2003, title={Sublinear Approximation of Euclidean Minimum Spanning Tree}, booktitle={Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)}, author={Magen, Avner and Ergun, Funda and Sohler, Christian and Rubinfeld, Ronitt and Czumaj, Artur and Newman, Ilan and Fortnow, Lance}, year={2003}, pages={813–822} }","mla":"Magen, Avner, et al. “Sublinear Approximation of Euclidean Minimum Spanning Tree.” <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>, 2003, pp. 813–822."}},{"abstract":[{"text":"In a (randomized) oblivious routing scheme the path chosen for a request <br>between a source $s$ and a target $t$ is independent from the current traffic <br>in the network. Hence, such a scheme consists of probability distributions<br>over $s-t$ paths for every source-target pair $s,t$ in the network.<br><br>In a recent result citeR02 it was shown that for any undirected network <br>there is an oblivious routing scheme that achieves a polylogarithmic<br>competitive ratio with respect to congestion. Subsequently, Azar et <br>al. citeACF+03 gave a polynomial time algorithm that for a given network <br>constructs the best oblivious routing scheme, i.e. the scheme that guarantees<br>the best possible competitive ratio.  <br>Unfortunately, the latter result is based on the Ellipsoid algorithm; hence <br>it is unpractical for large networks. <br><br>In this paper we present a combinatorial algorithm for constructing an<br>oblivious routing scheme that guarantees a competitive ratio of $O(log^4n)$<br>for undirected networks. Furthermore, our approach yields a proof <br>for the existence of an oblivious routing scheme with competitive ratio<br>$O(log^3n)$, which is much simpler than the original proof from citeR02.","lang":"eng"}],"citation":{"mla":"Bienkowski, Marcin, et al. “A Practical Algorithm for Constructing Oblivious Routing Schemes.” <i>Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03</i>, 2003, doi:<a href=\"https://doi.org/10.1145/777412.777418\">10.1145/777412.777418</a>.","bibtex":"@inproceedings{Bienkowski_Korzeniowski_Räcke_2003, title={A practical algorithm for constructing oblivious routing schemes}, DOI={<a href=\"https://doi.org/10.1145/777412.777418\">10.1145/777412.777418</a>}, booktitle={Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03}, author={Bienkowski, Marcin and Korzeniowski, Miroslaw and Räcke, Harald}, year={2003} }","ama":"Bienkowski M, Korzeniowski M, Räcke H. A practical algorithm for constructing oblivious routing schemes. In: <i>Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03</i>. ; 2003. doi:<a href=\"https://doi.org/10.1145/777412.777418\">10.1145/777412.777418</a>","ieee":"M. Bienkowski, M. Korzeniowski, and H. Räcke, “A practical algorithm for constructing oblivious routing schemes,” in <i>Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03</i>, 2003.","apa":"Bienkowski, M., Korzeniowski, M., &#38; Räcke, H. (2003). A practical algorithm for constructing oblivious routing schemes. In <i>Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03</i>. <a href=\"https://doi.org/10.1145/777412.777418\">https://doi.org/10.1145/777412.777418</a>","chicago":"Bienkowski, Marcin, Miroslaw Korzeniowski, and Harald Räcke. “A Practical Algorithm for Constructing Oblivious Routing Schemes.” In <i>Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03</i>, 2003. <a href=\"https://doi.org/10.1145/777412.777418\">https://doi.org/10.1145/777412.777418</a>.","short":"M. Bienkowski, M. Korzeniowski, H. Räcke, in: Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03, 2003."},"publication":"Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA '03","department":[{"_id":"63"}],"type":"conference","date_created":"2020-09-03T07:44:01Z","date_updated":"2022-01-06T06:53:54Z","publication_status":"published","publication_identifier":{"isbn":["1581136617"]},"author":[{"full_name":"Bienkowski, Marcin","first_name":"Marcin","last_name":"Bienkowski"},{"first_name":"Miroslaw","last_name":"Korzeniowski","full_name":"Korzeniowski, Miroslaw"},{"last_name":"Räcke","first_name":"Harald","full_name":"Räcke, Harald"}],"status":"public","title":"A practical algorithm for constructing oblivious routing schemes","year":"2003","doi":"10.1145/777412.777418","user_id":"15415","_id":"18907","language":[{"iso":"eng"}]},{"abstract":[{"lang":"eng","text":"In this paper, we define a Petri net model for the network or routing layer of a mobile ad hoc network. Such networks require routing strategies substantially different from those used in static communication networks. The model pre- sented consists of two layers, a location service and a po- sition based routing. Both are described in detail. Our ap- proach considers a very strong definition of fault tolerance thereby improving state-of-the-art ad hoc routing protocols in several respects. Modeling of the communication archi- tecture for mobile ad hoc networks is part of our overall effort towards a design methodology for distributed embed- ded real-time systems including dynamically evolving com- ponents."}],"citation":{"chicago":"Rust, Carsten, Friedhelm Stappert, and Tamás Lukovszki. “A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture.” In <i>7th World Multiconference on Systemics, Cybernetics and Informatics</i>, 2003.","short":"C. Rust, F. Stappert, T. Lukovszki, in: 7th World Multiconference on Systemics, Cybernetics and Informatics, 2003.","apa":"Rust, C., Stappert, F., &#38; Lukovszki, T. (2003). A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture. In <i>7th World Multiconference on Systemics, Cybernetics and Informatics</i>.","ieee":"C. Rust, F. Stappert, and T. Lukovszki, “A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture,” in <i>7th World Multiconference on Systemics, Cybernetics and Informatics</i>, 2003.","ama":"Rust C, Stappert F, Lukovszki T. A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture. In: <i>7th World Multiconference on Systemics, Cybernetics and Informatics</i>. ; 2003.","bibtex":"@inproceedings{Rust_Stappert_Lukovszki_2003, title={A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture}, booktitle={7th World Multiconference on Systemics, Cybernetics and Informatics}, author={Rust, Carsten and Stappert, Friedhelm and Lukovszki, Tamás}, year={2003} }","mla":"Rust, Carsten, et al. “A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture.” <i>7th World Multiconference on Systemics, Cybernetics and Informatics</i>, 2003."},"publication":"7th World Multiconference on Systemics, Cybernetics and Informatics","department":[{"_id":"63"}],"type":"conference","date_created":"2020-09-03T11:50:06Z","date_updated":"2022-01-06T06:53:55Z","author":[{"last_name":"Rust","first_name":"Carsten","full_name":"Rust, Carsten"},{"first_name":"Friedhelm","last_name":"Stappert","full_name":"Stappert, Friedhelm"},{"full_name":"Lukovszki, Tamás","last_name":"Lukovszki","first_name":"Tamás"}],"status":"public","year":"2003","title":"A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture","user_id":"15415","language":[{"iso":"eng"}],"_id":"18947"},{"doi":"10.1145/777412.777448","user_id":"15415","language":[{"iso":"eng"}],"_id":"18960","date_updated":"2022-01-06T06:53:55Z","publication_status":"published","title":"Worst case mobility in ad hoc networks","year":"2003","status":"public","author":[{"last_name":"Schindelhauer","first_name":"Christian","full_name":"Schindelhauer, Christian"},{"first_name":"Tamás","last_name":"Lukovszki","full_name":"Lukovszki, Tamás"},{"full_name":"Rührup, Stefan","first_name":"Stefan","last_name":"Rührup"},{"full_name":"Volbert, Klaus","last_name":"Volbert","first_name":"Klaus"}],"publication_identifier":{"isbn":["1581136617"]},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-09-03T13:10:50Z","abstract":[{"text":"We investigate distributed algorithms for mobile ad hoc networks for   moving radio stations with adjustable transmission power in a worst   case scenario. We consider two models to find a reasonable   restriction on the worst-case mobility. In the pedestrian model we   assume a maximum speed $v_max$ of the radio stations, while in   the vehicular model we assume a maximum acceleration $a_max$ of   the points.      Our goal is to maintain persistent routes with nice communication   network properties like hop-distance, energy-consumption, congestion   and number of interferences. A route is persistent, if we can   guarantee that all edges of this route can be uphold for a given   time span $Delta$, which is a parameter denoting the minimum time   the mobile network needs to adopt changes, i.e. update routing   tables, change directory entries, etc. This $Delta$ can be used as   the length of an update interval for a proactive routing scheme.      We extend some known notions such as transmission range,   interferences, spanner, power spanner and congestion to both   mobility models and introduce a new parameter called crowdedness   that states a lower bound on the number of radio interferences. Then   we prove that a mobile spanner hosts a path system that   polylogarithmically approximates the optimal congestion.    We present distributed algorithms based on a grid clustering   technique and a high-dimensional representation of the dynamical   start situation which construct mobile spanners with low congestion,   low interference number, low energy-consumption, and low degree.  We   measure the optimality of the output of our algorithm by comparing   it with the optimal choice of persistent routes under the same   circumstances with respect to pedestrian or vehicular worst-case   movements. Finally, we present solutions for dynamic position   information management under our mobility models.","lang":"eng"}],"publication":"Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)","citation":{"bibtex":"@inproceedings{Schindelhauer_Lukovszki_Rührup_Volbert_2003, title={Worst case mobility in ad hoc networks}, DOI={<a href=\"https://doi.org/10.1145/777412.777448\">10.1145/777412.777448</a>}, booktitle={Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)}, author={Schindelhauer, Christian and Lukovszki, Tamás and Rührup, Stefan and Volbert, Klaus}, year={2003} }","ama":"Schindelhauer C, Lukovszki T, Rührup S, Volbert K. Worst case mobility in ad hoc networks. In: <i>Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)</i>. ; 2003. doi:<a href=\"https://doi.org/10.1145/777412.777448\">10.1145/777412.777448</a>","mla":"Schindelhauer, Christian, et al. “Worst Case Mobility in Ad Hoc Networks.” <i>Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)</i>, 2003, doi:<a href=\"https://doi.org/10.1145/777412.777448\">10.1145/777412.777448</a>.","short":"C. Schindelhauer, T. Lukovszki, S. Rührup, K. Volbert, in: Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03), 2003.","chicago":"Schindelhauer, Christian, Tamás Lukovszki, Stefan Rührup, and Klaus Volbert. “Worst Case Mobility in Ad Hoc Networks.” In <i>Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)</i>, 2003. <a href=\"https://doi.org/10.1145/777412.777448\">https://doi.org/10.1145/777412.777448</a>.","ieee":"C. Schindelhauer, T. Lukovszki, S. Rührup, and K. Volbert, “Worst case mobility in ad hoc networks,” in <i>Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)</i>, 2003.","apa":"Schindelhauer, C., Lukovszki, T., Rührup, S., &#38; Volbert, K. (2003). Worst case mobility in ad hoc networks. In <i>Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)</i>. <a href=\"https://doi.org/10.1145/777412.777448\">https://doi.org/10.1145/777412.777448</a>"}},{"abstract":[{"text":"A recent seminal result of Räcke is that for any undirected network there is an oblivious routing algorithm with a polylogarithmic competitive ratio with respect to congestion. Unfortunately, Räcke's construction is not polynomial time. We give a polynomial time construction that guarantees Räcke's bounds, and more generally gives the true optimal ratio for any (undirected or directed) network.","lang":"eng"}],"citation":{"mla":"Azar, Yossi, et al. “Optimal Oblivious Routing in Polynomial Time.” <i>Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03</i>, 2003, doi:<a href=\"https://doi.org/10.1145/780542.780599\">10.1145/780542.780599</a>.","bibtex":"@inproceedings{Azar_Cohen_Fiat_Kaplan_Racke_2003, title={Optimal oblivious routing in polynomial time}, DOI={<a href=\"https://doi.org/10.1145/780542.780599\">10.1145/780542.780599</a>}, booktitle={Proceedings of the thirty-fifth ACM symposium on Theory of computing  - STOC ’03}, author={Azar, Yossi and Cohen, Edith and Fiat, Amos and Kaplan, Haim and Racke, Harald}, year={2003} }","ama":"Azar Y, Cohen E, Fiat A, Kaplan H, Racke H. Optimal oblivious routing in polynomial time. In: <i>Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03</i>. ; 2003. doi:<a href=\"https://doi.org/10.1145/780542.780599\">10.1145/780542.780599</a>","ieee":"Y. Azar, E. Cohen, A. Fiat, H. Kaplan, and H. Racke, “Optimal oblivious routing in polynomial time,” in <i>Proceedings of the thirty-fifth ACM symposium on Theory of computing  - STOC ’03</i>, 2003.","apa":"Azar, Y., Cohen, E., Fiat, A., Kaplan, H., &#38; Racke, H. (2003). Optimal oblivious routing in polynomial time. In <i>Proceedings of the thirty-fifth ACM symposium on Theory of computing  - STOC ’03</i>. <a href=\"https://doi.org/10.1145/780542.780599\">https://doi.org/10.1145/780542.780599</a>","short":"Y. Azar, E. Cohen, A. Fiat, H. Kaplan, H. Racke, in: Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03, 2003.","chicago":"Azar, Yossi, Edith Cohen, Amos Fiat, Haim Kaplan, and Harald Racke. “Optimal Oblivious Routing in Polynomial Time.” In <i>Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03</i>, 2003. <a href=\"https://doi.org/10.1145/780542.780599\">https://doi.org/10.1145/780542.780599</a>."},"publication":"Proceedings of the thirty-fifth ACM symposium on Theory of computing  - STOC '03","department":[{"_id":"63"}],"type":"conference","date_created":"2020-09-03T14:34:33Z","publication_status":"published","date_updated":"2022-01-06T06:53:56Z","publication_identifier":{"isbn":["1581136749"]},"author":[{"full_name":"Azar, Yossi","last_name":"Azar","first_name":"Yossi"},{"first_name":"Edith","last_name":"Cohen","full_name":"Cohen, Edith"},{"full_name":"Fiat, Amos","last_name":"Fiat","first_name":"Amos"},{"first_name":"Haim","last_name":"Kaplan","full_name":"Kaplan, Haim"},{"last_name":"Racke","first_name":"Harald","full_name":"Racke, Harald"}],"title":"Optimal oblivious routing in polynomial time","year":"2003","status":"public","user_id":"15415","doi":"10.1145/780542.780599","_id":"18966","language":[{"iso":"eng"}]}]