--- _id: '18656' abstract: - lang: eng text: In the StrSort model [2], the input is given as a stream, e.g. a sequence of points, and an algorithm can perform (a) streaming and (b) sorting passes to process the stream. A streaming pass reads the input stream from left to right and writes an output stream, which is the input of the next pass. A sorting pass is a black box operation that sorts a stream according to some partial order. In this paper, we develop algorithms for two basic geometric problems in the StrSort model. At first, we propose a divide-and-conquer algorithm that computes the convex hull of a point set in 2D in O(log2 n) passes using O(1) memory. Then we give a StrSort algorithm to compute a (1+ε)-spanner for a point set in Rd for constant d and constant epsilon that uses O(logd-1 n) passes and O(log n) space. This result implies a (1+ε)-approximation of the Euclidean minimum spanning tree in Rd, for constant d and ε. author: - first_name: Christian full_name: Sohler, Christian last_name: Sohler - first_name: Christiane full_name: Lammersen, Christiane last_name: Lammersen citation: ama: 'Sohler C, Lammersen C. StrSort Algorithms for Geometric Problems. In: Proceedings of the 23rd European Workshop on Computational Geometry (EWCG). ; 2007:69-72.' apa: Sohler, C., & Lammersen, C. (2007). StrSort Algorithms for Geometric Problems. In Proceedings of the 23rd European Workshop on Computational Geometry (EWCG) (pp. 69–72). bibtex: '@inproceedings{Sohler_Lammersen_2007, title={StrSort Algorithms for Geometric Problems}, booktitle={Proceedings of the 23rd European Workshop on Computational Geometry (EWCG)}, author={Sohler, Christian and Lammersen, Christiane}, year={2007}, pages={69–72} }' chicago: Sohler, Christian, and Christiane Lammersen. “StrSort Algorithms for Geometric Problems.” In Proceedings of the 23rd European Workshop on Computational Geometry (EWCG), 69–72, 2007. ieee: C. Sohler and C. Lammersen, “StrSort Algorithms for Geometric Problems,” in Proceedings of the 23rd European Workshop on Computational Geometry (EWCG), 2007, pp. 69–72. mla: Sohler, Christian, and Christiane Lammersen. “StrSort Algorithms for Geometric Problems.” Proceedings of the 23rd European Workshop on Computational Geometry (EWCG), 2007, pp. 69–72. short: 'C. Sohler, C. Lammersen, in: Proceedings of the 23rd European Workshop on Computational Geometry (EWCG), 2007, pp. 69–72.' date_created: 2020-08-31T07:49:02Z date_updated: 2022-01-06T06:53:50Z department: - _id: '63' language: - iso: eng page: 69-72 publication: Proceedings of the 23rd European Workshop on Computational Geometry (EWCG) status: public title: StrSort Algorithms for Geometric Problems type: conference user_id: '15415' year: '2007' ... --- _id: '18660' author: - first_name: 'Christian ' full_name: 'Sohler, Christian ' last_name: Sohler - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj citation: ama: 'Sohler C, Czumaj A. Testing Expansion in Bounded-Degree Graphs. In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS). ; 2007:570-578.' apa: Sohler, C., & Czumaj, A. (2007). Testing Expansion in Bounded-Degree Graphs. In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (pp. 570–578). bibtex: '@inproceedings{Sohler_Czumaj_2007, title={Testing Expansion in Bounded-Degree Graphs}, booktitle={Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS)}, author={Sohler, Christian and Czumaj, Artur}, year={2007}, pages={570–578} }' chicago: Sohler, Christian , and Artur Czumaj. “Testing Expansion in Bounded-Degree Graphs.” In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 570–78, 2007. ieee: C. Sohler and A. Czumaj, “Testing Expansion in Bounded-Degree Graphs,” in Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2007, pp. 570–578. mla: Sohler, Christian, and Artur Czumaj. “Testing Expansion in Bounded-Degree Graphs.” Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2007, pp. 570–78. short: 'C. Sohler, A. Czumaj, in: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2007, pp. 570–578.' date_created: 2020-08-31T07:55:45Z date_updated: 2022-01-06T06:53:50Z department: - _id: '63' language: - iso: eng page: 570 - 578 publication: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS) status: public title: Testing Expansion in Bounded-Degree Graphs type: conference user_id: '15415' year: '2007' ... --- _id: '18662' author: - first_name: Christian full_name: Sohler, Christian last_name: Sohler - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj citation: ama: 'Sohler C, Czumaj A. Small Space Representations for Metric Min-Sum k-Clustering and their Applications. In: Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07). ; 2007:536-548.' apa: Sohler, C., & Czumaj, A. (2007). Small Space Representations for Metric Min-Sum k-Clustering and their Applications. In Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07) (pp. 536–548). bibtex: '@inproceedings{Sohler_Czumaj_2007, title={Small Space Representations for Metric Min-Sum k-Clustering and their Applications}, booktitle={Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07)}, author={Sohler, Christian and Czumaj, Artur}, year={2007}, pages={536–548} }' chicago: Sohler, Christian, and Artur Czumaj. “Small Space Representations for Metric Min-Sum k-Clustering and Their Applications.” In Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07), 536–48, 2007. ieee: C. Sohler and A. Czumaj, “Small Space Representations for Metric Min-Sum k-Clustering and their Applications,” in Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07), 2007, pp. 536–548. mla: Sohler, Christian, and Artur Czumaj. “Small Space Representations for Metric Min-Sum k-Clustering and Their Applications.” Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07), 2007, pp. 536–48. short: 'C. Sohler, A. Czumaj, in: Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07), 2007, pp. 536–548.' date_created: 2020-08-31T07:59:05Z date_updated: 2022-01-06T06:53:50Z department: - _id: '63' language: - iso: eng page: 536-548 publication: Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS'07) status: public title: Small Space Representations for Metric Min-Sum k-Clustering and their Applications type: conference user_id: '15415' year: '2007' ... --- _id: '18665' abstract: - lang: eng text: 'We present a novel analysis of a random sampling approach for four clustering problems in metric spaces: k-median, k-means, min-sum k-clustering, and balanced k-median. For all these problems, we consider the following simple sampling scheme: select a small sample set of input points uniformly at random and then run some approximation algorithm on this sample set to compute an approximation of the best possible clustering of this set. Our main technical contribution is a significantly strengthened analysis of the approximation guarantee by this scheme for the clustering problems.The main motivation behind our analyses was to design sublinear-time algorithms for clustering problems. Our second contribution is the development of new approximation algorithms for the aforementioned clustering problems. Using our random sampling approach, we obtain for these problems the first time approximation algorithms that have running time independent of the input size, and depending on k and the diameter of the metric space only. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2007A preliminary extended abstract of this work appeared in Proceedings of the 31st Annual International Colloquium on Automata, Languages and Programming (ICALP), pp. 396407, 2004.' author: - first_name: Christian full_name: Sohler, Christian last_name: Sohler - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj citation: ama: Sohler C, Czumaj A. Sublinear-time approximation algorithms for clustering via random sampling. Random Structures & Algorithms. 2007;30(1-2):226-- 256. apa: Sohler, C., & Czumaj, A. (2007). Sublinear-time approximation algorithms for clustering via random sampling. Random Structures & Algorithms, 30(1–2), 226-- 256. bibtex: '@article{Sohler_Czumaj_2007, title={Sublinear-time approximation algorithms for clustering via random sampling}, volume={30}, number={1–2}, journal={Random Structures & Algorithms}, author={Sohler, Christian and Czumaj, Artur}, year={2007}, pages={226-- 256} }' chicago: 'Sohler, Christian, and Artur Czumaj. “Sublinear-Time Approximation Algorithms for Clustering via Random Sampling.” Random Structures & Algorithms 30, no. 1–2 (2007): 226-- 256.' ieee: C. Sohler and A. Czumaj, “Sublinear-time approximation algorithms for clustering via random sampling,” Random Structures & Algorithms, vol. 30, no. 1–2, pp. 226-- 256, 2007. mla: Sohler, Christian, and Artur Czumaj. “Sublinear-Time Approximation Algorithms for Clustering via Random Sampling.” Random Structures & Algorithms, vol. 30, no. 1–2, 2007, pp. 226-- 256. short: C. Sohler, A. Czumaj, Random Structures & Algorithms 30 (2007) 226-- 256. date_created: 2020-08-31T08:03:52Z date_updated: 2022-01-06T06:53:50Z department: - _id: '63' intvolume: ' 30' issue: 1-2 language: - iso: eng page: 226 -- 256 publication: Random Structures & Algorithms status: public title: Sublinear-time approximation algorithms for clustering via random sampling type: journal_article user_id: '15415' volume: 30 year: '2007' ... --- _id: '18668' author: - first_name: Christian full_name: Sohler, Christian last_name: Sohler - first_name: Morteza full_name: Monemizahdeh, Morteza last_name: Monemizahdeh - first_name: Dan full_name: Feldman, Dan last_name: Feldman citation: ama: 'Sohler C, Monemizahdeh M, Feldman D. A PTAS for k-means clustering based on weak coresets. In: Proceedings of the 23rd Annual Symposium on Computational Geometry (SoCG’07). ; 2007:11-18.' apa: Sohler, C., Monemizahdeh, M., & Feldman, D. (2007). A PTAS for k-means clustering based on weak coresets. In Proceedings of the 23rd annual symposium on computational geometry (SoCG’07) (pp. 11–18). bibtex: '@inproceedings{Sohler_Monemizahdeh_Feldman_2007, title={A PTAS for k-means clustering based on weak coresets}, booktitle={Proceedings of the 23rd annual symposium on computational geometry (SoCG’07)}, author={Sohler, Christian and Monemizahdeh, Morteza and Feldman, Dan}, year={2007}, pages={11–18} }' chicago: Sohler, Christian, Morteza Monemizahdeh, and Dan Feldman. “A PTAS for K-Means Clustering Based on Weak Coresets.” In Proceedings of the 23rd Annual Symposium on Computational Geometry (SoCG’07), 11–18, 2007. ieee: C. Sohler, M. Monemizahdeh, and D. Feldman, “A PTAS for k-means clustering based on weak coresets,” in Proceedings of the 23rd annual symposium on computational geometry (SoCG’07), 2007, pp. 11–18. mla: Sohler, Christian, et al. “A PTAS for K-Means Clustering Based on Weak Coresets.” Proceedings of the 23rd Annual Symposium on Computational Geometry (SoCG’07), 2007, pp. 11–18. short: 'C. Sohler, M. Monemizahdeh, D. Feldman, in: Proceedings of the 23rd Annual Symposium on Computational Geometry (SoCG’07), 2007, pp. 11–18.' date_created: 2020-08-31T08:10:11Z date_updated: 2022-01-06T06:53:50Z department: - _id: '63' language: - iso: eng page: 11-18 publication: Proceedings of the 23rd annual symposium on computational geometry (SoCG'07) status: public title: A PTAS for k-means clustering based on weak coresets type: conference user_id: '15415' year: '2007' ... --- _id: '18669' author: - first_name: Christian full_name: Sohler, Christian last_name: Sohler - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Gereon full_name: Frahling, Gereon last_name: Frahling citation: ama: 'Sohler C, Czumaj A, Frahling G. Efficient kinetic data structures for MaxCut. In: Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG). ; 2007:157-160.' apa: Sohler, C., Czumaj, A., & Frahling, G. (2007). Efficient kinetic data structures for MaxCut. In Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG) (pp. 157–160). bibtex: '@inproceedings{Sohler_Czumaj_Frahling_2007, title={Efficient kinetic data structures for MaxCut}, booktitle={Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG)}, author={Sohler, Christian and Czumaj, Artur and Frahling, Gereon}, year={2007}, pages={157–160} }' chicago: Sohler, Christian, Artur Czumaj, and Gereon Frahling. “Efficient Kinetic Data Structures for MaxCut.” In Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG), 157–60, 2007. ieee: C. Sohler, A. Czumaj, and G. Frahling, “Efficient kinetic data structures for MaxCut,” in Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG), 2007, pp. 157–160. mla: Sohler, Christian, et al. “Efficient Kinetic Data Structures for MaxCut.” Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG), 2007, pp. 157–60. short: 'C. Sohler, A. Czumaj, G. Frahling, in: Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG), 2007, pp. 157–160.' date_created: 2020-08-31T08:12:53Z date_updated: 2022-01-06T06:53:50Z department: - _id: '63' language: - iso: eng page: 157-160 publication: Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG) status: public title: Efficient kinetic data structures for MaxCut type: conference user_id: '15415' year: '2007' ... --- _id: '2214' abstract: - lang: eng text: We present a randomized block-level storage virtualization for arbitrary heterogeneous storage systems that can distribute data in a fair and redundant way and can adapt this distribution in an efficient way as storage devices enter or leave the system. More precisely, our virtualization strategies can distribute a set of data blocks among a set of storage devices of arbitrary non-uniform capacities so that a storage device representing x% of the capacity in the system will get x% of the data (as long as this is in principle possible) and the different copies of each data block are stored so that no two copies of a data block are located in the same device. Achieving these two properties is not easy, and no virtualization strategy has been presented so far that has been formally shown to satisfy fairness and redundancy while being time- and space-eflcient and allowing an efficient adaptation to a changing set of devices. author: - first_name: André full_name: Brinkmann, André last_name: Brinkmann - first_name: Sascha full_name: Effert, Sascha last_name: Effert - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Brinkmann A, Effert S, Meyer auf der Heide F, Scheideler C. Dynamic and redundant data placement. In: IEEE International Conference on Distributed Computing Systems (ICDCS). ; 2007.' apa: Brinkmann, A., Effert, S., Meyer auf der Heide, F., & Scheideler, C. (2007). Dynamic and redundant data placement. IEEE International Conference on Distributed Computing Systems (ICDCS). bibtex: '@inproceedings{Brinkmann_Effert_Meyer auf der Heide_Scheideler_2007, title={Dynamic and redundant data placement}, booktitle={IEEE International Conference on Distributed Computing Systems (ICDCS)}, author={Brinkmann, André and Effert, Sascha and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2007} }' chicago: Brinkmann, André, Sascha Effert, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Dynamic and Redundant Data Placement.” In IEEE International Conference on Distributed Computing Systems (ICDCS), 2007. ieee: A. Brinkmann, S. Effert, F. Meyer auf der Heide, and C. Scheideler, “Dynamic and redundant data placement,” 2007. mla: Brinkmann, André, et al. “Dynamic and Redundant Data Placement.” IEEE International Conference on Distributed Computing Systems (ICDCS), 2007. short: 'A. Brinkmann, S. Effert, F. Meyer auf der Heide, C. Scheideler, in: IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.' date_created: 2018-04-05T07:08:35Z date_updated: 2022-01-06T06:55:27Z ddc: - '040' department: - _id: '79' - _id: '63' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-13T10:01:42Z date_updated: 2018-04-13T10:01:42Z file_id: '2339' file_name: ICDCS07.pdf file_size: 164121 relation: main_file file_date_updated: 2018-04-13T10:01:42Z has_accepted_license: '1' language: - iso: eng oa: '1' publication: IEEE International Conference on Distributed Computing Systems (ICDCS) status: public title: Dynamic and redundant data placement type: conference urn: '22147' user_id: '15415' year: '2007' ... --- _id: '7970' abstract: - lang: eng text: We consider the problem of exploring an unknown environment using a swarm of autonomous robots with collective behavior emerging from their local rules. Each robot has only a very restricted view on the environment which makes cooperation difficult. We introduce a software system which is capable of simulating a large number of such robots (e.g. 1000) on highly complex terrains with millions of obstacles. Its main purpose is to easily integrate and evaluate any kind of algorithm for controlling the robot behavior. The simulation may be observed in real-time via a visualization that displays both the individual and the collective progress of the robots. We present the system design, its main features and underlying concepts. author: - first_name: Stephan full_name: Arens, Stephan last_name: Arens - first_name: Alexander full_name: Buss, Alexander last_name: Buss - first_name: Helena full_name: Deck, Helena last_name: Deck - first_name: Miroslaw full_name: Dynia, Miroslaw last_name: Dynia - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Holger full_name: Hagedorn, Holger last_name: Hagedorn - first_name: Peter full_name: Isaak, Peter last_name: Isaak - first_name: Jaroslaw full_name: Kutylowski, Jaroslaw last_name: Kutylowski - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Viktor full_name: Nesterow, Viktor last_name: Nesterow - first_name: Adrian full_name: Ogiermann, Adrian last_name: Ogiermann - first_name: Boris full_name: Stobbe, Boris last_name: Stobbe - first_name: Thomas full_name: Storm, Thomas last_name: Storm - first_name: Henning full_name: Wachsmuth, Henning id: '3900' last_name: Wachsmuth citation: ama: 'Arens S, Buss A, Deck H, et al. Smart Teams: Simulating Large Robotic Swarms in Vast Environments. In: Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment. Buenos Aires, Argentina: Heinz Nixdorf Institut, University of Paderborn; 2007:215-222.' apa: 'Arens, S., Buss, A., Deck, H., Dynia, M., Fischer, M., Hagedorn, H., … Wachsmuth, H. (2007). Smart Teams: Simulating Large Robotic Swarms in Vast Environments. In Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment (pp. 215–222). Buenos Aires, Argentina: Heinz Nixdorf Institut, University of Paderborn.' bibtex: '@inproceedings{Arens_Buss_Deck_Dynia_Fischer_Hagedorn_Isaak_Kutylowski_Meyer auf der Heide_Nesterow_et al._2007, place={Buenos Aires, Argentina}, title={Smart Teams: Simulating Large Robotic Swarms in Vast Environments}, booktitle={Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment}, publisher={Heinz Nixdorf Institut, University of Paderborn}, author={Arens, Stephan and Buss, Alexander and Deck, Helena and Dynia, Miroslaw and Fischer, Matthias and Hagedorn, Holger and Isaak, Peter and Kutylowski, Jaroslaw and Meyer auf der Heide, Friedhelm and Nesterow, Viktor and et al.}, year={2007}, pages={215–222} }' chicago: 'Arens, Stephan, Alexander Buss, Helena Deck, Miroslaw Dynia, Matthias Fischer, Holger Hagedorn, Peter Isaak, et al. “Smart Teams: Simulating Large Robotic Swarms in Vast Environments.” In Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment, 215–22. Buenos Aires, Argentina: Heinz Nixdorf Institut, University of Paderborn, 2007.' ieee: 'S. Arens et al., “Smart Teams: Simulating Large Robotic Swarms in Vast Environments,” in Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment, 2007, pp. 215–222.' mla: 'Arens, Stephan, et al. “Smart Teams: Simulating Large Robotic Swarms in Vast Environments.” Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment, Heinz Nixdorf Institut, University of Paderborn, 2007, pp. 215–22.' short: 'S. Arens, A. Buss, H. Deck, M. Dynia, M. Fischer, H. Hagedorn, P. Isaak, J. Kutylowski, F. Meyer auf der Heide, V. Nesterow, A. Ogiermann, B. Stobbe, T. Storm, H. Wachsmuth, in: Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment, Heinz Nixdorf Institut, University of Paderborn, Buenos Aires, Argentina, 2007, pp. 215–222.' date_created: 2019-02-21T11:56:39Z date_updated: 2022-01-06T07:03:48Z department: - _id: '66' - _id: '600' - _id: '63' language: - iso: eng main_file_link: - url: https://webis.de/downloads/publications/papers/arens_2007.pdf page: 215-222 place: Buenos Aires, Argentina publication: Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment publisher: Heinz Nixdorf Institut, University of Paderborn status: public title: 'Smart Teams: Simulating Large Robotic Swarms in Vast Environments' type: conference user_id: '15415' year: '2007' ... --- _id: '16467' author: - first_name: Miroslaw full_name: Dynia, Miroslaw last_name: Dynia - first_name: Jaroslaw full_name: Kutylowski, Jaroslaw last_name: Kutylowski - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Jonas full_name: Schrieb, Jonas last_name: Schrieb citation: ama: 'Dynia M, Kutylowski J, Meyer auf der Heide F, Schrieb J. Local strategies for maintaining a chain of relay stations between an explorer and a base station. In: Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’07. ; 2007. doi:10.1145/1248377.1248420' apa: Dynia, M., Kutylowski, J., Meyer auf der Heide, F., & Schrieb, J. (2007). Local strategies for maintaining a chain of relay stations between an explorer and a base station. In Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’07. https://doi.org/10.1145/1248377.1248420 bibtex: '@inproceedings{Dynia_Kutylowski_Meyer auf der Heide_Schrieb_2007, title={Local strategies for maintaining a chain of relay stations between an explorer and a base station}, DOI={10.1145/1248377.1248420}, booktitle={Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’07}, author={Dynia, Miroslaw and Kutylowski, Jaroslaw and Meyer auf der Heide, Friedhelm and Schrieb, Jonas}, year={2007} }' chicago: Dynia, Miroslaw, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide, and Jonas Schrieb. “Local Strategies for Maintaining a Chain of Relay Stations between an Explorer and a Base Station.” In Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’07, 2007. https://doi.org/10.1145/1248377.1248420. ieee: M. Dynia, J. Kutylowski, F. Meyer auf der Heide, and J. Schrieb, “Local strategies for maintaining a chain of relay stations between an explorer and a base station,” in Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’07, 2007. mla: Dynia, Miroslaw, et al. “Local Strategies for Maintaining a Chain of Relay Stations between an Explorer and a Base Station.” Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’07, 2007, doi:10.1145/1248377.1248420. short: 'M. Dynia, J. Kutylowski, F. Meyer auf der Heide, J. Schrieb, in: Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’07, 2007.' date_created: 2020-04-08T08:58:19Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1145/1248377.1248420 language: - iso: eng publication: Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '07 publication_identifier: isbn: - '9781595936677' publication_status: published status: public title: Local strategies for maintaining a chain of relay stations between an explorer and a base station type: conference user_id: '15415' year: '2007' ... --- _id: '19612' author: - first_name: Jan full_name: Klein, Jan last_name: Klein citation: ama: Klein J. Efficient Collision Detection for Point and Polygon Based Models. Vol 186. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006. apa: Klein, J. (2006). Efficient Collision Detection for Point and Polygon Based Models (Vol. 186). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. bibtex: '@book{Klein_2006, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Efficient Collision Detection for Point and Polygon Based Models}, volume={186}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Klein, Jan}, year={2006}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: Klein, Jan. Efficient Collision Detection for Point and Polygon Based Models. Vol. 186. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006. ieee: J. Klein, Efficient Collision Detection for Point and Polygon Based Models, vol. 186. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006. mla: Klein, Jan. Efficient Collision Detection for Point and Polygon Based Models. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006. short: J. Klein, Efficient Collision Detection for Point and Polygon Based Models, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006. date_created: 2020-09-22T07:48:45Z date_updated: 2022-01-06T06:54:08Z department: - _id: '63' - _id: '26' intvolume: ' 186' language: - iso: eng publication_identifier: isbn: - 3-939350-05-2 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-20050101248 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: Efficient Collision Detection for Point and Polygon Based Models type: dissertation user_id: '5786' volume: 186 year: '2006' ... --- _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' ...