[{"_id":"17619","page":"225-234","date_updated":"2022-01-06T06:53:16Z","date_created":"2020-08-05T09:36:46Z","publication":"New Trends in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf Symposium","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","language":[{"iso":"eng"}],"year":"2006","type":"conference","status":"public","citation":{"bibtex":"@inproceedings{Grünewald_Meyer auf der Heide_Rührup_Schindelhauer_Volbert_2006, place={Paderborn}, title={Directional Communication in Mobile Ad Hoc Networks}, booktitle={New Trends in Parallel &#38; Distributed Computing, 6th Int. Heinz Nixdorf Symposium}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, author={Grünewald, Matthias and Meyer auf der Heide, Friedhelm and Rührup, Stefan and Schindelhauer, Christian and Volbert, Klaus}, year={2006}, pages={225–234} }","mla":"Grünewald, Matthias, et al. “Directional Communication in Mobile Ad Hoc Networks.” <i>New Trends in Parallel &#38; Distributed Computing, 6th Int. Heinz Nixdorf Symposium</i>, Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2006, pp. 225–34.","short":"M. Grünewald, F. Meyer auf der Heide, S. Rührup, C. Schindelhauer, K. Volbert, in: New Trends in Parallel &#38; Distributed Computing, 6th Int. Heinz Nixdorf Symposium, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006, pp. 225–234.","ama":"Grünewald M, Meyer auf der Heide F, Rührup S, Schindelhauer C, Volbert K. Directional Communication in Mobile Ad Hoc Networks. In: <i>New Trends in Parallel &#38; Distributed Computing, 6th Int. Heinz Nixdorf Symposium</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2006:225-234.","apa":"Grünewald, M., Meyer auf der Heide, F., Rührup, S., Schindelhauer, C., &#38; Volbert, K. (2006). Directional Communication in Mobile Ad Hoc Networks. <i>New Trends in Parallel &#38; Distributed Computing, 6th Int. Heinz Nixdorf Symposium</i>, 225–234.","ieee":"M. Grünewald, F. Meyer auf der Heide, S. Rührup, C. Schindelhauer, and K. Volbert, “Directional Communication in Mobile Ad Hoc Networks,” in <i>New Trends in Parallel &#38; Distributed Computing, 6th Int. Heinz Nixdorf Symposium</i>, 2006, pp. 225–234.","chicago":"Grünewald, Matthias, Friedhelm Meyer auf der Heide, Stefan Rührup, Christian Schindelhauer, and Klaus Volbert. “Directional Communication in Mobile Ad Hoc Networks.” In <i>New Trends in Parallel &#38; Distributed Computing, 6th Int. Heinz Nixdorf Symposium</i>, 225–34. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2006."},"user_id":"15415","department":[{"_id":"63"},{"_id":"26"}],"title":"Directional Communication in Mobile Ad Hoc Networks","author":[{"first_name":"Matthias","full_name":"Grünewald, Matthias","last_name":"Grünewald"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Rührup, Stefan","first_name":"Stefan","last_name":"Rührup"},{"last_name":"Schindelhauer","full_name":"Schindelhauer, Christian","first_name":"Christian"},{"last_name":"Volbert","full_name":"Volbert, Klaus","first_name":"Klaus"}],"place":"Paderborn"},{"title":"Computing Clustering Coefficients in Data Streams","author":[{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"},{"last_name":"Frahling","full_name":"Frahling, Gereon","first_name":"Gereon"},{"last_name":"Marchetti-Spaccamela","first_name":"Alberto","full_name":"Marchetti-Spaccamela, Alberto"},{"first_name":"Stefano","full_name":"Leonardi, Stefano","last_name":"Leonardi"},{"last_name":"Buriol","first_name":"Luciana","full_name":"Buriol, Luciana"}],"abstract":[{"text":"We present random sampling algorithms that with probability at least 1 - δ compute a (1 ± ǫ)- approximation of the clustering coefficient, the transitiv ity coefficient, and of the number of bipartite cliques in a graph given as a stream of edges. Our methods can be extended to approximately count the number of occurences of fixed constant-size subgraphs. Our a lgorithms only require one pass over the input stream and their storage space depends only on structural parameters of the graphs, the approxi- mation guarantee, and the confidence probability. For examp le, the algorithms to compute the clustering and transitivity coefficient depend on that coefficient but n ot on the size of the graph. Since many large social networks have small clustering and transitivity coe fficient, our algorithms use space independent of the size of the input for these graphs. We implemented our algorithms and evaluated their performance on networks from different appli- cation domains. The sizes of the considered input graphs varied from about 8, 000 nodes and 40, 000 edges to about 135 million nodes and more than 1 billion edges. For both algorithms we run experiments with a sample set size varying from 100, 000 to 1, 000, 000 to evaluate running time and approximation guarantee. Our algorithms appear to be time efficient for the se sample sizes.","lang":"eng"}],"citation":{"apa":"Sohler, C., Frahling, G., Marchetti-Spaccamela, A., Leonardi, S., &#38; Buriol, L. (2006). Computing Clustering Coefficients in Data Streams. In <i>Proceedings of  the European Conference on Complex Systems (ECCS’06)</i>.","ama":"Sohler C, Frahling G, Marchetti-Spaccamela A, Leonardi S, Buriol L. Computing Clustering Coefficients in Data Streams. In: <i>Proceedings of  the European Conference on Complex Systems (ECCS’06)</i>. ; 2006.","chicago":"Sohler, Christian, Gereon Frahling, Alberto Marchetti-Spaccamela, Stefano Leonardi, and Luciana Buriol. “Computing Clustering Coefficients in Data Streams.” In <i>Proceedings of  the European Conference on Complex Systems (ECCS’06)</i>, 2006.","ieee":"C. Sohler, G. Frahling, A. Marchetti-Spaccamela, S. Leonardi, and L. Buriol, “Computing Clustering Coefficients in Data Streams,” in <i>Proceedings of  the European Conference on Complex Systems (ECCS’06)</i>, 2006.","mla":"Sohler, Christian, et al. “Computing Clustering Coefficients in Data Streams.” <i>Proceedings of  the European Conference on Complex Systems (ECCS’06)</i>, 2006.","bibtex":"@inproceedings{Sohler_Frahling_Marchetti-Spaccamela_Leonardi_Buriol_2006, title={Computing Clustering Coefficients in Data Streams}, booktitle={Proceedings of  the European Conference on Complex Systems (ECCS’06)}, author={Sohler, Christian and Frahling, Gereon and Marchetti-Spaccamela, Alberto and Leonardi, Stefano and Buriol, Luciana}, year={2006} }","short":"C. Sohler, G. Frahling, A. Marchetti-Spaccamela, S. Leonardi, L. Buriol, in: Proceedings of  the European Conference on Complex Systems (ECCS’06), 2006."},"user_id":"15415","department":[{"_id":"63"}],"publication":"Proceedings of  the European Conference on Complex Systems (ECCS'06)","date_created":"2020-08-31T08:25:01Z","year":"2006","type":"conference","language":[{"iso":"eng"}],"status":"public","_id":"18676","date_updated":"2022-01-06T06:53:50Z"},{"title":"Counting Triangles in Data Streams","author":[{"first_name":"Christian","full_name":"Sohler, Christian","last_name":"Sohler"},{"full_name":"Frahling, Gereon","first_name":"Gereon","last_name":"Frahling"},{"last_name":"Marchetti-Spaccamela","full_name":"Marchetti-Spaccamela, Alberto","first_name":"Alberto"},{"full_name":"Leonardi, Stefano","first_name":"Stefano","last_name":"Leonardi"},{"last_name":"Buriol","full_name":"Buriol, Luciana","first_name":"Luciana"}],"citation":{"mla":"Sohler, Christian, et al. <i>Counting Triangles in Data Streams</i>. Edited by Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS), 2006.","bibtex":"@inproceedings{Sohler_Frahling_Marchetti-Spaccamela_Leonardi_Buriol_2006, title={Counting Triangles in Data Streams}, author={Sohler, Christian and Frahling, Gereon and Marchetti-Spaccamela, Alberto and Leonardi, Stefano and Buriol, Luciana}, editor={Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS)Editor}, year={2006} }","short":"C. Sohler, G. Frahling, A. Marchetti-Spaccamela, S. Leonardi, L. Buriol, in: Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS) (Ed.), 2006.","ama":"Sohler C, Frahling G, Marchetti-Spaccamela A, Leonardi S, Buriol L. Counting Triangles in Data Streams. In: Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS), ed. ; 2006.","apa":"Sohler, C., Frahling, G., Marchetti-Spaccamela, A., Leonardi, S., &#38; Buriol, L. (2006). Counting Triangles in Data Streams. In Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS) (Ed.).","chicago":"Sohler, Christian, Gereon Frahling, Alberto Marchetti-Spaccamela, Stefano Leonardi, and Luciana Buriol. “Counting Triangles in Data Streams.” edited by Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS), 2006.","ieee":"C. Sohler, G. Frahling, A. Marchetti-Spaccamela, S. Leonardi, and L. Buriol, “Counting Triangles in Data Streams,” 2006."},"user_id":"15415","corporate_editor":["Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS)"],"department":[{"_id":"63"}],"date_created":"2020-09-01T10:34:00Z","type":"conference","year":"2006","language":[{"iso":"eng"}],"status":"public","_id":"18745","date_updated":"2022-01-06T06:53:51Z"},{"department":[{"_id":"63"}],"citation":{"ieee":"C. Sohler, J. Gehweiler, and C. Lammersen, “A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem,” in <i>Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2006.","chicago":"Sohler, Christian, Joachim Gehweiler, and Christiane Lammersen. “A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem.” In <i>Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2006.","apa":"Sohler, C., Gehweiler, J., &#38; Lammersen, C. (2006). A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem. In <i>Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>.","ama":"Sohler C, Gehweiler J, Lammersen C. A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem. In: <i>Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2006.","short":"C. Sohler, J. Gehweiler, C. Lammersen, in: Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2006.","bibtex":"@inproceedings{Sohler_Gehweiler_Lammersen_2006, title={A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem}, booktitle={Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Sohler, Christian and Gehweiler, Joachim and Lammersen, Christiane}, year={2006} }","mla":"Sohler, Christian, et al. “A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem.” <i>Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2006."},"user_id":"15415","abstract":[{"text":"In this paper, we present a randomized constant factor approximation\r\nalgorithm for the metric minimum facility location problem with uniform\r\ncosts and demands in a distributed setting, in which every point can\r\nopen a facility. In particular, our distributed algorithm uses three\r\ncommunication rounds with message sizes bounded to O(log n) bits where\r\nn is the number of points. We also extend our algorithm to constant\r\npowers of metric spaces, where we also obtain a randomized constant\r\nfactor approximation algorithm.","lang":"eng"}],"title":"A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem","author":[{"first_name":"Christian","full_name":"Sohler, Christian","last_name":"Sohler"},{"full_name":"Gehweiler, Joachim","first_name":"Joachim","last_name":"Gehweiler"},{"full_name":"Lammersen, Christiane","first_name":"Christiane","last_name":"Lammersen"}],"date_updated":"2022-01-06T06:53:51Z","_id":"18746","year":"2006","type":"conference","language":[{"iso":"eng"}],"status":"public","publication":"Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","date_created":"2020-09-01T10:38:29Z"},{"citation":{"ieee":"M. Dynia, M. Korzeniowski, and C. Schindelhauer, “Power-Aware Collective Tree Exploration,” in <i>Architecture of Computing Systems - ARCS</i>, 2006, no. 3894, pp. 341--351.","chicago":"Dynia, Miroslaw, Miroslaw Korzeniowski, and Christian Schindelhauer. “Power-Aware Collective Tree Exploration.” In <i>Architecture of Computing Systems - ARCS</i>, 341--351, 2006. <a href=\"https://doi.org/10.1007/11682127_24\">https://doi.org/10.1007/11682127_24</a>.","ama":"Dynia M, Korzeniowski M, Schindelhauer C. Power-Aware Collective Tree Exploration. In: <i>Architecture of Computing Systems - ARCS</i>. ; 2006:341--351. doi:<a href=\"https://doi.org/10.1007/11682127_24\">10.1007/11682127_24</a>","apa":"Dynia, M., Korzeniowski, M., &#38; Schindelhauer, C. (2006). Power-Aware Collective Tree Exploration. In <i>Architecture of Computing Systems - ARCS</i> (pp. 341--351). <a href=\"https://doi.org/10.1007/11682127_24\">https://doi.org/10.1007/11682127_24</a>","short":"M. Dynia, M. Korzeniowski, C. Schindelhauer, in: Architecture of Computing Systems - ARCS, 2006, pp. 341--351.","bibtex":"@inproceedings{Dynia_Korzeniowski_Schindelhauer_2006, title={Power-Aware Collective Tree Exploration}, DOI={<a href=\"https://doi.org/10.1007/11682127_24\">10.1007/11682127_24</a>}, number={3894}, booktitle={Architecture of Computing Systems - ARCS}, author={Dynia, Miroslaw and Korzeniowski, Miroslaw and Schindelhauer, Christian}, year={2006}, pages={341--351} }","mla":"Dynia, Miroslaw, et al. “Power-Aware Collective Tree Exploration.” <i>Architecture of Computing Systems - ARCS</i>, no. 3894, 2006, pp. 341--351, doi:<a href=\"https://doi.org/10.1007/11682127_24\">10.1007/11682127_24</a>."},"publication_status":"published","user_id":"15415","department":[{"_id":"63"}],"title":"Power-Aware Collective Tree Exploration","author":[{"full_name":"Dynia, Miroslaw","first_name":"Miroslaw","last_name":"Dynia"},{"last_name":"Korzeniowski","first_name":"Miroslaw","full_name":"Korzeniowski, Miroslaw"},{"full_name":"Schindelhauer, Christian","first_name":"Christian","last_name":"Schindelhauer"}],"doi":"10.1007/11682127_24","_id":"18926","page":"341--351","issue":"3894","date_updated":"2022-01-06T06:53:54Z","date_created":"2020-09-03T10:13:56Z","publication":"Architecture of Computing Systems - ARCS","language":[{"iso":"eng"}],"year":"2006","type":"conference","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540327653","9783540327660"]},"status":"public"},{"department":[{"_id":"63"},{"_id":"26"}],"user_id":"5786","citation":{"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} }","short":"V. Damerow, Average and Smoothed Complexity of Geometric Structures, 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."},"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","intvolume":"       190","supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"author":[{"full_name":"Damerow, Valentina","first_name":"Valentina","last_name":"Damerow"}],"title":"Average and Smoothed Complexity of Geometric Structures","date_updated":"2022-01-06T06:53:56Z","volume":190,"_id":"18972","status":"public","language":[{"iso":"eng"}],"year":"2006","publication_identifier":{"isbn":["3-939350-09-5"]},"type":"dissertation","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-2007022210","relation":"confirmation"}]},"date_created":"2020-09-04T06:47:03Z"},{"author":[{"full_name":"Bonorden, Olaf","first_name":"Olaf","last_name":"Bonorden"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Joachim","full_name":"Gehweiler, Joachim","last_name":"Gehweiler"}],"title":"A Web Computing Environment for Parallel Algorithms in Java","abstract":[{"lang":"eng","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"}],"user_id":"15415","citation":{"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.","short":"O. Bonorden, F. Meyer auf der Heide, J. Gehweiler, in: Journal on Scalable Computing: Practice and Experience, 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).","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.","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."},"department":[{"_id":"63"}],"publication":"Journal on Scalable Computing: Practice and Experience","date_created":"2020-09-04T09:50:01Z","status":"public","type":"conference","year":"2006","language":[{"iso":"eng"}],"page":"1-14","_id":"18999","date_updated":"2022-01-06T06:53:56Z"},{"date_updated":"2022-01-06T06:53:57Z","page":"51-58","_id":"19001","status":"public","year":"2006","publication_identifier":{"isbn":["0769526977"]},"type":"conference","language":[{"iso":"eng"}],"publication":"Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","date_created":"2020-09-04T09:56:41Z","department":[{"_id":"63"}],"user_id":"15415","publication_status":"published","citation":{"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>.","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.","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>","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>","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.","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>."},"abstract":[{"lang":"eng","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"}],"doi":"10.1109/ds-rt.2006.15","author":[{"last_name":"Gehweiler","first_name":"Joachim","full_name":"Gehweiler, Joachim"},{"last_name":"Schomaker","first_name":"Gunnar","full_name":"Schomaker, Gunnar"}],"title":"Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries"},{"publication":"Discrete Applied Mathematics","date_created":"2021-09-07T12:54:05Z","publication_identifier":{"issn":["0166-218X"]},"type":"journal_article","year":"2006","language":[{"iso":"eng"}],"status":"public","page":"1380-1391","_id":"23881","date_updated":"2022-01-06T06:56:02Z","title":"A combinatorial algorithm for weighted stable sets in bipartite graphs","author":[{"last_name":"Faigle","full_name":"Faigle, Ulrich","first_name":"Ulrich"},{"last_name":"Frahling","first_name":"Gereon","full_name":"Frahling, Gereon"}],"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"}],"doi":"10.1016/j.dam.2005.05.037","citation":{"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} }","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>.","short":"U. Faigle, G. Frahling, Discrete Applied Mathematics (2006) 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>","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>","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.","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>."},"user_id":"15415","publication_status":"published","department":[{"_id":"63"}]},{"doi":"10.1145/1137856.1137879","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."}],"title":"A fast k-means implementation using coresets","author":[{"last_name":"Frahling","full_name":"Frahling, Gereon","first_name":"Gereon"},{"last_name":"Sohler","first_name":"Christian","full_name":"Sohler, Christian"}],"department":[{"_id":"63"}],"citation":{"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} }","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.","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>","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>","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>."},"user_id":"15415","publication_status":"published","type":"conference","year":"2006","language":[{"iso":"eng"}],"status":"public","publication":"Proceedings of the twenty-second annual symposium on Computational geometry  - SCG '06","date_created":"2021-09-07T13:03:31Z","date_updated":"2022-01-06T06:56:02Z","_id":"23882"},{"citation":{"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} }","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>.","short":"C. Plessl, M. Platzner, L. Thiele, in: Proc. Int. Conf. on Field Programmable Technology (ICFPT), IEEE Computer Society, 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>","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>","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.","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>."},"keyword":["temporal partitioning","retiming","ILP"],"user_id":"24135","department":[{"_id":"518"},{"_id":"78"}],"title":"Optimal Temporal Partitioning based on Slowdown and Retiming","author":[{"orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","first_name":"Christian","id":"16153","last_name":"Plessl"},{"first_name":"Marco","full_name":"Platzner, Marco","id":"398","last_name":"Platzner"},{"first_name":"Lothar","full_name":"Thiele, Lothar","last_name":"Thiele"}],"abstract":[{"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. ","lang":"eng"}],"doi":"10.1109/FPT.2006.270344","page":"345-348","_id":"2401","date_updated":"2022-01-06T06:56:05Z","date_created":"2018-04-17T13:43:21Z","publication":"Proc. Int. Conf. on Field Programmable Technology (ICFPT)","publisher":"IEEE Computer Society","year":"2006","type":"conference","status":"public"},{"doi":"10.1007/s00224-006-1349-0","title":"The Effect of Faults on Network Expansion","author":[{"last_name":"Bagchi","first_name":"Amitabha","full_name":"Bagchi, Amitabha"},{"full_name":"Bhargava, Ankur","first_name":"Ankur","last_name":"Bhargava"},{"last_name":"Chaudhary","full_name":"Chaudhary, Amitabh","first_name":"Amitabh"},{"last_name":"Eppstein","first_name":"David","full_name":"Eppstein, David"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"department":[{"_id":"79"}],"citation":{"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>.","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} }","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>.","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.","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>","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>"},"user_id":"15504","type":"journal_article","year":"2006","status":"public","publication":"Theory Comput. Syst.","date_created":"2018-03-29T12:32:54Z","date_updated":"2022-01-06T06:54:27Z","issue":"6","_id":"2043","page":"903--928"},{"date_updated":"2022-01-06T06:54:27Z","_id":"20436","status":"public","year":"2006","type":"mastersthesis","language":[{"iso":"eng"}],"date_created":"2020-11-19T12:18:36Z","department":[{"_id":"63"},{"_id":"238"}],"user_id":"15415","citation":{"ieee":"H. Hamann, <i>Modeling and Investigation of Robot Swarms</i>. 2006.","chicago":"Hamann, Heiko. <i>Modeling and Investigation of Robot Swarms</i>, 2006.","ama":"Hamann H. <i>Modeling and Investigation of Robot Swarms</i>.; 2006.","apa":"Hamann, H. (2006). <i>Modeling and Investigation of Robot Swarms</i>.","short":"H. Hamann, Modeling and Investigation of Robot Swarms, 2006.","bibtex":"@book{Hamann_2006, title={Modeling and Investigation of Robot Swarms}, author={Hamann, Heiko}, year={2006} }","mla":"Hamann, Heiko. <i>Modeling and Investigation of Robot Swarms</i>. 2006."},"author":[{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"}],"title":"Modeling and Investigation of Robot Swarms"},{"doi":"10.1016/j.comgeo.2006.02.001","author":[{"first_name":"Christian","full_name":"Schindelhauer, Christian","last_name":"Schindelhauer"},{"first_name":"Klaus","full_name":"Volbert, Klaus","last_name":"Volbert"},{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"}],"title":"Geometric spanners with applications in wireless networks","department":[{"_id":"63"}],"publication_status":"published","user_id":"15415","citation":{"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} }","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>.","short":"C. Schindelhauer, K. Volbert, M. Ziegler, Computational Geometry (2006) 197–214.","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>","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>","ieee":"C. Schindelhauer, K. Volbert, and M. Ziegler, “Geometric spanners with applications in wireless networks,” <i>Computational Geometry</i>, pp. 197–214, 2006.","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>."},"status":"public","language":[{"iso":"eng"}],"type":"journal_article","publication_identifier":{"issn":["0925-7721"]},"year":"2006","date_created":"2020-08-14T13:26:24Z","publication":"Computational Geometry","date_updated":"2022-01-06T06:53:24Z","page":"197-214","_id":"17979"},{"department":[{"_id":"63"}],"citation":{"ieee":"M. Ziegler, “Effectively open real functions,” <i>Journal of Complexity</i>, pp. 827–849, 2006.","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>.","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>","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>","short":"M. Ziegler, Journal of Complexity (2006) 827–849.","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>."},"publication_status":"published","user_id":"15415","doi":"10.1016/j.jco.2006.05.002","title":"Effectively open real functions","author":[{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"}],"date_updated":"2022-01-06T06:53:24Z","_id":"17985","page":"827-849","language":[{"iso":"eng"}],"type":"journal_article","year":"2006","publication_identifier":{"issn":["0885-064X"]},"status":"public","date_created":"2020-08-14T13:40:13Z","publication":"Journal of Complexity"},{"doi":"10.1007/11780342_39","place":"Berlin, Heidelberg","author":[{"last_name":"Meer","full_name":"Meer, Klaus","first_name":"Klaus"},{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"}],"title":"Uncomputability Below the Real Halting Problem","department":[{"_id":"63"}],"user_id":"15415","publication_status":"published","citation":{"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>.","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.","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>","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>","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."},"status":"public","year":"2006","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540354666","9783540354680"]},"type":"book_chapter","language":[{"iso":"eng"}],"publication":"Logical Approaches to Computational Barriers","date_created":"2020-08-14T13:43:09Z","date_updated":"2022-01-06T06:53:24Z","_id":"17987"},{"department":[{"_id":"63"}],"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.","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.","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.","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.","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} }","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.","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."},"user_id":"15415","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."}],"title":"d³FACT insight goes parallel - Aggregation of multiple simulations","author":[{"last_name":"Dangelmaier","first_name":"Wilhelm ","full_name":"Dangelmaier, Wilhelm "},{"last_name":"Huber","full_name":"Huber, Daniel ","first_name":"Daniel "},{"full_name":"Laroque, Christoph ","first_name":"Christoph ","last_name":"Laroque"},{"last_name":"Aufenanger","first_name":"Mark","full_name":"Aufenanger, Mark"},{"full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer","id":"146"},{"last_name":"Krokowski","first_name":"Jens","full_name":"Krokowski, Jens"},{"last_name":"Kortenjan","first_name":"Michael","full_name":"Kortenjan, Michael"}],"date_updated":"2022-01-06T06:53:29Z","_id":"18351","page":"79-88","year":"2006","type":"conference","language":[{"iso":"eng"}],"status":"public","publication":"Simulation and Visualization 2006 (SimViS)","date_created":"2020-08-26T09:48:35Z","publisher":"SCS European Publishing House"},{"department":[{"_id":"63"}],"user_id":"15415","citation":{"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} }","mla":"Sohler, Christian, and Artur Czumaj. “Sublinear-Time Algorithms.” <i>EATCS Bulletin</i>, no. 89, 2006, pp. 23--47.","short":"C. Sohler, A. Czumaj, EATCS Bulletin (2006) 23--47.","apa":"Sohler, C., &#38; Czumaj, A. (2006). Sublinear-time Algorithms. <i>EATCS Bulletin</i>, (89), 23--47.","ama":"Sohler C, Czumaj A. Sublinear-time Algorithms. <i>EATCS Bulletin</i>. 2006;(89):23--47.","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."},"author":[{"first_name":"Christian","full_name":"Sohler, Christian","last_name":"Sohler"},{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"}],"title":"Sublinear-time Algorithms","issue":"89","date_updated":"2022-01-06T06:53:50Z","page":"23--47","_id":"18672","status":"public","language":[{"iso":"eng"}],"type":"journal_article","year":"2006","date_created":"2020-08-31T08:18:02Z","publication":"EATCS Bulletin"},{"department":[{"_id":"79"}],"oa":"1","user_id":"15504","citation":{"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>.","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.","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.","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.","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} }","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.","short":"C. Scheideler, in: 6th International HNI Symposium on New Trends in Parallel and Distributed Computing, 2006."},"has_accepted_license":"1","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"file":[{"relation":"main_file","date_updated":"2018-04-13T09:59:14Z","file_size":85116,"file_name":"HNI-Symposium-06.pdf","creator":"florida","date_created":"2018-04-13T09:59:14Z","access_level":"open_access","content_type":"application/pdf","file_id":"2336"}],"title":"Towards a paradigm for robust distributed algorithms and data structures","urn":"22137","date_updated":"2022-01-06T06:55:27Z","file_date_updated":"2018-04-13T09:59:14Z","_id":"2213","status":"public","type":"conference","year":"2006","date_created":"2018-04-05T07:06:44Z","ddc":["040"],"publication":"6th International HNI Symposium on New Trends in Parallel and Distributed Computing"},{"department":[{"_id":"65"}],"user_id":"14955","citation":{"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>","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>","ieee":"G. Domik and F. Goetz, “A Breadth-First Approach for Teaching Computer Graphics,” in <i>EG Education Papers</i>, 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>.","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} }","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."},"doi":"10.2312/eged.20061001","author":[{"full_name":"Domik, Gitta","first_name":"Gitta","last_name":"Domik","id":"90"},{"last_name":"Goetz","full_name":"Goetz, Frank","first_name":"Frank"}],"editor":[{"first_name":"Judy","full_name":"Brown, Judy","last_name":"Brown"},{"last_name":"Hansmann","first_name":"Werner","full_name":"Hansmann, Werner"}],"title":"A Breadth-First Approach for Teaching Computer Graphics","date_updated":"2022-01-06T06:55:13Z","_id":"21777","page":"1-5","status":"public","type":"conference","year":"2006","language":[{"iso":"eng"}],"publisher":"The Eurographics Association","publication":"EG Education Papers","date_created":"2021-04-25T17:19:42Z"}]