[{"_id":"18972","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","volume":190,"user_id":"5786","publication_identifier":{"isbn":["3-939350-09-5"]},"author":[{"full_name":"Damerow, Valentina","last_name":"Damerow","first_name":"Valentina"}],"title":"Average and Smoothed Complexity of Geometric Structures","year":"2006","status":"public","intvolume":"       190","date_updated":"2022-01-06T06:53:56Z","date_created":"2020-09-04T06:47:03Z","department":[{"_id":"63"},{"_id":"26"}],"type":"dissertation","citation":{"ieee":"V. Damerow, <i>Average and Smoothed Complexity of Geometric Structures</i>, vol. 190. 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.","mla":"Damerow, Valentina. <i>Average and Smoothed Complexity of Geometric Structures</i>. 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} }","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.","ama":"Damerow V. <i>Average and Smoothed Complexity of Geometric Structures</i>. Vol 190. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006.","short":"V. Damerow, Average and Smoothed Complexity of Geometric Structures, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006."},"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-2007022210","relation":"confirmation"}]}},{"publication":"Journal on Scalable Computing: Practice and Experience","citation":{"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.","short":"O. Bonorden, F. Meyer auf der Heide, J. Gehweiler, in: Journal on Scalable Computing: Practice and Experience, 2006, pp. 1–14.","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.","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} }","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.","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).","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."},"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"}],"date_created":"2020-09-04T09:50:01Z","type":"conference","department":[{"_id":"63"}],"year":"2006","title":"A Web Computing Environment for Parallel Algorithms in Java","status":"public","author":[{"full_name":"Bonorden, Olaf","last_name":"Bonorden","first_name":"Olaf"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Gehweiler, Joachim","last_name":"Gehweiler","first_name":"Joachim"}],"date_updated":"2022-01-06T06:53:56Z","page":"1-14","_id":"18999","language":[{"iso":"eng"}],"user_id":"15415"},{"publication_status":"published","date_updated":"2022-01-06T06:53:57Z","author":[{"full_name":"Gehweiler, Joachim","first_name":"Joachim","last_name":"Gehweiler"},{"full_name":"Schomaker, Gunnar","first_name":"Gunnar","last_name":"Schomaker"}],"publication_identifier":{"isbn":["0769526977"]},"status":"public","year":"2006","title":"Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries","user_id":"15415","doi":"10.1109/ds-rt.2006.15","language":[{"iso":"eng"}],"_id":"19001","page":"51-58","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"}],"citation":{"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.","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>.","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.","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>.","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} }","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>"},"publication":"Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","department":[{"_id":"63"}],"type":"conference","date_created":"2020-09-04T09:56:41Z"},{"publication_identifier":{"issn":["0166-218X"]},"author":[{"last_name":"Faigle","first_name":"Ulrich","full_name":"Faigle, Ulrich"},{"last_name":"Frahling","first_name":"Gereon","full_name":"Frahling, Gereon"}],"year":"2006","title":"A combinatorial algorithm for weighted stable sets in bipartite graphs","status":"public","publication_status":"published","date_updated":"2022-01-06T06:56:02Z","language":[{"iso":"eng"}],"_id":"23881","page":"1380-1391","user_id":"15415","doi":"10.1016/j.dam.2005.05.037","citation":{"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.","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>","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} }","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>","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>."},"publication":"Discrete Applied Mathematics","abstract":[{"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.","lang":"eng"}],"date_created":"2021-09-07T12:54:05Z","department":[{"_id":"63"}],"type":"journal_article"},{"date_updated":"2022-01-06T06:56:02Z","publication_status":"published","status":"public","title":"A fast k-means implementation using coresets","year":"2006","author":[{"full_name":"Frahling, Gereon","first_name":"Gereon","last_name":"Frahling"},{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"}],"doi":"10.1145/1137856.1137879","user_id":"15415","_id":"23882","language":[{"iso":"eng"}],"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."}],"publication":"Proceedings of the twenty-second annual symposium on Computational geometry  - SCG '06","citation":{"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.","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>","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>.","short":"G. Frahling, C. Sohler, in: Proceedings of the Twenty-Second Annual Symposium on Computational Geometry  - SCG ’06, 2006.","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>.","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} }","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>"},"type":"conference","department":[{"_id":"63"}],"date_created":"2021-09-07T13:03:31Z"},{"user_id":"24135","doi":"10.1109/FPT.2006.270344","page":"345-348","_id":"2401","publisher":"IEEE Computer Society","date_updated":"2022-01-06T06:56:05Z","status":"public","title":"Optimal Temporal Partitioning based on Slowdown and Retiming","year":"2006","author":[{"id":"16153","full_name":"Plessl, Christian","last_name":"Plessl","first_name":"Christian","orcid":"0000-0001-5728-9982"},{"id":"398","first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco"},{"last_name":"Thiele","first_name":"Lothar","full_name":"Thiele, Lothar"}],"type":"conference","keyword":["temporal partitioning","retiming","ILP"],"department":[{"_id":"518"},{"_id":"78"}],"date_created":"2018-04-17T13:43:21Z","abstract":[{"lang":"eng","text":" This paper presents a novel method for optimal temporal partitioning of sequential circuits for time-multiplexed reconfigurable architectures. The method bases on slowdown and retiming and maximizes the circuit's performance during execution while restricting the size of the partitions to respect the resource constraints of the reconfigurable architecture. We provide a mixed integer linear program (MILP) formulation of the problem, which can be solved exactly. In contrast to related work, our approach optimizes performance directly, takes structural modifications of the circuit into account, and is extensible. We present the application of the new method to temporal partitioning for a coarse-grained reconfigurable architecture. "}],"publication":"Proc. Int. Conf. on Field Programmable Technology (ICFPT)","citation":{"ieee":"C. Plessl, M. Platzner, and L. Thiele, “Optimal Temporal Partitioning based on Slowdown and Retiming,” in <i>Proc. Int. Conf. on Field Programmable Technology (ICFPT)</i>, 2006, pp. 345–348.","apa":"Plessl, C., Platzner, M., &#38; Thiele, L. (2006). Optimal Temporal Partitioning based on Slowdown and Retiming. In <i>Proc. Int. Conf. on Field Programmable Technology (ICFPT)</i> (pp. 345–348). IEEE Computer Society. <a href=\"https://doi.org/10.1109/FPT.2006.270344\">https://doi.org/10.1109/FPT.2006.270344</a>","chicago":"Plessl, Christian, Marco Platzner, and Lothar Thiele. “Optimal Temporal Partitioning Based on Slowdown and Retiming.” In <i>Proc. Int. Conf. on Field Programmable Technology (ICFPT)</i>, 345–48. IEEE Computer Society, 2006. <a href=\"https://doi.org/10.1109/FPT.2006.270344\">https://doi.org/10.1109/FPT.2006.270344</a>.","short":"C. Plessl, M. Platzner, L. Thiele, in: Proc. Int. Conf. on Field Programmable Technology (ICFPT), IEEE Computer Society, 2006, pp. 345–348.","mla":"Plessl, Christian, et al. “Optimal Temporal Partitioning Based on Slowdown and Retiming.” <i>Proc. Int. Conf. on Field Programmable Technology (ICFPT)</i>, IEEE Computer Society, 2006, pp. 345–48, doi:<a href=\"https://doi.org/10.1109/FPT.2006.270344\">10.1109/FPT.2006.270344</a>.","bibtex":"@inproceedings{Plessl_Platzner_Thiele_2006, title={Optimal Temporal Partitioning based on Slowdown and Retiming}, DOI={<a href=\"https://doi.org/10.1109/FPT.2006.270344\">10.1109/FPT.2006.270344</a>}, booktitle={Proc. Int. Conf. on Field Programmable Technology (ICFPT)}, publisher={IEEE Computer Society}, author={Plessl, Christian and Platzner, Marco and Thiele, Lothar}, year={2006}, pages={345–348} }","ama":"Plessl C, Platzner M, Thiele L. Optimal Temporal Partitioning based on Slowdown and Retiming. In: <i>Proc. Int. Conf. on Field Programmable Technology (ICFPT)</i>. IEEE Computer Society; 2006:345-348. doi:<a href=\"https://doi.org/10.1109/FPT.2006.270344\">10.1109/FPT.2006.270344</a>"}},{"type":"journal_article","department":[{"_id":"79"}],"date_created":"2018-03-29T12:32:54Z","publication":"Theory Comput. Syst.","issue":"6","citation":{"apa":"Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., &#38; Scheideler, C. (2006). The Effect of Faults on Network Expansion. <i>Theory Comput. Syst.</i>, (6), 903--928. <a href=\"https://doi.org/10.1007/s00224-006-1349-0\">https://doi.org/10.1007/s00224-006-1349-0</a>","ieee":"A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler, “The Effect of Faults on Network Expansion,” <i>Theory Comput. Syst.</i>, no. 6, pp. 903--928, 2006.","chicago":"Bagchi, Amitabha, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, and Christian Scheideler. “The Effect of Faults on Network Expansion.” <i>Theory Comput. Syst.</i>, no. 6 (2006): 903--928. <a href=\"https://doi.org/10.1007/s00224-006-1349-0\">https://doi.org/10.1007/s00224-006-1349-0</a>.","short":"A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, Theory Comput. Syst. (2006) 903--928.","mla":"Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” <i>Theory Comput. Syst.</i>, no. 6, 2006, pp. 903--928, doi:<a href=\"https://doi.org/10.1007/s00224-006-1349-0\">10.1007/s00224-006-1349-0</a>.","ama":"Bagchi A, Bhargava A, Chaudhary A, Eppstein D, Scheideler C. The Effect of Faults on Network Expansion. <i>Theory Comput Syst</i>. 2006;(6):903--928. doi:<a href=\"https://doi.org/10.1007/s00224-006-1349-0\">10.1007/s00224-006-1349-0</a>","bibtex":"@article{Bagchi_Bhargava_Chaudhary_Eppstein_Scheideler_2006, title={The Effect of Faults on Network Expansion}, DOI={<a href=\"https://doi.org/10.1007/s00224-006-1349-0\">10.1007/s00224-006-1349-0</a>}, number={6}, journal={Theory Comput. Syst.}, author={Bagchi, Amitabha and Bhargava, Ankur and Chaudhary, Amitabh and Eppstein, David and Scheideler, Christian}, year={2006}, pages={903--928} }"},"user_id":"15504","doi":"10.1007/s00224-006-1349-0","page":"903--928","_id":"2043","date_updated":"2022-01-06T06:54:27Z","title":"The Effect of Faults on Network Expansion","status":"public","year":"2006","author":[{"last_name":"Bagchi","first_name":"Amitabha","full_name":"Bagchi, Amitabha"},{"full_name":"Bhargava, Ankur","last_name":"Bhargava","first_name":"Ankur"},{"first_name":"Amitabh","last_name":"Chaudhary","full_name":"Chaudhary, Amitabh"},{"last_name":"Eppstein","first_name":"David","full_name":"Eppstein, David"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}]},{"language":[{"iso":"eng"}],"_id":"20436","user_id":"15415","author":[{"full_name":"Hamann, Heiko","last_name":"Hamann","first_name":"Heiko"}],"title":"Modeling and Investigation of Robot Swarms","year":"2006","status":"public","date_updated":"2022-01-06T06:54:27Z","date_created":"2020-11-19T12:18:36Z","department":[{"_id":"63"},{"_id":"238"}],"type":"mastersthesis","citation":{"mla":"Hamann, Heiko. <i>Modeling and Investigation of Robot Swarms</i>. 2006.","apa":"Hamann, H. (2006). <i>Modeling and Investigation of Robot Swarms</i>.","ieee":"H. Hamann, <i>Modeling and Investigation of Robot Swarms</i>. 2006.","short":"H. Hamann, Modeling and Investigation of Robot Swarms, 2006.","ama":"Hamann H. <i>Modeling and Investigation of Robot Swarms</i>.; 2006.","chicago":"Hamann, Heiko. <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} }"}},{"language":[{"iso":"eng"}],"_id":"17979","page":"197-214","user_id":"15415","doi":"10.1016/j.comgeo.2006.02.001","author":[{"last_name":"Schindelhauer","first_name":"Christian","full_name":"Schindelhauer, Christian"},{"last_name":"Volbert","first_name":"Klaus","full_name":"Volbert, Klaus"},{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"}],"publication_identifier":{"issn":["0925-7721"]},"year":"2006","title":"Geometric spanners with applications in wireless networks","status":"public","publication_status":"published","date_updated":"2022-01-06T06:53:24Z","date_created":"2020-08-14T13:26:24Z","department":[{"_id":"63"}],"type":"journal_article","citation":{"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>.","short":"C. Schindelhauer, K. Volbert, M. Ziegler, Computational Geometry (2006) 197–214.","ieee":"C. Schindelhauer, K. Volbert, and M. Ziegler, “Geometric spanners with applications in wireless networks,” <i>Computational Geometry</i>, pp. 197–214, 2006.","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>","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} }","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>","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>."},"publication":"Computational Geometry"},{"user_id":"15415","doi":"10.1016/j.jco.2006.05.002","page":"827-849","_id":"17985","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:53:24Z","status":"public","title":"Effectively open real functions","year":"2006","publication_identifier":{"issn":["0885-064X"]},"author":[{"full_name":"Ziegler, Martin","last_name":"Ziegler","first_name":"Martin"}],"type":"journal_article","department":[{"_id":"63"}],"date_created":"2020-08-14T13:40:13Z","publication":"Journal of Complexity","citation":{"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>","short":"M. Ziegler, Journal of Complexity (2006) 827–849.","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>.","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>.","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} }","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>"}},{"language":[{"iso":"eng"}],"_id":"17987","doi":"10.1007/11780342_39","user_id":"15415","status":"public","year":"2006","title":"Uncomputability Below the Real Halting Problem","author":[{"first_name":"Klaus","last_name":"Meer","full_name":"Meer, Klaus"},{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"}],"publication_identifier":{"isbn":["9783540354666","9783540354680"],"issn":["0302-9743","1611-3349"]},"date_updated":"2022-01-06T06:53:24Z","publication_status":"published","place":"Berlin, Heidelberg","date_created":"2020-08-14T13:43:09Z","type":"book_chapter","department":[{"_id":"63"}],"publication":"Logical Approaches to Computational Barriers","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} }","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>","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>.","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>.","short":"K. Meer, M. Ziegler, in: Logical Approaches to Computational Barriers, Berlin, Heidelberg, 2006.","ieee":"K. Meer and M. Ziegler, “Uncomputability Below the Real Halting Problem,” in <i>Logical Approaches to Computational Barriers</i>, Berlin, Heidelberg, 2006.","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>"}},{"title":"d³FACT insight goes parallel - Aggregation of multiple simulations","year":"2006","status":"public","author":[{"first_name":"Wilhelm ","last_name":"Dangelmaier","full_name":"Dangelmaier, Wilhelm "},{"last_name":"Huber","first_name":"Daniel ","full_name":"Huber, Daniel "},{"first_name":"Christoph ","last_name":"Laroque","full_name":"Laroque, Christoph "},{"full_name":"Aufenanger, Mark","first_name":"Mark","last_name":"Aufenanger"},{"full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer","id":"146"},{"last_name":"Krokowski","first_name":"Jens","full_name":"Krokowski, Jens"},{"first_name":"Michael","last_name":"Kortenjan","full_name":"Kortenjan, Michael"}],"date_updated":"2022-01-06T06:53:29Z","page":"79-88","_id":"18351","publisher":"SCS European Publishing House","language":[{"iso":"eng"}],"user_id":"15415","publication":"Simulation and Visualization 2006 (SimViS)","citation":{"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} }","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.","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.","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."},"abstract":[{"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.","lang":"eng"}],"date_created":"2020-08-26T09:48:35Z","type":"conference","department":[{"_id":"63"}]},{"issue":"89","publication":"EATCS Bulletin","citation":{"ieee":"C. Sohler and A. Czumaj, “Sublinear-time Algorithms,” <i>EATCS Bulletin</i>, no. 89, pp. 23--47, 2006.","apa":"Sohler, C., &#38; Czumaj, A. (2006). Sublinear-time Algorithms. <i>EATCS Bulletin</i>, (89), 23--47.","chicago":"Sohler, Christian, and Artur Czumaj. “Sublinear-Time Algorithms.” <i>EATCS Bulletin</i>, no. 89 (2006): 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} }","ama":"Sohler C, Czumaj A. Sublinear-time Algorithms. <i>EATCS Bulletin</i>. 2006;(89):23--47."},"date_created":"2020-08-31T08:18:02Z","type":"journal_article","department":[{"_id":"63"}],"status":"public","year":"2006","title":"Sublinear-time Algorithms","author":[{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"},{"full_name":"Czumaj, Artur","last_name":"Czumaj","first_name":"Artur"}],"date_updated":"2022-01-06T06:53:50Z","page":"23--47","_id":"18672","language":[{"iso":"eng"}],"user_id":"15415"},{"publication":"6th International HNI Symposium on New Trends in Parallel and Distributed Computing","file_date_updated":"2018-04-13T09:59:14Z","citation":{"short":"C. Scheideler, in: 6th International HNI Symposium on New Trends in Parallel and Distributed Computing, 2006.","chicago":"Scheideler, Christian. “Towards a Paradigm for Robust Distributed Algorithms and Data Structures.” In <i>6th International HNI Symposium on New Trends in Parallel and Distributed Computing</i>, 2006.","ieee":"C. Scheideler, “Towards a paradigm for robust distributed algorithms and data structures,” in <i>6th International HNI Symposium on New Trends in Parallel and Distributed Computing</i>, 2006.","apa":"Scheideler, C. (2006). Towards a paradigm for robust distributed algorithms and data structures. In <i>6th International HNI Symposium on New Trends in Parallel and Distributed Computing</i>.","bibtex":"@inproceedings{Scheideler_2006, title={Towards a paradigm for robust distributed algorithms and data structures}, booktitle={6th International HNI Symposium on New Trends in Parallel and Distributed Computing}, author={Scheideler, Christian}, year={2006} }","ama":"Scheideler C. Towards a paradigm for robust distributed algorithms and data structures. In: <i>6th International HNI Symposium on New Trends in Parallel and Distributed Computing</i>. ; 2006.","mla":"Scheideler, Christian. “Towards a Paradigm for Robust Distributed Algorithms and Data Structures.” <i>6th International HNI Symposium on New Trends in Parallel and Distributed Computing</i>, 2006."},"type":"conference","oa":"1","department":[{"_id":"79"}],"file":[{"file_size":85116,"access_level":"open_access","file_name":"HNI-Symposium-06.pdf","date_updated":"2018-04-13T09:59:14Z","relation":"main_file","content_type":"application/pdf","file_id":"2336","creator":"florida","date_created":"2018-04-13T09:59:14Z"}],"date_created":"2018-04-05T07:06:44Z","date_updated":"2022-01-06T06:55:27Z","has_accepted_license":"1","status":"public","title":"Towards a paradigm for robust distributed algorithms and data structures","year":"2006","author":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"ddc":["040"],"user_id":"15504","_id":"2213","urn":"22137"},{"date_updated":"2022-01-06T06:55:13Z","title":"A Breadth-First Approach for Teaching Computer Graphics","year":"2006","status":"public","author":[{"id":"90","full_name":"Domik, Gitta","last_name":"Domik","first_name":"Gitta"},{"full_name":"Goetz, Frank","first_name":"Frank","last_name":"Goetz"}],"doi":"10.2312/eged.20061001","user_id":"14955","editor":[{"first_name":"Judy","last_name":"Brown","full_name":"Brown, Judy"},{"full_name":"Hansmann, Werner","first_name":"Werner","last_name":"Hansmann"}],"page":"1-5","language":[{"iso":"eng"}],"_id":"21777","publisher":"The Eurographics Association","publication":"EG Education Papers","citation":{"bibtex":"@inproceedings{Domik_Goetz_2006, title={A Breadth-First Approach for Teaching Computer Graphics}, DOI={<a href=\"https://doi.org/10.2312/eged.20061001\">10.2312/eged.20061001</a>}, booktitle={EG Education Papers}, publisher={The Eurographics Association}, author={Domik, Gitta and Goetz, Frank}, editor={Brown, Judy and Hansmann, WernerEditors}, year={2006}, pages={1–5} }","ama":"Domik G, Goetz F. A Breadth-First Approach for Teaching Computer Graphics. In: Brown J, Hansmann W, eds. <i>EG Education Papers</i>. The Eurographics Association; 2006:1-5. doi:<a href=\"https://doi.org/10.2312/eged.20061001\">10.2312/eged.20061001</a>","mla":"Domik, Gitta, and Frank Goetz. “A Breadth-First Approach for Teaching Computer Graphics.” <i>EG Education Papers</i>, edited by Judy Brown and Werner Hansmann, The Eurographics Association, 2006, pp. 1–5, doi:<a href=\"https://doi.org/10.2312/eged.20061001\">10.2312/eged.20061001</a>.","short":"G. Domik, F. Goetz, in: J. Brown, W. Hansmann (Eds.), EG Education Papers, The Eurographics Association, 2006, pp. 1–5.","chicago":"Domik, Gitta, and Frank Goetz. “A Breadth-First Approach for Teaching Computer Graphics.” In <i>EG Education Papers</i>, edited by Judy Brown and Werner Hansmann, 1–5. The Eurographics Association, 2006. <a href=\"https://doi.org/10.2312/eged.20061001\">https://doi.org/10.2312/eged.20061001</a>.","ieee":"G. Domik and F. Goetz, “A Breadth-First Approach for Teaching Computer Graphics,” in <i>EG Education Papers</i>, 2006, pp. 1–5.","apa":"Domik, G., &#38; Goetz, F. (2006). A Breadth-First Approach for Teaching Computer Graphics. In J. Brown &#38; W. Hansmann (Eds.), <i>EG Education Papers</i> (pp. 1–5). The Eurographics Association. <a href=\"https://doi.org/10.2312/eged.20061001\">https://doi.org/10.2312/eged.20061001</a>"},"type":"conference","department":[{"_id":"65"}],"date_created":"2021-04-25T17:19:42Z"},{"publication_identifier":{"isbn":["1595933646"]},"author":[{"last_name":"Goetz","first_name":"Frank","full_name":"Goetz, Frank"},{"id":"90","full_name":"Domik, Gitta","first_name":"Gitta","last_name":"Domik"}],"status":"public","year":"2006","title":"Visual Shaditor: A Seamless Way to Compose High-Level Shader Programs","date_updated":"2022-01-06T06:55:13Z","_id":"21778","series_title":"SIGGRAPH '06","language":[{"iso":"eng"}],"publisher":"Association for Computing Machinery","page":"51–es","user_id":"14955","doi":"10.1145/1179622.1179681","citation":{"bibtex":"@inproceedings{Goetz_Domik_2006, place={New York, NY, USA}, series={SIGGRAPH ’06}, title={Visual Shaditor: A Seamless Way to Compose High-Level Shader Programs}, DOI={<a href=\"https://doi.org/10.1145/1179622.1179681\">10.1145/1179622.1179681</a>}, booktitle={ACM SIGGRAPH 2006 Research Posters}, publisher={Association for Computing Machinery}, author={Goetz, Frank and Domik, Gitta}, year={2006}, pages={51–es}, collection={SIGGRAPH ’06} }","ama":"Goetz F, Domik G. Visual Shaditor: A Seamless Way to Compose High-Level Shader Programs. In: <i>ACM SIGGRAPH 2006 Research Posters</i>. SIGGRAPH ’06. New York, NY, USA: Association for Computing Machinery; 2006:51–es. doi:<a href=\"https://doi.org/10.1145/1179622.1179681\">10.1145/1179622.1179681</a>","mla":"Goetz, Frank, and Gitta Domik. “Visual Shaditor: A Seamless Way to Compose High-Level Shader Programs.” <i>ACM SIGGRAPH 2006 Research Posters</i>, Association for Computing Machinery, 2006, pp. 51–es, doi:<a href=\"https://doi.org/10.1145/1179622.1179681\">10.1145/1179622.1179681</a>.","short":"F. Goetz, G. Domik, in: ACM SIGGRAPH 2006 Research Posters, Association for Computing Machinery, New York, NY, USA, 2006, pp. 51–es.","chicago":"Goetz, Frank, and Gitta Domik. “Visual Shaditor: A Seamless Way to Compose High-Level Shader Programs.” In <i>ACM SIGGRAPH 2006 Research Posters</i>, 51–es. SIGGRAPH ’06. New York, NY, USA: Association for Computing Machinery, 2006. <a href=\"https://doi.org/10.1145/1179622.1179681\">https://doi.org/10.1145/1179622.1179681</a>.","ieee":"F. Goetz and G. Domik, “Visual Shaditor: A Seamless Way to Compose High-Level Shader Programs,” in <i>ACM SIGGRAPH 2006 Research Posters</i>, 2006, pp. 51–es.","apa":"Goetz, F., &#38; Domik, G. (2006). Visual Shaditor: A Seamless Way to Compose High-Level Shader Programs. In <i>ACM SIGGRAPH 2006 Research Posters</i> (pp. 51–es). New York, NY, USA: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/1179622.1179681\">https://doi.org/10.1145/1179622.1179681</a>"},"publication":"ACM SIGGRAPH 2006 Research Posters","date_created":"2021-04-25T17:19:43Z","place":"New York, NY, USA","department":[{"_id":"65"}],"type":"conference"},{"citation":{"ama":"Pleuß A, Van den Bergh J, Hußmann H, Sauer S, Bödcher A, eds. <i>Proceedings of the Workshop on Model Driven Development of Advanced User Interfaces, Satellite of the MoDELS 2006 Conference</i>. Vol 214. CEUR-WS.org; 2006.","bibtex":"@book{Pleuß_Van den Bergh_Hußmann_Sauer_Bödcher_2006, series={CEUR Workshop Proceedings}, title={Proceedings of the Workshop on Model Driven Development of Advanced User Interfaces, satellite of the MoDELS 2006 conference}, volume={214}, publisher={CEUR-WS.org}, year={2006}, collection={CEUR Workshop Proceedings} }","mla":"Pleuß, Andreas, et al., editors. <i>Proceedings of the Workshop on Model Driven Development of Advanced User Interfaces, Satellite of the MoDELS 2006 Conference</i>. Vol. 214, CEUR-WS.org, 2006.","chicago":"Pleuß, Andreas, Jan Van den Bergh, Heinrich Hußmann, Stefan Sauer, and Alexander Bödcher, eds. <i>Proceedings of the Workshop on Model Driven Development of Advanced User Interfaces, Satellite of the MoDELS 2006 Conference</i>. Vol. 214. CEUR Workshop Proceedings. CEUR-WS.org, 2006.","short":"A. Pleuß, J. Van den Bergh, H. Hußmann, S. Sauer, A. Bödcher, eds., Proceedings of the Workshop on Model Driven Development of Advanced User Interfaces, Satellite of the MoDELS 2006 Conference, CEUR-WS.org, 2006.","apa":"Pleuß, A., Van den Bergh, J., Hußmann, H., Sauer, S., &#38; Bödcher, A. (Eds.). (2006). <i>Proceedings of the Workshop on Model Driven Development of Advanced User Interfaces, satellite of the MoDELS 2006 conference</i> (Vol. 214). CEUR-WS.org.","ieee":"A. Pleuß, J. Van den Bergh, H. Hußmann, S. Sauer, and A. Bödcher, Eds., <i>Proceedings of the Workshop on Model Driven Development of Advanced User Interfaces, satellite of the MoDELS 2006 conference</i>, vol. 214. CEUR-WS.org, 2006."},"date_created":"2019-02-19T18:41:21Z","department":[{"_id":"66"}],"type":"conference_editor","year":"2006","status":"public","title":"Proceedings of the Workshop on Model Driven Development of Advanced User Interfaces, satellite of the MoDELS 2006 conference","intvolume":"       214","date_updated":"2022-01-06T07:03:46Z","series_title":"CEUR Workshop Proceedings","_id":"7780","language":[{"iso":"eng"}],"publisher":"CEUR-WS.org","volume":214,"editor":[{"first_name":"Andreas","last_name":"Pleuß","full_name":"Pleuß, Andreas"},{"full_name":"Van den Bergh, Jan","last_name":"Van den Bergh","first_name":"Jan"},{"first_name":"Heinrich","last_name":"Hußmann","full_name":"Hußmann, Heinrich"},{"full_name":"Sauer, Stefan","last_name":"Sauer","first_name":"Stefan","id":"447"},{"last_name":"Bödcher","first_name":"Alexander","full_name":"Bödcher, Alexander"}],"user_id":"52534"},{"date_updated":"2022-01-06T07:03:48Z","title":"Fairness Considerations in Replication and Placement Strategies for large Documents in heterogeneous Content Delivery Networks","year":"2006","status":"public","author":[{"full_name":"Loeser, Christoph","first_name":"Christoph","last_name":"Loeser"},{"full_name":"Schomaker, Gunnar","first_name":"Gunnar","last_name":"Schomaker"},{"last_name":"Schubert","first_name":"Matthias","full_name":"Schubert, Matthias"},{"last_name":"Schattkowsky","first_name":"Tim","full_name":"Schattkowsky, Tim"}],"user_id":"52534","doi":"http://dx.doi.org/10.1109/ICNICONSMCL.2006.96","page":"105","publisher":"IEEE Computer Society","_id":"7947","language":[{"iso":"eng"}],"publication":"Proceedings of the 5th International Conference on Networking (ICN 2006), Morne (Mauritius)","citation":{"ieee":"C. Loeser, G. Schomaker, M. Schubert, and T. Schattkowsky, “Fairness Considerations in Replication and Placement Strategies for large Documents in heterogeneous Content Delivery Networks,” in <i>Proceedings of the 5th International Conference on Networking (ICN 2006), Morne (Mauritius)</i>, 2006, p. 105.","apa":"Loeser, C., Schomaker, G., Schubert, M., &#38; Schattkowsky, T. (2006). Fairness Considerations in Replication and Placement Strategies for large Documents in heterogeneous Content Delivery Networks. In <i>Proceedings of the 5th International Conference on Networking (ICN 2006), Morne (Mauritius)</i> (p. 105). Washington, DC, USA: IEEE Computer Society. <a href=\"http://dx.doi.org/10.1109/ICNICONSMCL.2006.96\">http://dx.doi.org/10.1109/ICNICONSMCL.2006.96</a>","chicago":"Loeser, Christoph, Gunnar Schomaker, Matthias Schubert, and Tim Schattkowsky. “Fairness Considerations in Replication and Placement Strategies for Large Documents in Heterogeneous Content Delivery Networks.” In <i>Proceedings of the 5th International Conference on Networking (ICN 2006), Morne (Mauritius)</i>, 105. Washington, DC, USA: IEEE Computer Society, 2006. <a href=\"http://dx.doi.org/10.1109/ICNICONSMCL.2006.96\">http://dx.doi.org/10.1109/ICNICONSMCL.2006.96</a>.","short":"C. Loeser, G. Schomaker, M. Schubert, T. Schattkowsky, in: Proceedings of the 5th International Conference on Networking (ICN 2006), Morne (Mauritius), IEEE Computer Society, Washington, DC, USA, 2006, p. 105.","mla":"Loeser, Christoph, et al. “Fairness Considerations in Replication and Placement Strategies for Large Documents in Heterogeneous Content Delivery Networks.” <i>Proceedings of the 5th International Conference on Networking (ICN 2006), Morne (Mauritius)</i>, IEEE Computer Society, 2006, p. 105, doi:<a href=\"http://dx.doi.org/10.1109/ICNICONSMCL.2006.96\">http://dx.doi.org/10.1109/ICNICONSMCL.2006.96</a>.","bibtex":"@inproceedings{Loeser_Schomaker_Schubert_Schattkowsky_2006, place={Washington, DC, USA}, title={Fairness Considerations in Replication and Placement Strategies for large Documents in heterogeneous Content Delivery Networks}, DOI={<a href=\"http://dx.doi.org/10.1109/ICNICONSMCL.2006.96\">http://dx.doi.org/10.1109/ICNICONSMCL.2006.96</a>}, booktitle={Proceedings of the 5th International Conference on Networking (ICN 2006), Morne (Mauritius)}, publisher={IEEE Computer Society}, author={Loeser, Christoph and Schomaker, Gunnar and Schubert, Matthias and Schattkowsky, Tim}, year={2006}, pages={105} }","ama":"Loeser C, Schomaker G, Schubert M, Schattkowsky T. Fairness Considerations in Replication and Placement Strategies for large Documents in heterogeneous Content Delivery Networks. In: <i>Proceedings of the 5th International Conference on Networking (ICN 2006), Morne (Mauritius)</i>. Washington, DC, USA: IEEE Computer Society; 2006:105. doi:<a href=\"http://dx.doi.org/10.1109/ICNICONSMCL.2006.96\">http://dx.doi.org/10.1109/ICNICONSMCL.2006.96</a>"},"type":"conference","department":[{"_id":"66"}],"date_created":"2019-02-21T11:40:26Z","place":"Washington, DC, USA"},{"author":[{"full_name":"Schattkowsky, Tim","last_name":"Schattkowsky","first_name":"Tim"},{"full_name":"Förster, Alexander","first_name":"Alexander","last_name":"Förster"},{"full_name":"Loeser, Christoph","first_name":"Christoph","last_name":"Loeser"}],"title":"Secure Storage for Physically Exposed Web- and Application Servers","status":"public","year":"2006","date_updated":"2022-01-06T07:03:48Z","publisher":"IEEE Computer Society","_id":"7948","language":[{"iso":"eng"}],"page":"86","user_id":"52534","citation":{"ieee":"T. Schattkowsky, A. Förster, and C. Loeser, “Secure Storage for Physically Exposed Web- and Application Servers,” in <i>Proceedings of the 5th International Conference on Networking (ICN 2006), Morne (Mauritius)</i>, 2006, p. 86.","apa":"Schattkowsky, T., Förster, A., &#38; Loeser, C. (2006). Secure Storage for Physically Exposed Web- and Application Servers. In <i>Proceedings of the 5th International Conference on Networking (ICN 2006), Morne (Mauritius)</i> (p. 86). Washington, DC, USA: IEEE Computer Society.","mla":"Schattkowsky, Tim, et al. “Secure Storage for Physically Exposed Web- and Application Servers.” <i>Proceedings of the 5th International Conference on Networking (ICN 2006), Morne (Mauritius)</i>, IEEE Computer Society, 2006, p. 86.","bibtex":"@inproceedings{Schattkowsky_Förster_Loeser_2006, place={Washington, DC, USA}, title={Secure Storage for Physically Exposed Web- and Application Servers}, booktitle={Proceedings of the 5th International Conference on Networking (ICN 2006), Morne (Mauritius)}, publisher={IEEE Computer Society}, author={Schattkowsky, Tim and Förster, Alexander and Loeser, Christoph}, year={2006}, pages={86} }","chicago":"Schattkowsky, Tim, Alexander Förster, and Christoph Loeser. “Secure Storage for Physically Exposed Web- and Application Servers.” In <i>Proceedings of the 5th International Conference on Networking (ICN 2006), Morne (Mauritius)</i>, 86. Washington, DC, USA: IEEE Computer Society, 2006.","ama":"Schattkowsky T, Förster A, Loeser C. Secure Storage for Physically Exposed Web- and Application Servers. In: <i>Proceedings of the 5th International Conference on Networking (ICN 2006), Morne (Mauritius)</i>. Washington, DC, USA: IEEE Computer Society; 2006:86.","short":"T. Schattkowsky, A. Förster, C. Loeser, in: Proceedings of the 5th International Conference on Networking (ICN 2006), Morne (Mauritius), IEEE Computer Society, Washington, DC, USA, 2006, p. 86."},"publication":"Proceedings of the 5th International Conference on Networking (ICN 2006), Morne (Mauritius)","date_created":"2019-02-21T11:40:28Z","place":"Washington, DC, USA","department":[{"_id":"66"}],"type":"conference"},{"page":"737-752","publisher":"Springer","_id":"7949","series_title":"LNCS","language":[{"iso":"eng"}],"user_id":"52534","doi":"dx.doi.org/10.1007/11880240_51","volume":"4199/2006","title":"Using UML Activities for System-on-Chip Design and Synthesis","year":"2006","status":"public","author":[{"full_name":"Schattkowsky, Tim","first_name":"Tim","last_name":"Schattkowsky"},{"first_name":"Jan","last_name":"Hendrik Hausmann","full_name":"Hendrik Hausmann, Jan"},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"}],"date_updated":"2022-01-06T07:03:48Z","date_created":"2019-02-21T11:40:29Z","place":"Berlin/Heidelberg","type":"conference","department":[{"_id":"66"}],"publication":"Proceedings of the International Conference on Model Driven Engineering Languages and Systems (MoDELS 2006), Genova (Italy)","citation":{"bibtex":"@inproceedings{Schattkowsky_Hendrik Hausmann_Engels_2006, place={Berlin/Heidelberg}, series={LNCS}, title={Using UML Activities for System-on-Chip Design and Synthesis}, volume={4199/2006}, DOI={<a href=\"https://doi.org/dx.doi.org/10.1007/11880240_51\">dx.doi.org/10.1007/11880240_51</a>}, booktitle={Proceedings of the International Conference on Model Driven Engineering Languages and Systems (MoDELS 2006), Genova (Italy)}, publisher={Springer}, author={Schattkowsky, Tim and Hendrik Hausmann, Jan and Engels, Gregor}, year={2006}, pages={737–752}, collection={LNCS} }","ama":"Schattkowsky T, Hendrik Hausmann J, Engels G. Using UML Activities for System-on-Chip Design and Synthesis. In: <i>Proceedings of the International Conference on Model Driven Engineering Languages and Systems (MoDELS 2006), Genova (Italy)</i>. Vol 4199/2006. LNCS. Berlin/Heidelberg: Springer; 2006:737-752. doi:<a href=\"https://doi.org/dx.doi.org/10.1007/11880240_51\">dx.doi.org/10.1007/11880240_51</a>","mla":"Schattkowsky, Tim, et al. “Using UML Activities for System-on-Chip Design and Synthesis.” <i>Proceedings of the International Conference on Model Driven Engineering Languages and Systems (MoDELS 2006), Genova (Italy)</i>, vol. 4199/2006, Springer, 2006, pp. 737–52, doi:<a href=\"https://doi.org/dx.doi.org/10.1007/11880240_51\">dx.doi.org/10.1007/11880240_51</a>.","chicago":"Schattkowsky, Tim, Jan Hendrik Hausmann, and Gregor Engels. “Using UML Activities for System-on-Chip Design and Synthesis.” In <i>Proceedings of the International Conference on Model Driven Engineering Languages and Systems (MoDELS 2006), Genova (Italy)</i>, 4199/2006:737–52. LNCS. Berlin/Heidelberg: Springer, 2006. <a href=\"https://doi.org/dx.doi.org/10.1007/11880240_51\">https://doi.org/dx.doi.org/10.1007/11880240_51</a>.","short":"T. Schattkowsky, J. Hendrik Hausmann, G. Engels, in: Proceedings of the International Conference on Model Driven Engineering Languages and Systems (MoDELS 2006), Genova (Italy), Springer, Berlin/Heidelberg, 2006, pp. 737–752.","ieee":"T. Schattkowsky, J. Hendrik Hausmann, and G. Engels, “Using UML Activities for System-on-Chip Design and Synthesis,” in <i>Proceedings of the International Conference on Model Driven Engineering Languages and Systems (MoDELS 2006), Genova (Italy)</i>, 2006, vol. 4199/2006, pp. 737–752.","apa":"Schattkowsky, T., Hendrik Hausmann, J., &#38; Engels, G. (2006). Using UML Activities for System-on-Chip Design and Synthesis. In <i>Proceedings of the International Conference on Model Driven Engineering Languages and Systems (MoDELS 2006), Genova (Italy)</i> (Vol. 4199/2006, pp. 737–752). Berlin/Heidelberg: Springer. <a href=\"https://doi.org/dx.doi.org/10.1007/11880240_51\">https://doi.org/dx.doi.org/10.1007/11880240_51</a>"}}]