--- _id: '18672' 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 Algorithms. EATCS Bulletin. 2006;(89):23--47. apa: Sohler, C., & Czumaj, A. (2006). Sublinear-time Algorithms. EATCS Bulletin, (89), 23--47. bibtex: '@article{Sohler_Czumaj_2006, title={Sublinear-time Algorithms}, number={89}, journal={EATCS Bulletin}, author={Sohler, Christian and Czumaj, Artur}, year={2006}, pages={23--47} }' chicago: 'Sohler, Christian, and Artur Czumaj. “Sublinear-Time Algorithms.” EATCS Bulletin, no. 89 (2006): 23--47.' ieee: C. Sohler and A. Czumaj, “Sublinear-time Algorithms,” EATCS Bulletin, no. 89, pp. 23--47, 2006. mla: Sohler, Christian, and Artur Czumaj. “Sublinear-Time Algorithms.” EATCS Bulletin, no. 89, 2006, pp. 23--47. short: C. Sohler, A. Czumaj, EATCS Bulletin (2006) 23--47. date_created: 2020-08-31T08:18:02Z date_updated: 2022-01-06T06:53:50Z department: - _id: '63' issue: '89' language: - iso: eng page: 23--47 publication: EATCS Bulletin status: public title: Sublinear-time Algorithms type: journal_article user_id: '15415' year: '2006' ... --- _id: '16462' author: - first_name: Olaf full_name: Bonorden, Olaf last_name: Bonorden - first_name: Joachim full_name: Gehweiler, Joachim last_name: Gehweiler - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Bettina full_name: Rehberg, Bettina last_name: Rehberg citation: ama: 'Bonorden O, Gehweiler J, Meyer auf der Heide F, Rehberg B. Efficient Parallel Algorithms. In: Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel & Distributed Computing. Vol 181. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006:137-153.' apa: 'Bonorden, O., Gehweiler, J., Meyer auf der Heide, F., & Rehberg, B. (2006). Efficient Parallel Algorithms. Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel & Distributed Computing, 181, 137–153.' bibtex: '@inproceedings{Bonorden_Gehweiler_Meyer auf der Heide_Rehberg_2006, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Efficient Parallel Algorithms}, volume={181}, booktitle={Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel & Distributed Computing}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Bonorden, Olaf and Gehweiler, Joachim and Meyer auf der Heide, Friedhelm and Rehberg, Bettina}, year={2006}, pages={137–153}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: 'Bonorden, Olaf, Joachim Gehweiler, Friedhelm Meyer auf der Heide, and Bettina Rehberg. “Efficient Parallel Algorithms.” In Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel & Distributed Computing, 181:137–53. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.' ieee: 'O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, and B. Rehberg, “Efficient Parallel Algorithms,” in Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel & Distributed Computing, 2006, vol. 181, pp. 137–153.' mla: 'Bonorden, Olaf, et al. “Efficient Parallel Algorithms.” Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel & Distributed Computing, vol. 181, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006, pp. 137–53.' short: 'O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, B. Rehberg, in: Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel & Distributed Computing, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006, pp. 137–153.' date_created: 2020-04-08T07:54:09Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' - _id: '26' intvolume: ' 181' language: - iso: eng page: 137-153 publication: 'Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel & Distributed Computing' publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public title: Efficient Parallel Algorithms type: conference user_id: '5786' volume: 181 year: '2006' ... --- _id: '16472' author: - first_name: Erik D. full_name: Demaine, Erik D. last_name: Demaine - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Rasmus full_name: Pagh, Rasmus last_name: Pagh - first_name: Mihai full_name: Pǎtraşcu, Mihai last_name: Pǎtraşcu citation: ama: 'Demaine ED, Meyer auf der Heide F, Pagh R, Pǎtraşcu M. De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space). In: LATIN 2006: Theoretical Informatics. Berlin, Heidelberg; 2006. doi:10.1007/11682462_34' apa: 'Demaine, E. D., Meyer auf der Heide, F., Pagh, R., & Pǎtraşcu, M. (2006). De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space). In LATIN 2006: Theoretical Informatics. Berlin, Heidelberg. https://doi.org/10.1007/11682462_34' bibtex: '@inbook{Demaine_Meyer auf der Heide_Pagh_Pǎtraşcu_2006, place={Berlin, Heidelberg}, title={De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space)}, DOI={10.1007/11682462_34}, booktitle={LATIN 2006: Theoretical Informatics}, author={Demaine, Erik D. and Meyer auf der Heide, Friedhelm and Pagh, Rasmus and Pǎtraşcu, Mihai}, year={2006} }' chicago: 'Demaine, Erik D., Friedhelm Meyer auf der Heide, Rasmus Pagh, and Mihai Pǎtraşcu. “De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space).” In LATIN 2006: Theoretical Informatics. Berlin, Heidelberg, 2006. https://doi.org/10.1007/11682462_34.' ieee: 'E. D. Demaine, F. Meyer auf der Heide, R. Pagh, and M. Pǎtraşcu, “De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space),” in LATIN 2006: Theoretical Informatics, Berlin, Heidelberg, 2006.' mla: 'Demaine, Erik D., et al. “De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space).” LATIN 2006: Theoretical Informatics, 2006, doi:10.1007/11682462_34.' short: 'E.D. Demaine, F. Meyer auf der Heide, R. Pagh, M. Pǎtraşcu, in: LATIN 2006: Theoretical Informatics, Berlin, Heidelberg, 2006.' date_created: 2020-04-08T09:36:10Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1007/11682462_34 language: - iso: eng place: Berlin, Heidelberg publication: 'LATIN 2006: Theoretical Informatics' publication_identifier: isbn: - '9783540327554' - '9783540327561' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space) type: book_chapter user_id: '15415' year: '2006' ... --- _id: '16473' author: - first_name: M. full_name: Dynia, M. last_name: Dynia - first_name: J. full_name: Kutyłowski, J. last_name: Kutyłowski - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: 'Dynia M, Kutyłowski J, Meyer auf der Heide F, Schindelhauer C. Smart Robot Teams Exploring Sparse Trees. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 2006. doi:10.1007/11821069_29' apa: Dynia, M., Kutyłowski, J., Meyer auf der Heide, F., & Schindelhauer, C. (2006). Smart Robot Teams Exploring Sparse Trees. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/11821069_29 bibtex: '@inbook{Dynia_Kutyłowski_Meyer auf der Heide_Schindelhauer_2006, place={Berlin, Heidelberg}, title={Smart Robot Teams Exploring Sparse Trees}, DOI={10.1007/11821069_29}, booktitle={Lecture Notes in Computer Science}, author={Dynia, M. and Kutyłowski, J. and Meyer auf der Heide, Friedhelm and Schindelhauer, Christian}, year={2006} }' chicago: Dynia, M., J. Kutyłowski, Friedhelm Meyer auf der Heide, and Christian Schindelhauer. “Smart Robot Teams Exploring Sparse Trees.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 2006. https://doi.org/10.1007/11821069_29. ieee: M. Dynia, J. Kutyłowski, F. Meyer auf der Heide, and C. Schindelhauer, “Smart Robot Teams Exploring Sparse Trees,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2006. mla: Dynia, M., et al. “Smart Robot Teams Exploring Sparse Trees.” Lecture Notes in Computer Science, 2006, doi:10.1007/11821069_29. short: 'M. Dynia, J. Kutyłowski, F. Meyer auf der Heide, C. Schindelhauer, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2006.' date_created: 2020-04-08T09:38:28Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1007/11821069_29 language: - iso: eng place: Berlin, Heidelberg publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783540377917' - '9783540377931' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Smart Robot Teams Exploring Sparse Trees type: book_chapter user_id: '15415' year: '2006' ... --- _id: '16476' author: - first_name: Miroslaw full_name: Dynia, Miroslaw last_name: Dynia - first_name: Jarosław full_name: Kutyłowski, Jarosław last_name: Kutyłowski - first_name: Paweł full_name: Lorek, Paweł last_name: Lorek - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Dynia M, Kutyłowski J, Lorek P, Meyer auf der Heide F. Maintaining Communication Between an Explorer and a Base Station. In: IFIP International Federation for Information Processing. Boston, MA; 2006. doi:10.1007/978-0-387-34733-2_14' apa: Dynia, M., Kutyłowski, J., Lorek, P., & Meyer auf der Heide, F. (2006). Maintaining Communication Between an Explorer and a Base Station. In IFIP International Federation for Information Processing. Boston, MA. https://doi.org/10.1007/978-0-387-34733-2_14 bibtex: '@inbook{Dynia_Kutyłowski_Lorek_Meyer auf der Heide_2006, place={Boston, MA}, title={Maintaining Communication Between an Explorer and a Base Station}, DOI={10.1007/978-0-387-34733-2_14}, booktitle={IFIP International Federation for Information Processing}, author={Dynia, Miroslaw and Kutyłowski, Jarosław and Lorek, Paweł and Meyer auf der Heide, Friedhelm}, year={2006} }' chicago: Dynia, Miroslaw, Jarosław Kutyłowski, Paweł Lorek, and Friedhelm Meyer auf der Heide. “Maintaining Communication Between an Explorer and a Base Station.” In IFIP International Federation for Information Processing. Boston, MA, 2006. https://doi.org/10.1007/978-0-387-34733-2_14. ieee: M. Dynia, J. Kutyłowski, P. Lorek, and F. Meyer auf der Heide, “Maintaining Communication Between an Explorer and a Base Station,” in IFIP International Federation for Information Processing, Boston, MA, 2006. mla: Dynia, Miroslaw, et al. “Maintaining Communication Between an Explorer and a Base Station.” IFIP International Federation for Information Processing, 2006, doi:10.1007/978-0-387-34733-2_14. short: 'M. Dynia, J. Kutyłowski, P. Lorek, F. Meyer auf der Heide, in: IFIP International Federation for Information Processing, Boston, MA, 2006.' date_created: 2020-04-08T11:13:52Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1007/978-0-387-34733-2_14 language: - iso: eng place: Boston, MA publication: IFIP International Federation for Information Processing publication_identifier: isbn: - '9780387346328' - '9780387347332' issn: - 1571-5736 publication_status: published status: public title: Maintaining Communication Between an Explorer and a Base Station type: book_chapter user_id: '15415' year: '2006' ... --- _id: '17011' author: - first_name: Miroslaw full_name: Dynia, Miroslaw last_name: Dynia - first_name: Andreas full_name: Kuhmlehn, Andreas last_name: Kuhmlehn - 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: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: Dynia M, Kuhmlehn A, Kutylowski J, Meyer auf der Heide F, Schindelhauer C. SmartS Simulator Design.; 2006. apa: Dynia, M., Kuhmlehn, A., Kutylowski, J., Meyer auf der Heide, F., & Schindelhauer, C. (2006). SmartS Simulator Design. bibtex: '@book{Dynia_Kuhmlehn_Kutylowski_Meyer auf der Heide_Schindelhauer_2006, title={SmartS Simulator Design}, author={Dynia, Miroslaw and Kuhmlehn, Andreas and Kutylowski, Jaroslaw and Meyer auf der Heide, Friedhelm and Schindelhauer, Christian}, year={2006} }' chicago: Dynia, Miroslaw, Andreas Kuhmlehn, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide, and Christian Schindelhauer. SmartS Simulator Design, 2006. ieee: M. Dynia, A. Kuhmlehn, J. Kutylowski, F. Meyer auf der Heide, and C. Schindelhauer, SmartS Simulator Design. 2006. mla: Dynia, Miroslaw, et al. SmartS Simulator Design. 2006. short: M. Dynia, A. Kuhmlehn, J. Kutylowski, F. Meyer auf der Heide, C. Schindelhauer, SmartS Simulator Design, 2006. date_created: 2020-05-18T13:52:43Z date_updated: 2022-01-06T06:53:02Z ddc: - '000' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: koala date_created: 2020-08-05T10:06:52Z date_updated: 2020-08-05T10:06:52Z file_id: '17620' file_name: smarts-design.pdf file_size: 147312 relation: main_file success: 1 file_date_updated: 2020-08-05T10:06:52Z has_accepted_license: '1' language: - iso: eng publication_status: published status: public title: SmartS Simulator Design type: report user_id: '15415' year: '2006' ... --- _id: '19611' author: - first_name: Klaus full_name: Volbert, Klaus last_name: Volbert citation: ama: Volbert K. Geometric Spanners for Topology Control in Wireless Networks. Vol 168. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2005. apa: Volbert, K. (2005). Geometric Spanners for Topology Control in Wireless Networks (Vol. 168). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. bibtex: '@book{Volbert_2005, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Geometric Spanners for Topology Control in Wireless Networks}, volume={168}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Volbert, Klaus}, year={2005}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: Volbert, Klaus. Geometric Spanners for Topology Control in Wireless Networks. Vol. 168. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. ieee: K. Volbert, Geometric Spanners for Topology Control in Wireless Networks, vol. 168. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. mla: Volbert, Klaus. Geometric Spanners for Topology Control in Wireless Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. short: K. Volbert, Geometric Spanners for Topology Control in Wireless Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. date_created: 2020-09-22T07:40:37Z date_updated: 2022-01-06T06:54:08Z department: - _id: '63' - _id: '26' intvolume: ' 168' language: - iso: eng publication_identifier: isbn: - 3-935433-77-8 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-20050101556 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: Geometric Spanners for Topology Control in Wireless Networks type: dissertation user_id: '5786' volume: 168 year: '2005' ... --- _id: '19827' abstract: - lang: eng text: "We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k+2 edges it interchanges the end vertices of the path. By definition this operation preserves regularity and connectivity. We show that every regular connected graph can be reached by a series of these operations for all k ¡Ý 1. We use a randomized version, called Random k-Flipper, in order to create random regular connected undirected graphs that may serve as a backbone for peer-to-peer networks. We prove for degree d¡Ê ¦¸(log n) that a series of O(dn) Random k-Flipper operations with k ∈ ¦¨(d2n2 log 1/¦Å) transforms any graph into an expander graph with high probability, i.e. 1-n-¦¨(1).\r\n\r\nThe Random 1-Flipper is symmetric, i.e. the transformation probability from any labeled d-regular graph G to G' is equal to those from G' to G. From this and the reachability property we conclude that in the limit a series of Random 1-Flipper operations converges against an uniform probability distribution over all connected labeled d-regular graphs. For degree d ∈ ω(1) growing with the graph size this implies that iteratively applying Random 1-Flipper transforms any given graph into an expander asymptotically almost surely.\r\n\r\nWe use these operations as a maintenance operation for a peer-to-peer network based on random regular connected graphs that provides high robustness and recovers from degenerate network structures by continuously applying these random graph transformations. For this, we describe how network operations for joining and leaving the network can be designed and how the concurrency of the graph transformations can be handled." 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. Peer-to-peer networks based on random transformations of connected regular undirected graphs. In: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA’05. ; 2005. doi:10.1145/1073970.1073992' apa: Mahlmann, P., & Schindelhauer, C. (2005). Peer-to-peer networks based on random transformations of connected regular undirected graphs. In Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures  - SPAA’05. https://doi.org/10.1145/1073970.1073992 bibtex: '@inproceedings{Mahlmann_Schindelhauer_2005, title={Peer-to-peer networks based on random transformations of connected regular undirected graphs}, DOI={10.1145/1073970.1073992}, booktitle={Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures  - SPAA’05}, author={Mahlmann, Peter and Schindelhauer, Christian}, year={2005} }' chicago: Mahlmann, Peter, and Christian Schindelhauer. “Peer-to-Peer Networks Based on Random Transformations of Connected Regular Undirected Graphs.” In Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA’05, 2005. https://doi.org/10.1145/1073970.1073992. ieee: P. Mahlmann and C. Schindelhauer, “Peer-to-peer networks based on random transformations of connected regular undirected graphs,” in Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures  - SPAA’05, 2005. mla: Mahlmann, Peter, and Christian Schindelhauer. “Peer-to-Peer Networks Based on Random Transformations of Connected Regular Undirected Graphs.” Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA’05, 2005, doi:10.1145/1073970.1073992. short: 'P. Mahlmann, C. Schindelhauer, in: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA’05, 2005.' date_created: 2020-10-01T09:50:59Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1145/1073970.1073992 language: - iso: eng publication: Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures - SPAA'05 publication_identifier: isbn: - '1581139861' publication_status: published status: public title: Peer-to-peer networks based on random transformations of connected regular undirected graphs type: conference user_id: '15415' year: '2005' ... --- _id: '19834' abstract: - lang: eng text: 'We present a strategy for organizing the communication in wireless ad hoc networks based on a cell structure. We use the unit disk graph model and assume positioning capabilities for all nodes. The cell structure is an abstract view on the network and represents regions where nodes reside (node cells), regions that can be used for the communication flow (link cells) and regions that cannot be bridged due to the restricted transmission range (barrier cells). Each node can establish a cell classification of its neighborhood based on the position data which is announced by all nodes.
The cell structure has two advantages for applying position-based routing: It helps to determine local minima for greedy forwarding and improves recovery from such minima, because for recovery all edges can be used in contrast to other topology-based rules that can be appliedonly on a planar subgraph.
For the analysis of position-based routing algorithms the measures time and traffic are based on the cell structure. The difficulty of exploring the network is expressed by the size of the barriers (i.e. the number of cells in the perimeters). Exploration can be done in parallel, but with increasing traffic. We propose a comparative measure to assess both time and traffic, the combined comparative ratio, which is the maximum of the ratio of routing time and optimal time and the ratio of the traffic and the minimum exploration costs.
While flooding and common single-path strategies have a linear ratio, we present a simple algorithm that has a sub-linear
combined comparative ratio of O(sqrt(h)), where h is the minimal hop distance between source and target.' 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. Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure. In: 19th IEEE International Parallel and Distributed Processing Symposium. ; 2005:248. doi:10.1109/ipdps.2005.147' apa: Rührup, S., & Schindelhauer, C. (2005). Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure. 19th IEEE International Parallel and Distributed Processing Symposium, 248. https://doi.org/10.1109/ipdps.2005.147 bibtex: '@inproceedings{Rührup_Schindelhauer_2005, title={Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure}, DOI={10.1109/ipdps.2005.147}, booktitle={19th IEEE International Parallel and Distributed Processing Symposium}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2005}, pages={248} }' chicago: Rührup, Stefan, and Christian Schindelhauer. “Competitive Time and Traffic Analysis of Position-Based Routing Using a Cell Structure.” In 19th IEEE International Parallel and Distributed Processing Symposium, 248, 2005. https://doi.org/10.1109/ipdps.2005.147. ieee: 'S. Rührup and C. Schindelhauer, “Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure,” in 19th IEEE International Parallel and Distributed Processing Symposium, 2005, p. 248, doi: 10.1109/ipdps.2005.147.' mla: Rührup, Stefan, and Christian Schindelhauer. “Competitive Time and Traffic Analysis of Position-Based Routing Using a Cell Structure.” 19th IEEE International Parallel and Distributed Processing Symposium, 2005, p. 248, doi:10.1109/ipdps.2005.147. short: 'S. Rührup, C. Schindelhauer, in: 19th IEEE International Parallel and Distributed Processing Symposium, 2005, p. 248.' date_created: 2020-10-01T11:27:14Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1109/ipdps.2005.147 language: - iso: eng page: '248' publication: 19th IEEE International Parallel and Distributed Processing Symposium publication_identifier: isbn: - '0769523129' publication_status: published status: public title: Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure type: conference user_id: '15415' year: '2005' ... --- _id: '19835' abstract: - lang: eng text: The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with
variable transmission ranges. It was introduced and analyzed by Meyer auf der Heide et al. 2004.
In this paper we present a distributed, localized and resource-efficient algorithm for constructing this graph. The qualtiy of the HL graph depends on the domination radius and the publication radius, which affect the amount of interference in the network. These parameters also determine whether the HL graph is a c-spanner, which implies an energy-efficient topology. We investigate the performance on randomly distributed node sets and show that the restrictions on these parameters derived from a worst case analysis are not so tight using realistic settings.

Here, we present the results of our extensive experimental evaluation, measuring congestion, dilation and energy. Congestion includes the load that is induced by interfering edges. We distinguish between congestion and realistic congestion where we also take the signal-to-interference ratio into account.
Our experiments show that the HL graph contains energy-efficient paths as well as paths with a few number of hops while preserving a low congestion. author: - 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: 'Rührup S, Schindelhauer C, Volbert K. Performance Analysis of the Hierarchical Layer Graph for Wireless Networks. In: Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005). Vol 3738. ; 2005:244-257. doi:10.1007/11561354_21' apa: Rührup, S., Schindelhauer, C., & Volbert, K. (2005). Performance Analysis of the Hierarchical Layer Graph for Wireless Networks. In Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005) (Vol. 3738, pp. 244–257). https://doi.org/10.1007/11561354_21 bibtex: '@inproceedings{Rührup_Schindelhauer_Volbert_2005, title={Performance Analysis of the Hierarchical Layer Graph for Wireless Networks}, volume={3738}, DOI={10.1007/11561354_21}, booktitle={Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005)}, author={Rührup, Stefan and Schindelhauer, Christian and Volbert, Klaus}, year={2005}, pages={244–257} }' chicago: Rührup, Stefan, Christian Schindelhauer, and Klaus Volbert. “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks.” In Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005), 3738:244–57, 2005. https://doi.org/10.1007/11561354_21. ieee: S. Rührup, C. Schindelhauer, and K. Volbert, “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks,” in Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005), 2005, vol. 3738, pp. 244–257. mla: Rührup, Stefan, et al. “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks.” Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005), vol. 3738, 2005, pp. 244–57, doi:10.1007/11561354_21. short: 'S. Rührup, C. Schindelhauer, K. Volbert, in: Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005), 2005, pp. 244–257.' date_created: 2020-10-01T11:31:14Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1007/11561354_21 intvolume: ' 3738' language: - iso: eng page: 244-257 publication: Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005) publication_identifier: isbn: - '9783540291329' - '9783540320869' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Performance Analysis of the Hierarchical Layer Graph for Wireless Networks type: conference user_id: '15415' volume: 3738 year: '2005' ... --- _id: '19836' author: - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer - first_name: Kerstin full_name: Voß, Kerstin last_name: Voß citation: ama: 'Schindelhauer C, Voß K. Probability Distributions for Channel Utilisation. In: Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005). 3738. ; 2005:271-284. doi:10.1007/11561354_23' apa: Schindelhauer, C., & Voß, K. (2005). Probability Distributions for Channel Utilisation. In Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005) (pp. 271–284). https://doi.org/10.1007/11561354_23 bibtex: '@inbook{Schindelhauer_Voß_2005, series={3738}, title={Probability Distributions for Channel Utilisation}, DOI={10.1007/11561354_23}, booktitle={Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005)}, author={Schindelhauer, Christian and Voß, Kerstin}, year={2005}, pages={271–284}, collection={3738} }' chicago: Schindelhauer, Christian, and Kerstin Voß. “Probability Distributions for Channel Utilisation.” In Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005), 271–84. 3738, 2005. https://doi.org/10.1007/11561354_23. ieee: C. Schindelhauer and K. Voß, “Probability Distributions for Channel Utilisation,” in Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005), 2005, pp. 271–284. mla: Schindelhauer, Christian, and Kerstin Voß. “Probability Distributions for Channel Utilisation.” Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005), 2005, pp. 271–84, doi:10.1007/11561354_23. short: 'C. Schindelhauer, K. Voß, in: Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005), 2005, pp. 271–284.' date_created: 2020-10-01T11:36:30Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1007/11561354_23 language: - iso: eng page: 271-284 publication: Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005) publication_identifier: isbn: - '9783540291329' - '9783540320869' issn: - 0302-9743 - 1611-3349 publication_status: published series_title: '3738' status: public title: Probability Distributions for Channel Utilisation type: book_chapter user_id: '15415' year: '2005' ... --- _id: '19837' author: - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer - first_name: Gerhard full_name: Weikum, Gerhard last_name: Weikum - first_name: David full_name: Hales, David last_name: Hales - first_name: Peter full_name: Triantafillou, Peter last_name: Triantafillou citation: ama: 'Schindelhauer C, Weikum G, Hales D, Triantafillou P. Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search. In: European Conference on Complex Systems (ECCS 2005). ; 2005.' apa: Schindelhauer, C., Weikum, G., Hales, D., & Triantafillou, P. (2005). Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search. In European Conference on Complex Systems (ECCS 2005). bibtex: '@inproceedings{Schindelhauer_Weikum_Hales_Triantafillou_2005, title={Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search}, booktitle={European Conference on Complex Systems (ECCS 2005)}, author={Schindelhauer, Christian and Weikum, Gerhard and Hales, David and Triantafillou, Peter}, year={2005} }' chicago: Schindelhauer, Christian, Gerhard Weikum, David Hales, and Peter Triantafillou. “Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search.” In European Conference on Complex Systems (ECCS 2005), 2005. ieee: C. Schindelhauer, G. Weikum, D. Hales, and P. Triantafillou, “Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search,” in European Conference on Complex Systems (ECCS 2005), 2005. mla: Schindelhauer, Christian, et al. “Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search.” European Conference on Complex Systems (ECCS 2005), 2005. short: 'C. Schindelhauer, G. Weikum, D. Hales, P. Triantafillou, in: European Conference on Complex Systems (ECCS 2005), 2005.' date_created: 2020-10-01T11:45:28Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' language: - iso: eng publication: European Conference on Complex Systems (ECCS 2005) status: public title: Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search type: conference user_id: '15415' year: '2005' ... --- _id: '19871' abstract: - lang: eng text: Data has become the most valuable asset for many companies; loosing important data can cause companies to fail quite immediately. The protection of data inside storage systems is mostly achieved by using a RAID scheme that adds redundant data to user data, enabling recovery from single or multiple disk failures. This protection against data loss in case of a disk failure can be achieved either by dedicated hardware or a software RAID solution.

One major advantage of software RAID is that it comes for free as a built-in functionality in many operating systems like Linux or Microsoft Windows. The drawback of the built-in functionality is that it is not suited to run in multiple server environments; synchronization and recovery processes can be corrupted if more than a single server is allowed to access a software RAID volume.

In this paper, we present an enhancement for the Linux md-driver that enables a consistent usage of RAID in multiple server environments. Based on the V:DRIVE virtualization environment, RAID volumes can be consistently synchronized and recovered even in distributed environments. Besides the architectural concepts, we present measurements that indicate the viability of this enhanced, distributed version of md. author: - first_name: André full_name: Brinkmann, André 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. Distributed MD. In: In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os. ; 2005:81-88.' apa: Brinkmann, A., Effert, S., Heidebuer, M., & Vodisek, M. (2005). Distributed MD. In In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os (pp. 81–88). bibtex: '@inproceedings{Brinkmann_Effert_Heidebuer_Vodisek_2005, title={Distributed MD}, booktitle={In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os}, author={Brinkmann, André and Effert, Sascha and Heidebuer, Michael and Vodisek, Mario}, year={2005}, pages={81–88} }' chicago: Brinkmann, André, Sascha Effert, Michael Heidebuer, and Mario Vodisek. “Distributed MD.” In In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 81–88, 2005. ieee: A. Brinkmann, S. Effert, M. Heidebuer, and M. Vodisek, “Distributed MD,” in In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 2005, pp. 81–88. mla: Brinkmann, André, et al. “Distributed MD.” In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 2005, pp. 81–88. short: 'A. Brinkmann, S. Effert, M. Heidebuer, M. Vodisek, in: In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 2005, pp. 81–88.' date_created: 2020-10-05T08:49:22Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' - _id: '58' language: - iso: eng page: 81 - 88 publication: In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os status: public title: Distributed MD type: conference user_id: '15415' year: '2005' ... --- _id: '19872' abstract: - lang: eng text: "Recent developments both in the business and the technological domain have led to a significant increase in demand for Business Intelligence (BI) infrastructures that can handle huge amounts of data in small time frames. BI applications are increasingly used by large user bases on all management levels; support tasks spanning the complete value chain are based on transactional data and are directly coupled with operational systems in \x94closed loop\x94 approaches.

To effectively handle the resulting data volume turns out to be an extremely challenging task which encompasses a variety of issues on different levels. We propose an integrated multi layer tool for monitoring, benchmarking, analyzing, and optimizing the performance of such BI infrastructures.

Inside this paper we give a coarse outline of the tool\x92s architecture and demonstrate the value of distinct measurement points at operating system layer. For that purpose we introduce a kernel based benchmark environment and present first measurement results. The gathered data clearly indicates that a meaningful analysis of performance benchmarks without kernel trace points is of limited value - which shows the necessity to consider a separate component within the tool\x92s architecture." author: - first_name: André full_name: Brinkmann, André 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 - first_name: Henning full_name: Baars, Henning last_name: Baars citation: ama: 'Brinkmann A, Effert S, Heidebuer M, Vodisek M, Baars H. An integrated Architecture for Business Intelligence support from Application down to Storage. In: In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os. ; 2005:1-8.' apa: Brinkmann, A., Effert, S., Heidebuer, M., Vodisek, M., & Baars, H. (2005). An integrated Architecture for Business Intelligence support from Application down to Storage. In In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os (pp. 1–8). bibtex: '@inproceedings{Brinkmann_Effert_Heidebuer_Vodisek_Baars_2005, title={An integrated Architecture for Business Intelligence support from Application down to Storage}, booktitle={In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os}, author={Brinkmann, André and Effert, Sascha and Heidebuer, Michael and Vodisek, Mario and Baars, Henning}, year={2005}, pages={1–8} }' chicago: Brinkmann, André, Sascha Effert, Michael Heidebuer, Mario Vodisek, and Henning Baars. “An Integrated Architecture for Business Intelligence Support from Application down to Storage.” In In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 1–8, 2005. ieee: A. Brinkmann, S. Effert, M. Heidebuer, M. Vodisek, and H. Baars, “An integrated Architecture for Business Intelligence support from Application down to Storage,” in In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 2005, pp. 1–8. mla: Brinkmann, André, et al. “An Integrated Architecture for Business Intelligence Support from Application down to Storage.” In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 2005, pp. 1–8. short: 'A. Brinkmann, S. Effert, M. Heidebuer, M. Vodisek, H. Baars, in: In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 2005, pp. 1–8.' date_created: 2020-10-05T08:56:38Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' - _id: '58' language: - iso: eng page: 1-8 publication: In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os status: public title: An integrated Architecture for Business Intelligence support from Application down to Storage type: conference user_id: '15415' year: '2005' ... --- _id: '19888' author: - first_name: Jan full_name: Klein, Jan last_name: Klein - first_name: Gabriel full_name: Zachmann, Gabriel last_name: Zachmann citation: ama: 'Klein J, Zachmann G. The expected running time of hierarchical collision detection. In: ACM SIGGRAPH 2005 Posters on  - SIGGRAPH ’05. ; 2005. doi:10.1145/1186954.1187087' apa: Klein, J., & Zachmann, G. (2005). The expected running time of hierarchical collision detection. In ACM SIGGRAPH 2005 Posters on  - SIGGRAPH ’05. https://doi.org/10.1145/1186954.1187087 bibtex: '@inproceedings{Klein_Zachmann_2005, title={The expected running time of hierarchical collision detection}, DOI={10.1145/1186954.1187087}, booktitle={ACM SIGGRAPH 2005 Posters on  - SIGGRAPH ’05}, author={Klein, Jan and Zachmann, Gabriel}, year={2005} }' chicago: Klein, Jan, and Gabriel Zachmann. “The Expected Running Time of Hierarchical Collision Detection.” In ACM SIGGRAPH 2005 Posters on  - SIGGRAPH ’05, 2005. https://doi.org/10.1145/1186954.1187087. ieee: J. Klein and G. Zachmann, “The expected running time of hierarchical collision detection,” in ACM SIGGRAPH 2005 Posters on  - SIGGRAPH ’05, 2005. mla: Klein, Jan, and Gabriel Zachmann. “The Expected Running Time of Hierarchical Collision Detection.” ACM SIGGRAPH 2005 Posters on  - SIGGRAPH ’05, 2005, doi:10.1145/1186954.1187087. short: 'J. Klein, G. Zachmann, in: ACM SIGGRAPH 2005 Posters on  - SIGGRAPH ’05, 2005.' date_created: 2020-10-05T13:25:41Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' doi: 10.1145/1186954.1187087 language: - iso: eng publication: ACM SIGGRAPH 2005 Posters on - SIGGRAPH '05 publication_status: published status: public title: The expected running time of hierarchical collision detection type: conference user_id: '15415' year: '2005' ... --- _id: '19890' author: - first_name: Jan full_name: Klein, Jan last_name: Klein - first_name: Gabriel full_name: Zachmann, Gabriel last_name: Zachmann citation: ama: 'Klein J, Zachmann G. Interpolation Search for Point Cloud Intersection. In: Proceedings of the 13-Th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005). ; 2005:163-170. doi:10.1145/1186223.1186329' apa: Klein, J., & Zachmann, G. (2005). Interpolation Search for Point Cloud Intersection. In Proceedings of the 13-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005) (pp. 163–170). https://doi.org/10.1145/1186223.1186329 bibtex: '@inproceedings{Klein_Zachmann_2005, title={Interpolation Search for Point Cloud Intersection}, DOI={10.1145/1186223.1186329}, booktitle={Proceedings of the 13-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005)}, author={Klein, Jan and Zachmann, Gabriel}, year={2005}, pages={163–170} }' chicago: Klein, Jan, and Gabriel Zachmann. “Interpolation Search for Point Cloud Intersection.” In Proceedings of the 13-Th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005), 163–70, 2005. https://doi.org/10.1145/1186223.1186329. ieee: J. Klein and G. Zachmann, “Interpolation Search for Point Cloud Intersection,” in Proceedings of the 13-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005), 2005, pp. 163–170. mla: Klein, Jan, and Gabriel Zachmann. “Interpolation Search for Point Cloud Intersection.” Proceedings of the 13-Th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005), 2005, pp. 163–70, doi:10.1145/1186223.1186329. short: 'J. Klein, G. Zachmann, in: Proceedings of the 13-Th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005), 2005, pp. 163–170.' date_created: 2020-10-05T13:38:33Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' doi: 10.1145/1186223.1186329 language: - iso: eng page: 163-170 publication: Proceedings of the 13-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision'2005 (WSCG'2005) status: public title: Interpolation Search for Point Cloud Intersection type: conference user_id: '15415' year: '2005' ... --- _id: '19912' author: - first_name: Chris full_name: Loeser, Chris last_name: Loeser - first_name: Gunnar full_name: Schomaker, Gunnar last_name: Schomaker - first_name: André full_name: Brinkmann, André last_name: Brinkmann - first_name: Mario full_name: Vodisek, Mario last_name: Vodisek - first_name: Michael full_name: Heidebuer, Michael last_name: Heidebuer citation: ama: 'Loeser C, Schomaker G, Brinkmann A, Vodisek M, Heidebuer M. Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts. In: Proceedings of the 4th International Conference on Networking. Vol 3421. Berlin, Heidelberg; 2005:800-810. doi:10.1007/978-3-540-31957-3_90' apa: Loeser, C., Schomaker, G., Brinkmann, A., Vodisek, M., & Heidebuer, M. (2005). Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts. In Proceedings of the 4th International Conference on Networking (Vol. 3421, pp. 800–810). Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31957-3_90 bibtex: '@inproceedings{Loeser_Schomaker_Brinkmann_Vodisek_Heidebuer_2005, place={Berlin, Heidelberg}, title={Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts}, volume={3421}, DOI={10.1007/978-3-540-31957-3_90}, booktitle={Proceedings of the 4th International Conference on Networking}, author={Loeser, Chris and Schomaker, Gunnar and Brinkmann, André and Vodisek, Mario and Heidebuer, Michael}, year={2005}, pages={800–810} }' chicago: Loeser, Chris, Gunnar Schomaker, André Brinkmann, Mario Vodisek, and Michael Heidebuer. “Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts.” In Proceedings of the 4th International Conference on Networking, 3421:800–810. Berlin, Heidelberg, 2005. https://doi.org/10.1007/978-3-540-31957-3_90. ieee: C. Loeser, G. Schomaker, A. Brinkmann, M. Vodisek, and M. Heidebuer, “Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts,” in Proceedings of the 4th International Conference on Networking, 2005, vol. 3421, pp. 800–810. mla: Loeser, Chris, et al. “Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts.” Proceedings of the 4th International Conference on Networking, vol. 3421, 2005, pp. 800–10, doi:10.1007/978-3-540-31957-3_90. short: 'C. Loeser, G. Schomaker, A. Brinkmann, M. Vodisek, M. Heidebuer, in: Proceedings of the 4th International Conference on Networking, Berlin, Heidelberg, 2005, pp. 800–810.' date_created: 2020-10-06T10:36:14Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' - _id: '58' doi: 10.1007/978-3-540-31957-3_90 intvolume: ' 3421' language: - iso: eng page: 800-810 place: Berlin, Heidelberg publication: Proceedings of the 4th International Conference on Networking publication_identifier: isbn: - '9783540253389' - '9783540319573' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts type: conference user_id: '15415' volume: 3421 year: '2005' ... --- _id: '26278' author: - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler - first_name: Benno full_name: Fuchssteiner, Benno last_name: Fuchssteiner citation: ama: Ziegler M, Fuchssteiner B. Nonlinear Reformulation of Heisenberg’s Dynamics. International Journal of Theoretical Physics. Published online 2005:693-717. doi:10.1007/s10773-005-7048-9 apa: Ziegler, M., & Fuchssteiner, B. (2005). Nonlinear Reformulation of Heisenberg’s Dynamics. International Journal of Theoretical Physics, 693–717. https://doi.org/10.1007/s10773-005-7048-9 bibtex: '@article{Ziegler_Fuchssteiner_2005, title={Nonlinear Reformulation of Heisenberg’s Dynamics}, DOI={10.1007/s10773-005-7048-9}, journal={International Journal of Theoretical Physics}, author={Ziegler, Martin and Fuchssteiner, Benno}, year={2005}, pages={693–717} }' chicago: Ziegler, Martin, and Benno Fuchssteiner. “Nonlinear Reformulation of Heisenberg’s Dynamics.” International Journal of Theoretical Physics, 2005, 693–717. https://doi.org/10.1007/s10773-005-7048-9. ieee: 'M. Ziegler and B. Fuchssteiner, “Nonlinear Reformulation of Heisenberg’s Dynamics,” International Journal of Theoretical Physics, pp. 693–717, 2005, doi: 10.1007/s10773-005-7048-9.' mla: Ziegler, Martin, and Benno Fuchssteiner. “Nonlinear Reformulation of Heisenberg’s Dynamics.” International Journal of Theoretical Physics, 2005, pp. 693–717, doi:10.1007/s10773-005-7048-9. short: M. Ziegler, B. Fuchssteiner, International Journal of Theoretical Physics (2005) 693–717. date_created: 2021-10-15T12:29:17Z date_updated: 2022-01-06T06:57:18Z department: - _id: '63' - _id: '26' doi: 10.1007/s10773-005-7048-9 language: - iso: eng page: 693-717 publication: International Journal of Theoretical Physics publication_identifier: issn: - 0020-7748 - 1572-9575 publication_status: published status: public title: Nonlinear Reformulation of Heisenberg's Dynamics type: journal_article user_id: '15415' year: '2005' ... --- _id: '28987' 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. Weighted distributed hash tables. In: SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Las Vegas, Nevada, USA. ; 2005. doi:10.1145/1073970.1074008' apa: 'Schindelhauer, C., & Schomaker, G. (2005). Weighted distributed hash tables. SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Las Vegas, Nevada, USA. https://doi.org/10.1145/1073970.1074008' bibtex: '@inproceedings{Schindelhauer_Schomaker_2005, title={Weighted distributed hash tables}, DOI={10.1145/1073970.1074008}, booktitle={SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Las Vegas, Nevada, USA}, author={Schindelhauer, Christian and Schomaker, Gunnar}, year={2005} }' chicago: 'Schindelhauer, Christian, and Gunnar Schomaker. “Weighted Distributed Hash Tables.” In SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Las Vegas, Nevada, USA, 2005. https://doi.org/10.1145/1073970.1074008.' ieee: 'C. Schindelhauer and G. Schomaker, “Weighted distributed hash tables,” 2005, doi: 10.1145/1073970.1074008.' mla: 'Schindelhauer, Christian, and Gunnar Schomaker. “Weighted Distributed Hash Tables.” SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Las Vegas, Nevada, USA, 2005, doi:10.1145/1073970.1074008.' short: 'C. Schindelhauer, G. Schomaker, in: SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Las Vegas, Nevada, USA, 2005.' date_created: 2021-12-15T14:37:16Z date_updated: 2022-01-06T06:58:42Z department: - _id: '63' - _id: '26' doi: 10.1145/1073970.1074008 language: - iso: eng publication: 'SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Las Vegas, Nevada, USA' status: public title: Weighted distributed hash tables type: conference user_id: '15415' year: '2005' ... --- _id: '26991' 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 Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio. In: Algorithms – ESA 2005. ; 2005. doi:10.1007/11561071_5' apa: Rührup, S., & Schindelhauer, C. (2005). Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio. In Algorithms – ESA 2005. https://doi.org/10.1007/11561071_5 bibtex: '@inbook{Rührup_Schindelhauer_2005, place={Berlin, Heidelberg}, title={Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio}, DOI={10.1007/11561071_5}, booktitle={Algorithms – ESA 2005}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2005} }' chicago: Rührup, Stefan, and Christian Schindelhauer. “Online Routing in Faulty Meshes with Sub-Linear Comparative Time and Traffic Ratio.” In Algorithms – ESA 2005. Berlin, Heidelberg, 2005. https://doi.org/10.1007/11561071_5. ieee: S. Rührup and C. Schindelhauer, “Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio,” in Algorithms – ESA 2005, Berlin, Heidelberg, 2005. mla: Rührup, Stefan, and Christian Schindelhauer. “Online Routing in Faulty Meshes with Sub-Linear Comparative Time and Traffic Ratio.” Algorithms – ESA 2005, 2005, doi:10.1007/11561071_5. short: 'S. Rührup, C. Schindelhauer, in: Algorithms – ESA 2005, Berlin, Heidelberg, 2005.' date_created: 2021-10-28T10:22:39Z date_updated: 2022-01-06T06:57:31Z department: - _id: '63' - _id: '26' doi: 10.1007/11561071_5 language: - iso: eng place: Berlin, Heidelberg publication: Algorithms – ESA 2005 publication_identifier: issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio type: book_chapter user_id: '15415' year: '2005' ...