[{"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"19613","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"user_id":"5786","volume":203,"year":"2006","status":"public","title":"Position-based Routing Strategies","publication_identifier":{"isbn":["978-3-939350-22-4"]},"author":[{"first_name":"Stefan","last_name":"Rührup","full_name":"Rührup, Stefan"}],"date_updated":"2022-01-06T06:54:08Z","intvolume":"       203","date_created":"2020-09-22T07:51:17Z","type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"supervisor":[{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"citation":{"chicago":"Rührup, Stefan. <i>Position-Based Routing Strategies</i>. Vol. 203. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","short":"S. Rührup, Position-Based Routing Strategies, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","ama":"Rührup S. <i>Position-Based Routing Strategies</i>. Vol 203. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006.","bibtex":"@book{Rührup_2006, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Position-based Routing Strategies}, volume={203}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Rührup, Stefan}, year={2006}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Rührup, Stefan. <i>Position-Based Routing Strategies</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","apa":"Rührup, S. (2006). <i>Position-based Routing Strategies</i> (Vol. 203). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"S. Rührup, <i>Position-based Routing Strategies</i>, vol. 203. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006."},"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20070301169","relation":"confirmation"}]}},{"publication":"Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA)","citation":{"mla":"Briest, Patrick, and Piotr Krysta. “Single-Minded Unlimited Supply Pricing on Sparse Instances.” <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA)</i>, 2006.","bibtex":"@inproceedings{Briest_Krysta_2006, title={Single-Minded Unlimited Supply Pricing on Sparse Instances}, booktitle={Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA)}, author={Briest, Patrick and Krysta, Piotr}, year={2006} }","ama":"Briest P, Krysta P. Single-Minded Unlimited Supply Pricing on Sparse Instances. In: <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA)</i>. ; 2006.","ieee":"P. Briest and P. Krysta, “Single-Minded Unlimited Supply Pricing on Sparse Instances,” in <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA)</i>, 2006.","apa":"Briest, P., &#38; Krysta, P. (2006). Single-Minded Unlimited Supply Pricing on Sparse Instances. In <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA)</i>.","chicago":"Briest, Patrick, and Piotr Krysta. “Single-Minded Unlimited Supply Pricing on Sparse Instances.” In <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA)</i>, 2006.","short":"P. Briest, P. Krysta, in: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006."},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-09-25T10:36:04Z","date_updated":"2022-01-06T06:54:10Z","title":"Single-Minded Unlimited Supply Pricing on Sparse Instances","status":"public","year":"2006","author":[{"first_name":"Patrick","last_name":"Briest","full_name":"Briest, Patrick"},{"full_name":"Krysta, Piotr","first_name":"Piotr","last_name":"Krysta"}],"user_id":"15415","_id":"19690","language":[{"iso":"eng"}]},{"user_id":"15415","_id":"19691","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:10Z","title":"Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels","status":"public","year":"2006","author":[{"full_name":"Briest, Patrick","first_name":"Patrick","last_name":"Briest"},{"full_name":"Gunia, Christian","first_name":"Christian","last_name":"Gunia"}],"type":"conference","department":[{"_id":"63"}],"date_created":"2020-09-25T10:38:20Z","publication":"Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC)","citation":{"chicago":"Briest, Patrick, and Christian Gunia. “Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels.” In <i>Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC)</i>, 2006.","short":"P. Briest, C. Gunia, in: Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC), 2006.","apa":"Briest, P., &#38; Gunia, C. (2006). Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels. In <i>Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC)</i>.","ieee":"P. Briest and C. Gunia, “Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels,” in <i>Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC)</i>, 2006.","ama":"Briest P, Gunia C. Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels. In: <i>Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC)</i>. ; 2006.","bibtex":"@inproceedings{Briest_Gunia_2006, title={Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels}, booktitle={Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC)}, author={Briest, Patrick and Gunia, Christian}, year={2006} }","mla":"Briest, Patrick, and Christian Gunia. “Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels.” <i>Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC)</i>, 2006."}},{"date_created":"2020-09-28T10:01:34Z","department":[{"_id":"63"}],"type":"mastersthesis","citation":{"short":"B. Degener, Die Analyse von Estimation-of-Distribution-Algorithmen Auf Ausgewählten Funktionen, 2006.","chicago":"Degener, Bastian. <i>Die Analyse von Estimation-of-Distribution-Algorithmen Auf Ausgewählten Funktionen</i>, 2006.","apa":"Degener, B. (2006). <i>Die Analyse von Estimation-of-Distribution-Algorithmen auf ausgewählten Funktionen</i>.","ieee":"B. Degener, <i>Die Analyse von Estimation-of-Distribution-Algorithmen auf ausgewählten Funktionen</i>. 2006.","ama":"Degener B. <i>Die Analyse von Estimation-of-Distribution-Algorithmen Auf Ausgewählten Funktionen</i>.; 2006.","bibtex":"@book{Degener_2006, title={Die Analyse von Estimation-of-Distribution-Algorithmen auf ausgewählten Funktionen}, author={Degener, Bastian}, year={2006} }","mla":"Degener, Bastian. <i>Die Analyse von Estimation-of-Distribution-Algorithmen Auf Ausgewählten Funktionen</i>. 2006."},"_id":"19718","language":[{"iso":"eng"}],"user_id":"15415","author":[{"first_name":"Bastian","last_name":"Degener","full_name":"Degener, Bastian"}],"year":"2006","title":"Die Analyse von Estimation-of-Distribution-Algorithmen auf ausgewählten Funktionen","status":"public","date_updated":"2022-01-06T06:54:10Z"},{"publication":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures  - SPAA '06","citation":{"ieee":"P. Mahlmann and C. Schindelhauer, “Distributed random digraph transformations for peer-to-peer networks,” in <i>Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures  - SPAA ’06</i>, 2006, pp. 308--317.","apa":"Mahlmann, P., &#38; Schindelhauer, C. (2006). Distributed random digraph transformations for peer-to-peer networks. In <i>Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures  - SPAA ’06</i> (pp. 308--317). <a href=\"https://doi.org/10.1145/1148109.1148162\">https://doi.org/10.1145/1148109.1148162</a>","chicago":"Mahlmann, Peter, and Christian Schindelhauer. “Distributed Random Digraph Transformations for Peer-to-Peer Networks.” In <i>Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA ’06</i>, 308--317, 2006. <a href=\"https://doi.org/10.1145/1148109.1148162\">https://doi.org/10.1145/1148109.1148162</a>.","short":"P. Mahlmann, C. Schindelhauer, in: Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA ’06, 2006, pp. 308--317.","mla":"Mahlmann, Peter, and Christian Schindelhauer. “Distributed Random Digraph Transformations for Peer-to-Peer Networks.” <i>Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA ’06</i>, 2006, pp. 308--317, doi:<a href=\"https://doi.org/10.1145/1148109.1148162\">10.1145/1148109.1148162</a>.","bibtex":"@inproceedings{Mahlmann_Schindelhauer_2006, title={Distributed random digraph transformations for peer-to-peer networks}, DOI={<a href=\"https://doi.org/10.1145/1148109.1148162\">10.1145/1148109.1148162</a>}, booktitle={Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures  - SPAA ’06}, author={Mahlmann, Peter and Schindelhauer, Christian}, year={2006}, pages={308--317} }","ama":"Mahlmann P, Schindelhauer C. Distributed random digraph transformations for peer-to-peer networks. In: <i>Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA ’06</i>. ; 2006:308--317. doi:<a href=\"https://doi.org/10.1145/1148109.1148162\">10.1145/1148109.1148162</a>"},"abstract":[{"text":"We study the problem of designing an adaptive hash table for redundant data storage in a system of storage devices with arbitrary capacities. Ideally, such a hash table should make sure that (a) a storage device with x% of the available capacity should get x% of the data, (b) the copies of each data item are distributed among the storage devices so that no two copies are stored at the same device, and (c) only a near-minimum amount of data replacements is necessary to preserve (a) and (b) under any change in the system. Hash tables satisfying (a) and (c) are already known, and it is not difficult to construct hash tables satisfying (a) and (b). However, no hash table is known so far that can satisfy all three properties as long as this is in principle possible. We present a strategy called SPREAD that solves this problem for the first time. As long as (a) and (b) can in principle be satisfied, SPREAD preserves (a) for every storage device nearly optimal, with high probability, guarantees (b) for every data item, and only needs a constant factor more data replacements than minimum possible in order to preserve (a) and (b).","lang":"eng"}],"date_created":"2020-09-30T13:07:55Z","type":"conference","department":[{"_id":"63"}],"status":"public","year":"2006","title":"Distributed random digraph transformations for peer-to-peer networks","author":[{"first_name":"Peter","last_name":"Mahlmann","full_name":"Mahlmann, Peter"},{"full_name":"Schindelhauer, Christian","last_name":"Schindelhauer","first_name":"Christian"}],"publication_identifier":{"isbn":["1595934529"]},"date_updated":"2022-01-06T06:54:13Z","publication_status":"published","page":"308--317","_id":"19808","language":[{"iso":"eng"}],"doi":"10.1145/1148109.1148162","user_id":"15415"},{"type":"conference","department":[{"_id":"63"}],"date_created":"2020-10-01T11:51:15Z","publication":"Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)","citation":{"mla":"Rührup, Stefan, and Christian Schindelhauer. “Online Multi-Path Routing in a Maze.” <i>Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)</i>, 2006, doi:<a href=\"https://doi.org/10.1007/11940128_65\">10.1007/11940128_65</a>.","bibtex":"@inproceedings{Rührup_Schindelhauer_2006, title={Online Multi-path Routing in a Maze}, DOI={<a href=\"https://doi.org/10.1007/11940128_65\">10.1007/11940128_65</a>}, booktitle={Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2006} }","ama":"Rührup S, Schindelhauer C. Online Multi-path Routing in a Maze. In: <i>Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)</i>. ; 2006. doi:<a href=\"https://doi.org/10.1007/11940128_65\">10.1007/11940128_65</a>","ieee":"S. Rührup and C. Schindelhauer, “Online Multi-path Routing in a Maze,” in <i>Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)</i>, 2006.","apa":"Rührup, S., &#38; Schindelhauer, C. (2006). Online Multi-path Routing in a Maze. In <i>Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)</i>. <a href=\"https://doi.org/10.1007/11940128_65\">https://doi.org/10.1007/11940128_65</a>","short":"S. Rührup, C. Schindelhauer, in: Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 2006.","chicago":"Rührup, Stefan, and Christian Schindelhauer. “Online Multi-Path Routing in a Maze.” In <i>Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)</i>, 2006. <a href=\"https://doi.org/10.1007/11940128_65\">https://doi.org/10.1007/11940128_65</a>."},"user_id":"15415","doi":"10.1007/11940128_65","_id":"19838","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:54:13Z","status":"public","year":"2006","title":"Online Multi-path Routing in a Maze","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540496946","9783540496960"]},"author":[{"last_name":"Rührup","first_name":"Stefan","full_name":"Rührup, Stefan"},{"full_name":"Schindelhauer, Christian","first_name":"Christian","last_name":"Schindelhauer"}]},{"date_updated":"2022-01-06T06:54:13Z","publication_status":"published","title":"SAN Optimal Multi Parameter Access Scheme","year":"2006","status":"public","author":[{"last_name":"Schindelhauer","first_name":"Christian","full_name":"Schindelhauer, Christian"},{"first_name":"Gunnar","last_name":"Schomaker","full_name":"Schomaker, Gunnar"}],"publication_identifier":{"isbn":["0769525520"]},"doi":"10.1109/icniconsmcl.2006.190","user_id":"15415","language":[{"iso":"eng"}],"_id":"19839","abstract":[{"lang":"eng","text":"Storage Area Networks commonly consist a more or less static set of n data servers that handle a dynamic collection of m documents. Such SANs can minimize the access time to documents by distributing each document among several servers, allowing users to access documents in parallel. This paper describes an efficient solution for providing parallel access to multiple hard disks for popular content. In extension to previous approaches we provide an efficient and elegant hash table data structure for utilizing the full capacity of each data server. Concerning the dynamics, documents as well as server may be added or removed from the system causing only local changes. We consider sequential and parallel access to data in the average case. For the average time model we present a fast optimal algorithm."}],"publication":"5th International Conference on Networking (ICN)","citation":{"chicago":"Schindelhauer, Christian, and Gunnar Schomaker. “SAN Optimal Multi Parameter Access Scheme.” In <i>5th International Conference on Networking (ICN)</i>, 2006. <a href=\"https://doi.org/10.1109/icniconsmcl.2006.190\">https://doi.org/10.1109/icniconsmcl.2006.190</a>.","short":"C. Schindelhauer, G. Schomaker, in: 5th International Conference on Networking (ICN), 2006.","ieee":"C. Schindelhauer and G. Schomaker, “SAN Optimal Multi Parameter Access Scheme,” 2006, doi: <a href=\"https://doi.org/10.1109/icniconsmcl.2006.190\">10.1109/icniconsmcl.2006.190</a>.","apa":"Schindelhauer, C., &#38; Schomaker, G. (2006). SAN Optimal Multi Parameter Access Scheme. <i>5th International Conference on Networking (ICN)</i>. <a href=\"https://doi.org/10.1109/icniconsmcl.2006.190\">https://doi.org/10.1109/icniconsmcl.2006.190</a>","bibtex":"@inproceedings{Schindelhauer_Schomaker_2006, title={SAN Optimal Multi Parameter Access Scheme}, DOI={<a href=\"https://doi.org/10.1109/icniconsmcl.2006.190\">10.1109/icniconsmcl.2006.190</a>}, booktitle={5th International Conference on Networking (ICN)}, author={Schindelhauer, Christian and Schomaker, Gunnar}, year={2006} }","ama":"Schindelhauer C, Schomaker G. SAN Optimal Multi Parameter Access Scheme. In: <i>5th International Conference on Networking (ICN)</i>. ; 2006. doi:<a href=\"https://doi.org/10.1109/icniconsmcl.2006.190\">10.1109/icniconsmcl.2006.190</a>","mla":"Schindelhauer, Christian, and Gunnar Schomaker. “SAN Optimal Multi Parameter Access Scheme.” <i>5th International Conference on Networking (ICN)</i>, 2006, doi:<a href=\"https://doi.org/10.1109/icniconsmcl.2006.190\">10.1109/icniconsmcl.2006.190</a>."},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-10-01T11:55:27Z"},{"place":"Universität Paderborn","date_created":"2020-10-01T12:01:15Z","type":"report","department":[{"_id":"63"}],"citation":{"apa":"Rührup, S., &#38; Schindelhauer, C. (2006). <i>Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks</i>. Universität Paderborn.","mla":"Rührup, Stefan, and Christian Schindelhauer. <i>Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks</i>. 2006.","ieee":"S. Rührup and C. Schindelhauer, <i>Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks</i>. Universität Paderborn, 2006.","chicago":"Rührup, Stefan, and Christian Schindelhauer. <i>Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks</i>. Universität Paderborn, 2006.","ama":"Rührup S, Schindelhauer C. <i>Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks</i>. Universität Paderborn; 2006.","short":"S. Rührup, C. Schindelhauer, Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks, Universität Paderborn, 2006.","bibtex":"@book{Rührup_Schindelhauer_2006, place={Universität Paderborn}, title={Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2006} }"},"_id":"19840","language":[{"iso":"eng"}],"user_id":"15415","title":"Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks","year":"2006","status":"public","author":[{"first_name":"Stefan","last_name":"Rührup","full_name":"Rührup, Stefan"},{"first_name":"Christian","last_name":"Schindelhauer","full_name":"Schindelhauer, Christian"}],"date_updated":"2022-01-06T06:54:13Z"},{"user_id":"15415","_id":"19854","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:13Z","author":[{"full_name":"Schomaker, Gunnar","last_name":"Schomaker","first_name":"Gunnar"},{"first_name":"Christoph","last_name":"Loeser","full_name":"Loeser, Christoph"},{"full_name":"Schubert, Matthias","last_name":"Schubert","first_name":"Matthias"}],"title":"Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks","year":"2006","status":"public","department":[{"_id":"63"}],"type":"conference","date_created":"2020-10-02T11:57:06Z","abstract":[{"lang":"eng","text":"In previous publications there have been several proposals<br>regarding replica generation and placement of movie content in<br>content-distribution-networks or P2P overlays. Within this paper<br>we extend approaches for heterogeneous placement scenarios<br>described in prior publications. Therefor we presume heterogeneous<br>server peers' bandwidth, HD capacity, and movie popularities.<br>Movie documents are replicated and placed onto server peers with<br>respect to the predicted popularity values. Thus each document<br>aims to gain fair networks resources according to its popularity.<br>We present simulation results of heuristics of different placement<br>strategies and compare them with a near optimal technique."}],"citation":{"apa":"Schomaker, G., Loeser, C., &#38; Schubert, M. (2006). Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks. In <i>5th International Conference on Networking (ICN).</i>","ieee":"G. Schomaker, C. Loeser, and M. Schubert, “Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks,” in <i>5th International Conference on Networking (ICN).</i>, 2006.","chicago":"Schomaker, Gunnar, Christoph Loeser, and Matthias Schubert. “Predictive Replication and Placement Strategies for Movie Documents in Heterogeneous Content Delivery Networks.” In <i>5th International Conference on Networking (ICN).</i>, 2006.","short":"G. Schomaker, C. Loeser, M. Schubert, in: 5th International Conference on Networking (ICN)., 2006.","mla":"Schomaker, Gunnar, et al. “Predictive Replication and Placement Strategies for Movie Documents in Heterogeneous Content Delivery Networks.” <i>5th International Conference on Networking (ICN).</i>, 2006.","ama":"Schomaker G, Loeser C, Schubert M. Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks. In: <i>5th International Conference on Networking (ICN).</i> ; 2006.","bibtex":"@inproceedings{Schomaker_Loeser_Schubert_2006, title={Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks}, booktitle={5th International Conference on Networking (ICN).}, author={Schomaker, Gunnar and Loeser, Christoph and Schubert, Matthias}, year={2006} }"},"publication":"5th International Conference on Networking (ICN)."},{"publication_identifier":{"isbn":["0769525520"]},"author":[{"full_name":"Brinkmann, Andre","last_name":"Brinkmann","first_name":"Andre"},{"full_name":"Effert, Sascha","last_name":"Effert","first_name":"Sascha"},{"full_name":"Heidebuer, Michael","last_name":"Heidebuer","first_name":"Michael"},{"last_name":"Vodisek","first_name":"Mario","full_name":"Vodisek, Mario"}],"title":"Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments","year":"2006","status":"public","date_updated":"2022-01-06T06:54:14Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"19870","doi":"10.1109/icniconsmcl.2006.182","user_id":"15415","citation":{"bibtex":"@inproceedings{Brinkmann_Effert_Heidebuer_Vodisek_2006, title={Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments}, DOI={<a href=\"https://doi.org/10.1109/icniconsmcl.2006.182\">10.1109/icniconsmcl.2006.182</a>}, booktitle={5th International Conference on Networking (ICN)}, author={Brinkmann, Andre and Effert, Sascha and Heidebuer, Michael and Vodisek, Mario}, year={2006} }","ama":"Brinkmann A, Effert S, Heidebuer M, Vodisek M. Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments. In: <i>5th International Conference on Networking (ICN)</i>. ; 2006. doi:<a href=\"https://doi.org/10.1109/icniconsmcl.2006.182\">10.1109/icniconsmcl.2006.182</a>","mla":"Brinkmann, Andre, et al. “Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments.” <i>5th International Conference on Networking (ICN)</i>, 2006, doi:<a href=\"https://doi.org/10.1109/icniconsmcl.2006.182\">10.1109/icniconsmcl.2006.182</a>.","short":"A. Brinkmann, S. Effert, M. Heidebuer, M. Vodisek, in: 5th International Conference on Networking (ICN), 2006.","chicago":"Brinkmann, Andre, Sascha Effert, Michael Heidebuer, and Mario Vodisek. “Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments.” In <i>5th International Conference on Networking (ICN)</i>, 2006. <a href=\"https://doi.org/10.1109/icniconsmcl.2006.182\">https://doi.org/10.1109/icniconsmcl.2006.182</a>.","ieee":"A. Brinkmann, S. Effert, M. Heidebuer, and M. Vodisek, “Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments,” 2006, doi: <a href=\"https://doi.org/10.1109/icniconsmcl.2006.182\">10.1109/icniconsmcl.2006.182</a>.","apa":"Brinkmann, A., Effert, S., Heidebuer, M., &#38; Vodisek, M. (2006). Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments. <i>5th International Conference on Networking (ICN)</i>. <a href=\"https://doi.org/10.1109/icniconsmcl.2006.182\">https://doi.org/10.1109/icniconsmcl.2006.182</a>"},"publication":"5th International Conference on Networking (ICN)","date_created":"2020-10-05T08:38:26Z","department":[{"_id":"63"},{"_id":"58"}],"type":"conference"},{"date_created":"2020-10-06T13:32:47Z","department":[{"_id":"63"}],"type":"conference","citation":{"ieee":"M. Kortenjan and G. Schomaker, “Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes,” in <i>4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)</i>, 2006.","apa":"Kortenjan, M., &#38; Schomaker, G. (2006). Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes. In <i>4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)</i>. <a href=\"https://doi.org/10.1145/1108590.1108608\">https://doi.org/10.1145/1108590.1108608</a>","chicago":"Kortenjan, Michael, and Gunnar Schomaker. “Size Equivalent Cluster Trees (SEC-Trees) Realtime Rendering of Large Industrial Scenes.” In <i>4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)</i>, 2006. <a href=\"https://doi.org/10.1145/1108590.1108608\">https://doi.org/10.1145/1108590.1108608</a>.","short":"M. Kortenjan, G. Schomaker, in: 4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006), 2006.","mla":"Kortenjan, Michael, and Gunnar Schomaker. “Size Equivalent Cluster Trees (SEC-Trees) Realtime Rendering of Large Industrial Scenes.” <i>4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)</i>, 2006, doi:<a href=\"https://doi.org/10.1145/1108590.1108608\">10.1145/1108590.1108608</a>.","bibtex":"@inproceedings{Kortenjan_Schomaker_2006, title={Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes}, DOI={<a href=\"https://doi.org/10.1145/1108590.1108608\">10.1145/1108590.1108608</a>}, booktitle={4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)}, author={Kortenjan, Michael and Schomaker, Gunnar}, year={2006} }","ama":"Kortenjan M, Schomaker G. Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes. In: <i>4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)</i>. ; 2006. doi:<a href=\"https://doi.org/10.1145/1108590.1108608\">10.1145/1108590.1108608</a>"},"publication":"4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)","abstract":[{"text":"#hniid 2484","lang":"eng"}],"_id":"19932","language":[{"iso":"eng"}],"doi":"10.1145/1108590.1108608","user_id":"15415","author":[{"last_name":"Kortenjan","first_name":"Michael","full_name":"Kortenjan, Michael"},{"full_name":"Schomaker, Gunnar","first_name":"Gunnar","last_name":"Schomaker"}],"title":"Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes","year":"2006","status":"public","date_updated":"2022-01-06T06:54:14Z"},{"abstract":[{"lang":"eng","text":"We propose a dynamic, ad-hoc communication network consisting of mobile units that can warn about traffic jams on motorways.\r\n\r\nOur goal is to provide a practical, low cost solution. Therefore we consider very simple wireless communication hardware, without collision detection, with very small bandwidth and a probabilistic model of link failure.\r\n\r\nWe provide a complete system architecture. For this purpose we design and analyze solutions for size approximation, leader election and broadcasting. Our algorithms are fine-tuned for fast operation in a practical setting. We provide both a theoretical and experimental evaluation of our solutions.\r\n\r\nOur contribution is much different from the previous work, where either pure theoretical models with a pure theoretical analysis are provided or algorithms working in practical models are evaluated only through simulations."}],"citation":{"ama":"Kutyłowski J, Zagórski F. Reliable Broadcasting Without Collision Detection. In: <i>SOFSEM 2006: Theory and Practice of Computer Science</i>. ; 2006. doi:<a href=\"https://doi.org/10.1007/11611257_37\">10.1007/11611257_37</a>","bibtex":"@inproceedings{Kutyłowski_Zagórski_2006, place={Berlin, Heidelberg}, title={Reliable Broadcasting Without Collision Detection}, DOI={<a href=\"https://doi.org/10.1007/11611257_37\">10.1007/11611257_37</a>}, booktitle={SOFSEM 2006: Theory and Practice of Computer Science}, author={Kutyłowski, Jarosław and Zagórski, Filip}, year={2006} }","mla":"Kutyłowski, Jarosław, and Filip Zagórski. “Reliable Broadcasting Without Collision Detection.” <i>SOFSEM 2006: Theory and Practice of Computer Science</i>, 2006, doi:<a href=\"https://doi.org/10.1007/11611257_37\">10.1007/11611257_37</a>.","short":"J. Kutyłowski, F. Zagórski, in: SOFSEM 2006: Theory and Practice of Computer Science, Berlin, Heidelberg, 2006.","chicago":"Kutyłowski, Jarosław, and Filip Zagórski. “Reliable Broadcasting Without Collision Detection.” In <i>SOFSEM 2006: Theory and Practice of Computer Science</i>. Berlin, Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11611257_37\">https://doi.org/10.1007/11611257_37</a>.","apa":"Kutyłowski, J., &#38; Zagórski, F. (2006). Reliable Broadcasting Without Collision Detection. <i>SOFSEM 2006: Theory and Practice of Computer Science</i>. <a href=\"https://doi.org/10.1007/11611257_37\">https://doi.org/10.1007/11611257_37</a>","ieee":"J. Kutyłowski and F. Zagórski, “Reliable Broadcasting Without Collision Detection,” 2006, doi: <a href=\"https://doi.org/10.1007/11611257_37\">10.1007/11611257_37</a>."},"publication":"SOFSEM 2006: Theory and Practice of Computer Science","department":[{"_id":"63"}],"type":"conference","place":"Berlin, Heidelberg","date_created":"2021-09-13T13:28:29Z","date_updated":"2022-01-06T06:56:13Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"]},"author":[{"first_name":"Jarosław","last_name":"Kutyłowski","full_name":"Kutyłowski, Jarosław"},{"last_name":"Zagórski","first_name":"Filip","full_name":"Zagórski, Filip"}],"title":"Reliable Broadcasting Without Collision Detection","year":"2006","status":"public","doi":"10.1007/11611257_37","user_id":"15415","_id":"24277","language":[{"iso":"eng"}]},{"date_created":"2021-10-28T08:33:09Z","department":[{"_id":"63"},{"_id":"26"}],"type":"conference","citation":{"ama":"Brinkmann A, Effert S, Heidebuer M, Vodisek M. Influence of adaptive data layouts on performance in dynamically changing storage environments. In: <i>14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06)</i>. ; 2006. doi:<a href=\"https://doi.org/10.1109/pdp.2006.44\">10.1109/pdp.2006.44</a>","bibtex":"@inproceedings{Brinkmann_Effert_Heidebuer_Vodisek_2006, title={Influence of adaptive data layouts on performance in dynamically changing storage environments}, DOI={<a href=\"https://doi.org/10.1109/pdp.2006.44\">10.1109/pdp.2006.44</a>}, booktitle={14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06)}, author={Brinkmann, Andre and Effert, Sascha  and Heidebuer, Michael and Vodisek, Mario}, year={2006} }","mla":"Brinkmann, Andre, et al. “Influence of Adaptive Data Layouts on Performance in Dynamically Changing Storage Environments.” <i>14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06)</i>, 2006, doi:<a href=\"https://doi.org/10.1109/pdp.2006.44\">10.1109/pdp.2006.44</a>.","short":"A. Brinkmann, S. Effert, M. Heidebuer, M. Vodisek, in: 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06), 2006.","chicago":"Brinkmann, Andre, Sascha  Effert, Michael Heidebuer, and Mario Vodisek. “Influence of Adaptive Data Layouts on Performance in Dynamically Changing Storage Environments.” In <i>14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06)</i>, 2006. <a href=\"https://doi.org/10.1109/pdp.2006.44\">https://doi.org/10.1109/pdp.2006.44</a>.","apa":"Brinkmann, A., Effert, S., Heidebuer, M., &#38; Vodisek, M. (2006). Influence of adaptive data layouts on performance in dynamically changing storage environments. <i>14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06)</i>. <a href=\"https://doi.org/10.1109/pdp.2006.44\">https://doi.org/10.1109/pdp.2006.44</a>","ieee":"A. Brinkmann, S. Effert, M. Heidebuer, and M. Vodisek, “Influence of adaptive data layouts on performance in dynamically changing storage environments,” 2006, doi: <a href=\"https://doi.org/10.1109/pdp.2006.44\">10.1109/pdp.2006.44</a>."},"publication":"14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'06)","abstract":[{"text":"For most of today's IT environments, the tremendous need for storage capacity in combination with a required minimum I/O performance has become highly critical. In dynamically growing environments, a storage management solution's underlying data distribution scheme has great impact to the overall system I/O performance. The evaluation of a number of open system storage visualization solutions and volume managers has shown that all of them lack the ability to automatically adapt to changing access patterns and storage infrastructures; many of them require an error prone manual re-layout of the data blocks, or rely on a very time consuming re-striping of all available data. This paper evaluates the performance of conventional data distribution approaches compared to the adaptive virtualization solution V:DRIVE in dynamically changing storage environments. Changes of the storage infrastructure are normally not considered in benchmark results, but can have a significant impact on storage performance. Using synthetic benchmarks, V:DRIVE is compared in such changing environments with the non-adaptive Linux logical volume manager (LVM). The performance results of our tests clearly outline the necessity of adaptive data distribution schemes.","lang":"eng"}],"language":[{"iso":"eng"}],"_id":"26988","doi":"10.1109/pdp.2006.44","user_id":"15415","author":[{"last_name":"Brinkmann","first_name":"Andre","full_name":"Brinkmann, Andre"},{"full_name":"Effert, Sascha ","first_name":"Sascha ","last_name":"Effert"},{"full_name":"Heidebuer, Michael","first_name":"Michael","last_name":"Heidebuer"},{"last_name":"Vodisek","first_name":"Mario","full_name":"Vodisek, Mario"}],"status":"public","year":"2006","title":"Influence of adaptive data layouts on performance in dynamically changing storage environments","date_updated":"2022-01-06T06:57:31Z","publication_status":"published"},{"place":"Paderborn","date_created":"2020-07-27T13:00:52Z","department":[{"_id":"63"},{"_id":"26"}],"type":"conference_editor","citation":{"bibtex":"@book{Rammig_Dangelmaier_Karl_Mertsching_Meyer auf der Heide_Trächtler_2006, place={Paderborn}, series={Proceedings of the 6th International Heinz Nixdorf Symposium}, title={Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, year={2006}, collection={Proceedings of the 6th International Heinz Nixdorf Symposium} }","short":"F.-J. Rammig, W. Dangelmaier, H. Karl, B. Mertsching, F. Meyer auf der Heide, A. Trächtler, eds., Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","ama":"Rammig F-J, Dangelmaier W, Karl H, Mertsching B, Meyer auf der Heide F, Trächtler A, eds. <i>Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2006.","chicago":"Rammig, Franz-Josef, Wilhelm Dangelmaier, Holger Karl, Bärbel Mertsching, Friedhelm Meyer auf der Heide, and Ansgar Trächtler, eds. <i>Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems</i>. Proceedings of the 6th International Heinz Nixdorf Symposium. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2006.","ieee":"F.-J. Rammig, W. Dangelmaier, H. Karl, B. Mertsching, F. Meyer auf der Heide, and A. Trächtler, Eds., <i>Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems</i>. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2006.","apa":"Rammig, F.-J., Dangelmaier, W., Karl, H., Mertsching, B., Meyer auf der Heide, F., &#38; Trächtler, A. (Eds.). (2006). <i>Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts.","mla":"Rammig, Franz-Josef, et al., editors. <i>Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2006."},"abstract":[{"lang":"eng","text":"We present a parallel algorithm for the rendering of complex three-dimensional scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting of a visualization-node, equipped with a powerful graphics adapter, and cluster nodes requiring weaker graphics capabilities only. The visualization-node renders a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes assist the visualization-node by asynchronous computing of Reliefboards, which are used to replace and render distant parts of the scene. Our algorithm is capable of gaining significant speedups if the cluster's nodes provide weak graphics adapters only. We trade the number of cluster nodes off the scene objects' image quality."}],"_id":"17417","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","language":[{"iso":"eng"}],"series_title":"Proceedings of the 6th International Heinz Nixdorf Symposium","editor":[{"full_name":"Rammig, Franz-Josef","last_name":"Rammig","first_name":"Franz-Josef"},{"first_name":"Wilhelm","last_name":"Dangelmaier","full_name":"Dangelmaier, Wilhelm"},{"id":"126","first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger"},{"full_name":"Mertsching, Bärbel","last_name":"Mertsching","first_name":"Bärbel"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"last_name":"Trächtler","first_name":"Ansgar","full_name":"Trächtler, Ansgar"}],"user_id":"15415","status":"public","year":"2006","title":"Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems","date_updated":"2022-01-06T06:53:11Z"},{"user_id":"5786","alternative_title":["6th international Heinz Nixdorf symposium, January 17 - 18, 2006, Heinz Nixdorf MuseumsForum: within the scope of the {DFG} Collaborative Research Centre 376 Massively Parallel Computing: algorithms, design, methods, applications"],"volume":181,"_id":"17475","language":[{"iso":"eng"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_updated":"2022-01-06T06:53:12Z","intvolume":"       181","year":"2006","title":"New trends in parallel and distributed computing","status":"public","author":[{"last_name":"Monien","first_name":"Burkhard","full_name":"Monien, Burkhard"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publication_identifier":{"isbn":["978-3-939350-00-2"]},"type":"book","department":[{"_id":"63"},{"_id":"26"}],"date_created":"2020-07-30T09:18:30Z","citation":{"short":"B. Monien, F. Meyer auf der Heide, New Trends in Parallel and Distributed Computing, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","chicago":"Monien, Burkhard, and Friedhelm Meyer auf der Heide. <i>New Trends in Parallel and Distributed Computing</i>. Vol. 181. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","apa":"Monien, B., &#38; Meyer auf der Heide, F. (2006). <i>New trends in parallel and distributed computing</i> (Vol. 181). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"B. Monien and F. Meyer auf der Heide, <i>New trends in parallel and distributed computing</i>, vol. 181. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","ama":"Monien B, Meyer auf der Heide F. <i>New Trends in Parallel and Distributed Computing</i>. Vol 181. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006.","bibtex":"@book{Monien_Meyer auf der Heide_2006, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={New trends in parallel and distributed computing}, volume={181}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Monien, Burkhard and Meyer auf der Heide, Friedhelm}, year={2006}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Monien, Burkhard, and Friedhelm Meyer auf der Heide. <i>New Trends in Parallel and Distributed Computing</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006."}},{"date_updated":"2022-01-06T06:53:16Z","year":"2006","title":"Directional Communication in Mobile Ad Hoc Networks","status":"public","author":[{"full_name":"Grünewald, Matthias","first_name":"Matthias","last_name":"Grünewald"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Rührup, Stefan","first_name":"Stefan","last_name":"Rührup"},{"full_name":"Schindelhauer, Christian","first_name":"Christian","last_name":"Schindelhauer"},{"full_name":"Volbert, Klaus","first_name":"Klaus","last_name":"Volbert"}],"user_id":"15415","page":"225-234","_id":"17619","language":[{"iso":"eng"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","publication":"New Trends in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf Symposium","citation":{"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.","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.","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.","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."},"type":"conference","department":[{"_id":"63"},{"_id":"26"}],"date_created":"2020-08-05T09:36:46Z","place":"Paderborn"},{"type":"conference","department":[{"_id":"63"}],"date_created":"2020-08-31T08:25:01Z","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"}],"publication":"Proceedings of  the European Conference on Complex Systems (ECCS'06)","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>.","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.","short":"C. Sohler, G. Frahling, A. Marchetti-Spaccamela, S. Leonardi, L. Buriol, in: Proceedings of  the European Conference on Complex Systems (ECCS’06), 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.","mla":"Sohler, Christian, et al. “Computing Clustering Coefficients in Data Streams.” <i>Proceedings of  the European Conference on Complex Systems (ECCS’06)</i>, 2006.","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.","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} }"},"user_id":"15415","language":[{"iso":"eng"}],"_id":"18676","date_updated":"2022-01-06T06:53:50Z","status":"public","title":"Computing Clustering Coefficients in Data Streams","year":"2006","author":[{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"},{"full_name":"Frahling, Gereon","last_name":"Frahling","first_name":"Gereon"},{"last_name":"Marchetti-Spaccamela","first_name":"Alberto","full_name":"Marchetti-Spaccamela, Alberto"},{"first_name":"Stefano","last_name":"Leonardi","full_name":"Leonardi, Stefano"},{"first_name":"Luciana","last_name":"Buriol","full_name":"Buriol, Luciana"}]},{"department":[{"_id":"63"}],"type":"conference","date_created":"2020-09-01T10:34:00Z","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.","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.","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} }","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.).","ieee":"C. Sohler, G. Frahling, A. Marchetti-Spaccamela, S. Leonardi, and L. Buriol, “Counting Triangles in Data Streams,” 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.","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."},"user_id":"15415","_id":"18745","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:51Z","author":[{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"},{"first_name":"Gereon","last_name":"Frahling","full_name":"Frahling, Gereon"},{"last_name":"Marchetti-Spaccamela","first_name":"Alberto","full_name":"Marchetti-Spaccamela, Alberto"},{"first_name":"Stefano","last_name":"Leonardi","full_name":"Leonardi, Stefano"},{"first_name":"Luciana","last_name":"Buriol","full_name":"Buriol, Luciana"}],"corporate_editor":["Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS)"],"year":"2006","title":"Counting Triangles in Data Streams","status":"public"},{"publication":"Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","citation":{"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.","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.","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} }","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>.","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.","short":"C. Sohler, J. Gehweiler, C. Lammersen, in: Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 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."},"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"}],"date_created":"2020-09-01T10:38:29Z","type":"conference","department":[{"_id":"63"}],"title":"A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem","year":"2006","status":"public","author":[{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"},{"last_name":"Gehweiler","first_name":"Joachim","full_name":"Gehweiler, Joachim"},{"full_name":"Lammersen, Christiane","last_name":"Lammersen","first_name":"Christiane"}],"date_updated":"2022-01-06T06:53:51Z","_id":"18746","language":[{"iso":"eng"}],"user_id":"15415"},{"title":"Power-Aware Collective Tree Exploration","status":"public","year":"2006","publication_identifier":{"isbn":["9783540327653","9783540327660"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Dynia, Miroslaw","first_name":"Miroslaw","last_name":"Dynia"},{"full_name":"Korzeniowski, Miroslaw","first_name":"Miroslaw","last_name":"Korzeniowski"},{"last_name":"Schindelhauer","first_name":"Christian","full_name":"Schindelhauer, Christian"}],"date_updated":"2022-01-06T06:53:54Z","publication_status":"published","page":"341--351","_id":"18926","language":[{"iso":"eng"}],"doi":"10.1007/11682127_24","user_id":"15415","publication":"Architecture of Computing Systems - ARCS","issue":"3894","citation":{"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} }","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>","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>.","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>.","short":"M. Dynia, M. Korzeniowski, C. Schindelhauer, in: Architecture of Computing Systems - ARCS, 2006, pp. 341--351.","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.","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>"},"date_created":"2020-09-03T10:13:56Z","type":"conference","department":[{"_id":"63"}]}]