[{"date_created":"2018-03-28T07:19:31Z","type":"book","department":[{"_id":"79"}],"citation":{"ieee":"B. Vöcking <i>et al.</i>, <i>Algorithms Unplugged</i>. 2011.","apa":"Vöcking, B., Alt, H., Dietzfelbinger, M., Reischuk, R., Scheideler, C., Vollmer, H., &#38; Wagner, D. (2011). <i>Algorithms Unplugged</i>. <a href=\"https://doi.org/10.1007/978-3-642-15328-0\">https://doi.org/10.1007/978-3-642-15328-0</a>","short":"B. Vöcking, H. Alt, M. Dietzfelbinger, R. Reischuk, C. Scheideler, H. Vollmer, D. Wagner, Algorithms Unplugged, 2011.","chicago":"Vöcking, Berthold, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, and Dorothea Wagner. <i>Algorithms Unplugged</i>, 2011. <a href=\"https://doi.org/10.1007/978-3-642-15328-0\">https://doi.org/10.1007/978-3-642-15328-0</a>.","mla":"Vöcking, Berthold, et al. <i>Algorithms Unplugged</i>. 2011, doi:<a href=\"https://doi.org/10.1007/978-3-642-15328-0\">10.1007/978-3-642-15328-0</a>.","bibtex":"@book{Vöcking_Alt_Dietzfelbinger_Reischuk_Scheideler_Vollmer_Wagner_2011, title={Algorithms Unplugged}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-15328-0\">10.1007/978-3-642-15328-0</a>}, author={Vöcking, Berthold and Alt, Helmut and Dietzfelbinger, Martin and Reischuk, Rüdiger and Scheideler, Christian and Vollmer, Heribert and Wagner, Dorothea}, year={2011} }","ama":"Vöcking B, Alt H, Dietzfelbinger M, et al. <i>Algorithms Unplugged</i>.; 2011. doi:<a href=\"https://doi.org/10.1007/978-3-642-15328-0\">10.1007/978-3-642-15328-0</a>"},"_id":"1902","doi":"10.1007/978-3-642-15328-0","user_id":"15504","title":"Algorithms Unplugged","year":"2011","status":"public","author":[{"first_name":"Berthold","last_name":"Vöcking","full_name":"Vöcking, Berthold"},{"last_name":"Alt","first_name":"Helmut","full_name":"Alt, Helmut"},{"full_name":"Dietzfelbinger, Martin","last_name":"Dietzfelbinger","first_name":"Martin"},{"first_name":"Rüdiger","last_name":"Reischuk","full_name":"Reischuk, Rüdiger"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"},{"full_name":"Vollmer, Heribert","last_name":"Vollmer","first_name":"Heribert"},{"last_name":"Wagner","first_name":"Dorothea","full_name":"Wagner, Dorothea"}],"publication_identifier":{"isbn":["978-3-642-15327-3"]},"date_updated":"2022-01-06T06:53:57Z"},{"author":[{"last_name":"Kolman","first_name":"Petr","full_name":"Kolman, Petr"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"year":"2011","status":"public","title":"Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing","date_updated":"2022-01-06T06:54:00Z","_id":"1924","page":"129--140","doi":"10.4230/LIPIcs.STACS.2011.129","user_id":"15504","citation":{"bibtex":"@inproceedings{Kolman_Scheideler_2011, title={Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2011.129\">10.4230/LIPIcs.STACS.2011.129</a>}, 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} }","ama":"Kolman P, Scheideler C. Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. In: <i>28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany</i>. ; 2011:129--140. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2011.129\">10.4230/LIPIcs.STACS.2011.129</a>","mla":"Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.” <i>28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany</i>, 2011, pp. 129--140, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2011.129\">10.4230/LIPIcs.STACS.2011.129</a>.","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.","chicago":"Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.” In <i>28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany</i>, 129--140, 2011. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2011.129\">https://doi.org/10.4230/LIPIcs.STACS.2011.129</a>.","ieee":"P. Kolman and C. Scheideler, “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing,” in <i>28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany</i>, 2011, pp. 129--140.","apa":"Kolman, P., &#38; Scheideler, C. (2011). Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. In <i>28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany</i> (pp. 129--140). <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2011.129\">https://doi.org/10.4230/LIPIcs.STACS.2011.129</a>"},"publication":"28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany","date_created":"2018-03-29T08:44:00Z","department":[{"_id":"79"}],"type":"conference"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"citation":{"ama":"Setzer A. <i>Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern in Einem Peer-to-Peer Netzwerk</i>. Universität Paderborn; 2011.","bibtex":"@book{Setzer_2011, title={Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk}, publisher={Universität Paderborn}, author={Setzer, Alexander}, year={2011} }","mla":"Setzer, Alexander. <i>Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern in Einem Peer-to-Peer Netzwerk</i>. Universität Paderborn, 2011.","chicago":"Setzer, Alexander. <i>Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern in Einem Peer-to-Peer Netzwerk</i>. Universität Paderborn, 2011.","short":"A. Setzer, Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern in Einem Peer-to-Peer Netzwerk, Universität Paderborn, 2011.","apa":"Setzer, A. (2011). <i>Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk</i>. Universität Paderborn.","ieee":"A. Setzer, <i>Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk</i>. Universität Paderborn, 2011."},"department":[{"_id":"79"}],"type":"bachelorsthesis","date_created":"2020-08-17T08:08:13Z","date_updated":"2022-01-06T06:53:24Z","author":[{"full_name":"Setzer, Alexander","first_name":"Alexander","last_name":"Setzer","id":"11108"}],"title":"Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk","status":"public","year":"2011","user_id":"477","_id":"17997","language":[{"iso":"eng"}],"publisher":"Universität Paderborn"},{"language":[{"iso":"eng"}],"_id":"17998","user_id":"15504","author":[{"full_name":"Sascha, Brauer","first_name":"Brauer","last_name":"Sascha"}],"title":"Implementierung eines Verfahrens zur Lösung des 3-Mincut-Problems","status":"public","year":"2011","date_updated":"2022-01-06T06:53:24Z","date_created":"2020-08-17T08:11:05Z","department":[{"_id":"79"}],"type":"bachelorsthesis","citation":{"mla":"Sascha, Brauer. <i>Implementierung Eines Verfahrens Zur Lösung Des 3-Mincut-Problems</i>. 2011.","bibtex":"@book{Sascha_2011, title={Implementierung eines Verfahrens zur Lösung des 3-Mincut-Problems}, author={Sascha, Brauer}, year={2011} }","ama":"Sascha B. <i>Implementierung Eines Verfahrens Zur Lösung Des 3-Mincut-Problems</i>.; 2011.","ieee":"B. Sascha, <i>Implementierung eines Verfahrens zur Lösung des 3-Mincut-Problems</i>. 2011.","apa":"Sascha, B. (2011). <i>Implementierung eines Verfahrens zur Lösung des 3-Mincut-Problems</i>.","short":"B. Sascha, Implementierung Eines Verfahrens Zur Lösung Des 3-Mincut-Problems, 2011.","chicago":"Sascha, Brauer. <i>Implementierung Eines Verfahrens Zur Lösung Des 3-Mincut-Problems</i>, 2011."},"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}]},{"_id":"645","page":"149-158","user_id":"15504","ddc":["040"],"doi":"10.1145/1989493.1989516","author":[{"first_name":"Benjamin","last_name":"Doerr","full_name":"Doerr, Benjamin"},{"last_name":"Goldberg","first_name":"Leslie Ann","full_name":"Goldberg, Leslie Ann"},{"first_name":"Lorenz","last_name":"Minder","full_name":"Minder, Lorenz"},{"first_name":"Thomas","last_name":"Sauerwald","full_name":"Sauerwald, Thomas"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"year":"2011","status":"public","title":"Stabilizing consensus with the power of two choices","has_accepted_license":"1","date_updated":"2022-01-06T07:03:05Z","date_created":"2017-10-17T12:42:57Z","file":[{"file_id":"1228","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2018-03-14T13:58:11Z","file_name":"645-spaa70-scheideler.pdf","access_level":"closed","file_size":268500,"date_created":"2018-03-14T13:58:11Z","creator":"florida"}],"department":[{"_id":"79"}],"type":"conference","citation":{"mla":"Doerr, Benjamin, et al. “Stabilizing Consensus with the Power of Two Choices.” <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2011, pp. 149–58, doi:<a href=\"https://doi.org/10.1145/1989493.1989516\">10.1145/1989493.1989516</a>.","bibtex":"@inproceedings{Doerr_Goldberg_Minder_Sauerwald_Scheideler_2011, title={Stabilizing consensus with the power of two choices}, DOI={<a href=\"https://doi.org/10.1145/1989493.1989516\">10.1145/1989493.1989516</a>}, 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} }","ama":"Doerr B, Goldberg LA, Minder L, Sauerwald T, Scheideler C. Stabilizing consensus with the power of two choices. In: <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2011:149-158. doi:<a href=\"https://doi.org/10.1145/1989493.1989516\">10.1145/1989493.1989516</a>","ieee":"B. Doerr, L. A. Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Stabilizing consensus with the power of two choices,” in <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2011, pp. 149–158.","apa":"Doerr, B., Goldberg, L. A., Minder, L., Sauerwald, T., &#38; Scheideler, C. (2011). Stabilizing consensus with the power of two choices. In <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 149–158). <a href=\"https://doi.org/10.1145/1989493.1989516\">https://doi.org/10.1145/1989493.1989516</a>","chicago":"Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler. “Stabilizing Consensus with the Power of Two Choices.” In <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 149–58, 2011. <a href=\"https://doi.org/10.1145/1989493.1989516\">https://doi.org/10.1145/1989493.1989516</a>.","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."},"file_date_updated":"2018-03-14T13:58:11Z","publication":"Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_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."}]},{"author":[{"full_name":"Richa, Andrea W.","last_name":"Richa","first_name":"Andrea W."},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"year":"2011","title":"Self-Stabilizing DeBruijn Networks","date_updated":"2022-01-06T07:03:06Z","series_title":"LNCS","doi":"10.1007/978-3-642-24550-3_31","publication":"Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","abstract":[{"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.","lang":"eng"}],"date_created":"2017-10-17T12:42:58Z","file":[{"date_created":"2018-03-14T13:57:26Z","creator":"florida","success":1,"content_type":"application/pdf","file_id":"1227","file_size":339664,"access_level":"closed","file_name":"646-SSS2011-Scheideler_02.pdf","date_updated":"2018-03-14T13:57:26Z","relation":"main_file"}],"department":[{"_id":"79"}],"type":"conference","status":"public","has_accepted_license":"1","_id":"646","page":"416-430","user_id":"15504","ddc":["040"],"citation":{"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.","ama":"Richa AW, Scheideler C. Self-Stabilizing DeBruijn Networks. In: <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. LNCS. ; 2011:416-430. doi:<a href=\"https://doi.org/10.1007/978-3-642-24550-3_31\">10.1007/978-3-642-24550-3_31</a>","chicago":"Richa, Andrea W., and Christian Scheideler. “Self-Stabilizing DeBruijn Networks.” In <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 416–30. LNCS, 2011. <a href=\"https://doi.org/10.1007/978-3-642-24550-3_31\">https://doi.org/10.1007/978-3-642-24550-3_31</a>.","bibtex":"@inproceedings{Richa_Scheideler_2011, series={LNCS}, title={Self-Stabilizing DeBruijn Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-24550-3_31\">10.1007/978-3-642-24550-3_31</a>}, 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.” <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2011, pp. 416–30, doi:<a href=\"https://doi.org/10.1007/978-3-642-24550-3_31\">10.1007/978-3-642-24550-3_31</a>.","apa":"Richa, A. W., &#38; Scheideler, C. (2011). Self-Stabilizing DeBruijn Networks. In <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (pp. 416–430). <a href=\"https://doi.org/10.1007/978-3-642-24550-3_31\">https://doi.org/10.1007/978-3-642-24550-3_31</a>","ieee":"A. W. Richa and C. Scheideler, “Self-Stabilizing DeBruijn Networks,” in <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2011, pp. 416–430."},"file_date_updated":"2018-03-14T13:57:26Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}]},{"date_updated":"2022-01-06T07:03:06Z","author":[{"full_name":"Brandes, Philipp","first_name":"Philipp","last_name":"Brandes"}],"status":"public","title":"Robust Distributed Computation in Dynamic Networks","year":"2011","user_id":"477","_id":"648","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"mla":"Brandes, Philipp. <i>Robust Distributed Computation in Dynamic Networks</i>. Universität Paderborn, 2011.","apa":"Brandes, P. (2011). <i>Robust Distributed Computation in Dynamic Networks</i>. Universität Paderborn.","ieee":"P. Brandes, <i>Robust Distributed Computation in Dynamic Networks</i>. Universität Paderborn, 2011.","short":"P. Brandes, Robust Distributed Computation in Dynamic Networks, Universität Paderborn, 2011.","ama":"Brandes P. <i>Robust Distributed Computation in Dynamic Networks</i>. Universität Paderborn; 2011.","chicago":"Brandes, Philipp. <i>Robust Distributed Computation in Dynamic Networks</i>. Universität Paderborn, 2011.","bibtex":"@book{Brandes_2011, title={Robust Distributed Computation in Dynamic Networks}, publisher={Universität Paderborn}, author={Brandes, Philipp}, year={2011} }"},"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"department":[{"_id":"79"}],"type":"mastersthesis","date_created":"2017-10-17T12:42:58Z"},{"citation":{"apa":"Graffi, K. (2011). PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned. In <i>Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)</i> (pp. 154–155). <a href=\"https://doi.org/10.1109/P2P.2011.6038673\">https://doi.org/10.1109/P2P.2011.6038673</a>","ieee":"K. Graffi, “PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned,” in <i>Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)</i>, 2011, pp. 154–155.","chicago":"Graffi, Kalman. “PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned.” In <i>Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)</i>, 154–55, 2011. <a href=\"https://doi.org/10.1109/P2P.2011.6038673\">https://doi.org/10.1109/P2P.2011.6038673</a>.","short":"K. Graffi, in: Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP), 2011, pp. 154–155.","mla":"Graffi, Kalman. “PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned.” <i>Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)</i>, 2011, pp. 154–55, doi:<a href=\"https://doi.org/10.1109/P2P.2011.6038673\">10.1109/P2P.2011.6038673</a>.","ama":"Graffi K. PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned. In: <i>Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)</i>. ; 2011:154-155. doi:<a href=\"https://doi.org/10.1109/P2P.2011.6038673\">10.1109/P2P.2011.6038673</a>","bibtex":"@inproceedings{Graffi_2011, title={PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned}, DOI={<a href=\"https://doi.org/10.1109/P2P.2011.6038673\">10.1109/P2P.2011.6038673</a>}, booktitle={Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)}, author={Graffi, Kalman}, year={2011}, pages={154–155} }"},"file_date_updated":"2018-03-14T13:50:18Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"654","page":"154-155","ddc":["040"],"user_id":"477","status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:59Z","file":[{"file_size":327680,"access_level":"closed","file_name":"654-IEEE.P2P.11._Kalman.Graffi_PeerfactSim-A.P2P.System.Simulator_01.pdf","date_updated":"2018-03-14T13:50:18Z","relation":"main_file","content_type":"application/pdf","success":1,"file_id":"1221","creator":"florida","date_created":"2018-03-14T13:50:18Z"}],"department":[{"_id":"79"}],"type":"conference","publication":"Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)","abstract":[{"lang":"eng","text":"Research on peer-to-peer (p2p) and distributed systems needs evaluation tools to predict and observe the behavior of protocols and mechanisms in large scale networks. PeerfactSim.KOM is a simulator for large scale distributed/p2p systems aiming at the evaluation of interdependencies in multi-layered p2p systems. The simulator is written in Java, is event-based and mainly used in p2p research projects. The main development of PeerfactSim.KOM started in 2005 and is driven since 2006 by the project “QuaP2P”,which aims at the systematic improvement and benchmarking of p2p systems. Further users of the simulator are working in the project “On-the-fly Computing” aiming at researching p2p-based service oriented architectures. Both projects state severe requirements on the evaluation of multi-layered and large-scale distributed systems. We describe the architecture of PeerfactSim.KOM supporting these requirements in Section II, present the workflow, selected experiences and lessons learned in Section III and conclude the overview in Section IV."}],"language":[{"iso":"eng"}],"doi":"10.1109/P2P.2011.6038673","author":[{"last_name":"Graffi","first_name":"Kalman","full_name":"Graffi, Kalman"}],"title":"PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned","year":"2011","date_updated":"2022-01-06T07:03:11Z"},{"year":"2011","title":"Corona: A Stabilizing Deterministic Message-Passing Skip List","author":[{"full_name":"Nesterenko, Mikhail","last_name":"Nesterenko","first_name":"Mikhail"},{"last_name":"Mohd","first_name":"Rizal","full_name":"Mohd, Rizal"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"date_updated":"2022-01-06T07:03:13Z","series_title":"LNCS","doi":"10.1007/978-3-642-24550-3_27","publication":"Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","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"}],"file":[{"file_size":305543,"access_level":"closed","file_name":"662-SSS2011-Corona-Scheideler.pdf","date_updated":"2018-03-14T13:46:48Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1217","creator":"florida","date_created":"2018-03-14T13:46:48Z"}],"date_created":"2017-10-17T12:43:01Z","type":"conference","department":[{"_id":"79"}],"status":"public","has_accepted_license":"1","page":"356--370","_id":"662","ddc":["040"],"user_id":"15504","file_date_updated":"2018-03-14T13:46:48Z","citation":{"apa":"Nesterenko, M., Mohd, R., &#38; Scheideler, C. (2011). Corona: A Stabilizing Deterministic Message-Passing Skip List. In <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (pp. 356--370). <a href=\"https://doi.org/10.1007/978-3-642-24550-3_27\">https://doi.org/10.1007/978-3-642-24550-3_27</a>","ieee":"M. Nesterenko, R. Mohd, and C. Scheideler, “Corona: A Stabilizing Deterministic Message-Passing Skip List,” in <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2011, pp. 356--370.","chicago":"Nesterenko, Mikhail, Rizal Mohd, and Christian Scheideler. “Corona: A Stabilizing Deterministic Message-Passing Skip List.” In <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 356--370. LNCS, 2011. <a href=\"https://doi.org/10.1007/978-3-642-24550-3_27\">https://doi.org/10.1007/978-3-642-24550-3_27</a>.","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.","mla":"Nesterenko, Mikhail, et al. “Corona: A Stabilizing Deterministic Message-Passing Skip List.” <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2011, pp. 356--370, doi:<a href=\"https://doi.org/10.1007/978-3-642-24550-3_27\">10.1007/978-3-642-24550-3_27</a>.","ama":"Nesterenko M, Mohd R, Scheideler C. Corona: A Stabilizing Deterministic Message-Passing Skip List. In: <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. LNCS. ; 2011:356--370. doi:<a href=\"https://doi.org/10.1007/978-3-642-24550-3_27\">10.1007/978-3-642-24550-3_27</a>","bibtex":"@inproceedings{Nesterenko_Mohd_Scheideler_2011, series={LNCS}, title={Corona: A Stabilizing Deterministic Message-Passing Skip List}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-24550-3_27\">10.1007/978-3-642-24550-3_27</a>}, 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} }"},"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}]},{"date_updated":"2022-01-06T07:03:14Z","author":[{"full_name":"Wette, Philip","last_name":"Wette","first_name":"Philip"}],"title":"Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord","year":"2011","status":"public","user_id":"477","language":[{"iso":"ger"}],"_id":"665","publisher":"Universität Paderborn","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"citation":{"apa":"Wette, P. (2011). <i>Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord</i>. Universität Paderborn.","ieee":"P. Wette, <i>Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord</i>. Universität Paderborn, 2011.","chicago":"Wette, Philip. <i>Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord</i>. Universität Paderborn, 2011.","short":"P. Wette, Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord, Universität Paderborn, 2011.","mla":"Wette, Philip. <i>Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord</i>. Universität Paderborn, 2011.","ama":"Wette P. <i>Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord</i>. Universität Paderborn; 2011.","bibtex":"@book{Wette_2011, title={Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord}, publisher={Universität Paderborn}, author={Wette, Philip}, year={2011} }"},"department":[{"_id":"79"}],"type":"mastersthesis","date_created":"2017-10-17T12:43:01Z"},{"date_created":"2018-03-28T07:21:50Z","department":[{"_id":"79"},{"_id":"63"}],"type":"journal_article","citation":{"mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen Verteilter Speichersysteme.” <i>Informatik Spektrum</i>, no. 5, 2010, pp. 468--474, doi:<a href=\"https://doi.org/10.1007/s00287-010-0470-2\">10.1007/s00287-010-0470-2</a>.","bibtex":"@article{Meyer auf der Heide_Scheideler_2010, title={Algorithmische Grundlagen verteilter Speichersysteme}, DOI={<a href=\"https://doi.org/10.1007/s00287-010-0470-2\">10.1007/s00287-010-0470-2</a>}, number={5}, journal={Informatik Spektrum}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2010}, pages={468--474} }","ama":"Meyer auf der Heide F, Scheideler C. Algorithmische Grundlagen verteilter Speichersysteme. <i>Informatik Spektrum</i>. 2010;(5):468--474. doi:<a href=\"https://doi.org/10.1007/s00287-010-0470-2\">10.1007/s00287-010-0470-2</a>","ieee":"F. Meyer auf der Heide and C. Scheideler, “Algorithmische Grundlagen verteilter Speichersysteme,” <i>Informatik Spektrum</i>, no. 5, pp. 468--474, 2010.","apa":"Meyer auf der Heide, F., &#38; Scheideler, C. (2010). Algorithmische Grundlagen verteilter Speichersysteme. <i>Informatik Spektrum</i>, (5), 468--474. <a href=\"https://doi.org/10.1007/s00287-010-0470-2\">https://doi.org/10.1007/s00287-010-0470-2</a>","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen Verteilter Speichersysteme.” <i>Informatik Spektrum</i>, no. 5 (2010): 468--474. <a href=\"https://doi.org/10.1007/s00287-010-0470-2\">https://doi.org/10.1007/s00287-010-0470-2</a>.","short":"F. Meyer auf der Heide, C. Scheideler, Informatik Spektrum (2010) 468--474."},"issue":"5","publication":"Informatik Spektrum","_id":"1903","language":[{"iso":"eng"}],"page":"468--474","user_id":"14955","doi":"10.1007/s00287-010-0470-2","author":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"title":"Algorithmische Grundlagen verteilter Speichersysteme","status":"public","year":"2010","date_updated":"2022-01-06T06:53:57Z"},{"citation":{"short":"C. Gavoille, B. Patt-Shamir, C. Scheideler, Theory of Computing Systems (2010) 809--810.","chicago":"Gavoille, Cyril, Boaz Patt-Shamir, and Christian Scheideler. “Foreword.” <i>Theory of Computing Systems</i>, no. 4 (2010): 809--810. <a href=\"https://doi.org/10.1007/s00224-010-9284-5\">https://doi.org/10.1007/s00224-010-9284-5</a>.","apa":"Gavoille, C., Patt-Shamir, B., &#38; Scheideler, C. (2010). Foreword. <i>Theory of Computing Systems</i>, (4), 809--810. <a href=\"https://doi.org/10.1007/s00224-010-9284-5\">https://doi.org/10.1007/s00224-010-9284-5</a>","ieee":"C. Gavoille, B. Patt-Shamir, and C. Scheideler, “Foreword,” <i>Theory of Computing Systems</i>, no. 4, pp. 809--810, 2010.","ama":"Gavoille C, Patt-Shamir B, Scheideler C. Foreword. <i>Theory of Computing Systems</i>. 2010;(4):809--810. doi:<a href=\"https://doi.org/10.1007/s00224-010-9284-5\">10.1007/s00224-010-9284-5</a>","bibtex":"@article{Gavoille_Patt-Shamir_Scheideler_2010, title={Foreword}, DOI={<a href=\"https://doi.org/10.1007/s00224-010-9284-5\">10.1007/s00224-010-9284-5</a>}, 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.” <i>Theory of Computing Systems</i>, no. 4, 2010, pp. 809--810, doi:<a href=\"https://doi.org/10.1007/s00224-010-9284-5\">10.1007/s00224-010-9284-5</a>."},"issue":"4","publication":"Theory of Computing Systems","department":[{"_id":"79"}],"type":"journal_article","date_created":"2018-03-28T07:22:21Z","date_updated":"2022-01-06T06:53:57Z","author":[{"full_name":"Gavoille, Cyril","last_name":"Gavoille","first_name":"Cyril"},{"first_name":"Boaz","last_name":"Patt-Shamir","full_name":"Patt-Shamir, Boaz"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"status":"public","title":"Foreword","year":"2010","doi":"10.1007/s00224-010-9284-5","user_id":"15504","_id":"1904","page":"809--810"},{"date_created":"2018-03-28T07:22:42Z","type":"conference","department":[{"_id":"79"}],"publication":"LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings","citation":{"mla":"Gall, Dominik, et al. “Time Complexity of Distributed Topological Self-Stabilization: The Case of Graph Linearization.” <i>LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings</i>, vol. 6034, Springer, 2010, pp. 294--305, doi:<a href=\"https://doi.org/10.1007/978-3-642-12200-2_27\">10.1007/978-3-642-12200-2_27</a>.","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={<a href=\"https://doi.org/10.1007/978-3-642-12200-2_27\">10.1007/978-3-642-12200-2_27</a>}, 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} }","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: <i>LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings</i>. Vol 6034. Lecture Notes in Computer Science. Springer; 2010:294--305. doi:<a href=\"https://doi.org/10.1007/978-3-642-12200-2_27\">10.1007/978-3-642-12200-2_27</a>","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 <i>LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings</i>, 2010, vol. 6034, pp. 294--305.","apa":"Gall, D., Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., &#38; Täubig, H. (2010). Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. In <i>LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings</i> (Vol. 6034, pp. 294--305). Springer. <a href=\"https://doi.org/10.1007/978-3-642-12200-2_27\">https://doi.org/10.1007/978-3-642-12200-2_27</a>","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 <i>LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings</i>, 6034:294--305. Lecture Notes in Computer Science. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-12200-2_27\">https://doi.org/10.1007/978-3-642-12200-2_27</a>.","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."},"page":"294--305","series_title":"Lecture Notes in Computer Science","_id":"1905","publisher":"Springer","doi":"10.1007/978-3-642-12200-2_27","user_id":"15504","volume":6034,"status":"public","title":"Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization","year":"2010","publication_identifier":{"isbn":["978-3-642-12199-9"]},"author":[{"first_name":"Dominik","last_name":"Gall","full_name":"Gall, Dominik"},{"full_name":"Jacob, Riko","first_name":"Riko","last_name":"Jacob"},{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, Andrea"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"},{"first_name":"Hanjo","last_name":"Täubig","full_name":"Täubig, Hanjo"}],"date_updated":"2022-01-06T06:53:57Z","intvolume":"      6034"},{"author":[{"last_name":"Richa","first_name":"Andrea W.","full_name":"Richa, Andrea W."},{"first_name":"Jin","last_name":"Zhang","full_name":"Zhang, Jin"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"}],"publication_identifier":{"isbn":["978-1-60558-888-9"]},"title":"Brief announcement: towards robust medium access in multi-hop networks","status":"public","year":"2010","date_updated":"2022-01-06T06:53:57Z","_id":"1906","publisher":"ACM","page":"114--115","user_id":"15504","doi":"10.1145/1835698.1835726","citation":{"mla":"Richa, Andrea W., et al. “Brief Announcement: Towards Robust Medium Access in Multi-Hop Networks.” <i>Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010</i>, ACM, 2010, pp. 114--115, doi:<a href=\"https://doi.org/10.1145/1835698.1835726\">10.1145/1835698.1835726</a>.","ama":"Richa AW, Zhang J, Scheideler C, Schmid S. Brief announcement: towards robust medium access in multi-hop networks. In: <i>Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010</i>. ACM; 2010:114--115. doi:<a href=\"https://doi.org/10.1145/1835698.1835726\">10.1145/1835698.1835726</a>","bibtex":"@inproceedings{Richa_Zhang_Scheideler_Schmid_2010, title={Brief announcement: towards robust medium access in multi-hop networks}, DOI={<a href=\"https://doi.org/10.1145/1835698.1835726\">10.1145/1835698.1835726</a>}, 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} }","apa":"Richa, A. W., Zhang, J., Scheideler, C., &#38; Schmid, S. (2010). Brief announcement: towards robust medium access in multi-hop networks. In <i>Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010</i> (pp. 114--115). ACM. <a href=\"https://doi.org/10.1145/1835698.1835726\">https://doi.org/10.1145/1835698.1835726</a>","ieee":"A. W. Richa, J. Zhang, C. Scheideler, and S. Schmid, “Brief announcement: towards robust medium access in multi-hop networks,” in <i>Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010</i>, 2010, pp. 114--115.","chicago":"Richa, Andrea W., Jin Zhang, Christian Scheideler, and Stefan Schmid. “Brief Announcement: Towards Robust Medium Access in Multi-Hop Networks.” In <i>Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010</i>, 114--115. ACM, 2010. <a href=\"https://doi.org/10.1145/1835698.1835726\">https://doi.org/10.1145/1835698.1835726</a>.","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."},"publication":"Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010","date_created":"2018-03-28T07:23:32Z","department":[{"_id":"79"}],"type":"conference"},{"volume":6343,"doi":"10.1007/978-3-642-15763-9_17","user_id":"15504","publisher":"Springer","_id":"1907","series_title":"Lecture Notes in Computer Science","page":"179--193","intvolume":"      6343","date_updated":"2022-01-06T06:53:58Z","publication_identifier":{"isbn":["978-3-642-15762-2"]},"author":[{"first_name":"Andrea W.","last_name":"Richa","full_name":"Richa, Andrea W."},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"},{"first_name":"Jin","last_name":"Zhang","full_name":"Zhang, Jin"}],"status":"public","year":"2010","title":"A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks","department":[{"_id":"79"}],"type":"conference","date_created":"2018-03-28T07:24:22Z","citation":{"mla":"Richa, Andrea W., et al. “A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks.” <i>Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings</i>, vol. 6343, Springer, 2010, pp. 179--193, doi:<a href=\"https://doi.org/10.1007/978-3-642-15763-9_17\">10.1007/978-3-642-15763-9_17</a>.","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={<a href=\"https://doi.org/10.1007/978-3-642-15763-9_17\">10.1007/978-3-642-15763-9_17</a>}, 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} }","ama":"Richa AW, Scheideler C, Schmid S, Zhang J. A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks. In: <i>Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings</i>. Vol 6343. Lecture Notes in Computer Science. Springer; 2010:179--193. doi:<a href=\"https://doi.org/10.1007/978-3-642-15763-9_17\">10.1007/978-3-642-15763-9_17</a>","ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks,” in <i>Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings</i>, 2010, vol. 6343, pp. 179--193.","apa":"Richa, A. W., Scheideler, C., Schmid, S., &#38; Zhang, J. (2010). A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks. In <i>Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings</i> (Vol. 6343, pp. 179--193). Springer. <a href=\"https://doi.org/10.1007/978-3-642-15763-9_17\">https://doi.org/10.1007/978-3-642-15763-9_17</a>","chicago":"Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin Zhang. “A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks.” In <i>Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings</i>, 6343:179--193. Lecture Notes in Computer Science. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15763-9_17\">https://doi.org/10.1007/978-3-642-15763-9_17</a>.","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."},"publication":"Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings"},{"_id":"1908","publisher":"Springer","series_title":"Lecture Notes in Computer Science","page":"528--530","volume":6343,"doi":"10.1007/978-3-642-15763-9_50","user_id":"15504","author":[{"full_name":"Doerr, Benjamin","last_name":"Doerr","first_name":"Benjamin"},{"last_name":"Ann Goldberg","first_name":"Leslie","full_name":"Ann Goldberg, Leslie"},{"full_name":"Minder, Lorenz","last_name":"Minder","first_name":"Lorenz"},{"first_name":"Thomas","last_name":"Sauerwald","full_name":"Sauerwald, Thomas"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"year":"2010","title":"Brief Announcement: Stabilizing Consensus with the Power of Two Choices","status":"public","intvolume":"      6343","date_updated":"2022-01-06T06:53:58Z","date_created":"2018-03-28T07:25:45Z","department":[{"_id":"79"}],"type":"conference","citation":{"mla":"Doerr, Benjamin, et al. “Brief Announcement: Stabilizing Consensus with the Power of Two Choices.” <i>Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings</i>, vol. 6343, Springer, 2010, pp. 528--530, doi:<a href=\"https://doi.org/10.1007/978-3-642-15763-9_50\">10.1007/978-3-642-15763-9_50</a>.","ama":"Doerr B, Ann Goldberg L, Minder L, Sauerwald T, Scheideler C. Brief Announcement: Stabilizing Consensus with the Power of Two Choices. In: <i>Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings</i>. Vol 6343. Lecture Notes in Computer Science. Springer; 2010:528--530. doi:<a href=\"https://doi.org/10.1007/978-3-642-15763-9_50\">10.1007/978-3-642-15763-9_50</a>","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={<a href=\"https://doi.org/10.1007/978-3-642-15763-9_50\">10.1007/978-3-642-15763-9_50</a>}, 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} }","apa":"Doerr, B., Ann Goldberg, L., Minder, L., Sauerwald, T., &#38; Scheideler, C. (2010). Brief Announcement: Stabilizing Consensus with the Power of Two Choices. In <i>Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings</i> (Vol. 6343, pp. 528--530). Springer. <a href=\"https://doi.org/10.1007/978-3-642-15763-9_50\">https://doi.org/10.1007/978-3-642-15763-9_50</a>","ieee":"B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Brief Announcement: Stabilizing Consensus with the Power of Two Choices,” in <i>Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings</i>, 2010, vol. 6343, pp. 528--530.","chicago":"Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler. “Brief Announcement: Stabilizing Consensus with the Power of Two Choices.” In <i>Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings</i>, 6343:528--530. Lecture Notes in Computer Science. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15763-9_50\">https://doi.org/10.1007/978-3-642-15763-9_50</a>.","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."},"publication":"Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings"},{"date_updated":"2022-01-06T06:53:58Z","publication_identifier":{"isbn":["978-3-642-16987-8"]},"title":"Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010, Revised Selected Papers","status":"public","year":"2010","editor":[{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"user_id":"15504","doi":"10.1007/978-3-642-16988-5","_id":"1909","series_title":"Lecture Notes in Computer Science","citation":{"ieee":"C. Scheideler, Ed., <i>Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010, Revised Selected Papers</i>. 2010.","apa":"Scheideler, C. (Ed.). (2010). <i>Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010, Revised Selected Papers</i>. <a href=\"https://doi.org/10.1007/978-3-642-16988-5\">https://doi.org/10.1007/978-3-642-16988-5</a>","mla":"Scheideler, Christian, editor. <i>Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010, Revised Selected Papers</i>. 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-16988-5\">10.1007/978-3-642-16988-5</a>.","bibtex":"@book{Scheideler_2010, series={Lecture Notes in Computer Science}, title={Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010, Revised Selected Papers}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-16988-5\">10.1007/978-3-642-16988-5</a>}, year={2010}, collection={Lecture Notes in Computer Science} }","chicago":"Scheideler, Christian, ed. <i>Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010, Revised Selected Papers</i>. Lecture Notes in Computer Science, 2010. <a href=\"https://doi.org/10.1007/978-3-642-16988-5\">https://doi.org/10.1007/978-3-642-16988-5</a>.","ama":"Scheideler C, ed. <i>Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010, Revised Selected Papers</i>.; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-16988-5\">10.1007/978-3-642-16988-5</a>","short":"C. Scheideler, ed., Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010, Revised Selected Papers, 2010."},"department":[{"_id":"79"}],"type":"conference_editor","date_created":"2018-03-28T07:27:12Z"},{"author":[{"full_name":"D. Kleinberg, Robert","last_name":"D. Kleinberg","first_name":"Robert"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"status":"public","year":"2009","title":"Foreword","date_updated":"2022-01-06T06:54:00Z","_id":"1925","page":"187","user_id":"15504","doi":"10.1007/s00224-009-9202-x","citation":{"mla":"D. Kleinberg, Robert, and Christian Scheideler. “Foreword.” <i>Theory Comput. Syst.</i>, no. 2, 2009, p. 187, doi:<a href=\"https://doi.org/10.1007/s00224-009-9202-x\">10.1007/s00224-009-9202-x</a>.","apa":"D. Kleinberg, R., &#38; Scheideler, C. (2009). Foreword. <i>Theory Comput. Syst.</i>, (2), 187. <a href=\"https://doi.org/10.1007/s00224-009-9202-x\">https://doi.org/10.1007/s00224-009-9202-x</a>","ieee":"R. D. Kleinberg and C. Scheideler, “Foreword,” <i>Theory Comput. Syst.</i>, no. 2, p. 187, 2009.","chicago":"D. Kleinberg, Robert, and Christian Scheideler. “Foreword.” <i>Theory Comput. Syst.</i>, no. 2 (2009): 187. <a href=\"https://doi.org/10.1007/s00224-009-9202-x\">https://doi.org/10.1007/s00224-009-9202-x</a>.","ama":"D. Kleinberg R, Scheideler C. Foreword. <i>Theory Comput Syst</i>. 2009;(2):187. doi:<a href=\"https://doi.org/10.1007/s00224-009-9202-x\">10.1007/s00224-009-9202-x</a>","short":"R. D. Kleinberg, C. Scheideler, Theory Comput. Syst. (2009) 187.","bibtex":"@article{D. Kleinberg_Scheideler_2009, title={Foreword}, DOI={<a href=\"https://doi.org/10.1007/s00224-009-9202-x\">10.1007/s00224-009-9202-x</a>}, number={2}, journal={Theory Comput. Syst.}, author={D. Kleinberg, Robert and Scheideler, Christian}, year={2009}, pages={187} }"},"issue":"2","publication":"Theory Comput. Syst.","date_created":"2018-03-29T09:01:30Z","department":[{"_id":"79"}],"type":"journal_article"},{"date_updated":"2022-01-06T06:54:00Z","author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"title":"Towards a Scalable and Robust DHT","status":"public","year":"2009","user_id":"15504","doi":"10.1007/s00224-008-9099-9","_id":"1927","page":"234--260","citation":{"bibtex":"@article{Awerbuch_Scheideler_2009, title={Towards a Scalable and Robust DHT}, DOI={<a href=\"https://doi.org/10.1007/s00224-008-9099-9\">10.1007/s00224-008-9099-9</a>}, number={2}, journal={Theory Comput. Syst.}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2009}, pages={234--260} }","ama":"Awerbuch B, Scheideler C. Towards a Scalable and Robust DHT. <i>Theory Comput Syst</i>. 2009;(2):234--260. doi:<a href=\"https://doi.org/10.1007/s00224-008-9099-9\">10.1007/s00224-008-9099-9</a>","mla":"Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.” <i>Theory Comput. Syst.</i>, no. 2, 2009, pp. 234--260, doi:<a href=\"https://doi.org/10.1007/s00224-008-9099-9\">10.1007/s00224-008-9099-9</a>.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.” <i>Theory Comput. Syst.</i>, no. 2 (2009): 234--260. <a href=\"https://doi.org/10.1007/s00224-008-9099-9\">https://doi.org/10.1007/s00224-008-9099-9</a>.","short":"B. Awerbuch, C. Scheideler, Theory Comput. Syst. (2009) 234--260.","ieee":"B. Awerbuch and C. Scheideler, “Towards a Scalable and Robust DHT,” <i>Theory Comput. Syst.</i>, no. 2, pp. 234--260, 2009.","apa":"Awerbuch, B., &#38; Scheideler, C. (2009). Towards a Scalable and Robust DHT. <i>Theory Comput. Syst.</i>, (2), 234--260. <a href=\"https://doi.org/10.1007/s00224-008-9099-9\">https://doi.org/10.1007/s00224-008-9099-9</a>"},"publication":"Theory Comput. Syst.","issue":"2","department":[{"_id":"79"}],"type":"journal_article","date_created":"2018-03-29T09:08:11Z"},{"author":[{"first_name":"Baruch","last_name":"Awerbuch","full_name":"Awerbuch, Baruch"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"year":"2009","status":"public","title":"Robust random number generation for peer-to-peer systems","date_updated":"2022-01-06T06:54:01Z","_id":"1928","page":"453--466","doi":"10.1016/j.tcs.2008.10.003","user_id":"15504","citation":{"apa":"Awerbuch, B., &#38; Scheideler, C. (2009). Robust random number generation for peer-to-peer systems. <i>Theor. Comput. Sci.</i>, (6–7), 453--466. <a href=\"https://doi.org/10.1016/j.tcs.2008.10.003\">https://doi.org/10.1016/j.tcs.2008.10.003</a>","ieee":"B. Awerbuch and C. Scheideler, “Robust random number generation for peer-to-peer systems,” <i>Theor. Comput. Sci.</i>, no. 6–7, pp. 453--466, 2009.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.” <i>Theor. Comput. Sci.</i>, no. 6–7 (2009): 453--466. <a href=\"https://doi.org/10.1016/j.tcs.2008.10.003\">https://doi.org/10.1016/j.tcs.2008.10.003</a>.","short":"B. Awerbuch, C. Scheideler, Theor. Comput. Sci. (2009) 453--466.","mla":"Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.” <i>Theor. Comput. Sci.</i>, no. 6–7, 2009, pp. 453--466, doi:<a href=\"https://doi.org/10.1016/j.tcs.2008.10.003\">10.1016/j.tcs.2008.10.003</a>.","ama":"Awerbuch B, Scheideler C. Robust random number generation for peer-to-peer systems. <i>Theor Comput Sci</i>. 2009;(6-7):453--466. doi:<a href=\"https://doi.org/10.1016/j.tcs.2008.10.003\">10.1016/j.tcs.2008.10.003</a>","bibtex":"@article{Awerbuch_Scheideler_2009, title={Robust random number generation for peer-to-peer systems}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2008.10.003\">10.1016/j.tcs.2008.10.003</a>}, number={6–7}, journal={Theor. Comput. Sci.}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2009}, pages={453--466} }"},"issue":"6-7","publication":"Theor. Comput. Sci.","date_created":"2018-03-29T09:08:12Z","department":[{"_id":"79"}],"type":"journal_article"}]