[{"_id":"1930","intvolume":" 5878","urn":"19304","year":"2009","citation":{"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.","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","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","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} }","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."},"type":"conference","page":"771--780","user_id":"15504","ddc":["040"],"status":"public","has_accepted_license":"1","date_created":"2018-03-29T09:12:59Z","volume":5878,"file":[{"file_size":139275,"file_id":"2342","creator":"florida","date_updated":"2018-04-13T10:05:53Z","content_type":"application/pdf","relation":"main_file","file_name":"isaac09.pdf","date_created":"2018-04-13T10:05:53Z","access_level":"open_access"}],"publisher":"Springer","author":[{"first_name":"Riko","full_name":"Jacob, Riko","last_name":"Jacob"},{"full_name":"Ritscher, Stephan","first_name":"Stephan","last_name":"Ritscher"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"}],"file_date_updated":"2018-04-13T10:05:53Z","publication":"Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings","oa":"1","doi":"10.1007/978-3-642-10631-6_78","date_updated":"2022-01-06T06:54:02Z","series_title":"Lecture Notes in Computer Science","title":"A Self-stabilizing and Local Delaunay Graph Construction","department":[{"_id":"79"}]},{"_id":"1932","date_updated":"2022-01-06T06:54:02Z","doi":"10.1145/1582716.1582741","citation":{"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.","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","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","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.","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} }","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.","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."},"year":"2009","type":"conference","page":"131--140","title":"A distributed polylogarithmic time algorithm for self-stabilizing skip graphs","user_id":"15504","author":[{"full_name":"Jacob, Riko","first_name":"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","first_name":"Stefan","full_name":"Schmid, Stefan"},{"full_name":"Täubig, Hanjo","first_name":"Hanjo","last_name":"Täubig"}],"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"}],"publication_identifier":{"isbn":["978-1-60558-396-9"]},"status":"public","date_created":"2018-03-29T09:16:22Z"},{"doi":"10.1145/1583991.1584064","_id":"1933","date_updated":"2022-01-06T06:54:02Z","year":"2009","citation":{"mla":"Baumgart, Matthias, et al. “A DoS-Resilient Information System for Dynamic Data Management.” SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, 2009, pp. 300--309, doi:10.1145/1583991.1584064.","bibtex":"@inproceedings{Baumgart_Scheideler_Schmid_2009, title={A DoS-resilient information system for dynamic data management}, DOI={10.1145/1583991.1584064}, booktitle={SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009}, author={Baumgart, Matthias and Scheideler, Christian and Schmid, Stefan}, year={2009}, pages={300--309} }","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","ieee":"M. Baumgart, C. Scheideler, and S. Schmid, “A DoS-resilient information system for dynamic data management,” in SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, 2009, pp. 300--309.","short":"M. Baumgart, C. Scheideler, S. Schmid, in: SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, 2009, pp. 300--309."},"type":"conference","page":"300--309","user_id":"15504","title":"A DoS-resilient information system for dynamic data management","status":"public","date_created":"2018-03-29T09:18:06Z","publication_identifier":{"isbn":["978-1-60558-606-9"]},"author":[{"last_name":"Baumgart","full_name":"Baumgart, Matthias","first_name":"Matthias"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"}],"publication":"SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009","department":[{"_id":"79"}]},{"date_updated":"2022-01-06T06:54:02Z","_id":"1934","intvolume":" 5873","doi":"10.1007/978-3-642-05118-0_58","series_title":"Lecture Notes in Computer Science","year":"2009","type":"conference","citation":{"short":"D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, Springer, 2009, pp. 781--782.","ieee":"D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization,” in Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, 2009, vol. 5873, pp. 781--782.","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","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.","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.","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} }"},"page":"781--782","title":"Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization","user_id":"15504","author":[{"last_name":"Gall","first_name":"Dominik","full_name":"Gall, Dominik"},{"full_name":"Jacob, Riko","first_name":"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"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"last_name":"Täubig","first_name":"Hanjo","full_name":"Täubig, Hanjo"}],"publisher":"Springer","publication":"Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings","department":[{"_id":"79"}],"volume":5873,"publication_identifier":{"isbn":["978-3-642-05117-3"]},"status":"public","date_created":"2018-03-29T09:19:17Z"},{"user_id":"15504","title":"Stabilizing Consensus with the Power of Two Choices","status":"public","date_created":"2018-03-29T09:20:44Z","volume":"09371","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany","author":[{"last_name":"Doerr","first_name":"Benjamin","full_name":"Doerr, Benjamin"},{"last_name":"Ann Goldberg","first_name":"Leslie","full_name":"Ann Goldberg, Leslie"},{"last_name":"Minder","full_name":"Minder, Lorenz","first_name":"Lorenz"},{"last_name":"Sauerwald","first_name":"Thomas","full_name":"Sauerwald, Thomas"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"department":[{"_id":"79"}],"publication":"Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009","doi":"10.1145/1989493.1989516","intvolume":" 9371","_id":"1935","date_updated":"2022-01-06T06:54:02Z","citation":{"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","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.","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.","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} }","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.","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."},"type":"conference","year":"2009","series_title":"Dagstuhl Seminar Proceedings"},{"title":"Algorithmische Grundlagen verteilter Speichersysteme","user_id":"14955","publication":"Informatik Spektrum","department":[{"_id":"79"},{"_id":"63"}],"author":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2018-03-28T07:21:50Z","status":"public","_id":"1903","date_updated":"2022-01-06T06:53:57Z","doi":"10.1007/s00287-010-0470-2","issue":"5","page":"468--474","type":"journal_article","citation":{"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.","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","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","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.","short":"F. Meyer auf der Heide, C. Scheideler, Informatik Spektrum (2010) 468--474.","ieee":"F. Meyer auf der Heide and C. Scheideler, “Algorithmische Grundlagen verteilter Speichersysteme,” Informatik Spektrum, no. 5, pp. 468--474, 2010."},"year":"2010","language":[{"iso":"eng"}]},{"page":"809--810","year":"2010","type":"journal_article","citation":{"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.","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","ama":"Gavoille C, Patt-Shamir B, Scheideler C. Foreword. Theory of Computing Systems. 2010;(4):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} }","mla":"Gavoille, Cyril, et al. “Foreword.” Theory of Computing Systems, no. 4, 2010, pp. 809--810, doi:10.1007/s00224-010-9284-5.","short":"C. Gavoille, B. Patt-Shamir, C. Scheideler, Theory of Computing Systems (2010) 809--810.","ieee":"C. Gavoille, B. Patt-Shamir, and C. Scheideler, “Foreword,” Theory of Computing Systems, no. 4, pp. 809--810, 2010."},"doi":"10.1007/s00224-010-9284-5","issue":"4","_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":[{"last_name":"Gavoille","full_name":"Gavoille, Cyril","first_name":"Cyril"},{"last_name":"Patt-Shamir","first_name":"Boaz","full_name":"Patt-Shamir, Boaz"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"title":"Foreword","user_id":"15504"},{"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","publisher":"Springer","author":[{"first_name":"Dominik","full_name":"Gall, 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"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"},{"first_name":"Hanjo","full_name":"Täubig, Hanjo","last_name":"Täubig"}],"date_created":"2018-03-28T07:22:42Z","status":"public","publication_identifier":{"isbn":["978-3-642-12199-9"]},"volume":6034,"date_updated":"2022-01-06T06:53:57Z","_id":"1905","intvolume":" 6034","doi":"10.1007/978-3-642-12200-2_27","series_title":"Lecture Notes in Computer Science","page":"294--305","year":"2010","citation":{"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.","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","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","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."},"type":"conference"},{"title":"Brief announcement: towards robust medium access in multi-hop networks","user_id":"15504","publication_identifier":{"isbn":["978-1-60558-888-9"]},"status":"public","date_created":"2018-03-28T07:23:32Z","publisher":"ACM","author":[{"last_name":"Richa","first_name":"Andrea W.","full_name":"Richa, Andrea W."},{"last_name":"Zhang","first_name":"Jin","full_name":"Zhang, Jin"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"}],"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","_id":"1906","date_updated":"2022-01-06T06:53:57Z","year":"2010","citation":{"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.","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.","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.","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} }","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.","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","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"},"type":"conference","page":"114--115"},{"doi":"10.1007/978-3-642-15763-9_17","_id":"1907","intvolume":" 6343","date_updated":"2022-01-06T06:53:58Z","type":"conference","year":"2010","citation":{"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.","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","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.","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.","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."},"page":"179--193","series_title":"Lecture Notes in Computer Science","user_id":"15504","title":"A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks","status":"public","date_created":"2018-03-28T07:24:22Z","volume":6343,"publication_identifier":{"isbn":["978-3-642-15762-2"]},"publisher":"Springer","author":[{"last_name":"Richa","first_name":"Andrea W.","full_name":"Richa, Andrea W."},{"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, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings"},{"date_created":"2018-03-28T07:25:45Z","status":"public","volume":6343,"publication":"Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings","department":[{"_id":"79"}],"author":[{"last_name":"Doerr","first_name":"Benjamin","full_name":"Doerr, Benjamin"},{"last_name":"Ann Goldberg","first_name":"Leslie","full_name":"Ann Goldberg, Leslie"},{"first_name":"Lorenz","full_name":"Minder, Lorenz","last_name":"Minder"},{"full_name":"Sauerwald, Thomas","first_name":"Thomas","last_name":"Sauerwald"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"Springer","user_id":"15504","title":"Brief Announcement: Stabilizing Consensus with the Power of Two Choices","page":"528--530","citation":{"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.","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.","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.","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."},"type":"conference","year":"2010","series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-642-15763-9_50","_id":"1908","date_updated":"2022-01-06T06:53:58Z","intvolume":" 6343"},{"date_created":"2018-03-28T07:08:13Z","status":"public","publication_identifier":{"isbn":["978-0-7695-4364-2"]},"department":[{"_id":"79"}],"publication":"2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011","author":[{"last_name":"W. Richa","full_name":"W. Richa, Andrea","first_name":"Andrea"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"},{"last_name":"Zhang","first_name":"Jin","full_name":"Zhang, Jin"}],"publisher":"IEEE Computer Society","user_id":"15504","title":"Competitive and Fair Medium Access Despite Reactive Jamming","page":"507--516","year":"2011","citation":{"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.","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.","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} }","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.","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","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"},"type":"conference","doi":"10.1109/ICDCS.2011.8","date_updated":"2022-01-06T06:53:54Z","_id":"1891"},{"year":"2011","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.","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","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","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} }"},"type":"conference","page":"33--36","_id":"1892","date_updated":"2022-01-06T06:53:54Z","doi":"10.1145/2030686.2030697","publisher":"ACM","author":[{"last_name":"W. Richa","full_name":"W. Richa, Andrea","first_name":"Andrea"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"last_name":"Zhang","full_name":"Zhang, Jin","first_name":"Jin"}],"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","publication_identifier":{"isbn":["978-1-4503-0868-7"]},"status":"public","date_created":"2018-03-28T07:09:07Z","title":"Towards jamming-resistant and competitive medium access in the SINR model","user_id":"15504"},{"author":[{"first_name":"Andrea","full_name":"W. Richa, Andrea","last_name":"W. Richa"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"last_name":"Zhang","first_name":"Jin","full_name":"Zhang, Jin"}],"publisher":"ACM","publication":"Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011","department":[{"_id":"79"}],"publication_identifier":{"isbn":["978-1-4503-0722-2"]},"status":"public","date_created":"2018-03-28T07:09:54Z","title":"Self-stabilizing leader election for single-hop wireless networks despite jamming","user_id":"15504","year":"2011","citation":{"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.","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.","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.","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} }","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.","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"},"type":"conference","page":"15","_id":"1893","date_updated":"2022-01-06T06:53:54Z","doi":"10.1145/2107502.2107522"},{"page":"235--244","type":"conference","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.","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} }","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.","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.","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","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"},"year":"2011","doi":"10.1145/1989493.1989527","date_updated":"2022-01-06T06:53:55Z","_id":"1895","date_created":"2018-03-28T07:12:49Z","status":"public","publication_identifier":{"isbn":["978-1-4503-0743-7"]},"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":[{"first_name":"Sebastian","full_name":"Kniesburges, Sebastian","last_name":"Kniesburges"},{"full_name":"Koutsopoulos, Andreas","first_name":"Andreas","last_name":"Koutsopoulos"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"user_id":"15504","title":"Re-Chord: a self-stabilizing chord overlay network"},{"user_id":"15504","title":"Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems","status":"public","date_created":"2018-03-28T07:17:05Z","volume":6552,"publication_identifier":{"isbn":["978-3-642-19093-3"]},"author":[{"last_name":"Kniesburges","full_name":"Kniesburges, Sebastian","first_name":"Sebastian"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publisher":"Springer","department":[{"_id":"79"}],"publication":"WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings","doi":"10.1007/978-3-642-19094-0_18","date_updated":"2022-01-06T06:53:56Z","_id":"1899","intvolume":" 6552","year":"2011","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.","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","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"},"type":"conference","page":"170--181","series_title":"Lecture Notes in Computer Science"},{"date_updated":"2022-01-06T06:53:57Z","_id":"1900","doi":"10.1007/978-1-4614-1168-0_9","type":"book_chapter","year":"2011","citation":{"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.","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","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","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.","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} }","short":"C. Scheideler, K. Graffi, in: Computer Science, The Hardware, Software and Heart of It, Springer, 2011, pp. 155--168.","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."},"page":"155--168","title":"Programming for Distributed Computing: From Physical to Logical Networks","user_id":"15504","publisher":"Springer","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Graffi","first_name":"Kalman","full_name":"Graffi, Kalman"}],"department":[{"_id":"79"}],"publication":"Computer Science, The Hardware, Software and Heart of It","publication_identifier":{"isbn":["978-1-4614-1167-3"]},"status":"public","date_created":"2018-03-28T07:17:53Z"},{"doi":"10.1007/978-3-642-15328-0_22","date_updated":"2022-01-06T06:53:57Z","_id":"1901","page":"223--229","year":"2011","type":"book_chapter","citation":{"short":"C. Scheideler, in: Algorithms Unplugged, Springer, 2011, pp. 223--229.","ieee":"C. Scheideler, “Broadcasting - How Can I Quickly Disseminate Information?,” in Algorithms Unplugged, Springer, 2011, pp. 223--229.","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.","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."},"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","publication":"Algorithms Unplugged","department":[{"_id":"79"}],"author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publisher":"Springer"},{"user_id":"15504","title":"Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing","publication":"28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany","department":[{"_id":"79"}],"author":[{"first_name":"Petr","full_name":"Kolman, Petr","last_name":"Kolman"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2018-03-29T08:44:00Z","status":"public","_id":"1924","date_updated":"2022-01-06T06:54:00Z","doi":"10.4230/LIPIcs.STACS.2011.129","page":"129--140","year":"2011","citation":{"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.","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.","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","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.","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.","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} }"},"type":"conference"},{"doi":"10.1145/1989493.1989516","_id":"645","date_updated":"2022-01-06T07:03:05Z","citation":{"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.","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","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.","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.","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."},"year":"2011","type":"conference","page":"149-158","ddc":["040"],"title":"Stabilizing consensus with the power of two choices","user_id":"15504","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."}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:57Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"author":[{"first_name":"Benjamin","full_name":"Doerr, Benjamin","last_name":"Doerr"},{"full_name":"Goldberg, Leslie Ann","first_name":"Leslie Ann","last_name":"Goldberg"},{"last_name":"Minder","first_name":"Lorenz","full_name":"Minder, Lorenz"},{"last_name":"Sauerwald","first_name":"Thomas","full_name":"Sauerwald, Thomas"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"department":[{"_id":"79"}],"publication":"Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","file_date_updated":"2018-03-14T13:58:11Z","file":[{"file_size":268500,"file_id":"1228","creator":"florida","content_type":"application/pdf","date_updated":"2018-03-14T13:58:11Z","relation":"main_file","success":1,"file_name":"645-spaa70-scheideler.pdf","date_created":"2018-03-14T13:58:11Z","access_level":"closed"}]}]