[{"doi":"10.1145/1273445.1273449","date_updated":"2022-01-06T06:55:25Z","_id":"2209","citation":{"short":"V. Aggarwal, A. Feldmann, C. Scheideler, ACM Computer Commucation Review (2007).","ieee":"V. Aggarwal, A. Feldmann, and C. Scheideler, “Can ISPs and P2P users cooperate for improved performance?,” ACM Computer Commucation Review, 2007.","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","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","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.","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."},"type":"journal_article","year":"2007","title":"Can ISPs and P2P users cooperate for improved performance?","user_id":"15504","date_created":"2018-04-05T06:08:43Z","status":"public","department":[{"_id":"79"}],"publication":"ACM Computer Commucation Review","author":[{"last_name":"Aggarwal","full_name":"Aggarwal, Vinay","first_name":"Vinay"},{"last_name":"Feldmann","first_name":"Anja","full_name":"Feldmann, Anja"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}]},{"publication":"Bulletin of the EATCS","department":[{"_id":"79"}],"author":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"date_created":"2018-03-29T09:28:22Z","status":"public","title":"Algorithms for Overlay Networks","user_id":"15504","page":"130--152","citation":{"bibtex":"@article{Scheideler_2008, title={Algorithms for Overlay Networks}, journal={Bulletin of the EATCS}, author={Scheideler, Christian}, year={2008}, pages={130--152} }","mla":"Scheideler, Christian. “Algorithms for Overlay Networks.” Bulletin of the EATCS, 2008, pp. 130--152.","apa":"Scheideler, C. (2008). Algorithms for Overlay Networks. Bulletin of the EATCS, 130--152.","ama":"Scheideler C. Algorithms for Overlay Networks. Bulletin of the EATCS. 2008:130--152.","chicago":"Scheideler, Christian. “Algorithms for Overlay Networks.” Bulletin of the EATCS, 2008, 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","date_updated":"2022-01-06T06:54:03Z","_id":"1937"},{"_id":"1938","date_updated":"2022-01-06T06:54:03Z","doi":"10.1145/1400751.1400759","page":"45--54","type":"conference","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} }","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","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","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."},"year":"2008","user_id":"15504","title":"A jamming-resistant MAC protocol for single-hop wireless networks","publication":"Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008","department":[{"_id":"79"}],"author":[{"last_name":"Awerbuch","full_name":"Awerbuch, Baruch","first_name":"Baruch"},{"last_name":"W. Richa","full_name":"W. Richa, Andr{\\'{e}}a","first_name":"Andr{\\'{e}}a"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"ACM","date_created":"2018-03-29T09:29:06Z","status":"public","publication_identifier":{"isbn":["978-1-59593-989-0"]}},{"date_created":"2018-03-29T09:30:18Z","has_accepted_license":"1","status":"public","publication":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008","file_date_updated":"2018-04-13T10:03:13Z","author":[{"first_name":"Mario","full_name":"Mense, Mario","last_name":"Mense"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publisher":"SIAM","file":[{"date_updated":"2018-04-13T10:03:13Z","content_type":"application/pdf","relation":"main_file","file_size":211264,"file_id":"2341","creator":"florida","access_level":"open_access","date_created":"2018-04-13T10:03:13Z","file_name":"SODA08.pdf"}],"ddc":["040"],"user_id":"14955","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."},"urn":"19408","_id":"1940","department":[{"_id":"79"},{"_id":"63"}],"title":"SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems","language":[{"iso":"eng"}],"oa":"1","date_updated":"2022-01-06T06:54:03Z"},{"user_id":"15504","title":"Tiara: A Self-stabilizing Deterministic Skip List","publication":"Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings","department":[{"_id":"79"}],"author":[{"last_name":"Clouser","full_name":"Clouser, Thomas","first_name":"Thomas"},{"last_name":"Nesterenko","full_name":"Nesterenko, Mikhail","first_name":"Mikhail"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publisher":"Springer","date_created":"2018-03-29T09:31:18Z","status":"public","publication_identifier":{"isbn":["978-3-540-89334-9"]},"volume":5340,"date_updated":"2022-01-06T06:54:03Z","_id":"1941","intvolume":" 5340","doi":"10.1007/978-3-540-89335-6_12","series_title":"Lecture Notes in Computer Science","page":"124--140","type":"conference","citation":{"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.","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.","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","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","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} }"},"year":"2008"},{"doi":"10.1007/978-3-540-76394-9_22","date_updated":"2022-01-06T06:54:03Z","_id":"1942","type":"book_chapter","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."},"year":"2008","page":"229--236","series_title":"eXamen.press","user_id":"15504","title":"Broadcasting: Wie verbreite ich schnell Informationen?","status":"public","date_created":"2018-03-29T09:32:34Z","publication_identifier":{"isbn":["978-3-540-76393-2"]},"author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publisher":"Springer","publication":"Taschenbuch der Algorithmen","department":[{"_id":"79"}]},{"citation":{"bibtex":"@article{D. Kleinberg_Scheideler_2009, title={Foreword}, DOI={10.1007/s00224-009-9202-x}, number={2}, journal={Theory Comput. Syst.}, author={D. Kleinberg, Robert and Scheideler, Christian}, year={2009}, pages={187} }","mla":"D. Kleinberg, Robert, and Christian Scheideler. “Foreword.” Theory Comput. Syst., no. 2, 2009, p. 187, doi:10.1007/s00224-009-9202-x.","chicago":"D. Kleinberg, Robert, and Christian Scheideler. “Foreword.” Theory Comput. Syst., no. 2 (2009): 187. https://doi.org/10.1007/s00224-009-9202-x.","apa":"D. Kleinberg, R., & Scheideler, C. (2009). Foreword. Theory Comput. Syst., (2), 187. https://doi.org/10.1007/s00224-009-9202-x","ama":"D. Kleinberg R, Scheideler C. Foreword. Theory Comput Syst. 2009;(2):187. doi:10.1007/s00224-009-9202-x","ieee":"R. D. Kleinberg and C. Scheideler, “Foreword,” Theory Comput. Syst., no. 2, p. 187, 2009.","short":"R. D. Kleinberg, C. Scheideler, Theory Comput. Syst. (2009) 187."},"type":"journal_article","year":"2009","page":"187","date_updated":"2022-01-06T06:54:00Z","_id":"1925","issue":"2","doi":"10.1007/s00224-009-9202-x","author":[{"full_name":"D. Kleinberg, Robert","first_name":"Robert","last_name":"D. Kleinberg"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publication":"Theory Comput. Syst.","department":[{"_id":"79"}],"status":"public","date_created":"2018-03-29T09:01:30Z","user_id":"15504","title":"Foreword"},{"date_updated":"2022-01-06T06:54:00Z","_id":"1927","issue":"2","doi":"10.1007/s00224-008-9099-9","page":"234--260","citation":{"chicago":"Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.” Theory Comput. Syst., no. 2 (2009): 234--260. https://doi.org/10.1007/s00224-008-9099-9.","ama":"Awerbuch B, Scheideler C. Towards a Scalable and Robust DHT. Theory Comput Syst. 2009;(2):234--260. doi:10.1007/s00224-008-9099-9","apa":"Awerbuch, B., & Scheideler, C. (2009). Towards a Scalable and Robust DHT. Theory Comput. Syst., (2), 234--260. https://doi.org/10.1007/s00224-008-9099-9","bibtex":"@article{Awerbuch_Scheideler_2009, title={Towards a Scalable and Robust DHT}, DOI={10.1007/s00224-008-9099-9}, number={2}, journal={Theory Comput. Syst.}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2009}, pages={234--260} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.” Theory Comput. Syst., no. 2, 2009, pp. 234--260, doi:10.1007/s00224-008-9099-9.","short":"B. Awerbuch, C. Scheideler, Theory Comput. Syst. (2009) 234--260.","ieee":"B. Awerbuch and C. Scheideler, “Towards a Scalable and Robust DHT,” Theory Comput. Syst., no. 2, pp. 234--260, 2009."},"type":"journal_article","year":"2009","user_id":"15504","title":"Towards a Scalable and Robust DHT","department":[{"_id":"79"}],"publication":"Theory Comput. Syst.","author":[{"last_name":"Awerbuch","full_name":"Awerbuch, Baruch","first_name":"Baruch"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2018-03-29T09:08:11Z","status":"public"},{"title":"Robust random number generation for peer-to-peer systems","user_id":"15504","date_created":"2018-03-29T09:08:12Z","status":"public","publication":"Theor. Comput. Sci.","department":[{"_id":"79"}],"author":[{"first_name":"Baruch","full_name":"Awerbuch, Baruch","last_name":"Awerbuch"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"doi":"10.1016/j.tcs.2008.10.003","issue":"6-7","date_updated":"2022-01-06T06:54:01Z","_id":"1928","page":"453--466","type":"journal_article","year":"2009","citation":{"chicago":"Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.” Theor. Comput. Sci., no. 6–7 (2009): 453--466. https://doi.org/10.1016/j.tcs.2008.10.003.","ama":"Awerbuch B, Scheideler C. Robust random number generation for peer-to-peer systems. Theor Comput Sci. 2009;(6-7):453--466. doi:10.1016/j.tcs.2008.10.003","apa":"Awerbuch, B., & Scheideler, C. (2009). Robust random number generation for peer-to-peer systems. Theor. Comput. Sci., (6–7), 453--466. https://doi.org/10.1016/j.tcs.2008.10.003","bibtex":"@article{Awerbuch_Scheideler_2009, title={Robust random number generation for peer-to-peer systems}, DOI={10.1016/j.tcs.2008.10.003}, number={6–7}, journal={Theor. Comput. Sci.}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2009}, pages={453--466} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.” Theor. Comput. Sci., no. 6–7, 2009, pp. 453--466, doi:10.1016/j.tcs.2008.10.003.","short":"B. Awerbuch, C. Scheideler, Theor. Comput. Sci. (2009) 453--466.","ieee":"B. Awerbuch and C. Scheideler, “Robust random number generation for peer-to-peer systems,” Theor. Comput. Sci., no. 6–7, pp. 453--466, 2009."}},{"department":[{"_id":"79"}],"publication":"Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II","publisher":"Springer","author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"}],"date_created":"2018-03-29T09:08:14Z","status":"public","volume":5556,"publication_identifier":{"isbn":["978-3-642-02929-5"]},"user_id":"15504","title":"A Distributed and Oblivious Heap","series_title":"Lecture Notes in Computer Science","page":"571--582","year":"2009","type":"conference","citation":{"apa":"Scheideler, C., & Schmid, S. (2009). A Distributed and Oblivious Heap. In Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II (Vol. 5556, pp. 571--582). Springer. https://doi.org/10.1007/978-3-642-02930-1_47","ama":"Scheideler C, Schmid S. A Distributed and Oblivious Heap. In: Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II. Vol 5556. Lecture Notes in Computer Science. Springer; 2009:571--582. doi:10.1007/978-3-642-02930-1_47","chicago":"Scheideler, Christian, and Stefan Schmid. “A Distributed and Oblivious Heap.” In Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, 5556:571--582. Lecture Notes in Computer Science. Springer, 2009. https://doi.org/10.1007/978-3-642-02930-1_47.","bibtex":"@inproceedings{Scheideler_Schmid_2009, series={Lecture Notes in Computer Science}, title={A Distributed and Oblivious Heap}, volume={5556}, DOI={10.1007/978-3-642-02930-1_47}, booktitle={Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II}, publisher={Springer}, author={Scheideler, Christian and Schmid, Stefan}, year={2009}, pages={571--582}, collection={Lecture Notes in Computer Science} }","mla":"Scheideler, Christian, and Stefan Schmid. “A Distributed and Oblivious Heap.” Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, vol. 5556, Springer, 2009, pp. 571--582, doi:10.1007/978-3-642-02930-1_47.","short":"C. Scheideler, S. Schmid, in: Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, Springer, 2009, pp. 571--582.","ieee":"C. Scheideler and S. Schmid, “A Distributed and Oblivious Heap,” in Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, 2009, vol. 5556, pp. 571--582."},"_id":"1929","intvolume":" 5556","date_updated":"2022-01-06T06:54:01Z","doi":"10.1007/978-3-642-02930-1_47"},{"date_updated":"2022-01-06T06:54:02Z","oa":"1","doi":"10.1007/978-3-642-10631-6_78","series_title":"Lecture Notes in Computer Science","title":"A Self-stabilizing and Local Delaunay Graph Construction","department":[{"_id":"79"}],"urn":"19304","_id":"1930","intvolume":" 5878","page":"771--780","citation":{"short":"R. Jacob, S. Ritscher, C. Scheideler, S. Schmid, in: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, Springer, 2009, pp. 771--780.","ieee":"R. Jacob, S. Ritscher, C. Scheideler, and S. Schmid, “A Self-stabilizing and Local Delaunay Graph Construction,” in Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, 2009, vol. 5878, pp. 771--780.","chicago":"Jacob, Riko, Stephan Ritscher, Christian Scheideler, and Stefan Schmid. “A Self-Stabilizing and Local Delaunay Graph Construction.” In Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, 5878:771--780. Lecture Notes in Computer Science. Springer, 2009. https://doi.org/10.1007/978-3-642-10631-6_78.","apa":"Jacob, R., Ritscher, S., Scheideler, C., & Schmid, S. (2009). A Self-stabilizing and Local Delaunay Graph Construction. In Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings (Vol. 5878, pp. 771--780). Springer. https://doi.org/10.1007/978-3-642-10631-6_78","ama":"Jacob R, Ritscher S, Scheideler C, Schmid S. A Self-stabilizing and Local Delaunay Graph Construction. In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings. Vol 5878. Lecture Notes in Computer Science. Springer; 2009:771--780. doi:10.1007/978-3-642-10631-6_78","mla":"Jacob, Riko, et al. “A Self-Stabilizing and Local Delaunay Graph Construction.” Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, vol. 5878, Springer, 2009, pp. 771--780, doi:10.1007/978-3-642-10631-6_78.","bibtex":"@inproceedings{Jacob_Ritscher_Scheideler_Schmid_2009, series={Lecture Notes in Computer Science}, title={A Self-stabilizing and Local Delaunay Graph Construction}, volume={5878}, DOI={10.1007/978-3-642-10631-6_78}, booktitle={Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, publisher={Springer}, author={Jacob, Riko and Ritscher, Stephan and Scheideler, Christian and Schmid, Stefan}, year={2009}, pages={771--780}, collection={Lecture Notes in Computer Science} }"},"year":"2009","type":"conference","user_id":"15504","ddc":["040"],"file":[{"access_level":"open_access","file_name":"isaac09.pdf","date_created":"2018-04-13T10:05:53Z","relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-13T10:05:53Z","creator":"florida","file_id":"2342","file_size":139275}],"publication":"Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings","file_date_updated":"2018-04-13T10:05:53Z","publisher":"Springer","author":[{"full_name":"Jacob, Riko","first_name":"Riko","last_name":"Jacob"},{"first_name":"Stephan","full_name":"Ritscher, Stephan","last_name":"Ritscher"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"}],"date_created":"2018-03-29T09:12:59Z","status":"public","has_accepted_license":"1","volume":5878},{"_id":"1932","date_updated":"2022-01-06T06:54:02Z","doi":"10.1145/1582716.1582741","page":"131--140","year":"2009","citation":{"ieee":"R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “A distributed polylogarithmic time algorithm for self-stabilizing skip graphs,” in Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140.","short":"R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140.","bibtex":"@inproceedings{Jacob_W. Richa_Scheideler_Schmid_Täubig_2009, title={A distributed polylogarithmic time algorithm for self-stabilizing skip graphs}, DOI={10.1145/1582716.1582741}, booktitle={Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009}, author={Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo}, year={2009}, pages={131--140} }","mla":"Jacob, Riko, et al. “A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs.” Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140, doi:10.1145/1582716.1582741.","chicago":"Jacob, Riko, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo Täubig. “A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs.” In Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, 131--140, 2009. https://doi.org/10.1145/1582716.1582741.","ama":"Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009. ; 2009:131--140. doi:10.1145/1582716.1582741","apa":"Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., & Täubig, H. (2009). A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009 (pp. 131--140). https://doi.org/10.1145/1582716.1582741"},"type":"conference","user_id":"15504","title":"A distributed polylogarithmic time algorithm for self-stabilizing skip graphs","publication":"Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009","department":[{"_id":"79"}],"author":[{"first_name":"Riko","full_name":"Jacob, Riko","last_name":"Jacob"},{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"},{"full_name":"Täubig, Hanjo","first_name":"Hanjo","last_name":"Täubig"}],"date_created":"2018-03-29T09:16:22Z","status":"public","publication_identifier":{"isbn":["978-1-60558-396-9"]}},{"page":"300--309","type":"conference","citation":{"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.","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","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} }","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.","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."},"year":"2009","doi":"10.1145/1583991.1584064","_id":"1933","date_updated":"2022-01-06T06:54:02Z","publication_identifier":{"isbn":["978-1-60558-606-9"]},"date_created":"2018-03-29T09:18:06Z","status":"public","department":[{"_id":"79"}],"publication":"SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009","author":[{"full_name":"Baumgart, Matthias","first_name":"Matthias","last_name":"Baumgart"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"}],"title":"A DoS-resilient information system for dynamic data management","user_id":"15504"},{"series_title":"Lecture Notes in Computer Science","page":"781--782","type":"conference","citation":{"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.","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.","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.","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"},"year":"2009","_id":"1934","date_updated":"2022-01-06T06:54:02Z","intvolume":" 5873","doi":"10.1007/978-3-642-05118-0_58","department":[{"_id":"79"}],"publication":"Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings","author":[{"full_name":"Gall, Dominik","first_name":"Dominik","last_name":"Gall"},{"last_name":"Jacob","full_name":"Jacob, Riko","first_name":"Riko"},{"first_name":"Andrea","full_name":"W. Richa, Andrea","last_name":"W. Richa"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"},{"last_name":"Täubig","full_name":"Täubig, Hanjo","first_name":"Hanjo"}],"publisher":"Springer","publication_identifier":{"isbn":["978-3-642-05117-3"]},"volume":5873,"date_created":"2018-03-29T09:19:17Z","status":"public","title":"Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization","user_id":"15504"},{"title":"Stabilizing Consensus with the Power of Two Choices","user_id":"15504","volume":"09371","status":"public","date_created":"2018-03-29T09:20:44Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany","author":[{"first_name":"Benjamin","full_name":"Doerr, 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","full_name":"Sauerwald, Thomas","first_name":"Thomas"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"department":[{"_id":"79"}],"publication":"Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009","doi":"10.1145/1989493.1989516","_id":"1935","intvolume":" 9371","date_updated":"2022-01-06T06:54:02Z","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.","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","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","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."},"series_title":"Dagstuhl Seminar Proceedings"},{"date_updated":"2022-01-06T06:53:57Z","_id":"1903","issue":"5","doi":"10.1007/s00287-010-0470-2","language":[{"iso":"eng"}],"citation":{"bibtex":"@article{Meyer auf der Heide_Scheideler_2010, title={Algorithmische Grundlagen verteilter Speichersysteme}, DOI={10.1007/s00287-010-0470-2}, number={5}, journal={Informatik Spektrum}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2010}, pages={468--474} }","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen Verteilter Speichersysteme.” Informatik Spektrum, no. 5, 2010, pp. 468--474, doi:10.1007/s00287-010-0470-2.","ama":"Meyer auf der Heide F, Scheideler C. Algorithmische Grundlagen verteilter Speichersysteme. Informatik Spektrum. 2010;(5):468--474. doi:10.1007/s00287-010-0470-2","apa":"Meyer auf der Heide, F., & Scheideler, C. (2010). Algorithmische Grundlagen verteilter Speichersysteme. Informatik Spektrum, (5), 468--474. https://doi.org/10.1007/s00287-010-0470-2","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen Verteilter Speichersysteme.” Informatik Spektrum, no. 5 (2010): 468--474. https://doi.org/10.1007/s00287-010-0470-2.","ieee":"F. Meyer auf der Heide and C. Scheideler, “Algorithmische Grundlagen verteilter Speichersysteme,” Informatik Spektrum, no. 5, pp. 468--474, 2010.","short":"F. Meyer auf der Heide, C. Scheideler, Informatik Spektrum (2010) 468--474."},"type":"journal_article","year":"2010","page":"468--474","user_id":"14955","title":"Algorithmische Grundlagen verteilter Speichersysteme","author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publication":"Informatik Spektrum","department":[{"_id":"79"},{"_id":"63"}],"status":"public","date_created":"2018-03-28T07:21:50Z"},{"page":"809--810","type":"journal_article","citation":{"mla":"Gavoille, Cyril, et al. “Foreword.” Theory of Computing Systems, no. 4, 2010, pp. 809--810, doi:10.1007/s00224-010-9284-5.","bibtex":"@article{Gavoille_Patt-Shamir_Scheideler_2010, title={Foreword}, DOI={10.1007/s00224-010-9284-5}, number={4}, journal={Theory of Computing Systems}, author={Gavoille, Cyril and Patt-Shamir, Boaz and Scheideler, Christian}, year={2010}, pages={809--810} }","chicago":"Gavoille, Cyril, Boaz Patt-Shamir, and Christian Scheideler. “Foreword.” Theory of Computing Systems, no. 4 (2010): 809--810. https://doi.org/10.1007/s00224-010-9284-5.","ama":"Gavoille C, Patt-Shamir B, Scheideler C. Foreword. Theory of Computing Systems. 2010;(4):809--810. doi:10.1007/s00224-010-9284-5","apa":"Gavoille, C., Patt-Shamir, B., & Scheideler, C. (2010). Foreword. Theory of Computing Systems, (4), 809--810. https://doi.org/10.1007/s00224-010-9284-5","ieee":"C. Gavoille, B. Patt-Shamir, and C. Scheideler, “Foreword,” Theory of Computing Systems, no. 4, pp. 809--810, 2010.","short":"C. Gavoille, B. Patt-Shamir, C. Scheideler, Theory of Computing Systems (2010) 809--810."},"year":"2010","issue":"4","doi":"10.1007/s00224-010-9284-5","_id":"1904","date_updated":"2022-01-06T06:53:57Z","date_created":"2018-03-28T07:22:21Z","status":"public","department":[{"_id":"79"}],"publication":"Theory of Computing Systems","author":[{"full_name":"Gavoille, Cyril","first_name":"Cyril","last_name":"Gavoille"},{"full_name":"Patt-Shamir, Boaz","first_name":"Boaz","last_name":"Patt-Shamir"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"user_id":"15504","title":"Foreword"},{"user_id":"15504","title":"Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization","department":[{"_id":"79"}],"publication":"LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings","author":[{"first_name":"Dominik","full_name":"Gall, Dominik","last_name":"Gall"},{"first_name":"Riko","full_name":"Jacob, Riko","last_name":"Jacob"},{"last_name":"W. Richa","full_name":"W. Richa, Andrea","first_name":"Andrea"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"},{"last_name":"Täubig","first_name":"Hanjo","full_name":"Täubig, Hanjo"}],"publisher":"Springer","date_created":"2018-03-28T07:22:42Z","status":"public","volume":6034,"publication_identifier":{"isbn":["978-3-642-12199-9"]},"intvolume":" 6034","_id":"1905","date_updated":"2022-01-06T06:53:57Z","doi":"10.1007/978-3-642-12200-2_27","series_title":"Lecture Notes in Computer Science","page":"294--305","citation":{"apa":"Gall, D., Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., & Täubig, H. (2010). Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. In LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings (Vol. 6034, pp. 294--305). Springer. https://doi.org/10.1007/978-3-642-12200-2_27","ama":"Gall D, Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. In: LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings. Vol 6034. Lecture Notes in Computer Science. Springer; 2010:294--305. doi:10.1007/978-3-642-12200-2_27","chicago":"Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo Täubig. “Time Complexity of Distributed Topological Self-Stabilization: The Case of Graph Linearization.” In LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings, 6034:294--305. Lecture Notes in Computer Science. Springer, 2010. https://doi.org/10.1007/978-3-642-12200-2_27.","bibtex":"@inproceedings{Gall_Jacob_W. Richa_Scheideler_Schmid_Täubig_2010, series={Lecture Notes in Computer Science}, title={Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization}, volume={6034}, DOI={10.1007/978-3-642-12200-2_27}, booktitle={LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings}, publisher={Springer}, author={Gall, Dominik and Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo}, year={2010}, pages={294--305}, collection={Lecture Notes in Computer Science} }","mla":"Gall, Dominik, et al. “Time Complexity of Distributed Topological Self-Stabilization: The Case of Graph Linearization.” LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings, vol. 6034, Springer, 2010, pp. 294--305, doi:10.1007/978-3-642-12200-2_27.","short":"D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings, Springer, 2010, pp. 294--305.","ieee":"D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization,” in LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings, 2010, vol. 6034, pp. 294--305."},"type":"conference","year":"2010"},{"user_id":"15504","title":"Brief announcement: towards robust medium access in multi-hop networks","status":"public","date_created":"2018-03-28T07:23:32Z","publication_identifier":{"isbn":["978-1-60558-888-9"]},"publisher":"ACM","author":[{"first_name":"Andrea W.","full_name":"Richa, Andrea W.","last_name":"Richa"},{"last_name":"Zhang","first_name":"Jin","full_name":"Zhang, Jin"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"}],"publication":"Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010","department":[{"_id":"79"}],"doi":"10.1145/1835698.1835726","date_updated":"2022-01-06T06:53:57Z","_id":"1906","year":"2010","citation":{"apa":"Richa, A. W., Zhang, J., Scheideler, C., & Schmid, S. (2010). Brief announcement: towards robust medium access in multi-hop networks. In Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010 (pp. 114--115). ACM. https://doi.org/10.1145/1835698.1835726","ama":"Richa AW, Zhang J, Scheideler C, Schmid S. Brief announcement: towards robust medium access in multi-hop networks. In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010. ACM; 2010:114--115. doi:10.1145/1835698.1835726","chicago":"Richa, Andrea W., Jin Zhang, Christian Scheideler, and Stefan Schmid. “Brief Announcement: Towards Robust Medium Access in Multi-Hop Networks.” In Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, 114--115. ACM, 2010. https://doi.org/10.1145/1835698.1835726.","bibtex":"@inproceedings{Richa_Zhang_Scheideler_Schmid_2010, title={Brief announcement: towards robust medium access in multi-hop networks}, DOI={10.1145/1835698.1835726}, booktitle={Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010}, publisher={ACM}, author={Richa, Andrea W. and Zhang, Jin and Scheideler, Christian and Schmid, Stefan}, year={2010}, pages={114--115} }","mla":"Richa, Andrea W., et al. “Brief Announcement: Towards Robust Medium Access in Multi-Hop Networks.” Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, ACM, 2010, pp. 114--115, doi:10.1145/1835698.1835726.","short":"A.W. Richa, J. Zhang, C. Scheideler, S. Schmid, in: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, ACM, 2010, pp. 114--115.","ieee":"A. W. Richa, J. Zhang, C. Scheideler, and S. Schmid, “Brief announcement: towards robust medium access in multi-hop networks,” in Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, 2010, pp. 114--115."},"type":"conference","page":"114--115"},{"publication":"Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings","department":[{"_id":"79"}],"author":[{"first_name":"Andrea W.","full_name":"Richa, Andrea W.","last_name":"Richa"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"full_name":"Zhang, Jin","first_name":"Jin","last_name":"Zhang"}],"publisher":"Springer","date_created":"2018-03-28T07:24:22Z","status":"public","publication_identifier":{"isbn":["978-3-642-15762-2"]},"volume":6343,"user_id":"15504","title":"A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks","series_title":"Lecture Notes in Computer Science","page":"179--193","year":"2010","type":"conference","citation":{"ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks,” in Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, 2010, vol. 6343, pp. 179--193.","short":"A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, Springer, 2010, pp. 179--193.","bibtex":"@inproceedings{Richa_Scheideler_Schmid_Zhang_2010, series={Lecture Notes in Computer Science}, title={A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks}, volume={6343}, DOI={10.1007/978-3-642-15763-9_17}, booktitle={Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings}, publisher={Springer}, author={Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2010}, pages={179--193}, collection={Lecture Notes in Computer Science} }","mla":"Richa, Andrea W., et al. “A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks.” Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, vol. 6343, Springer, 2010, pp. 179--193, doi:10.1007/978-3-642-15763-9_17.","apa":"Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2010). A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks. In Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings (Vol. 6343, pp. 179--193). Springer. https://doi.org/10.1007/978-3-642-15763-9_17","ama":"Richa AW, Scheideler C, Schmid S, Zhang J. A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks. In: Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings. Vol 6343. Lecture Notes in Computer Science. Springer; 2010:179--193. doi:10.1007/978-3-642-15763-9_17","chicago":"Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin Zhang. “A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks.” In Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, 6343:179--193. Lecture Notes in Computer Science. Springer, 2010. https://doi.org/10.1007/978-3-642-15763-9_17."},"_id":"1907","date_updated":"2022-01-06T06:53:58Z","intvolume":" 6343","doi":"10.1007/978-3-642-15763-9_17"},{"user_id":"15504","title":"Brief Announcement: Stabilizing Consensus with the Power of Two Choices","publisher":"Springer","author":[{"last_name":"Doerr","first_name":"Benjamin","full_name":"Doerr, Benjamin"},{"first_name":"Leslie","full_name":"Ann Goldberg, Leslie","last_name":"Ann Goldberg"},{"last_name":"Minder","first_name":"Lorenz","full_name":"Minder, Lorenz"},{"last_name":"Sauerwald","full_name":"Sauerwald, Thomas","first_name":"Thomas"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"department":[{"_id":"79"}],"publication":"Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings","status":"public","date_created":"2018-03-28T07:25:45Z","volume":6343,"date_updated":"2022-01-06T06:53:58Z","_id":"1908","intvolume":" 6343","doi":"10.1007/978-3-642-15763-9_50","series_title":"Lecture Notes in Computer Science","citation":{"short":"B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, Springer, 2010, pp. 528--530.","ieee":"B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Brief Announcement: Stabilizing Consensus with the Power of Two Choices,” in Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, 2010, vol. 6343, pp. 528--530.","apa":"Doerr, B., Ann Goldberg, L., Minder, L., Sauerwald, T., & Scheideler, C. (2010). Brief Announcement: Stabilizing Consensus with the Power of Two Choices. In Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings (Vol. 6343, pp. 528--530). Springer. https://doi.org/10.1007/978-3-642-15763-9_50","ama":"Doerr B, Ann Goldberg L, Minder L, Sauerwald T, Scheideler C. Brief Announcement: Stabilizing Consensus with the Power of Two Choices. In: Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings. Vol 6343. Lecture Notes in Computer Science. Springer; 2010:528--530. doi:10.1007/978-3-642-15763-9_50","chicago":"Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler. “Brief Announcement: Stabilizing Consensus with the Power of Two Choices.” In Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, 6343:528--530. Lecture Notes in Computer Science. Springer, 2010. https://doi.org/10.1007/978-3-642-15763-9_50.","bibtex":"@inproceedings{Doerr_Ann Goldberg_Minder_Sauerwald_Scheideler_2010, series={Lecture Notes in Computer Science}, title={Brief Announcement: Stabilizing Consensus with the Power of Two Choices}, volume={6343}, DOI={10.1007/978-3-642-15763-9_50}, booktitle={Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings}, publisher={Springer}, author={Doerr, Benjamin and Ann Goldberg, Leslie and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian}, year={2010}, pages={528--530}, collection={Lecture Notes in Computer Science} }","mla":"Doerr, Benjamin, et al. “Brief Announcement: Stabilizing Consensus with the Power of Two Choices.” Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, vol. 6343, Springer, 2010, pp. 528--530, doi:10.1007/978-3-642-15763-9_50."},"year":"2010","type":"conference","page":"528--530"},{"date_created":"2018-03-28T07:08:13Z","status":"public","publication_identifier":{"isbn":["978-0-7695-4364-2"]},"publication":"2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011","department":[{"_id":"79"}],"publisher":"IEEE Computer Society","author":[{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, Andrea"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"},{"last_name":"Zhang","full_name":"Zhang, Jin","first_name":"Jin"}],"user_id":"15504","title":"Competitive and Fair Medium Access Despite Reactive Jamming","page":"507--516","year":"2011","citation":{"short":"A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011, IEEE Computer Society, 2011, pp. 507--516.","ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and Fair Medium Access Despite Reactive Jamming,” in 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011, 2011, pp. 507--516.","chicago":"W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Competitive and Fair Medium Access Despite Reactive Jamming.” In 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011, 507--516. IEEE Computer Society, 2011. https://doi.org/10.1109/ICDCS.2011.8.","apa":"W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2011). Competitive and Fair Medium Access Despite Reactive Jamming. In 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011 (pp. 507--516). IEEE Computer Society. https://doi.org/10.1109/ICDCS.2011.8","ama":"W. Richa A, Scheideler C, Schmid S, Zhang J. Competitive and Fair Medium Access Despite Reactive Jamming. In: 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011. IEEE Computer Society; 2011:507--516. doi:10.1109/ICDCS.2011.8","mla":"W. Richa, Andrea, et al. “Competitive and Fair Medium Access Despite Reactive Jamming.” 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011, IEEE Computer Society, 2011, pp. 507--516, doi:10.1109/ICDCS.2011.8.","bibtex":"@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Competitive and Fair Medium Access Despite Reactive Jamming}, DOI={10.1109/ICDCS.2011.8}, booktitle={2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011}, publisher={IEEE Computer Society}, author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2011}, pages={507--516} }"},"type":"conference","doi":"10.1109/ICDCS.2011.8","_id":"1891","date_updated":"2022-01-06T06:53:54Z"},{"user_id":"15504","title":"Towards jamming-resistant and competitive medium access in the SINR model","date_created":"2018-03-28T07:09:07Z","status":"public","publication_identifier":{"isbn":["978-1-4503-0868-7"]},"department":[{"_id":"79"}],"publication":"Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011","publisher":"ACM","author":[{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"first_name":"Jin","full_name":"Zhang, Jin","last_name":"Zhang"}],"doi":"10.1145/2030686.2030697","_id":"1892","date_updated":"2022-01-06T06:53:54Z","page":"33--36","year":"2011","type":"conference","citation":{"short":"A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the Students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011, ACM, 2011, pp. 33--36.","ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Towards jamming-resistant and competitive medium access in the SINR model,” in Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011, 2011, pp. 33--36.","chicago":"W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Towards Jamming-Resistant and Competitive Medium Access in the SINR Model.” In Proceedings of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the Students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011, 33--36. ACM, 2011. https://doi.org/10.1145/2030686.2030697.","apa":"W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2011). Towards jamming-resistant and competitive medium access in the SINR model. In Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011 (pp. 33--36). ACM. https://doi.org/10.1145/2030686.2030697","ama":"W. Richa A, Scheideler C, Schmid S, Zhang J. Towards jamming-resistant and competitive medium access in the SINR model. In: Proceedings of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the Students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011. ACM; 2011:33--36. doi:10.1145/2030686.2030697","mla":"W. Richa, Andrea, et al. “Towards Jamming-Resistant and Competitive Medium Access in the SINR Model.” Proceedings of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the Students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011, ACM, 2011, pp. 33--36, doi:10.1145/2030686.2030697.","bibtex":"@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Towards jamming-resistant and competitive medium access in the SINR model}, DOI={10.1145/2030686.2030697}, booktitle={Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011}, publisher={ACM}, author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2011}, pages={33--36} }"}},{"page":"15","type":"conference","citation":{"apa":"W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2011). Self-stabilizing leader election for single-hop wireless networks despite jamming. In Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011 (p. 15). ACM. https://doi.org/10.1145/2107502.2107522","ama":"W. Richa A, Scheideler C, Schmid S, Zhang J. Self-stabilizing leader election for single-hop wireless networks despite jamming. In: Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011. ACM; 2011:15. doi:10.1145/2107502.2107522","chicago":"W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Self-Stabilizing Leader Election for Single-Hop Wireless Networks despite Jamming.” In Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011, 15. ACM, 2011. https://doi.org/10.1145/2107502.2107522.","bibtex":"@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Self-stabilizing leader election for single-hop wireless networks despite jamming}, DOI={10.1145/2107502.2107522}, booktitle={Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011}, publisher={ACM}, author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2011}, pages={15} }","mla":"W. Richa, Andrea, et al. “Self-Stabilizing Leader Election for Single-Hop Wireless Networks despite Jamming.” Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011, ACM, 2011, p. 15, doi:10.1145/2107502.2107522.","short":"A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011, ACM, 2011, p. 15.","ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Self-stabilizing leader election for single-hop wireless networks despite jamming,” in Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011, 2011, p. 15."},"year":"2011","doi":"10.1145/2107502.2107522","date_updated":"2022-01-06T06:53:54Z","_id":"1893","date_created":"2018-03-28T07:09:54Z","status":"public","publication_identifier":{"isbn":["978-1-4503-0722-2"]},"department":[{"_id":"79"}],"publication":"Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011","author":[{"first_name":"Andrea","full_name":"W. Richa, Andrea","last_name":"W. Richa"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"},{"full_name":"Zhang, Jin","first_name":"Jin","last_name":"Zhang"}],"publisher":"ACM","user_id":"15504","title":"Self-stabilizing leader election for single-hop wireless networks despite jamming"},{"department":[{"_id":"79"}],"publication":"SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011)","author":[{"last_name":"Kniesburges","full_name":"Kniesburges, Sebastian","first_name":"Sebastian"},{"last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas","first_name":"Andreas"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication_identifier":{"isbn":["978-1-4503-0743-7"]},"date_created":"2018-03-28T07:12:49Z","status":"public","title":"Re-Chord: a self-stabilizing chord overlay network","user_id":"15504","page":"235--244","citation":{"ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “Re-Chord: a self-stabilizing chord overlay network,” in SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011), 2011, pp. 235--244.","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-Located with FCRC 2011), 2011, pp. 235--244.","mla":"Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-Located with FCRC 2011), 2011, pp. 235--244, doi:10.1145/1989493.1989527.","bibtex":"@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2011, title={Re-Chord: a self-stabilizing chord overlay network}, DOI={10.1145/1989493.1989527}, booktitle={SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2011}, pages={235--244} }","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. Re-Chord: a self-stabilizing chord overlay network. In: SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-Located with FCRC 2011). ; 2011:235--244. doi:10.1145/1989493.1989527","apa":"Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2011). Re-Chord: a self-stabilizing chord overlay network. In SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011) (pp. 235--244). https://doi.org/10.1145/1989493.1989527","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” In SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-Located with FCRC 2011), 235--244, 2011. https://doi.org/10.1145/1989493.1989527."},"type":"conference","year":"2011","date_updated":"2022-01-06T06:53:55Z","_id":"1895","doi":"10.1145/1989493.1989527"},{"title":"Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems","user_id":"15504","publisher":"Springer","author":[{"first_name":"Sebastian","full_name":"Kniesburges, Sebastian","last_name":"Kniesburges"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"department":[{"_id":"79"}],"publication":"WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings","volume":6552,"publication_identifier":{"isbn":["978-3-642-19093-3"]},"status":"public","date_created":"2018-03-28T07:17:05Z","_id":"1899","intvolume":" 6552","date_updated":"2022-01-06T06:53:56Z","doi":"10.1007/978-3-642-19094-0_18","series_title":"Lecture Notes in Computer Science","citation":{"ieee":"S. Kniesburges and C. Scheideler, “Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems,” in WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, 2011, vol. 6552, pp. 170--181.","short":"S. Kniesburges, C. Scheideler, in: WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, Springer, 2011, pp. 170--181.","mla":"Kniesburges, Sebastian, and Christian Scheideler. “Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems.” WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, vol. 6552, Springer, 2011, pp. 170--181, doi:10.1007/978-3-642-19094-0_18.","bibtex":"@inproceedings{Kniesburges_Scheideler_2011, series={Lecture Notes in Computer Science}, title={Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems}, volume={6552}, DOI={10.1007/978-3-642-19094-0_18}, booktitle={WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings}, publisher={Springer}, author={Kniesburges, Sebastian and Scheideler, Christian}, year={2011}, pages={170--181}, collection={Lecture Notes in Computer Science} }","chicago":"Kniesburges, Sebastian, and Christian Scheideler. “Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems.” In WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, 6552:170--181. Lecture Notes in Computer Science. Springer, 2011. https://doi.org/10.1007/978-3-642-19094-0_18.","apa":"Kniesburges, S., & Scheideler, C. (2011). Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. In WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings (Vol. 6552, pp. 170--181). Springer. https://doi.org/10.1007/978-3-642-19094-0_18","ama":"Kniesburges S, Scheideler C. Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. In: WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings. Vol 6552. Lecture Notes in Computer Science. Springer; 2011:170--181. doi:10.1007/978-3-642-19094-0_18"},"type":"conference","year":"2011","page":"170--181"},{"status":"public","date_created":"2018-03-28T07:17:53Z","publication_identifier":{"isbn":["978-1-4614-1167-3"]},"publisher":"Springer","author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Kalman","full_name":"Graffi, Kalman","last_name":"Graffi"}],"publication":"Computer Science, The Hardware, Software and Heart of It","department":[{"_id":"79"}],"user_id":"15504","title":"Programming for Distributed Computing: From Physical to Logical Networks","citation":{"bibtex":"@inbook{Scheideler_Graffi_2011, title={Programming for Distributed Computing: From Physical to Logical Networks}, DOI={10.1007/978-1-4614-1168-0_9}, booktitle={Computer Science, The Hardware, Software and Heart of It}, publisher={Springer}, author={Scheideler, Christian and Graffi, Kalman}, year={2011}, pages={155--168} }","mla":"Scheideler, Christian, and Kalman Graffi. “Programming for Distributed Computing: From Physical to Logical Networks.” Computer Science, The Hardware, Software and Heart of It, Springer, 2011, pp. 155--168, doi:10.1007/978-1-4614-1168-0_9.","ama":"Scheideler C, Graffi K. Programming for Distributed Computing: From Physical to Logical Networks. In: Computer Science, The Hardware, Software and Heart of It. Springer; 2011:155--168. doi:10.1007/978-1-4614-1168-0_9","apa":"Scheideler, C., & Graffi, K. (2011). Programming for Distributed Computing: From Physical to Logical Networks. In Computer Science, The Hardware, Software and Heart of It (pp. 155--168). Springer. https://doi.org/10.1007/978-1-4614-1168-0_9","chicago":"Scheideler, Christian, and Kalman Graffi. “Programming for Distributed Computing: From Physical to Logical Networks.” In Computer Science, The Hardware, Software and Heart of It, 155--168. Springer, 2011. https://doi.org/10.1007/978-1-4614-1168-0_9.","ieee":"C. Scheideler and K. Graffi, “Programming for Distributed Computing: From Physical to Logical Networks,” in Computer Science, The Hardware, Software and Heart of It, Springer, 2011, pp. 155--168.","short":"C. Scheideler, K. Graffi, in: Computer Science, The Hardware, Software and Heart of It, Springer, 2011, pp. 155--168."},"type":"book_chapter","year":"2011","page":"155--168","doi":"10.1007/978-1-4614-1168-0_9","date_updated":"2022-01-06T06:53:57Z","_id":"1900"},{"doi":"10.1007/978-3-642-15328-0_22","_id":"1901","date_updated":"2022-01-06T06:53:57Z","page":"223--229","citation":{"bibtex":"@inbook{Scheideler_2011, title={Broadcasting - How Can I Quickly Disseminate Information?}, DOI={10.1007/978-3-642-15328-0_22}, booktitle={Algorithms Unplugged}, publisher={Springer}, author={Scheideler, Christian}, year={2011}, pages={223--229} }","mla":"Scheideler, Christian. “Broadcasting - How Can I Quickly Disseminate Information?” Algorithms Unplugged, Springer, 2011, pp. 223--229, doi:10.1007/978-3-642-15328-0_22.","ama":"Scheideler C. Broadcasting - How Can I Quickly Disseminate Information? In: Algorithms Unplugged. Springer; 2011:223--229. doi:10.1007/978-3-642-15328-0_22","apa":"Scheideler, C. (2011). Broadcasting - How Can I Quickly Disseminate Information? In Algorithms Unplugged (pp. 223--229). Springer. https://doi.org/10.1007/978-3-642-15328-0_22","chicago":"Scheideler, Christian. “Broadcasting - How Can I Quickly Disseminate Information?” In Algorithms Unplugged, 223--229. Springer, 2011. https://doi.org/10.1007/978-3-642-15328-0_22.","ieee":"C. Scheideler, “Broadcasting - How Can I Quickly Disseminate Information?,” in Algorithms Unplugged, Springer, 2011, pp. 223--229.","short":"C. Scheideler, in: Algorithms Unplugged, Springer, 2011, pp. 223--229."},"year":"2011","type":"book_chapter","title":"Broadcasting - How Can I Quickly Disseminate Information?","user_id":"15504","publication_identifier":{"isbn":["978-3-642-15327-3"]},"date_created":"2018-03-28T07:18:43Z","status":"public","department":[{"_id":"79"}],"publication":"Algorithms Unplugged","publisher":"Springer","author":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}]},{"doi":"10.4230/LIPIcs.STACS.2011.129","_id":"1924","date_updated":"2022-01-06T06:54:00Z","year":"2011","type":"conference","citation":{"ieee":"P. Kolman and C. Scheideler, “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing,” in 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 2011, pp. 129--140.","short":"P. Kolman, C. Scheideler, in: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 2011, pp. 129--140.","bibtex":"@inproceedings{Kolman_Scheideler_2011, title={Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing}, DOI={10.4230/LIPIcs.STACS.2011.129}, booktitle={28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany}, author={Kolman, Petr and Scheideler, Christian}, year={2011}, pages={129--140} }","mla":"Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.” 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 2011, pp. 129--140, doi:10.4230/LIPIcs.STACS.2011.129.","chicago":"Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.” In 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 129--140, 2011. https://doi.org/10.4230/LIPIcs.STACS.2011.129.","apa":"Kolman, P., & Scheideler, C. (2011). Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. In 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany (pp. 129--140). https://doi.org/10.4230/LIPIcs.STACS.2011.129","ama":"Kolman P, Scheideler C. Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany. ; 2011:129--140. doi:10.4230/LIPIcs.STACS.2011.129"},"page":"129--140","title":"Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing","user_id":"15504","status":"public","date_created":"2018-03-29T08:44:00Z","author":[{"first_name":"Petr","full_name":"Kolman, Petr","last_name":"Kolman"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publication":"28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany","department":[{"_id":"79"}]},{"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-03-14T13:58:11Z","file_id":"1228","creator":"florida","file_size":268500,"access_level":"closed","date_created":"2018-03-14T13:58:11Z","file_name":"645-spaa70-scheideler.pdf"}],"author":[{"first_name":"Benjamin","full_name":"Doerr, Benjamin","last_name":"Doerr"},{"last_name":"Goldberg","first_name":"Leslie Ann","full_name":"Goldberg, Leslie Ann"},{"first_name":"Lorenz","full_name":"Minder, Lorenz","last_name":"Minder"},{"last_name":"Sauerwald","full_name":"Sauerwald, Thomas","first_name":"Thomas"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publication":"Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","department":[{"_id":"79"}],"file_date_updated":"2018-03-14T13:58:11Z","has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:57Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"abstract":[{"lang":"eng","text":"In the standard consensus problem there are n processes with possibly di®erent input values and the goal is to eventually reach a point at which all processes commit to exactly one of these values. We are studying a slight variant of the consensus problem called the stabilizing consensus problem [2]. In this problem, we do not require that each process commits to a ¯nal value at some point, but that eventually they arrive at a common, stable value without necessarily being aware of that. This should work irrespective of the states in which the processes are starting. Our main result is a simple randomized algorithm called median rule that, with high probability, just needs O(logmlog log n + log n) time and work per process to arrive at an almost stable consensus for any set of m legal values as long as an adversary can corrupt the states of at most p n processes at any time. Without adversarial involvement, just O(log n) time and work is needed for a stable consensus, with high probability. As a by-product, we obtain a simple distributed algorithm for approximating the median of n numbers in time O(logmlog log n + log n) under adversarial presence."}],"user_id":"15504","ddc":["040"],"title":"Stabilizing consensus with the power of two choices","type":"conference","year":"2011","citation":{"chicago":"Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler. “Stabilizing Consensus with the Power of Two Choices.” In Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 149–58, 2011. https://doi.org/10.1145/1989493.1989516.","apa":"Doerr, B., Goldberg, L. A., Minder, L., Sauerwald, T., & Scheideler, C. (2011). Stabilizing consensus with the power of two choices. In Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 149–158). https://doi.org/10.1145/1989493.1989516","ama":"Doerr B, Goldberg LA, Minder L, Sauerwald T, Scheideler C. Stabilizing consensus with the power of two choices. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ; 2011:149-158. doi:10.1145/1989493.1989516","bibtex":"@inproceedings{Doerr_Goldberg_Minder_Sauerwald_Scheideler_2011, title={Stabilizing consensus with the power of two choices}, DOI={10.1145/1989493.1989516}, booktitle={Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Doerr, Benjamin and Goldberg, Leslie Ann and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian}, year={2011}, pages={149–158} }","mla":"Doerr, Benjamin, et al. “Stabilizing Consensus with the Power of Two Choices.” Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2011, pp. 149–58, doi:10.1145/1989493.1989516.","short":"B. Doerr, L.A. Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2011, pp. 149–158.","ieee":"B. Doerr, L. A. Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Stabilizing consensus with the power of two choices,” in Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2011, pp. 149–158."},"page":"149-158","date_updated":"2022-01-06T07:03:05Z","_id":"645","doi":"10.1145/1989493.1989516"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"79"}],"title":"Self-Stabilizing DeBruijn Networks","series_title":"LNCS","doi":"10.1007/978-3-642-24550-3_31","date_updated":"2022-01-06T07:03:06Z","date_created":"2017-10-17T12:42:58Z","status":"public","has_accepted_license":"1","file":[{"access_level":"closed","date_created":"2018-03-14T13:57:26Z","file_name":"646-SSS2011-Scheideler_02.pdf","date_updated":"2018-03-14T13:57:26Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":339664,"creator":"florida","file_id":"1227"}],"file_date_updated":"2018-03-14T13:57:26Z","publication":"Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","author":[{"last_name":"Richa","full_name":"Richa, Andrea W.","first_name":"Andrea W."},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"user_id":"15504","ddc":["040"],"abstract":[{"lang":"eng","text":"This paper presents a dynamic overlay network based on the De Bruijn graph which we call Linearized De Bruijn (LDB) network. The LDB network has the advantage that it has a guaranteed constant node degree and that the routing between any two nodes takes at most O(log n) hops with high probability. Also, we show that there is a simple local-control algorithm that can recover the LDB network from any network topology that is weakly connected."}],"page":"416-430","year":"2011","type":"conference","citation":{"ieee":"A. W. Richa and C. Scheideler, “Self-Stabilizing DeBruijn Networks,” in Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 416–430.","short":"A.W. Richa, C. Scheideler, in: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 416–430.","bibtex":"@inproceedings{Richa_Scheideler_2011, series={LNCS}, title={Self-Stabilizing DeBruijn Networks}, DOI={10.1007/978-3-642-24550-3_31}, booktitle={Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, author={Richa, Andrea W. and Scheideler, Christian}, year={2011}, pages={416–430}, collection={LNCS} }","mla":"Richa, Andrea W., and Christian Scheideler. “Self-Stabilizing DeBruijn Networks.” Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 416–30, doi:10.1007/978-3-642-24550-3_31.","chicago":"Richa, Andrea W., and Christian Scheideler. “Self-Stabilizing DeBruijn Networks.” In Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 416–30. LNCS, 2011. https://doi.org/10.1007/978-3-642-24550-3_31.","apa":"Richa, A. W., & Scheideler, C. (2011). Self-Stabilizing DeBruijn Networks. In Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 416–430). https://doi.org/10.1007/978-3-642-24550-3_31","ama":"Richa AW, Scheideler C. Self-Stabilizing DeBruijn Networks. In: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). LNCS. ; 2011:416-430. doi:10.1007/978-3-642-24550-3_31"},"_id":"646"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}],"title":"Corona: A Stabilizing Deterministic Message-Passing Skip List","series_title":"LNCS","doi":"10.1007/978-3-642-24550-3_27","date_updated":"2022-01-06T07:03:13Z","has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:43:01Z","author":[{"last_name":"Nesterenko","full_name":"Nesterenko, Mikhail","first_name":"Mikhail"},{"last_name":"Mohd","first_name":"Rizal","full_name":"Mohd, Rizal"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file_date_updated":"2018-03-14T13:46:48Z","publication":"Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","file":[{"access_level":"closed","file_name":"662-SSS2011-Corona-Scheideler.pdf","date_created":"2018-03-14T13:46:48Z","relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-03-14T13:46:48Z","file_id":"1217","creator":"florida","file_size":305543}],"ddc":["040"],"user_id":"15504","abstract":[{"text":"We present Corona, a deterministic self-stabilizing algorithm for skip list construction in structured overlay networks. Corona operates in the low-atomicity message-passing asynchronous system model. Corona requires constant process memory space for its operation and, therefore, scales well. We prove the general necessary conditions limiting the initial states from which a self-stabilizing structured overlay network in message-passing system can be constructed. The conditions require that initial state information has to form a weakly connected graph and it should only contain identiers that are present in the system. We formally describe Corona and rigorously prove that it stabilizes from an arbitrary initial state subject to the necessary conditions. We extend Corona to construct a skip graph.","lang":"eng"}],"year":"2011","citation":{"ieee":"M. Nesterenko, R. Mohd, and C. Scheideler, “Corona: A Stabilizing Deterministic Message-Passing Skip List,” in Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 356--370.","short":"M. Nesterenko, R. Mohd, C. Scheideler, in: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 356--370.","bibtex":"@inproceedings{Nesterenko_Mohd_Scheideler_2011, series={LNCS}, title={Corona: A Stabilizing Deterministic Message-Passing Skip List}, DOI={10.1007/978-3-642-24550-3_27}, booktitle={Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, author={Nesterenko, Mikhail and Mohd, Rizal and Scheideler, Christian}, year={2011}, pages={356--370}, collection={LNCS} }","mla":"Nesterenko, Mikhail, et al. “Corona: A Stabilizing Deterministic Message-Passing Skip List.” Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 356--370, doi:10.1007/978-3-642-24550-3_27.","chicago":"Nesterenko, Mikhail, Rizal Mohd, and Christian Scheideler. “Corona: A Stabilizing Deterministic Message-Passing Skip List.” In Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 356--370. LNCS, 2011. https://doi.org/10.1007/978-3-642-24550-3_27.","ama":"Nesterenko M, Mohd R, Scheideler C. Corona: A Stabilizing Deterministic Message-Passing Skip List. In: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). LNCS. ; 2011:356--370. doi:10.1007/978-3-642-24550-3_27","apa":"Nesterenko, M., Mohd, R., & Scheideler, C. (2011). Corona: A Stabilizing Deterministic Message-Passing Skip List. In Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 356--370). https://doi.org/10.1007/978-3-642-24550-3_27"},"type":"conference","page":"356--370","_id":"662"},{"date_created":"2018-03-28T06:44:05Z","status":"public","publication":"Theor. Comput. Sci.","department":[{"_id":"79"}],"author":[{"last_name":"Dolev","full_name":"Dolev, Shlomi","first_name":"Shlomi"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"user_id":"15504","title":"Editorial for Algorithmic Aspects of Wireless Sensor Networks","page":"1","type":"journal_article","citation":{"apa":"Dolev, S., & Scheideler, C. (2012). Editorial for Algorithmic Aspects of Wireless Sensor Networks. Theor. Comput. Sci., 1. https://doi.org/10.1016/j.tcs.2012.07.012","ama":"Dolev S, Scheideler C. Editorial for Algorithmic Aspects of Wireless Sensor Networks. Theor Comput Sci. 2012:1. doi:10.1016/j.tcs.2012.07.012","chicago":"Dolev, Shlomi, and Christian Scheideler. “Editorial for Algorithmic Aspects of Wireless Sensor Networks.” Theor. Comput. Sci., 2012, 1. https://doi.org/10.1016/j.tcs.2012.07.012.","mla":"Dolev, Shlomi, and Christian Scheideler. “Editorial for Algorithmic Aspects of Wireless Sensor Networks.” Theor. Comput. Sci., 2012, p. 1, doi:10.1016/j.tcs.2012.07.012.","bibtex":"@article{Dolev_Scheideler_2012, title={Editorial for Algorithmic Aspects of Wireless Sensor Networks}, DOI={10.1016/j.tcs.2012.07.012}, journal={Theor. Comput. Sci.}, author={Dolev, Shlomi and Scheideler, Christian}, year={2012}, pages={1} }","short":"S. Dolev, C. Scheideler, Theor. Comput. Sci. (2012) 1.","ieee":"S. Dolev and C. Scheideler, “Editorial for Algorithmic Aspects of Wireless Sensor Networks,” Theor. Comput. Sci., p. 1, 2012."},"year":"2012","doi":"10.1016/j.tcs.2012.07.012","_id":"1882","date_updated":"2022-01-06T06:53:52Z"},{"volume":7484,"publication_identifier":{"isbn":["978-3-642-32819-0"]},"date_created":"2018-03-28T06:44:57Z","status":"public","publication":"Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings","department":[{"_id":"79"}],"author":[{"full_name":"Monien, Burkhard","first_name":"Burkhard","last_name":"Monien"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"Springer","title":"Selfish Distributed Optimization","user_id":"15504","page":"1--2","type":"conference","year":"2012","citation":{"ieee":"B. Monien and C. Scheideler, “Selfish Distributed Optimization,” in Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings, 2012, vol. 7484, pp. 1--2.","short":"B. Monien, C. Scheideler, in: Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings, Springer, 2012, pp. 1--2.","bibtex":"@inproceedings{Monien_Scheideler_2012, series={Lecture Notes in Computer Science}, title={Selfish Distributed Optimization}, volume={7484}, DOI={10.1007/978-3-642-32820-6_1}, booktitle={Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings}, publisher={Springer}, author={Monien, Burkhard and Scheideler, Christian}, year={2012}, pages={1--2}, collection={Lecture Notes in Computer Science} }","mla":"Monien, Burkhard, and Christian Scheideler. “Selfish Distributed Optimization.” Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings, vol. 7484, Springer, 2012, pp. 1--2, doi:10.1007/978-3-642-32820-6_1.","apa":"Monien, B., & Scheideler, C. (2012). Selfish Distributed Optimization. In Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings (Vol. 7484, pp. 1--2). Springer. https://doi.org/10.1007/978-3-642-32820-6_1","ama":"Monien B, Scheideler C. Selfish Distributed Optimization. In: Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings. Vol 7484. Lecture Notes in Computer Science. Springer; 2012:1--2. doi:10.1007/978-3-642-32820-6_1","chicago":"Monien, Burkhard, and Christian Scheideler. “Selfish Distributed Optimization.” In Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings, 7484:1--2. Lecture Notes in Computer Science. Springer, 2012. https://doi.org/10.1007/978-3-642-32820-6_1."},"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-642-32820-6_1","date_updated":"2022-01-06T06:53:52Z","_id":"1884","intvolume":" 7484"},{"file":[{"access_level":"closed","date_created":"2018-03-15T10:16:20Z","file_name":"570-Delaunay-Journal.pdf","date_updated":"2018-03-15T10:16:20Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":250051,"creator":"florida","file_id":"1272"}],"publisher":"Elsevier","author":[{"first_name":"Riko","full_name":"Jacob, Riko","last_name":"Jacob"},{"full_name":"Ritscher, Stephan","first_name":"Stephan","last_name":"Ritscher"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"}],"file_date_updated":"2018-03-15T10:16:20Z","publication":"Theoretical Computer Science","status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:43Z","abstract":[{"text":"This article studies the construction of self-stabilizing topologies for distributed systems. While recent research has focused on chain topologies where nodes need to be linearized with respect to their identiers, we explore a natural and relevant 2-dimensional generalization. In particular, we present a local self-stabilizing algorithm DStab which is based on the concept of \\local Delaunay graphs\" and which forwards temporary edges in greedy fashion reminiscent of compass routing. DStab constructs a Delaunay graph from any initial connected topology and in a distributed manner in time O(n3) in the worst-case; if the initial network contains the Delaunay graph, the convergence time is only O(n) rounds. DStab also ensures that individual node joins and leaves aect a small part of the network only. Such self-stabilizing Delaunay networks have interesting applications and our construction gives insights into the necessary geometric reasoning that is required for higherdimensional linearization problems.Keywords: Distributed Algorithms, Topology Control, Social Networks","lang":"eng"}],"user_id":"477","ddc":["040"],"year":"2012","citation":{"bibtex":"@article{Jacob_Ritscher_Scheideler_Schmid_2012, title={Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs}, DOI={10.1016/j.tcs.2012.07.029}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Jacob, Riko and Ritscher, Stephan and Scheideler, Christian and Schmid, Stefan}, year={2012}, pages={137–148} }","mla":"Jacob, Riko, et al. “Towards Higher-Dimensional Topological Self-Stabilization: A Distributed Algorithm for Delaunay Graphs.” Theoretical Computer Science, Elsevier, 2012, pp. 137–48, doi:10.1016/j.tcs.2012.07.029.","ama":"Jacob R, Ritscher S, Scheideler C, Schmid S. Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs. Theoretical Computer Science. 2012:137-148. doi:10.1016/j.tcs.2012.07.029","apa":"Jacob, R., Ritscher, S., Scheideler, C., & Schmid, S. (2012). Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs. Theoretical Computer Science, 137–148. https://doi.org/10.1016/j.tcs.2012.07.029","chicago":"Jacob, Riko, Stephan Ritscher, Christian Scheideler, and Stefan Schmid. “Towards Higher-Dimensional Topological Self-Stabilization: A Distributed Algorithm for Delaunay Graphs.” Theoretical Computer Science, 2012, 137–48. https://doi.org/10.1016/j.tcs.2012.07.029.","ieee":"R. Jacob, S. Ritscher, C. Scheideler, and S. Schmid, “Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs,” Theoretical Computer Science, pp. 137–148, 2012.","short":"R. Jacob, S. Ritscher, C. Scheideler, S. Schmid, Theoretical Computer Science (2012) 137–148."},"type":"journal_article","page":"137-148","_id":"570","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"title":"Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs","date_updated":"2022-01-06T07:02:36Z","doi":"10.1016/j.tcs.2012.07.029"},{"title":"Tiara: A self-stabilizing deterministic skip list and skip graph","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_updated":"2022-01-06T07:02:38Z","doi":"10.1016/j.tcs.2011.12.079","abstract":[{"lang":"eng","text":"We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and topology updates. It is based on a novel sparse 0-1 skip list. We then describe its extension to a ringed structure and to a skip-graph.Key words: Peer-to-peer networks, overlay networks, self-stabilization."}],"ddc":["040"],"user_id":"477","author":[{"last_name":"Clouser","first_name":"Thomas","full_name":"Clouser, Thomas"},{"first_name":"Mikhail","full_name":"Nesterenko, Mikhail","last_name":"Nesterenko"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publisher":"Elsevier","publication":"Theoretical Computer Science","file_date_updated":"2018-03-15T09:09:29Z","file":[{"access_level":"closed","date_created":"2018-03-15T09:09:29Z","file_name":"574-tiara.pdf","date_updated":"2018-03-15T09:09:29Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":315843,"creator":"florida","file_id":"1268"}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:44Z","_id":"574","type":"journal_article","citation":{"bibtex":"@article{Clouser_Nesterenko_Scheideler_2012, title={Tiara: A self-stabilizing deterministic skip list and skip graph}, DOI={10.1016/j.tcs.2011.12.079}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Clouser, Thomas and Nesterenko, Mikhail and Scheideler, Christian}, year={2012}, pages={18–35} }","mla":"Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List and Skip Graph.” Theoretical Computer Science, Elsevier, 2012, pp. 18–35, doi:10.1016/j.tcs.2011.12.079.","ama":"Clouser T, Nesterenko M, Scheideler C. Tiara: A self-stabilizing deterministic skip list and skip graph. Theoretical Computer Science. 2012:18-35. doi:10.1016/j.tcs.2011.12.079","apa":"Clouser, T., Nesterenko, M., & Scheideler, C. (2012). Tiara: A self-stabilizing deterministic skip list and skip graph. Theoretical Computer Science, 18–35. https://doi.org/10.1016/j.tcs.2011.12.079","chicago":"Clouser, Thomas, Mikhail Nesterenko, and Christian Scheideler. “Tiara: A Self-Stabilizing Deterministic Skip List and Skip Graph.” Theoretical Computer Science, 2012, 18–35. https://doi.org/10.1016/j.tcs.2011.12.079.","ieee":"T. Clouser, M. Nesterenko, and C. Scheideler, “Tiara: A self-stabilizing deterministic skip list and skip graph,” Theoretical Computer Science, pp. 18–35, 2012.","short":"T. Clouser, M. Nesterenko, C. Scheideler, Theoretical Computer Science (2012) 18–35."},"year":"2012","page":"18-35"},{"_id":"579","issue":"3","type":"journal_article","citation":{"bibtex":"@article{Damerow_Manthey_Meyer auf der Heide_Räcke_Scheideler_Sohler_Tantau_2012, title={Smoothed analysis of left-to-right maxima with applications}, DOI={10.1145/2229163.2229174}, number={3}, journal={Transactions on Algorithms}, publisher={ACM}, author={Damerow, Valentina and Manthey, Bodo and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian and Tantau, Till}, year={2012}, pages={30} }","mla":"Damerow, Valentina, et al. “Smoothed Analysis of Left-to-Right Maxima with Applications.” Transactions on Algorithms, no. 3, ACM, 2012, p. 30, doi:10.1145/2229163.2229174.","chicago":"Damerow, Valentina, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler, and Till Tantau. “Smoothed Analysis of Left-to-Right Maxima with Applications.” Transactions on Algorithms, no. 3 (2012): 30. https://doi.org/10.1145/2229163.2229174.","apa":"Damerow, V., Manthey, B., Meyer auf der Heide, F., Räcke, H., Scheideler, C., Sohler, C., & Tantau, T. (2012). Smoothed analysis of left-to-right maxima with applications. Transactions on Algorithms, (3), 30. https://doi.org/10.1145/2229163.2229174","ama":"Damerow V, Manthey B, Meyer auf der Heide F, et al. Smoothed analysis of left-to-right maxima with applications. Transactions on Algorithms. 2012;(3):30. doi:10.1145/2229163.2229174","ieee":"V. Damerow et al., “Smoothed analysis of left-to-right maxima with applications,” Transactions on Algorithms, no. 3, p. 30, 2012.","short":"V. Damerow, B. Manthey, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, T. Tantau, Transactions on Algorithms (2012) 30."},"year":"2012","page":"30","abstract":[{"lang":"eng","text":"A left-to-right maximum in a sequence of n numbers s_1, …, s_n is a number that is strictly larger than all preceding numbers. In this article we present a smoothed analysis of the number of left-to-right maxima in the presence of additive random noise. We show that for every sequence of n numbers s_i ∈ [0,1] that are perturbed by uniform noise from the interval [-ε,ε], the expected number of left-to-right maxima is Θ(&sqrt;n/ε + log n) for ε>1/n. For Gaussian noise with standard deviation σ we obtain a bound of O((log3/2 n)/σ + log n).We apply our results to the analysis of the smoothed height of binary search trees and the smoothed number of comparisons in the quicksort algorithm and prove bounds of Θ(&sqrt;n/ε + log n) and Θ(n/ε+1&sqrt;n/ε + n log n), respectively, for uniform random noise from the interval [-ε,ε]. Our results can also be applied to bound the smoothed number of points on a convex hull of points in the two-dimensional plane and to smoothed motion complexity, a concept we describe in this article. We bound how often one needs to update a data structure storing the smallest axis-aligned box enclosing a set of points moving in d-dimensional space."}],"ddc":["040"],"user_id":"477","publisher":"ACM","author":[{"last_name":"Damerow","first_name":"Valentina","full_name":"Damerow, Valentina"},{"full_name":"Manthey, Bodo","first_name":"Bodo","last_name":"Manthey"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Räcke","full_name":"Räcke, Harald","first_name":"Harald"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"},{"last_name":"Tantau","first_name":"Till","full_name":"Tantau, Till"}],"publication":"Transactions on Algorithms","file_date_updated":"2018-03-15T09:04:58Z","file":[{"access_level":"closed","file_name":"579-a30-damerow.pdf","date_created":"2018-03-15T09:04:58Z","content_type":"application/pdf","date_updated":"2018-03-15T09:04:58Z","success":1,"relation":"main_file","file_size":329282,"creator":"florida","file_id":"1266"}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:45Z","date_updated":"2022-01-06T07:02:41Z","doi":"10.1145/2229163.2229174","title":"Smoothed analysis of left-to-right maxima with applications","department":[{"_id":"79"},{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}]},{"department":[{"_id":"79"},{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"title":"Self-Organizing Particle Systems","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:02:42Z","doi":"10.1109/IPDPS.2012.116","file":[{"date_created":"2018-03-15T08:39:33Z","file_name":"581-IPDPS2012-Scheideler_Huellmann.pdf","access_level":"closed","file_size":373131,"creator":"florida","file_id":"1263","date_updated":"2018-03-15T08:39:33Z","content_type":"application/pdf","relation":"main_file","success":1}],"file_date_updated":"2018-03-15T08:39:33Z","publication":"Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)","author":[{"full_name":"Drees, Maximilian","first_name":"Maximilian","last_name":"Drees"},{"first_name":"Martina","full_name":"Hüllmann (married name: Eikel), Martina","last_name":"Hüllmann (married name: Eikel)"},{"first_name":"Andreas","full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"date_created":"2017-10-17T12:42:45Z","status":"public","has_accepted_license":"1","abstract":[{"lang":"eng","text":"Nanoparticles are getting more and more in the focus of the scientic community since the potential for the development of very small particles interacting with each other and completing medical and other tasks is getting bigger year by year. In this work we introduce a distributed local algorithm for arranging a set of nanoparticles on the discrete plane into specic geometric shapes, for instance a rectangle. The concept of a particle we use can be seen as a simple mobile robot with the following restrictions: it can only view the state of robots it is physically connected to, is anonymous, has only a constant size memory, can only move by using other particles as an anchor point on which it pulls itself alongside, and it operates in Look-Compute-Move cycles. The main result of this work is the presentation of a random distributed local algorithm which transforms any given connected set of particles into a particular geometric shape. As an example we provide a version of this algorithm for forming a rectangle with an arbitrary predened aspect ratio. To the best of our knowledge this is the rst work that considers arrangement problems for these types of robots."}],"user_id":"14955","ddc":["040"],"page":"1272-1283","type":"conference","year":"2012","citation":{"ieee":"M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, and C. Scheideler, “Self-Organizing Particle Systems,” in Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–1283.","short":"M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–1283.","mla":"Drees, Maximilian, et al. “Self-Organizing Particle Systems.” Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–83, doi:10.1109/IPDPS.2012.116.","bibtex":"@inproceedings{Drees_Hüllmann (married name: Eikel)_Koutsopoulos_Scheideler_2012, title={Self-Organizing Particle Systems}, DOI={10.1109/IPDPS.2012.116}, booktitle={Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Drees, Maximilian and Hüllmann (married name: Eikel), Martina and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012}, pages={1272–1283} }","chicago":"Drees, Maximilian, Martina Hüllmann (married name: Eikel), Andreas Koutsopoulos, and Christian Scheideler. “Self-Organizing Particle Systems.” In Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 1272–83, 2012. https://doi.org/10.1109/IPDPS.2012.116.","ama":"Drees M, Hüllmann (married name: Eikel) M, Koutsopoulos A, Scheideler C. Self-Organizing Particle Systems. In: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS). ; 2012:1272-1283. doi:10.1109/IPDPS.2012.116","apa":"Drees, M., Hüllmann (married name: Eikel), M., Koutsopoulos, A., & Scheideler, C. (2012). Self-Organizing Particle Systems. In Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 1272–1283). https://doi.org/10.1109/IPDPS.2012.116"},"_id":"581"},{"citation":{"ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and fair throughput for co-existing networks under adversarial interference,” in Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300.","short":"A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300.","bibtex":"@inproceedings{Richa_Scheideler_Schmid_Zhang_2012, title={Competitive and fair throughput for co-existing networks under adversarial interference}, DOI={10.1145/2332432.2332488}, booktitle={Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)}, author={Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin }, year={2012}, pages={291–300} }","mla":"Richa, Andrea W., et al. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300, doi:10.1145/2332432.2332488.","ama":"Richa AW, Scheideler C, Schmid S, Zhang J. Competitive and fair throughput for co-existing networks under adversarial interference. In: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC). ; 2012:291-300. doi:10.1145/2332432.2332488","apa":"Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2012). Competitive and fair throughput for co-existing networks under adversarial interference. In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC) (pp. 291–300). https://doi.org/10.1145/2332432.2332488","chicago":"Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin Zhang. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 291–300, 2012. https://doi.org/10.1145/2332432.2332488."},"year":"2012","type":"conference","page":"291-300","doi":"10.1145/2332432.2332488","_id":"623","date_updated":"2022-01-06T07:02:58Z","has_accepted_license":"1","status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"date_created":"2017-10-17T12:42:53Z","file":[{"file_size":210382,"file_id":"1241","creator":"florida","content_type":"application/pdf","date_updated":"2018-03-15T06:45:25Z","success":1,"relation":"main_file","file_name":"623-PODC-2012_01.pdf","date_created":"2018-03-15T06:45:25Z","access_level":"closed"}],"author":[{"last_name":"Richa","first_name":"Andrea W.","full_name":"Richa, Andrea W."},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"full_name":"Zhang, Jin ","first_name":"Jin ","last_name":"Zhang"}],"department":[{"_id":"79"}],"publication":"Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)","file_date_updated":"2018-03-15T06:45:25Z","user_id":"15504","ddc":["040"],"title":"Competitive and fair throughput for co-existing networks under adversarial interference","abstract":[{"lang":"eng","text":"This paper initiates the formal study of a fundamental problem: How to efficiently allocate a shared communication medium among a set of K co-existing networks in the presence of arbitrary external interference? While most literature on medium access focuses on how to share a medium among nodes, these approaches are often either not directly applicable to co-existing networks as they would violate the independence requirement, or they yield a low throughput if applied to multiple networks. We present the randomized medium access (MAC) protocol COMAC which guarantees that a given communication channel is shared fairly among competing and independent networks, and that the available bandwidth is used efficiently. These performance guarantees hold in the presence of arbitrary external interference or even under adversarial jamming. Concretely, we show that the co-existing networks can use a Ω(ε2 min{ε, 1/poly(K)})-fraction of the non-jammed time steps for successful message transmissions, where ε is the (arbitrarily distributed) fraction of time which is not jammed."}]},{"abstract":[{"text":"This paper initiates the study of self-adjusting distributed data structures for networks. In particular, we present SplayNets: a binary search tree based network that is self-adjusting to routing request.We derive entropy bounds on the amortized routing cost and show that our splaying algorithm has some interesting properties.","lang":"eng"}],"user_id":"15504","ddc":["040"],"file":[{"file_name":"625-disc12adjBAshort.pdf","date_created":"2018-03-15T06:44:09Z","access_level":"closed","file_id":"1240","creator":"florida","file_size":717284,"relation":"main_file","success":1,"date_updated":"2018-03-15T06:44:09Z","content_type":"application/pdf"}],"author":[{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"},{"last_name":"Avin","first_name":"Chen","full_name":"Avin, Chen"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Häupler","first_name":"Bernhard","full_name":"Häupler, Bernhard"},{"last_name":"Lotker","full_name":"Lotker, Zvi","first_name":"Zvi"}],"file_date_updated":"2018-03-15T06:44:09Z","publication":"Proceedings of the 26th International Symposium on Distributed Computing (DISC)","has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:53Z","_id":"625","citation":{"short":"S. Schmid, C. Avin, C. Scheideler, B. Häupler, Z. Lotker, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–440.","ieee":"S. Schmid, C. Avin, C. Scheideler, B. Häupler, and Z. Lotker, “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures,” in Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–440.","apa":"Schmid, S., Avin, C., Scheideler, C., Häupler, B., & Lotker, Z. (2012). Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In Proceedings of the 26th International Symposium on Distributed Computing (DISC) (pp. 439–440). https://doi.org/10.1007/978-3-642-33651-5_47","ama":"Schmid S, Avin C, Scheideler C, Häupler B, Lotker Z. Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In: Proceedings of the 26th International Symposium on Distributed Computing (DISC). LNCS. ; 2012:439-440. doi:10.1007/978-3-642-33651-5_47","chicago":"Schmid, Stefan, Chen Avin, Christian Scheideler, Bernhard Häupler, and Zvi Lotker. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” In Proceedings of the 26th International Symposium on Distributed Computing (DISC), 439–40. LNCS, 2012. https://doi.org/10.1007/978-3-642-33651-5_47.","mla":"Schmid, Stefan, et al. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–40, doi:10.1007/978-3-642-33651-5_47.","bibtex":"@inproceedings{Schmid_Avin_Scheideler_Häupler_Lotker_2012, series={LNCS}, title={Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures}, DOI={10.1007/978-3-642-33651-5_47}, booktitle={Proceedings of the 26th International Symposium on Distributed Computing (DISC)}, author={Schmid, Stefan and Avin, Chen and Scheideler, Christian and Häupler, Bernhard and Lotker, Zvi}, year={2012}, pages={439–440}, collection={LNCS} }"},"type":"conference","year":"2012","page":"439-440","title":"Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_updated":"2022-01-06T07:02:58Z","doi":"10.1007/978-3-642-33651-5_47","series_title":"LNCS"},{"series_title":"LNCS","date_updated":"2022-01-06T07:02:59Z","doi":"10.1007/978-3-642-33651-5_45","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"title":"Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems","citation":{"mla":"Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.” Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–36, doi:10.1007/978-3-642-33651-5_45.","bibtex":"@inproceedings{Kniesburges_Scheideler_2012, series={LNCS}, title={Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems}, DOI={10.1007/978-3-642-33651-5_45}, booktitle={Proceedings of the 26th International Symposium on Distributed Computing (DISC)}, author={Kniesburges, Sebastian and Scheideler, Christian}, year={2012}, pages={435–436}, collection={LNCS} }","chicago":"Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.” In Proceedings of the 26th International Symposium on Distributed Computing (DISC), 435–36. LNCS, 2012. https://doi.org/10.1007/978-3-642-33651-5_45.","ama":"Kniesburges S, Scheideler C. Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. In: Proceedings of the 26th International Symposium on Distributed Computing (DISC). LNCS. ; 2012:435-436. doi:10.1007/978-3-642-33651-5_45","apa":"Kniesburges, S., & Scheideler, C. (2012). Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. In Proceedings of the 26th International Symposium on Distributed Computing (DISC) (pp. 435–436). https://doi.org/10.1007/978-3-642-33651-5_45","ieee":"S. Kniesburges and C. Scheideler, “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems,” in Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–436.","short":"S. Kniesburges, C. Scheideler, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–436."},"year":"2012","type":"conference","page":"435-436","_id":"626","file":[{"access_level":"closed","date_created":"2018-03-15T06:42:40Z","file_name":"626-Predecessor-Kniesburges_Scheideler.pdf","content_type":"application/pdf","date_updated":"2018-03-15T06:42:40Z","success":1,"relation":"main_file","file_size":184095,"file_id":"1239","creator":"florida"}],"author":[{"last_name":"Kniesburges","full_name":"Kniesburges, Sebastian","first_name":"Sebastian"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publication":"Proceedings of the 26th International Symposium on Distributed Computing (DISC)","file_date_updated":"2018-03-15T06:42:40Z","status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:54Z","abstract":[{"text":"The design of ecient search structures for peer-to-peer systems has attracted a lot of attention in recent years. In this announcement we address the problem of nding the predecessor in a key set and present an ecient data structure called hashed Predecessor Patricia trie. Our hashed Predecessor Patricia trie supports PredecessorSearch(x) and Insert(x) and Delete(x) in O(log log u) hash table accesses when u is the size of the universe of the keys. That is the costs only depend on u and not the size of the data structure. One feature of our approach is that it only uses the lookup interface of the hash table and therefore hash table accesses may be realized by any distributed hash table (DHT).","lang":"eng"}],"user_id":"15504","ddc":["040"]},{"page":"800-810","citation":{"bibtex":"@inproceedings{Kolman_Scheideler_2012, title={Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case}, DOI={10.1137/1.9781611973099.64}, booktitle={Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)}, author={Kolman, Petr and Scheideler, Christian}, year={2012}, pages={800–810} }","mla":"Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case.” Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–10, doi:10.1137/1.9781611973099.64.","ama":"Kolman P, Scheideler C. Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case. In: Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA). ; 2012:800-810. doi:10.1137/1.9781611973099.64","apa":"Kolman, P., & Scheideler, C. (2012). Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case. In Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA) (pp. 800–810). https://doi.org/10.1137/1.9781611973099.64","chicago":"Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case.” In Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 800–810, 2012. https://doi.org/10.1137/1.9781611973099.64.","ieee":"P. Kolman and C. Scheideler, “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case,” in Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–810.","short":"P. Kolman, C. Scheideler, in: Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–810."},"type":"conference","year":"2012","doi":"10.1137/1.9781611973099.64","date_updated":"2022-01-06T07:03:01Z","_id":"632","date_created":"2017-10-17T12:42:55Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"status":"public","has_accepted_license":"1","publication":"Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)","file_date_updated":"2018-03-15T06:35:58Z","department":[{"_id":"79"}],"author":[{"last_name":"Kolman","first_name":"Petr","full_name":"Kolman, Petr"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file":[{"file_id":"1234","creator":"florida","file_size":220213,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-03-15T06:35:58Z","file_name":"632-SODA2012-Scheideler_01.pdf","date_created":"2018-03-15T06:35:58Z","access_level":"closed"}],"title":"Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case","ddc":["040"],"user_id":"15504","abstract":[{"lang":"eng","text":"Given an integer h, a graph G = (V;E) with arbitrary positive edge capacities and k pairs of vertices (s1; t1); (s2; t2); : : : ; (sk; tk), called terminals, an h-route cut is a set F µ E of edges such that after the removal of the edges in F no pair si ¡ ti is connected by h edge-disjoint paths (i.e., the connectivity of every si ¡ ti pair is at most h ¡ 1 in (V;E n F)). The h-route cut is a natural generalization of the classical cut problem for multicommodity °ows (take h = 1). The main result of this paper is an O(h722h log2 k)-approximation algorithm for the minimum h-route cut problem in the case that s1 = s2 = ¢ ¢ ¢ = sk, called the single source case. As a corollary of it we obtain an approximate duality theorem for multiroute multicom-modity °ows and cuts with a single source. This partially answers an open question posted in several previous papers dealing with cuts for multicommodity multiroute problems."}]},{"abstract":[{"lang":"eng","text":"Small-world networks have received significant attention because of their potential as models for the interaction networks of complex systems. Specifically, neither random networks nor regular lattices seem to be an adequate framework within which to study real-world complex systems such as chemical-reaction networks, neural networks, food webs, social networks, scientific-collaboration networks, and computer networks. Small-world networks provide some desired properties like an expected polylogarithmic distance between two processes in the network, which allows routing in polylogarithmic hops by simple greedy routing, and robustness against attacks or failures. By these properties, small-world networks are possible solutions for large overlay networks comparable to structured overlay networks like CAN, Pastry, Chord, which also provide polylogarithmic routing, but due to their uniform structure, structured overlay networks are more vulnerable to attacks or failures. In this paper we bring together a randomized process converging to a small-world network and a self-stabilization process so that a small-world network is formed out of any weakly connected initial state. To the best of our knowledge this is the first distributed self-stabilization process for building a small-world network."}],"user_id":"15504","title":"A Self-Stabilization Process for Small-World Networks","ddc":["040"],"file":[{"file_size":210176,"file_id":"1230","creator":"florida","date_updated":"2018-03-14T14:13:13Z","content_type":"application/pdf","success":1,"relation":"main_file","date_created":"2018-03-14T14:13:13Z","file_name":"640-IPDPS2012-Kniesb-Kouts-Scheideler.pdf","access_level":"closed"}],"department":[{"_id":"79"}],"publication":"Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)","file_date_updated":"2018-03-14T14:13:13Z","author":[{"last_name":"Kniesburges","full_name":"Kniesburges, Sebastian","first_name":"Sebastian"},{"last_name":"Koutsopoulos","first_name":"Andreas","full_name":"Koutsopoulos, Andreas"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2017-10-17T12:42:56Z","has_accepted_license":"1","status":"public","date_updated":"2022-01-06T07:03:04Z","_id":"640","doi":"10.1109/IPDPS.2012.115","page":"1261--1271","year":"2012","type":"conference","citation":{"bibtex":"@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2012, title={A Self-Stabilization Process for Small-World Networks}, DOI={10.1109/IPDPS.2012.115}, booktitle={Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012}, pages={1261--1271} }","mla":"Kniesburges, Sebastian, et al. “A Self-Stabilization Process for Small-World Networks.” Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271, doi:10.1109/IPDPS.2012.115.","apa":"Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2012). A Self-Stabilization Process for Small-World Networks. In Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 1261--1271). https://doi.org/10.1109/IPDPS.2012.115","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. A Self-Stabilization Process for Small-World Networks. In: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS). ; 2012:1261--1271. doi:10.1109/IPDPS.2012.115","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Self-Stabilization Process for Small-World Networks.” In Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 1261--1271, 2012. https://doi.org/10.1109/IPDPS.2012.115.","ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A Self-Stabilization Process for Small-World Networks,” in Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271.","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271."}},{"status":"public","date_created":"2018-03-28T06:31:02Z","author":[{"last_name":"W. Richa","full_name":"W. Richa, Andr{\\'{e}}a","first_name":"Andr{\\'{e}}a"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"},{"last_name":"Zhang","full_name":"Zhang, Jin","first_name":"Jin"}],"department":[{"_id":"79"}],"publication":"Distributed Computing","user_id":"15504","title":"Competitive throughput in multi-hop wireless networks despite adaptive jamming","citation":{"ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive throughput in multi-hop wireless networks despite adaptive jamming,” Distributed Computing, no. 3, pp. 159--171, 2013.","short":"A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, Distributed Computing (2013) 159--171.","bibtex":"@article{W. Richa_Scheideler_Schmid_Zhang_2013, title={Competitive throughput in multi-hop wireless networks despite adaptive jamming}, DOI={10.1007/s00446-012-0180-x}, number={3}, journal={Distributed Computing}, author={W. Richa, Andr{\\’{e}}a and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2013}, pages={159--171} }","mla":"W. Richa, Andr{\\’{e}}a, et al. “Competitive Throughput in Multi-Hop Wireless Networks despite Adaptive Jamming.” Distributed Computing, no. 3, 2013, pp. 159--171, doi:10.1007/s00446-012-0180-x.","chicago":"W. Richa, Andr{\\’{e}}a, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Competitive Throughput in Multi-Hop Wireless Networks despite Adaptive Jamming.” Distributed Computing, no. 3 (2013): 159--171. https://doi.org/10.1007/s00446-012-0180-x.","ama":"W. Richa A, Scheideler C, Schmid S, Zhang J. Competitive throughput in multi-hop wireless networks despite adaptive jamming. Distributed Computing. 2013;(3):159--171. doi:10.1007/s00446-012-0180-x","apa":"W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2013). Competitive throughput in multi-hop wireless networks despite adaptive jamming. Distributed Computing, (3), 159--171. https://doi.org/10.1007/s00446-012-0180-x"},"type":"journal_article","year":"2013","page":"159--171","issue":"3","doi":"10.1007/s00446-012-0180-x","date_updated":"2022-01-06T06:53:50Z","_id":"1868"},{"page":"119--129","type":"journal_article","year":"2013","citation":{"bibtex":"@article{Mohd Nor_Nesterenko_Scheideler_2013, title={Corona: A stabilizing deterministic message-passing skip list}, DOI={10.1016/j.tcs.2012.08.029}, journal={Theor. Comput. Sci.}, author={Mohd Nor, Rizal and Nesterenko, Mikhail and Scheideler, Christian}, year={2013}, pages={119--129} }","mla":"Mohd Nor, Rizal, et al. “Corona: A Stabilizing Deterministic Message-Passing Skip List.” Theor. Comput. Sci., 2013, pp. 119--129, doi:10.1016/j.tcs.2012.08.029.","chicago":"Mohd Nor, Rizal, Mikhail Nesterenko, and Christian Scheideler. “Corona: A Stabilizing Deterministic Message-Passing Skip List.” Theor. Comput. Sci., 2013, 119--129. https://doi.org/10.1016/j.tcs.2012.08.029.","ama":"Mohd Nor R, Nesterenko M, Scheideler C. Corona: A stabilizing deterministic message-passing skip list. Theor Comput Sci. 2013:119--129. doi:10.1016/j.tcs.2012.08.029","apa":"Mohd Nor, R., Nesterenko, M., & Scheideler, C. (2013). Corona: A stabilizing deterministic message-passing skip list. Theor. Comput. Sci., 119--129. https://doi.org/10.1016/j.tcs.2012.08.029","ieee":"R. Mohd Nor, M. Nesterenko, and C. Scheideler, “Corona: A stabilizing deterministic message-passing skip list,” Theor. Comput. Sci., pp. 119--129, 2013.","short":"R. Mohd Nor, M. Nesterenko, C. Scheideler, Theor. Comput. Sci. (2013) 119--129."},"date_updated":"2022-01-06T06:53:51Z","_id":"1870","doi":"10.1016/j.tcs.2012.08.029","department":[{"_id":"79"}],"publication":"Theor. Comput. Sci.","author":[{"first_name":"Rizal","full_name":"Mohd Nor, Rizal","last_name":"Mohd Nor"},{"last_name":"Nesterenko","first_name":"Mikhail","full_name":"Nesterenko, Mikhail"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2018-03-28T06:32:26Z","status":"public","user_id":"15504","title":"Corona: A stabilizing deterministic message-passing skip list"},{"doi":"10.1109/TNET.2012.2210241","issue":"3","_id":"1871","date_updated":"2022-01-06T06:53:51Z","citation":{"mla":"W. Richa, Andrea, et al. “An Efficient and Fair MAC Protocol Robust to Reactive Interference.” IEEE/ACM Trans. Netw., no. 3, 2013, pp. 760--771, doi:10.1109/TNET.2012.2210241.","bibtex":"@article{W. Richa_Scheideler_Schmid_Zhang_2013, title={An Efficient and Fair MAC Protocol Robust to Reactive Interference}, DOI={10.1109/TNET.2012.2210241}, number={3}, journal={IEEE/ACM Trans. Netw.}, author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2013}, pages={760--771} }","chicago":"W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “An Efficient and Fair MAC Protocol Robust to Reactive Interference.” IEEE/ACM Trans. Netw., no. 3 (2013): 760--771. https://doi.org/10.1109/TNET.2012.2210241.","apa":"W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2013). An Efficient and Fair MAC Protocol Robust to Reactive Interference. IEEE/ACM Trans. Netw., (3), 760--771. https://doi.org/10.1109/TNET.2012.2210241","ama":"W. Richa A, Scheideler C, Schmid S, Zhang J. An Efficient and Fair MAC Protocol Robust to Reactive Interference. IEEE/ACM Trans Netw. 2013;(3):760--771. doi:10.1109/TNET.2012.2210241","ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “An Efficient and Fair MAC Protocol Robust to Reactive Interference,” IEEE/ACM Trans. Netw., no. 3, pp. 760--771, 2013.","short":"A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, IEEE/ACM Trans. Netw. (2013) 760--771."},"year":"2013","type":"journal_article","page":"760--771","title":"An Efficient and Fair MAC Protocol Robust to Reactive Interference","user_id":"15504","status":"public","date_created":"2018-03-28T06:32:59Z","author":[{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"},{"last_name":"Zhang","first_name":"Jin","full_name":"Zhang, Jin"}],"department":[{"_id":"79"}],"publication":"IEEE/ACM Trans. Netw."},{"doi":"10.1007/s00224-013-9454-3","date_updated":"2022-01-06T07:01:21Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}],"title":"Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing","page":"341-363","type":"journal_article","citation":{"short":"P. Kolman, C. Scheideler, Theory of Computing Systems (2013) 341–363.","ieee":"P. Kolman and C. Scheideler, “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing,” Theory of Computing Systems, no. 2, pp. 341–363, 2013.","chicago":"Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.” Theory of Computing Systems, no. 2 (2013): 341–63. https://doi.org/10.1007/s00224-013-9454-3.","apa":"Kolman, P., & Scheideler, C. (2013). Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. Theory of Computing Systems, (2), 341–363. https://doi.org/10.1007/s00224-013-9454-3","ama":"Kolman P, Scheideler C. Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. Theory of Computing Systems. 2013;(2):341-363. doi:10.1007/s00224-013-9454-3","bibtex":"@article{Kolman_Scheideler_2013, title={Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing}, DOI={10.1007/s00224-013-9454-3}, number={2}, journal={Theory of Computing Systems}, publisher={Springer}, author={Kolman, Petr and Scheideler, Christian}, year={2013}, pages={341–363} }","mla":"Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.” Theory of Computing Systems, no. 2, Springer, 2013, pp. 341–63, doi:10.1007/s00224-013-9454-3."},"year":"2013","issue":"2","_id":"476","date_created":"2017-10-17T12:42:24Z","has_accepted_license":"1","status":"public","publication":"Theory of Computing Systems","file_date_updated":"2018-03-15T14:07:18Z","publisher":"Springer","author":[{"last_name":"Kolman","first_name":"Petr","full_name":"Kolman, Petr"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"creator":"florida","file_id":"1326","file_size":264308,"success":1,"relation":"main_file","date_updated":"2018-03-15T14:07:18Z","content_type":"application/pdf","date_created":"2018-03-15T14:07:18Z","file_name":"476-tocsrevised3b.pdf","access_level":"closed"}],"ddc":["040"],"user_id":"477","abstract":[{"text":"An elementary h-route ow, for an integer h 1, is a set of h edge- disjoint paths between a source and a sink, each path carrying a unit of ow, and an h-route ow is a non-negative linear combination of elementary h-routeows. An h-route cut is a set of edges whose removal decreases the maximum h-route ow between a given source-sink pair (or between every source-sink pair in the multicommodity setting) to zero. The main result of this paper is an approximate duality theorem for multicommodity h-route cuts and ows, for h 3: The size of a minimum h-route cut is at least f=h and at most O(log4 k f) where f is the size of the maximum h-routeow and k is the number of commodities. The main step towards the proof of this duality is the design and analysis of a polynomial-time approximation algorithm for the minimum h-route cut problem for h = 3 that has an approximation ratio of O(log4 k). Previously, polylogarithmic approximation was known only for h-route cuts for h 2. A key ingredient of our algorithm is a novel rounding technique that we call multilevel ball-growing. Though the proof of the duality relies on this algorithm, it is not a straightforward corollary of it as in the case of classical multicommodity ows and cuts. Similar results are shown also for the sparsest multiroute cut problem.","lang":"eng"}]},{"file":[{"file_name":"513-ipdps13_01.pdf","date_created":"2018-03-15T10:45:15Z","access_level":"closed","file_size":518804,"creator":"florida","file_id":"1303","date_updated":"2018-03-15T10:45:15Z","content_type":"application/pdf","relation":"main_file","success":1}],"author":[{"full_name":"Avin, Chen","first_name":"Chen","last_name":"Avin"},{"full_name":"Häupler, Bernhard","first_name":"Bernhard","last_name":"Häupler"},{"full_name":"Lotker, Zvi","first_name":"Zvi","last_name":"Lotker"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"}],"publication":"Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)","file_date_updated":"2018-03-15T10:45:15Z","department":[{"_id":"79"}],"status":"public","has_accepted_license":"1","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2017-10-17T12:42:32Z","abstract":[{"lang":"eng","text":"This paper initiates the study of self-adjusting networks (or distributed data structures) whose topologies dynamically adapt to a communication pattern $\\sigma$. We present a fully decentralized self-adjusting solution called SplayNet. A SplayNet is a distributed generalization of the classic splay tree concept. It ensures short paths (which can be found using local-greedy routing) between communication partners while minimizing topological rearrangements. We derive an upper bound for the amortized communication cost of a SplayNet based on empirical entropies of $\\sigma$, and show that SplayNets have several interesting convergence properties. For instance, SplayNets features a provable online optimality under special requests scenarios. We also investigate the optimal static network and prove different lower bounds for the average communication cost based on graph cuts and on the empirical entropy of the communication pattern $\\sigma$. From these lower bounds it follows, e.g., that SplayNets are optimal in scenarios where the requests follow a product distribution as well. Finally, this paper shows that in contrast to the Minimum Linear Arrangement problem which is generally NP-hard, the optimal static tree network can be computed in polynomial time for any guest graph, despite the exponentially large graph family. We complement our formal analysis with a small simulation study on a Facebook graph."}],"user_id":"15504","title":"Locally Self-Adjusting Tree Networks","ddc":["040"],"citation":{"mla":"Avin, Chen, et al. “Locally Self-Adjusting Tree Networks.” Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013, pp. 395–406, doi:10.1109/IPDPS.2013.40.","bibtex":"@inproceedings{Avin_Häupler_Lotker_Scheideler_Schmid_2013, title={Locally Self-Adjusting Tree Networks}, DOI={10.1109/IPDPS.2013.40}, booktitle={Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Avin, Chen and Häupler, Bernhard and Lotker, Zvi and Scheideler, Christian and Schmid, Stefan}, year={2013}, pages={395–406} }","chicago":"Avin, Chen, Bernhard Häupler, Zvi Lotker, Christian Scheideler, and Stefan Schmid. “Locally Self-Adjusting Tree Networks.” In Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 395–406, 2013. https://doi.org/10.1109/IPDPS.2013.40.","ama":"Avin C, Häupler B, Lotker Z, Scheideler C, Schmid S. Locally Self-Adjusting Tree Networks. In: Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS). ; 2013:395-406. doi:10.1109/IPDPS.2013.40","apa":"Avin, C., Häupler, B., Lotker, Z., Scheideler, C., & Schmid, S. (2013). Locally Self-Adjusting Tree Networks. In Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 395–406). https://doi.org/10.1109/IPDPS.2013.40","ieee":"C. Avin, B. Häupler, Z. Lotker, C. Scheideler, and S. Schmid, “Locally Self-Adjusting Tree Networks,” in Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013, pp. 395–406.","short":"C. Avin, B. Häupler, Z. Lotker, C. Scheideler, S. Schmid, in: Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013, pp. 395–406."},"type":"conference","year":"2013","page":"395-406","date_updated":"2022-01-06T07:01:38Z","_id":"513","doi":"10.1109/IPDPS.2013.40"},{"doi":"10.1145/2486159.2486186","date_updated":"2022-01-06T07:01:42Z","title":"IRIS: A Robust Information System Against Insider DoS-Attacks","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"79"}],"_id":"519","type":"conference","year":"2013","citation":{"mla":"Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS-Attacks.” Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013, pp. 119–29, doi:10.1145/2486159.2486186.","bibtex":"@inproceedings{Eikel_Scheideler_2013, title={IRIS: A Robust Information System Against Insider DoS-Attacks}, DOI={10.1145/2486159.2486186}, booktitle={Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Eikel, Martina and Scheideler, Christian}, year={2013}, pages={119–129} }","apa":"Eikel, M., & Scheideler, C. (2013). IRIS: A Robust Information System Against Insider DoS-Attacks. In Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 119–129). https://doi.org/10.1145/2486159.2486186","ama":"Eikel M, Scheideler C. IRIS: A Robust Information System Against Insider DoS-Attacks. In: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ; 2013:119-129. doi:10.1145/2486159.2486186","chicago":"Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS-Attacks.” In Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 119–29, 2013. https://doi.org/10.1145/2486159.2486186.","ieee":"M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider DoS-Attacks,” in Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013, pp. 119–129.","short":"M. Eikel, C. Scheideler, in: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013, pp. 119–129."},"page":"119-129","ddc":["040"],"user_id":"15504","abstract":[{"text":"In this work we present the first scalable distributed information system,i.e., a system with low storage overhead, that is provably robust againstDenial-of-Service (DoS) attacks by a current insider. We allow acurrent insider to have complete knowledge about the information systemand to have the power to block any \\epsilon-fraction of its serversby a DoS-attack, where \\epsilon can be chosen up to a constant. The taskof the system is to serve any collection of lookup requests with at most oneper non-blocked server in an efficient way despite this attack. Previously,scalable solutions were only known for DoS-attacks of past insiders, where apast insider only has complete knowledge about some past time pointt_0 of the information system. Scheideler et al. (DISC 2007, SPAA 2009) showedthat in this case it is possible to design an information system so that anyinformation that was inserted or last updated after t_0 is safe against a DoS-attack. But their constructions would not work at all for a current insider. The key idea behindour IRIS system is to make extensive use of coding. More precisely, we presenttwo alternative distributed coding strategies with an at most logarithmicstorage overhead that can handle up to a constant fraction of blocked servers.","lang":"eng"}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:33Z","author":[{"last_name":"Eikel","full_name":"Eikel, Martina","first_name":"Martina"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","file_date_updated":"2018-03-15T10:38:34Z","file":[{"access_level":"closed","file_name":"519-iris-spaa2013_01.pdf","date_created":"2018-03-15T10:38:34Z","date_updated":"2018-03-15T10:38:34Z","content_type":"application/pdf","success":1,"relation":"main_file","file_size":554618,"creator":"florida","file_id":"1299"}]},{"page":"537-549","year":"2013","citation":{"ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system,” in Proceedings of the 27th International Symposium on Distributed Computing (DISC), 2013, pp. 537–549.","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 27th International Symposium on Distributed Computing (DISC), 2013, pp. 537–549.","mla":"Kniesburges, Sebastian, et al. “CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System.” Proceedings of the 27th International Symposium on Distributed Computing (DISC), 2013, pp. 537–49, doi:10.1007/978-3-642-41527-2_37.","bibtex":"@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2013, series={LNCS}, title={CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system}, DOI={10.1007/978-3-642-41527-2_37}, booktitle={Proceedings of the 27th International Symposium on Distributed Computing (DISC)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2013}, pages={537–549}, collection={LNCS} }","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System.” In Proceedings of the 27th International Symposium on Distributed Computing (DISC), 537–49. LNCS, 2013. https://doi.org/10.1007/978-3-642-41527-2_37.","apa":"Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2013). CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system. In Proceedings of the 27th International Symposium on Distributed Computing (DISC) (pp. 537–549). https://doi.org/10.1007/978-3-642-41527-2_37","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system. In: Proceedings of the 27th International Symposium on Distributed Computing (DISC). LNCS. ; 2013:537-549. doi:10.1007/978-3-642-41527-2_37"},"type":"conference","_id":"542","publication":"Proceedings of the 27th International Symposium on Distributed Computing (DISC)","file_date_updated":"2018-03-15T10:32:48Z","author":[{"first_name":"Sebastian","full_name":"Kniesburges, Sebastian","last_name":"Kniesburges"},{"last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas","first_name":"Andreas"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file":[{"access_level":"closed","date_created":"2018-03-15T10:32:48Z","file_name":"542-CONE-DHT_A_distributed_self-stabilizing_algorithm_for_a_heterogeneous_storage_system.pdf","relation":"main_file","success":1,"date_updated":"2018-03-15T10:32:48Z","content_type":"application/pdf","file_id":"1289","creator":"florida","file_size":262302}],"date_created":"2017-10-17T12:42:38Z","has_accepted_license":"1","status":"public","abstract":[{"text":"We consider the problem of managing a dynamic heterogeneous storagesystem in a distributed way so that the amount of data assigned to a hostin that system is related to its capacity. Two central problems have to be solvedfor this: (1) organizing the hosts in an overlay network with low degree and diameterso that one can efficiently check the correct distribution of the data androute between any two hosts, and (2) distributing the data among the hosts so thatthe distribution respects the capacities of the hosts and can easily be adapted asthe set of hosts or their capacities change. We present distributed protocols forthese problems that are self-stabilizing and that do not need any global knowledgeabout the system such as the number of nodes or the overall capacity of thesystem. Prior to this work no solution was known satisfying these properties.","lang":"eng"}],"ddc":["040"],"user_id":"15504","series_title":"LNCS","date_updated":"2022-01-06T07:01:53Z","doi":"10.1007/978-3-642-41527-2_37","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"title":"CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system"}]