[{"urn":"21699","_id":"2169","date_updated":"2022-01-06T06:55:10Z","oa":"1","language":[{"iso":"eng"}],"page":"259--268","year":"1998","type":"conference","citation":{"apa":"Adler, M., & Scheideler, C. (1998). Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). In SPAA (pp. 259--268).","ama":"Adler M, Scheideler C. Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). In: SPAA. ; 1998:259--268.","chicago":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” In SPAA, 259--268, 1998.","mla":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” SPAA, 1998, pp. 259--268.","bibtex":"@inproceedings{Adler_Scheideler_1998, title={Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)}, booktitle={SPAA}, author={Adler, Micah and Scheideler, Christian}, year={1998}, pages={259--268} }","short":"M. Adler, C. Scheideler, in: SPAA, 1998, pp. 259--268.","ieee":"M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract),” in SPAA, 1998, pp. 259--268."},"user_id":"14955","ddc":["040"],"title":"Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)","file":[{"file_size":492778,"file_id":"2285","creator":"florida","date_updated":"2018-04-12T07:08:12Z","content_type":"application/pdf","relation":"main_file","date_created":"2018-04-12T07:08:12Z","file_name":"SPAA98.pdf","access_level":"open_access"}],"file_date_updated":"2018-04-12T07:08:12Z","publication":"SPAA","department":[{"_id":"79"},{"_id":"63"}],"author":[{"full_name":"Adler, Micah","first_name":"Micah","last_name":"Adler"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"date_created":"2018-04-03T08:59:55Z","status":"public","has_accepted_license":"1"},{"page":"624--633","citation":{"short":"U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633.","ieee":"U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract),” in STOC, 1998, pp. 624--633.","ama":"Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). In: STOC. ; 1998:624--633.","apa":"Feige, U., & Scheideler, C. (1998). Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). In STOC (pp. 624--633).","chicago":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” In STOC, 624--633, 1998.","mla":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” STOC, 1998, pp. 624--633.","bibtex":"@inproceedings{Feige_Scheideler_1998, title={Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)}, booktitle={STOC}, author={Feige, Uriel and Scheideler, Christian}, year={1998}, pages={624--633} }"},"type":"conference","year":"1998","language":[{"iso":"eng"}],"oa":"1","urn":"21705","date_updated":"2022-01-06T06:55:11Z","_id":"2170","date_created":"2018-04-03T09:00:31Z","has_accepted_license":"1","status":"public","publication":"STOC","file_date_updated":"2018-04-12T07:15:50Z","department":[{"_id":"79"},{"_id":"63"}],"author":[{"last_name":"Feige","full_name":"Feige, Uriel","first_name":"Uriel"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T07:15:50Z","creator":"florida","file_id":"2286","file_size":228487,"access_level":"open_access","file_name":"STOC98.pdf","date_created":"2018-04-12T07:15:50Z"}],"title":"Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)","ddc":["040"],"user_id":"14955"},{"volume":32,"date_created":"2018-04-03T06:22:14Z","status":"public","department":[{"_id":"79"},{"_id":"63"}],"publication":"Theory Comput. Syst.","author":[{"last_name":"Flammini","first_name":"Michele","full_name":"Flammini, Michele"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"title":"Simple, Efficient Routing Schemes for All-Optical Networks","user_id":"14955","page":"387--420","type":"journal_article","citation":{"ieee":"M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” Theory Comput. Syst., vol. 32, no. 3, pp. 387--420, 1999.","short":"M. Flammini, C. Scheideler, Theory Comput. Syst. 32 (1999) 387--420.","bibtex":"@article{Flammini_Scheideler_1999, title={Simple, Efficient Routing Schemes for All-Optical Networks}, volume={32}, DOI={10.1007/s002240000123}, number={3}, journal={Theory Comput. Syst.}, author={Flammini, Michele and Scheideler, Christian}, year={1999}, pages={387--420} }","mla":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” Theory Comput. Syst., vol. 32, no. 3, 1999, pp. 387--420, doi:10.1007/s002240000123.","chicago":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” Theory Comput. Syst. 32, no. 3 (1999): 387--420. https://doi.org/10.1007/s002240000123.","apa":"Flammini, M., & Scheideler, C. (1999). Simple, Efficient Routing Schemes for All-Optical Networks. Theory Comput. Syst., 32(3), 387--420. https://doi.org/10.1007/s002240000123","ama":"Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical Networks. Theory Comput Syst. 1999;32(3):387--420. doi:10.1007/s002240000123"},"year":"1999","language":[{"iso":"eng"}],"doi":"10.1007/s002240000123","issue":"3","_id":"2151","intvolume":" 32","date_updated":"2022-01-06T06:55:02Z"},{"user_id":"14955","ddc":["040"],"title":"Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths","has_accepted_license":"1","status":"public","date_created":"2018-04-03T08:56:06Z","file":[{"file_name":"SODA-99.pdf","date_created":"2018-04-12T07:34:50Z","access_level":"open_access","file_size":179058,"creator":"florida","file_id":"2288","date_updated":"2018-04-12T07:34:50Z","content_type":"application/pdf","relation":"main_file"}],"author":[{"full_name":"Berenbrink, Petra","first_name":"Petra","last_name":"Berenbrink"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file_date_updated":"2018-04-12T07:34:50Z","publication":"SODA","department":[{"_id":"79"},{"_id":"63"}],"oa":"1","date_updated":"2022-01-06T06:55:09Z","_id":"2164","urn":"21649","language":[{"iso":"eng"}],"year":"1999","citation":{"mla":"Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” SODA, 1999, pp. 112--121.","bibtex":"@inproceedings{Berenbrink_Scheideler_1999, title={Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths}, booktitle={SODA}, author={Berenbrink, Petra and Scheideler, Christian}, year={1999}, pages={112--121} }","chicago":"Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” In SODA, 112--121, 1999.","apa":"Berenbrink, P., & Scheideler, C. (1999). Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In SODA (pp. 112--121).","ama":"Berenbrink P, Scheideler C. Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In: SODA. ; 1999:112--121.","ieee":"P. Berenbrink and C. Scheideler, “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths,” in SODA, 1999, pp. 112--121.","short":"P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121."},"type":"conference","page":"112--121"},{"page":"33--42","year":"1999","citation":{"ieee":"P. Berenbrink, M. Riedel, and C. Scheideler, “Simple Competitive Request Scheduling Strategies,” in SPAA, 1999, pp. 33--42.","short":"P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.","bibtex":"@inproceedings{Berenbrink_Riedel_Scheideler_1999, title={Simple Competitive Request Scheduling Strategies}, booktitle={SPAA}, author={Berenbrink, Petra and Riedel, Marco and Scheideler, Christian}, year={1999}, pages={33--42} }","mla":"Berenbrink, Petra, et al. “Simple Competitive Request Scheduling Strategies.” SPAA, 1999, pp. 33--42.","ama":"Berenbrink P, Riedel M, Scheideler C. Simple Competitive Request Scheduling Strategies. In: SPAA. ; 1999:33--42.","apa":"Berenbrink, P., Riedel, M., & Scheideler, C. (1999). Simple Competitive Request Scheduling Strategies. In SPAA (pp. 33--42).","chicago":"Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Simple Competitive Request Scheduling Strategies.” In SPAA, 33--42, 1999."},"type":"conference","language":[{"iso":"eng"}],"urn":"21658","_id":"2165","date_updated":"2022-01-06T06:55:09Z","oa":"1","file_date_updated":"2018-04-12T07:36:27Z","department":[{"_id":"79"},{"_id":"63"}],"publication":"SPAA","author":[{"full_name":"Berenbrink, Petra","first_name":"Petra","last_name":"Berenbrink"},{"last_name":"Riedel","first_name":"Marco","full_name":"Riedel, Marco"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file":[{"date_created":"2018-04-12T07:36:27Z","file_name":"SPAA-99.pdf","access_level":"open_access","file_id":"2290","creator":"florida","file_size":144422,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T07:36:27Z"}],"date_created":"2018-04-03T08:56:45Z","has_accepted_license":"1","status":"public","title":"Simple Competitive Request Scheduling Strategies","ddc":["040"],"user_id":"14955"},{"urn":"22109","_id":"2210","date_updated":"2022-01-06T06:55:26Z","oa":"1","language":[{"iso":"eng"}],"page":"2-12","year":"1999","citation":{"bibtex":"@inproceedings{Berenbrink_Riedel_Scheideler_1999, title={Design of the PRESTO Multimedia Storage Network (Extended Abstract)}, booktitle={International Workshop on Communication and Data Management in Large Networks (CDMLarge)}, author={Berenbrink, Petra and Riedel, Marco and Scheideler, Christian}, year={1999}, pages={2–12} }","mla":"Berenbrink, Petra, et al. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.","ama":"Berenbrink P, Riedel M, Scheideler C. Design of the PRESTO Multimedia Storage Network (Extended Abstract). In: International Workshop on Communication and Data Management in Large Networks (CDMLarge). ; 1999:2-12.","apa":"Berenbrink, P., Riedel, M., & Scheideler, C. (1999). Design of the PRESTO Multimedia Storage Network (Extended Abstract). In International Workshop on Communication and Data Management in Large Networks (CDMLarge) (pp. 2–12).","chicago":"Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” In International Workshop on Communication and Data Management in Large Networks (CDMLarge), 2–12, 1999.","ieee":"P. Berenbrink, M. Riedel, and C. Scheideler, “Design of the PRESTO Multimedia Storage Network (Extended Abstract),” in International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.","short":"P. Berenbrink, M. Riedel, C. Scheideler, in: International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12."},"type":"conference","user_id":"14955","ddc":["040"],"title":"Design of the PRESTO Multimedia Storage Network (Extended Abstract)","file":[{"access_level":"open_access","date_created":"2018-04-12T08:34:00Z","file_name":"CDMLarge-99.pdf","content_type":"application/pdf","date_updated":"2018-04-12T08:34:00Z","relation":"main_file","file_size":211926,"file_id":"2294","creator":"florida"}],"publication":"International Workshop on Communication and Data Management in Large Networks (CDMLarge)","department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T08:34:00Z","author":[{"full_name":"Berenbrink, Petra","first_name":"Petra","last_name":"Berenbrink"},{"first_name":"Marco","full_name":"Riedel, Marco","last_name":"Riedel"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2018-04-05T07:00:11Z","has_accepted_license":"1","status":"public"},{"date_created":"2018-04-03T08:57:30Z","has_accepted_license":"1","status":"public","file":[{"relation":"main_file","date_updated":"2018-04-12T07:35:46Z","content_type":"application/pdf","file_id":"2289","creator":"florida","file_size":227305,"access_level":"open_access","date_created":"2018-04-12T07:35:46Z","file_name":"STOC-99.pdf"}],"publication":"STOC","file_date_updated":"2018-04-12T07:35:46Z","department":[{"_id":"79"},{"_id":"63"}],"author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"}],"user_id":"14955","title":"From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols","ddc":["040"],"language":[{"iso":"eng"}],"page":"215--224","type":"conference","year":"1999","citation":{"ieee":"C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,” in STOC, 1999, pp. 215--224.","short":"C. Scheideler, B. Vöcking, in: STOC, 1999, pp. 215--224.","mla":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” STOC, 1999, pp. 215--224.","bibtex":"@inproceedings{Scheideler_Vöcking_1999, title={From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols}, booktitle={STOC}, author={Scheideler, Christian and Vöcking, Berthold}, year={1999}, pages={215--224} }","chicago":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” In STOC, 215--224, 1999.","apa":"Scheideler, C., & Vöcking, B. (1999). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. In STOC (pp. 215--224).","ama":"Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. In: STOC. ; 1999:215--224."},"oa":"1","urn":"21668","date_updated":"2022-01-06T06:55:10Z","_id":"2166"},{"status":"public","date_created":"2018-04-03T05:51:02Z","volume":33,"author":[{"full_name":"Adler, Micah","first_name":"Micah","last_name":"Adler"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"Theory Comput. Syst.","department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","title":"Efficient Communication Strategies for Ad Hoc Wireless Networks","language":[{"iso":"eng"}],"year":"2000","type":"journal_article","citation":{"ama":"Adler M, Scheideler C. Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput Syst. 2000;33(5/6):337--391. doi:10.1007/s002240010006","apa":"Adler, M., & Scheideler, C. (2000). Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput. Syst., 33(5/6), 337--391. https://doi.org/10.1007/s002240010006","chicago":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.” Theory Comput. Syst. 33, no. 5/6 (2000): 337--391. https://doi.org/10.1007/s002240010006.","mla":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.” Theory Comput. Syst., vol. 33, no. 5/6, 2000, pp. 337--391, doi:10.1007/s002240010006.","bibtex":"@article{Adler_Scheideler_2000, title={Efficient Communication Strategies for Ad Hoc Wireless Networks}, volume={33}, DOI={10.1007/s002240010006}, number={5/6}, journal={Theory Comput. Syst.}, author={Adler, Micah and Scheideler, Christian}, year={2000}, pages={337--391} }","short":"M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391.","ieee":"M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad Hoc Wireless Networks,” Theory Comput. Syst., vol. 33, no. 5/6, pp. 337--391, 2000."},"page":"337--391","issue":"5/6","doi":"10.1007/s002240010006","intvolume":" 33","_id":"2143","date_updated":"2022-01-06T06:54:59Z"},{"_id":"2145","intvolume":" 30","date_updated":"2022-01-06T06:55:00Z","issue":"4","doi":"10.1137/S0097539799353431","language":[{"iso":"eng"}],"year":"2000","citation":{"short":"C. Scheideler, B. Vöcking, SIAM J. Comput. 30 (2000) 1126--1155.","ieee":"C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,” SIAM J. Comput., vol. 30, no. 4, pp. 1126--1155, 2000.","chicago":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” SIAM J. Comput. 30, no. 4 (2000): 1126--1155. https://doi.org/10.1137/S0097539799353431.","apa":"Scheideler, C., & Vöcking, B. (2000). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J. Comput., 30(4), 1126--1155. https://doi.org/10.1137/S0097539799353431","ama":"Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J Comput. 2000;30(4):1126--1155. doi:10.1137/S0097539799353431","mla":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” SIAM J. Comput., vol. 30, no. 4, 2000, pp. 1126--1155, doi:10.1137/S0097539799353431.","bibtex":"@article{Scheideler_Vöcking_2000, title={From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols}, volume={30}, DOI={10.1137/S0097539799353431}, number={4}, journal={SIAM J. Comput.}, author={Scheideler, Christian and Vöcking, Berthold}, year={2000}, pages={1126--1155} }"},"type":"journal_article","page":"1126--1155","user_id":"14955","title":"From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Vöcking","full_name":"Vöcking, Berthold","first_name":"Berthold"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"SIAM J. Comput.","status":"public","date_created":"2018-04-03T06:12:15Z","volume":30},{"type":"conference","year":"2000","citation":{"ieee":"P. Berenbrink, A. Brinkmann, and C. Scheideler, “Distributed Path Selection for Storage Networks,” in PDPTA, 2000.","short":"P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.","mla":"Berenbrink, Petra, et al. “Distributed Path Selection for Storage Networks.” PDPTA, 2000.","bibtex":"@inproceedings{Berenbrink_Brinkmann_Scheideler_2000, title={Distributed Path Selection for Storage Networks}, booktitle={PDPTA}, author={Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}, year={2000} }","ama":"Berenbrink P, Brinkmann A, Scheideler C. Distributed Path Selection for Storage Networks. In: PDPTA. ; 2000.","apa":"Berenbrink, P., Brinkmann, A., & Scheideler, C. (2000). Distributed Path Selection for Storage Networks. In PDPTA.","chicago":"Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “Distributed Path Selection for Storage Networks.” In PDPTA, 2000."},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:00Z","_id":"2146","urn":"21467","oa":"1","author":[{"first_name":"Petra","full_name":"Berenbrink, Petra","last_name":"Berenbrink"},{"last_name":"Brinkmann","full_name":"Brinkmann, André","first_name":"André"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"PDPTA","file_date_updated":"2018-04-12T08:47:50Z","file":[{"access_level":"open_access","file_name":"PDPTA-00.pdf","date_created":"2018-04-12T08:47:50Z","content_type":"application/pdf","date_updated":"2018-04-12T08:47:50Z","relation":"main_file","file_size":168677,"file_id":"2299","creator":"florida"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T06:13:07Z","title":"Distributed Path Selection for Storage Networks","ddc":["040"],"user_id":"14955"},{"user_id":"14955","title":"Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma","ddc":["040"],"file":[{"access_level":"open_access","date_created":"2018-04-12T08:36:17Z","file_name":"SODA-00.pdf","content_type":"application/pdf","date_updated":"2018-04-12T08:36:17Z","relation":"main_file","file_size":185001,"creator":"florida","file_id":"2295"}],"file_date_updated":"2018-04-12T08:36:17Z","department":[{"_id":"79"},{"_id":"63"}],"publication":"SODA","author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"date_created":"2018-04-03T06:16:48Z","status":"public","has_accepted_license":"1","urn":"21476","date_updated":"2022-01-06T06:55:00Z","_id":"2147","oa":"1","language":[{"iso":"eng"}],"page":"30--39","type":"conference","year":"2000","citation":{"ieee":"A. Czumaj and C. Scheideler, “Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma,” in SODA, 2000, pp. 30--39.","short":"A. Czumaj, C. Scheideler, in: SODA, 2000, pp. 30--39.","bibtex":"@inproceedings{Czumaj_Scheideler_2000, title={Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma}, booktitle={SODA}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={30--39} }","mla":"Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” SODA, 2000, pp. 30--39.","ama":"Czumaj A, Scheideler C. Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In: SODA. ; 2000:30--39.","apa":"Czumaj, A., & Scheideler, C. (2000). Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In SODA (pp. 30--39).","chicago":"Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” In SODA, 30--39, 2000."}},{"user_id":"14955","title":"Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma","status":"public","date_created":"2018-04-03T06:17:52Z","volume":17,"author":[{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"Random Struct. Algorithms","issue":"3-4","date_updated":"2022-01-06T06:55:00Z","_id":"2148","intvolume":" 17","language":[{"iso":"eng"}],"year":"2000","citation":{"apa":"Czumaj, A., & Scheideler, C. (2000). Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct. Algorithms, 17(3–4), 213--237.","ama":"Czumaj A, Scheideler C. Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct Algorithms. 2000;17(3-4):213--237.","chicago":"Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms 17, no. 3–4 (2000): 213--237.","mla":"Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms, vol. 17, no. 3–4, 2000, pp. 213--237.","bibtex":"@article{Czumaj_Scheideler_2000, title={Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma}, volume={17}, number={3–4}, journal={Random Struct. Algorithms}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={213--237} }","short":"A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237.","ieee":"A. Czumaj and C. Scheideler, “Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma,” Random Struct. Algorithms, vol. 17, no. 3–4, pp. 213--237, 2000."},"type":"journal_article","page":"213--237"},{"language":[{"iso":"eng"}],"page":"119--128","type":"conference","year":"2000","citation":{"short":"A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.","ieee":"A. Brinkmann, K. Salzwedel, and C. Scheideler, “Efficient, distributed data placement strategies for storage area networks (extended abstract),” in SPAA, 2000, pp. 119--128.","chicago":"Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” In SPAA, 119--128, 2000.","apa":"Brinkmann, A., Salzwedel, K., & Scheideler, C. (2000). Efficient, distributed data placement strategies for storage area networks (extended abstract). In SPAA (pp. 119--128).","ama":"Brinkmann A, Salzwedel K, Scheideler C. Efficient, distributed data placement strategies for storage area networks (extended abstract). In: SPAA. ; 2000:119--128.","mla":"Brinkmann, André, et al. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” SPAA, 2000, pp. 119--128.","bibtex":"@inproceedings{Brinkmann_Salzwedel_Scheideler_2000, title={Efficient, distributed data placement strategies for storage area networks (extended abstract)}, booktitle={SPAA}, author={Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}, year={2000}, pages={119--128} }"},"oa":"1","urn":"21493","date_updated":"2022-01-06T06:55:02Z","_id":"2149","date_created":"2018-04-03T06:18:45Z","status":"public","has_accepted_license":"1","file":[{"file_size":222176,"creator":"florida","file_id":"2297","date_updated":"2018-04-12T08:38:13Z","content_type":"application/pdf","relation":"main_file","date_created":"2018-04-12T08:38:13Z","file_name":"spaa_00.pdf","access_level":"open_access"}],"publication":"SPAA","department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T08:38:13Z","author":[{"last_name":"Brinkmann","full_name":"Brinkmann, André","first_name":"André"},{"first_name":"Kay","full_name":"Salzwedel, Kay","last_name":"Salzwedel"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"user_id":"14955","title":"Efficient, distributed data placement strategies for storage area networks (extended abstract)","ddc":["040"]},{"_id":"2150","urn":"21509","year":"2000","citation":{"bibtex":"@inproceedings{Czumaj_Scheideler_2000, title={A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)}, booktitle={STOC}, publisher={ACM}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={38--47} }","mla":"Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (Extended Abstract).” STOC, ACM, 2000, pp. 38--47.","ama":"Czumaj A, Scheideler C. A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In: STOC. ACM; 2000:38--47.","apa":"Czumaj, A., & Scheideler, C. (2000). A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In STOC (pp. 38--47). ACM.","chicago":"Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (Extended Abstract).” In STOC, 38--47. ACM, 2000.","ieee":"A. Czumaj and C. Scheideler, “A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract),” in STOC, 2000, pp. 38--47.","short":"A. Czumaj, C. Scheideler, in: STOC, ACM, 2000, pp. 38--47."},"type":"conference","page":"38--47","user_id":"14955","ddc":["040"],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T06:21:11Z","file":[{"file_name":"STOC-00.pdf","date_created":"2018-04-12T08:49:23Z","access_level":"open_access","file_size":190083,"file_id":"2300","creator":"florida","date_updated":"2018-04-12T08:49:23Z","content_type":"application/pdf","relation":"main_file"}],"author":[{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"ACM","publication":"STOC","file_date_updated":"2018-04-12T08:49:23Z","oa":"1","date_updated":"2022-01-06T06:55:02Z","language":[{"iso":"eng"}],"title":"A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)","department":[{"_id":"79"},{"_id":"63"}]},{"_id":"2211","date_updated":"2022-01-06T06:55:26Z","urn":"22111","oa":"1","language":[{"iso":"eng"}],"type":"conference","citation":{"mla":"Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.","bibtex":"@inproceedings{Czumaj_Scheideler_2000, title={A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems }, booktitle={32nd ACM Symposium on Theory of Computing}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={38–47} }","chicago":"Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” In 32nd ACM Symposium on Theory of Computing, 38–47, 2000.","apa":"Czumaj, A., & Scheideler, C. (2000). A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In 32nd ACM Symposium on Theory of Computing (pp. 38–47).","ama":"Czumaj A, Scheideler C. A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In: 32nd ACM Symposium on Theory of Computing. ; 2000:38-47.","ieee":"A. Czumaj and C. Scheideler, “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ,” in 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.","short":"A. Czumaj, C. Scheideler, in: 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47."},"year":"2000","page":"38-47","user_id":"14955","ddc":["040"],"title":"A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ","file":[{"file_name":"STOC-00.pdf","date_created":"2018-04-12T08:37:23Z","access_level":"open_access","file_id":"2296","creator":"florida","file_size":190083,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T08:37:23Z"}],"author":[{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file_date_updated":"2018-04-12T08:37:23Z","department":[{"_id":"79"},{"_id":"63"}],"publication":"32nd ACM Symposium on Theory of Computing","status":"public","has_accepted_license":"1","date_created":"2018-04-05T07:02:46Z"},{"status":"public","date_created":"2018-04-03T05:47:20Z","volume":21,"author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"Combinatorica","user_id":"14955","title":"Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols","language":[{"iso":"eng"}],"year":"2001","type":"journal_article","citation":{"short":"F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138.","ieee":"F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols,” Combinatorica, vol. 21, no. 1, pp. 95--138, 2001.","apa":"Meyer auf der Heide, F., & Scheideler, C. (2001). Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica, 21(1), 95--138. https://doi.org/10.1007/s004930170007","ama":"Meyer auf der Heide F, Scheideler C. Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica. 2001;21(1):95--138. doi:10.1007/s004930170007","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica 21, no. 1 (2001): 95--138. https://doi.org/10.1007/s004930170007.","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica, vol. 21, no. 1, 2001, pp. 95--138, doi:10.1007/s004930170007.","bibtex":"@article{Meyer auf der Heide_Scheideler_2001, title={Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols}, volume={21}, DOI={10.1007/s004930170007}, number={1}, journal={Combinatorica}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2001}, pages={95--138} }"},"page":"95--138","issue":"1","doi":"10.1007/s004930170007","intvolume":" 21","_id":"2139","date_updated":"2022-01-06T06:54:57Z"},{"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:48:28Z","publisher":"IEEE Computer Society","author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"first_name":"Petra","full_name":"Berenbrink, Petra","last_name":"Berenbrink"},{"first_name":"André","full_name":"Brinkmann, André","last_name":"Brinkmann"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"department":[{"_id":"79"}],"publication":"FOCS","file_date_updated":"2018-04-12T08:59:00Z","file":[{"file_id":"2302","creator":"florida","file_size":151156,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T08:59:00Z","date_created":"2018-04-12T08:59:00Z","file_name":"FOCS-01.pdf","access_level":"open_access"}],"title":"Simple Routing Strategies for Adversarial Systems","ddc":["040"],"user_id":"15504","year":"2001","type":"conference","citation":{"apa":"Awerbuch, B., Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). Simple Routing Strategies for Adversarial Systems. In FOCS (pp. 158--167). IEEE Computer Society.","ama":"Awerbuch B, Berenbrink P, Brinkmann A, Scheideler C. Simple Routing Strategies for Adversarial Systems. In: FOCS. IEEE Computer Society; 2001:158--167.","chicago":"Awerbuch, Baruch, Petra Berenbrink, André Brinkmann, and Christian Scheideler. “Simple Routing Strategies for Adversarial Systems.” In FOCS, 158--167. IEEE Computer Society, 2001.","mla":"Awerbuch, Baruch, et al. “Simple Routing Strategies for Adversarial Systems.” FOCS, IEEE Computer Society, 2001, pp. 158--167.","bibtex":"@inproceedings{Awerbuch_Berenbrink_Brinkmann_Scheideler_2001, title={Simple Routing Strategies for Adversarial Systems}, booktitle={FOCS}, publisher={IEEE Computer Society}, author={Awerbuch, Baruch and Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}, year={2001}, pages={158--167} }","short":"B. Awerbuch, P. Berenbrink, A. Brinkmann, C. Scheideler, in: FOCS, IEEE Computer Society, 2001, pp. 158--167.","ieee":"B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler, “Simple Routing Strategies for Adversarial Systems,” in FOCS, 2001, pp. 158--167."},"page":"158--167","oa":"1","date_updated":"2022-01-06T06:54:59Z","_id":"2140","urn":"21406"},{"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:49:21Z","file":[{"access_level":"open_access","file_name":"PDP-00.pdf","date_created":"2018-04-12T08:39:01Z","relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T08:39:01Z","file_id":"2298","creator":"florida","file_size":85778}],"publisher":"IEEE Computer Society","author":[{"full_name":"Berenbrink, Petra","first_name":"Petra","last_name":"Berenbrink"},{"last_name":"Brinkmann","full_name":"Brinkmann, André","first_name":"André"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file_date_updated":"2018-04-12T08:39:01Z","publication":"PDP","user_id":"14955","ddc":["040"],"citation":{"chicago":"Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “SIMLAB-A Simulation Environment for Storage Area Networks.” In PDP, 227--234. IEEE Computer Society, 2001.","apa":"Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). SIMLAB-A Simulation Environment for Storage Area Networks. In PDP (pp. 227--234). IEEE Computer Society.","ama":"Berenbrink P, Brinkmann A, Scheideler C. SIMLAB-A Simulation Environment for Storage Area Networks. In: PDP. IEEE Computer Society; 2001:227--234.","mla":"Berenbrink, Petra, et al. “SIMLAB-A Simulation Environment for Storage Area Networks.” PDP, IEEE Computer Society, 2001, pp. 227--234.","bibtex":"@inproceedings{Berenbrink_Brinkmann_Scheideler_2001, title={SIMLAB-A Simulation Environment for Storage Area Networks}, booktitle={PDP}, publisher={IEEE Computer Society}, author={Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}, year={2001}, pages={227--234} }","short":"P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society, 2001, pp. 227--234.","ieee":"P. Berenbrink, A. Brinkmann, and C. Scheideler, “SIMLAB-A Simulation Environment for Storage Area Networks,” in PDP, 2001, pp. 227--234."},"year":"2001","type":"conference","page":"227--234","_id":"2141","urn":"21415","department":[{"_id":"79"},{"_id":"63"}],"title":"SIMLAB-A Simulation Environment for Storage Area Networks","language":[{"iso":"eng"}],"oa":"1","date_updated":"2022-01-06T06:54:59Z"},{"file":[{"content_type":"application/pdf","date_updated":"2018-04-12T08:58:07Z","relation":"main_file","file_size":335171,"creator":"florida","file_id":"2301","access_level":"open_access","file_name":"SPAA-01.pdf","date_created":"2018-04-12T08:58:07Z"}],"author":[{"full_name":"Kolman, Petr","first_name":"Petr","last_name":"Kolman"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"department":[{"_id":"79"}],"file_date_updated":"2018-04-12T08:58:07Z","publication":"SPAA","has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:50:16Z","user_id":"15504","title":"Simple on-line algorithms for the maximum disjoint paths problem","ddc":["040"],"type":"conference","year":"2001","citation":{"short":"P. Kolman, C. Scheideler, in: SPAA, 2001, pp. 38--47.","ieee":"P. Kolman and C. Scheideler, “Simple on-line algorithms for the maximum disjoint paths problem,” in SPAA, 2001, pp. 38--47.","ama":"Kolman P, Scheideler C. Simple on-line algorithms for the maximum disjoint paths problem. In: SPAA. ; 2001:38--47.","apa":"Kolman, P., & Scheideler, C. (2001). Simple on-line algorithms for the maximum disjoint paths problem. In SPAA (pp. 38--47).","chicago":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” In SPAA, 38--47, 2001.","bibtex":"@inproceedings{Kolman_Scheideler_2001, title={Simple on-line algorithms for the maximum disjoint paths problem}, booktitle={SPAA}, author={Kolman, Petr and Scheideler, Christian}, year={2001}, pages={38--47} }","mla":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” SPAA, 2001, pp. 38--47."},"page":"38--47","_id":"2142","date_updated":"2022-01-06T06:54:59Z","urn":"21421","oa":"1"},{"title":"Improved Bounds for Acyclic Job Shop Scheduling","user_id":"15504","status":"public","date_created":"2018-04-03T05:43:36Z","author":[{"last_name":"Feige","first_name":"Uriel","full_name":"Feige, Uriel"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"department":[{"_id":"79"}],"publication":"Combinatorica","doi":"10.1007/s004930200018","issue":"3","date_updated":"2022-01-06T06:54:55Z","_id":"2134","type":"journal_article","citation":{"ieee":"U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling,” Combinatorica, no. 3, pp. 361--399, 2002.","short":"U. Feige, C. Scheideler, Combinatorica (2002) 361--399.","mla":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling.” Combinatorica, no. 3, 2002, pp. 361--399, doi:10.1007/s004930200018.","bibtex":"@article{Feige_Scheideler_2002, title={Improved Bounds for Acyclic Job Shop Scheduling}, DOI={10.1007/s004930200018}, number={3}, journal={Combinatorica}, author={Feige, Uriel and Scheideler, Christian}, year={2002}, pages={361--399} }","chicago":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling.” Combinatorica, no. 3 (2002): 361--399. https://doi.org/10.1007/s004930200018.","ama":"Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling. Combinatorica. 2002;(3):361--399. doi:10.1007/s004930200018","apa":"Feige, U., & Scheideler, C. (2002). Improved Bounds for Acyclic Job Shop Scheduling. Combinatorica, (3), 361--399. https://doi.org/10.1007/s004930200018"},"year":"2002","page":"361--399"},{"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:44:11Z","file":[{"date_created":"2018-04-12T08:59:58Z","file_name":"SODA-02.pdf","access_level":"open_access","file_size":246604,"file_id":"2303","creator":"florida","content_type":"application/pdf","date_updated":"2018-04-12T08:59:58Z","relation":"main_file"}],"publisher":"ACM/SIAM","author":[{"last_name":"Kolman","full_name":"Kolman, Petr","first_name":"Petr"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"department":[{"_id":"79"}],"publication":"SODA","file_date_updated":"2018-04-12T08:59:58Z","user_id":"15504","title":"Improved bounds for the unsplittable flow problem","ddc":["040"],"type":"conference","citation":{"bibtex":"@inproceedings{Kolman_Scheideler_2002, title={Improved bounds for the unsplittable flow problem}, booktitle={SODA}, publisher={ACM/SIAM}, author={Kolman, Petr and Scheideler, Christian}, year={2002}, pages={184--193} }","mla":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” SODA, ACM/SIAM, 2002, pp. 184--193.","chicago":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” In SODA, 184--193. ACM/SIAM, 2002.","apa":"Kolman, P., & Scheideler, C. (2002). Improved bounds for the unsplittable flow problem. In SODA (pp. 184--193). ACM/SIAM.","ama":"Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem. In: SODA. ACM/SIAM; 2002:184--193.","ieee":"P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,” in SODA, 2002, pp. 184--193.","short":"P. Kolman, C. Scheideler, in: SODA, ACM/SIAM, 2002, pp. 184--193."},"year":"2002","page":"184--193","oa":"1","_id":"2135","date_updated":"2022-01-06T06:54:55Z","urn":"21357"},{"file":[{"creator":"florida","file_id":"2305","file_size":123373,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:02:22Z","date_created":"2018-04-12T09:02:22Z","file_name":"BSS-SPAA-02.pdf","access_level":"open_access"}],"author":[{"last_name":"Brinkmann","full_name":"Brinkmann, André","first_name":"André"},{"last_name":"Salzwedel","full_name":"Salzwedel, Kay","first_name":"Kay"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publication":"SPAA","department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T09:02:22Z","has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:44:56Z","user_id":"14955","title":"Compact, adaptive placement schemes for non-uniform requirements","ddc":["040"],"language":[{"iso":"eng"}],"type":"conference","citation":{"bibtex":"@inproceedings{Brinkmann_Salzwedel_Scheideler_2002, title={Compact, adaptive placement schemes for non-uniform requirements}, booktitle={SPAA}, author={Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}, year={2002}, pages={53--62} }","mla":"Brinkmann, André, et al. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” SPAA, 2002, pp. 53--62.","chicago":"Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” In SPAA, 53--62, 2002.","ama":"Brinkmann A, Salzwedel K, Scheideler C. Compact, adaptive placement schemes for non-uniform requirements. In: SPAA. ; 2002:53--62.","apa":"Brinkmann, A., Salzwedel, K., & Scheideler, C. (2002). Compact, adaptive placement schemes for non-uniform requirements. In SPAA (pp. 53--62).","ieee":"A. Brinkmann, K. Salzwedel, and C. Scheideler, “Compact, adaptive placement schemes for non-uniform requirements,” in SPAA, 2002, pp. 53--62.","short":"A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2002, pp. 53--62."},"year":"2002","page":"53--62","_id":"2136","date_updated":"2022-01-06T06:54:56Z","urn":"21366","oa":"1"},{"ddc":["040"],"title":"Algorithms for fault-tolerant routing in circuit switched networks","user_id":"15504","publication":"SPAA","department":[{"_id":"79"}],"file_date_updated":"2018-04-12T09:03:44Z","author":[{"full_name":"Bagchi, Amitabha","first_name":"Amitabha","last_name":"Bagchi"},{"first_name":"Amitabh","full_name":"Chaudhary, Amitabh","last_name":"Chaudhary"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Kolman","full_name":"Kolman, Petr","first_name":"Petr"}],"file":[{"file_id":"2306","creator":"florida","file_size":187124,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:03:44Z","file_name":"BCKS-SPAA-02.pdf","date_created":"2018-04-12T09:03:44Z","access_level":"open_access"}],"date_created":"2018-04-03T05:45:44Z","has_accepted_license":"1","status":"public","urn":"21376","date_updated":"2022-01-06T06:54:57Z","_id":"2137","oa":"1","page":"265--274","year":"2002","type":"conference","citation":{"ieee":"A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, “Algorithms for fault-tolerant routing in circuit switched networks,” in SPAA, 2002, pp. 265--274.","short":"A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, in: SPAA, 2002, pp. 265--274.","bibtex":"@inproceedings{Bagchi_Chaudhary_Scheideler_Kolman_2002, title={Algorithms for fault-tolerant routing in circuit switched networks}, booktitle={SPAA}, author={Bagchi, Amitabha and Chaudhary, Amitabh and Scheideler, Christian and Kolman, Petr}, year={2002}, pages={265--274} }","mla":"Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” SPAA, 2002, pp. 265--274.","apa":"Bagchi, A., Chaudhary, A., Scheideler, C., & Kolman, P. (2002). Algorithms for fault-tolerant routing in circuit switched networks. In SPAA (pp. 265--274).","ama":"Bagchi A, Chaudhary A, Scheideler C, Kolman P. Algorithms for fault-tolerant routing in circuit switched networks. In: SPAA. ; 2002:265--274.","chicago":"Bagchi, Amitabha, Amitabh Chaudhary, Christian Scheideler, and Petr Kolman. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” In SPAA, 265--274, 2002."}},{"date_created":"2018-04-03T05:46:38Z","status":"public","has_accepted_license":"1","volume":2285,"file":[{"access_level":"open_access","date_created":"2018-04-12T09:01:03Z","file_name":"STACS-02.pdf","date_updated":"2018-04-12T09:01:03Z","content_type":"application/pdf","relation":"main_file","file_size":273875,"creator":"florida","file_id":"2304"}],"file_date_updated":"2018-04-12T09:01:03Z","publication":"STACS","publisher":"Springer","author":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"user_id":"15504","ddc":["040"],"page":"27--49","type":"conference","year":"2002","citation":{"chicago":"Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” In STACS, 2285:27--49. Lecture Notes in Computer Science. Springer, 2002.","apa":"Scheideler, C. (2002). Models and Techniques for Communication in Dynamic Networks. In STACS (Vol. 2285, pp. 27--49). Springer.","ama":"Scheideler C. Models and Techniques for Communication in Dynamic Networks. In: STACS. Vol 2285. Lecture Notes in Computer Science. Springer; 2002:27--49.","mla":"Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” STACS, vol. 2285, Springer, 2002, pp. 27--49.","bibtex":"@inproceedings{Scheideler_2002, series={Lecture Notes in Computer Science}, title={Models and Techniques for Communication in Dynamic Networks}, volume={2285}, booktitle={STACS}, publisher={Springer}, author={Scheideler, Christian}, year={2002}, pages={27--49}, collection={Lecture Notes in Computer Science} }","short":"C. Scheideler, in: STACS, Springer, 2002, pp. 27--49.","ieee":"C. Scheideler, “Models and Techniques for Communication in Dynamic Networks,” in STACS, 2002, vol. 2285, pp. 27--49."},"urn":"21386","intvolume":" 2285","_id":"2138","department":[{"_id":"79"}],"title":"Models and Techniques for Communication in Dynamic Networks","series_title":"Lecture Notes in Computer Science","oa":"1","date_updated":"2022-01-06T06:54:57Z"},{"author":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"full_name":"Salzwedel, Kay","first_name":"Kay","last_name":"Salzwedel"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"André","full_name":"Brinkmann, André","last_name":"Brinkmann"},{"last_name":"Vodisek","full_name":"Vodisek, Mario","first_name":"Mario"},{"full_name":"Rückert, Ulrich","first_name":"Ulrich","last_name":"Rückert"}],"department":[{"_id":"63"},{"_id":"58"},{"_id":"79"}],"publication":"Proceedings of SSGRR 2003","file_date_updated":"2020-09-30T12:03:57Z","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2020-09-30T12:03:57Z","file_id":"19793","creator":"koala","file_size":499057,"access_level":"closed","file_name":"pub-hni-908.pdf","date_created":"2020-09-30T12:03:57Z"}],"status":"public","has_accepted_license":"1","date_created":"2020-09-30T12:04:14Z","abstract":[{"text":"The advances in Internet technology have led to tremendous improvements in business, education, and science and have changed the way we think, live, and communicate. Information exchange has become ubiquitous by the possibilities offered through modern technologies. We are able to offer information 24 hours a day through our web sites and can leave messages every time and from anywhere in the world. This change in communication has led to new challenges. Enterprises have to deal with an information amount that doubles every year. The technological foundation to cope with this information explosion is given by Storage Area Networks (SANs), which are able to connect a great number of storage systems over a fast interconnection network. However, to be able to use the benefits of a SAN, an easy-to-use and efficient management support has to be given to the storage administrator. In this paper, we will suggest new storage management concepts and we will introduce a new management environment that is able to significantly reduce management costs and increases the performance and resource utilization of the given SAN infrastructure.","lang":"eng"}],"title":"Storage Management as Means to cope with Exponential Information Growth","ddc":["000"],"user_id":"15415","citation":{"mla":"Scheideler, Christian, et al. “Storage Management as Means to Cope with Exponential Information Growth.” Proceedings of SSGRR 2003, 2003.","bibtex":"@inproceedings{Scheideler_Salzwedel_Meyer auf der Heide_Brinkmann_Vodisek_Rückert_2003, title={Storage Management as Means to cope with Exponential Information Growth}, booktitle={Proceedings of SSGRR 2003}, author={Scheideler, Christian and Salzwedel, Kay and Meyer auf der Heide, Friedhelm and Brinkmann, André and Vodisek, Mario and Rückert, Ulrich}, year={2003} }","chicago":"Scheideler, Christian, Kay Salzwedel, Friedhelm Meyer auf der Heide, André Brinkmann, Mario Vodisek, and Ulrich Rückert. “Storage Management as Means to Cope with Exponential Information Growth.” In Proceedings of SSGRR 2003, 2003.","ama":"Scheideler C, Salzwedel K, Meyer auf der Heide F, Brinkmann A, Vodisek M, Rückert U. Storage Management as Means to cope with Exponential Information Growth. In: Proceedings of SSGRR 2003. ; 2003.","apa":"Scheideler, C., Salzwedel, K., Meyer auf der Heide, F., Brinkmann, A., Vodisek, M., & Rückert, U. (2003). Storage Management as Means to cope with Exponential Information Growth. In Proceedings of SSGRR 2003.","ieee":"C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, and U. Rückert, “Storage Management as Means to cope with Exponential Information Growth,” in Proceedings of SSGRR 2003, 2003.","short":"C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, U. Rückert, in: Proceedings of SSGRR 2003, 2003."},"year":"2003","type":"conference","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:12Z","_id":"19790"},{"user_id":"14955","title":"Smoothed Motion Complexity","department":[{"_id":"79"},{"_id":"63"}],"publication":"ESA","author":[{"last_name":"Damerow","full_name":"Damerow, Valentina","first_name":"Valentina"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Räcke, Harald","first_name":"Harald","last_name":"Räcke"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"}],"publisher":"Springer","date_created":"2018-04-03T05:37:10Z","status":"public","volume":2832,"_id":"2128","date_updated":"2022-01-06T06:54:52Z","intvolume":" 2832","doi":"10.1007/978-3-540-39658-1_17","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"page":"161--171","type":"conference","citation":{"short":"V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, in: ESA, Springer, 2003, pp. 161--171.","ieee":"V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, and C. Sohler, “Smoothed Motion Complexity,” in ESA, 2003, vol. 2832, pp. 161--171.","chicago":"Damerow, Valentina, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, and Christian Sohler. “Smoothed Motion Complexity.” In ESA, 2832:161--171. Lecture Notes in Computer Science. Springer, 2003. https://doi.org/10.1007/978-3-540-39658-1_17.","apa":"Damerow, V., Meyer auf der Heide, F., Räcke, H., Scheideler, C., & Sohler, C. (2003). Smoothed Motion Complexity. In ESA (Vol. 2832, pp. 161--171). Springer. https://doi.org/10.1007/978-3-540-39658-1_17","ama":"Damerow V, Meyer auf der Heide F, Räcke H, Scheideler C, Sohler C. Smoothed Motion Complexity. In: ESA. Vol 2832. Lecture Notes in Computer Science. Springer; 2003:161--171. doi:10.1007/978-3-540-39658-1_17","mla":"Damerow, Valentina, et al. “Smoothed Motion Complexity.” ESA, vol. 2832, Springer, 2003, pp. 161--171, doi:10.1007/978-3-540-39658-1_17.","bibtex":"@inproceedings{Damerow_Meyer auf der Heide_Räcke_Scheideler_Sohler_2003, series={Lecture Notes in Computer Science}, title={Smoothed Motion Complexity}, volume={2832}, DOI={10.1007/978-3-540-39658-1_17}, booktitle={ESA}, publisher={Springer}, author={Damerow, Valentina and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian}, year={2003}, pages={161--171}, collection={Lecture Notes in Computer Science} }"},"year":"2003"},{"title":"Anycasting in Adversarial Systems: Routing and Admission Control","department":[{"_id":"79"},{"_id":"63"}],"oa":"1","date_updated":"2022-01-06T06:54:53Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","ddc":["040"],"user_id":"14955","volume":2719,"date_created":"2018-04-03T05:38:36Z","status":"public","has_accepted_license":"1","file_date_updated":"2018-04-12T09:04:48Z","publication":"ICALP","publisher":"Springer","author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"last_name":"Brinkmann","first_name":"André","full_name":"Brinkmann, André"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"creator":"florida","file_id":"2307","file_size":154427,"relation":"main_file","date_updated":"2018-04-12T09:04:48Z","content_type":"application/pdf","date_created":"2018-04-12T09:04:48Z","file_name":"ICALP-03.pdf","access_level":"open_access"}],"urn":"21297","intvolume":" 2719","_id":"2129","page":"1153--1168","citation":{"ieee":"B. Awerbuch, A. Brinkmann, and C. Scheideler, “Anycasting in Adversarial Systems: Routing and Admission Control,” in ICALP, 2003, vol. 2719, pp. 1153--1168.","short":"B. Awerbuch, A. Brinkmann, C. Scheideler, in: ICALP, Springer, 2003, pp. 1153--1168.","mla":"Awerbuch, Baruch, et al. “Anycasting in Adversarial Systems: Routing and Admission Control.” ICALP, vol. 2719, Springer, 2003, pp. 1153--1168.","bibtex":"@inproceedings{Awerbuch_Brinkmann_Scheideler_2003, series={Lecture Notes in Computer Science}, title={Anycasting in Adversarial Systems: Routing and Admission Control}, volume={2719}, booktitle={ICALP}, publisher={Springer}, author={Awerbuch, Baruch and Brinkmann, André and Scheideler, Christian}, year={2003}, pages={1153--1168}, collection={Lecture Notes in Computer Science} }","apa":"Awerbuch, B., Brinkmann, A., & Scheideler, C. (2003). Anycasting in Adversarial Systems: Routing and Admission Control. In ICALP (Vol. 2719, pp. 1153--1168). Springer.","ama":"Awerbuch B, Brinkmann A, Scheideler C. Anycasting in Adversarial Systems: Routing and Admission Control. In: ICALP. Vol 2719. Lecture Notes in Computer Science. Springer; 2003:1153--1168.","chicago":"Awerbuch, Baruch, André Brinkmann, and Christian Scheideler. “Anycasting in Adversarial Systems: Routing and Admission Control.” In ICALP, 2719:1153--1168. Lecture Notes in Computer Science. Springer, 2003."},"type":"conference","year":"2003"},{"date_created":"2018-04-03T05:39:48Z","has_accepted_license":"1","status":"public","file":[{"relation":"main_file","date_updated":"2018-04-12T09:10:10Z","content_type":"application/pdf","file_id":"2308","creator":"florida","file_size":127013,"access_level":"open_access","file_name":"PODC-03.pdf","date_created":"2018-04-12T09:10:10Z"}],"publication":"PODC","file_date_updated":"2018-04-12T09:10:10Z","department":[{"_id":"79"}],"publisher":"ACM","author":[{"last_name":"Awerbuch","full_name":"Awerbuch, Baruch","first_name":"Baruch"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"user_id":"15504","title":"Peer-to-peer systems for prefix search","ddc":["040"],"page":"123--132","citation":{"ieee":"B. Awerbuch and C. Scheideler, “Peer-to-peer systems for prefix search,” in PODC, 2003, pp. 123--132.","short":"B. Awerbuch, C. Scheideler, in: PODC, ACM, 2003, pp. 123--132.","bibtex":"@inproceedings{Awerbuch_Scheideler_2003, title={Peer-to-peer systems for prefix search}, booktitle={PODC}, publisher={ACM}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2003}, pages={123--132} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” PODC, ACM, 2003, pp. 123--132.","apa":"Awerbuch, B., & Scheideler, C. (2003). Peer-to-peer systems for prefix search. In PODC (pp. 123--132). ACM.","ama":"Awerbuch B, Scheideler C. Peer-to-peer systems for prefix search. In: PODC. ACM; 2003:123--132.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” In PODC, 123--132. ACM, 2003."},"type":"conference","year":"2003","oa":"1","urn":"21303","_id":"2130","date_updated":"2022-01-06T06:54:53Z"},{"department":[{"_id":"79"}],"title":"Perfectly Balanced Allocation","series_title":"Lecture Notes in Computer Science","date_updated":"2022-01-06T06:54:54Z","oa":"1","file":[{"file_name":"RANDOM-03.pdf","date_created":"2018-04-12T09:16:17Z","access_level":"open_access","file_size":112587,"creator":"florida","file_id":"2310","content_type":"application/pdf","date_updated":"2018-04-12T09:16:17Z","relation":"main_file"}],"publication":"RANDOM-APPROX","file_date_updated":"2018-04-12T09:16:17Z","author":[{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"},{"last_name":"Riley","full_name":"Riley, Chris","first_name":"Chris"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publisher":"Springer","date_created":"2018-04-03T05:41:01Z","status":"public","has_accepted_license":"1","volume":2764,"user_id":"15504","ddc":["040"],"page":"240--251","year":"2003","type":"conference","citation":{"short":"A. Czumaj, C. Riley, C. Scheideler, in: RANDOM-APPROX, Springer, 2003, pp. 240--251.","ieee":"A. Czumaj, C. Riley, and C. Scheideler, “Perfectly Balanced Allocation,” in RANDOM-APPROX, 2003, vol. 2764, pp. 240--251.","chicago":"Czumaj, Artur, Chris Riley, and Christian Scheideler. “Perfectly Balanced Allocation.” In RANDOM-APPROX, 2764:240--251. Lecture Notes in Computer Science. Springer, 2003.","apa":"Czumaj, A., Riley, C., & Scheideler, C. (2003). Perfectly Balanced Allocation. In RANDOM-APPROX (Vol. 2764, pp. 240--251). Springer.","ama":"Czumaj A, Riley C, Scheideler C. Perfectly Balanced Allocation. In: RANDOM-APPROX. Vol 2764. Lecture Notes in Computer Science. Springer; 2003:240--251.","mla":"Czumaj, Artur, et al. “Perfectly Balanced Allocation.” RANDOM-APPROX, vol. 2764, Springer, 2003, pp. 240--251.","bibtex":"@inproceedings{Czumaj_Riley_Scheideler_2003, series={Lecture Notes in Computer Science}, title={Perfectly Balanced Allocation}, volume={2764}, booktitle={RANDOM-APPROX}, publisher={Springer}, author={Czumaj, Artur and Riley, Chris and Scheideler, Christian}, year={2003}, pages={240--251}, collection={Lecture Notes in Computer Science} }"},"urn":"21313","_id":"2131","intvolume":" 2764"},{"urn":"21320","date_updated":"2022-01-06T06:54:54Z","_id":"2132","oa":"1","page":"220--229","year":"2003","citation":{"ieee":"L. Jia, R. Rajaraman, and C. Scheideler, “On local algorithms for topology control and routing in ad hoc networks,” in SPAA, 2003, pp. 220--229.","short":"L. Jia, R. Rajaraman, C. Scheideler, in: SPAA, ACM, 2003, pp. 220--229.","mla":"Jia, Lujun, et al. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” SPAA, ACM, 2003, pp. 220--229.","bibtex":"@inproceedings{Jia_Rajaraman_Scheideler_2003, title={On local algorithms for topology control and routing in ad hoc networks}, booktitle={SPAA}, publisher={ACM}, author={Jia, Lujun and Rajaraman, Rajmohan and Scheideler, Christian}, year={2003}, pages={220--229} }","chicago":"Jia, Lujun, Rajmohan Rajaraman, and Christian Scheideler. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” In SPAA, 220--229. ACM, 2003.","ama":"Jia L, Rajaraman R, Scheideler C. On local algorithms for topology control and routing in ad hoc networks. In: SPAA. ACM; 2003:220--229.","apa":"Jia, L., Rajaraman, R., & Scheideler, C. (2003). On local algorithms for topology control and routing in ad hoc networks. In SPAA (pp. 220--229). ACM."},"type":"conference","user_id":"15504","ddc":["040"],"title":"On local algorithms for topology control and routing in ad hoc networks","file":[{"date_created":"2018-04-12T09:18:55Z","file_name":"JRS-SPAA-03.pdf","access_level":"open_access","creator":"florida","file_id":"2311","file_size":224200,"relation":"main_file","date_updated":"2018-04-12T09:18:55Z","content_type":"application/pdf"}],"department":[{"_id":"79"}],"file_date_updated":"2018-04-12T09:18:55Z","publication":"SPAA","author":[{"last_name":"Jia","full_name":"Jia, Lujun","first_name":"Lujun"},{"last_name":"Rajaraman","full_name":"Rajaraman, Rajmohan","first_name":"Rajmohan"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publisher":"ACM","date_created":"2018-04-03T05:41:53Z","has_accepted_license":"1","status":"public"},{"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:42:48Z","file":[{"date_created":"2018-04-12T09:13:43Z","file_name":"KS-SPAA-03.pdf","access_level":"open_access","file_id":"2309","creator":"florida","file_size":121448,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:15:24Z"}],"author":[{"last_name":"Kothapalli","full_name":"Kothapalli, Kishore","first_name":"Kishore"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publisher":"ACM","file_date_updated":"2018-04-12T09:15:24Z","department":[{"_id":"79"}],"publication":"SPAA","user_id":"15504","ddc":["040"],"title":"Information gathering in adversarial systems: lines and cycles","citation":{"bibtex":"@inproceedings{Kothapalli_Scheideler_2003, title={Information gathering in adversarial systems: lines and cycles}, booktitle={SPAA}, publisher={ACM}, author={Kothapalli, Kishore and Scheideler, Christian}, year={2003}, pages={333--342} }","mla":"Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial Systems: Lines and Cycles.” SPAA, ACM, 2003, pp. 333--342.","chicago":"Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial Systems: Lines and Cycles.” In SPAA, 333--342. ACM, 2003.","ama":"Kothapalli K, Scheideler C. Information gathering in adversarial systems: lines and cycles. In: SPAA. ACM; 2003:333--342.","apa":"Kothapalli, K., & Scheideler, C. (2003). Information gathering in adversarial systems: lines and cycles. In SPAA (pp. 333--342). ACM.","ieee":"K. Kothapalli and C. Scheideler, “Information gathering in adversarial systems: lines and cycles,” in SPAA, 2003, pp. 333--342.","short":"K. Kothapalli, C. Scheideler, in: SPAA, ACM, 2003, pp. 333--342."},"type":"conference","year":"2003","page":"333--342","oa":"1","date_updated":"2022-01-06T06:54:55Z","_id":"2133","urn":"21338"},{"status":"public","date_created":"2018-04-03T05:30:23Z","author":[{"first_name":"Petr","full_name":"Kolman, Petr","last_name":"Kolman"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"Algorithmica","department":[{"_id":"79"}],"title":"Simple On-Line Algorithms for the Maximum Disjoint Paths Problem","user_id":"15504","citation":{"ieee":"P. Kolman and C. Scheideler, “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem,” Algorithmica, no. 3, pp. 209--233, 2004.","short":"P. Kolman, C. Scheideler, Algorithmica (2004) 209--233.","bibtex":"@article{Kolman_Scheideler_2004, title={Simple On-Line Algorithms for the Maximum Disjoint Paths Problem}, DOI={10.1007/s00453-004-1086-1}, number={3}, journal={Algorithmica}, author={Kolman, Petr and Scheideler, Christian}, year={2004}, pages={209--233} }","mla":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” Algorithmica, no. 3, 2004, pp. 209--233, doi:10.1007/s00453-004-1086-1.","chicago":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” Algorithmica, no. 3 (2004): 209--233. https://doi.org/10.1007/s00453-004-1086-1.","ama":"Kolman P, Scheideler C. Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. Algorithmica. 2004;(3):209--233. doi:10.1007/s00453-004-1086-1","apa":"Kolman, P., & Scheideler, C. (2004). Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. Algorithmica, (3), 209--233. https://doi.org/10.1007/s00453-004-1086-1"},"year":"2004","type":"journal_article","page":"209--233","doi":"10.1007/s00453-004-1086-1","issue":"3","date_updated":"2022-01-06T06:54:49Z","_id":"2119"},{"page":"183--195","type":"conference","citation":{"short":"B. Awerbuch, C. Scheideler, in: ICALP, 2004, pp. 183--195.","ieee":"B. Awerbuch and C. Scheideler, “Group Spreading: A Protocol for Provably Secure Distributed Name Service,” in ICALP, 2004, vol. 3142, pp. 183--195.","apa":"Awerbuch, B., & Scheideler, C. (2004). Group Spreading: A Protocol for Provably Secure Distributed Name Service. In ICALP (Vol. 3142, pp. 183--195).","ama":"Awerbuch B, Scheideler C. Group Spreading: A Protocol for Provably Secure Distributed Name Service. In: ICALP. Vol 3142. Lecture Notes in Computer Science. ; 2004:183--195.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Group Spreading: A Protocol for Provably Secure Distributed Name Service.” In ICALP, 3142:183--195. Lecture Notes in Computer Science, 2004.","bibtex":"@inproceedings{Awerbuch_Scheideler_2004, series={Lecture Notes in Computer Science}, title={Group Spreading: A Protocol for Provably Secure Distributed Name Service}, volume={3142}, booktitle={ICALP}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={183--195}, collection={Lecture Notes in Computer Science} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “Group Spreading: A Protocol for Provably Secure Distributed Name Service.” ICALP, vol. 3142, 2004, pp. 183--195."},"year":"2004","urn":"21200","intvolume":" 3142","_id":"2120","date_created":"2018-04-03T05:31:04Z","status":"public","has_accepted_license":"1","volume":3142,"file":[{"content_type":"application/pdf","date_updated":"2018-04-12T09:20:16Z","relation":"main_file","file_size":145383,"file_id":"2312","creator":"florida","access_level":"open_access","file_name":"ICALP-04.pdf","date_created":"2018-04-12T09:20:16Z"}],"publication":"ICALP","file_date_updated":"2018-04-12T09:20:16Z","author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"user_id":"15504","ddc":["040"],"series_title":"Lecture Notes in Computer Science","oa":"1","date_updated":"2022-01-06T06:54:49Z","department":[{"_id":"79"}],"title":"Group Spreading: A Protocol for Provably Secure Distributed Name Service"},{"user_id":"15504","ddc":["040"],"title":"A Distributed Hash Table for Computational Grids","status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:31:59Z","file":[{"access_level":"open_access","date_created":"2018-04-12T09:50:26Z","file_name":"IPDPS-04.pdf","relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:50:26Z","file_id":"2316","creator":"florida","file_size":91542}],"author":[{"full_name":"Riley, Chris","first_name":"Chris","last_name":"Riley"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file_date_updated":"2018-04-12T09:50:26Z","publication":"IPDPS","department":[{"_id":"79"}],"oa":"1","_id":"2121","date_updated":"2022-01-06T06:54:50Z","urn":"21212","type":"conference","citation":{"ieee":"C. Riley and C. Scheideler, “A Distributed Hash Table for Computational Grids,” in IPDPS, 2004.","short":"C. Riley, C. Scheideler, in: IPDPS, 2004.","bibtex":"@inproceedings{Riley_Scheideler_2004, title={A Distributed Hash Table for Computational Grids}, booktitle={IPDPS}, author={Riley, Chris and Scheideler, Christian}, year={2004} }","mla":"Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational Grids.” IPDPS, 2004.","chicago":"Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational Grids.” In IPDPS, 2004.","ama":"Riley C, Scheideler C. A Distributed Hash Table for Computational Grids. In: IPDPS. ; 2004.","apa":"Riley, C., & Scheideler, C. (2004). A Distributed Hash Table for Computational Grids. In IPDPS."},"year":"2004"},{"series_title":"Lecture Notes in Computer Science","date_updated":"2022-01-06T06:54:50Z","oa":"1","department":[{"_id":"79"}],"title":"Robust Distributed Name Service","year":"2004","citation":{"short":"B. Awerbuch, C. Scheideler, in: IPTPS, 2004, pp. 237--249.","ieee":"B. Awerbuch and C. Scheideler, “Robust Distributed Name Service,” in IPTPS, 2004, vol. 3279, pp. 237--249.","ama":"Awerbuch B, Scheideler C. Robust Distributed Name Service. In: IPTPS. Vol 3279. Lecture Notes in Computer Science. ; 2004:237--249.","apa":"Awerbuch, B., & Scheideler, C. (2004). Robust Distributed Name Service. In IPTPS (Vol. 3279, pp. 237--249).","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.” In IPTPS, 3279:237--249. Lecture Notes in Computer Science, 2004.","bibtex":"@inproceedings{Awerbuch_Scheideler_2004, series={Lecture Notes in Computer Science}, title={Robust Distributed Name Service}, volume={3279}, booktitle={IPTPS}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={237--249}, collection={Lecture Notes in Computer Science} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.” IPTPS, vol. 3279, 2004, pp. 237--249."},"type":"conference","page":"237--249","intvolume":" 3279","_id":"2122","urn":"21229","file":[{"relation":"main_file","date_updated":"2018-04-12T11:39:38Z","content_type":"application/pdf","creator":"florida","file_id":"2318","file_size":136987,"access_level":"open_access","date_created":"2018-04-12T11:39:38Z","file_name":"IPTPS-04.pdf"}],"author":[{"first_name":"Baruch","full_name":"Awerbuch, Baruch","last_name":"Awerbuch"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publication":"IPTPS","file_date_updated":"2018-04-12T11:39:38Z","status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:32:33Z","volume":3279,"user_id":"15504","ddc":["040"]},{"page":"33--47","year":"2004","citation":{"short":"G. Ateniese, C. Riley, C. Scheideler, in: IWIA, 2004, pp. 33--47.","ieee":"G. Ateniese, C. Riley, and C. Scheideler, “Survivable Monitoring in Dynamic Networks,” in IWIA, 2004, pp. 33--47.","apa":"Ateniese, G., Riley, C., & Scheideler, C. (2004). Survivable Monitoring in Dynamic Networks. In IWIA (pp. 33--47).","ama":"Ateniese G, Riley C, Scheideler C. Survivable Monitoring in Dynamic Networks. In: IWIA. ; 2004:33--47.","chicago":"Ateniese, Giuseppe, Chris Riley, and Christian Scheideler. “Survivable Monitoring in Dynamic Networks.” In IWIA, 33--47, 2004.","mla":"Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.” IWIA, 2004, pp. 33--47.","bibtex":"@inproceedings{Ateniese_Riley_Scheideler_2004, title={Survivable Monitoring in Dynamic Networks}, booktitle={IWIA}, author={Ateniese, Giuseppe and Riley, Chris and Scheideler, Christian}, year={2004}, pages={33--47} }"},"type":"conference","oa":"1","urn":"21238","date_updated":"2022-01-06T06:54:50Z","_id":"2123","date_created":"2018-04-03T05:33:37Z","has_accepted_license":"1","status":"public","file":[{"file_name":"IIAW-04.pdf","date_created":"2018-04-12T11:38:22Z","access_level":"open_access","creator":"florida","file_id":"2317","file_size":255111,"relation":"main_file","date_updated":"2018-04-12T11:38:22Z","content_type":"application/pdf"}],"file_date_updated":"2018-04-12T11:38:22Z","department":[{"_id":"79"}],"publication":"IWIA","author":[{"full_name":"Ateniese, Giuseppe","first_name":"Giuseppe","last_name":"Ateniese"},{"full_name":"Riley, Chris","first_name":"Chris","last_name":"Riley"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"user_id":"15504","title":"Survivable Monitoring in Dynamic Networks","ddc":["040"]},{"year":"2004","citation":{"ama":"Awerbuch B, Scheideler C. The hyperring: a low-congestion deterministic data structure for distributed environments. In: SODA. ; 2004:318--327.","apa":"Awerbuch, B., & Scheideler, C. (2004). The hyperring: a low-congestion deterministic data structure for distributed environments. In SODA (pp. 318--327).","chicago":"Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments.” In SODA, 318--327, 2004.","mla":"Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments.” SODA, 2004, pp. 318--327.","bibtex":"@inproceedings{Awerbuch_Scheideler_2004, title={The hyperring: a low-congestion deterministic data structure for distributed environments}, booktitle={SODA}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={318--327} }","short":"B. Awerbuch, C. Scheideler, in: SODA, 2004, pp. 318--327.","ieee":"B. Awerbuch and C. Scheideler, “The hyperring: a low-congestion deterministic data structure for distributed environments,” in SODA, 2004, pp. 318--327."},"type":"conference","page":"318--327","date_updated":"2022-01-06T06:54:51Z","_id":"2124","urn":"21247","oa":"1","author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"department":[{"_id":"79"}],"publication":"SODA","file_date_updated":"2018-04-13T08:36:08Z","file":[{"file_size":193831,"file_id":"2323","creator":"florida","date_updated":"2018-04-13T08:36:08Z","content_type":"application/pdf","relation":"main_file","file_name":"SODA-04.pdf","date_created":"2018-04-13T08:36:08Z","access_level":"open_access"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:34:17Z","title":"The hyperring: a low-congestion deterministic data structure for distributed environments","ddc":["040"],"user_id":"15504"},{"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:34:56Z","file":[{"access_level":"open_access","date_created":"2018-04-12T09:41:38Z","file_name":"AS-SPAA-04.pdf","relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:41:38Z","creator":"florida","file_id":"2315","file_size":170429}],"author":[{"last_name":"Awerbuch","full_name":"Awerbuch, Baruch","first_name":"Baruch"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"department":[{"_id":"79"}],"publication":"SPAA","file_date_updated":"2018-04-12T09:41:38Z","user_id":"15504","ddc":["040"],"title":"Consistent and compact data management in distributed storage systems","year":"2004","citation":{"chicago":"Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data Management in Distributed Storage Systems.” In SPAA, 44--53, 2004.","ama":"Awerbuch B, Scheideler C. Consistent and compact data management in distributed storage systems. In: SPAA. ; 2004:44--53.","apa":"Awerbuch, B., & Scheideler, C. (2004). Consistent and compact data management in distributed storage systems. In SPAA (pp. 44--53).","bibtex":"@inproceedings{Awerbuch_Scheideler_2004, title={Consistent and compact data management in distributed storage systems}, booktitle={SPAA}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={44--53} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data Management in Distributed Storage Systems.” SPAA, 2004, pp. 44--53.","short":"B. Awerbuch, C. Scheideler, in: SPAA, 2004, pp. 44--53.","ieee":"B. Awerbuch and C. Scheideler, “Consistent and compact data management in distributed storage systems,” in SPAA, 2004, pp. 44--53."},"type":"conference","page":"44--53","oa":"1","_id":"2125","date_updated":"2022-01-06T06:54:51Z","urn":"21256"},{"page":"170--179","year":"2004","citation":{"chicago":"Bhargava, Ankur, Kishore Kothapalli, Chris Riley, Christian Scheideler, and Mark Thober. “Pagoda: A Dynamic Overlay Network for Routing, Data Management, and Multicasting.” In SPAA, 170--179, 2004.","apa":"Bhargava, A., Kothapalli, K., Riley, C., Scheideler, C., & Thober, M. (2004). Pagoda: a dynamic overlay network for routing, data management, and multicasting. In SPAA (pp. 170--179).","ama":"Bhargava A, Kothapalli K, Riley C, Scheideler C, Thober M. Pagoda: a dynamic overlay network for routing, data management, and multicasting. In: SPAA. ; 2004:170--179.","bibtex":"@inproceedings{Bhargava_Kothapalli_Riley_Scheideler_Thober_2004, title={Pagoda: a dynamic overlay network for routing, data management, and multicasting}, booktitle={SPAA}, author={Bhargava, Ankur and Kothapalli, Kishore and Riley, Chris and Scheideler, Christian and Thober, Mark}, year={2004}, pages={170--179} }","mla":"Bhargava, Ankur, et al. “Pagoda: A Dynamic Overlay Network for Routing, Data Management, and Multicasting.” SPAA, 2004, pp. 170--179.","short":"A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, M. Thober, in: SPAA, 2004, pp. 170--179.","ieee":"A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, and M. Thober, “Pagoda: a dynamic overlay network for routing, data management, and multicasting,” in SPAA, 2004, pp. 170--179."},"type":"conference","oa":"1","urn":"21266","date_updated":"2022-01-06T06:54:52Z","_id":"2126","date_created":"2018-04-03T05:35:31Z","status":"public","has_accepted_license":"1","file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:40:42Z","creator":"florida","file_id":"2314","file_size":118175,"access_level":"open_access","date_created":"2018-04-12T09:40:12Z","file_name":"BKRST-SPAA-04.pdf"}],"department":[{"_id":"79"}],"file_date_updated":"2018-04-12T09:40:42Z","publication":"SPAA","author":[{"last_name":"Bhargava","full_name":"Bhargava, Ankur","first_name":"Ankur"},{"last_name":"Kothapalli","full_name":"Kothapalli, Kishore","first_name":"Kishore"},{"last_name":"Riley","first_name":"Chris","full_name":"Riley, Chris"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Thober","full_name":"Thober, Mark","first_name":"Mark"}],"user_id":"15504","title":"Pagoda: a dynamic overlay network for routing, data management, and multicasting","ddc":["040"]},{"urn":"21276","_id":"2127","date_updated":"2022-01-06T06:54:52Z","oa":"1","page":"286--293","citation":{"ieee":"A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler, “The effect of faults on network expansion,” in SPAA, 2004, pp. 286--293.","short":"A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, in: SPAA, ACM, 2004, pp. 286--293.","mla":"Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” SPAA, ACM, 2004, pp. 286--293.","bibtex":"@inproceedings{Bagchi_Bhargava_Chaudhary_Eppstein_Scheideler_2004, title={The effect of faults on network expansion}, booktitle={SPAA}, publisher={ACM}, author={Bagchi, Amitabha and Bhargava, Ankur and Chaudhary, Amitabh and Eppstein, David and Scheideler, Christian}, year={2004}, pages={286--293} }","chicago":"Bagchi, Amitabha, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, and Christian Scheideler. “The Effect of Faults on Network Expansion.” In SPAA, 286--293. ACM, 2004.","apa":"Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., & Scheideler, C. (2004). The effect of faults on network expansion. In SPAA (pp. 286--293). ACM.","ama":"Bagchi A, Bhargava A, Chaudhary A, Eppstein D, Scheideler C. The effect of faults on network expansion. In: SPAA. ACM; 2004:286--293."},"type":"conference","year":"2004","ddc":["040"],"title":"The effect of faults on network expansion","user_id":"15504","publication":"SPAA","department":[{"_id":"79"}],"file_date_updated":"2018-04-12T09:21:24Z","publisher":"ACM","author":[{"last_name":"Bagchi","first_name":"Amitabha","full_name":"Bagchi, Amitabha"},{"last_name":"Bhargava","full_name":"Bhargava, Ankur","first_name":"Ankur"},{"full_name":"Chaudhary, Amitabh","first_name":"Amitabh","last_name":"Chaudhary"},{"full_name":"Eppstein, David","first_name":"David","last_name":"Eppstein"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file":[{"date_updated":"2018-04-12T09:21:24Z","content_type":"application/pdf","relation":"main_file","file_size":197503,"file_id":"2313","creator":"florida","access_level":"open_access","file_name":"BBCES-SPAA-04.pdf","date_created":"2018-04-12T09:21:24Z"}],"date_created":"2018-04-03T05:36:11Z","has_accepted_license":"1","status":"public"},{"date_created":"2018-04-03T05:25:16Z","has_accepted_license":"1","status":"public","file_date_updated":"2018-04-13T08:45:41Z","publication":"ISPAN","department":[{"_id":"79"}],"author":[{"first_name":"Miroslaw","full_name":"Korzeniowski, Miroslaw","last_name":"Korzeniowski"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"file_id":"2325","creator":"florida","file_size":110389,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-13T08:45:41Z","file_name":"KS-ISPAN-05-TransData.pdf","date_created":"2018-04-13T08:45:41Z","access_level":"open_access"}],"ddc":["040"],"title":"Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment","user_id":"15504","page":"182--187","type":"conference","citation":{"ieee":"M. Korzeniowski and C. Scheideler, “Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment,” in ISPAN, 2005, pp. 182--187.","short":"M. Korzeniowski, C. Scheideler, in: ISPAN, 2005, pp. 182--187.","bibtex":"@inproceedings{Korzeniowski_Scheideler_2005, title={Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment}, booktitle={ISPAN}, author={Korzeniowski, Miroslaw and Scheideler, Christian}, year={2005}, pages={182--187} }","mla":"Korzeniowski, Miroslaw, and Christian Scheideler. “Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment.” ISPAN, 2005, pp. 182--187.","ama":"Korzeniowski M, Scheideler C. Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment. In: ISPAN. ; 2005:182--187.","apa":"Korzeniowski, M., & Scheideler, C. (2005). Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment. In ISPAN (pp. 182--187).","chicago":"Korzeniowski, Miroslaw, and Christian Scheideler. “Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment.” In ISPAN, 182--187, 2005."},"year":"2005","oa":"1","urn":"21146","_id":"2114","date_updated":"2022-01-06T06:54:47Z"},{"type":"conference","year":"2005","citation":{"short":"K. Kothapalli, C. Scheideler, in: ISPAN, 2005, pp. 188--193.","ieee":"K. Kothapalli and C. Scheideler, “Supervised Peer-to-Peer Systems,” in ISPAN, 2005, pp. 188--193.","ama":"Kothapalli K, Scheideler C. Supervised Peer-to-Peer Systems. In: ISPAN. ; 2005:188--193.","apa":"Kothapalli, K., & Scheideler, C. (2005). Supervised Peer-to-Peer Systems. In ISPAN (pp. 188--193).","chicago":"Kothapalli, Kishore, and Christian Scheideler. “Supervised Peer-to-Peer Systems.” In ISPAN, 188--193, 2005.","mla":"Kothapalli, Kishore, and Christian Scheideler. “Supervised Peer-to-Peer Systems.” ISPAN, 2005, pp. 188--193.","bibtex":"@inproceedings{Kothapalli_Scheideler_2005, title={Supervised Peer-to-Peer Systems}, booktitle={ISPAN}, author={Kothapalli, Kishore and Scheideler, Christian}, year={2005}, pages={188--193} }"},"page":"188--193","_id":"2115","date_updated":"2022-01-06T06:54:47Z","urn":"21156","oa":"1","author":[{"last_name":"Kothapalli","first_name":"Kishore","full_name":"Kothapalli, Kishore"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publication":"ISPAN","department":[{"_id":"79"}],"file_date_updated":"2018-04-13T08:50:40Z","file":[{"file_name":"KS-ISPAN-05-Supervised.pdf","date_created":"2018-04-13T08:50:40Z","access_level":"open_access","file_size":69350,"file_id":"2326","creator":"florida","date_updated":"2018-04-13T08:50:40Z","content_type":"application/pdf","relation":"main_file"}],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:26:10Z","ddc":["040"],"title":"Supervised Peer-to-Peer Systems","user_id":"15504"},{"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:26:50Z","file":[{"relation":"main_file","date_updated":"2018-04-13T08:55:51Z","content_type":"application/pdf","file_id":"2327","creator":"florida","file_size":135267,"access_level":"open_access","file_name":"KORS-ISPAN-05.pdf","date_created":"2018-04-13T08:55:51Z"}],"author":[{"last_name":"Onus","first_name":"Melih","full_name":"Onus, Melih"},{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, Andrea"},{"full_name":"Kothapalli, Kishore","first_name":"Kishore","last_name":"Kothapalli"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"department":[{"_id":"79"}],"publication":"ISPAN","file_date_updated":"2018-04-13T08:55:51Z","user_id":"15504","ddc":["040"],"title":"Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks","year":"2005","type":"conference","citation":{"bibtex":"@inproceedings{Onus_W. Richa_Kothapalli_Scheideler_2005, title={Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks}, booktitle={ISPAN}, author={Onus, Melih and W. Richa, Andrea and Kothapalli, Kishore and Scheideler, Christian}, year={2005}, pages={346--351} }","mla":"Onus, Melih, et al. “Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks.” ISPAN, 2005, pp. 346--351.","apa":"Onus, M., W. Richa, A., Kothapalli, K., & Scheideler, C. (2005). Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks. In ISPAN (pp. 346--351).","ama":"Onus M, W. Richa A, Kothapalli K, Scheideler C. Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks. In: ISPAN. ; 2005:346--351.","chicago":"Onus, Melih, Andrea W. Richa, Kishore Kothapalli, and Christian Scheideler. “Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks.” In ISPAN, 346--351, 2005.","ieee":"M. Onus, A. W. Richa, K. Kothapalli, and C. Scheideler, “Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks,” in ISPAN, 2005, pp. 346--351.","short":"M. Onus, A. W. Richa, K. Kothapalli, C. Scheideler, in: ISPAN, 2005, pp. 346--351."},"page":"346--351","oa":"1","date_updated":"2022-01-06T06:54:48Z","_id":"2116","urn":"21165"},{"oa":"1","urn":"21175","date_updated":"2022-01-06T06:54:48Z","_id":"2117","page":"116--125","year":"2005","type":"conference","citation":{"short":"K. Kothapalli, C. Scheideler, M. Onus, A. W. Richa, in: SPAA, 2005, pp. 116--125.","ieee":"K. Kothapalli, C. Scheideler, M. Onus, and A. W. Richa, “Constant density spanners for wireless ad-hoc networks,” in SPAA, 2005, pp. 116--125.","chicago":"Kothapalli, Kishore, Christian Scheideler, Melih Onus, and Andrea W. Richa. “Constant Density Spanners for Wireless Ad-Hoc Networks.” In SPAA, 116--125, 2005.","apa":"Kothapalli, K., Scheideler, C., Onus, M., & W. Richa, A. (2005). Constant density spanners for wireless ad-hoc networks. In SPAA (pp. 116--125).","ama":"Kothapalli K, Scheideler C, Onus M, W. Richa A. Constant density spanners for wireless ad-hoc networks. In: SPAA. ; 2005:116--125.","mla":"Kothapalli, Kishore, et al. “Constant Density Spanners for Wireless Ad-Hoc Networks.” SPAA, 2005, pp. 116--125.","bibtex":"@inproceedings{Kothapalli_Scheideler_Onus_W. Richa_2005, title={Constant density spanners for wireless ad-hoc networks}, booktitle={SPAA}, author={Kothapalli, Kishore and Scheideler, Christian and Onus, Melih and W. Richa, Andrea}, year={2005}, pages={116--125} }"},"title":"Constant density spanners for wireless ad-hoc networks","ddc":["040"],"user_id":"15504","date_created":"2018-04-03T05:28:33Z","status":"public","has_accepted_license":"1","file_date_updated":"2018-04-13T08:56:49Z","publication":"SPAA","department":[{"_id":"79"}],"author":[{"full_name":"Kothapalli, Kishore","first_name":"Kishore","last_name":"Kothapalli"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"first_name":"Melih","full_name":"Onus, Melih","last_name":"Onus"},{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"}],"file":[{"file_size":118644,"file_id":"2328","creator":"florida","date_updated":"2018-04-13T08:56:49Z","content_type":"application/pdf","relation":"main_file","date_created":"2018-04-13T08:56:49Z","file_name":"SPAA-05.pdf","access_level":"open_access"}]},{"publication":"STOC","department":[{"_id":"79"}],"file_date_updated":"2018-04-13T08:58:22Z","author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file":[{"date_updated":"2018-04-13T08:58:22Z","content_type":"application/pdf","relation":"main_file","file_size":134460,"file_id":"2330","creator":"florida","access_level":"open_access","file_name":"STOC-05.pdf","date_created":"2018-04-13T08:58:22Z"}],"date_created":"2018-04-03T05:29:27Z","has_accepted_license":"1","status":"public","ddc":["040"],"title":"How to spread adversarial nodes?: rotate!","user_id":"15504","page":"704--713","year":"2005","citation":{"ieee":"C. Scheideler, “How to spread adversarial nodes?: rotate!,” in STOC, 2005, pp. 704--713.","short":"C. Scheideler, in: STOC, 2005, pp. 704--713.","mla":"Scheideler, Christian. “How to Spread Adversarial Nodes?: Rotate!” STOC, 2005, pp. 704--713.","bibtex":"@inproceedings{Scheideler_2005, title={How to spread adversarial nodes?: rotate!}, booktitle={STOC}, author={Scheideler, Christian}, year={2005}, pages={704--713} }","apa":"Scheideler, C. (2005). How to spread adversarial nodes?: rotate! In STOC (pp. 704--713).","ama":"Scheideler C. How to spread adversarial nodes?: rotate! In: STOC. ; 2005:704--713.","chicago":"Scheideler, Christian. “How to Spread Adversarial Nodes?: Rotate!” In STOC, 704--713, 2005."},"type":"conference","urn":"21185","_id":"2118","date_updated":"2022-01-06T06:54:49Z","oa":"1"},{"user_id":"15504","title":"Overlay networks for wireless ad hoc networks","ddc":["040"],"has_accepted_license":"1","status":"public","date_created":"2018-04-05T07:05:16Z","file":[{"relation":"main_file","date_updated":"2018-04-13T08:57:39Z","content_type":"application/pdf","file_id":"2329","creator":"florida","file_size":295333,"access_level":"open_access","date_created":"2018-04-13T08:57:39Z","file_name":"IMA-05.pdf"}],"author":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"department":[{"_id":"79"}],"file_date_updated":"2018-04-13T08:57:39Z","publication":"IMA Workshop on Wireless Communications","oa":"1","_id":"2212","date_updated":"2022-01-06T06:55:26Z","urn":"22129","year":"2005","citation":{"mla":"Scheideler, Christian. “Overlay Networks for Wireless Ad Hoc Networks.” IMA Workshop on Wireless Communications, 2005.","bibtex":"@inproceedings{Scheideler_2005, title={Overlay networks for wireless ad hoc networks}, booktitle={IMA Workshop on Wireless Communications}, author={Scheideler, Christian}, year={2005} }","chicago":"Scheideler, Christian. “Overlay Networks for Wireless Ad Hoc Networks.” In IMA Workshop on Wireless Communications, 2005.","ama":"Scheideler C. Overlay networks for wireless ad hoc networks. In: IMA Workshop on Wireless Communications. ; 2005.","apa":"Scheideler, C. (2005). Overlay networks for wireless ad hoc networks. In IMA Workshop on Wireless Communications.","ieee":"C. Scheideler, “Overlay networks for wireless ad hoc networks,” in IMA Workshop on Wireless Communications, 2005.","short":"C. Scheideler, in: IMA Workshop on Wireless Communications, 2005."},"type":"conference"},{"date_updated":"2022-01-06T06:54:25Z","_id":"2029","intvolume":" 61","issue":"1","doi":"10.1016/j.jalgor.2004.07.006","page":"20--44","type":"journal_article","year":"2006","citation":{"ieee":"P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,” J. Algorithms, vol. 61, no. 1, pp. 20--44, 2006.","short":"P. Kolman, C. Scheideler, J. Algorithms 61 (2006) 20--44.","mla":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” J. Algorithms, vol. 61, no. 1, 2006, pp. 20--44, doi:10.1016/j.jalgor.2004.07.006.","bibtex":"@article{Kolman_Scheideler_2006, title={Improved bounds for the unsplittable flow problem}, volume={61}, DOI={10.1016/j.jalgor.2004.07.006}, number={1}, journal={J. Algorithms}, author={Kolman, Petr and Scheideler, Christian}, year={2006}, pages={20--44} }","chicago":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” J. Algorithms 61, no. 1 (2006): 20--44. https://doi.org/10.1016/j.jalgor.2004.07.006.","ama":"Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem. J Algorithms. 2006;61(1):20--44. doi:10.1016/j.jalgor.2004.07.006","apa":"Kolman, P., & Scheideler, C. (2006). Improved bounds for the unsplittable flow problem. J. Algorithms, 61(1), 20--44. https://doi.org/10.1016/j.jalgor.2004.07.006"},"user_id":"15504","title":"Improved bounds for the unsplittable flow problem","publication":"J. Algorithms","department":[{"_id":"79"}],"author":[{"last_name":"Kolman","first_name":"Petr","full_name":"Kolman, Petr"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2018-03-29T12:01:37Z","status":"public","volume":61},{"doi":"10.1109/TMC.2006.138","issue":"9","date_updated":"2022-01-06T06:54:45Z","_id":"2110","type":"journal_article","year":"2006","citation":{"ieee":"G. Ateniese, C. Riley, and C. Scheideler, “Survivable Monitoring in Dynamic Networks,” IEEE Trans. Mob. Comput., no. 9, pp. 1242--1254, 2006.","short":"G. Ateniese, C. Riley, C. Scheideler, IEEE Trans. Mob. Comput. (2006) 1242--1254.","bibtex":"@article{Ateniese_Riley_Scheideler_2006, title={Survivable Monitoring in Dynamic Networks}, DOI={10.1109/TMC.2006.138}, number={9}, journal={IEEE Trans. Mob. Comput.}, author={Ateniese, Giuseppe and Riley, Chris and Scheideler, Christian}, year={2006}, pages={1242--1254} }","mla":"Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.” IEEE Trans. Mob. Comput., no. 9, 2006, pp. 1242--1254, doi:10.1109/TMC.2006.138.","chicago":"Ateniese, Giuseppe, Chris Riley, and Christian Scheideler. “Survivable Monitoring in Dynamic Networks.” IEEE Trans. Mob. Comput., no. 9 (2006): 1242--1254. https://doi.org/10.1109/TMC.2006.138.","apa":"Ateniese, G., Riley, C., & Scheideler, C. (2006). Survivable Monitoring in Dynamic Networks. IEEE Trans. Mob. Comput., (9), 1242--1254. https://doi.org/10.1109/TMC.2006.138","ama":"Ateniese G, Riley C, Scheideler C. Survivable Monitoring in Dynamic Networks. IEEE Trans Mob Comput. 2006;(9):1242--1254. doi:10.1109/TMC.2006.138"},"page":"1242--1254","title":"Survivable Monitoring in Dynamic Networks","user_id":"15504","status":"public","date_created":"2018-04-03T05:21:30Z","author":[{"last_name":"Ateniese","first_name":"Giuseppe","full_name":"Ateniese, Giuseppe"},{"last_name":"Riley","full_name":"Riley, Chris","first_name":"Chris"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"IEEE Trans. Mob. Comput.","department":[{"_id":"79"}]},{"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:22:43Z","author":[{"last_name":"Kothapalli","full_name":"Kothapalli, Kishore","first_name":"Kishore"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Onus","first_name":"Melih","full_name":"Onus, Melih"},{"last_name":"Schindelhauer","first_name":"Christian","full_name":"Schindelhauer, Christian"}],"department":[{"_id":"79"}],"publication":"IPDPS","file_date_updated":"2018-04-13T09:57:03Z","file":[{"content_type":"application/pdf","date_updated":"2018-04-13T09:57:03Z","relation":"main_file","file_size":192708,"file_id":"2334","creator":"florida","access_level":"open_access","file_name":"IPDPS06.pdf","date_created":"2018-04-13T09:57:03Z"}],"title":"Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds","ddc":["040"],"user_id":"15504","year":"2006","citation":{"bibtex":"@inproceedings{Kothapalli_Scheideler_Onus_Schindelhauer_2006, title={Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds}, booktitle={IPDPS}, author={Kothapalli, Kishore and Scheideler, Christian and Onus, Melih and Schindelhauer, Christian}, year={2006} }","mla":"Kothapalli, Kishore, et al. “Distributed Coloring in O/Spl Tilde/(/Spl Radic/(Log n)) Bit Rounds.” IPDPS, 2006.","chicago":"Kothapalli, Kishore, Christian Scheideler, Melih Onus, and Christian Schindelhauer. “Distributed Coloring in O/Spl Tilde/(/Spl Radic/(Log n)) Bit Rounds.” In IPDPS, 2006.","apa":"Kothapalli, K., Scheideler, C., Onus, M., & Schindelhauer, C. (2006). Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds. In IPDPS.","ama":"Kothapalli K, Scheideler C, Onus M, Schindelhauer C. Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds. In: IPDPS. ; 2006.","ieee":"K. Kothapalli, C. Scheideler, M. Onus, and C. Schindelhauer, “Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds,” in IPDPS, 2006.","short":"K. Kothapalli, C. Scheideler, M. Onus, C. Schindelhauer, in: IPDPS, 2006."},"type":"conference","oa":"1","date_updated":"2022-01-06T06:54:46Z","_id":"2111","urn":"21110"},{"urn":"21128","date_updated":"2022-01-06T06:54:46Z","_id":"2112","oa":"1","series_title":"Lecture Notes in Computer Science","page":"275--289","type":"conference","citation":{"bibtex":"@inproceedings{Awerbuch_Scheideler_2006, series={Lecture Notes in Computer Science}, title={Robust Random Number Generation for Peer-to-Peer Systems}, booktitle={OPODIS}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2006}, pages={275--289}, collection={Lecture Notes in Computer Science} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.” OPODIS, 2006, pp. 275--289.","apa":"Awerbuch, B., & Scheideler, C. (2006). Robust Random Number Generation for Peer-to-Peer Systems. In OPODIS (pp. 275--289).","ama":"Awerbuch B, Scheideler C. Robust Random Number Generation for Peer-to-Peer Systems. In: OPODIS. Lecture Notes in Computer Science. ; 2006:275--289.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.” In OPODIS, 275--289. Lecture Notes in Computer Science, 2006.","ieee":"B. Awerbuch and C. Scheideler, “Robust Random Number Generation for Peer-to-Peer Systems,” in OPODIS, 2006, pp. 275--289.","short":"B. Awerbuch, C. Scheideler, in: OPODIS, 2006, pp. 275--289."},"year":"2006","title":"Robust Random Number Generation for Peer-to-Peer Systems","ddc":["040"],"user_id":"15504","publication":"OPODIS","file_date_updated":"2018-04-13T09:57:51Z","department":[{"_id":"79"}],"author":[{"first_name":"Baruch","full_name":"Awerbuch, Baruch","last_name":"Awerbuch"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"file_name":"OPODIS06.pdf","date_created":"2018-04-13T09:57:51Z","access_level":"open_access","file_size":198976,"creator":"florida","file_id":"2335","date_updated":"2018-04-13T09:57:51Z","content_type":"application/pdf","relation":"main_file"}],"date_created":"2018-04-03T05:23:39Z","status":"public","has_accepted_license":"1"},{"title":"Towards a scalable and robust DHT","ddc":["040"],"user_id":"15504","author":[{"first_name":"Baruch","full_name":"Awerbuch, Baruch","last_name":"Awerbuch"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"department":[{"_id":"79"}],"publication":"SPAA","file_date_updated":"2018-04-13T10:00:09Z","file":[{"date_updated":"2018-04-13T10:00:09Z","content_type":"application/pdf","relation":"main_file","file_size":144588,"creator":"florida","file_id":"2337","access_level":"open_access","date_created":"2018-04-13T10:00:09Z","file_name":"SPAA06.pdf"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:24:22Z","date_updated":"2022-01-06T06:54:46Z","_id":"2113","urn":"21137","oa":"1","citation":{"ama":"Awerbuch B, Scheideler C. Towards a scalable and robust DHT. In: SPAA. ; 2006:318--327.","apa":"Awerbuch, B., & Scheideler, C. (2006). Towards a scalable and robust DHT. In SPAA (pp. 318--327).","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.” In SPAA, 318--327, 2006.","mla":"Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.” SPAA, 2006, pp. 318--327.","bibtex":"@inproceedings{Awerbuch_Scheideler_2006, title={Towards a scalable and robust DHT}, booktitle={SPAA}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2006}, pages={318--327} }","short":"B. Awerbuch, C. Scheideler, in: SPAA, 2006, pp. 318--327.","ieee":"B. Awerbuch and C. Scheideler, “Towards a scalable and robust DHT,” in SPAA, 2006, pp. 318--327."},"type":"conference","year":"2006","page":"318--327"},{"_id":"2043","date_updated":"2022-01-06T06:54:27Z","doi":"10.1007/s00224-006-1349-0","issue":"6","page":"903--928","year":"2006","citation":{"ieee":"A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler, “The Effect of Faults on Network Expansion,” Theory Comput. Syst., no. 6, pp. 903--928, 2006.","short":"A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, Theory Comput. Syst. (2006) 903--928.","mla":"Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” Theory Comput. Syst., no. 6, 2006, pp. 903--928, doi:10.1007/s00224-006-1349-0.","bibtex":"@article{Bagchi_Bhargava_Chaudhary_Eppstein_Scheideler_2006, title={The Effect of Faults on Network Expansion}, DOI={10.1007/s00224-006-1349-0}, number={6}, journal={Theory Comput. Syst.}, author={Bagchi, Amitabha and Bhargava, Ankur and Chaudhary, Amitabh and Eppstein, David and Scheideler, Christian}, year={2006}, pages={903--928} }","ama":"Bagchi A, Bhargava A, Chaudhary A, Eppstein D, Scheideler C. The Effect of Faults on Network Expansion. Theory Comput Syst. 2006;(6):903--928. doi:10.1007/s00224-006-1349-0","apa":"Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., & Scheideler, C. (2006). The Effect of Faults on Network Expansion. Theory Comput. Syst., (6), 903--928. https://doi.org/10.1007/s00224-006-1349-0","chicago":"Bagchi, Amitabha, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, and Christian Scheideler. “The Effect of Faults on Network Expansion.” Theory Comput. Syst., no. 6 (2006): 903--928. https://doi.org/10.1007/s00224-006-1349-0."},"type":"journal_article","title":"The Effect of Faults on Network Expansion","user_id":"15504","publication":"Theory Comput. Syst.","department":[{"_id":"79"}],"author":[{"first_name":"Amitabha","full_name":"Bagchi, Amitabha","last_name":"Bagchi"},{"last_name":"Bhargava","first_name":"Ankur","full_name":"Bhargava, Ankur"},{"last_name":"Chaudhary","full_name":"Chaudhary, Amitabh","first_name":"Amitabh"},{"full_name":"Eppstein, David","first_name":"David","last_name":"Eppstein"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2018-03-29T12:32:54Z","status":"public"},{"title":"Towards a paradigm for robust distributed algorithms and data structures","ddc":["040"],"user_id":"15504","department":[{"_id":"79"}],"publication":"6th International HNI Symposium on New Trends in Parallel and Distributed Computing","file_date_updated":"2018-04-13T09:59:14Z","author":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-13T09:59:14Z","file_id":"2336","creator":"florida","file_size":85116,"access_level":"open_access","date_created":"2018-04-13T09:59:14Z","file_name":"HNI-Symposium-06.pdf"}],"date_created":"2018-04-05T07:06:44Z","status":"public","has_accepted_license":"1","urn":"22137","_id":"2213","date_updated":"2022-01-06T06:55:27Z","oa":"1","citation":{"short":"C. Scheideler, in: 6th International HNI Symposium on New Trends in Parallel and Distributed Computing, 2006.","ieee":"C. Scheideler, “Towards a paradigm for robust distributed algorithms and data structures,” in 6th International HNI Symposium on New Trends in Parallel and Distributed Computing, 2006.","ama":"Scheideler C. Towards a paradigm for robust distributed algorithms and data structures. In: 6th International HNI Symposium on New Trends in Parallel and Distributed Computing. ; 2006.","apa":"Scheideler, C. (2006). Towards a paradigm for robust distributed algorithms and data structures. In 6th International HNI Symposium on New Trends in Parallel and Distributed Computing.","chicago":"Scheideler, Christian. “Towards a Paradigm for Robust Distributed Algorithms and Data Structures.” In 6th International HNI Symposium on New Trends in Parallel and Distributed Computing, 2006.","bibtex":"@inproceedings{Scheideler_2006, title={Towards a paradigm for robust distributed algorithms and data structures}, booktitle={6th International HNI Symposium on New Trends in Parallel and Distributed Computing}, author={Scheideler, Christian}, year={2006} }","mla":"Scheideler, Christian. “Towards a Paradigm for Robust Distributed Algorithms and Data Structures.” 6th International HNI Symposium on New Trends in Parallel and Distributed Computing, 2006."},"year":"2006","type":"conference"},{"year":"2007","citation":{"ama":"Bagchi A, Chaudhary A, Scheideler C, Kolman P. Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks. SIAM J Discrete Math. 2007;(1):141--157. doi:10.1137/S0895480102419743","apa":"Bagchi, A., Chaudhary, A., Scheideler, C., & Kolman, P. (2007). Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks. SIAM J. Discrete Math., (1), 141--157. https://doi.org/10.1137/S0895480102419743","chicago":"Bagchi, Amitabha, Amitabh Chaudhary, Christian Scheideler, and Petr Kolman. “Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks.” SIAM J. Discrete Math., no. 1 (2007): 141--157. https://doi.org/10.1137/S0895480102419743.","mla":"Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks.” SIAM J. Discrete Math., no. 1, 2007, pp. 141--157, doi:10.1137/S0895480102419743.","bibtex":"@article{Bagchi_Chaudhary_Scheideler_Kolman_2007, title={Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks}, DOI={10.1137/S0895480102419743}, number={1}, journal={SIAM J. Discrete Math.}, author={Bagchi, Amitabha and Chaudhary, Amitabh and Scheideler, Christian and Kolman, Petr}, year={2007}, pages={141--157} }","short":"A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, SIAM J. Discrete Math. (2007) 141--157.","ieee":"A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, “Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks,” SIAM J. Discrete Math., no. 1, pp. 141--157, 2007."},"type":"journal_article","page":"141--157","_id":"2017","date_updated":"2022-01-06T06:54:20Z","issue":"1","doi":"10.1137/S0895480102419743","author":[{"first_name":"Amitabha","full_name":"Bagchi, Amitabha","last_name":"Bagchi"},{"first_name":"Amitabh","full_name":"Chaudhary, Amitabh","last_name":"Chaudhary"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Kolman","first_name":"Petr","full_name":"Kolman, Petr"}],"department":[{"_id":"79"}],"publication":"SIAM J. Discrete Math.","status":"public","date_created":"2018-03-29T11:50:23Z","user_id":"15504","title":"Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks"},{"user_id":"15504","title":"Linearization: Locally Self-Stabilizing Sorting in Graphs","author":[{"full_name":"Onus, Melih","first_name":"Melih","last_name":"Onus"},{"first_name":"Andrea","full_name":"W. Richa, Andrea","last_name":"W. Richa"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"department":[{"_id":"79"}],"publication":"Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007","status":"public","date_created":"2018-03-29T11:54:37Z","publication_identifier":{"isbn":["978-1-61197-287-0"]},"date_updated":"2022-01-06T06:54:23Z","_id":"2020","doi":"10.1137/1.9781611972870.10","type":"conference","citation":{"ama":"Onus M, W. Richa A, Scheideler C. Linearization: Locally Self-Stabilizing Sorting in Graphs. In: Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007. ; 2007. doi:10.1137/1.9781611972870.10","apa":"Onus, M., W. Richa, A., & Scheideler, C. (2007). Linearization: Locally Self-Stabilizing Sorting in Graphs. In Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007. https://doi.org/10.1137/1.9781611972870.10","chicago":"Onus, Melih, Andrea W. Richa, and Christian Scheideler. “Linearization: Locally Self-Stabilizing Sorting in Graphs.” In Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007, 2007. https://doi.org/10.1137/1.9781611972870.10.","mla":"Onus, Melih, et al. “Linearization: Locally Self-Stabilizing Sorting in Graphs.” Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007, 2007, doi:10.1137/1.9781611972870.10.","bibtex":"@inproceedings{Onus_W. Richa_Scheideler_2007, title={Linearization: Locally Self-Stabilizing Sorting in Graphs}, DOI={10.1137/1.9781611972870.10}, booktitle={Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007}, author={Onus, Melih and W. Richa, Andrea and Scheideler, Christian}, year={2007} }","short":"M. Onus, A. W. Richa, C. Scheideler, in: Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007, 2007.","ieee":"M. Onus, A. W. Richa, and C. Scheideler, “Linearization: Locally Self-Stabilizing Sorting in Graphs,” in Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007, 2007."},"year":"2007"},{"type":"conference","citation":{"ieee":"B. Awerbuch and C. Scheideler, “Towards Scalable and Robust Overlay Networks,” in 6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.","short":"B. Awerbuch, C. Scheideler, in: 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.","mla":"Awerbuch, Baruch, and Christian Scheideler. “Towards Scalable and Robust Overlay Networks.” 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.","bibtex":"@inproceedings{Awerbuch_Scheideler_2007, title={Towards Scalable and Robust Overlay Networks}, booktitle={6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2007} }","apa":"Awerbuch, B., & Scheideler, C. (2007). Towards Scalable and Robust Overlay Networks. In 6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007.","ama":"Awerbuch B, Scheideler C. Towards Scalable and Robust Overlay Networks. In: 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007. ; 2007.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Towards Scalable and Robust Overlay Networks.” In 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007."},"year":"2007","urn":"20228","date_updated":"2022-01-06T06:54:23Z","_id":"2022","oa":"1","file_date_updated":"2018-04-13T10:00:55Z","publication":"6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007","department":[{"_id":"79"}],"author":[{"last_name":"Awerbuch","full_name":"Awerbuch, Baruch","first_name":"Baruch"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-13T10:00:55Z","file_id":"2338","creator":"florida","file_size":191943,"access_level":"open_access","file_name":"IPTPS07.pdf","date_created":"2018-04-13T10:00:55Z"}],"date_created":"2018-03-29T11:55:52Z","has_accepted_license":"1","status":"public","title":"Towards Scalable and Robust Overlay Networks","ddc":["040"],"user_id":"15504"},{"page":"370--371","citation":{"ieee":"B. Awerbuch and C. Scheideler, “A denial-of-service resistant DHT,” in Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, 2007, pp. 370--371.","short":"B. Awerbuch, C. Scheideler, in: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, ACM, 2007, pp. 370--371.","bibtex":"@inproceedings{Awerbuch_Scheideler_2007, title={A denial-of-service resistant DHT}, DOI={10.1145/1281100.1281178}, booktitle={Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007}, publisher={ACM}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2007}, pages={370--371} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.” Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, ACM, 2007, pp. 370--371, doi:10.1145/1281100.1281178.","apa":"Awerbuch, B., & Scheideler, C. (2007). A denial-of-service resistant DHT. In Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007 (pp. 370--371). ACM. https://doi.org/10.1145/1281100.1281178","ama":"Awerbuch B, Scheideler C. A denial-of-service resistant DHT. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007. ACM; 2007:370--371. doi:10.1145/1281100.1281178","chicago":"Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.” In Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, 370--371. ACM, 2007. https://doi.org/10.1145/1281100.1281178."},"type":"conference","year":"2007","urn":"20237","_id":"2023","file":[{"access_level":"open_access","date_created":"2018-04-13T10:02:18Z","file_name":"DISC-07.pdf","relation":"main_file","date_updated":"2018-04-13T10:02:18Z","content_type":"application/pdf","creator":"florida","file_id":"2340","file_size":193097}],"file_date_updated":"2018-04-13T10:02:18Z","publication":"Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007","publisher":"ACM","author":[{"last_name":"Awerbuch","full_name":"Awerbuch, Baruch","first_name":"Baruch"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2018-03-29T11:56:35Z","status":"public","has_accepted_license":"1","user_id":"15504","ddc":["040"],"date_updated":"2022-01-06T06:54:24Z","oa":"1","doi":"10.1145/1281100.1281178","department":[{"_id":"79"}],"publication_identifier":{"isbn":["978-1-59593-616-5"]},"title":"A denial-of-service resistant DHT"},{"_id":"2024","intvolume":" 4731","date_updated":"2022-01-06T06:54:24Z","doi":"10.1007/978-3-540-75142-7_6","series_title":"Lecture Notes in Computer Science","year":"2007","citation":{"short":"B. Awerbuch, C. Scheideler, in: Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, Springer, 2007, pp. 33--47.","ieee":"B. Awerbuch and C. Scheideler, “A Denial-of-Service Resistant DHT,” in Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, 2007, vol. 4731, pp. 33--47.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.” In Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, 4731:33--47. Lecture Notes in Computer Science. Springer, 2007. https://doi.org/10.1007/978-3-540-75142-7_6.","ama":"Awerbuch B, Scheideler C. A Denial-of-Service Resistant DHT. In: Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings. Vol 4731. Lecture Notes in Computer Science. Springer; 2007:33--47. doi:10.1007/978-3-540-75142-7_6","apa":"Awerbuch, B., & Scheideler, C. (2007). A Denial-of-Service Resistant DHT. In Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings (Vol. 4731, pp. 33--47). Springer. https://doi.org/10.1007/978-3-540-75142-7_6","bibtex":"@inproceedings{Awerbuch_Scheideler_2007, series={Lecture Notes in Computer Science}, title={A Denial-of-Service Resistant DHT}, volume={4731}, DOI={10.1007/978-3-540-75142-7_6}, booktitle={Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings}, publisher={Springer}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2007}, pages={33--47}, collection={Lecture Notes in Computer Science} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.” Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, vol. 4731, Springer, 2007, pp. 33--47, doi:10.1007/978-3-540-75142-7_6."},"type":"conference","page":"33--47","title":"A Denial-of-Service Resistant DHT","user_id":"15504","author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publisher":"Springer","publication":"Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings","department":[{"_id":"79"}],"volume":4731,"publication_identifier":{"isbn":["978-3-540-75141-0"]},"status":"public","date_created":"2018-03-29T11:57:42Z"},{"doi":"10.1201/9781420010749.ch72","date_updated":"2022-01-06T06:54:25Z","_id":"2028","citation":{"ama":"W. Richa A, Scheideler C. Overlay Networks for Peer-to-Peer Networks. In: Handbook of Approximation Algorithms and Metaheuristics. ; 2007. doi:10.1201/9781420010749.ch72","apa":"W. Richa, A., & Scheideler, C. (2007). Overlay Networks for Peer-to-Peer Networks. In Handbook of Approximation Algorithms and Metaheuristics. https://doi.org/10.1201/9781420010749.ch72","chicago":"W. Richa, Andrea, and Christian Scheideler. “Overlay Networks for Peer-to-Peer Networks.” In Handbook of Approximation Algorithms and Metaheuristics., 2007. https://doi.org/10.1201/9781420010749.ch72.","mla":"W. Richa, Andrea, and Christian Scheideler. “Overlay Networks for Peer-to-Peer Networks.” Handbook of Approximation Algorithms and Metaheuristics., 2007, doi:10.1201/9781420010749.ch72.","bibtex":"@inbook{W. Richa_Scheideler_2007, title={Overlay Networks for Peer-to-Peer Networks}, DOI={10.1201/9781420010749.ch72}, booktitle={Handbook of Approximation Algorithms and Metaheuristics.}, author={W. Richa, Andrea and Scheideler, Christian}, year={2007} }","short":"A. W. Richa, C. Scheideler, in: Handbook of Approximation Algorithms and Metaheuristics., 2007.","ieee":"A. W. Richa and C. Scheideler, “Overlay Networks for Peer-to-Peer Networks,” in Handbook of Approximation Algorithms and Metaheuristics., 2007."},"year":"2007","type":"book_chapter","title":"Overlay Networks for Peer-to-Peer Networks","user_id":"15504","publication_identifier":{"isbn":["978-1-58488-550-4"]},"date_created":"2018-03-29T12:00:39Z","status":"public","department":[{"_id":"79"}],"publication":"Handbook of Approximation Algorithms and Metaheuristics.","author":[{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, Andrea"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}]},{"type":"conference","citation":{"ieee":"A. Brinkmann, S. Effert, F. Meyer auf der Heide, and C. Scheideler, “Dynamic and redundant data placement,” 2007.","short":"A. Brinkmann, S. Effert, F. Meyer auf der Heide, C. Scheideler, in: IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.","bibtex":"@inproceedings{Brinkmann_Effert_Meyer auf der Heide_Scheideler_2007, title={Dynamic and redundant data placement}, booktitle={IEEE International Conference on Distributed Computing Systems (ICDCS)}, author={Brinkmann, André and Effert, Sascha and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2007} }","mla":"Brinkmann, André, et al. “Dynamic and Redundant Data Placement.” IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.","ama":"Brinkmann A, Effert S, Meyer auf der Heide F, Scheideler C. Dynamic and redundant data placement. In: IEEE International Conference on Distributed Computing Systems (ICDCS). ; 2007.","apa":"Brinkmann, A., Effert, S., Meyer auf der Heide, F., & Scheideler, C. (2007). Dynamic and redundant data placement. IEEE International Conference on Distributed Computing Systems (ICDCS).","chicago":"Brinkmann, André, Sascha Effert, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Dynamic and Redundant Data Placement.” In IEEE International Conference on Distributed Computing Systems (ICDCS), 2007."},"year":"2007","language":[{"iso":"eng"}],"oa":"1","urn":"22147","date_updated":"2022-01-06T06:55:27Z","_id":"2214","date_created":"2018-04-05T07:08:35Z","status":"public","has_accepted_license":"1","file_date_updated":"2018-04-13T10:01:42Z","publication":"IEEE International Conference on Distributed Computing Systems (ICDCS)","department":[{"_id":"79"},{"_id":"63"}],"author":[{"last_name":"Brinkmann","full_name":"Brinkmann, André","first_name":"André"},{"last_name":"Effert","full_name":"Effert, Sascha","first_name":"Sascha"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file":[{"access_level":"open_access","file_name":"ICDCS07.pdf","date_created":"2018-04-13T10:01:42Z","relation":"main_file","date_updated":"2018-04-13T10:01:42Z","content_type":"application/pdf","file_id":"2339","creator":"florida","file_size":164121}],"ddc":["040"],"title":"Dynamic and redundant data placement","user_id":"15415","abstract":[{"lang":"eng","text":"We present a randomized block-level storage virtualization for arbitrary heterogeneous storage systems that can distribute data in a fair and redundant way and can adapt this distribution in an efficient way as storage devices enter or leave the system. More precisely, our virtualization strategies can distribute a set of data blocks among a set of storage devices of arbitrary non-uniform capacities so that a storage device representing x% of the capacity in the system will get x% of the data (as long as this is in principle possible) and the different copies of each data block are stored so that no two copies of a data block are located in the same device. Achieving these two properties is not easy, and no virtualization strategy has been presented so far that has been formally shown to satisfy fairness and redundancy while being time- and space-eflcient and allowing an efficient adaptation to a changing set of devices."}]},{"title":"Can ISPs and P2P users cooperate for improved performance?","user_id":"15504","publication":"ACM Computer Commucation Review","department":[{"_id":"79"}],"author":[{"full_name":"Aggarwal, Vinay","first_name":"Vinay","last_name":"Aggarwal"},{"last_name":"Feldmann","full_name":"Feldmann, Anja","first_name":"Anja"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2018-04-05T06:08:43Z","status":"public","_id":"2209","date_updated":"2022-01-06T06:55:25Z","doi":"10.1145/1273445.1273449","type":"journal_article","citation":{"ieee":"V. Aggarwal, A. Feldmann, and C. Scheideler, “Can ISPs and P2P users cooperate for improved performance?,” ACM Computer Commucation Review, 2007.","short":"V. Aggarwal, A. Feldmann, C. Scheideler, ACM Computer Commucation Review (2007).","mla":"Aggarwal, Vinay, et al. “Can ISPs and P2P Users Cooperate for Improved Performance?” ACM Computer Commucation Review, 2007, doi:10.1145/1273445.1273449.","bibtex":"@article{Aggarwal_Feldmann_Scheideler_2007, title={Can ISPs and P2P users cooperate for improved performance?}, DOI={10.1145/1273445.1273449}, journal={ACM Computer Commucation Review}, author={Aggarwal, Vinay and Feldmann, Anja and Scheideler, Christian}, year={2007} }","chicago":"Aggarwal, Vinay, Anja Feldmann, and Christian Scheideler. “Can ISPs and P2P Users Cooperate for Improved Performance?” ACM Computer Commucation Review, 2007. https://doi.org/10.1145/1273445.1273449.","apa":"Aggarwal, V., Feldmann, A., & Scheideler, C. (2007). Can ISPs and P2P users cooperate for improved performance? ACM Computer Commucation Review. https://doi.org/10.1145/1273445.1273449","ama":"Aggarwal V, Feldmann A, Scheideler C. Can ISPs and P2P users cooperate for improved performance? ACM Computer Commucation Review. 2007. doi:10.1145/1273445.1273449"},"year":"2007"},{"year":"2008","citation":{"chicago":"Scheideler, Christian. “Algorithms for Overlay Networks.” Bulletin of the EATCS, 2008, 130--152.","ama":"Scheideler C. Algorithms for Overlay Networks. Bulletin of the EATCS. 2008:130--152.","apa":"Scheideler, C. (2008). Algorithms for Overlay Networks. Bulletin of the EATCS, 130--152.","mla":"Scheideler, Christian. “Algorithms for Overlay Networks.” Bulletin of the EATCS, 2008, pp. 130--152.","bibtex":"@article{Scheideler_2008, title={Algorithms for Overlay Networks}, journal={Bulletin of the EATCS}, author={Scheideler, Christian}, year={2008}, pages={130--152} }","short":"C. Scheideler, Bulletin of the EATCS (2008) 130--152.","ieee":"C. Scheideler, “Algorithms for Overlay Networks,” Bulletin of the EATCS, pp. 130--152, 2008."},"type":"journal_article","page":"130--152","_id":"1937","date_updated":"2022-01-06T06:54:03Z","status":"public","date_created":"2018-03-29T09:28:22Z","author":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"department":[{"_id":"79"}],"publication":"Bulletin of the EATCS","user_id":"15504","title":"Algorithms for Overlay Networks"},{"publication_identifier":{"isbn":["978-1-59593-989-0"]},"status":"public","date_created":"2018-03-29T09:29:06Z","author":[{"last_name":"Awerbuch","full_name":"Awerbuch, Baruch","first_name":"Baruch"},{"last_name":"W. Richa","first_name":"Andr{\\'{e}}a","full_name":"W. Richa, Andr{\\'{e}}a"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publisher":"ACM","publication":"Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008","department":[{"_id":"79"}],"title":"A jamming-resistant MAC protocol for single-hop wireless networks","user_id":"15504","year":"2008","citation":{"ieee":"B. Awerbuch, A. W. Richa, and C. Scheideler, “A jamming-resistant MAC protocol for single-hop wireless networks,” in Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008, 2008, pp. 45--54.","short":"B. Awerbuch, A. W. Richa, C. Scheideler, in: Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008, ACM, 2008, pp. 45--54.","mla":"Awerbuch, Baruch, et al. “A Jamming-Resistant MAC Protocol for Single-Hop Wireless Networks.” Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008, ACM, 2008, pp. 45--54, doi:10.1145/1400751.1400759.","bibtex":"@inproceedings{Awerbuch_W. Richa_Scheideler_2008, title={A jamming-resistant MAC protocol for single-hop wireless networks}, DOI={10.1145/1400751.1400759}, booktitle={Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008}, publisher={ACM}, author={Awerbuch, Baruch and W. Richa, Andr{\\’{e}}a and Scheideler, Christian}, year={2008}, pages={45--54} }","apa":"Awerbuch, B., W. Richa, A., & Scheideler, C. (2008). A jamming-resistant MAC protocol for single-hop wireless networks. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008 (pp. 45--54). ACM. https://doi.org/10.1145/1400751.1400759","ama":"Awerbuch B, W. Richa A, Scheideler C. A jamming-resistant MAC protocol for single-hop wireless networks. In: Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008. ACM; 2008:45--54. doi:10.1145/1400751.1400759","chicago":"Awerbuch, Baruch, Andr{\\’{e}}a W. Richa, and Christian Scheideler. “A Jamming-Resistant MAC Protocol for Single-Hop Wireless Networks.” In Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008, 45--54. ACM, 2008. https://doi.org/10.1145/1400751.1400759."},"type":"conference","page":"45--54","doi":"10.1145/1400751.1400759","_id":"1938","date_updated":"2022-01-06T06:54:03Z"},{"user_id":"14955","ddc":["040"],"file":[{"file_name":"SODA08.pdf","date_created":"2018-04-13T10:03:13Z","access_level":"open_access","file_size":211264,"creator":"florida","file_id":"2341","date_updated":"2018-04-13T10:03:13Z","content_type":"application/pdf","relation":"main_file"}],"publisher":"SIAM","author":[{"first_name":"Mario","full_name":"Mense, Mario","last_name":"Mense"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publication":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008","file_date_updated":"2018-04-13T10:03:13Z","status":"public","has_accepted_license":"1","date_created":"2018-03-29T09:30:18Z","_id":"1940","urn":"19408","year":"2008","citation":{"short":"M. Mense, C. Scheideler, in: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, SIAM, 2008, pp. 1135--1144.","ieee":"M. Mense and C. Scheideler, “SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems,” in Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, 2008, pp. 1135--1144.","chicago":"Mense, Mario, and Christian Scheideler. “SPREAD: An Adaptive Scheme for Redundant and Fair Storage in Dynamic Heterogeneous Storage Systems.” In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, 1135--1144. SIAM, 2008.","apa":"Mense, M., & Scheideler, C. (2008). SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008 (pp. 1135--1144). SIAM.","ama":"Mense M, Scheideler C. SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008. SIAM; 2008:1135--1144.","mla":"Mense, Mario, and Christian Scheideler. “SPREAD: An Adaptive Scheme for Redundant and Fair Storage in Dynamic Heterogeneous Storage Systems.” Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, SIAM, 2008, pp. 1135--1144.","bibtex":"@inproceedings{Mense_Scheideler_2008, title={SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems}, booktitle={Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008}, publisher={SIAM}, author={Mense, Mario and Scheideler, Christian}, year={2008}, pages={1135--1144} }"},"type":"conference","page":"1135--1144","title":"SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems","department":[{"_id":"79"},{"_id":"63"}],"date_updated":"2022-01-06T06:54:03Z","oa":"1","language":[{"iso":"eng"}]},{"publication_identifier":{"isbn":["978-3-540-89334-9"]},"volume":5340,"status":"public","date_created":"2018-03-29T09:31:18Z","author":[{"first_name":"Thomas","full_name":"Clouser, Thomas","last_name":"Clouser"},{"first_name":"Mikhail","full_name":"Nesterenko, Mikhail","last_name":"Nesterenko"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publisher":"Springer","department":[{"_id":"79"}],"publication":"Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings","title":"Tiara: A Self-stabilizing Deterministic Skip List","user_id":"15504","year":"2008","citation":{"ieee":"T. Clouser, M. Nesterenko, and C. Scheideler, “Tiara: A Self-stabilizing Deterministic Skip List,” in Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings, 2008, vol. 5340, pp. 124--140.","short":"T. Clouser, M. Nesterenko, C. Scheideler, in: Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings, Springer, 2008, pp. 124--140.","bibtex":"@inproceedings{Clouser_Nesterenko_Scheideler_2008, series={Lecture Notes in Computer Science}, title={Tiara: A Self-stabilizing Deterministic Skip List}, volume={5340}, DOI={10.1007/978-3-540-89335-6_12}, booktitle={Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings}, publisher={Springer}, author={Clouser, Thomas and Nesterenko, Mikhail and Scheideler, Christian}, year={2008}, pages={124--140}, collection={Lecture Notes in Computer Science} }","mla":"Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List.” Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings, vol. 5340, Springer, 2008, pp. 124--140, doi:10.1007/978-3-540-89335-6_12.","chicago":"Clouser, Thomas, Mikhail Nesterenko, and Christian Scheideler. “Tiara: A Self-Stabilizing Deterministic Skip List.” In Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings, 5340:124--140. Lecture Notes in Computer Science. Springer, 2008. https://doi.org/10.1007/978-3-540-89335-6_12.","apa":"Clouser, T., Nesterenko, M., & Scheideler, C. (2008). Tiara: A Self-stabilizing Deterministic Skip List. In Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings (Vol. 5340, pp. 124--140). Springer. https://doi.org/10.1007/978-3-540-89335-6_12","ama":"Clouser T, Nesterenko M, Scheideler C. Tiara: A Self-stabilizing Deterministic Skip List. In: Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings. Vol 5340. Lecture Notes in Computer Science. Springer; 2008:124--140. doi:10.1007/978-3-540-89335-6_12"},"type":"conference","page":"124--140","series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-540-89335-6_12","intvolume":" 5340","_id":"1941","date_updated":"2022-01-06T06:54:03Z"},{"publication":"Taschenbuch der Algorithmen","department":[{"_id":"79"}],"author":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publisher":"Springer","date_created":"2018-03-29T09:32:34Z","status":"public","publication_identifier":{"isbn":["978-3-540-76393-2"]},"user_id":"15504","title":"Broadcasting: Wie verbreite ich schnell Informationen?","series_title":"eXamen.press","page":"229--236","citation":{"mla":"Scheideler, Christian. “Broadcasting: Wie Verbreite Ich Schnell Informationen?” Taschenbuch Der Algorithmen, Springer, 2008, pp. 229--236, doi:10.1007/978-3-540-76394-9_22.","bibtex":"@inbook{Scheideler_2008, series={eXamen.press}, title={Broadcasting: Wie verbreite ich schnell Informationen?}, DOI={10.1007/978-3-540-76394-9_22}, booktitle={Taschenbuch der Algorithmen}, publisher={Springer}, author={Scheideler, Christian}, year={2008}, pages={229--236}, collection={eXamen.press} }","apa":"Scheideler, C. (2008). Broadcasting: Wie verbreite ich schnell Informationen? In Taschenbuch der Algorithmen (pp. 229--236). Springer. https://doi.org/10.1007/978-3-540-76394-9_22","ama":"Scheideler C. Broadcasting: Wie verbreite ich schnell Informationen? In: Taschenbuch Der Algorithmen. eXamen.press. Springer; 2008:229--236. doi:10.1007/978-3-540-76394-9_22","chicago":"Scheideler, Christian. “Broadcasting: Wie Verbreite Ich Schnell Informationen?” In Taschenbuch Der Algorithmen, 229--236. EXamen.Press. Springer, 2008. https://doi.org/10.1007/978-3-540-76394-9_22.","ieee":"C. Scheideler, “Broadcasting: Wie verbreite ich schnell Informationen?,” in Taschenbuch der Algorithmen, Springer, 2008, pp. 229--236.","short":"C. Scheideler, in: Taschenbuch Der Algorithmen, Springer, 2008, pp. 229--236."},"type":"book_chapter","year":"2008","_id":"1942","date_updated":"2022-01-06T06:54:03Z","doi":"10.1007/978-3-540-76394-9_22"},{"page":"187","citation":{"short":"R. D. Kleinberg, C. Scheideler, Theory Comput. Syst. (2009) 187.","ieee":"R. D. Kleinberg and C. Scheideler, “Foreword,” Theory Comput. Syst., no. 2, p. 187, 2009.","ama":"D. Kleinberg R, Scheideler C. Foreword. Theory Comput Syst. 2009;(2):187. doi:10.1007/s00224-009-9202-x","apa":"D. Kleinberg, R., & Scheideler, C. (2009). Foreword. Theory Comput. Syst., (2), 187. https://doi.org/10.1007/s00224-009-9202-x","chicago":"D. Kleinberg, Robert, and Christian Scheideler. “Foreword.” Theory Comput. Syst., no. 2 (2009): 187. https://doi.org/10.1007/s00224-009-9202-x.","bibtex":"@article{D. Kleinberg_Scheideler_2009, title={Foreword}, DOI={10.1007/s00224-009-9202-x}, number={2}, journal={Theory Comput. Syst.}, author={D. Kleinberg, Robert and Scheideler, Christian}, year={2009}, pages={187} }","mla":"D. Kleinberg, Robert, and Christian Scheideler. “Foreword.” Theory Comput. Syst., no. 2, 2009, p. 187, doi:10.1007/s00224-009-9202-x."},"type":"journal_article","year":"2009","issue":"2","doi":"10.1007/s00224-009-9202-x","_id":"1925","date_updated":"2022-01-06T06:54:00Z","date_created":"2018-03-29T09:01:30Z","status":"public","publication":"Theory Comput. Syst.","department":[{"_id":"79"}],"author":[{"last_name":"D. Kleinberg","full_name":"D. Kleinberg, Robert","first_name":"Robert"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"user_id":"15504","title":"Foreword"},{"date_created":"2018-03-29T09:08:11Z","status":"public","department":[{"_id":"79"}],"publication":"Theory Comput. Syst.","author":[{"first_name":"Baruch","full_name":"Awerbuch, Baruch","last_name":"Awerbuch"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"user_id":"15504","title":"Towards a Scalable and Robust DHT","page":"234--260","type":"journal_article","citation":{"mla":"Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.” Theory Comput. Syst., no. 2, 2009, pp. 234--260, doi:10.1007/s00224-008-9099-9.","bibtex":"@article{Awerbuch_Scheideler_2009, title={Towards a Scalable and Robust DHT}, DOI={10.1007/s00224-008-9099-9}, number={2}, journal={Theory Comput. Syst.}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2009}, pages={234--260} }","ama":"Awerbuch B, Scheideler C. Towards a Scalable and Robust DHT. Theory Comput Syst. 2009;(2):234--260. doi:10.1007/s00224-008-9099-9","apa":"Awerbuch, B., & Scheideler, C. (2009). Towards a Scalable and Robust DHT. Theory Comput. Syst., (2), 234--260. https://doi.org/10.1007/s00224-008-9099-9","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.” Theory Comput. Syst., no. 2 (2009): 234--260. https://doi.org/10.1007/s00224-008-9099-9.","ieee":"B. Awerbuch and C. Scheideler, “Towards a Scalable and Robust DHT,” Theory Comput. Syst., no. 2, pp. 234--260, 2009.","short":"B. Awerbuch, C. Scheideler, Theory Comput. Syst. (2009) 234--260."},"year":"2009","issue":"2","doi":"10.1007/s00224-008-9099-9","_id":"1927","date_updated":"2022-01-06T06:54:00Z"},{"year":"2009","citation":{"short":"B. Awerbuch, C. Scheideler, Theor. Comput. Sci. (2009) 453--466.","ieee":"B. Awerbuch and C. Scheideler, “Robust random number generation for peer-to-peer systems,” Theor. Comput. Sci., no. 6–7, pp. 453--466, 2009.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.” Theor. Comput. Sci., no. 6–7 (2009): 453--466. https://doi.org/10.1016/j.tcs.2008.10.003.","apa":"Awerbuch, B., & Scheideler, C. (2009). Robust random number generation for peer-to-peer systems. Theor. Comput. Sci., (6–7), 453--466. https://doi.org/10.1016/j.tcs.2008.10.003","ama":"Awerbuch B, Scheideler C. Robust random number generation for peer-to-peer systems. Theor Comput Sci. 2009;(6-7):453--466. doi:10.1016/j.tcs.2008.10.003","mla":"Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.” Theor. Comput. Sci., no. 6–7, 2009, pp. 453--466, doi:10.1016/j.tcs.2008.10.003.","bibtex":"@article{Awerbuch_Scheideler_2009, title={Robust random number generation for peer-to-peer systems}, DOI={10.1016/j.tcs.2008.10.003}, number={6–7}, journal={Theor. Comput. Sci.}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2009}, pages={453--466} }"},"type":"journal_article","page":"453--466","_id":"1928","date_updated":"2022-01-06T06:54:01Z","doi":"10.1016/j.tcs.2008.10.003","issue":"6-7","author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publication":"Theor. Comput. Sci.","department":[{"_id":"79"}],"status":"public","date_created":"2018-03-29T09:08:12Z","title":"Robust random number generation for peer-to-peer systems","user_id":"15504"},{"user_id":"15504","title":"A Distributed and Oblivious Heap","date_created":"2018-03-29T09:08:14Z","status":"public","volume":5556,"publication_identifier":{"isbn":["978-3-642-02929-5"]},"publication":"Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II","department":[{"_id":"79"}],"author":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"}],"publisher":"Springer","doi":"10.1007/978-3-642-02930-1_47","intvolume":" 5556","_id":"1929","date_updated":"2022-01-06T06:54:01Z","page":"571--582","type":"conference","citation":{"mla":"Scheideler, Christian, and Stefan Schmid. “A Distributed and Oblivious Heap.” Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, vol. 5556, Springer, 2009, pp. 571--582, doi:10.1007/978-3-642-02930-1_47.","bibtex":"@inproceedings{Scheideler_Schmid_2009, series={Lecture Notes in Computer Science}, title={A Distributed and Oblivious Heap}, volume={5556}, DOI={10.1007/978-3-642-02930-1_47}, booktitle={Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II}, publisher={Springer}, author={Scheideler, Christian and Schmid, Stefan}, year={2009}, pages={571--582}, collection={Lecture Notes in Computer Science} }","ama":"Scheideler C, Schmid S. A Distributed and Oblivious Heap. In: Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II. Vol 5556. Lecture Notes in Computer Science. Springer; 2009:571--582. doi:10.1007/978-3-642-02930-1_47","apa":"Scheideler, C., & Schmid, S. (2009). A Distributed and Oblivious Heap. In Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II (Vol. 5556, pp. 571--582). Springer. https://doi.org/10.1007/978-3-642-02930-1_47","chicago":"Scheideler, Christian, and Stefan Schmid. “A Distributed and Oblivious Heap.” In Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, 5556:571--582. Lecture Notes in Computer Science. Springer, 2009. https://doi.org/10.1007/978-3-642-02930-1_47.","ieee":"C. Scheideler and S. Schmid, “A Distributed and Oblivious Heap,” in Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, 2009, vol. 5556, pp. 571--582.","short":"C. Scheideler, S. Schmid, in: Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, Springer, 2009, pp. 571--582."},"year":"2009","series_title":"Lecture Notes in Computer Science"},{"title":"A Self-stabilizing and Local Delaunay Graph Construction","department":[{"_id":"79"}],"doi":"10.1007/978-3-642-10631-6_78","oa":"1","date_updated":"2022-01-06T06:54:02Z","series_title":"Lecture Notes in Computer Science","ddc":["040"],"user_id":"15504","volume":5878,"status":"public","has_accepted_license":"1","date_created":"2018-03-29T09:12:59Z","publisher":"Springer","author":[{"last_name":"Jacob","full_name":"Jacob, Riko","first_name":"Riko"},{"full_name":"Ritscher, Stephan","first_name":"Stephan","last_name":"Ritscher"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"}],"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","file":[{"file_id":"2342","creator":"florida","file_size":139275,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-13T10:05:53Z","file_name":"isaac09.pdf","date_created":"2018-04-13T10:05:53Z","access_level":"open_access"}],"_id":"1930","intvolume":" 5878","urn":"19304","year":"2009","citation":{"short":"R. Jacob, S. Ritscher, C. Scheideler, S. Schmid, in: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, Springer, 2009, pp. 771--780.","ieee":"R. Jacob, S. Ritscher, C. Scheideler, and S. Schmid, “A Self-stabilizing and Local Delaunay Graph Construction,” in Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, 2009, vol. 5878, pp. 771--780.","chicago":"Jacob, Riko, Stephan Ritscher, Christian Scheideler, and Stefan Schmid. “A Self-Stabilizing and Local Delaunay Graph Construction.” In Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, 5878:771--780. Lecture Notes in Computer Science. Springer, 2009. https://doi.org/10.1007/978-3-642-10631-6_78.","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","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} }","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."},"type":"conference","page":"771--780"},{"_id":"1932","date_updated":"2022-01-06T06:54:02Z","doi":"10.1145/1582716.1582741","page":"131--140","type":"conference","year":"2009","citation":{"bibtex":"@inproceedings{Jacob_W. Richa_Scheideler_Schmid_Täubig_2009, title={A distributed polylogarithmic time algorithm for self-stabilizing skip graphs}, DOI={10.1145/1582716.1582741}, booktitle={Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009}, author={Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo}, year={2009}, pages={131--140} }","mla":"Jacob, Riko, et al. “A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs.” Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140, doi:10.1145/1582716.1582741.","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","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.","ieee":"R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “A distributed polylogarithmic time algorithm for self-stabilizing skip graphs,” in Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140.","short":"R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140."},"title":"A distributed polylogarithmic time algorithm for self-stabilizing skip graphs","user_id":"15504","publication":"Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009","department":[{"_id":"79"}],"author":[{"last_name":"Jacob","first_name":"Riko","full_name":"Jacob, Riko"},{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"},{"first_name":"Hanjo","full_name":"Täubig, Hanjo","last_name":"Täubig"}],"publication_identifier":{"isbn":["978-1-60558-396-9"]},"date_created":"2018-03-29T09:16:22Z","status":"public"},{"user_id":"15504","title":"A DoS-resilient information system for dynamic data management","date_created":"2018-03-29T09:18:06Z","status":"public","publication_identifier":{"isbn":["978-1-60558-606-9"]},"department":[{"_id":"79"}],"publication":"SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009","author":[{"full_name":"Baumgart, Matthias","first_name":"Matthias","last_name":"Baumgart"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"}],"doi":"10.1145/1583991.1584064","date_updated":"2022-01-06T06:54:02Z","_id":"1933","page":"300--309","year":"2009","citation":{"apa":"Baumgart, M., Scheideler, C., & Schmid, S. (2009). A DoS-resilient information system for dynamic data management. In SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009 (pp. 300--309). https://doi.org/10.1145/1583991.1584064","ama":"Baumgart M, Scheideler C, Schmid S. A DoS-resilient information system for dynamic data management. In: SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009. ; 2009:300--309. doi:10.1145/1583991.1584064","chicago":"Baumgart, Matthias, Christian Scheideler, and Stefan Schmid. “A DoS-Resilient Information System for Dynamic Data Management.” In SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, 300--309, 2009. https://doi.org/10.1145/1583991.1584064.","mla":"Baumgart, Matthias, et al. “A DoS-Resilient Information System for Dynamic Data Management.” SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, 2009, pp. 300--309, doi:10.1145/1583991.1584064.","bibtex":"@inproceedings{Baumgart_Scheideler_Schmid_2009, title={A DoS-resilient information system for dynamic data management}, DOI={10.1145/1583991.1584064}, booktitle={SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009}, author={Baumgart, Matthias and Scheideler, Christian and Schmid, Stefan}, year={2009}, pages={300--309} }","short":"M. Baumgart, C. Scheideler, S. Schmid, in: SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, 2009, pp. 300--309.","ieee":"M. Baumgart, C. Scheideler, and S. Schmid, “A DoS-resilient information system for dynamic data management,” in SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, 2009, pp. 300--309."},"type":"conference"},{"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","page":"781--782","type":"conference","year":"2009","citation":{"ieee":"D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization,” in Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, 2009, vol. 5873, pp. 781--782.","short":"D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, Springer, 2009, pp. 781--782.","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} }","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."},"user_id":"15504","title":"Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization","department":[{"_id":"79"}],"publication":"Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings","author":[{"first_name":"Dominik","full_name":"Gall, Dominik","last_name":"Gall"},{"full_name":"Jacob, Riko","first_name":"Riko","last_name":"Jacob"},{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"full_name":"Täubig, Hanjo","first_name":"Hanjo","last_name":"Täubig"}],"publisher":"Springer","date_created":"2018-03-29T09:19:17Z","status":"public","publication_identifier":{"isbn":["978-3-642-05117-3"]},"volume":5873},{"date_created":"2018-03-29T09:20:44Z","status":"public","volume":"09371","publication":"Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009","department":[{"_id":"79"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany","author":[{"full_name":"Doerr, Benjamin","first_name":"Benjamin","last_name":"Doerr"},{"first_name":"Leslie","full_name":"Ann Goldberg, Leslie","last_name":"Ann Goldberg"},{"last_name":"Minder","full_name":"Minder, Lorenz","first_name":"Lorenz"},{"last_name":"Sauerwald","full_name":"Sauerwald, Thomas","first_name":"Thomas"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"user_id":"15504","title":"Stabilizing Consensus with the Power of Two Choices","citation":{"bibtex":"@inproceedings{Doerr_Ann Goldberg_Minder_Sauerwald_Scheideler_2009, series={Dagstuhl Seminar Proceedings}, title={Stabilizing Consensus with the Power of Two Choices}, volume={09371}, DOI={10.1145/1989493.1989516}, booktitle={Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany}, author={Doerr, Benjamin and Ann Goldberg, Leslie and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian}, year={2009}, collection={Dagstuhl Seminar Proceedings} }","mla":"Doerr, Benjamin, et al. “Stabilizing Consensus with the Power of Two Choices.” Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, vol. 09371, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009, doi:10.1145/1989493.1989516.","apa":"Doerr, B., Ann Goldberg, L., Minder, L., Sauerwald, T., & Scheideler, C. (2009). Stabilizing Consensus with the Power of Two Choices. In Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009 (Vol. 09371). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. https://doi.org/10.1145/1989493.1989516","ama":"Doerr B, Ann Goldberg L, Minder L, Sauerwald T, Scheideler C. Stabilizing Consensus with the Power of Two Choices. In: Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009. Vol 09371. Dagstuhl Seminar Proceedings. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany; 2009. doi:10.1145/1989493.1989516","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.","ieee":"B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Stabilizing Consensus with the Power of Two Choices,” in Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, 2009, vol. 09371.","short":"B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009."},"type":"conference","year":"2009","series_title":"Dagstuhl Seminar Proceedings","doi":"10.1145/1989493.1989516","date_updated":"2022-01-06T06:54:02Z","_id":"1935","intvolume":" 9371"},{"citation":{"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.","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.","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","ieee":"F. Meyer auf der Heide and C. Scheideler, “Algorithmische Grundlagen verteilter Speichersysteme,” Informatik Spektrum, no. 5, pp. 468--474, 2010.","short":"F. Meyer auf der Heide, C. Scheideler, Informatik Spektrum (2010) 468--474."},"year":"2010","type":"journal_article","page":"468--474","language":[{"iso":"eng"}],"_id":"1903","date_updated":"2022-01-06T06:53:57Z","doi":"10.1007/s00287-010-0470-2","issue":"5","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"Informatik Spektrum","status":"public","date_created":"2018-03-28T07:21:50Z","title":"Algorithmische Grundlagen verteilter Speichersysteme","user_id":"14955"},{"page":"809--810","year":"2010","type":"journal_article","citation":{"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.","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","ieee":"C. Gavoille, B. Patt-Shamir, and C. Scheideler, “Foreword,” Theory of Computing Systems, no. 4, pp. 809--810, 2010.","short":"C. Gavoille, B. Patt-Shamir, C. Scheideler, Theory of Computing Systems (2010) 809--810."},"doi":"10.1007/s00224-010-9284-5","issue":"4","date_updated":"2022-01-06T06:53:57Z","_id":"1904","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"},{"first_name":"Boaz","full_name":"Patt-Shamir, Boaz","last_name":"Patt-Shamir"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"title":"Foreword","user_id":"15504"},{"title":"Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization","user_id":"15504","volume":6034,"publication_identifier":{"isbn":["978-3-642-12199-9"]},"status":"public","date_created":"2018-03-28T07:22:42Z","publisher":"Springer","author":[{"last_name":"Gall","full_name":"Gall, Dominik","first_name":"Dominik"},{"full_name":"Jacob, Riko","first_name":"Riko","last_name":"Jacob"},{"first_name":"Andrea","full_name":"W. Richa, Andrea","last_name":"W. Richa"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"},{"last_name":"Täubig","full_name":"Täubig, Hanjo","first_name":"Hanjo"}],"department":[{"_id":"79"}],"publication":"LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings","doi":"10.1007/978-3-642-12200-2_27","_id":"1905","date_updated":"2022-01-06T06:53:57Z","intvolume":" 6034","citation":{"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.","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","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.","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} }","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."},"year":"2010","type":"conference","page":"294--305","series_title":"Lecture Notes in Computer Science"},{"user_id":"15504","title":"Brief announcement: towards robust medium access in multi-hop networks","date_created":"2018-03-28T07:23:32Z","status":"public","publication_identifier":{"isbn":["978-1-60558-888-9"]},"department":[{"_id":"79"}],"publication":"Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010","publisher":"ACM","author":[{"first_name":"Andrea W.","full_name":"Richa, Andrea W.","last_name":"Richa"},{"full_name":"Zhang, Jin","first_name":"Jin","last_name":"Zhang"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"}],"doi":"10.1145/1835698.1835726","date_updated":"2022-01-06T06:53:57Z","_id":"1906","page":"114--115","type":"conference","year":"2010","citation":{"short":"A.W. Richa, J. Zhang, C. Scheideler, S. Schmid, in: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, ACM, 2010, pp. 114--115.","ieee":"A. W. Richa, J. Zhang, C. Scheideler, and S. Schmid, “Brief announcement: towards robust medium access in multi-hop networks,” in Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, 2010, pp. 114--115.","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.","apa":"Richa, A. W., Zhang, J., Scheideler, C., & Schmid, S. (2010). Brief announcement: towards robust medium access in multi-hop networks. In Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010 (pp. 114--115). ACM. https://doi.org/10.1145/1835698.1835726","ama":"Richa AW, Zhang J, Scheideler C, Schmid S. Brief announcement: towards robust medium access in multi-hop networks. In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010. ACM; 2010:114--115. doi:10.1145/1835698.1835726","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} }"}},{"intvolume":" 6343","_id":"1907","date_updated":"2022-01-06T06:53:58Z","doi":"10.1007/978-3-642-15763-9_17","series_title":"Lecture Notes in Computer Science","type":"conference","citation":{"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.","apa":"Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2010). A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks. In Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings (Vol. 6343, pp. 179--193). Springer. https://doi.org/10.1007/978-3-642-15763-9_17","ama":"Richa AW, Scheideler C, Schmid S, Zhang J. A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks. In: Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings. Vol 6343. Lecture Notes in Computer Science. Springer; 2010:179--193. doi:10.1007/978-3-642-15763-9_17","chicago":"Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin Zhang. “A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks.” In Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, 6343:179--193. Lecture Notes in Computer Science. Springer, 2010. https://doi.org/10.1007/978-3-642-15763-9_17.","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.","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} }"},"year":"2010","page":"179--193","user_id":"15504","title":"A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks","publisher":"Springer","author":[{"first_name":"Andrea W.","full_name":"Richa, Andrea W.","last_name":"Richa"},{"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","first_name":"Jin","full_name":"Zhang, Jin"}],"department":[{"_id":"79"}],"publication":"Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings","status":"public","date_created":"2018-03-28T07:24:22Z","volume":6343,"publication_identifier":{"isbn":["978-3-642-15762-2"]}},{"page":"528--530","citation":{"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.","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} }","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.","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","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."},"year":"2010","type":"conference","series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-642-15763-9_50","_id":"1908","intvolume":" 6343","date_updated":"2022-01-06T06:53:58Z","volume":6343,"date_created":"2018-03-28T07:25:45Z","status":"public","publication":"Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings","department":[{"_id":"79"}],"author":[{"first_name":"Benjamin","full_name":"Doerr, Benjamin","last_name":"Doerr"},{"last_name":"Ann Goldberg","first_name":"Leslie","full_name":"Ann Goldberg, Leslie"},{"first_name":"Lorenz","full_name":"Minder, Lorenz","last_name":"Minder"},{"full_name":"Sauerwald, Thomas","first_name":"Thomas","last_name":"Sauerwald"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"Springer","title":"Brief Announcement: Stabilizing Consensus with the Power of Two Choices","user_id":"15504"},{"user_id":"15504","title":"Competitive and Fair Medium Access Despite Reactive Jamming","author":[{"first_name":"Andrea","full_name":"W. Richa, Andrea","last_name":"W. Richa"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"},{"first_name":"Jin","full_name":"Zhang, Jin","last_name":"Zhang"}],"publisher":"IEEE Computer Society","publication":"2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011","department":[{"_id":"79"}],"status":"public","date_created":"2018-03-28T07:08:13Z","publication_identifier":{"isbn":["978-0-7695-4364-2"]},"date_updated":"2022-01-06T06:53:54Z","_id":"1891","doi":"10.1109/ICDCS.2011.8","citation":{"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} }","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","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.","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."},"year":"2011","type":"conference","page":"507--516"},{"page":"33--36","year":"2011","type":"conference","citation":{"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} }","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."},"_id":"1892","date_updated":"2022-01-06T06:53:54Z","doi":"10.1145/2030686.2030697","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","department":[{"_id":"79"}],"author":[{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, 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","full_name":"Zhang, Jin","first_name":"Jin"}],"publisher":"ACM","date_created":"2018-03-28T07:09:07Z","status":"public","publication_identifier":{"isbn":["978-1-4503-0868-7"]},"user_id":"15504","title":"Towards jamming-resistant and competitive medium access in the SINR model"},{"doi":"10.1145/2107502.2107522","date_updated":"2022-01-06T06:53:54Z","_id":"1893","page":"15","type":"conference","year":"2011","citation":{"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","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."},"title":"Self-stabilizing leader election for single-hop wireless networks despite jamming","user_id":"15504","publication_identifier":{"isbn":["978-1-4503-0722-2"]},"date_created":"2018-03-28T07:09:54Z","status":"public","department":[{"_id":"79"}],"publication":"Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011","author":[{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, Andrea"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"},{"full_name":"Zhang, Jin","first_name":"Jin","last_name":"Zhang"}],"publisher":"ACM"},{"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.","mla":"Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-Located with FCRC 2011), 2011, pp. 235--244, doi:10.1145/1989493.1989527.","bibtex":"@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2011, title={Re-Chord: a self-stabilizing chord overlay network}, DOI={10.1145/1989493.1989527}, booktitle={SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2011}, pages={235--244} }","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.","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"},"year":"2011","page":"235--244","_id":"1895","date_updated":"2022-01-06T06:53:55Z","doi":"10.1145/1989493.1989527","author":[{"last_name":"Kniesburges","full_name":"Kniesburges, Sebastian","first_name":"Sebastian"},{"last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas","first_name":"Andreas"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"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)","department":[{"_id":"79"}],"publication_identifier":{"isbn":["978-1-4503-0743-7"]},"status":"public","date_created":"2018-03-28T07:12:49Z","title":"Re-Chord: a self-stabilizing chord overlay network","user_id":"15504"},{"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"]},"publisher":"Springer","author":[{"first_name":"Sebastian","full_name":"Kniesburges, Sebastian","last_name":"Kniesburges"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publication":"WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings","department":[{"_id":"79"}],"doi":"10.1007/978-3-642-19094-0_18","_id":"1899","intvolume":" 6552","date_updated":"2022-01-06T06:53:56Z","year":"2011","citation":{"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.","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.","apa":"Kniesburges, S., & Scheideler, C. (2011). Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. In WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings (Vol. 6552, pp. 170--181). Springer. https://doi.org/10.1007/978-3-642-19094-0_18","ama":"Kniesburges S, Scheideler C. Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. In: WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings. Vol 6552. Lecture Notes in Computer Science. Springer; 2011:170--181. doi:10.1007/978-3-642-19094-0_18","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.","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} }","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."},"type":"conference","page":"170--181","series_title":"Lecture Notes in Computer Science"},{"page":"155--168","type":"book_chapter","citation":{"bibtex":"@inbook{Scheideler_Graffi_2011, title={Programming for Distributed Computing: From Physical to Logical Networks}, DOI={10.1007/978-1-4614-1168-0_9}, booktitle={Computer Science, The Hardware, Software and Heart of It}, publisher={Springer}, author={Scheideler, Christian and Graffi, Kalman}, year={2011}, pages={155--168} }","mla":"Scheideler, Christian, and Kalman Graffi. “Programming for Distributed Computing: From Physical to Logical Networks.” Computer Science, The Hardware, Software and Heart of It, Springer, 2011, pp. 155--168, doi:10.1007/978-1-4614-1168-0_9.","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","ieee":"C. Scheideler and K. Graffi, “Programming for Distributed Computing: From Physical to Logical Networks,” in Computer Science, The Hardware, Software and Heart of It, Springer, 2011, pp. 155--168.","short":"C. Scheideler, K. Graffi, in: Computer Science, The Hardware, Software and Heart of It, Springer, 2011, pp. 155--168."},"year":"2011","doi":"10.1007/978-1-4614-1168-0_9","date_updated":"2022-01-06T06:53:57Z","_id":"1900","publication_identifier":{"isbn":["978-1-4614-1167-3"]},"date_created":"2018-03-28T07:17:53Z","status":"public","publication":"Computer Science, The Hardware, Software and Heart of It","department":[{"_id":"79"}],"publisher":"Springer","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"first_name":"Kalman","full_name":"Graffi, Kalman","last_name":"Graffi"}],"title":"Programming for Distributed Computing: From Physical to Logical Networks","user_id":"15504"},{"doi":"10.1007/978-3-642-15328-0_22","date_updated":"2022-01-06T06:53:57Z","_id":"1901","year":"2011","citation":{"ieee":"C. Scheideler, “Broadcasting - How Can I Quickly Disseminate Information?,” in Algorithms Unplugged, Springer, 2011, pp. 223--229.","short":"C. Scheideler, in: Algorithms Unplugged, Springer, 2011, pp. 223--229.","bibtex":"@inbook{Scheideler_2011, title={Broadcasting - How Can I Quickly Disseminate Information?}, DOI={10.1007/978-3-642-15328-0_22}, booktitle={Algorithms Unplugged}, publisher={Springer}, author={Scheideler, Christian}, year={2011}, pages={223--229} }","mla":"Scheideler, Christian. “Broadcasting - How Can I Quickly Disseminate Information?” Algorithms Unplugged, Springer, 2011, pp. 223--229, doi:10.1007/978-3-642-15328-0_22.","ama":"Scheideler C. Broadcasting - How Can I Quickly Disseminate Information? In: Algorithms Unplugged. Springer; 2011:223--229. doi:10.1007/978-3-642-15328-0_22","apa":"Scheideler, C. (2011). Broadcasting - How Can I Quickly Disseminate Information? In Algorithms Unplugged (pp. 223--229). Springer. https://doi.org/10.1007/978-3-642-15328-0_22","chicago":"Scheideler, Christian. “Broadcasting - How Can I Quickly Disseminate Information?” In Algorithms Unplugged, 223--229. Springer, 2011. https://doi.org/10.1007/978-3-642-15328-0_22."},"type":"book_chapter","page":"223--229","title":"Broadcasting - How Can I Quickly Disseminate Information?","user_id":"15504","publication_identifier":{"isbn":["978-3-642-15327-3"]},"status":"public","date_created":"2018-03-28T07:18:43Z","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publisher":"Springer","department":[{"_id":"79"}],"publication":"Algorithms Unplugged"},{"author":[{"last_name":"Kolman","full_name":"Kolman, Petr","first_name":"Petr"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"department":[{"_id":"79"}],"publication":"28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany","status":"public","date_created":"2018-03-29T08:44:00Z","user_id":"15504","title":"Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing","type":"conference","citation":{"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} }","chicago":"Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.” In 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 129--140, 2011. https://doi.org/10.4230/LIPIcs.STACS.2011.129.","apa":"Kolman, P., & Scheideler, C. (2011). Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. In 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany (pp. 129--140). https://doi.org/10.4230/LIPIcs.STACS.2011.129","ama":"Kolman P, Scheideler C. Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany. ; 2011:129--140. doi:10.4230/LIPIcs.STACS.2011.129","ieee":"P. Kolman and C. Scheideler, “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing,” in 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 2011, pp. 129--140.","short":"P. Kolman, C. Scheideler, in: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 2011, pp. 129--140."},"year":"2011","page":"129--140","_id":"1924","date_updated":"2022-01-06T06:54:00Z","doi":"10.4230/LIPIcs.STACS.2011.129"},{"page":"149-158","type":"conference","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.","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.","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","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","date_updated":"2022-01-06T07:03:05Z","_id":"645","doi":"10.1145/1989493.1989516","publication":"Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","department":[{"_id":"79"}],"file_date_updated":"2018-03-14T13:58:11Z","author":[{"full_name":"Doerr, Benjamin","first_name":"Benjamin","last_name":"Doerr"},{"last_name":"Goldberg","full_name":"Goldberg, Leslie Ann","first_name":"Leslie Ann"},{"last_name":"Minder","full_name":"Minder, Lorenz","first_name":"Lorenz"},{"last_name":"Sauerwald","first_name":"Thomas","full_name":"Sauerwald, Thomas"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file":[{"date_updated":"2018-03-14T13:58:11Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":268500,"file_id":"1228","creator":"florida","access_level":"closed","file_name":"645-spaa70-scheideler.pdf","date_created":"2018-03-14T13:58:11Z"}],"date_created":"2017-10-17T12:42:57Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"status":"public","has_accepted_license":"1","abstract":[{"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.","lang":"eng"}],"ddc":["040"],"title":"Stabilizing consensus with the power of two choices","user_id":"15504"},{"series_title":"LNCS","date_updated":"2022-01-06T07:03:06Z","doi":"10.1007/978-3-642-24550-3_31","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"title":"Self-Stabilizing DeBruijn Networks","page":"416-430","citation":{"ieee":"A. W. Richa and C. Scheideler, “Self-Stabilizing DeBruijn Networks,” in Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 416–430.","short":"A.W. Richa, C. Scheideler, in: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 416–430.","bibtex":"@inproceedings{Richa_Scheideler_2011, series={LNCS}, title={Self-Stabilizing DeBruijn Networks}, DOI={10.1007/978-3-642-24550-3_31}, booktitle={Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, author={Richa, Andrea W. and Scheideler, Christian}, year={2011}, pages={416–430}, collection={LNCS} }","mla":"Richa, Andrea W., and Christian Scheideler. “Self-Stabilizing DeBruijn Networks.” Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 416–30, doi:10.1007/978-3-642-24550-3_31.","apa":"Richa, A. W., & Scheideler, C. (2011). Self-Stabilizing DeBruijn Networks. In Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 416–430). https://doi.org/10.1007/978-3-642-24550-3_31","ama":"Richa AW, Scheideler C. Self-Stabilizing DeBruijn Networks. In: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). LNCS. ; 2011:416-430. doi:10.1007/978-3-642-24550-3_31","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."},"type":"conference","year":"2011","_id":"646","file":[{"access_level":"closed","file_name":"646-SSS2011-Scheideler_02.pdf","date_created":"2018-03-14T13:57:26Z","content_type":"application/pdf","date_updated":"2018-03-14T13:57:26Z","success":1,"relation":"main_file","file_size":339664,"file_id":"1227","creator":"florida"}],"publication":"Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","file_date_updated":"2018-03-14T13:57:26Z","author":[{"full_name":"Richa, Andrea W.","first_name":"Andrea W.","last_name":"Richa"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2017-10-17T12:42:58Z","status":"public","has_accepted_license":"1","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."}],"user_id":"15504","ddc":["040"]},{"department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"title":"Corona: A Stabilizing Deterministic Message-Passing Skip List","series_title":"LNCS","date_updated":"2022-01-06T07:03:13Z","doi":"10.1007/978-3-642-24550-3_27","file":[{"file_id":"1217","creator":"florida","file_size":305543,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-03-14T13:46:48Z","file_name":"662-SSS2011-Corona-Scheideler.pdf","date_created":"2018-03-14T13:46:48Z","access_level":"closed"}],"publication":"Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","file_date_updated":"2018-03-14T13:46:48Z","author":[{"first_name":"Mikhail","full_name":"Nesterenko, Mikhail","last_name":"Nesterenko"},{"last_name":"Mohd","full_name":"Mohd, Rizal","first_name":"Rizal"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2017-10-17T12:43:01Z","has_accepted_license":"1","status":"public","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"}],"user_id":"15504","ddc":["040"],"page":"356--370","type":"conference","citation":{"ieee":"M. Nesterenko, R. Mohd, and C. Scheideler, “Corona: A Stabilizing Deterministic Message-Passing Skip List,” in Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 356--370.","short":"M. Nesterenko, R. Mohd, C. Scheideler, in: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 356--370.","bibtex":"@inproceedings{Nesterenko_Mohd_Scheideler_2011, series={LNCS}, title={Corona: A Stabilizing Deterministic Message-Passing Skip List}, DOI={10.1007/978-3-642-24550-3_27}, booktitle={Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, author={Nesterenko, Mikhail and Mohd, Rizal and Scheideler, Christian}, year={2011}, pages={356--370}, collection={LNCS} }","mla":"Nesterenko, Mikhail, et al. “Corona: A Stabilizing Deterministic Message-Passing Skip List.” Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 356--370, doi:10.1007/978-3-642-24550-3_27.","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","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","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."},"year":"2011","_id":"662"},{"page":"1","year":"2012","citation":{"chicago":"Dolev, Shlomi, and Christian Scheideler. “Editorial for Algorithmic Aspects of Wireless Sensor Networks.” Theor. Comput. Sci., 2012, 1. https://doi.org/10.1016/j.tcs.2012.07.012.","apa":"Dolev, S., & Scheideler, C. (2012). Editorial for Algorithmic Aspects of Wireless Sensor Networks. Theor. Comput. Sci., 1. https://doi.org/10.1016/j.tcs.2012.07.012","ama":"Dolev S, Scheideler C. Editorial for Algorithmic Aspects of Wireless Sensor Networks. Theor Comput Sci. 2012:1. doi:10.1016/j.tcs.2012.07.012","bibtex":"@article{Dolev_Scheideler_2012, title={Editorial for Algorithmic Aspects of Wireless Sensor Networks}, DOI={10.1016/j.tcs.2012.07.012}, journal={Theor. Comput. Sci.}, author={Dolev, Shlomi and Scheideler, Christian}, year={2012}, pages={1} }","mla":"Dolev, Shlomi, and Christian Scheideler. “Editorial for Algorithmic Aspects of Wireless Sensor Networks.” Theor. Comput. Sci., 2012, p. 1, doi:10.1016/j.tcs.2012.07.012.","short":"S. Dolev, C. Scheideler, Theor. Comput. Sci. (2012) 1.","ieee":"S. Dolev and C. Scheideler, “Editorial for Algorithmic Aspects of Wireless Sensor Networks,” Theor. Comput. Sci., p. 1, 2012."},"type":"journal_article","date_updated":"2022-01-06T06:53:52Z","_id":"1882","doi":"10.1016/j.tcs.2012.07.012","publication":"Theor. Comput. Sci.","department":[{"_id":"79"}],"author":[{"last_name":"Dolev","full_name":"Dolev, Shlomi","first_name":"Shlomi"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2018-03-28T06:44:05Z","status":"public","title":"Editorial for Algorithmic Aspects of Wireless Sensor Networks","user_id":"15504"},{"doi":"10.1007/978-3-642-32820-6_1","_id":"1884","intvolume":" 7484","date_updated":"2022-01-06T06:53:52Z","year":"2012","type":"conference","citation":{"ieee":"B. Monien and C. Scheideler, “Selfish Distributed Optimization,” in Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings, 2012, vol. 7484, pp. 1--2.","short":"B. Monien, C. Scheideler, in: Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings, Springer, 2012, pp. 1--2.","bibtex":"@inproceedings{Monien_Scheideler_2012, series={Lecture Notes in Computer Science}, title={Selfish Distributed Optimization}, volume={7484}, DOI={10.1007/978-3-642-32820-6_1}, booktitle={Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings}, publisher={Springer}, author={Monien, Burkhard and Scheideler, Christian}, year={2012}, pages={1--2}, collection={Lecture Notes in Computer Science} }","mla":"Monien, Burkhard, and Christian Scheideler. “Selfish Distributed Optimization.” Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings, vol. 7484, Springer, 2012, pp. 1--2, doi:10.1007/978-3-642-32820-6_1.","ama":"Monien B, Scheideler C. Selfish Distributed Optimization. In: Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings. Vol 7484. Lecture Notes in Computer Science. Springer; 2012:1--2. doi:10.1007/978-3-642-32820-6_1","apa":"Monien, B., & Scheideler, C. (2012). Selfish Distributed Optimization. In Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings (Vol. 7484, pp. 1--2). Springer. https://doi.org/10.1007/978-3-642-32820-6_1","chicago":"Monien, Burkhard, and Christian Scheideler. “Selfish Distributed Optimization.” In Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings, 7484:1--2. Lecture Notes in Computer Science. Springer, 2012. https://doi.org/10.1007/978-3-642-32820-6_1."},"page":"1--2","series_title":"Lecture Notes in Computer Science","title":"Selfish Distributed Optimization","user_id":"15504","volume":7484,"publication_identifier":{"isbn":["978-3-642-32819-0"]},"status":"public","date_created":"2018-03-28T06:44:57Z","author":[{"last_name":"Monien","first_name":"Burkhard","full_name":"Monien, Burkhard"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"Springer","publication":"Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings","department":[{"_id":"79"}]},{"department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"title":"Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs","date_updated":"2022-01-06T07:02:36Z","doi":"10.1016/j.tcs.2012.07.029","file":[{"creator":"florida","file_id":"1272","file_size":250051,"relation":"main_file","success":1,"date_updated":"2018-03-15T10:16:20Z","content_type":"application/pdf","file_name":"570-Delaunay-Journal.pdf","date_created":"2018-03-15T10:16:20Z","access_level":"closed"}],"publisher":"Elsevier","author":[{"first_name":"Riko","full_name":"Jacob, Riko","last_name":"Jacob"},{"last_name":"Ritscher","full_name":"Ritscher, Stephan","first_name":"Stephan"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"}],"publication":"Theoretical Computer Science","file_date_updated":"2018-03-15T10:16:20Z","has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:43Z","abstract":[{"lang":"eng","text":"This article studies the construction of self-stabilizing topologies for distributed systems. While recent research has focused on chain topologies where nodes need to be linearized with respect to their identiers, we explore a natural and relevant 2-dimensional generalization. In particular, we present a local self-stabilizing algorithm DStab which is based on the concept of \\local Delaunay graphs\" and which forwards temporary edges in greedy fashion reminiscent of compass routing. DStab constructs a Delaunay graph from any initial connected topology and in a distributed manner in time O(n3) in the worst-case; if the initial network contains the Delaunay graph, the convergence time is only O(n) rounds. DStab also ensures that individual node joins and leaves aect a small part of the network only. Such self-stabilizing Delaunay networks have interesting applications and our construction gives insights into the necessary geometric reasoning that is required for higherdimensional linearization problems.Keywords: Distributed Algorithms, Topology Control, Social Networks"}],"user_id":"477","ddc":["040"],"type":"journal_article","citation":{"ieee":"R. Jacob, S. Ritscher, C. Scheideler, and S. Schmid, “Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs,” Theoretical Computer Science, pp. 137–148, 2012.","short":"R. Jacob, S. Ritscher, C. Scheideler, S. Schmid, Theoretical Computer Science (2012) 137–148.","bibtex":"@article{Jacob_Ritscher_Scheideler_Schmid_2012, title={Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs}, DOI={10.1016/j.tcs.2012.07.029}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Jacob, Riko and Ritscher, Stephan and Scheideler, Christian and Schmid, Stefan}, year={2012}, pages={137–148} }","mla":"Jacob, Riko, et al. “Towards Higher-Dimensional Topological Self-Stabilization: A Distributed Algorithm for Delaunay Graphs.” Theoretical Computer Science, Elsevier, 2012, pp. 137–48, doi:10.1016/j.tcs.2012.07.029.","chicago":"Jacob, Riko, Stephan Ritscher, Christian Scheideler, and Stefan Schmid. “Towards Higher-Dimensional Topological Self-Stabilization: A Distributed Algorithm for Delaunay Graphs.” Theoretical Computer Science, 2012, 137–48. https://doi.org/10.1016/j.tcs.2012.07.029.","ama":"Jacob R, Ritscher S, Scheideler C, Schmid S. Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs. Theoretical Computer Science. 2012:137-148. doi:10.1016/j.tcs.2012.07.029","apa":"Jacob, R., Ritscher, S., Scheideler, C., & Schmid, S. (2012). Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs. Theoretical Computer Science, 137–148. https://doi.org/10.1016/j.tcs.2012.07.029"},"year":"2012","page":"137-148","_id":"570"},{"title":"Tiara: A self-stabilizing deterministic skip list and skip graph","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_updated":"2022-01-06T07:02:38Z","doi":"10.1016/j.tcs.2011.12.079","abstract":[{"lang":"eng","text":"We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and topology updates. It is based on a novel sparse 0-1 skip list. We then describe its extension to a ringed structure and to a skip-graph.Key words: Peer-to-peer networks, overlay networks, self-stabilization."}],"ddc":["040"],"user_id":"477","author":[{"first_name":"Thomas","full_name":"Clouser, Thomas","last_name":"Clouser"},{"first_name":"Mikhail","full_name":"Nesterenko, Mikhail","last_name":"Nesterenko"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publisher":"Elsevier","file_date_updated":"2018-03-15T09:09:29Z","publication":"Theoretical Computer Science","file":[{"relation":"main_file","success":1,"date_updated":"2018-03-15T09:09:29Z","content_type":"application/pdf","file_id":"1268","creator":"florida","file_size":315843,"access_level":"closed","file_name":"574-tiara.pdf","date_created":"2018-03-15T09:09:29Z"}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:44Z","_id":"574","citation":{"short":"T. Clouser, M. Nesterenko, C. Scheideler, Theoretical Computer Science (2012) 18–35.","ieee":"T. Clouser, M. Nesterenko, and C. Scheideler, “Tiara: A self-stabilizing deterministic skip list and skip graph,” Theoretical Computer Science, pp. 18–35, 2012.","apa":"Clouser, T., Nesterenko, M., & Scheideler, C. (2012). Tiara: A self-stabilizing deterministic skip list and skip graph. Theoretical Computer Science, 18–35. https://doi.org/10.1016/j.tcs.2011.12.079","ama":"Clouser T, Nesterenko M, Scheideler C. Tiara: A self-stabilizing deterministic skip list and skip graph. Theoretical Computer Science. 2012:18-35. doi:10.1016/j.tcs.2011.12.079","chicago":"Clouser, Thomas, Mikhail Nesterenko, and Christian Scheideler. “Tiara: A Self-Stabilizing Deterministic Skip List and Skip Graph.” Theoretical Computer Science, 2012, 18–35. https://doi.org/10.1016/j.tcs.2011.12.079.","bibtex":"@article{Clouser_Nesterenko_Scheideler_2012, title={Tiara: A self-stabilizing deterministic skip list and skip graph}, DOI={10.1016/j.tcs.2011.12.079}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Clouser, Thomas and Nesterenko, Mikhail and Scheideler, Christian}, year={2012}, pages={18–35} }","mla":"Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List and Skip Graph.” Theoretical Computer Science, Elsevier, 2012, pp. 18–35, doi:10.1016/j.tcs.2011.12.079."},"year":"2012","type":"journal_article","page":"18-35"},{"date_updated":"2022-01-06T07:02:41Z","doi":"10.1145/2229163.2229174","department":[{"_id":"79"},{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"title":"Smoothed analysis of left-to-right maxima with applications","citation":{"ama":"Damerow V, Manthey B, Meyer auf der Heide F, et al. Smoothed analysis of left-to-right maxima with applications. Transactions on Algorithms. 2012;(3):30. doi:10.1145/2229163.2229174","apa":"Damerow, V., Manthey, B., Meyer auf der Heide, F., Räcke, H., Scheideler, C., Sohler, C., & Tantau, T. (2012). Smoothed analysis of left-to-right maxima with applications. Transactions on Algorithms, (3), 30. https://doi.org/10.1145/2229163.2229174","chicago":"Damerow, Valentina, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler, and Till Tantau. “Smoothed Analysis of Left-to-Right Maxima with Applications.” Transactions on Algorithms, no. 3 (2012): 30. https://doi.org/10.1145/2229163.2229174.","bibtex":"@article{Damerow_Manthey_Meyer auf der Heide_Räcke_Scheideler_Sohler_Tantau_2012, title={Smoothed analysis of left-to-right maxima with applications}, DOI={10.1145/2229163.2229174}, number={3}, journal={Transactions on Algorithms}, publisher={ACM}, author={Damerow, Valentina and Manthey, Bodo and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian and Tantau, Till}, year={2012}, pages={30} }","mla":"Damerow, Valentina, et al. “Smoothed Analysis of Left-to-Right Maxima with Applications.” Transactions on Algorithms, no. 3, ACM, 2012, p. 30, doi:10.1145/2229163.2229174.","short":"V. Damerow, B. Manthey, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, T. Tantau, Transactions on Algorithms (2012) 30.","ieee":"V. Damerow et al., “Smoothed analysis of left-to-right maxima with applications,” Transactions on Algorithms, no. 3, p. 30, 2012."},"year":"2012","type":"journal_article","page":"30","_id":"579","issue":"3","file":[{"creator":"florida","file_id":"1266","file_size":329282,"success":1,"relation":"main_file","date_updated":"2018-03-15T09:04:58Z","content_type":"application/pdf","date_created":"2018-03-15T09:04:58Z","file_name":"579-a30-damerow.pdf","access_level":"closed"}],"publisher":"ACM","author":[{"first_name":"Valentina","full_name":"Damerow, Valentina","last_name":"Damerow"},{"first_name":"Bodo","full_name":"Manthey, Bodo","last_name":"Manthey"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Räcke","full_name":"Räcke, Harald","first_name":"Harald"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"},{"last_name":"Tantau","full_name":"Tantau, Till","first_name":"Till"}],"file_date_updated":"2018-03-15T09:04:58Z","publication":"Transactions on Algorithms","status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:45Z","abstract":[{"lang":"eng","text":"A left-to-right maximum in a sequence of n numbers s_1, …, s_n is a number that is strictly larger than all preceding numbers. In this article we present a smoothed analysis of the number of left-to-right maxima in the presence of additive random noise. We show that for every sequence of n numbers s_i ∈ [0,1] that are perturbed by uniform noise from the interval [-ε,ε], the expected number of left-to-right maxima is Θ(&sqrt;n/ε + log n) for ε>1/n. For Gaussian noise with standard deviation σ we obtain a bound of O((log3/2 n)/σ + log n).We apply our results to the analysis of the smoothed height of binary search trees and the smoothed number of comparisons in the quicksort algorithm and prove bounds of Θ(&sqrt;n/ε + log n) and Θ(n/ε+1&sqrt;n/ε + n log n), respectively, for uniform random noise from the interval [-ε,ε]. Our results can also be applied to bound the smoothed number of points on a convex hull of points in the two-dimensional plane and to smoothed motion complexity, a concept we describe in this article. We bound how often one needs to update a data structure storing the smallest axis-aligned box enclosing a set of points moving in d-dimensional space."}],"user_id":"477","ddc":["040"]},{"language":[{"iso":"eng"}],"doi":"10.1109/IPDPS.2012.116","date_updated":"2022-01-06T07:02:42Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"79"},{"_id":"63"}],"title":"Self-Organizing Particle Systems","year":"2012","type":"conference","citation":{"short":"M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–1283.","ieee":"M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, and C. Scheideler, “Self-Organizing Particle Systems,” in Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–1283.","apa":"Drees, M., Hüllmann (married name: Eikel), M., Koutsopoulos, A., & Scheideler, C. (2012). Self-Organizing Particle Systems. In Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 1272–1283). https://doi.org/10.1109/IPDPS.2012.116","ama":"Drees M, Hüllmann (married name: Eikel) M, Koutsopoulos A, Scheideler C. Self-Organizing Particle Systems. In: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS). ; 2012:1272-1283. doi:10.1109/IPDPS.2012.116","chicago":"Drees, Maximilian, Martina Hüllmann (married name: Eikel), Andreas Koutsopoulos, and Christian Scheideler. “Self-Organizing Particle Systems.” In Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 1272–83, 2012. https://doi.org/10.1109/IPDPS.2012.116.","mla":"Drees, Maximilian, et al. “Self-Organizing Particle Systems.” Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–83, doi:10.1109/IPDPS.2012.116.","bibtex":"@inproceedings{Drees_Hüllmann (married name: Eikel)_Koutsopoulos_Scheideler_2012, title={Self-Organizing Particle Systems}, DOI={10.1109/IPDPS.2012.116}, booktitle={Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Drees, Maximilian and Hüllmann (married name: Eikel), Martina and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012}, pages={1272–1283} }"},"page":"1272-1283","_id":"581","status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:45Z","file":[{"relation":"main_file","success":1,"date_updated":"2018-03-15T08:39:33Z","content_type":"application/pdf","creator":"florida","file_id":"1263","file_size":373131,"access_level":"closed","date_created":"2018-03-15T08:39:33Z","file_name":"581-IPDPS2012-Scheideler_Huellmann.pdf"}],"author":[{"last_name":"Drees","first_name":"Maximilian","full_name":"Drees, Maximilian"},{"last_name":"Hüllmann (married name: Eikel)","first_name":"Martina","full_name":"Hüllmann (married name: Eikel), Martina"},{"first_name":"Andreas","full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publication":"Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)","file_date_updated":"2018-03-15T08:39:33Z","user_id":"14955","ddc":["040"],"abstract":[{"lang":"eng","text":"Nanoparticles are getting more and more in the focus of the scientic community since the potential for the development of very small particles interacting with each other and completing medical and other tasks is getting bigger year by year. In this work we introduce a distributed local algorithm for arranging a set of nanoparticles on the discrete plane into specic geometric shapes, for instance a rectangle. The concept of a particle we use can be seen as a simple mobile robot with the following restrictions: it can only view the state of robots it is physically connected to, is anonymous, has only a constant size memory, can only move by using other particles as an anchor point on which it pulls itself alongside, and it operates in Look-Compute-Move cycles. The main result of this work is the presentation of a random distributed local algorithm which transforms any given connected set of particles into a particular geometric shape. As an example we provide a version of this algorithm for forming a rectangle with an arbitrary predened aspect ratio. To the best of our knowledge this is the rst work that considers arrangement problems for these types of robots."}]},{"author":[{"first_name":"Andrea W.","full_name":"Richa, Andrea W.","last_name":"Richa"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"},{"last_name":"Zhang","full_name":"Zhang, Jin ","first_name":"Jin "}],"publication":"Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)","file_date_updated":"2018-03-15T06:45:25Z","department":[{"_id":"79"}],"file":[{"file_size":210382,"creator":"florida","file_id":"1241","content_type":"application/pdf","date_updated":"2018-03-15T06:45:25Z","relation":"main_file","success":1,"date_created":"2018-03-15T06:45:25Z","file_name":"623-PODC-2012_01.pdf","access_level":"closed"}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:53Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"abstract":[{"text":"This paper initiates the formal study of a fundamental problem: How to efficiently allocate a shared communication medium among a set of K co-existing networks in the presence of arbitrary external interference? While most literature on medium access focuses on how to share a medium among nodes, these approaches are often either not directly applicable to co-existing networks as they would violate the independence requirement, or they yield a low throughput if applied to multiple networks. We present the randomized medium access (MAC) protocol COMAC which guarantees that a given communication channel is shared fairly among competing and independent networks, and that the available bandwidth is used efficiently. These performance guarantees hold in the presence of arbitrary external interference or even under adversarial jamming. Concretely, we show that the co-existing networks can use a Ω(ε2 min{ε, 1/poly(K)})-fraction of the non-jammed time steps for successful message transmissions, where ε is the (arbitrarily distributed) fraction of time which is not jammed.","lang":"eng"}],"title":"Competitive and fair throughput for co-existing networks under adversarial interference","ddc":["040"],"user_id":"15504","year":"2012","citation":{"short":"A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300.","ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and fair throughput for co-existing networks under adversarial interference,” in Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300.","ama":"Richa AW, Scheideler C, Schmid S, Zhang J. Competitive and fair throughput for co-existing networks under adversarial interference. In: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC). ; 2012:291-300. doi:10.1145/2332432.2332488","apa":"Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2012). Competitive and fair throughput for co-existing networks under adversarial interference. In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC) (pp. 291–300). https://doi.org/10.1145/2332432.2332488","chicago":"Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin Zhang. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 291–300, 2012. https://doi.org/10.1145/2332432.2332488.","mla":"Richa, Andrea W., et al. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300, doi:10.1145/2332432.2332488.","bibtex":"@inproceedings{Richa_Scheideler_Schmid_Zhang_2012, title={Competitive and fair throughput for co-existing networks under adversarial interference}, DOI={10.1145/2332432.2332488}, booktitle={Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)}, author={Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin }, year={2012}, pages={291–300} }"},"type":"conference","page":"291-300","_id":"623","date_updated":"2022-01-06T07:02:58Z","doi":"10.1145/2332432.2332488"},{"title":"Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}],"doi":"10.1007/978-3-642-33651-5_47","date_updated":"2022-01-06T07:02:58Z","series_title":"LNCS","ddc":["040"],"user_id":"15504","abstract":[{"lang":"eng","text":"This paper initiates the study of self-adjusting distributed data structures for networks. In particular, we present SplayNets: a binary search tree based network that is self-adjusting to routing request.We derive entropy bounds on the amortized routing cost and show that our splaying algorithm has some interesting properties."}],"date_created":"2017-10-17T12:42:53Z","status":"public","has_accepted_license":"1","publication":"Proceedings of the 26th International Symposium on Distributed Computing (DISC)","file_date_updated":"2018-03-15T06:44:09Z","author":[{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"last_name":"Avin","first_name":"Chen","full_name":"Avin, Chen"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"first_name":"Bernhard","full_name":"Häupler, Bernhard","last_name":"Häupler"},{"full_name":"Lotker, Zvi","first_name":"Zvi","last_name":"Lotker"}],"file":[{"file_size":717284,"creator":"florida","file_id":"1240","date_updated":"2018-03-15T06:44:09Z","content_type":"application/pdf","success":1,"relation":"main_file","file_name":"625-disc12adjBAshort.pdf","date_created":"2018-03-15T06:44:09Z","access_level":"closed"}],"_id":"625","page":"439-440","year":"2012","type":"conference","citation":{"ama":"Schmid S, Avin C, Scheideler C, Häupler B, Lotker Z. Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In: Proceedings of the 26th International Symposium on Distributed Computing (DISC). LNCS. ; 2012:439-440. doi:10.1007/978-3-642-33651-5_47","apa":"Schmid, S., Avin, C., Scheideler, C., Häupler, B., & Lotker, Z. (2012). Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In Proceedings of the 26th International Symposium on Distributed Computing (DISC) (pp. 439–440). https://doi.org/10.1007/978-3-642-33651-5_47","chicago":"Schmid, Stefan, Chen Avin, Christian Scheideler, Bernhard Häupler, and Zvi Lotker. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” In Proceedings of the 26th International Symposium on Distributed Computing (DISC), 439–40. LNCS, 2012. https://doi.org/10.1007/978-3-642-33651-5_47.","bibtex":"@inproceedings{Schmid_Avin_Scheideler_Häupler_Lotker_2012, series={LNCS}, title={Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures}, DOI={10.1007/978-3-642-33651-5_47}, booktitle={Proceedings of the 26th International Symposium on Distributed Computing (DISC)}, author={Schmid, Stefan and Avin, Chen and Scheideler, Christian and Häupler, Bernhard and Lotker, Zvi}, year={2012}, pages={439–440}, collection={LNCS} }","mla":"Schmid, Stefan, et al. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–40, doi:10.1007/978-3-642-33651-5_47.","short":"S. Schmid, C. Avin, C. Scheideler, B. Häupler, Z. Lotker, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–440.","ieee":"S. Schmid, C. Avin, C. Scheideler, B. Häupler, and Z. Lotker, “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures,” in Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–440."}}]