--- _id: '19613' author: - first_name: Stefan full_name: Rührup, Stefan last_name: Rührup citation: ama: Rührup S. Position-Based Routing Strategies. Vol 203. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006. apa: Rührup, S. (2006). Position-based Routing Strategies (Vol. 203). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. 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} }' chicago: Rührup, Stefan. Position-Based Routing Strategies. Vol. 203. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006. ieee: S. Rührup, Position-based Routing Strategies, vol. 203. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006. mla: Rührup, Stefan. Position-Based Routing Strategies. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006. short: S. Rührup, Position-Based Routing Strategies, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006. date_created: 2020-09-22T07:51:17Z date_updated: 2022-01-06T06:54:08Z department: - _id: '63' - _id: '26' intvolume: ' 203' language: - iso: eng publication_identifier: isbn: - 978-3-939350-22-4 publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn related_material: link: - relation: confirmation url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20070301169 series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Position-based Routing Strategies type: dissertation user_id: '5786' volume: 203 year: '2006' ... --- _id: '19690' author: - first_name: Patrick full_name: Briest, Patrick last_name: Briest - first_name: Piotr full_name: Krysta, Piotr last_name: Krysta citation: ama: 'Briest P, Krysta P. Single-Minded Unlimited Supply Pricing on Sparse Instances. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA). ; 2006.' apa: Briest, P., & Krysta, P. (2006). Single-Minded Unlimited Supply Pricing on Sparse Instances. In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA). 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} }' chicago: Briest, Patrick, and Piotr Krysta. “Single-Minded Unlimited Supply Pricing on Sparse Instances.” In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006. ieee: P. Briest and P. Krysta, “Single-Minded Unlimited Supply Pricing on Sparse Instances,” in Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006. mla: Briest, Patrick, and Piotr Krysta. “Single-Minded Unlimited Supply Pricing on Sparse Instances.” Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006. short: 'P. Briest, P. Krysta, in: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006.' date_created: 2020-09-25T10:36:04Z date_updated: 2022-01-06T06:54:10Z department: - _id: '63' language: - iso: eng publication: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA) status: public title: Single-Minded Unlimited Supply Pricing on Sparse Instances type: conference user_id: '15415' year: '2006' ... --- _id: '19691' author: - first_name: Patrick full_name: Briest, Patrick last_name: Briest - first_name: Christian full_name: Gunia, Christian last_name: Gunia citation: ama: 'Briest P, Gunia C. Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels. In: Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC). ; 2006.' apa: Briest, P., & Gunia, C. (2006). Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels. In Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC). 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} }' chicago: Briest, Patrick, and Christian Gunia. “Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels.” In Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC), 2006. ieee: P. Briest and C. Gunia, “Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels,” in Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC), 2006. mla: Briest, Patrick, and Christian Gunia. “Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels.” Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC), 2006. short: 'P. Briest, C. Gunia, in: Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC), 2006.' date_created: 2020-09-25T10:38:20Z date_updated: 2022-01-06T06:54:10Z department: - _id: '63' language: - iso: eng publication: Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC) status: public title: Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels type: conference user_id: '15415' year: '2006' ... --- _id: '19718' author: - first_name: Bastian full_name: Degener, Bastian last_name: Degener citation: ama: Degener B. Die Analyse von Estimation-of-Distribution-Algorithmen Auf Ausgewählten Funktionen.; 2006. apa: Degener, B. (2006). Die Analyse von Estimation-of-Distribution-Algorithmen auf ausgewählten Funktionen. bibtex: '@book{Degener_2006, title={Die Analyse von Estimation-of-Distribution-Algorithmen auf ausgewählten Funktionen}, author={Degener, Bastian}, year={2006} }' chicago: Degener, Bastian. Die Analyse von Estimation-of-Distribution-Algorithmen Auf Ausgewählten Funktionen, 2006. ieee: B. Degener, Die Analyse von Estimation-of-Distribution-Algorithmen auf ausgewählten Funktionen. 2006. mla: Degener, Bastian. Die Analyse von Estimation-of-Distribution-Algorithmen Auf Ausgewählten Funktionen. 2006. short: B. Degener, Die Analyse von Estimation-of-Distribution-Algorithmen Auf Ausgewählten Funktionen, 2006. date_created: 2020-09-28T10:01:34Z date_updated: 2022-01-06T06:54:10Z department: - _id: '63' language: - iso: eng status: public title: Die Analyse von Estimation-of-Distribution-Algorithmen auf ausgewählten Funktionen type: mastersthesis user_id: '15415' year: '2006' ... --- _id: '19808' abstract: - lang: eng 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). author: - first_name: Peter full_name: Mahlmann, Peter last_name: Mahlmann - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: 'Mahlmann P, Schindelhauer C. Distributed random digraph transformations for peer-to-peer networks. In: Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA ’06. ; 2006:308--317. doi:10.1145/1148109.1148162' apa: Mahlmann, P., & Schindelhauer, C. (2006). Distributed random digraph transformations for peer-to-peer networks. In Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures  - SPAA ’06 (pp. 308--317). https://doi.org/10.1145/1148109.1148162 bibtex: '@inproceedings{Mahlmann_Schindelhauer_2006, title={Distributed random digraph transformations for peer-to-peer networks}, DOI={10.1145/1148109.1148162}, 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} }' chicago: Mahlmann, Peter, and Christian Schindelhauer. “Distributed Random Digraph Transformations for Peer-to-Peer Networks.” In Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA ’06, 308--317, 2006. https://doi.org/10.1145/1148109.1148162. ieee: P. Mahlmann and C. Schindelhauer, “Distributed random digraph transformations for peer-to-peer networks,” 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.” Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA ’06, 2006, pp. 308--317, doi:10.1145/1148109.1148162. 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.' date_created: 2020-09-30T13:07:55Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1145/1148109.1148162 language: - iso: eng page: 308--317 publication: Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '06 publication_identifier: isbn: - '1595934529' publication_status: published status: public title: Distributed random digraph transformations for peer-to-peer networks type: conference user_id: '15415' year: '2006' ... --- _id: '19838' author: - first_name: Stefan full_name: Rührup, Stefan last_name: Rührup - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: 'Rührup S, Schindelhauer C. Online Multi-path Routing in a Maze. In: Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006). ; 2006. doi:10.1007/11940128_65' apa: Rührup, S., & Schindelhauer, C. (2006). Online Multi-path Routing in a Maze. In Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006). https://doi.org/10.1007/11940128_65 bibtex: '@inproceedings{Rührup_Schindelhauer_2006, title={Online Multi-path Routing in a Maze}, DOI={10.1007/11940128_65}, booktitle={Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2006} }' chicago: Rührup, Stefan, and Christian Schindelhauer. “Online Multi-Path Routing in a Maze.” In Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 2006. https://doi.org/10.1007/11940128_65. ieee: S. Rührup and C. Schindelhauer, “Online Multi-path Routing in a Maze,” in Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 2006. mla: Rührup, Stefan, and Christian Schindelhauer. “Online Multi-Path Routing in a Maze.” Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 2006, doi:10.1007/11940128_65. short: 'S. Rührup, C. Schindelhauer, in: Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 2006.' date_created: 2020-10-01T11:51:15Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1007/11940128_65 language: - iso: eng publication: Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006) publication_identifier: isbn: - '9783540496946' - '9783540496960' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Online Multi-path Routing in a Maze type: conference user_id: '15415' year: '2006' ... --- _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. author: - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer - first_name: Gunnar full_name: Schomaker, Gunnar last_name: Schomaker citation: ama: 'Schindelhauer C, Schomaker G. SAN Optimal Multi Parameter Access Scheme. In: 5th International Conference on Networking (ICN). ; 2006. doi:10.1109/icniconsmcl.2006.190' apa: Schindelhauer, C., & Schomaker, G. (2006). SAN Optimal Multi Parameter Access Scheme. 5th International Conference on Networking (ICN). https://doi.org/10.1109/icniconsmcl.2006.190 bibtex: '@inproceedings{Schindelhauer_Schomaker_2006, title={SAN Optimal Multi Parameter Access Scheme}, DOI={10.1109/icniconsmcl.2006.190}, booktitle={5th International Conference on Networking (ICN)}, author={Schindelhauer, Christian and Schomaker, Gunnar}, year={2006} }' chicago: Schindelhauer, Christian, and Gunnar Schomaker. “SAN Optimal Multi Parameter Access Scheme.” In 5th International Conference on Networking (ICN), 2006. https://doi.org/10.1109/icniconsmcl.2006.190. ieee: 'C. Schindelhauer and G. Schomaker, “SAN Optimal Multi Parameter Access Scheme,” 2006, doi: 10.1109/icniconsmcl.2006.190.' mla: Schindelhauer, Christian, and Gunnar Schomaker. “SAN Optimal Multi Parameter Access Scheme.” 5th International Conference on Networking (ICN), 2006, doi:10.1109/icniconsmcl.2006.190. short: 'C. Schindelhauer, G. Schomaker, in: 5th International Conference on Networking (ICN), 2006.' date_created: 2020-10-01T11:55:27Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1109/icniconsmcl.2006.190 language: - iso: eng publication: 5th International Conference on Networking (ICN) publication_identifier: isbn: - '0769525520' publication_status: published status: public title: SAN Optimal Multi Parameter Access Scheme type: conference user_id: '15415' year: '2006' ... --- _id: '19840' author: - first_name: Stefan full_name: Rührup, Stefan last_name: Rührup - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: Rührup S, Schindelhauer C. Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks. Universität Paderborn; 2006. apa: Rührup, S., & Schindelhauer, C. (2006). Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks. Universität Paderborn. 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} }' chicago: Rührup, Stefan, and Christian Schindelhauer. Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks. Universität Paderborn, 2006. ieee: S. Rührup and C. Schindelhauer, Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks. Universität Paderborn, 2006. mla: Rührup, Stefan, and Christian Schindelhauer. Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks. 2006. short: S. Rührup, C. Schindelhauer, Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks, Universität Paderborn, 2006. date_created: 2020-10-01T12:01:15Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' language: - iso: eng place: Universität Paderborn status: public title: Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks type: report user_id: '15415' year: '2006' ... --- _id: '19854' abstract: - lang: eng text: In previous publications there have been several proposals
regarding replica generation and placement of movie content in
content-distribution-networks or P2P overlays. Within this paper
we extend approaches for heterogeneous placement scenarios
described in prior publications. Therefor we presume heterogeneous
server peers' bandwidth, HD capacity, and movie popularities.
Movie documents are replicated and placed onto server peers with
respect to the predicted popularity values. Thus each document
aims to gain fair networks resources according to its popularity.
We present simulation results of heuristics of different placement
strategies and compare them with a near optimal technique. author: - first_name: Gunnar full_name: Schomaker, Gunnar last_name: Schomaker - first_name: Christoph full_name: Loeser, Christoph last_name: Loeser - first_name: Matthias full_name: Schubert, Matthias last_name: Schubert citation: ama: 'Schomaker G, Loeser C, Schubert M. Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks. In: 5th International Conference on Networking (ICN). ; 2006.' apa: Schomaker, G., Loeser, C., & Schubert, M. (2006). Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks. In 5th International Conference on Networking (ICN). 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} }' chicago: Schomaker, Gunnar, Christoph Loeser, and Matthias Schubert. “Predictive Replication and Placement Strategies for Movie Documents in Heterogeneous Content Delivery Networks.” In 5th International Conference on Networking (ICN)., 2006. ieee: G. Schomaker, C. Loeser, and M. Schubert, “Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks,” 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.” 5th International Conference on Networking (ICN)., 2006. short: 'G. Schomaker, C. Loeser, M. Schubert, in: 5th International Conference on Networking (ICN)., 2006.' date_created: 2020-10-02T11:57:06Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' language: - iso: eng publication: 5th International Conference on Networking (ICN). status: public title: Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks type: conference user_id: '15415' year: '2006' ... --- _id: '19870' author: - first_name: Andre full_name: Brinkmann, Andre last_name: Brinkmann - first_name: Sascha full_name: Effert, Sascha last_name: Effert - first_name: Michael full_name: Heidebuer, Michael last_name: Heidebuer - first_name: Mario full_name: Vodisek, Mario last_name: Vodisek citation: ama: 'Brinkmann A, Effert S, Heidebuer M, Vodisek M. Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments. In: 5th International Conference on Networking (ICN). ; 2006. doi:10.1109/icniconsmcl.2006.182' apa: Brinkmann, A., Effert, S., Heidebuer, M., & Vodisek, M. (2006). Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments. 5th International Conference on Networking (ICN). https://doi.org/10.1109/icniconsmcl.2006.182 bibtex: '@inproceedings{Brinkmann_Effert_Heidebuer_Vodisek_2006, title={Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments}, DOI={10.1109/icniconsmcl.2006.182}, booktitle={5th International Conference on Networking (ICN)}, author={Brinkmann, Andre and Effert, Sascha and Heidebuer, Michael and Vodisek, Mario}, year={2006} }' chicago: Brinkmann, Andre, Sascha Effert, Michael Heidebuer, and Mario Vodisek. “Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments.” In 5th International Conference on Networking (ICN), 2006. https://doi.org/10.1109/icniconsmcl.2006.182. ieee: 'A. Brinkmann, S. Effert, M. Heidebuer, and M. Vodisek, “Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments,” 2006, doi: 10.1109/icniconsmcl.2006.182.' mla: Brinkmann, Andre, et al. “Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments.” 5th International Conference on Networking (ICN), 2006, doi:10.1109/icniconsmcl.2006.182. short: 'A. Brinkmann, S. Effert, M. Heidebuer, M. Vodisek, in: 5th International Conference on Networking (ICN), 2006.' date_created: 2020-10-05T08:38:26Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' - _id: '58' doi: 10.1109/icniconsmcl.2006.182 language: - iso: eng publication: 5th International Conference on Networking (ICN) publication_identifier: isbn: - '0769525520' publication_status: published status: public title: Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments type: conference user_id: '15415' year: '2006' ... --- _id: '19932' abstract: - lang: eng text: '#hniid 2484' author: - first_name: Michael full_name: Kortenjan, Michael last_name: Kortenjan - first_name: Gunnar full_name: Schomaker, Gunnar last_name: Schomaker citation: ama: 'Kortenjan M, Schomaker G. Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes. In: 4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006). ; 2006. doi:10.1145/1108590.1108608' apa: Kortenjan, M., & Schomaker, G. (2006). Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes. In 4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006). https://doi.org/10.1145/1108590.1108608 bibtex: '@inproceedings{Kortenjan_Schomaker_2006, title={Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes}, DOI={10.1145/1108590.1108608}, booktitle={4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)}, author={Kortenjan, Michael and Schomaker, Gunnar}, year={2006} }' chicago: Kortenjan, Michael, and Gunnar Schomaker. “Size Equivalent Cluster Trees (SEC-Trees) Realtime Rendering of Large Industrial Scenes.” In 4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006), 2006. https://doi.org/10.1145/1108590.1108608. ieee: M. Kortenjan and G. Schomaker, “Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes,” 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.” 4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006), 2006, doi:10.1145/1108590.1108608. short: 'M. Kortenjan, G. Schomaker, in: 4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006), 2006.' date_created: 2020-10-06T13:32:47Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' doi: 10.1145/1108590.1108608 language: - iso: eng publication: 4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006) status: public title: Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes type: conference user_id: '15415' year: '2006' ... --- _id: '24277' 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." author: - first_name: Jarosław full_name: Kutyłowski, Jarosław last_name: Kutyłowski - first_name: Filip full_name: Zagórski, Filip last_name: Zagórski citation: ama: 'Kutyłowski J, Zagórski F. Reliable Broadcasting Without Collision Detection. In: SOFSEM 2006: Theory and Practice of Computer Science. ; 2006. doi:10.1007/11611257_37' apa: 'Kutyłowski, J., & Zagórski, F. (2006). Reliable Broadcasting Without Collision Detection. SOFSEM 2006: Theory and Practice of Computer Science. https://doi.org/10.1007/11611257_37' bibtex: '@inproceedings{Kutyłowski_Zagórski_2006, place={Berlin, Heidelberg}, title={Reliable Broadcasting Without Collision Detection}, DOI={10.1007/11611257_37}, booktitle={SOFSEM 2006: Theory and Practice of Computer Science}, author={Kutyłowski, Jarosław and Zagórski, Filip}, year={2006} }' chicago: 'Kutyłowski, Jarosław, and Filip Zagórski. “Reliable Broadcasting Without Collision Detection.” In SOFSEM 2006: Theory and Practice of Computer Science. Berlin, Heidelberg, 2006. https://doi.org/10.1007/11611257_37.' ieee: 'J. Kutyłowski and F. Zagórski, “Reliable Broadcasting Without Collision Detection,” 2006, doi: 10.1007/11611257_37.' mla: 'Kutyłowski, Jarosław, and Filip Zagórski. “Reliable Broadcasting Without Collision Detection.” SOFSEM 2006: Theory and Practice of Computer Science, 2006, doi:10.1007/11611257_37.' short: 'J. Kutyłowski, F. Zagórski, in: SOFSEM 2006: Theory and Practice of Computer Science, Berlin, Heidelberg, 2006.' date_created: 2021-09-13T13:28:29Z date_updated: 2022-01-06T06:56:13Z department: - _id: '63' doi: 10.1007/11611257_37 language: - iso: eng place: Berlin, Heidelberg publication: 'SOFSEM 2006: Theory and Practice of Computer Science' publication_identifier: issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Reliable Broadcasting Without Collision Detection type: conference user_id: '15415' year: '2006' ... --- _id: '26988' abstract: - lang: eng 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. author: - first_name: Andre full_name: Brinkmann, Andre last_name: Brinkmann - first_name: 'Sascha ' full_name: 'Effert, Sascha ' last_name: Effert - first_name: Michael full_name: Heidebuer, Michael last_name: Heidebuer - first_name: Mario full_name: Vodisek, Mario last_name: Vodisek citation: ama: 'Brinkmann A, Effert S, Heidebuer M, Vodisek M. Influence of adaptive data layouts on performance in dynamically changing storage environments. In: 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06). ; 2006. doi:10.1109/pdp.2006.44' apa: Brinkmann, A., Effert, S., Heidebuer, M., & Vodisek, M. (2006). Influence of adaptive data layouts on performance in dynamically changing storage environments. 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06). https://doi.org/10.1109/pdp.2006.44 bibtex: '@inproceedings{Brinkmann_Effert_Heidebuer_Vodisek_2006, title={Influence of adaptive data layouts on performance in dynamically changing storage environments}, DOI={10.1109/pdp.2006.44}, 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} }' chicago: Brinkmann, Andre, Sascha Effert, Michael Heidebuer, and Mario Vodisek. “Influence of Adaptive Data Layouts on Performance in Dynamically Changing Storage Environments.” In 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06), 2006. https://doi.org/10.1109/pdp.2006.44. ieee: 'A. Brinkmann, S. Effert, M. Heidebuer, and M. Vodisek, “Influence of adaptive data layouts on performance in dynamically changing storage environments,” 2006, doi: 10.1109/pdp.2006.44.' mla: Brinkmann, Andre, et al. “Influence of Adaptive Data Layouts on Performance in Dynamically Changing Storage Environments.” 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06), 2006, doi:10.1109/pdp.2006.44. short: 'A. Brinkmann, S. Effert, M. Heidebuer, M. Vodisek, in: 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP’06), 2006.' date_created: 2021-10-28T08:33:09Z date_updated: 2022-01-06T06:57:31Z department: - _id: '63' - _id: '26' doi: 10.1109/pdp.2006.44 language: - iso: eng publication: 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'06) publication_status: published status: public title: Influence of adaptive data layouts on performance in dynamically changing storage environments type: conference user_id: '15415' year: '2006' ... --- _id: '17417' 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. citation: ama: 'Rammig F-J, Dangelmaier W, Karl H, Mertsching B, Meyer auf der Heide F, Trächtler A, eds. Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2006.' apa: 'Rammig, F.-J., Dangelmaier, W., Karl, H., Mertsching, B., Meyer auf der Heide, F., & Trächtler, A. (Eds.). (2006). Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems. Verlagsschriftenreihe des Heinz Nixdorf Instituts.' 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} }' chicago: 'Rammig, Franz-Josef, Wilhelm Dangelmaier, Holger Karl, Bärbel Mertsching, Friedhelm Meyer auf der Heide, and Ansgar Trächtler, eds. Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems. 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., Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2006.' mla: 'Rammig, Franz-Josef, et al., editors. Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems. Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2006.' 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.' date_created: 2020-07-27T13:00:52Z date_updated: 2022-01-06T06:53:11Z department: - _id: '63' - _id: '26' editor: - first_name: Franz-Josef full_name: Rammig, Franz-Josef last_name: Rammig - first_name: Wilhelm full_name: Dangelmaier, Wilhelm last_name: Dangelmaier - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl - first_name: Bärbel full_name: Mertsching, Bärbel last_name: Mertsching - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Ansgar full_name: Trächtler, Ansgar last_name: Trächtler language: - iso: eng place: Paderborn publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts series_title: Proceedings of the 6th International Heinz Nixdorf Symposium status: public title: 'Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems' type: conference_editor user_id: '15415' year: '2006' ... --- _id: '17475' 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' author: - first_name: Burkhard full_name: Monien, Burkhard last_name: Monien - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Monien B, Meyer auf der Heide F. New Trends in Parallel and Distributed Computing. Vol 181. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006. apa: Monien, B., & Meyer auf der Heide, F. (2006). New trends in parallel and distributed computing (Vol. 181). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. 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} }' chicago: Monien, Burkhard, and Friedhelm Meyer auf der Heide. New Trends in Parallel and Distributed Computing. Vol. 181. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006. ieee: B. Monien and F. Meyer auf der Heide, New trends in parallel and distributed computing, vol. 181. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006. mla: Monien, Burkhard, and Friedhelm Meyer auf der Heide. New Trends in Parallel and Distributed Computing. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006. short: B. Monien, F. Meyer auf der Heide, New Trends in Parallel and Distributed Computing, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006. date_created: 2020-07-30T09:18:30Z date_updated: 2022-01-06T06:53:12Z department: - _id: '63' - _id: '26' intvolume: ' 181' language: - iso: eng publication_identifier: isbn: - 978-3-939350-00-2 publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public title: New trends in parallel and distributed computing type: book user_id: '5786' volume: 181 year: '2006' ... --- _id: '17619' author: - first_name: Matthias full_name: Grünewald, Matthias last_name: Grünewald - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Stefan full_name: Rührup, Stefan last_name: Rührup - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer - first_name: Klaus full_name: Volbert, Klaus last_name: Volbert 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: New Trends in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf Symposium. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2006:225-234.' apa: Grünewald, M., Meyer auf der Heide, F., Rührup, S., Schindelhauer, C., & Volbert, K. (2006). Directional Communication in Mobile Ad Hoc Networks. New Trends in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf Symposium, 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 & 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} }' 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 New Trends in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf Symposium, 225–34. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2006.' 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 New Trends in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf Symposium, 2006, pp. 225–234. mla: Grünewald, Matthias, et al. “Directional Communication in Mobile Ad Hoc Networks.” New Trends in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf Symposium, 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 & Distributed Computing, 6th Int. Heinz Nixdorf Symposium, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006, pp. 225–234.' date_created: 2020-08-05T09:36:46Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '26' language: - iso: eng page: 225-234 place: Paderborn publication: New Trends in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf Symposium publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts status: public title: Directional Communication in Mobile Ad Hoc Networks type: conference user_id: '15415' year: '2006' ... --- _id: '18676' abstract: - lang: eng 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. author: - first_name: Christian full_name: Sohler, Christian last_name: Sohler - first_name: Gereon full_name: Frahling, Gereon last_name: Frahling - first_name: Alberto full_name: Marchetti-Spaccamela, Alberto last_name: Marchetti-Spaccamela - first_name: Stefano full_name: Leonardi, Stefano last_name: Leonardi - first_name: Luciana full_name: Buriol, Luciana last_name: Buriol citation: ama: 'Sohler C, Frahling G, Marchetti-Spaccamela A, Leonardi S, Buriol L. Computing Clustering Coefficients in Data Streams. In: Proceedings of  the European Conference on Complex Systems (ECCS’06). ; 2006.' apa: Sohler, C., Frahling, G., Marchetti-Spaccamela, A., Leonardi, S., & Buriol, L. (2006). Computing Clustering Coefficients in Data Streams. In Proceedings of  the European Conference on Complex Systems (ECCS’06). 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} }' chicago: Sohler, Christian, Gereon Frahling, Alberto Marchetti-Spaccamela, Stefano Leonardi, and Luciana Buriol. “Computing Clustering Coefficients in Data Streams.” In Proceedings of  the European Conference on Complex Systems (ECCS’06), 2006. ieee: C. Sohler, G. Frahling, A. Marchetti-Spaccamela, S. Leonardi, and L. Buriol, “Computing Clustering Coefficients in Data Streams,” in Proceedings of  the European Conference on Complex Systems (ECCS’06), 2006. mla: Sohler, Christian, et al. “Computing Clustering Coefficients in Data Streams.” Proceedings of  the European Conference on Complex Systems (ECCS’06), 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.' date_created: 2020-08-31T08:25:01Z date_updated: 2022-01-06T06:53:50Z department: - _id: '63' language: - iso: eng publication: Proceedings of the European Conference on Complex Systems (ECCS'06) status: public title: Computing Clustering Coefficients in Data Streams type: conference user_id: '15415' year: '2006' ... --- _id: '18745' author: - first_name: Christian full_name: Sohler, Christian last_name: Sohler - first_name: Gereon full_name: Frahling, Gereon last_name: Frahling - first_name: Alberto full_name: Marchetti-Spaccamela, Alberto last_name: Marchetti-Spaccamela - first_name: Stefano full_name: Leonardi, Stefano last_name: Leonardi - first_name: Luciana full_name: Buriol, Luciana last_name: Buriol citation: 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., & Buriol, L. (2006). Counting Triangles in Data Streams. In Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS) (Ed.). 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} }' 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. mla: Sohler, Christian, et al. Counting Triangles in Data Streams. Edited by Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS), 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.' corporate_editor: - Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS) date_created: 2020-09-01T10:34:00Z date_updated: 2022-01-06T06:53:51Z department: - _id: '63' language: - iso: eng status: public title: Counting Triangles in Data Streams type: conference user_id: '15415' year: '2006' ... --- _id: '18746' abstract: - lang: eng 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." author: - first_name: Christian full_name: Sohler, Christian last_name: Sohler - first_name: Joachim full_name: Gehweiler, Joachim last_name: Gehweiler - first_name: Christiane full_name: Lammersen, Christiane last_name: Lammersen citation: ama: 'Sohler C, Gehweiler J, Lammersen C. A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem. In: Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ; 2006.' apa: Sohler, C., Gehweiler, J., & Lammersen, C. (2006). A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem. In Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 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} }' chicago: Sohler, Christian, Joachim Gehweiler, and Christiane Lammersen. “A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem.” In Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2006. ieee: C. Sohler, J. Gehweiler, and C. Lammersen, “A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem,” in Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2006. mla: Sohler, Christian, et al. “A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem.” Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2006. short: 'C. Sohler, J. Gehweiler, C. Lammersen, in: Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2006.' date_created: 2020-09-01T10:38:29Z date_updated: 2022-01-06T06:53:51Z department: - _id: '63' language: - iso: eng publication: Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) status: public title: A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem type: conference user_id: '15415' year: '2006' ... --- _id: '18926' author: - first_name: Miroslaw full_name: Dynia, Miroslaw last_name: Dynia - first_name: Miroslaw full_name: Korzeniowski, Miroslaw last_name: Korzeniowski - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: 'Dynia M, Korzeniowski M, Schindelhauer C. Power-Aware Collective Tree Exploration. In: Architecture of Computing Systems - ARCS. ; 2006:341--351. doi:10.1007/11682127_24' apa: Dynia, M., Korzeniowski, M., & Schindelhauer, C. (2006). Power-Aware Collective Tree Exploration. In Architecture of Computing Systems - ARCS (pp. 341--351). https://doi.org/10.1007/11682127_24 bibtex: '@inproceedings{Dynia_Korzeniowski_Schindelhauer_2006, title={Power-Aware Collective Tree Exploration}, DOI={10.1007/11682127_24}, number={3894}, booktitle={Architecture of Computing Systems - ARCS}, author={Dynia, Miroslaw and Korzeniowski, Miroslaw and Schindelhauer, Christian}, year={2006}, pages={341--351} }' chicago: Dynia, Miroslaw, Miroslaw Korzeniowski, and Christian Schindelhauer. “Power-Aware Collective Tree Exploration.” In Architecture of Computing Systems - ARCS, 341--351, 2006. https://doi.org/10.1007/11682127_24. ieee: M. Dynia, M. Korzeniowski, and C. Schindelhauer, “Power-Aware Collective Tree Exploration,” in Architecture of Computing Systems - ARCS, 2006, no. 3894, pp. 341--351. mla: Dynia, Miroslaw, et al. “Power-Aware Collective Tree Exploration.” Architecture of Computing Systems - ARCS, no. 3894, 2006, pp. 341--351, doi:10.1007/11682127_24. short: 'M. Dynia, M. Korzeniowski, C. Schindelhauer, in: Architecture of Computing Systems - ARCS, 2006, pp. 341--351.' date_created: 2020-09-03T10:13:56Z date_updated: 2022-01-06T06:53:54Z department: - _id: '63' doi: 10.1007/11682127_24 issue: '3894' language: - iso: eng page: 341--351 publication: Architecture of Computing Systems - ARCS publication_identifier: isbn: - '9783540327653' - '9783540327660' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Power-Aware Collective Tree Exploration type: conference user_id: '15415' year: '2006' ...