[{"language":[{"iso":"eng"}],"year":"2006","type":"conference","status":"public","date_created":"2020-09-25T10:36:04Z","publication":"Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA)","date_updated":"2022-01-06T06:54:10Z","_id":"19690","title":"Single-Minded Unlimited Supply Pricing on Sparse Instances","author":[{"last_name":"Briest","full_name":"Briest, Patrick","first_name":"Patrick"},{"last_name":"Krysta","full_name":"Krysta, Piotr","first_name":"Piotr"}],"department":[{"_id":"63"}],"citation":{"ama":"Briest P, Krysta P. Single-Minded Unlimited Supply Pricing on Sparse Instances. In: <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA)</i>. ; 2006.","apa":"Briest, P., &#38; Krysta, P. (2006). Single-Minded Unlimited Supply Pricing on Sparse Instances. In <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA)</i>.","chicago":"Briest, Patrick, and Piotr Krysta. “Single-Minded Unlimited Supply Pricing on Sparse Instances.” In <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA)</i>, 2006.","ieee":"P. Briest and P. Krysta, “Single-Minded Unlimited Supply Pricing on Sparse Instances,” in <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA)</i>, 2006.","mla":"Briest, Patrick, and Piotr Krysta. “Single-Minded Unlimited Supply Pricing on Sparse Instances.” <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA)</i>, 2006.","bibtex":"@inproceedings{Briest_Krysta_2006, title={Single-Minded Unlimited Supply Pricing on Sparse Instances}, booktitle={Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA)}, author={Briest, Patrick and Krysta, Piotr}, year={2006} }","short":"P. Briest, P. Krysta, in: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006."},"user_id":"15415"},{"user_id":"15415","citation":{"apa":"Briest, P., &#38; Gunia, C. (2006). Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels. In <i>Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC)</i>.","ama":"Briest P, Gunia C. Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels. In: <i>Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC)</i>. ; 2006.","chicago":"Briest, Patrick, and Christian Gunia. “Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels.” In <i>Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC)</i>, 2006.","ieee":"P. Briest and C. Gunia, “Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels,” in <i>Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC)</i>, 2006.","mla":"Briest, Patrick, and Christian Gunia. “Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels.” <i>Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC)</i>, 2006.","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} }","short":"P. Briest, C. Gunia, in: Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC), 2006."},"department":[{"_id":"63"}],"author":[{"last_name":"Briest","full_name":"Briest, Patrick","first_name":"Patrick"},{"last_name":"Gunia","full_name":"Gunia, Christian","first_name":"Christian"}],"title":"Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels","_id":"19691","date_updated":"2022-01-06T06:54:10Z","date_created":"2020-09-25T10:38:20Z","publication":"Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC)","status":"public","language":[{"iso":"eng"}],"year":"2006","type":"conference"},{"place":"Seelze","extern":"1","author":[{"first_name":"Petra","full_name":"Büker, Petra","last_name":"Büker","id":"21978"}],"editor":[{"first_name":"Clemens","full_name":"Kammler, Clemens","last_name":"Kammler"}],"title":"Qualitätssicherung ästhetischen Lernens durch prozessorientierte Evaluation. Zu Mascha Kaléko „Der Frühling“ (2./3. Schuljahr)","department":[{"_id":"458"}],"user_id":"21240","citation":{"short":"P. Büker, in: C. Kammler (Ed.), Literarische Kompetenzen – Standards im Literaturunterricht. Modelle für die Primar- und Sekundarstufe, Klett/Kallmeyer, Seelze, 2006, pp. 24–49.","mla":"Büker, Petra. “Qualitätssicherung ästhetischen Lernens durch prozessorientierte Evaluation. Zu Mascha Kaléko „Der Frühling“ (2./3. Schuljahr).” <i>Literarische Kompetenzen – Standards im Literaturunterricht. Modelle für die Primar- und Sekundarstufe</i>, edited by Clemens Kammler, Klett/Kallmeyer, 2006, pp. 24–49.","bibtex":"@inbook{Büker_2006, place={Seelze}, series={Praxis Deutsch}, title={Qualitätssicherung ästhetischen Lernens durch prozessorientierte Evaluation. Zu Mascha Kaléko „Der Frühling“ (2./3. Schuljahr)}, booktitle={Literarische Kompetenzen – Standards im Literaturunterricht. Modelle für die Primar- und Sekundarstufe}, publisher={Klett/Kallmeyer}, author={Büker, Petra}, editor={Kammler, ClemensEditor}, year={2006}, pages={24–49}, collection={Praxis Deutsch} }","chicago":"Büker, Petra. “Qualitätssicherung ästhetischen Lernens durch prozessorientierte Evaluation. Zu Mascha Kaléko „Der Frühling“ (2./3. Schuljahr).” In <i>Literarische Kompetenzen – Standards im Literaturunterricht. Modelle für die Primar- und Sekundarstufe</i>, edited by Clemens Kammler, 24–49. Praxis Deutsch. Seelze: Klett/Kallmeyer, 2006.","ieee":"P. Büker, “Qualitätssicherung ästhetischen Lernens durch prozessorientierte Evaluation. Zu Mascha Kaléko „Der Frühling“ (2./3. Schuljahr),” in <i>Literarische Kompetenzen – Standards im Literaturunterricht. Modelle für die Primar- und Sekundarstufe</i>, C. Kammler, Ed. Seelze: Klett/Kallmeyer, 2006, pp. 24–49.","ama":"Büker P. Qualitätssicherung ästhetischen Lernens durch prozessorientierte Evaluation. Zu Mascha Kaléko „Der Frühling“ (2./3. Schuljahr). In: Kammler C, ed. <i>Literarische Kompetenzen – Standards im Literaturunterricht. Modelle für die Primar- und Sekundarstufe</i>. Praxis Deutsch. Seelze: Klett/Kallmeyer; 2006:24-49.","apa":"Büker, P. (2006). Qualitätssicherung ästhetischen Lernens durch prozessorientierte Evaluation. Zu Mascha Kaléko „Der Frühling“ (2./3. Schuljahr). In C. Kammler (Ed.), <i>Literarische Kompetenzen – Standards im Literaturunterricht. Modelle für die Primar- und Sekundarstufe</i> (pp. 24–49). Seelze: Klett/Kallmeyer."},"series_title":"Praxis Deutsch","status":"public","language":[{"iso":"ger"}],"type":"book_chapter","year":"2006","publisher":"Klett/Kallmeyer","date_created":"2020-09-28T06:51:40Z","publication":"Literarische Kompetenzen – Standards im Literaturunterricht. Modelle für die Primar- und Sekundarstufe","date_updated":"2022-01-06T06:54:10Z","page":"24-49","_id":"19697"},{"department":[{"_id":"458"}],"citation":{"short":"P. Büker, Beiträge Jugendliteratur und Medien  58, H. 2 (2006) 104–111.","bibtex":"@article{Büker_2006, title={Hier kommt Lola! Die unkonventionelle bikulturelle Familie in Isabel Abedis neuer Kinderbuchreihe}, volume={58, H. 2}, number={H. 2}, journal={Beiträge Jugendliteratur und Medien }, author={Büker, Petra}, year={2006}, pages={104–111} }","mla":"Büker, Petra. “Hier kommt Lola! Die unkonventionelle bikulturelle Familie in Isabel Abedis neuer Kinderbuchreihe.” <i>Beiträge Jugendliteratur und Medien </i>, vol. 58, H. 2, no. H. 2, 2006, pp. 104–11.","ieee":"P. Büker, “Hier kommt Lola! Die unkonventionelle bikulturelle Familie in Isabel Abedis neuer Kinderbuchreihe,” <i>Beiträge Jugendliteratur und Medien </i>, vol. 58, H. 2, no. H. 2, pp. 104–111, 2006.","chicago":"Büker, Petra. “Hier kommt Lola! Die unkonventionelle bikulturelle Familie in Isabel Abedis neuer Kinderbuchreihe.” <i>Beiträge Jugendliteratur und Medien </i> 58, H. 2, no. H. 2 (2006): 104–11.","ama":"Büker P. Hier kommt Lola! Die unkonventionelle bikulturelle Familie in Isabel Abedis neuer Kinderbuchreihe. <i>Beiträge Jugendliteratur und Medien </i>. 2006;58, H. 2(H. 2):104-111.","apa":"Büker, P. (2006). Hier kommt Lola! Die unkonventionelle bikulturelle Familie in Isabel Abedis neuer Kinderbuchreihe. <i>Beiträge Jugendliteratur und Medien </i>, <i>58</i>, <i>H. 2</i>(H. 2), 104–111."},"user_id":"21240","title":"Hier kommt Lola! Die unkonventionelle bikulturelle Familie in Isabel Abedis neuer Kinderbuchreihe","author":[{"first_name":"Petra","full_name":"Büker, Petra","id":"21978","last_name":"Büker"}],"extern":"1","date_updated":"2022-01-06T06:54:10Z","issue":"H. 2","page":"104-111","_id":"19698","volume":"58, H. 2","year":"2006","type":"journal_article","language":[{"iso":"ger"}],"status":"public","publication":"Beiträge Jugendliteratur und Medien ","date_created":"2020-09-28T06:55:41Z"},{"volume":"33, H.196","page":"16-22","_id":"19699","date_updated":"2022-01-06T06:54:10Z","publication":"Praxis Deutsch ","date_created":"2020-09-28T06:58:09Z","status":"public","year":"2006","type":"journal_article","language":[{"iso":"ger"}],"user_id":"21240","citation":{"chicago":"Büker, Petra. “„Alles ist gut, so lange du wild bist!“ – Fußball, Abenteuer und starke Kids in Joachim Massaneks Wilden Fußballkerlen.” <i>Praxis Deutsch </i> 33, H.196 (2006): 16–22.","ieee":"P. Büker, “„Alles ist gut, so lange du wild bist!“ – Fußball, Abenteuer und starke Kids in Joachim Massaneks Wilden Fußballkerlen,” <i>Praxis Deutsch </i>, vol. 33, H.196, pp. 16–22, 2006.","ama":"Büker P. „Alles ist gut, so lange du wild bist!“ – Fußball, Abenteuer und starke Kids in Joachim Massaneks Wilden Fußballkerlen. <i>Praxis Deutsch </i>. 2006;33, H.196:16-22.","apa":"Büker, P. (2006). „Alles ist gut, so lange du wild bist!“ – Fußball, Abenteuer und starke Kids in Joachim Massaneks Wilden Fußballkerlen. <i>Praxis Deutsch </i>, <i>33</i>, <i>H.196</i>, 16–22.","short":"P. Büker, Praxis Deutsch  33, H.196 (2006) 16–22.","mla":"Büker, Petra. “„Alles ist gut, so lange du wild bist!“ – Fußball, Abenteuer und starke Kids in Joachim Massaneks Wilden Fußballkerlen.” <i>Praxis Deutsch </i>, vol. 33, H.196, 2006, pp. 16–22.","bibtex":"@article{Büker_2006, title={„Alles ist gut, so lange du wild bist!“ – Fußball, Abenteuer und starke Kids in Joachim Massaneks Wilden Fußballkerlen}, volume={33, H.196}, journal={Praxis Deutsch }, author={Büker, Petra}, year={2006}, pages={16–22} }"},"department":[{"_id":"458"}],"author":[{"id":"21978","last_name":"Büker","first_name":"Petra","full_name":"Büker, Petra"}],"extern":"1","title":"„Alles ist gut, so lange du wild bist!“ – Fußball, Abenteuer und starke Kids in Joachim Massaneks Wilden Fußballkerlen"},{"_id":"19718","date_updated":"2022-01-06T06:54:10Z","date_created":"2020-09-28T10:01:34Z","status":"public","language":[{"iso":"eng"}],"year":"2006","type":"mastersthesis","user_id":"15415","citation":{"ieee":"B. Degener, <i>Die Analyse von Estimation-of-Distribution-Algorithmen auf ausgewählten Funktionen</i>. 2006.","chicago":"Degener, Bastian. <i>Die Analyse von Estimation-of-Distribution-Algorithmen Auf Ausgewählten Funktionen</i>, 2006.","apa":"Degener, B. (2006). <i>Die Analyse von Estimation-of-Distribution-Algorithmen auf ausgewählten Funktionen</i>.","ama":"Degener B. <i>Die Analyse von Estimation-of-Distribution-Algorithmen Auf Ausgewählten Funktionen</i>.; 2006.","short":"B. Degener, Die Analyse von Estimation-of-Distribution-Algorithmen Auf Ausgewählten Funktionen, 2006.","bibtex":"@book{Degener_2006, title={Die Analyse von Estimation-of-Distribution-Algorithmen auf ausgewählten Funktionen}, author={Degener, Bastian}, year={2006} }","mla":"Degener, Bastian. <i>Die Analyse von Estimation-of-Distribution-Algorithmen Auf Ausgewählten Funktionen</i>. 2006."},"department":[{"_id":"63"}],"author":[{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"}],"title":"Die Analyse von Estimation-of-Distribution-Algorithmen auf ausgewählten Funktionen"},{"doi":"10.1145/1148109.1148162","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"},{"last_name":"Schindelhauer","full_name":"Schindelhauer, Christian","first_name":"Christian"}],"title":"Distributed random digraph transformations for peer-to-peer networks","department":[{"_id":"63"}],"publication_status":"published","user_id":"15415","citation":{"mla":"Mahlmann, Peter, and Christian Schindelhauer. “Distributed Random Digraph Transformations for Peer-to-Peer Networks.” <i>Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA ’06</i>, 2006, pp. 308--317, doi:<a href=\"https://doi.org/10.1145/1148109.1148162\">10.1145/1148109.1148162</a>.","bibtex":"@inproceedings{Mahlmann_Schindelhauer_2006, title={Distributed random digraph transformations for peer-to-peer networks}, DOI={<a href=\"https://doi.org/10.1145/1148109.1148162\">10.1145/1148109.1148162</a>}, booktitle={Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures  - SPAA ’06}, author={Mahlmann, Peter and Schindelhauer, Christian}, year={2006}, pages={308--317} }","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.","apa":"Mahlmann, P., &#38; Schindelhauer, C. (2006). Distributed random digraph transformations for peer-to-peer networks. In <i>Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures  - SPAA ’06</i> (pp. 308--317). <a href=\"https://doi.org/10.1145/1148109.1148162\">https://doi.org/10.1145/1148109.1148162</a>","ama":"Mahlmann P, Schindelhauer C. Distributed random digraph transformations for peer-to-peer networks. In: <i>Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA ’06</i>. ; 2006:308--317. doi:<a href=\"https://doi.org/10.1145/1148109.1148162\">10.1145/1148109.1148162</a>","chicago":"Mahlmann, Peter, and Christian Schindelhauer. “Distributed Random Digraph Transformations for Peer-to-Peer Networks.” In <i>Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA ’06</i>, 308--317, 2006. <a href=\"https://doi.org/10.1145/1148109.1148162\">https://doi.org/10.1145/1148109.1148162</a>.","ieee":"P. Mahlmann and C. Schindelhauer, “Distributed random digraph transformations for peer-to-peer networks,” in <i>Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures  - SPAA ’06</i>, 2006, pp. 308--317."},"status":"public","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["1595934529"]},"type":"conference","year":"2006","date_created":"2020-09-30T13:07:55Z","publication":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures  - SPAA '06","date_updated":"2022-01-06T06:54:13Z","_id":"19808","page":"308--317"},{"publication":"Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)","date_created":"2020-10-01T11:51:15Z","status":"public","year":"2006","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540496946","9783540496960"]},"type":"conference","language":[{"iso":"eng"}],"_id":"19838","date_updated":"2022-01-06T06:54:13Z","author":[{"full_name":"Rührup, Stefan","first_name":"Stefan","last_name":"Rührup"},{"first_name":"Christian","full_name":"Schindelhauer, Christian","last_name":"Schindelhauer"}],"title":"Online Multi-path Routing in a Maze","doi":"10.1007/11940128_65","user_id":"15415","publication_status":"published","citation":{"mla":"Rührup, Stefan, and Christian Schindelhauer. “Online Multi-Path Routing in a Maze.” <i>Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)</i>, 2006, doi:<a href=\"https://doi.org/10.1007/11940128_65\">10.1007/11940128_65</a>.","bibtex":"@inproceedings{Rührup_Schindelhauer_2006, title={Online Multi-path Routing in a Maze}, DOI={<a href=\"https://doi.org/10.1007/11940128_65\">10.1007/11940128_65</a>}, booktitle={Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2006} }","short":"S. Rührup, C. Schindelhauer, in: Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 2006.","ama":"Rührup S, Schindelhauer C. Online Multi-path Routing in a Maze. In: <i>Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)</i>. ; 2006. doi:<a href=\"https://doi.org/10.1007/11940128_65\">10.1007/11940128_65</a>","apa":"Rührup, S., &#38; Schindelhauer, C. (2006). Online Multi-path Routing in a Maze. In <i>Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)</i>. <a href=\"https://doi.org/10.1007/11940128_65\">https://doi.org/10.1007/11940128_65</a>","chicago":"Rührup, Stefan, and Christian Schindelhauer. “Online Multi-Path Routing in a Maze.” In <i>Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)</i>, 2006. <a href=\"https://doi.org/10.1007/11940128_65\">https://doi.org/10.1007/11940128_65</a>.","ieee":"S. Rührup and C. Schindelhauer, “Online Multi-path Routing in a Maze,” in <i>Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)</i>, 2006."},"department":[{"_id":"63"}]},{"title":"SAN Optimal Multi Parameter Access Scheme","author":[{"last_name":"Schindelhauer","first_name":"Christian","full_name":"Schindelhauer, Christian"},{"full_name":"Schomaker, Gunnar","first_name":"Gunnar","last_name":"Schomaker"}],"doi":"10.1109/icniconsmcl.2006.190","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."}],"citation":{"bibtex":"@inproceedings{Schindelhauer_Schomaker_2006, title={SAN Optimal Multi Parameter Access Scheme}, DOI={<a href=\"https://doi.org/10.1109/icniconsmcl.2006.190\">10.1109/icniconsmcl.2006.190</a>}, booktitle={5th International Conference on Networking (ICN)}, author={Schindelhauer, Christian and Schomaker, Gunnar}, year={2006} }","mla":"Schindelhauer, Christian, and Gunnar Schomaker. “SAN Optimal Multi Parameter Access Scheme.” <i>5th International Conference on Networking (ICN)</i>, 2006, doi:<a href=\"https://doi.org/10.1109/icniconsmcl.2006.190\">10.1109/icniconsmcl.2006.190</a>.","short":"C. Schindelhauer, G. Schomaker, in: 5th International Conference on Networking (ICN), 2006.","ama":"Schindelhauer C, Schomaker G. SAN Optimal Multi Parameter Access Scheme. In: <i>5th International Conference on Networking (ICN)</i>. ; 2006. doi:<a href=\"https://doi.org/10.1109/icniconsmcl.2006.190\">10.1109/icniconsmcl.2006.190</a>","apa":"Schindelhauer, C., &#38; Schomaker, G. (2006). SAN Optimal Multi Parameter Access Scheme. <i>5th International Conference on Networking (ICN)</i>. <a href=\"https://doi.org/10.1109/icniconsmcl.2006.190\">https://doi.org/10.1109/icniconsmcl.2006.190</a>","ieee":"C. Schindelhauer and G. Schomaker, “SAN Optimal Multi Parameter Access Scheme,” 2006, doi: <a href=\"https://doi.org/10.1109/icniconsmcl.2006.190\">10.1109/icniconsmcl.2006.190</a>.","chicago":"Schindelhauer, Christian, and Gunnar Schomaker. “SAN Optimal Multi Parameter Access Scheme.” In <i>5th International Conference on Networking (ICN)</i>, 2006. <a href=\"https://doi.org/10.1109/icniconsmcl.2006.190\">https://doi.org/10.1109/icniconsmcl.2006.190</a>."},"publication_status":"published","user_id":"15415","department":[{"_id":"63"}],"date_created":"2020-10-01T11:55:27Z","publication":"5th International Conference on Networking (ICN)","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["0769525520"]},"type":"conference","year":"2006","status":"public","_id":"19839","date_updated":"2022-01-06T06:54:13Z"},{"department":[{"_id":"63"}],"user_id":"15415","citation":{"apa":"Rührup, S., &#38; Schindelhauer, C. (2006). <i>Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks</i>. Universität Paderborn.","ama":"Rührup S, Schindelhauer C. <i>Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks</i>. Universität Paderborn; 2006.","chicago":"Rührup, Stefan, and Christian Schindelhauer. <i>Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks</i>. Universität Paderborn, 2006.","ieee":"S. Rührup and C. Schindelhauer, <i>Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks</i>. Universität Paderborn, 2006.","mla":"Rührup, Stefan, and Christian Schindelhauer. <i>Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks</i>. 2006.","bibtex":"@book{Rührup_Schindelhauer_2006, place={Universität Paderborn}, title={Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2006} }","short":"S. Rührup, C. Schindelhauer, Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks, Universität Paderborn, 2006."},"place":"Universität Paderborn","author":[{"last_name":"Rührup","full_name":"Rührup, Stefan","first_name":"Stefan"},{"full_name":"Schindelhauer, Christian","first_name":"Christian","last_name":"Schindelhauer"}],"title":"Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks","date_updated":"2022-01-06T06:54:13Z","_id":"19840","status":"public","type":"report","year":"2006","language":[{"iso":"eng"}],"date_created":"2020-10-01T12:01:15Z"},{"title":"Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks","author":[{"last_name":"Schomaker","first_name":"Gunnar","full_name":"Schomaker, Gunnar"},{"last_name":"Loeser","full_name":"Loeser, Christoph","first_name":"Christoph"},{"last_name":"Schubert","first_name":"Matthias","full_name":"Schubert, Matthias"}],"abstract":[{"lang":"eng","text":"In previous publications there have been several proposals<br>regarding replica generation and placement of movie content in<br>content-distribution-networks or P2P overlays. Within this paper<br>we extend approaches for heterogeneous placement scenarios<br>described in prior publications. Therefor we presume heterogeneous<br>server peers' bandwidth, HD capacity, and movie popularities.<br>Movie documents are replicated and placed onto server peers with<br>respect to the predicted popularity values. Thus each document<br>aims to gain fair networks resources according to its popularity.<br>We present simulation results of heuristics of different placement<br>strategies and compare them with a near optimal technique."}],"citation":{"ieee":"G. Schomaker, C. Loeser, and M. Schubert, “Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks,” in <i>5th International Conference on Networking (ICN).</i>, 2006.","chicago":"Schomaker, Gunnar, Christoph Loeser, and Matthias Schubert. “Predictive Replication and Placement Strategies for Movie Documents in Heterogeneous Content Delivery Networks.” In <i>5th International Conference on Networking (ICN).</i>, 2006.","apa":"Schomaker, G., Loeser, C., &#38; Schubert, M. (2006). Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks. In <i>5th International Conference on Networking (ICN).</i>","ama":"Schomaker G, Loeser C, Schubert M. Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks. In: <i>5th International Conference on Networking (ICN).</i> ; 2006.","short":"G. Schomaker, C. Loeser, M. Schubert, in: 5th International Conference on Networking (ICN)., 2006.","bibtex":"@inproceedings{Schomaker_Loeser_Schubert_2006, title={Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks}, booktitle={5th International Conference on Networking (ICN).}, author={Schomaker, Gunnar and Loeser, Christoph and Schubert, Matthias}, year={2006} }","mla":"Schomaker, Gunnar, et al. “Predictive Replication and Placement Strategies for Movie Documents in Heterogeneous Content Delivery Networks.” <i>5th International Conference on Networking (ICN).</i>, 2006."},"user_id":"15415","department":[{"_id":"63"}],"publication":"5th International Conference on Networking (ICN).","date_created":"2020-10-02T11:57:06Z","year":"2006","type":"conference","language":[{"iso":"eng"}],"status":"public","_id":"19854","date_updated":"2022-01-06T06:54:13Z"},{"doi":"10.1109/icniconsmcl.2006.182","title":"Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments","author":[{"last_name":"Brinkmann","full_name":"Brinkmann, Andre","first_name":"Andre"},{"first_name":"Sascha","full_name":"Effert, Sascha","last_name":"Effert"},{"last_name":"Heidebuer","full_name":"Heidebuer, Michael","first_name":"Michael"},{"first_name":"Mario","full_name":"Vodisek, Mario","last_name":"Vodisek"}],"department":[{"_id":"63"},{"_id":"58"}],"citation":{"ieee":"A. Brinkmann, S. Effert, M. Heidebuer, and M. Vodisek, “Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments,” 2006, doi: <a href=\"https://doi.org/10.1109/icniconsmcl.2006.182\">10.1109/icniconsmcl.2006.182</a>.","chicago":"Brinkmann, Andre, Sascha Effert, Michael Heidebuer, and Mario Vodisek. “Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments.” In <i>5th International Conference on Networking (ICN)</i>, 2006. <a href=\"https://doi.org/10.1109/icniconsmcl.2006.182\">https://doi.org/10.1109/icniconsmcl.2006.182</a>.","ama":"Brinkmann A, Effert S, Heidebuer M, Vodisek M. Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments. In: <i>5th International Conference on Networking (ICN)</i>. ; 2006. doi:<a href=\"https://doi.org/10.1109/icniconsmcl.2006.182\">10.1109/icniconsmcl.2006.182</a>","apa":"Brinkmann, A., Effert, S., Heidebuer, M., &#38; Vodisek, M. (2006). Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments. <i>5th International Conference on Networking (ICN)</i>. <a href=\"https://doi.org/10.1109/icniconsmcl.2006.182\">https://doi.org/10.1109/icniconsmcl.2006.182</a>","short":"A. Brinkmann, S. Effert, M. Heidebuer, M. Vodisek, in: 5th International Conference on Networking (ICN), 2006.","bibtex":"@inproceedings{Brinkmann_Effert_Heidebuer_Vodisek_2006, title={Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments}, DOI={<a href=\"https://doi.org/10.1109/icniconsmcl.2006.182\">10.1109/icniconsmcl.2006.182</a>}, booktitle={5th International Conference on Networking (ICN)}, author={Brinkmann, Andre and Effert, Sascha and Heidebuer, Michael and Vodisek, Mario}, year={2006} }","mla":"Brinkmann, Andre, et al. “Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments.” <i>5th International Conference on Networking (ICN)</i>, 2006, doi:<a href=\"https://doi.org/10.1109/icniconsmcl.2006.182\">10.1109/icniconsmcl.2006.182</a>."},"user_id":"15415","publication_status":"published","publication_identifier":{"isbn":["0769525520"]},"type":"conference","year":"2006","language":[{"iso":"eng"}],"status":"public","publication":"5th International Conference on Networking (ICN)","date_created":"2020-10-05T08:38:26Z","date_updated":"2022-01-06T06:54:14Z","_id":"19870"},{"title":"Provision of Fault Tolerance with Grid-enabled and SLA-aware Resource Management Systems","author":[{"first_name":"Felix","full_name":"Heine, Felix","last_name":"Heine"},{"full_name":"Hovestadt, Matthias","first_name":"Matthias","last_name":"Hovestadt"},{"last_name":"Kao","first_name":"Odej","full_name":"Kao, Odej"},{"id":"15274","last_name":"Keller","full_name":"Keller, Axel","first_name":"Axel"}],"editor":[{"first_name":"Gerhard R.","full_name":"Jouberta, Gerhard R.","last_name":"Jouberta"},{"last_name":"Nagel","first_name":"Wolfgang E.","full_name":"Nagel, Wolfgang E."},{"first_name":"Frans J.","full_name":"Peters, Frans J.","last_name":"Peters"},{"first_name":"Oscar","full_name":"Plata, Oscar","last_name":"Plata"},{"last_name":"Tirado","first_name":"Francisco","full_name":"Tirado, Francisco"},{"last_name":"Zapata","full_name":"Zapata, Emilio L.","first_name":"Emilio L."}],"citation":{"ama":"Heine F, Hovestadt M, Kao O, Keller A. Provision of Fault Tolerance with Grid-enabled and SLA-aware Resource Management Systems. In: Jouberta GR, Nagel WE, Peters FJ, Plata O, Tirado F, Zapata EL, eds. <i>Parallel Computing: Current and Future Issues of High End Computing</i>. ; 2006:113-120.","apa":"Heine, F., Hovestadt, M., Kao, O., &#38; Keller, A. (2006). Provision of Fault Tolerance with Grid-enabled and SLA-aware Resource Management Systems. In G. R. Jouberta, W. E. Nagel, F. J. Peters, O. Plata, F. Tirado, &#38; E. L. Zapata (Eds.), <i>Parallel Computing: Current and Future Issues of High End Computing</i> (pp. 113–120).","ieee":"F. Heine, M. Hovestadt, O. Kao, and A. Keller, “Provision of Fault Tolerance with Grid-enabled and SLA-aware Resource Management Systems,” in <i>Parallel Computing: Current and Future Issues of High End Computing</i>, G. R. Jouberta, W. E. Nagel, F. J. Peters, O. Plata, F. Tirado, and E. L. Zapata, Eds. 2006, pp. 113–120.","chicago":"Heine, Felix, Matthias Hovestadt, Odej Kao, and Axel Keller. “Provision of Fault Tolerance with Grid-Enabled and SLA-Aware Resource Management Systems.” In <i>Parallel Computing: Current and Future Issues of High End Computing</i>, edited by Gerhard R. Jouberta, Wolfgang E. Nagel, Frans J. Peters, Oscar Plata, Francisco Tirado, and Emilio L. Zapata, 113–20, 2006.","bibtex":"@inbook{Heine_Hovestadt_Kao_Keller_2006, title={Provision of Fault Tolerance with Grid-enabled and SLA-aware Resource Management Systems}, booktitle={Parallel Computing: Current and Future Issues of High End Computing}, author={Heine, Felix and Hovestadt, Matthias and Kao, Odej and Keller, Axel}, editor={Jouberta, Gerhard R. and Nagel, Wolfgang E. and Peters, Frans J. and Plata, Oscar and Tirado, Francisco and Zapata, Emilio L.Editors}, year={2006}, pages={113–120} }","mla":"Heine, Felix, et al. “Provision of Fault Tolerance with Grid-Enabled and SLA-Aware Resource Management Systems.” <i>Parallel Computing: Current and Future Issues of High End Computing</i>, edited by Gerhard R. Jouberta et al., 2006, pp. 113–20.","short":"F. Heine, M. Hovestadt, O. Kao, A. Keller, in: G.R. Jouberta, W.E. Nagel, F.J. Peters, O. Plata, F. Tirado, E.L. Zapata (Eds.), Parallel Computing: Current and Future Issues of High End Computing, 2006, pp. 113–120."},"publication_status":"published","user_id":"15274","department":[{"_id":"27"}],"date_created":"2018-03-29T11:31:57Z","publication":"Parallel Computing: Current and Future Issues of High End Computing","language":[{"iso":"eng"}],"year":"2006","type":"book_chapter","status":"public","_id":"1989","page":"113-120","date_updated":"2022-01-06T06:54:14Z"},{"user_id":"15274","publication_status":"published","citation":{"bibtex":"@inbook{Burchard_Heine_Heiss_Hovestadt_Kao_Keller_Linnert_Schneider_2006, title={The Virtual Resource Manager: Local Autonomy versus QoS Guarantees for Grid Applications}, DOI={<a href=\"https://doi.org/10.1007/978-0-387-29445-2_5\">10.1007/978-0-387-29445-2_5</a>}, booktitle={Future Generation Grids}, author={Burchard, Lars-Olof and Heine, Felix and Heiss, Hans-Ulrich and Hovestadt, Matthias and Kao, Odej and Keller, Axel and Linnert, Barry and Schneider, Jörg}, editor={Getov, Vladimir and Laforenza, Domenico and Reinefeld, AlexanderEditors}, year={2006}, pages={83–98} }","mla":"Burchard, Lars-Olof, et al. “The Virtual Resource Manager: Local Autonomy versus QoS Guarantees for Grid Applications.” <i>Future Generation Grids</i>, edited by Vladimir Getov et al., 2006, pp. 83–98, doi:<a href=\"https://doi.org/10.1007/978-0-387-29445-2_5\">10.1007/978-0-387-29445-2_5</a>.","short":"L.-O. Burchard, F. Heine, H.-U. Heiss, M. Hovestadt, O. Kao, A. Keller, B. Linnert, J. Schneider, in: V. Getov, D. Laforenza, A. Reinefeld (Eds.), Future Generation Grids, 2006, pp. 83–98.","apa":"Burchard, L.-O., Heine, F., Heiss, H.-U., Hovestadt, M., Kao, O., Keller, A., … Schneider, J. (2006). The Virtual Resource Manager: Local Autonomy versus QoS Guarantees for Grid Applications. In V. Getov, D. Laforenza, &#38; A. Reinefeld (Eds.), <i>Future Generation Grids</i> (pp. 83–98). <a href=\"https://doi.org/10.1007/978-0-387-29445-2_5\">https://doi.org/10.1007/978-0-387-29445-2_5</a>","ama":"Burchard L-O, Heine F, Heiss H-U, et al. The Virtual Resource Manager: Local Autonomy versus QoS Guarantees for Grid Applications. In: Getov V, Laforenza D, Reinefeld A, eds. <i>Future Generation Grids</i>. ; 2006:83-98. doi:<a href=\"https://doi.org/10.1007/978-0-387-29445-2_5\">10.1007/978-0-387-29445-2_5</a>","ieee":"L.-O. Burchard <i>et al.</i>, “The Virtual Resource Manager: Local Autonomy versus QoS Guarantees for Grid Applications,” in <i>Future Generation Grids</i>, V. Getov, D. Laforenza, and A. Reinefeld, Eds. 2006, pp. 83–98.","chicago":"Burchard, Lars-Olof, Felix Heine, Hans-Ulrich Heiss, Matthias Hovestadt, Odej Kao, Axel Keller, Barry Linnert, and Jörg Schneider. “The Virtual Resource Manager: Local Autonomy versus QoS Guarantees for Grid Applications.” In <i>Future Generation Grids</i>, edited by Vladimir Getov, Domenico Laforenza, and Alexander Reinefeld, 83–98, 2006. <a href=\"https://doi.org/10.1007/978-0-387-29445-2_5\">https://doi.org/10.1007/978-0-387-29445-2_5</a>."},"department":[{"_id":"27"}],"editor":[{"last_name":"Getov","first_name":"Vladimir","full_name":"Getov, Vladimir"},{"full_name":"Laforenza, Domenico","first_name":"Domenico","last_name":"Laforenza"},{"first_name":"Alexander","full_name":"Reinefeld, Alexander","last_name":"Reinefeld"}],"author":[{"last_name":"Burchard","full_name":"Burchard, Lars-Olof","first_name":"Lars-Olof"},{"last_name":"Heine","full_name":"Heine, Felix","first_name":"Felix"},{"last_name":"Heiss","full_name":"Heiss, Hans-Ulrich","first_name":"Hans-Ulrich"},{"last_name":"Hovestadt","first_name":"Matthias","full_name":"Hovestadt, Matthias"},{"first_name":"Odej","full_name":"Kao, Odej","last_name":"Kao"},{"first_name":"Axel","full_name":"Keller, Axel","id":"15274","last_name":"Keller"},{"full_name":"Linnert, Barry","first_name":"Barry","last_name":"Linnert"},{"last_name":"Schneider","first_name":"Jörg","full_name":"Schneider, Jörg"}],"title":"The Virtual Resource Manager: Local Autonomy versus QoS Guarantees for Grid Applications","doi":"10.1007/978-0-387-29445-2_5","abstract":[{"text":"In this paper, we describe the architecture of the virtual resource manager VRM, a management system designed to reside on top of local resource management systems for cluster computers and other kinds of resources. The most important feature of the VRM is its capability to handle quality-of-service (QoS) guarantees and service-level agreements (SLAs). The particular emphasis of the paper is on the various opportunities to deal with local autonomy for resource management systems not supporting SLAs. As local administrators may not want to hand over complete control to the Grid management, it is necessary to define strategies that deal with this issue. Local autonomy should be retained as much as possible while providing reliability and QoS guarantees for Grid applications, e.g., specified as SLAs.","lang":"eng"}],"page":"83-98","_id":"1991","date_updated":"2022-01-06T06:54:14Z","publication":"Future Generation Grids","date_created":"2018-03-29T11:32:53Z","status":"public","type":"book_chapter","year":"2006","language":[{"iso":"eng"}]},{"date_created":"2020-10-06T11:19:26Z","status":"public","year":"2006","type":"conference","language":[{"iso":"ger"}],"_id":"19923","date_updated":"2022-01-06T06:54:14Z","author":[{"id":"21978","last_name":"Büker","full_name":"Büker, Petra","first_name":"Petra"}],"extern":"1","title":"Qualitative Unterrichtsforschung als Beitrag zur Professionalisierung ästhetischen Lernens und Lehrens – am Beispiel des interkulturell orientierten Literaturunterrichts in der Grundschule. Vortrag im Forschungskolleg „Ästhetisches Lernen“ am PLAZ. Universität Paderborn","abstract":[{"text":"November 2006","lang":"eng"}],"user_id":"21240","citation":{"chicago":"Büker, Petra. “Qualitative Unterrichtsforschung als Beitrag zur Professionalisierung ästhetischen Lernens und Lehrens – am Beispiel des interkulturell orientierten Literaturunterrichts in der Grundschule. Vortrag im Forschungskolleg „Ästhetisches Lernen“ am PLAZ. Universität Paderborn,” 2006.","ieee":"P. Büker, “Qualitative Unterrichtsforschung als Beitrag zur Professionalisierung ästhetischen Lernens und Lehrens – am Beispiel des interkulturell orientierten Literaturunterrichts in der Grundschule. Vortrag im Forschungskolleg „Ästhetisches Lernen“ am PLAZ. Universität Paderborn,” 2006.","ama":"Büker P. Qualitative Unterrichtsforschung als Beitrag zur Professionalisierung ästhetischen Lernens und Lehrens – am Beispiel des interkulturell orientierten Literaturunterrichts in der Grundschule. Vortrag im Forschungskolleg „Ästhetisches Lernen“ am PLAZ. Universität Paderborn. In: ; 2006.","apa":"Büker, P. (2006). Qualitative Unterrichtsforschung als Beitrag zur Professionalisierung ästhetischen Lernens und Lehrens – am Beispiel des interkulturell orientierten Literaturunterrichts in der Grundschule. Vortrag im Forschungskolleg „Ästhetisches Lernen“ am PLAZ. Universität Paderborn.","short":"P. Büker, in: 2006.","mla":"Büker, Petra. <i>Qualitative Unterrichtsforschung als Beitrag zur Professionalisierung ästhetischen Lernens und Lehrens – am Beispiel des interkulturell orientierten Literaturunterrichts in der Grundschule. Vortrag im Forschungskolleg „Ästhetisches Lernen“ am PLAZ. Universität Paderborn</i>. 2006.","bibtex":"@inproceedings{Büker_2006, title={Qualitative Unterrichtsforschung als Beitrag zur Professionalisierung ästhetischen Lernens und Lehrens – am Beispiel des interkulturell orientierten Literaturunterrichts in der Grundschule. Vortrag im Forschungskolleg „Ästhetisches Lernen“ am PLAZ. Universität Paderborn}, author={Büker, Petra}, year={2006} }"},"department":[{"_id":"458"}]},{"citation":{"ama":"Kortenjan M, Schomaker G. Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes. In: <i>4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)</i>. ; 2006. doi:<a href=\"https://doi.org/10.1145/1108590.1108608\">10.1145/1108590.1108608</a>","apa":"Kortenjan, M., &#38; Schomaker, G. (2006). Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes. In <i>4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)</i>. <a href=\"https://doi.org/10.1145/1108590.1108608\">https://doi.org/10.1145/1108590.1108608</a>","ieee":"M. Kortenjan and G. Schomaker, “Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes,” in <i>4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)</i>, 2006.","chicago":"Kortenjan, Michael, and Gunnar Schomaker. “Size Equivalent Cluster Trees (SEC-Trees) Realtime Rendering of Large Industrial Scenes.” In <i>4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)</i>, 2006. <a href=\"https://doi.org/10.1145/1108590.1108608\">https://doi.org/10.1145/1108590.1108608</a>.","bibtex":"@inproceedings{Kortenjan_Schomaker_2006, title={Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes}, DOI={<a href=\"https://doi.org/10.1145/1108590.1108608\">10.1145/1108590.1108608</a>}, booktitle={4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)}, author={Kortenjan, Michael and Schomaker, Gunnar}, year={2006} }","mla":"Kortenjan, Michael, and Gunnar Schomaker. “Size Equivalent Cluster Trees (SEC-Trees) Realtime Rendering of Large Industrial Scenes.” <i>4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)</i>, 2006, doi:<a href=\"https://doi.org/10.1145/1108590.1108608\">10.1145/1108590.1108608</a>.","short":"M. Kortenjan, G. Schomaker, in: 4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006), 2006."},"user_id":"15415","department":[{"_id":"63"}],"title":"Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes","author":[{"first_name":"Michael","full_name":"Kortenjan, Michael","last_name":"Kortenjan"},{"full_name":"Schomaker, Gunnar","first_name":"Gunnar","last_name":"Schomaker"}],"abstract":[{"text":"#hniid 2484","lang":"eng"}],"doi":"10.1145/1108590.1108608","_id":"19932","date_updated":"2022-01-06T06:54:14Z","publication":"4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)","date_created":"2020-10-06T13:32:47Z","year":"2006","type":"conference","language":[{"iso":"eng"}],"status":"public"},{"status":"public","year":"2006","type":"journal_article","publication":"J. Algorithms","date_created":"2018-03-29T12:01:37Z","date_updated":"2022-01-06T06:54:25Z","issue":"1","volume":61,"page":"20--44","_id":"2029","intvolume":"        61","doi":"10.1016/j.jalgor.2004.07.006","author":[{"first_name":"Petr","full_name":"Kolman, Petr","last_name":"Kolman"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"title":"Improved bounds for the unsplittable flow problem","department":[{"_id":"79"}],"user_id":"15504","citation":{"short":"P. Kolman, C. Scheideler, J. Algorithms 61 (2006) 20--44.","bibtex":"@article{Kolman_Scheideler_2006, title={Improved bounds for the unsplittable flow problem}, volume={61}, DOI={<a href=\"https://doi.org/10.1016/j.jalgor.2004.07.006\">10.1016/j.jalgor.2004.07.006</a>}, number={1}, journal={J. Algorithms}, author={Kolman, Petr and Scheideler, Christian}, year={2006}, pages={20--44} }","mla":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” <i>J. Algorithms</i>, vol. 61, no. 1, 2006, pp. 20--44, doi:<a href=\"https://doi.org/10.1016/j.jalgor.2004.07.006\">10.1016/j.jalgor.2004.07.006</a>.","ieee":"P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,” <i>J. Algorithms</i>, vol. 61, no. 1, pp. 20--44, 2006.","chicago":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” <i>J. Algorithms</i> 61, no. 1 (2006): 20--44. <a href=\"https://doi.org/10.1016/j.jalgor.2004.07.006\">https://doi.org/10.1016/j.jalgor.2004.07.006</a>.","ama":"Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem. <i>J Algorithms</i>. 2006;61(1):20--44. doi:<a href=\"https://doi.org/10.1016/j.jalgor.2004.07.006\">10.1016/j.jalgor.2004.07.006</a>","apa":"Kolman, P., &#38; Scheideler, C. (2006). Improved bounds for the unsplittable flow problem. <i>J. Algorithms</i>, <i>61</i>(1), 20--44. <a href=\"https://doi.org/10.1016/j.jalgor.2004.07.006\">https://doi.org/10.1016/j.jalgor.2004.07.006</a>"}},{"author":[{"full_name":"Bloh, Bea","first_name":"Bea","last_name":"Bloh"}],"title":"Die Schulformentscheidung aus Elternsicht. Eine Untersuchung der zur Ablehnung der Schulformempfehlung am Ende der Grundschulzeit","department":[{"_id":"36"},{"_id":"456"}],"user_id":"49044","citation":{"mla":"Bloh, Bea. <i>Die Schulformentscheidung Aus Elternsicht. Eine Untersuchung Der Zur Ablehnung Der Schulformempfehlung Am Ende Der Grundschulzeit</i>. 2006.","bibtex":"@article{Bloh_2006, title={Die Schulformentscheidung aus Elternsicht. Eine Untersuchung der zur Ablehnung der Schulformempfehlung am Ende der Grundschulzeit}, author={Bloh, Bea}, year={2006} }","short":"B. Bloh, (2006).","apa":"Bloh, B. (2006). <i>Die Schulformentscheidung aus Elternsicht. Eine Untersuchung der zur Ablehnung der Schulformempfehlung am Ende der Grundschulzeit</i>.","ama":"Bloh B. Die Schulformentscheidung aus Elternsicht. Eine Untersuchung der zur Ablehnung der Schulformempfehlung am Ende der Grundschulzeit. Published online 2006.","chicago":"Bloh, Bea. “Die Schulformentscheidung Aus Elternsicht. Eine Untersuchung Der Zur Ablehnung Der Schulformempfehlung Am Ende Der Grundschulzeit,” 2006.","ieee":"B. Bloh, “Die Schulformentscheidung aus Elternsicht. Eine Untersuchung der zur Ablehnung der Schulformempfehlung am Ende der Grundschulzeit,” 2006."},"status":"public","year":"2006","type":"journal_article","date_created":"2021-11-30T17:08:49Z","date_updated":"2022-01-06T06:57:52Z","_id":"28176"},{"author":[{"first_name":"Karim","full_name":"Djemame, Karim","last_name":"Djemame"},{"first_name":"Iain","full_name":"Gourlay, Iain","last_name":"Gourlay"},{"first_name":"James","full_name":"Padgett, James","last_name":"Padgett"},{"full_name":"Birkenheuer, Georg","first_name":"Georg","last_name":"Birkenheuer"},{"full_name":"Hovestadt, Matthias","first_name":"Matthias","last_name":"Hovestadt"},{"first_name":"Odej","full_name":"Kao, Odej","last_name":"Kao"},{"last_name":"Voss","first_name":"Kerstin","full_name":"Voss, Kerstin"}],"title":"Introducing Risk Management into the Grid","doi":"10.1109/E-SCIENCE.2006.261112","place":"Washington, DC","user_id":"24135","citation":{"chicago":"Djemame, Karim, Iain Gourlay, James Padgett, Georg Birkenheuer, Matthias Hovestadt, Odej Kao, and Kerstin Voss. “Introducing Risk Management into the Grid.” In <i>Proc. Int. Conf. on e-Science and Grid Computing</i>, 28. Washington, DC: IEEE Computer Society, 2006. <a href=\"https://doi.org/10.1109/E-SCIENCE.2006.261112\">https://doi.org/10.1109/E-SCIENCE.2006.261112</a>.","ieee":"K. Djemame <i>et al.</i>, “Introducing Risk Management into the Grid,” in <i>Proc. Int. Conf. on e-Science and Grid Computing</i>, 2006, p. 28.","ama":"Djemame K, Gourlay I, Padgett J, et al. Introducing Risk Management into the Grid. In: <i>Proc. Int. Conf. on e-Science and Grid Computing</i>. Washington, DC: IEEE Computer Society; 2006:28. doi:<a href=\"https://doi.org/10.1109/E-SCIENCE.2006.261112\">10.1109/E-SCIENCE.2006.261112</a>","apa":"Djemame, K., Gourlay, I., Padgett, J., Birkenheuer, G., Hovestadt, M., Kao, O., &#38; Voss, K. (2006). Introducing Risk Management into the Grid. In <i>Proc. Int. Conf. on e-Science and Grid Computing</i> (p. 28). Washington, DC: IEEE Computer Society. <a href=\"https://doi.org/10.1109/E-SCIENCE.2006.261112\">https://doi.org/10.1109/E-SCIENCE.2006.261112</a>","short":"K. Djemame, I. Gourlay, J. Padgett, G. Birkenheuer, M. Hovestadt, O. Kao, K. Voss, in: Proc. Int. Conf. on e-Science and Grid Computing, IEEE Computer Society, Washington, DC, 2006, p. 28.","mla":"Djemame, Karim, et al. “Introducing Risk Management into the Grid.” <i>Proc. Int. Conf. on e-Science and Grid Computing</i>, IEEE Computer Society, 2006, p. 28, doi:<a href=\"https://doi.org/10.1109/E-SCIENCE.2006.261112\">10.1109/E-SCIENCE.2006.261112</a>.","bibtex":"@inproceedings{Djemame_Gourlay_Padgett_Birkenheuer_Hovestadt_Kao_Voss_2006, place={Washington, DC}, title={Introducing Risk Management into the Grid}, DOI={<a href=\"https://doi.org/10.1109/E-SCIENCE.2006.261112\">10.1109/E-SCIENCE.2006.261112</a>}, booktitle={Proc. Int. Conf. on e-Science and Grid Computing}, publisher={IEEE Computer Society}, author={Djemame, Karim and Gourlay, Iain and Padgett, James and Birkenheuer, Georg and Hovestadt, Matthias and Kao, Odej and Voss, Kerstin}, year={2006}, pages={28} }"},"department":[{"_id":"27"}],"publisher":"IEEE Computer Society","publication":"Proc. Int. Conf. on e-Science and Grid Computing","date_created":"2018-04-17T13:44:50Z","status":"public","type":"conference","publication_identifier":{"isbn":["0-7695-2734-5"]},"year":"2006","page":"28","_id":"2402","date_updated":"2022-01-06T06:56:06Z"},{"page":"36-43","_id":"2403","date_updated":"2022-01-06T06:56:06Z","date_created":"2018-04-17T13:45:29Z","publication":"Proc. Int. Conf. on Services Computing (SCC)","publisher":"IEEE Computer Society","type":"conference","publication_identifier":{"isbn":["0-7695-2670-5"]},"year":"2006","status":"public","citation":{"short":"M. Hovestadt, O. Kao, K. Voss, in: Proc. Int. Conf. on Services Computing (SCC), IEEE Computer Society, Washington, DC, 2006, pp. 36–43.","bibtex":"@inproceedings{Hovestadt_Kao_Voss_2006, place={Washington, DC}, title={The First Step of Introducing Risk Management for Prepossessing SLAs}, DOI={<a href=\"https://doi.org/10.1109/SCC.2006.102\">10.1109/SCC.2006.102</a>}, booktitle={Proc. Int. Conf. on Services Computing (SCC)}, publisher={IEEE Computer Society}, author={Hovestadt, Matthias and Kao, Odej and Voss, Kerstin}, year={2006}, pages={36–43} }","mla":"Hovestadt, Matthias, et al. “The First Step of Introducing Risk Management for Prepossessing SLAs.” <i>Proc. Int. Conf. on Services Computing (SCC)</i>, IEEE Computer Society, 2006, pp. 36–43, doi:<a href=\"https://doi.org/10.1109/SCC.2006.102\">10.1109/SCC.2006.102</a>.","ieee":"M. Hovestadt, O. Kao, and K. Voss, “The First Step of Introducing Risk Management for Prepossessing SLAs,” in <i>Proc. Int. Conf. on Services Computing (SCC)</i>, 2006, pp. 36–43.","chicago":"Hovestadt, Matthias, Odej Kao, and Kerstin Voss. “The First Step of Introducing Risk Management for Prepossessing SLAs.” In <i>Proc. Int. Conf. on Services Computing (SCC)</i>, 36–43. Washington, DC: IEEE Computer Society, 2006. <a href=\"https://doi.org/10.1109/SCC.2006.102\">https://doi.org/10.1109/SCC.2006.102</a>.","apa":"Hovestadt, M., Kao, O., &#38; Voss, K. (2006). The First Step of Introducing Risk Management for Prepossessing SLAs. In <i>Proc. Int. Conf. on Services Computing (SCC)</i> (pp. 36–43). Washington, DC: IEEE Computer Society. <a href=\"https://doi.org/10.1109/SCC.2006.102\">https://doi.org/10.1109/SCC.2006.102</a>","ama":"Hovestadt M, Kao O, Voss K. The First Step of Introducing Risk Management for Prepossessing SLAs. In: <i>Proc. Int. Conf. on Services Computing (SCC)</i>. Washington, DC: IEEE Computer Society; 2006:36-43. doi:<a href=\"https://doi.org/10.1109/SCC.2006.102\">10.1109/SCC.2006.102</a>"},"user_id":"24135","department":[{"_id":"27"}],"title":"The First Step of Introducing Risk Management for Prepossessing SLAs","author":[{"first_name":"Matthias","full_name":"Hovestadt, Matthias","last_name":"Hovestadt"},{"last_name":"Kao","full_name":"Kao, Odej","first_name":"Odej"},{"last_name":"Voss","full_name":"Voss, Kerstin","first_name":"Kerstin"}],"place":"Washington, DC","doi":"10.1109/SCC.2006.102"}]