[{"title":"A DoS-resilient information system for dynamic data management","user_id":"15504","publication_identifier":{"isbn":["978-1-60558-606-9"]},"status":"public","date_created":"2018-03-29T09:18:06Z","author":[{"last_name":"Baumgart","full_name":"Baumgart, Matthias","first_name":"Matthias"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"}],"publication":"SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009","department":[{"_id":"79"}],"doi":"10.1145/1583991.1584064","_id":"1933","date_updated":"2022-01-06T06:54:02Z","type":"conference","year":"2009","citation":{"mla":"Baumgart, Matthias, et al. “A DoS-Resilient Information System for Dynamic Data Management.” SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, 2009, pp. 300--309, doi:10.1145/1583991.1584064.","bibtex":"@inproceedings{Baumgart_Scheideler_Schmid_2009, title={A DoS-resilient information system for dynamic data management}, DOI={10.1145/1583991.1584064}, booktitle={SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009}, author={Baumgart, Matthias and Scheideler, Christian and Schmid, Stefan}, year={2009}, pages={300--309} }","apa":"Baumgart, M., Scheideler, C., & Schmid, S. (2009). A DoS-resilient information system for dynamic data management. In SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009 (pp. 300--309). https://doi.org/10.1145/1583991.1584064","ama":"Baumgart M, Scheideler C, Schmid S. A DoS-resilient information system for dynamic data management. In: SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009. ; 2009:300--309. doi:10.1145/1583991.1584064","chicago":"Baumgart, Matthias, Christian Scheideler, and Stefan Schmid. “A DoS-Resilient Information System for Dynamic Data Management.” In SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, 300--309, 2009. https://doi.org/10.1145/1583991.1584064.","ieee":"M. Baumgart, C. Scheideler, and S. Schmid, “A DoS-resilient information system for dynamic data management,” in SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, 2009, pp. 300--309.","short":"M. Baumgart, C. Scheideler, S. Schmid, in: SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, 2009, pp. 300--309."},"page":"300--309"},{"publication_identifier":{"isbn":["978-3-642-05117-3"]},"volume":5873,"status":"public","date_created":"2018-03-29T09:19:17Z","author":[{"first_name":"Dominik","full_name":"Gall, Dominik","last_name":"Gall"},{"full_name":"Jacob, Riko","first_name":"Riko","last_name":"Jacob"},{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"},{"last_name":"Täubig","full_name":"Täubig, Hanjo","first_name":"Hanjo"}],"publisher":"Springer","publication":"Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings","department":[{"_id":"79"}],"title":"Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization","user_id":"15504","type":"conference","year":"2009","citation":{"short":"D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, Springer, 2009, pp. 781--782.","ieee":"D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization,” in Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, 2009, vol. 5873, pp. 781--782.","chicago":"Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo Täubig. “Brief Announcement: On the Time Complexity of Distributed Topological Self-Stabilization.” In Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, 5873:781--782. Lecture Notes in Computer Science. Springer, 2009. https://doi.org/10.1007/978-3-642-05118-0_58.","ama":"Gall D, Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization. In: Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings. Vol 5873. Lecture Notes in Computer Science. Springer; 2009:781--782. doi:10.1007/978-3-642-05118-0_58","apa":"Gall, D., Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., & Täubig, H. (2009). Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization. In Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings (Vol. 5873, pp. 781--782). Springer. https://doi.org/10.1007/978-3-642-05118-0_58","bibtex":"@inproceedings{Gall_Jacob_W. Richa_Scheideler_Schmid_Täubig_2009, series={Lecture Notes in Computer Science}, title={Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization}, volume={5873}, DOI={10.1007/978-3-642-05118-0_58}, booktitle={Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings}, publisher={Springer}, author={Gall, Dominik and Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo}, year={2009}, pages={781--782}, collection={Lecture Notes in Computer Science} }","mla":"Gall, Dominik, et al. “Brief Announcement: On the Time Complexity of Distributed Topological Self-Stabilization.” Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, vol. 5873, Springer, 2009, pp. 781--782, doi:10.1007/978-3-642-05118-0_58."},"page":"781--782","series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-642-05118-0_58","_id":"1934","intvolume":" 5873","date_updated":"2022-01-06T06:54:02Z"},{"user_id":"15504","title":"Stabilizing Consensus with the Power of Two Choices","department":[{"_id":"79"}],"publication":"Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009","author":[{"full_name":"Doerr, Benjamin","first_name":"Benjamin","last_name":"Doerr"},{"last_name":"Ann Goldberg","first_name":"Leslie","full_name":"Ann Goldberg, Leslie"},{"first_name":"Lorenz","full_name":"Minder, Lorenz","last_name":"Minder"},{"last_name":"Sauerwald","first_name":"Thomas","full_name":"Sauerwald, Thomas"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany","date_created":"2018-03-29T09:20:44Z","status":"public","volume":"09371","intvolume":" 9371","_id":"1935","date_updated":"2022-01-06T06:54:02Z","doi":"10.1145/1989493.1989516","series_title":"Dagstuhl Seminar Proceedings","type":"conference","year":"2009","citation":{"bibtex":"@inproceedings{Doerr_Ann Goldberg_Minder_Sauerwald_Scheideler_2009, series={Dagstuhl Seminar Proceedings}, title={Stabilizing Consensus with the Power of Two Choices}, volume={09371}, DOI={10.1145/1989493.1989516}, booktitle={Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany}, author={Doerr, Benjamin and Ann Goldberg, Leslie and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian}, year={2009}, collection={Dagstuhl Seminar Proceedings} }","mla":"Doerr, Benjamin, et al. “Stabilizing Consensus with the Power of Two Choices.” Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, vol. 09371, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009, doi:10.1145/1989493.1989516.","chicago":"Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler. “Stabilizing Consensus with the Power of Two Choices.” In Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, Vol. 09371. Dagstuhl Seminar Proceedings. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009. https://doi.org/10.1145/1989493.1989516.","apa":"Doerr, B., Ann Goldberg, L., Minder, L., Sauerwald, T., & Scheideler, C. (2009). Stabilizing Consensus with the Power of Two Choices. In Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009 (Vol. 09371). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. https://doi.org/10.1145/1989493.1989516","ama":"Doerr B, Ann Goldberg L, Minder L, Sauerwald T, Scheideler C. Stabilizing Consensus with the Power of Two Choices. In: Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009. Vol 09371. Dagstuhl Seminar Proceedings. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany; 2009. doi:10.1145/1989493.1989516","ieee":"B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Stabilizing Consensus with the Power of Two Choices,” in Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, 2009, vol. 09371.","short":"B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009."}},{"_id":"1937","date_updated":"2022-01-06T06:54:03Z","citation":{"mla":"Scheideler, Christian. “Algorithms for Overlay Networks.” Bulletin of the EATCS, 2008, pp. 130--152.","bibtex":"@article{Scheideler_2008, title={Algorithms for Overlay Networks}, journal={Bulletin of the EATCS}, author={Scheideler, Christian}, year={2008}, pages={130--152} }","chicago":"Scheideler, Christian. “Algorithms for Overlay Networks.” Bulletin of the EATCS, 2008, 130--152.","ama":"Scheideler C. Algorithms for Overlay Networks. Bulletin of the EATCS. 2008:130--152.","apa":"Scheideler, C. (2008). Algorithms for Overlay Networks. Bulletin of the EATCS, 130--152.","ieee":"C. Scheideler, “Algorithms for Overlay Networks,” Bulletin of the EATCS, pp. 130--152, 2008.","short":"C. Scheideler, Bulletin of the EATCS (2008) 130--152."},"type":"journal_article","year":"2008","page":"130--152","title":"Algorithms for Overlay Networks","user_id":"15504","author":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"department":[{"_id":"79"}],"publication":"Bulletin of the EATCS","status":"public","date_created":"2018-03-29T09:28:22Z"},{"title":"A jamming-resistant MAC protocol for single-hop wireless networks","user_id":"15504","publication_identifier":{"isbn":["978-1-59593-989-0"]},"date_created":"2018-03-29T09:29:06Z","status":"public","department":[{"_id":"79"}],"publication":"Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008","publisher":"ACM","author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"full_name":"W. Richa, Andr{\\'{e}}a","first_name":"Andr{\\'{e}}a","last_name":"W. Richa"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"doi":"10.1145/1400751.1400759","_id":"1938","date_updated":"2022-01-06T06:54:03Z","page":"45--54","year":"2008","citation":{"ieee":"B. Awerbuch, A. W. Richa, and C. Scheideler, “A jamming-resistant MAC protocol for single-hop wireless networks,” in Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008, 2008, pp. 45--54.","short":"B. Awerbuch, A. W. Richa, C. Scheideler, in: Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008, ACM, 2008, pp. 45--54.","mla":"Awerbuch, Baruch, et al. “A Jamming-Resistant MAC Protocol for Single-Hop Wireless Networks.” Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008, ACM, 2008, pp. 45--54, doi:10.1145/1400751.1400759.","bibtex":"@inproceedings{Awerbuch_W. Richa_Scheideler_2008, title={A jamming-resistant MAC protocol for single-hop wireless networks}, DOI={10.1145/1400751.1400759}, booktitle={Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008}, publisher={ACM}, author={Awerbuch, Baruch and W. Richa, Andr{\\’{e}}a and Scheideler, Christian}, year={2008}, pages={45--54} }","ama":"Awerbuch B, W. Richa A, Scheideler C. A jamming-resistant MAC protocol for single-hop wireless networks. In: Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008. ACM; 2008:45--54. doi:10.1145/1400751.1400759","apa":"Awerbuch, B., W. Richa, A., & Scheideler, C. (2008). A jamming-resistant MAC protocol for single-hop wireless networks. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008 (pp. 45--54). ACM. https://doi.org/10.1145/1400751.1400759","chicago":"Awerbuch, Baruch, Andr{\\’{e}}a W. Richa, and Christian Scheideler. “A Jamming-Resistant MAC Protocol for Single-Hop Wireless Networks.” In Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008, 45--54. ACM, 2008. https://doi.org/10.1145/1400751.1400759."},"type":"conference"},{"title":"SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems","department":[{"_id":"79"},{"_id":"63"}],"date_updated":"2022-01-06T06:54:03Z","oa":"1","language":[{"iso":"eng"}],"ddc":["040"],"user_id":"14955","file_date_updated":"2018-04-13T10:03:13Z","publication":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008","publisher":"SIAM","author":[{"last_name":"Mense","first_name":"Mario","full_name":"Mense, Mario"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file":[{"date_created":"2018-04-13T10:03:13Z","file_name":"SODA08.pdf","access_level":"open_access","file_id":"2341","creator":"florida","file_size":211264,"relation":"main_file","date_updated":"2018-04-13T10:03:13Z","content_type":"application/pdf"}],"date_created":"2018-03-29T09:30:18Z","has_accepted_license":"1","status":"public","urn":"19408","_id":"1940","page":"1135--1144","type":"conference","year":"2008","citation":{"bibtex":"@inproceedings{Mense_Scheideler_2008, title={SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems}, booktitle={Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008}, publisher={SIAM}, author={Mense, Mario and Scheideler, Christian}, year={2008}, pages={1135--1144} }","mla":"Mense, Mario, and Christian Scheideler. “SPREAD: An Adaptive Scheme for Redundant and Fair Storage in Dynamic Heterogeneous Storage Systems.” Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, SIAM, 2008, pp. 1135--1144.","ama":"Mense M, Scheideler C. SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008. SIAM; 2008:1135--1144.","apa":"Mense, M., & Scheideler, C. (2008). SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008 (pp. 1135--1144). SIAM.","chicago":"Mense, Mario, and Christian Scheideler. “SPREAD: An Adaptive Scheme for Redundant and Fair Storage in Dynamic Heterogeneous Storage Systems.” In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, 1135--1144. SIAM, 2008.","ieee":"M. Mense and C. Scheideler, “SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems,” in Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, 2008, pp. 1135--1144.","short":"M. Mense, C. Scheideler, in: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, SIAM, 2008, pp. 1135--1144."}},{"title":"Tiara: A Self-stabilizing Deterministic Skip List","user_id":"15504","department":[{"_id":"79"}],"publication":"Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings","author":[{"last_name":"Clouser","full_name":"Clouser, Thomas","first_name":"Thomas"},{"last_name":"Nesterenko","first_name":"Mikhail","full_name":"Nesterenko, Mikhail"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publisher":"Springer","volume":5340,"publication_identifier":{"isbn":["978-3-540-89334-9"]},"date_created":"2018-03-29T09:31:18Z","status":"public","intvolume":" 5340","_id":"1941","date_updated":"2022-01-06T06:54:03Z","doi":"10.1007/978-3-540-89335-6_12","series_title":"Lecture Notes in Computer Science","page":"124--140","citation":{"chicago":"Clouser, Thomas, Mikhail Nesterenko, and Christian Scheideler. “Tiara: A Self-Stabilizing Deterministic Skip List.” In Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings, 5340:124--140. Lecture Notes in Computer Science. Springer, 2008. https://doi.org/10.1007/978-3-540-89335-6_12.","ama":"Clouser T, Nesterenko M, Scheideler C. Tiara: A Self-stabilizing Deterministic Skip List. In: Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings. Vol 5340. Lecture Notes in Computer Science. Springer; 2008:124--140. doi:10.1007/978-3-540-89335-6_12","apa":"Clouser, T., Nesterenko, M., & Scheideler, C. (2008). Tiara: A Self-stabilizing Deterministic Skip List. In Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings (Vol. 5340, pp. 124--140). Springer. https://doi.org/10.1007/978-3-540-89335-6_12","mla":"Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List.” Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings, vol. 5340, Springer, 2008, pp. 124--140, doi:10.1007/978-3-540-89335-6_12.","bibtex":"@inproceedings{Clouser_Nesterenko_Scheideler_2008, series={Lecture Notes in Computer Science}, title={Tiara: A Self-stabilizing Deterministic Skip List}, volume={5340}, DOI={10.1007/978-3-540-89335-6_12}, booktitle={Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings}, publisher={Springer}, author={Clouser, Thomas and Nesterenko, Mikhail and Scheideler, Christian}, year={2008}, pages={124--140}, collection={Lecture Notes in Computer Science} }","short":"T. Clouser, M. Nesterenko, C. Scheideler, in: Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings, Springer, 2008, pp. 124--140.","ieee":"T. Clouser, M. Nesterenko, and C. Scheideler, “Tiara: A Self-stabilizing Deterministic Skip List,” in Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings, 2008, vol. 5340, pp. 124--140."},"type":"conference","year":"2008"},{"series_title":"eXamen.press","citation":{"bibtex":"@inbook{Scheideler_2008, series={eXamen.press}, title={Broadcasting: Wie verbreite ich schnell Informationen?}, DOI={10.1007/978-3-540-76394-9_22}, booktitle={Taschenbuch der Algorithmen}, publisher={Springer}, author={Scheideler, Christian}, year={2008}, pages={229--236}, collection={eXamen.press} }","mla":"Scheideler, Christian. “Broadcasting: Wie Verbreite Ich Schnell Informationen?” Taschenbuch Der Algorithmen, Springer, 2008, pp. 229--236, doi:10.1007/978-3-540-76394-9_22.","apa":"Scheideler, C. (2008). Broadcasting: Wie verbreite ich schnell Informationen? In Taschenbuch der Algorithmen (pp. 229--236). Springer. https://doi.org/10.1007/978-3-540-76394-9_22","ama":"Scheideler C. Broadcasting: Wie verbreite ich schnell Informationen? In: Taschenbuch Der Algorithmen. eXamen.press. Springer; 2008:229--236. doi:10.1007/978-3-540-76394-9_22","chicago":"Scheideler, Christian. “Broadcasting: Wie Verbreite Ich Schnell Informationen?” In Taschenbuch Der Algorithmen, 229--236. EXamen.Press. Springer, 2008. https://doi.org/10.1007/978-3-540-76394-9_22.","ieee":"C. Scheideler, “Broadcasting: Wie verbreite ich schnell Informationen?,” in Taschenbuch der Algorithmen, Springer, 2008, pp. 229--236.","short":"C. Scheideler, in: Taschenbuch Der Algorithmen, Springer, 2008, pp. 229--236."},"type":"book_chapter","year":"2008","page":"229--236","_id":"1942","date_updated":"2022-01-06T06:54:03Z","doi":"10.1007/978-3-540-76394-9_22","author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publisher":"Springer","department":[{"_id":"79"}],"publication":"Taschenbuch der Algorithmen","status":"public","date_created":"2018-03-29T09:32:34Z","publication_identifier":{"isbn":["978-3-540-76393-2"]},"user_id":"15504","title":"Broadcasting: Wie verbreite ich schnell Informationen?"},{"page":"141--157","year":"2007","type":"journal_article","citation":{"short":"A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, SIAM J. Discrete Math. (2007) 141--157.","ieee":"A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, “Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks,” SIAM J. Discrete Math., no. 1, pp. 141--157, 2007.","ama":"Bagchi A, Chaudhary A, Scheideler C, Kolman P. Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks. SIAM J Discrete Math. 2007;(1):141--157. doi:10.1137/S0895480102419743","apa":"Bagchi, A., Chaudhary, A., Scheideler, C., & Kolman, P. (2007). Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks. SIAM J. Discrete Math., (1), 141--157. https://doi.org/10.1137/S0895480102419743","chicago":"Bagchi, Amitabha, Amitabh Chaudhary, Christian Scheideler, and Petr Kolman. “Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks.” SIAM J. Discrete Math., no. 1 (2007): 141--157. https://doi.org/10.1137/S0895480102419743.","mla":"Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks.” SIAM J. Discrete Math., no. 1, 2007, pp. 141--157, doi:10.1137/S0895480102419743.","bibtex":"@article{Bagchi_Chaudhary_Scheideler_Kolman_2007, title={Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks}, DOI={10.1137/S0895480102419743}, number={1}, journal={SIAM J. Discrete Math.}, author={Bagchi, Amitabha and Chaudhary, Amitabh and Scheideler, Christian and Kolman, Petr}, year={2007}, pages={141--157} }"},"date_updated":"2022-01-06T06:54:20Z","_id":"2017","doi":"10.1137/S0895480102419743","issue":"1","publication":"SIAM J. Discrete Math.","department":[{"_id":"79"}],"author":[{"first_name":"Amitabha","full_name":"Bagchi, Amitabha","last_name":"Bagchi"},{"first_name":"Amitabh","full_name":"Chaudhary, Amitabh","last_name":"Chaudhary"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"first_name":"Petr","full_name":"Kolman, Petr","last_name":"Kolman"}],"date_created":"2018-03-29T11:50:23Z","status":"public","title":"Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks","user_id":"15504"},{"year":"2007","type":"conference","citation":{"short":"M. Onus, A. W. Richa, C. Scheideler, in: Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007, 2007.","ieee":"M. Onus, A. W. Richa, and C. Scheideler, “Linearization: Locally Self-Stabilizing Sorting in Graphs,” in Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007, 2007.","apa":"Onus, M., W. Richa, A., & Scheideler, C. (2007). Linearization: Locally Self-Stabilizing Sorting in Graphs. In Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007. https://doi.org/10.1137/1.9781611972870.10","ama":"Onus M, W. Richa A, Scheideler C. Linearization: Locally Self-Stabilizing Sorting in Graphs. In: Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007. ; 2007. doi:10.1137/1.9781611972870.10","chicago":"Onus, Melih, Andrea W. Richa, and Christian Scheideler. “Linearization: Locally Self-Stabilizing Sorting in Graphs.” In Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007, 2007. https://doi.org/10.1137/1.9781611972870.10.","mla":"Onus, Melih, et al. “Linearization: Locally Self-Stabilizing Sorting in Graphs.” Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007, 2007, doi:10.1137/1.9781611972870.10.","bibtex":"@inproceedings{Onus_W. Richa_Scheideler_2007, title={Linearization: Locally Self-Stabilizing Sorting in Graphs}, DOI={10.1137/1.9781611972870.10}, booktitle={Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007}, author={Onus, Melih and W. Richa, Andrea and Scheideler, Christian}, year={2007} }"},"doi":"10.1137/1.9781611972870.10","date_updated":"2022-01-06T06:54:23Z","_id":"2020","date_created":"2018-03-29T11:54:37Z","status":"public","publication_identifier":{"isbn":["978-1-61197-287-0"]},"publication":"Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007","department":[{"_id":"79"}],"author":[{"last_name":"Onus","full_name":"Onus, Melih","first_name":"Melih"},{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"user_id":"15504","title":"Linearization: Locally Self-Stabilizing Sorting in Graphs"},{"citation":{"short":"B. Awerbuch, C. Scheideler, in: 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.","ieee":"B. Awerbuch and C. Scheideler, “Towards Scalable and Robust Overlay Networks,” in 6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Towards Scalable and Robust Overlay Networks.” In 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.","ama":"Awerbuch B, Scheideler C. Towards Scalable and Robust Overlay Networks. In: 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007. ; 2007.","apa":"Awerbuch, B., & Scheideler, C. (2007). Towards Scalable and Robust Overlay Networks. In 6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007.","bibtex":"@inproceedings{Awerbuch_Scheideler_2007, title={Towards Scalable and Robust Overlay Networks}, booktitle={6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2007} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “Towards Scalable and Robust Overlay Networks.” 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007."},"type":"conference","year":"2007","urn":"20228","_id":"2022","date_updated":"2022-01-06T06:54:23Z","oa":"1","publication":"6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007","department":[{"_id":"79"}],"file_date_updated":"2018-04-13T10:00:55Z","author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"content_type":"application/pdf","date_updated":"2018-04-13T10:00:55Z","relation":"main_file","file_size":191943,"creator":"florida","file_id":"2338","access_level":"open_access","file_name":"IPTPS07.pdf","date_created":"2018-04-13T10:00:55Z"}],"date_created":"2018-03-29T11:55:52Z","status":"public","has_accepted_license":"1","title":"Towards Scalable and Robust Overlay Networks","ddc":["040"],"user_id":"15504"},{"title":"A denial-of-service resistant DHT","department":[{"_id":"79"}],"publication_identifier":{"isbn":["978-1-59593-616-5"]},"date_updated":"2022-01-06T06:54:24Z","oa":"1","doi":"10.1145/1281100.1281178","user_id":"15504","ddc":["040"],"file":[{"file_name":"DISC-07.pdf","date_created":"2018-04-13T10:02:18Z","access_level":"open_access","file_id":"2340","creator":"florida","file_size":193097,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-13T10:02:18Z"}],"file_date_updated":"2018-04-13T10:02:18Z","publication":"Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007","author":[{"first_name":"Baruch","full_name":"Awerbuch, Baruch","last_name":"Awerbuch"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publisher":"ACM","date_created":"2018-03-29T11:56:35Z","has_accepted_license":"1","status":"public","urn":"20237","_id":"2023","page":"370--371","type":"conference","citation":{"short":"B. Awerbuch, C. Scheideler, in: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, ACM, 2007, pp. 370--371.","ieee":"B. Awerbuch and C. Scheideler, “A denial-of-service resistant DHT,” in Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, 2007, pp. 370--371.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.” In Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, 370--371. ACM, 2007. https://doi.org/10.1145/1281100.1281178.","ama":"Awerbuch B, Scheideler C. A denial-of-service resistant DHT. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007. ACM; 2007:370--371. doi:10.1145/1281100.1281178","apa":"Awerbuch, B., & Scheideler, C. (2007). A denial-of-service resistant DHT. In Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007 (pp. 370--371). ACM. https://doi.org/10.1145/1281100.1281178","bibtex":"@inproceedings{Awerbuch_Scheideler_2007, title={A denial-of-service resistant DHT}, DOI={10.1145/1281100.1281178}, booktitle={Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007}, publisher={ACM}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2007}, pages={370--371} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.” Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, ACM, 2007, pp. 370--371, doi:10.1145/1281100.1281178."},"year":"2007"},{"publication_identifier":{"isbn":["978-3-540-75141-0"]},"volume":4731,"status":"public","date_created":"2018-03-29T11:57:42Z","author":[{"last_name":"Awerbuch","full_name":"Awerbuch, Baruch","first_name":"Baruch"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"Springer","department":[{"_id":"79"}],"publication":"Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings","title":"A Denial-of-Service Resistant DHT","user_id":"15504","year":"2007","citation":{"mla":"Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.” Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, vol. 4731, Springer, 2007, pp. 33--47, doi:10.1007/978-3-540-75142-7_6.","bibtex":"@inproceedings{Awerbuch_Scheideler_2007, series={Lecture Notes in Computer Science}, title={A Denial-of-Service Resistant DHT}, volume={4731}, DOI={10.1007/978-3-540-75142-7_6}, booktitle={Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings}, publisher={Springer}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2007}, pages={33--47}, collection={Lecture Notes in Computer Science} }","apa":"Awerbuch, B., & Scheideler, C. (2007). A Denial-of-Service Resistant DHT. In Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings (Vol. 4731, pp. 33--47). Springer. https://doi.org/10.1007/978-3-540-75142-7_6","ama":"Awerbuch B, Scheideler C. A Denial-of-Service Resistant DHT. In: Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings. Vol 4731. Lecture Notes in Computer Science. Springer; 2007:33--47. doi:10.1007/978-3-540-75142-7_6","chicago":"Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.” In Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, 4731:33--47. Lecture Notes in Computer Science. Springer, 2007. https://doi.org/10.1007/978-3-540-75142-7_6.","ieee":"B. Awerbuch and C. Scheideler, “A Denial-of-Service Resistant DHT,” in Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, 2007, vol. 4731, pp. 33--47.","short":"B. Awerbuch, C. Scheideler, in: Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, Springer, 2007, pp. 33--47."},"type":"conference","page":"33--47","series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-540-75142-7_6","intvolume":" 4731","_id":"2024","date_updated":"2022-01-06T06:54:24Z"},{"year":"2007","type":"book_chapter","citation":{"short":"A. W. Richa, C. Scheideler, in: Handbook of Approximation Algorithms and Metaheuristics., 2007.","ieee":"A. W. Richa and C. Scheideler, “Overlay Networks for Peer-to-Peer Networks,” in Handbook of Approximation Algorithms and Metaheuristics., 2007.","ama":"W. Richa A, Scheideler C. Overlay Networks for Peer-to-Peer Networks. In: Handbook of Approximation Algorithms and Metaheuristics. ; 2007. doi:10.1201/9781420010749.ch72","apa":"W. Richa, A., & Scheideler, C. (2007). Overlay Networks for Peer-to-Peer Networks. In Handbook of Approximation Algorithms and Metaheuristics. https://doi.org/10.1201/9781420010749.ch72","chicago":"W. Richa, Andrea, and Christian Scheideler. “Overlay Networks for Peer-to-Peer Networks.” In Handbook of Approximation Algorithms and Metaheuristics., 2007. https://doi.org/10.1201/9781420010749.ch72.","mla":"W. Richa, Andrea, and Christian Scheideler. “Overlay Networks for Peer-to-Peer Networks.” Handbook of Approximation Algorithms and Metaheuristics., 2007, doi:10.1201/9781420010749.ch72.","bibtex":"@inbook{W. Richa_Scheideler_2007, title={Overlay Networks for Peer-to-Peer Networks}, DOI={10.1201/9781420010749.ch72}, booktitle={Handbook of Approximation Algorithms and Metaheuristics.}, author={W. Richa, Andrea and Scheideler, Christian}, year={2007} }"},"doi":"10.1201/9781420010749.ch72","_id":"2028","date_updated":"2022-01-06T06:54:25Z","date_created":"2018-03-29T12:00:39Z","status":"public","publication_identifier":{"isbn":["978-1-58488-550-4"]},"publication":"Handbook of Approximation Algorithms and Metaheuristics.","department":[{"_id":"79"}],"author":[{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"user_id":"15504","title":"Overlay Networks for Peer-to-Peer Networks"},{"abstract":[{"lang":"eng","text":"We present a randomized block-level storage virtualization for arbitrary heterogeneous storage systems that can distribute data in a fair and redundant way and can adapt this distribution in an efficient way as storage devices enter or leave the system. More precisely, our virtualization strategies can distribute a set of data blocks among a set of storage devices of arbitrary non-uniform capacities so that a storage device representing x% of the capacity in the system will get x% of the data (as long as this is in principle possible) and the different copies of each data block are stored so that no two copies of a data block are located in the same device. Achieving these two properties is not easy, and no virtualization strategy has been presented so far that has been formally shown to satisfy fairness and redundancy while being time- and space-eflcient and allowing an efficient adaptation to a changing set of devices."}],"user_id":"15415","ddc":["040"],"title":"Dynamic and redundant data placement","file":[{"file_name":"ICDCS07.pdf","date_created":"2018-04-13T10:01:42Z","access_level":"open_access","file_size":164121,"file_id":"2339","creator":"florida","date_updated":"2018-04-13T10:01:42Z","content_type":"application/pdf","relation":"main_file"}],"author":[{"last_name":"Brinkmann","full_name":"Brinkmann, André","first_name":"André"},{"full_name":"Effert, Sascha","first_name":"Sascha","last_name":"Effert"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"IEEE International Conference on Distributed Computing Systems (ICDCS)","file_date_updated":"2018-04-13T10:01:42Z","department":[{"_id":"79"},{"_id":"63"}],"has_accepted_license":"1","status":"public","date_created":"2018-04-05T07:08:35Z","_id":"2214","date_updated":"2022-01-06T06:55:27Z","urn":"22147","oa":"1","language":[{"iso":"eng"}],"year":"2007","citation":{"ama":"Brinkmann A, Effert S, Meyer auf der Heide F, Scheideler C. Dynamic and redundant data placement. In: IEEE International Conference on Distributed Computing Systems (ICDCS). ; 2007.","apa":"Brinkmann, A., Effert, S., Meyer auf der Heide, F., & Scheideler, C. (2007). Dynamic and redundant data placement. IEEE International Conference on Distributed Computing Systems (ICDCS).","chicago":"Brinkmann, André, Sascha Effert, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Dynamic and Redundant Data Placement.” In IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.","bibtex":"@inproceedings{Brinkmann_Effert_Meyer auf der Heide_Scheideler_2007, title={Dynamic and redundant data placement}, booktitle={IEEE International Conference on Distributed Computing Systems (ICDCS)}, author={Brinkmann, André and Effert, Sascha and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2007} }","mla":"Brinkmann, André, et al. “Dynamic and Redundant Data Placement.” IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.","short":"A. Brinkmann, S. Effert, F. Meyer auf der Heide, C. Scheideler, in: IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.","ieee":"A. Brinkmann, S. Effert, F. Meyer auf der Heide, and C. Scheideler, “Dynamic and redundant data placement,” 2007."},"type":"conference"},{"user_id":"15504","title":"Can ISPs and P2P users cooperate for improved performance?","status":"public","date_created":"2018-04-05T06:08:43Z","author":[{"last_name":"Aggarwal","full_name":"Aggarwal, Vinay","first_name":"Vinay"},{"full_name":"Feldmann, Anja","first_name":"Anja","last_name":"Feldmann"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publication":"ACM Computer Commucation Review","department":[{"_id":"79"}],"doi":"10.1145/1273445.1273449","_id":"2209","date_updated":"2022-01-06T06:55:25Z","citation":{"bibtex":"@article{Aggarwal_Feldmann_Scheideler_2007, title={Can ISPs and P2P users cooperate for improved performance?}, DOI={10.1145/1273445.1273449}, journal={ACM Computer Commucation Review}, author={Aggarwal, Vinay and Feldmann, Anja and Scheideler, Christian}, year={2007} }","mla":"Aggarwal, Vinay, et al. “Can ISPs and P2P Users Cooperate for Improved Performance?” ACM Computer Commucation Review, 2007, doi:10.1145/1273445.1273449.","apa":"Aggarwal, V., Feldmann, A., & Scheideler, C. (2007). Can ISPs and P2P users cooperate for improved performance? ACM Computer Commucation Review. https://doi.org/10.1145/1273445.1273449","ama":"Aggarwal V, Feldmann A, Scheideler C. Can ISPs and P2P users cooperate for improved performance? ACM Computer Commucation Review. 2007. doi:10.1145/1273445.1273449","chicago":"Aggarwal, Vinay, Anja Feldmann, and Christian Scheideler. “Can ISPs and P2P Users Cooperate for Improved Performance?” ACM Computer Commucation Review, 2007. https://doi.org/10.1145/1273445.1273449.","ieee":"V. Aggarwal, A. Feldmann, and C. Scheideler, “Can ISPs and P2P users cooperate for improved performance?,” ACM Computer Commucation Review, 2007.","short":"V. Aggarwal, A. Feldmann, C. Scheideler, ACM Computer Commucation Review (2007)."},"year":"2007","type":"journal_article"},{"page":"20--44","type":"journal_article","year":"2006","citation":{"mla":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” J. Algorithms, vol. 61, no. 1, 2006, pp. 20--44, doi:10.1016/j.jalgor.2004.07.006.","bibtex":"@article{Kolman_Scheideler_2006, title={Improved bounds for the unsplittable flow problem}, volume={61}, DOI={10.1016/j.jalgor.2004.07.006}, number={1}, journal={J. Algorithms}, author={Kolman, Petr and Scheideler, Christian}, year={2006}, pages={20--44} }","chicago":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” J. Algorithms 61, no. 1 (2006): 20--44. https://doi.org/10.1016/j.jalgor.2004.07.006.","apa":"Kolman, P., & Scheideler, C. (2006). Improved bounds for the unsplittable flow problem. J. Algorithms, 61(1), 20--44. https://doi.org/10.1016/j.jalgor.2004.07.006","ama":"Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem. J Algorithms. 2006;61(1):20--44. doi:10.1016/j.jalgor.2004.07.006","ieee":"P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,” J. Algorithms, vol. 61, no. 1, pp. 20--44, 2006.","short":"P. Kolman, C. Scheideler, J. Algorithms 61 (2006) 20--44."},"date_updated":"2022-01-06T06:54:25Z","_id":"2029","intvolume":" 61","issue":"1","doi":"10.1016/j.jalgor.2004.07.006","publication":"J. Algorithms","department":[{"_id":"79"}],"author":[{"last_name":"Kolman","first_name":"Petr","full_name":"Kolman, Petr"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"date_created":"2018-03-29T12:01:37Z","status":"public","volume":61,"user_id":"15504","title":"Improved bounds for the unsplittable flow problem"},{"status":"public","date_created":"2018-04-03T05:21:30Z","author":[{"first_name":"Giuseppe","full_name":"Ateniese, Giuseppe","last_name":"Ateniese"},{"full_name":"Riley, Chris","first_name":"Chris","last_name":"Riley"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"department":[{"_id":"79"}],"publication":"IEEE Trans. Mob. Comput.","title":"Survivable Monitoring in Dynamic Networks","user_id":"15504","year":"2006","type":"journal_article","citation":{"mla":"Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.” IEEE Trans. Mob. Comput., no. 9, 2006, pp. 1242--1254, doi:10.1109/TMC.2006.138.","bibtex":"@article{Ateniese_Riley_Scheideler_2006, title={Survivable Monitoring in Dynamic Networks}, DOI={10.1109/TMC.2006.138}, number={9}, journal={IEEE Trans. Mob. Comput.}, author={Ateniese, Giuseppe and Riley, Chris and Scheideler, Christian}, year={2006}, pages={1242--1254} }","chicago":"Ateniese, Giuseppe, Chris Riley, and Christian Scheideler. “Survivable Monitoring in Dynamic Networks.” IEEE Trans. Mob. Comput., no. 9 (2006): 1242--1254. https://doi.org/10.1109/TMC.2006.138.","apa":"Ateniese, G., Riley, C., & Scheideler, C. (2006). Survivable Monitoring in Dynamic Networks. IEEE Trans. Mob. Comput., (9), 1242--1254. https://doi.org/10.1109/TMC.2006.138","ama":"Ateniese G, Riley C, Scheideler C. Survivable Monitoring in Dynamic Networks. IEEE Trans Mob Comput. 2006;(9):1242--1254. doi:10.1109/TMC.2006.138","ieee":"G. Ateniese, C. Riley, and C. Scheideler, “Survivable Monitoring in Dynamic Networks,” IEEE Trans. Mob. Comput., no. 9, pp. 1242--1254, 2006.","short":"G. Ateniese, C. Riley, C. Scheideler, IEEE Trans. Mob. Comput. (2006) 1242--1254."},"page":"1242--1254","doi":"10.1109/TMC.2006.138","issue":"9","_id":"2110","date_updated":"2022-01-06T06:54:45Z"},{"oa":"1","date_updated":"2022-01-06T06:54:46Z","_id":"2111","urn":"21110","year":"2006","citation":{"ieee":"K. Kothapalli, C. Scheideler, M. Onus, and C. Schindelhauer, “Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds,” in IPDPS, 2006.","short":"K. Kothapalli, C. Scheideler, M. Onus, C. Schindelhauer, in: IPDPS, 2006.","mla":"Kothapalli, Kishore, et al. “Distributed Coloring in O/Spl Tilde/(/Spl Radic/(Log n)) Bit Rounds.” IPDPS, 2006.","bibtex":"@inproceedings{Kothapalli_Scheideler_Onus_Schindelhauer_2006, title={Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds}, booktitle={IPDPS}, author={Kothapalli, Kishore and Scheideler, Christian and Onus, Melih and Schindelhauer, Christian}, year={2006} }","ama":"Kothapalli K, Scheideler C, Onus M, Schindelhauer C. Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds. In: IPDPS. ; 2006.","apa":"Kothapalli, K., Scheideler, C., Onus, M., & Schindelhauer, C. (2006). Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds. In IPDPS.","chicago":"Kothapalli, Kishore, Christian Scheideler, Melih Onus, and Christian Schindelhauer. “Distributed Coloring in O/Spl Tilde/(/Spl Radic/(Log n)) Bit Rounds.” In IPDPS, 2006."},"type":"conference","user_id":"15504","title":"Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds","ddc":["040"],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:22:43Z","file":[{"file_size":192708,"file_id":"2334","creator":"florida","date_updated":"2018-04-13T09:57:03Z","content_type":"application/pdf","relation":"main_file","date_created":"2018-04-13T09:57:03Z","file_name":"IPDPS06.pdf","access_level":"open_access"}],"author":[{"full_name":"Kothapalli, Kishore","first_name":"Kishore","last_name":"Kothapalli"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Onus, Melih","first_name":"Melih","last_name":"Onus"},{"last_name":"Schindelhauer","first_name":"Christian","full_name":"Schindelhauer, Christian"}],"department":[{"_id":"79"}],"publication":"IPDPS","file_date_updated":"2018-04-13T09:57:03Z"},{"oa":"1","urn":"21128","_id":"2112","date_updated":"2022-01-06T06:54:46Z","page":"275--289","year":"2006","type":"conference","citation":{"short":"B. Awerbuch, C. Scheideler, in: OPODIS, 2006, pp. 275--289.","ieee":"B. Awerbuch and C. Scheideler, “Robust Random Number Generation for Peer-to-Peer Systems,” in OPODIS, 2006, pp. 275--289.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.” In OPODIS, 275--289. Lecture Notes in Computer Science, 2006.","apa":"Awerbuch, B., & Scheideler, C. (2006). Robust Random Number Generation for Peer-to-Peer Systems. In OPODIS (pp. 275--289).","ama":"Awerbuch B, Scheideler C. Robust Random Number Generation for Peer-to-Peer Systems. In: OPODIS. Lecture Notes in Computer Science. ; 2006:275--289.","mla":"Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.” OPODIS, 2006, pp. 275--289.","bibtex":"@inproceedings{Awerbuch_Scheideler_2006, series={Lecture Notes in Computer Science}, title={Robust Random Number Generation for Peer-to-Peer Systems}, booktitle={OPODIS}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2006}, pages={275--289}, collection={Lecture Notes in Computer Science} }"},"series_title":"Lecture Notes in Computer Science","title":"Robust Random Number Generation for Peer-to-Peer Systems","ddc":["040"],"user_id":"15504","date_created":"2018-04-03T05:23:39Z","status":"public","has_accepted_license":"1","department":[{"_id":"79"}],"publication":"OPODIS","file_date_updated":"2018-04-13T09:57:51Z","author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file":[{"file_name":"OPODIS06.pdf","date_created":"2018-04-13T09:57:51Z","access_level":"open_access","creator":"florida","file_id":"2335","file_size":198976,"relation":"main_file","date_updated":"2018-04-13T09:57:51Z","content_type":"application/pdf"}]}]