--- _id: '1895' author: - first_name: Sebastian full_name: Kniesburges, Sebastian last_name: Kniesburges - first_name: Andreas full_name: Koutsopoulos, Andreas last_name: Koutsopoulos - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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' 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} }' 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.' 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.' 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.' 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.' date_created: 2018-03-28T07:12:49Z date_updated: 2022-01-06T06:53:55Z department: - _id: '79' doi: 10.1145/1989493.1989527 page: 235--244 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)' publication_identifier: isbn: - 978-1-4503-0743-7 status: public title: 'Re-Chord: a self-stabilizing chord overlay network' type: conference user_id: '15504' year: '2011' ... --- _id: '1899' author: - first_name: Sebastian full_name: Kniesburges, Sebastian last_name: Kniesburges - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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' 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.' 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.' 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.' 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.' date_created: 2018-03-28T07:17:05Z date_updated: 2022-01-06T06:53:56Z department: - _id: '79' doi: 10.1007/978-3-642-19094-0_18 intvolume: ' 6552' page: 170--181 publication: 'WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings' publication_identifier: isbn: - 978-3-642-19093-3 publisher: Springer series_title: Lecture Notes in Computer Science status: public title: 'Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems' type: conference user_id: '15504' volume: 6552 year: '2011' ... --- _id: '1900' author: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Kalman full_name: Graffi, Kalman last_name: Graffi citation: 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' 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} }' 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.' 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.' short: 'C. Scheideler, K. Graffi, in: Computer Science, The Hardware, Software and Heart of It, Springer, 2011, pp. 155--168.' date_created: 2018-03-28T07:17:53Z date_updated: 2022-01-06T06:53:57Z department: - _id: '79' doi: 10.1007/978-1-4614-1168-0_9 page: 155--168 publication: Computer Science, The Hardware, Software and Heart of It publication_identifier: isbn: - 978-1-4614-1167-3 publisher: Springer status: public title: 'Programming for Distributed Computing: From Physical to Logical Networks' type: book_chapter user_id: '15504' year: '2011' ... --- _id: '1901' author: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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 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} }' 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. 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. short: 'C. Scheideler, in: Algorithms Unplugged, Springer, 2011, pp. 223--229.' date_created: 2018-03-28T07:18:43Z date_updated: 2022-01-06T06:53:57Z department: - _id: '79' doi: 10.1007/978-3-642-15328-0_22 page: 223--229 publication: Algorithms Unplugged publication_identifier: isbn: - 978-3-642-15327-3 publisher: Springer status: public title: Broadcasting - How Can I Quickly Disseminate Information? type: book_chapter user_id: '15504' year: '2011' ... --- _id: '1924' author: - first_name: Petr full_name: Kolman, Petr last_name: Kolman - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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' 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' 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} }' 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.' 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.' 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.' 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.' date_created: 2018-03-29T08:44:00Z date_updated: 2022-01-06T06:54:00Z department: - _id: '79' doi: 10.4230/LIPIcs.STACS.2011.129 page: 129--140 publication: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany status: public title: 'Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing' type: conference user_id: '15504' year: '2011' ... --- _id: '645' 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. author: - first_name: Benjamin full_name: Doerr, Benjamin last_name: Doerr - first_name: Leslie Ann full_name: Goldberg, Leslie Ann last_name: Goldberg - first_name: Lorenz full_name: Minder, Lorenz last_name: Minder - first_name: Thomas full_name: Sauerwald, Thomas last_name: Sauerwald - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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' 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 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} }' 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. 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.' date_created: 2017-10-17T12:42:57Z date_updated: 2022-01-06T07:03:05Z ddc: - '040' department: - _id: '79' doi: 10.1145/1989493.1989516 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-14T13:58:11Z date_updated: 2018-03-14T13:58:11Z file_id: '1228' file_name: 645-spaa70-scheideler.pdf file_size: 268500 relation: main_file success: 1 file_date_updated: 2018-03-14T13:58:11Z has_accepted_license: '1' page: 149-158 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) status: public title: Stabilizing consensus with the power of two choices type: conference user_id: '15504' year: '2011' ... --- _id: '646' 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. author: - first_name: Andrea W. full_name: Richa, Andrea W. last_name: Richa - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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' 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 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} }' 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. 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. 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. 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.' date_created: 2017-10-17T12:42:58Z date_updated: 2022-01-06T07:03:06Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-642-24550-3_31 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-14T13:57:26Z date_updated: 2018-03-14T13:57:26Z file_id: '1227' file_name: 646-SSS2011-Scheideler_02.pdf file_size: 339664 relation: main_file success: 1 file_date_updated: 2018-03-14T13:57:26Z has_accepted_license: '1' page: 416-430 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) series_title: LNCS status: public title: Self-Stabilizing DeBruijn Networks type: conference user_id: '15504' year: '2011' ... --- _id: '662' abstract: - lang: eng 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. author: - first_name: Mikhail full_name: Nesterenko, Mikhail last_name: Nesterenko - first_name: Rizal full_name: Mohd, Rizal last_name: Mohd - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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' 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} }' 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.' 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.' 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.' 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.' date_created: 2017-10-17T12:43:01Z date_updated: 2022-01-06T07:03:13Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-642-24550-3_27 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-14T13:46:48Z date_updated: 2018-03-14T13:46:48Z file_id: '1217' file_name: 662-SSS2011-Corona-Scheideler.pdf file_size: 305543 relation: main_file success: 1 file_date_updated: 2018-03-14T13:46:48Z has_accepted_license: '1' page: 356--370 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) series_title: LNCS status: public title: 'Corona: A Stabilizing Deterministic Message-Passing Skip List' type: conference user_id: '15504' year: '2011' ... --- _id: '1903' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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 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} }' 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. 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. date_created: 2018-03-28T07:21:50Z date_updated: 2022-01-06T06:53:57Z department: - _id: '79' - _id: '63' doi: 10.1007/s00287-010-0470-2 issue: '5' language: - iso: eng page: 468--474 publication: Informatik Spektrum status: public title: Algorithmische Grundlagen verteilter Speichersysteme type: journal_article user_id: '14955' year: '2010' ... --- _id: '1904' author: - first_name: Cyril full_name: Gavoille, Cyril last_name: Gavoille - first_name: Boaz full_name: Patt-Shamir, Boaz last_name: Patt-Shamir - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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 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.' ieee: C. Gavoille, B. Patt-Shamir, and C. Scheideler, “Foreword,” Theory of Computing Systems, no. 4, pp. 809--810, 2010. 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. date_created: 2018-03-28T07:22:21Z date_updated: 2022-01-06T06:53:57Z department: - _id: '79' doi: 10.1007/s00224-010-9284-5 issue: '4' page: 809--810 publication: Theory of Computing Systems status: public title: Foreword type: journal_article user_id: '15504' year: '2010' ...