[{"type":"dissertation","status":"public","_id":"18972","department":[{"_id":"63"},{"_id":"26"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["3-939350-09-5"]},"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-2007022210","relation":"confirmation"}]},"year":"2006","intvolume":"       190","citation":{"short":"V. Damerow, Average and Smoothed Complexity of Geometric Structures, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","bibtex":"@book{Damerow_2006, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Average and Smoothed Complexity of Geometric Structures}, volume={190}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Damerow, Valentina}, year={2006}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Damerow, Valentina. <i>Average and Smoothed Complexity of Geometric Structures</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","apa":"Damerow, V. (2006). <i>Average and Smoothed Complexity of Geometric Structures</i> (Vol. 190). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Damerow V. <i>Average and Smoothed Complexity of Geometric Structures</i>. Vol 190. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006.","chicago":"Damerow, Valentina. <i>Average and Smoothed Complexity of Geometric Structures</i>. Vol. 190. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","ieee":"V. Damerow, <i>Average and Smoothed Complexity of Geometric Structures</i>, vol. 190. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006."},"date_updated":"2022-01-06T06:53:56Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","volume":190,"author":[{"full_name":"Damerow, Valentina","last_name":"Damerow","first_name":"Valentina"}],"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_created":"2020-09-04T06:47:03Z","title":"Average and Smoothed Complexity of Geometric Structures"},{"title":"A Web Computing Environment for Parallel Algorithms in Java","author":[{"full_name":"Bonorden, Olaf","last_name":"Bonorden","first_name":"Olaf"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"last_name":"Gehweiler","full_name":"Gehweiler, Joachim","first_name":"Joachim"}],"date_created":"2020-09-04T09:50:01Z","date_updated":"2022-01-06T06:53:56Z","page":"1-14","citation":{"ieee":"O. Bonorden, F. Meyer auf der Heide, and J. Gehweiler, “A Web Computing Environment for Parallel Algorithms in Java,” in <i>Journal on Scalable Computing: Practice and Experience</i>, 2006, pp. 1–14.","chicago":"Bonorden, Olaf, Friedhelm Meyer auf der Heide, and Joachim Gehweiler. “A Web Computing Environment for Parallel Algorithms in Java.” In <i>Journal on Scalable Computing: Practice and Experience</i>, 1–14, 2006.","ama":"Bonorden O, Meyer auf der Heide F, Gehweiler J. A Web Computing Environment for Parallel Algorithms in Java. In: <i>Journal on Scalable Computing: Practice and Experience</i>. ; 2006:1-14.","apa":"Bonorden, O., Meyer auf der Heide, F., &#38; Gehweiler, J. (2006). A Web Computing Environment for Parallel Algorithms in Java. In <i>Journal on Scalable Computing: Practice and Experience</i> (pp. 1–14).","bibtex":"@inproceedings{Bonorden_Meyer auf der Heide_Gehweiler_2006, title={A Web Computing Environment for Parallel Algorithms in Java}, booktitle={Journal on Scalable Computing: Practice and Experience}, author={Bonorden, Olaf and Meyer auf der Heide, Friedhelm and Gehweiler, Joachim}, year={2006}, pages={1–14} }","short":"O. Bonorden, F. Meyer auf der Heide, J. Gehweiler, in: Journal on Scalable Computing: Practice and Experience, 2006, pp. 1–14.","mla":"Bonorden, Olaf, et al. “A Web Computing Environment for Parallel Algorithms in Java.” <i>Journal on Scalable Computing: Practice and Experience</i>, 2006, pp. 1–14."},"year":"2006","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"18999","status":"public","abstract":[{"text":"We present a web computing library (PUBWCL) in Java that allows to execute tightly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style on PCs distributed over the internet whose owners are willing to donate their unused computation power. PUBWCL is realized as a peer-to-peer system and features migration and restoration of BSP processes executed on it. The use of Java guarantees a high level of security and makes PUBWCL platform- independent. In order to estimate the loss of efficiency inherent in such a Java-based system, we have compared it to our C-based PUB-Library.\r\nAs the unused computation power of the participating PCs is unpredictable, we need novel strategies for load balancing that have no access to future changes of the computation power available for the application. We develop, analyze, and compare different load balancing strategies for PUBWCL. In order to handle the influence of the fluctuating available computation power, we classify the external work load.\r\nDuring our evaluation of the load balancing algorithms we simulated the external work load in order to have repeatable testing conditions. With the best performing load balancing strategy we could save 39% of the execution time on average and even up to 50% in particular cases, in our test environment.\r\n","lang":"eng"}],"publication":"Journal on Scalable Computing: Practice and Experience","type":"conference"},{"department":[{"_id":"63"}],"user_id":"15415","_id":"19001","language":[{"iso":"eng"}],"publication":"Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","type":"conference","status":"public","abstract":[{"text":"We present a novel architecture for distributed computing in a peer-to-peer network. In particular, we realize the Paderborn University BSP-based Web Computing Library (PUBWCL), which formerly used a centralized client-server architecture for scheduling and load balancing, as a pure peer-to-peer system. Using distributed heterogeneous hash tables (DHHT), our architecture features scheduling and load balancing of tightly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style with a minimal number of migrations.\r\n","lang":"eng"}],"author":[{"first_name":"Joachim","last_name":"Gehweiler","full_name":"Gehweiler, Joachim"},{"last_name":"Schomaker","full_name":"Schomaker, Gunnar","first_name":"Gunnar"}],"date_created":"2020-09-04T09:56:41Z","date_updated":"2022-01-06T06:53:57Z","doi":"10.1109/ds-rt.2006.15","title":"Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries","publication_identifier":{"isbn":["0769526977"]},"publication_status":"published","page":"51-58","citation":{"short":"J. Gehweiler, G. Schomaker, in: Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT), 2006, pp. 51–58.","bibtex":"@inproceedings{Gehweiler_Schomaker_2006, title={Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries}, DOI={<a href=\"https://doi.org/10.1109/ds-rt.2006.15\">10.1109/ds-rt.2006.15</a>}, booktitle={Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT)}, author={Gehweiler, Joachim and Schomaker, Gunnar}, year={2006}, pages={51–58} }","mla":"Gehweiler, Joachim, and Gunnar Schomaker. “Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries.” <i>Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT)</i>, 2006, pp. 51–58, doi:<a href=\"https://doi.org/10.1109/ds-rt.2006.15\">10.1109/ds-rt.2006.15</a>.","apa":"Gehweiler, J., &#38; Schomaker, G. (2006). Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries. In <i>Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT)</i> (pp. 51–58). <a href=\"https://doi.org/10.1109/ds-rt.2006.15\">https://doi.org/10.1109/ds-rt.2006.15</a>","chicago":"Gehweiler, Joachim, and Gunnar Schomaker. “Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries.” In <i>Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT)</i>, 51–58, 2006. <a href=\"https://doi.org/10.1109/ds-rt.2006.15\">https://doi.org/10.1109/ds-rt.2006.15</a>.","ieee":"J. Gehweiler and G. Schomaker, “Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries,” in <i>Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT)</i>, 2006, pp. 51–58.","ama":"Gehweiler J, Schomaker G. Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries. In: <i>Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT)</i>. ; 2006:51-58. doi:<a href=\"https://doi.org/10.1109/ds-rt.2006.15\">10.1109/ds-rt.2006.15</a>"},"year":"2006"},{"title":"A combinatorial algorithm for weighted stable sets in bipartite graphs","doi":"10.1016/j.dam.2005.05.037","date_updated":"2022-01-06T06:56:02Z","author":[{"first_name":"Ulrich","full_name":"Faigle, Ulrich","last_name":"Faigle"},{"last_name":"Frahling","full_name":"Frahling, Gereon","first_name":"Gereon"}],"date_created":"2021-09-07T12:54:05Z","year":"2006","page":"1380-1391","citation":{"apa":"Faigle, U., &#38; Frahling, G. (2006). A combinatorial algorithm for weighted stable sets in bipartite graphs. <i>Discrete Applied Mathematics</i>, 1380–1391. <a href=\"https://doi.org/10.1016/j.dam.2005.05.037\">https://doi.org/10.1016/j.dam.2005.05.037</a>","mla":"Faigle, Ulrich, and Gereon Frahling. “A Combinatorial Algorithm for Weighted Stable Sets in Bipartite Graphs.” <i>Discrete Applied Mathematics</i>, 2006, pp. 1380–91, doi:<a href=\"https://doi.org/10.1016/j.dam.2005.05.037\">10.1016/j.dam.2005.05.037</a>.","bibtex":"@article{Faigle_Frahling_2006, title={A combinatorial algorithm for weighted stable sets in bipartite graphs}, DOI={<a href=\"https://doi.org/10.1016/j.dam.2005.05.037\">10.1016/j.dam.2005.05.037</a>}, journal={Discrete Applied Mathematics}, author={Faigle, Ulrich and Frahling, Gereon}, year={2006}, pages={1380–1391} }","short":"U. Faigle, G. Frahling, Discrete Applied Mathematics (2006) 1380–1391.","chicago":"Faigle, Ulrich, and Gereon Frahling. “A Combinatorial Algorithm for Weighted Stable Sets in Bipartite Graphs.” <i>Discrete Applied Mathematics</i>, 2006, 1380–91. <a href=\"https://doi.org/10.1016/j.dam.2005.05.037\">https://doi.org/10.1016/j.dam.2005.05.037</a>.","ieee":"U. Faigle and G. Frahling, “A combinatorial algorithm for weighted stable sets in bipartite graphs,” <i>Discrete Applied Mathematics</i>, pp. 1380–1391, 2006.","ama":"Faigle U, Frahling G. A combinatorial algorithm for weighted stable sets in bipartite graphs. <i>Discrete Applied Mathematics</i>. 2006:1380-1391. doi:<a href=\"https://doi.org/10.1016/j.dam.2005.05.037\">10.1016/j.dam.2005.05.037</a>"},"publication_identifier":{"issn":["0166-218X"]},"publication_status":"published","language":[{"iso":"eng"}],"_id":"23881","department":[{"_id":"63"}],"user_id":"15415","abstract":[{"lang":"eng","text":"Computing a maximum weighted stable set in a bipartite graph is considered well-solved and usually approached with preflow-push, Ford–Fulkerson or network simplex algorithms. We present a combinatorial algorithm for the problem that is not based on flows. Numerical tests suggest that this algorithm performs quite well in practice and is competitive with flow based algorithms especially in the case of dense graphs."}],"status":"public","publication":"Discrete Applied Mathematics","type":"journal_article"},{"user_id":"15415","department":[{"_id":"63"}],"_id":"23882","language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the twenty-second annual symposium on Computational geometry  - SCG '06","status":"public","abstract":[{"lang":"eng","text":"In this paper we develop an efficient implementation for a k-means clustering algorithm. Our algorithm is a variant of KMHybrid [28, 20], i.e. it uses a combination of Lloyd-steps and random swaps, but as a novel feature it uses coresets to speed up the algorithm. A coreset is a small weighted set of points that approximates the original point set with respect to the considered problem. The main strength of the algorithm is that it can quickly determine clusterings of the same point set for many values of k. This is necessary in many applications, since, typically, one does not know a good value for k in advance. Once we have clusterings for many different values of k we can determine a good choice of k using a quality measure of clusterings that is independent of k, for example the average silhouette coefficient. The average silhouette coefficient can be approximated using coresets.To evaluate the performance of our algorithm we compare it with algorithm KMHybrid [28] on typical 3D data sets for an image compression application and on artificially created instances. Our data sets consist of 300,000 to 4.9 million points. We show that our algorithm significantly outperforms KMHybrid on most of these input instances. Additionally, the quality of the solutions computed by our algorithm deviates less than that of KMHybrid.We also computed clusterings and approximate average silhouette coefficient for k=1,…,100 for our input instances and discuss the performance of our algorithm in detail."}],"author":[{"first_name":"Gereon","last_name":"Frahling","full_name":"Frahling, Gereon"},{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"}],"date_created":"2021-09-07T13:03:31Z","date_updated":"2022-01-06T06:56:02Z","doi":"10.1145/1137856.1137879","title":"A fast k-means implementation using coresets","publication_status":"published","citation":{"apa":"Frahling, G., &#38; Sohler, C. (2006). A fast k-means implementation using coresets. In <i>Proceedings of the twenty-second annual symposium on Computational geometry  - SCG ’06</i>. <a href=\"https://doi.org/10.1145/1137856.1137879\">https://doi.org/10.1145/1137856.1137879</a>","mla":"Frahling, Gereon, and Christian Sohler. “A Fast K-Means Implementation Using Coresets.” <i>Proceedings of the Twenty-Second Annual Symposium on Computational Geometry  - SCG ’06</i>, 2006, doi:<a href=\"https://doi.org/10.1145/1137856.1137879\">10.1145/1137856.1137879</a>.","short":"G. Frahling, C. Sohler, in: Proceedings of the Twenty-Second Annual Symposium on Computational Geometry  - SCG ’06, 2006.","bibtex":"@inproceedings{Frahling_Sohler_2006, title={A fast k-means implementation using coresets}, DOI={<a href=\"https://doi.org/10.1145/1137856.1137879\">10.1145/1137856.1137879</a>}, booktitle={Proceedings of the twenty-second annual symposium on Computational geometry  - SCG ’06}, author={Frahling, Gereon and Sohler, Christian}, year={2006} }","ieee":"G. Frahling and C. Sohler, “A fast k-means implementation using coresets,” in <i>Proceedings of the twenty-second annual symposium on Computational geometry  - SCG ’06</i>, 2006.","chicago":"Frahling, Gereon, and Christian Sohler. “A Fast K-Means Implementation Using Coresets.” In <i>Proceedings of the Twenty-Second Annual Symposium on Computational Geometry  - SCG ’06</i>, 2006. <a href=\"https://doi.org/10.1145/1137856.1137879\">https://doi.org/10.1145/1137856.1137879</a>.","ama":"Frahling G, Sohler C. A fast k-means implementation using coresets. In: <i>Proceedings of the Twenty-Second Annual Symposium on Computational Geometry  - SCG ’06</i>. ; 2006. doi:<a href=\"https://doi.org/10.1145/1137856.1137879\">10.1145/1137856.1137879</a>"},"year":"2006"},{"year":"2006","citation":{"chicago":"Hamann, Heiko. <i>Modeling and Investigation of Robot Swarms</i>, 2006.","ieee":"H. Hamann, <i>Modeling and Investigation of Robot Swarms</i>. 2006.","ama":"Hamann H. <i>Modeling and Investigation of Robot Swarms</i>.; 2006.","bibtex":"@book{Hamann_2006, title={Modeling and Investigation of Robot Swarms}, author={Hamann, Heiko}, year={2006} }","short":"H. Hamann, Modeling and Investigation of Robot Swarms, 2006.","mla":"Hamann, Heiko. <i>Modeling and Investigation of Robot Swarms</i>. 2006.","apa":"Hamann, H. (2006). <i>Modeling and Investigation of Robot Swarms</i>."},"date_updated":"2022-01-06T06:54:27Z","date_created":"2020-11-19T12:18:36Z","author":[{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"}],"title":"Modeling and Investigation of Robot Swarms","type":"mastersthesis","status":"public","_id":"20436","department":[{"_id":"63"},{"_id":"238"}],"user_id":"15415","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"17979","status":"public","publication":"Computational Geometry","type":"journal_article","doi":"10.1016/j.comgeo.2006.02.001","title":"Geometric spanners with applications in wireless networks","date_created":"2020-08-14T13:26:24Z","author":[{"last_name":"Schindelhauer","full_name":"Schindelhauer, Christian","first_name":"Christian"},{"first_name":"Klaus","full_name":"Volbert, Klaus","last_name":"Volbert"},{"full_name":"Ziegler, Martin","last_name":"Ziegler","first_name":"Martin"}],"date_updated":"2022-01-06T06:53:24Z","page":"197-214","citation":{"ama":"Schindelhauer C, Volbert K, Ziegler M. Geometric spanners with applications in wireless networks. <i>Computational Geometry</i>. 2006:197-214. doi:<a href=\"https://doi.org/10.1016/j.comgeo.2006.02.001\">10.1016/j.comgeo.2006.02.001</a>","chicago":"Schindelhauer, Christian, Klaus Volbert, and Martin Ziegler. “Geometric Spanners with Applications in Wireless Networks.” <i>Computational Geometry</i>, 2006, 197–214. <a href=\"https://doi.org/10.1016/j.comgeo.2006.02.001\">https://doi.org/10.1016/j.comgeo.2006.02.001</a>.","ieee":"C. Schindelhauer, K. Volbert, and M. Ziegler, “Geometric spanners with applications in wireless networks,” <i>Computational Geometry</i>, pp. 197–214, 2006.","bibtex":"@article{Schindelhauer_Volbert_Ziegler_2006, title={Geometric spanners with applications in wireless networks}, DOI={<a href=\"https://doi.org/10.1016/j.comgeo.2006.02.001\">10.1016/j.comgeo.2006.02.001</a>}, journal={Computational Geometry}, author={Schindelhauer, Christian and Volbert, Klaus and Ziegler, Martin}, year={2006}, pages={197–214} }","short":"C. Schindelhauer, K. Volbert, M. Ziegler, Computational Geometry (2006) 197–214.","mla":"Schindelhauer, Christian, et al. “Geometric Spanners with Applications in Wireless Networks.” <i>Computational Geometry</i>, 2006, pp. 197–214, doi:<a href=\"https://doi.org/10.1016/j.comgeo.2006.02.001\">10.1016/j.comgeo.2006.02.001</a>.","apa":"Schindelhauer, C., Volbert, K., &#38; Ziegler, M. (2006). Geometric spanners with applications in wireless networks. <i>Computational Geometry</i>, 197–214. <a href=\"https://doi.org/10.1016/j.comgeo.2006.02.001\">https://doi.org/10.1016/j.comgeo.2006.02.001</a>"},"year":"2006","publication_identifier":{"issn":["0925-7721"]},"publication_status":"published"},{"date_updated":"2022-01-06T06:53:24Z","author":[{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"}],"date_created":"2020-08-14T13:40:13Z","title":"Effectively open real functions","doi":"10.1016/j.jco.2006.05.002","publication_status":"published","publication_identifier":{"issn":["0885-064X"]},"year":"2006","citation":{"ama":"Ziegler M. Effectively open real functions. <i>Journal of Complexity</i>. 2006:827-849. doi:<a href=\"https://doi.org/10.1016/j.jco.2006.05.002\">10.1016/j.jco.2006.05.002</a>","chicago":"Ziegler, Martin. “Effectively Open Real Functions.” <i>Journal of Complexity</i>, 2006, 827–49. <a href=\"https://doi.org/10.1016/j.jco.2006.05.002\">https://doi.org/10.1016/j.jco.2006.05.002</a>.","ieee":"M. Ziegler, “Effectively open real functions,” <i>Journal of Complexity</i>, pp. 827–849, 2006.","apa":"Ziegler, M. (2006). Effectively open real functions. <i>Journal of Complexity</i>, 827–849. <a href=\"https://doi.org/10.1016/j.jco.2006.05.002\">https://doi.org/10.1016/j.jco.2006.05.002</a>","bibtex":"@article{Ziegler_2006, title={Effectively open real functions}, DOI={<a href=\"https://doi.org/10.1016/j.jco.2006.05.002\">10.1016/j.jco.2006.05.002</a>}, journal={Journal of Complexity}, author={Ziegler, Martin}, year={2006}, pages={827–849} }","mla":"Ziegler, Martin. “Effectively Open Real Functions.” <i>Journal of Complexity</i>, 2006, pp. 827–49, doi:<a href=\"https://doi.org/10.1016/j.jco.2006.05.002\">10.1016/j.jco.2006.05.002</a>.","short":"M. Ziegler, Journal of Complexity (2006) 827–849."},"page":"827-849","_id":"17985","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Journal of Complexity","status":"public"},{"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"17987","status":"public","type":"book_chapter","publication":"Logical Approaches to Computational Barriers","doi":"10.1007/11780342_39","title":"Uncomputability Below the Real Halting Problem","date_created":"2020-08-14T13:43:09Z","author":[{"full_name":"Meer, Klaus","last_name":"Meer","first_name":"Klaus"},{"full_name":"Ziegler, Martin","last_name":"Ziegler","first_name":"Martin"}],"date_updated":"2022-01-06T06:53:24Z","citation":{"bibtex":"@inbook{Meer_Ziegler_2006, place={Berlin, Heidelberg}, title={Uncomputability Below the Real Halting Problem}, DOI={<a href=\"https://doi.org/10.1007/11780342_39\">10.1007/11780342_39</a>}, booktitle={Logical Approaches to Computational Barriers}, author={Meer, Klaus and Ziegler, Martin}, year={2006} }","short":"K. Meer, M. Ziegler, in: Logical Approaches to Computational Barriers, Berlin, Heidelberg, 2006.","mla":"Meer, Klaus, and Martin Ziegler. “Uncomputability Below the Real Halting Problem.” <i>Logical Approaches to Computational Barriers</i>, 2006, doi:<a href=\"https://doi.org/10.1007/11780342_39\">10.1007/11780342_39</a>.","apa":"Meer, K., &#38; Ziegler, M. (2006). Uncomputability Below the Real Halting Problem. In <i>Logical Approaches to Computational Barriers</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11780342_39\">https://doi.org/10.1007/11780342_39</a>","ama":"Meer K, Ziegler M. Uncomputability Below the Real Halting Problem. In: <i>Logical Approaches to Computational Barriers</i>. Berlin, Heidelberg; 2006. doi:<a href=\"https://doi.org/10.1007/11780342_39\">10.1007/11780342_39</a>","chicago":"Meer, Klaus, and Martin Ziegler. “Uncomputability Below the Real Halting Problem.” In <i>Logical Approaches to Computational Barriers</i>. Berlin, Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11780342_39\">https://doi.org/10.1007/11780342_39</a>.","ieee":"K. Meer and M. Ziegler, “Uncomputability Below the Real Halting Problem,” in <i>Logical Approaches to Computational Barriers</i>, Berlin, Heidelberg, 2006."},"year":"2006","place":"Berlin, Heidelberg","publication_status":"published","publication_identifier":{"isbn":["9783540354666","9783540354680"],"issn":["0302-9743","1611-3349"]}},{"publication":"Simulation and Visualization 2006 (SimViS)","type":"conference","abstract":[{"lang":"eng","text":"In this paper the ideas of a new research project are presented. The material flow simu- lator d3FACT insight shall manage multiple parallel and time synchronous simulations to grand the power of real-time visualization in combination with statistical analysis. This research is issued to overcome the conflict of simulation run repetition for a good statistical basis and real-time immersive visualization. A side effect will be the reduc- tion of time needed for simulation experiments. The planned simulation tool has the feature of triggered cloning, i.e., the user can decide during runtime to clone a set of simulations after changing parameters to preserve the original system. The simulations will be aggregated by visualization and statistics. The rendering is planned to overlay several simulations using effects like inking and transparency. Simulation data will be aggregated with statistical functions and diagrams."}],"status":"public","_id":"18351","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"year":"2006","page":"79-88","citation":{"ama":"Dangelmaier W, Huber D, Laroque C, et al. d<sup>3</sup>FACT insight goes parallel - Aggregation of multiple simulations. In: <i>Simulation and Visualization 2006 (SimViS)</i>. SCS European Publishing House; 2006:79-88.","chicago":"Dangelmaier, Wilhelm , Daniel  Huber, Christoph  Laroque, Mark Aufenanger, Matthias Fischer, Jens Krokowski, and Michael Kortenjan. “D<sup>3</sup>FACT Insight Goes Parallel - Aggregation of Multiple Simulations.” In <i>Simulation and Visualization 2006 (SimViS)</i>, 79–88. SCS European Publishing House, 2006.","ieee":"W. Dangelmaier <i>et al.</i>, “d<sup>3</sup>FACT insight goes parallel - Aggregation of multiple simulations,” in <i>Simulation and Visualization 2006 (SimViS)</i>, 2006, pp. 79–88.","apa":"Dangelmaier, W., Huber, D., Laroque, C., Aufenanger, M., Fischer, M., Krokowski, J., &#38; Kortenjan, M. (2006). d<sup>3</sup>FACT insight goes parallel - Aggregation of multiple simulations. In <i>Simulation and Visualization 2006 (SimViS)</i> (pp. 79–88). SCS European Publishing House.","short":"W. Dangelmaier, D. Huber, C. Laroque, M. Aufenanger, M. Fischer, J. Krokowski, M. Kortenjan, in: Simulation and Visualization 2006 (SimViS), SCS European Publishing House, 2006, pp. 79–88.","mla":"Dangelmaier, Wilhelm, et al. “D<sup>3</sup>FACT Insight Goes Parallel - Aggregation of Multiple Simulations.” <i>Simulation and Visualization 2006 (SimViS)</i>, SCS European Publishing House, 2006, pp. 79–88.","bibtex":"@inproceedings{Dangelmaier_Huber_Laroque_Aufenanger_Fischer_Krokowski_Kortenjan_2006, title={d<sup>3</sup>FACT insight goes parallel - Aggregation of multiple simulations}, booktitle={Simulation and Visualization 2006 (SimViS)}, publisher={SCS European Publishing House}, author={Dangelmaier, Wilhelm  and Huber, Daniel  and Laroque, Christoph  and Aufenanger, Mark and Fischer, Matthias and Krokowski, Jens and Kortenjan, Michael}, year={2006}, pages={79–88} }"},"publisher":"SCS European Publishing House","date_updated":"2022-01-06T06:53:29Z","date_created":"2020-08-26T09:48:35Z","author":[{"full_name":"Dangelmaier, Wilhelm ","last_name":"Dangelmaier","first_name":"Wilhelm "},{"last_name":"Huber","full_name":"Huber, Daniel ","first_name":"Daniel "},{"first_name":"Christoph ","full_name":"Laroque, Christoph ","last_name":"Laroque"},{"first_name":"Mark","last_name":"Aufenanger","full_name":"Aufenanger, Mark"},{"first_name":"Matthias","last_name":"Fischer","id":"146","full_name":"Fischer, Matthias"},{"first_name":"Jens","full_name":"Krokowski, Jens","last_name":"Krokowski"},{"last_name":"Kortenjan","full_name":"Kortenjan, Michael","first_name":"Michael"}],"title":"d³FACT insight goes parallel - Aggregation of multiple simulations"},{"status":"public","publication":"EATCS Bulletin","type":"journal_article","language":[{"iso":"eng"}],"_id":"18672","department":[{"_id":"63"}],"user_id":"15415","year":"2006","page":"23--47","citation":{"ieee":"C. Sohler and A. Czumaj, “Sublinear-time Algorithms,” <i>EATCS Bulletin</i>, no. 89, pp. 23--47, 2006.","chicago":"Sohler, Christian, and Artur Czumaj. “Sublinear-Time Algorithms.” <i>EATCS Bulletin</i>, no. 89 (2006): 23--47.","ama":"Sohler C, Czumaj A. Sublinear-time Algorithms. <i>EATCS Bulletin</i>. 2006;(89):23--47.","short":"C. Sohler, A. Czumaj, EATCS Bulletin (2006) 23--47.","mla":"Sohler, Christian, and Artur Czumaj. “Sublinear-Time Algorithms.” <i>EATCS Bulletin</i>, no. 89, 2006, pp. 23--47.","bibtex":"@article{Sohler_Czumaj_2006, title={Sublinear-time Algorithms}, number={89}, journal={EATCS Bulletin}, author={Sohler, Christian and Czumaj, Artur}, year={2006}, pages={23--47} }","apa":"Sohler, C., &#38; Czumaj, A. (2006). Sublinear-time Algorithms. <i>EATCS Bulletin</i>, (89), 23--47."},"issue":"89","title":"Sublinear-time Algorithms","date_updated":"2022-01-06T06:53:50Z","author":[{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"},{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"}],"date_created":"2020-08-31T08:18:02Z"},{"title":"Efficient Parallel Algorithms","volume":181,"date_created":"2020-04-08T07:54:09Z","author":[{"last_name":"Bonorden","full_name":"Bonorden, Olaf","first_name":"Olaf"},{"last_name":"Gehweiler","full_name":"Gehweiler, Joachim","first_name":"Joachim"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Bettina","last_name":"Rehberg","full_name":"Rehberg, Bettina"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_updated":"2022-01-06T06:52:50Z","page":"137-153","intvolume":"       181","citation":{"mla":"Bonorden, Olaf, et al. “Efficient Parallel Algorithms.” <i>Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel &#38; Distributed Computing</i>, vol. 181, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006, pp. 137–53.","bibtex":"@inproceedings{Bonorden_Gehweiler_Meyer auf der Heide_Rehberg_2006, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Efficient Parallel Algorithms}, volume={181}, booktitle={Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel &#38; Distributed Computing}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Bonorden, Olaf and Gehweiler, Joachim and Meyer auf der Heide, Friedhelm and Rehberg, Bettina}, year={2006}, pages={137–153}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","short":"O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, B. Rehberg, in: Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel &#38; Distributed Computing, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006, pp. 137–153.","apa":"Bonorden, O., Gehweiler, J., Meyer auf der Heide, F., &#38; Rehberg, B. (2006). Efficient Parallel Algorithms. <i>Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel &#38; Distributed Computing</i>, <i>181</i>, 137–153.","ieee":"O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, and B. Rehberg, “Efficient Parallel Algorithms,” in <i>Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel &#38; Distributed Computing</i>, 2006, vol. 181, pp. 137–153.","chicago":"Bonorden, Olaf, Joachim Gehweiler, Friedhelm Meyer auf der Heide, and Bettina Rehberg. “Efficient Parallel Algorithms.” In <i>Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel &#38; Distributed Computing</i>, 181:137–53. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","ama":"Bonorden O, Gehweiler J, Meyer auf der Heide F, Rehberg B. Efficient Parallel Algorithms. In: <i>Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel &#38; Distributed Computing</i>. Vol 181. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006:137-153."},"year":"2006","language":[{"iso":"eng"}],"department":[{"_id":"63"},{"_id":"26"}],"user_id":"5786","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"16462","status":"public","publication":"Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel & Distributed Computing","type":"conference"},{"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540327554","9783540327561"]},"publication_status":"published","year":"2006","place":"Berlin, Heidelberg","citation":{"apa":"Demaine, E. D., Meyer auf der Heide, F., Pagh, R., &#38; Pǎtraşcu, M. (2006). De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space). In <i>LATIN 2006: Theoretical Informatics</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11682462_34\">https://doi.org/10.1007/11682462_34</a>","short":"E.D. Demaine, F. Meyer auf der Heide, R. Pagh, M. Pǎtraşcu, in: LATIN 2006: Theoretical Informatics, Berlin, Heidelberg, 2006.","bibtex":"@inbook{Demaine_Meyer auf der Heide_Pagh_Pǎtraşcu_2006, place={Berlin, Heidelberg}, title={De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space)}, DOI={<a href=\"https://doi.org/10.1007/11682462_34\">10.1007/11682462_34</a>}, booktitle={LATIN 2006: Theoretical Informatics}, author={Demaine, Erik D. and Meyer auf der Heide, Friedhelm and Pagh, Rasmus and Pǎtraşcu, Mihai}, year={2006} }","mla":"Demaine, Erik D., et al. “De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space).” <i>LATIN 2006: Theoretical Informatics</i>, 2006, doi:<a href=\"https://doi.org/10.1007/11682462_34\">10.1007/11682462_34</a>.","chicago":"Demaine, Erik D., Friedhelm Meyer auf der Heide, Rasmus Pagh, and Mihai Pǎtraşcu. “De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space).” In <i>LATIN 2006: Theoretical Informatics</i>. Berlin, Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11682462_34\">https://doi.org/10.1007/11682462_34</a>.","ieee":"E. D. Demaine, F. Meyer auf der Heide, R. Pagh, and M. Pǎtraşcu, “De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space),” in <i>LATIN 2006: Theoretical Informatics</i>, Berlin, Heidelberg, 2006.","ama":"Demaine ED, Meyer auf der Heide F, Pagh R, Pǎtraşcu M. De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space). In: <i>LATIN 2006: Theoretical Informatics</i>. Berlin, Heidelberg; 2006. doi:<a href=\"https://doi.org/10.1007/11682462_34\">10.1007/11682462_34</a>"},"date_updated":"2022-01-06T06:52:50Z","author":[{"first_name":"Erik D.","full_name":"Demaine, Erik D.","last_name":"Demaine"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"first_name":"Rasmus","full_name":"Pagh, Rasmus","last_name":"Pagh"},{"first_name":"Mihai","full_name":"Pǎtraşcu, Mihai","last_name":"Pǎtraşcu"}],"date_created":"2020-04-08T09:36:10Z","title":"De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space)","doi":"10.1007/11682462_34","publication":"LATIN 2006: Theoretical Informatics","type":"book_chapter","status":"public","_id":"16472","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}]},{"status":"public","publication":"Lecture Notes in Computer Science","type":"book_chapter","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16473","citation":{"apa":"Dynia, M., Kutyłowski, J., Meyer auf der Heide, F., &#38; Schindelhauer, C. (2006). Smart Robot Teams Exploring Sparse Trees. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11821069_29\">https://doi.org/10.1007/11821069_29</a>","short":"M. Dynia, J. Kutyłowski, F. Meyer auf der Heide, C. Schindelhauer, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2006.","bibtex":"@inbook{Dynia_Kutyłowski_Meyer auf der Heide_Schindelhauer_2006, place={Berlin, Heidelberg}, title={Smart Robot Teams Exploring Sparse Trees}, DOI={<a href=\"https://doi.org/10.1007/11821069_29\">10.1007/11821069_29</a>}, booktitle={Lecture Notes in Computer Science}, author={Dynia, M. and Kutyłowski, J. and Meyer auf der Heide, Friedhelm and Schindelhauer, Christian}, year={2006} }","mla":"Dynia, M., et al. “Smart Robot Teams Exploring Sparse Trees.” <i>Lecture Notes in Computer Science</i>, 2006, doi:<a href=\"https://doi.org/10.1007/11821069_29\">10.1007/11821069_29</a>.","ama":"Dynia M, Kutyłowski J, Meyer auf der Heide F, Schindelhauer C. Smart Robot Teams Exploring Sparse Trees. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 2006. doi:<a href=\"https://doi.org/10.1007/11821069_29\">10.1007/11821069_29</a>","ieee":"M. Dynia, J. Kutyłowski, F. Meyer auf der Heide, and C. Schindelhauer, “Smart Robot Teams Exploring Sparse Trees,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 2006.","chicago":"Dynia, M., J. Kutyłowski, Friedhelm Meyer auf der Heide, and Christian Schindelhauer. “Smart Robot Teams Exploring Sparse Trees.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11821069_29\">https://doi.org/10.1007/11821069_29</a>."},"place":"Berlin, Heidelberg","year":"2006","publication_identifier":{"isbn":["9783540377917","9783540377931"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","doi":"10.1007/11821069_29","title":"Smart Robot Teams Exploring Sparse Trees","author":[{"first_name":"M.","full_name":"Dynia, M.","last_name":"Dynia"},{"first_name":"J.","last_name":"Kutyłowski","full_name":"Kutyłowski, J."},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Christian","last_name":"Schindelhauer","full_name":"Schindelhauer, Christian"}],"date_created":"2020-04-08T09:38:28Z","date_updated":"2022-01-06T06:52:50Z"},{"status":"public","publication":"IFIP International Federation for Information Processing","type":"book_chapter","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16476","citation":{"chicago":"Dynia, Miroslaw, Jarosław Kutyłowski, Paweł Lorek, and Friedhelm Meyer auf der Heide. “Maintaining Communication Between an Explorer and a Base Station.” In <i>IFIP International Federation for Information Processing</i>. Boston, MA, 2006. <a href=\"https://doi.org/10.1007/978-0-387-34733-2_14\">https://doi.org/10.1007/978-0-387-34733-2_14</a>.","ieee":"M. Dynia, J. Kutyłowski, P. Lorek, and F. Meyer auf der Heide, “Maintaining Communication Between an Explorer and a Base Station,” in <i>IFIP International Federation for Information Processing</i>, Boston, MA, 2006.","ama":"Dynia M, Kutyłowski J, Lorek P, Meyer auf der Heide F. Maintaining Communication Between an Explorer and a Base Station. In: <i>IFIP International Federation for Information Processing</i>. Boston, MA; 2006. doi:<a href=\"https://doi.org/10.1007/978-0-387-34733-2_14\">10.1007/978-0-387-34733-2_14</a>","apa":"Dynia, M., Kutyłowski, J., Lorek, P., &#38; Meyer auf der Heide, F. (2006). Maintaining Communication Between an Explorer and a Base Station. In <i>IFIP International Federation for Information Processing</i>. Boston, MA. <a href=\"https://doi.org/10.1007/978-0-387-34733-2_14\">https://doi.org/10.1007/978-0-387-34733-2_14</a>","short":"M. Dynia, J. Kutyłowski, P. Lorek, F. Meyer auf der Heide, in: IFIP International Federation for Information Processing, Boston, MA, 2006.","bibtex":"@inbook{Dynia_Kutyłowski_Lorek_Meyer auf der Heide_2006, place={Boston, MA}, title={Maintaining Communication Between an Explorer and a Base Station}, DOI={<a href=\"https://doi.org/10.1007/978-0-387-34733-2_14\">10.1007/978-0-387-34733-2_14</a>}, booktitle={IFIP International Federation for Information Processing}, author={Dynia, Miroslaw and Kutyłowski, Jarosław and Lorek, Paweł and Meyer auf der Heide, Friedhelm}, year={2006} }","mla":"Dynia, Miroslaw, et al. “Maintaining Communication Between an Explorer and a Base Station.” <i>IFIP International Federation for Information Processing</i>, 2006, doi:<a href=\"https://doi.org/10.1007/978-0-387-34733-2_14\">10.1007/978-0-387-34733-2_14</a>."},"place":"Boston, MA","year":"2006","publication_identifier":{"isbn":["9780387346328","9780387347332"],"issn":["1571-5736"]},"publication_status":"published","doi":"10.1007/978-0-387-34733-2_14","title":"Maintaining Communication Between an Explorer and a Base Station","author":[{"first_name":"Miroslaw","last_name":"Dynia","full_name":"Dynia, Miroslaw"},{"last_name":"Kutyłowski","full_name":"Kutyłowski, Jarosław","first_name":"Jarosław"},{"first_name":"Paweł","last_name":"Lorek","full_name":"Lorek, Paweł"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_created":"2020-04-08T11:13:52Z","date_updated":"2022-01-06T06:52:50Z"},{"type":"report","status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2020-08-05T10:06:52Z","creator":"koala","date_created":"2020-08-05T10:06:52Z","file_size":147312,"file_id":"17620","access_level":"closed","file_name":"smarts-design.pdf"}],"_id":"17011","department":[{"_id":"63"}],"user_id":"15415","ddc":["000"],"file_date_updated":"2020-08-05T10:06:52Z","language":[{"iso":"eng"}],"has_accepted_license":"1","publication_status":"published","year":"2006","citation":{"apa":"Dynia, M., Kuhmlehn, A., Kutylowski, J., Meyer auf der Heide, F., &#38; Schindelhauer, C. (2006). <i>SmartS Simulator Design</i>.","bibtex":"@book{Dynia_Kuhmlehn_Kutylowski_Meyer auf der Heide_Schindelhauer_2006, title={SmartS Simulator Design}, author={Dynia, Miroslaw and Kuhmlehn, Andreas and Kutylowski, Jaroslaw and Meyer auf der Heide, Friedhelm and Schindelhauer, Christian}, year={2006} }","short":"M. Dynia, A. Kuhmlehn, J. Kutylowski, F. Meyer auf der Heide, C. Schindelhauer, SmartS Simulator Design, 2006.","mla":"Dynia, Miroslaw, et al. <i>SmartS Simulator Design</i>. 2006.","ama":"Dynia M, Kuhmlehn A, Kutylowski J, Meyer auf der Heide F, Schindelhauer C. <i>SmartS Simulator Design</i>.; 2006.","chicago":"Dynia, Miroslaw, Andreas Kuhmlehn, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide, and Christian Schindelhauer. <i>SmartS Simulator Design</i>, 2006.","ieee":"M. Dynia, A. Kuhmlehn, J. Kutylowski, F. Meyer auf der Heide, and C. Schindelhauer, <i>SmartS Simulator Design</i>. 2006."},"date_updated":"2022-01-06T06:53:02Z","author":[{"full_name":"Dynia, Miroslaw","last_name":"Dynia","first_name":"Miroslaw"},{"full_name":"Kuhmlehn, Andreas","last_name":"Kuhmlehn","first_name":"Andreas"},{"last_name":"Kutylowski","full_name":"Kutylowski, Jaroslaw","first_name":"Jaroslaw"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Schindelhauer","full_name":"Schindelhauer, Christian","first_name":"Christian"}],"date_created":"2020-05-18T13:52:43Z","title":"SmartS Simulator Design"},{"publication_identifier":{"isbn":["3-935433-77-8"]},"related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20050101556"}]},"year":"2005","citation":{"apa":"Volbert, K. (2005). <i>Geometric Spanners for Topology Control in Wireless Networks</i> (Vol. 168). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","bibtex":"@book{Volbert_2005, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Geometric Spanners for Topology Control in Wireless Networks}, volume={168}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Volbert, Klaus}, year={2005}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","short":"K. Volbert, Geometric Spanners for Topology Control in Wireless Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.","mla":"Volbert, Klaus. <i>Geometric Spanners for Topology Control in Wireless Networks</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.","ieee":"K. Volbert, <i>Geometric Spanners for Topology Control in Wireless Networks</i>, vol. 168. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.","chicago":"Volbert, Klaus. <i>Geometric Spanners for Topology Control in Wireless Networks</i>. Vol. 168. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.","ama":"Volbert K. <i>Geometric Spanners for Topology Control in Wireless Networks</i>. Vol 168. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2005."},"intvolume":"       168","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_updated":"2022-01-06T06:54:08Z","date_created":"2020-09-22T07:40:37Z","supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"author":[{"first_name":"Klaus","full_name":"Volbert, Klaus","last_name":"Volbert"}],"volume":168,"title":"Geometric Spanners for Topology Control in Wireless Networks","type":"dissertation","status":"public","_id":"19611","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","department":[{"_id":"63"},{"_id":"26"}],"language":[{"iso":"eng"}]},{"abstract":[{"lang":"eng","text":"We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k+2 edges it interchanges the end vertices of the path. By definition this operation preserves regularity and connectivity. We show that every regular connected graph can be reached by a series of these operations for all k ¡Ý 1. We use a randomized version, called Random k-Flipper, in order to create random regular connected undirected graphs that may serve as a backbone for peer-to-peer networks. We prove for degree d¡Ê ¦¸(log n) that a series of O(dn) Random k-Flipper operations with k ∈ ¦¨(d2n2 log 1/¦Å) transforms any graph into an expander graph with high probability, i.e. 1-n-¦¨(1).\r\n\r\nThe Random 1-Flipper is symmetric, i.e. the transformation probability from any labeled <i>d</i>-regular graph <i>G</i> to <i>G'</i> is equal to those from <i>G'</i> to <i>G</i>. From this and the reachability property we conclude that in the limit a series of Random 1-Flipper operations converges against an uniform probability distribution over all connected labeled <i>d</i>-regular graphs. For degree <i>d</i> ∈ ω(1) growing with the graph size this implies that iteratively applying Random 1-Flipper transforms any given graph into an expander asymptotically almost surely.\r\n\r\nWe use these operations as a maintenance operation for a peer-to-peer network based on random regular connected graphs that provides high robustness and recovers from degenerate network structures by continuously applying these random graph transformations. For this, we describe how network operations for joining and leaving the network can be designed and how the concurrency of the graph transformations can be handled."}],"status":"public","type":"conference","publication":"Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures  - SPAA'05","language":[{"iso":"eng"}],"_id":"19827","user_id":"15415","department":[{"_id":"63"}],"year":"2005","citation":{"chicago":"Mahlmann, Peter, and Christian Schindelhauer. “Peer-to-Peer Networks Based on Random Transformations of Connected Regular Undirected Graphs.” In <i>Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA’05</i>, 2005. <a href=\"https://doi.org/10.1145/1073970.1073992\">https://doi.org/10.1145/1073970.1073992</a>.","ieee":"P. Mahlmann and C. Schindelhauer, “Peer-to-peer networks based on random transformations of connected regular undirected graphs,” in <i>Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures  - SPAA’05</i>, 2005.","ama":"Mahlmann P, Schindelhauer C. Peer-to-peer networks based on random transformations of connected regular undirected graphs. In: <i>Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA’05</i>. ; 2005. doi:<a href=\"https://doi.org/10.1145/1073970.1073992\">10.1145/1073970.1073992</a>","mla":"Mahlmann, Peter, and Christian Schindelhauer. “Peer-to-Peer Networks Based on Random Transformations of Connected Regular Undirected Graphs.” <i>Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA’05</i>, 2005, doi:<a href=\"https://doi.org/10.1145/1073970.1073992\">10.1145/1073970.1073992</a>.","bibtex":"@inproceedings{Mahlmann_Schindelhauer_2005, title={Peer-to-peer networks based on random transformations of connected regular undirected graphs}, DOI={<a href=\"https://doi.org/10.1145/1073970.1073992\">10.1145/1073970.1073992</a>}, booktitle={Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures  - SPAA’05}, author={Mahlmann, Peter and Schindelhauer, Christian}, year={2005} }","short":"P. Mahlmann, C. Schindelhauer, in: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA’05, 2005.","apa":"Mahlmann, P., &#38; Schindelhauer, C. (2005). Peer-to-peer networks based on random transformations of connected regular undirected graphs. In <i>Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures  - SPAA’05</i>. <a href=\"https://doi.org/10.1145/1073970.1073992\">https://doi.org/10.1145/1073970.1073992</a>"},"publication_status":"published","publication_identifier":{"isbn":["1581139861"]},"title":"Peer-to-peer networks based on random transformations of connected regular undirected graphs","doi":"10.1145/1073970.1073992","date_updated":"2022-01-06T06:54:13Z","date_created":"2020-10-01T09:50:59Z","author":[{"first_name":"Peter","last_name":"Mahlmann","full_name":"Mahlmann, Peter"},{"full_name":"Schindelhauer, Christian","last_name":"Schindelhauer","first_name":"Christian"}]},{"status":"public","abstract":[{"text":"We present a strategy for organizing the communication in wireless ad hoc networks based on a cell structure. We use the unit disk graph model and assume positioning capabilities for all nodes. The cell structure is an abstract view on the network and represents regions where nodes reside (node cells), regions that can be used for the communication flow (link cells) and regions that cannot be bridged due to the restricted transmission range (barrier cells). Each node can establish a cell classification of its neighborhood based on the position data which is announced by all nodes. <br>The cell structure has two advantages for applying position-based routing: It helps to determine local minima for greedy forwarding and improves recovery from such minima, because for recovery all edges can be used in contrast to other topology-based rules that can be appliedonly on a planar subgraph. <br>For the analysis of position-based routing algorithms the measures time and traffic are based on the cell structure. The difficulty of exploring the network is expressed by the size of the barriers (i.e. the number of cells in the perimeters). Exploration can be done in parallel, but with increasing traffic. We propose a comparative measure to assess both time and traffic, the combined comparative ratio, which is the maximum of the ratio of routing time and optimal time and the ratio of the traffic and the minimum exploration costs. <br>While flooding and common single-path strategies have a linear ratio, we present a simple algorithm that has a sub-linear<br>combined comparative ratio of O(sqrt(h)), where h is the minimal hop distance between source and target.","lang":"eng"}],"type":"conference","publication":"19th IEEE International Parallel and Distributed Processing Symposium","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"19834","citation":{"ama":"Rührup S, Schindelhauer C. Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure. In: <i>19th IEEE International Parallel and Distributed Processing Symposium</i>. ; 2005:248. doi:<a href=\"https://doi.org/10.1109/ipdps.2005.147\">10.1109/ipdps.2005.147</a>","ieee":"S. Rührup and C. Schindelhauer, “Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure,” in <i>19th IEEE International Parallel and Distributed Processing Symposium</i>, 2005, p. 248, doi: <a href=\"https://doi.org/10.1109/ipdps.2005.147\">10.1109/ipdps.2005.147</a>.","chicago":"Rührup, Stefan, and Christian Schindelhauer. “Competitive Time and Traffic Analysis of Position-Based Routing Using a Cell Structure.” In <i>19th IEEE International Parallel and Distributed Processing Symposium</i>, 248, 2005. <a href=\"https://doi.org/10.1109/ipdps.2005.147\">https://doi.org/10.1109/ipdps.2005.147</a>.","apa":"Rührup, S., &#38; Schindelhauer, C. (2005). Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure. <i>19th IEEE International Parallel and Distributed Processing Symposium</i>, 248. <a href=\"https://doi.org/10.1109/ipdps.2005.147\">https://doi.org/10.1109/ipdps.2005.147</a>","mla":"Rührup, Stefan, and Christian Schindelhauer. “Competitive Time and Traffic Analysis of Position-Based Routing Using a Cell Structure.” <i>19th IEEE International Parallel and Distributed Processing Symposium</i>, 2005, p. 248, doi:<a href=\"https://doi.org/10.1109/ipdps.2005.147\">10.1109/ipdps.2005.147</a>.","bibtex":"@inproceedings{Rührup_Schindelhauer_2005, title={Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure}, DOI={<a href=\"https://doi.org/10.1109/ipdps.2005.147\">10.1109/ipdps.2005.147</a>}, booktitle={19th IEEE International Parallel and Distributed Processing Symposium}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2005}, pages={248} }","short":"S. Rührup, C. Schindelhauer, in: 19th IEEE International Parallel and Distributed Processing Symposium, 2005, p. 248."},"page":"248","year":"2005","publication_status":"published","publication_identifier":{"isbn":["0769523129"]},"doi":"10.1109/ipdps.2005.147","title":"Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure","date_created":"2020-10-01T11:27:14Z","author":[{"first_name":"Stefan","last_name":"Rührup","full_name":"Rührup, Stefan"},{"first_name":"Christian","full_name":"Schindelhauer, Christian","last_name":"Schindelhauer"}],"date_updated":"2022-01-06T06:54:13Z"},{"author":[{"last_name":"Rührup","full_name":"Rührup, Stefan","first_name":"Stefan"},{"first_name":"Christian","last_name":"Schindelhauer","full_name":"Schindelhauer, Christian"},{"first_name":"Klaus","last_name":"Volbert","full_name":"Volbert, Klaus"}],"date_created":"2020-10-01T11:31:14Z","volume":3738,"date_updated":"2022-01-06T06:54:13Z","doi":"10.1007/11561354_21","title":"Performance Analysis of the Hierarchical Layer Graph for Wireless Networks","publication_status":"published","publication_identifier":{"isbn":["9783540291329","9783540320869"],"issn":["0302-9743","1611-3349"]},"citation":{"apa":"Rührup, S., Schindelhauer, C., &#38; Volbert, K. (2005). Performance Analysis of the Hierarchical Layer Graph for Wireless Networks. In <i>Proc. of 4th International Conference on Ad-Hoc, Mobile &#38; Wireless Networks (ADHOC-NOW 2005)</i> (Vol. 3738, pp. 244–257). <a href=\"https://doi.org/10.1007/11561354_21\">https://doi.org/10.1007/11561354_21</a>","short":"S. Rührup, C. Schindelhauer, K. Volbert, in: Proc. of 4th International Conference on Ad-Hoc, Mobile &#38; Wireless Networks (ADHOC-NOW 2005), 2005, pp. 244–257.","bibtex":"@inproceedings{Rührup_Schindelhauer_Volbert_2005, title={Performance Analysis of the Hierarchical Layer Graph for Wireless Networks}, volume={3738}, DOI={<a href=\"https://doi.org/10.1007/11561354_21\">10.1007/11561354_21</a>}, booktitle={Proc. of 4th International Conference on Ad-Hoc, Mobile &#38; Wireless Networks (ADHOC-NOW 2005)}, author={Rührup, Stefan and Schindelhauer, Christian and Volbert, Klaus}, year={2005}, pages={244–257} }","mla":"Rührup, Stefan, et al. “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks.” <i>Proc. of 4th International Conference on Ad-Hoc, Mobile &#38; Wireless Networks (ADHOC-NOW 2005)</i>, vol. 3738, 2005, pp. 244–57, doi:<a href=\"https://doi.org/10.1007/11561354_21\">10.1007/11561354_21</a>.","chicago":"Rührup, Stefan, Christian Schindelhauer, and Klaus Volbert. “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks.” In <i>Proc. of 4th International Conference on Ad-Hoc, Mobile &#38; Wireless Networks (ADHOC-NOW 2005)</i>, 3738:244–57, 2005. <a href=\"https://doi.org/10.1007/11561354_21\">https://doi.org/10.1007/11561354_21</a>.","ieee":"S. Rührup, C. Schindelhauer, and K. Volbert, “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks,” in <i>Proc. of 4th International Conference on Ad-Hoc, Mobile &#38; Wireless Networks (ADHOC-NOW 2005)</i>, 2005, vol. 3738, pp. 244–257.","ama":"Rührup S, Schindelhauer C, Volbert K. Performance Analysis of the Hierarchical Layer Graph for Wireless Networks. In: <i>Proc. of 4th International Conference on Ad-Hoc, Mobile &#38; Wireless Networks (ADHOC-NOW 2005)</i>. Vol 3738. ; 2005:244-257. doi:<a href=\"https://doi.org/10.1007/11561354_21\">10.1007/11561354_21</a>"},"intvolume":"      3738","page":"244-257","year":"2005","user_id":"15415","department":[{"_id":"63"}],"_id":"19835","language":[{"iso":"eng"}],"type":"conference","publication":"Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005)","status":"public","abstract":[{"text":"The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with<br>variable transmission ranges. It was introduced and analyzed by Meyer auf der Heide et al. 2004.<br>In this paper we present a distributed, localized and resource-efficient algorithm for constructing this graph. The qualtiy of the HL graph depends on the domination radius and the publication radius, which affect the amount of interference in the network. These parameters also determine whether the HL graph is a c-spanner, which implies an energy-efficient topology. We investigate the performance on randomly distributed node sets and show that the restrictions on these parameters derived from a worst case analysis are not so tight using realistic settings.<br><br>Here, we present the results of our extensive experimental evaluation, measuring congestion, dilation and energy. Congestion includes the load that is induced by interfering edges. We distinguish between congestion and realistic congestion where we also take the signal-to-interference ratio into account. <br>Our experiments show that the HL graph contains energy-efficient paths as well as paths with a few number of hops while preserving a low congestion.","lang":"eng"}]}]