[{"oa":"1","urn":"21338","date_updated":"2022-01-06T06:54:55Z","_id":"2133","page":"333--342","year":"2003","type":"conference","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.","apa":"Kothapalli, K., & Scheideler, C. (2003). Information gathering in adversarial systems: lines and cycles. In SPAA (pp. 333--342). ACM.","ama":"Kothapalli K, Scheideler C. Information gathering in adversarial systems: lines and cycles. In: SPAA. ACM; 2003:333--342.","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."},"user_id":"15504","title":"Information gathering in adversarial systems: lines and cycles","ddc":["040"],"date_created":"2018-04-03T05:42:48Z","status":"public","has_accepted_license":"1","file":[{"content_type":"application/pdf","date_updated":"2018-04-12T09:15:24Z","relation":"main_file","file_size":121448,"creator":"florida","file_id":"2309","access_level":"open_access","file_name":"KS-SPAA-03.pdf","date_created":"2018-04-12T09:13:43Z"}],"publication":"SPAA","file_date_updated":"2018-04-12T09:15:24Z","department":[{"_id":"79"}],"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"},{"title":"Simple On-Line Algorithms for the Maximum Disjoint Paths Problem","user_id":"15504","status":"public","date_created":"2018-04-03T05:30:23Z","author":[{"last_name":"Kolman","full_name":"Kolman, Petr","first_name":"Petr"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publication":"Algorithmica","department":[{"_id":"79"}],"doi":"10.1007/s00453-004-1086-1","issue":"3","_id":"2119","date_updated":"2022-01-06T06:54:49Z","year":"2004","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.","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","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"},"type":"journal_article","page":"209--233"},{"user_id":"15504","ddc":["040"],"file":[{"creator":"florida","file_id":"2312","file_size":145383,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:20:16Z","date_created":"2018-04-12T09:20:16Z","file_name":"ICALP-04.pdf","access_level":"open_access"}],"file_date_updated":"2018-04-12T09:20:16Z","publication":"ICALP","author":[{"first_name":"Baruch","full_name":"Awerbuch, Baruch","last_name":"Awerbuch"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"date_created":"2018-04-03T05:31:04Z","status":"public","has_accepted_license":"1","volume":3142,"urn":"21200","_id":"2120","intvolume":" 3142","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.","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.","apa":"Awerbuch, B., & Scheideler, C. (2004). Group Spreading: A Protocol for Provably Secure Distributed Name Service. In ICALP (Vol. 3142, pp. 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","title":"Group Spreading: A Protocol for Provably Secure Distributed Name Service","department":[{"_id":"79"}],"date_updated":"2022-01-06T06:54:49Z","oa":"1","series_title":"Lecture Notes in Computer Science"},{"type":"conference","citation":{"mla":"Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational Grids.” 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} }","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.","chicago":"Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational Grids.” In IPDPS, 2004.","ieee":"C. Riley and C. Scheideler, “A Distributed Hash Table for Computational Grids,” in IPDPS, 2004.","short":"C. Riley, C. Scheideler, in: IPDPS, 2004."},"year":"2004","urn":"21212","date_updated":"2022-01-06T06:54:50Z","_id":"2121","oa":"1","file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:50:26Z","file_id":"2316","creator":"florida","file_size":91542,"access_level":"open_access","date_created":"2018-04-12T09:50:26Z","file_name":"IPDPS-04.pdf"}],"file_date_updated":"2018-04-12T09:50:26Z","department":[{"_id":"79"}],"publication":"IPDPS","author":[{"first_name":"Chris","full_name":"Riley, Chris","last_name":"Riley"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2018-04-03T05:31:59Z","status":"public","has_accepted_license":"1","user_id":"15504","title":"A Distributed Hash Table for Computational Grids","ddc":["040"]},{"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","type":"conference","citation":{"ieee":"B. Awerbuch and C. Scheideler, “Robust Distributed Name Service,” in IPTPS, 2004, vol. 3279, pp. 237--249.","short":"B. Awerbuch, C. Scheideler, in: IPTPS, 2004, pp. 237--249.","mla":"Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.” IPTPS, vol. 3279, 2004, pp. 237--249.","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} }","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.” In IPTPS, 3279:237--249. Lecture Notes in Computer Science, 2004.","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)."},"page":"237--249","intvolume":" 3279","_id":"2122","urn":"21229","author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file_date_updated":"2018-04-12T11:39:38Z","publication":"IPTPS","file":[{"access_level":"open_access","file_name":"IPTPS-04.pdf","date_created":"2018-04-12T11:39:38Z","relation":"main_file","date_updated":"2018-04-12T11:39:38Z","content_type":"application/pdf","file_id":"2318","creator":"florida","file_size":136987}],"volume":3279,"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:32:33Z","ddc":["040"],"user_id":"15504"},{"year":"2004","type":"conference","citation":{"ama":"Ateniese G, Riley C, Scheideler C. Survivable Monitoring in Dynamic Networks. In: IWIA. ; 2004:33--47.","apa":"Ateniese, G., Riley, C., & Scheideler, C. (2004). Survivable Monitoring in Dynamic Networks. In IWIA (pp. 33--47).","chicago":"Ateniese, Giuseppe, Chris Riley, and Christian Scheideler. “Survivable Monitoring in Dynamic Networks.” In IWIA, 33--47, 2004.","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} }","mla":"Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.” IWIA, 2004, pp. 33--47.","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."},"page":"33--47","oa":"1","_id":"2123","date_updated":"2022-01-06T06:54:50Z","urn":"21238","has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:33:37Z","author":[{"last_name":"Ateniese","first_name":"Giuseppe","full_name":"Ateniese, Giuseppe"},{"last_name":"Riley","first_name":"Chris","full_name":"Riley, Chris"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"department":[{"_id":"79"}],"publication":"IWIA","file_date_updated":"2018-04-12T11:38:22Z","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","content_type":"application/pdf","date_updated":"2018-04-12T11:38:22Z"}],"ddc":["040"],"title":"Survivable Monitoring in Dynamic Networks","user_id":"15504"},{"page":"318--327","citation":{"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.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments.” In SODA, 318--327, 2004.","apa":"Awerbuch, B., & Scheideler, C. (2004). The hyperring: a low-congestion deterministic data structure for distributed environments. In SODA (pp. 318--327).","ama":"Awerbuch B, Scheideler C. The hyperring: a low-congestion deterministic data structure for distributed environments. In: SODA. ; 2004: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} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments.” SODA, 2004, pp. 318--327."},"year":"2004","type":"conference","oa":"1","urn":"21247","date_updated":"2022-01-06T06:54:51Z","_id":"2124","date_created":"2018-04-03T05:34:17Z","status":"public","has_accepted_license":"1","file":[{"file_name":"SODA-04.pdf","date_created":"2018-04-13T08:36:08Z","access_level":"open_access","file_size":193831,"creator":"florida","file_id":"2323","date_updated":"2018-04-13T08:36:08Z","content_type":"application/pdf","relation":"main_file"}],"department":[{"_id":"79"}],"publication":"SODA","file_date_updated":"2018-04-13T08:36:08Z","author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"user_id":"15504","ddc":["040"],"title":"The hyperring: a low-congestion deterministic data structure for distributed environments"},{"date_created":"2018-04-03T05:34:56Z","has_accepted_license":"1","status":"public","publication":"SPAA","department":[{"_id":"79"}],"file_date_updated":"2018-04-12T09:41:38Z","author":[{"last_name":"Awerbuch","full_name":"Awerbuch, Baruch","first_name":"Baruch"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"file_id":"2315","creator":"florida","file_size":170429,"relation":"main_file","date_updated":"2018-04-12T09:41:38Z","content_type":"application/pdf","date_created":"2018-04-12T09:41:38Z","file_name":"AS-SPAA-04.pdf","access_level":"open_access"}],"ddc":["040"],"title":"Consistent and compact data management in distributed storage systems","user_id":"15504","page":"44--53","year":"2004","citation":{"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.","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).","mla":"Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data Management in Distributed Storage Systems.” SPAA, 2004, 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} }"},"type":"conference","oa":"1","urn":"21256","date_updated":"2022-01-06T06:54:51Z","_id":"2125"},{"page":"170--179","citation":{"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.","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).","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.","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."},"year":"2004","type":"conference","oa":"1","urn":"21266","_id":"2126","date_updated":"2022-01-06T06:54:52Z","date_created":"2018-04-03T05:35:31Z","has_accepted_license":"1","status":"public","file":[{"access_level":"open_access","file_name":"BKRST-SPAA-04.pdf","date_created":"2018-04-12T09:40:12Z","content_type":"application/pdf","date_updated":"2018-04-12T09:40:42Z","relation":"main_file","file_size":118175,"creator":"florida","file_id":"2314"}],"publication":"SPAA","department":[{"_id":"79"}],"file_date_updated":"2018-04-12T09:40:42Z","author":[{"last_name":"Bhargava","first_name":"Ankur","full_name":"Bhargava, Ankur"},{"last_name":"Kothapalli","full_name":"Kothapalli, Kishore","first_name":"Kishore"},{"last_name":"Riley","first_name":"Chris","full_name":"Riley, Chris"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Thober","first_name":"Mark","full_name":"Thober, Mark"}],"user_id":"15504","title":"Pagoda: a dynamic overlay network for routing, data management, and multicasting","ddc":["040"]},{"oa":"1","urn":"21276","date_updated":"2022-01-06T06:54:52Z","_id":"2127","page":"286--293","citation":{"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} }","mla":"Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” SPAA, ACM, 2004, pp. 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.","ama":"Bagchi A, Bhargava A, Chaudhary A, Eppstein D, Scheideler C. The effect of faults on network expansion. In: SPAA. ACM; 2004:286--293.","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.","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."},"type":"conference","year":"2004","title":"The effect of faults on network expansion","ddc":["040"],"user_id":"15504","date_created":"2018-04-03T05:36:11Z","status":"public","has_accepted_license":"1","publication":"SPAA","department":[{"_id":"79"}],"file_date_updated":"2018-04-12T09:21:24Z","author":[{"first_name":"Amitabha","full_name":"Bagchi, Amitabha","last_name":"Bagchi"},{"last_name":"Bhargava","first_name":"Ankur","full_name":"Bhargava, Ankur"},{"last_name":"Chaudhary","first_name":"Amitabh","full_name":"Chaudhary, Amitabh"},{"first_name":"David","full_name":"Eppstein, David","last_name":"Eppstein"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publisher":"ACM","file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:21:24Z","file_id":"2313","creator":"florida","file_size":197503,"access_level":"open_access","file_name":"BBCES-SPAA-04.pdf","date_created":"2018-04-12T09:21:24Z"}]},{"title":"Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment","ddc":["040"],"user_id":"15504","has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:25:16Z","author":[{"first_name":"Miroslaw","full_name":"Korzeniowski, Miroslaw","last_name":"Korzeniowski"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"department":[{"_id":"79"}],"publication":"ISPAN","file_date_updated":"2018-04-13T08:45:41Z","file":[{"date_updated":"2018-04-13T08:45:41Z","content_type":"application/pdf","relation":"main_file","file_size":110389,"creator":"florida","file_id":"2325","access_level":"open_access","date_created":"2018-04-13T08:45:41Z","file_name":"KS-ISPAN-05-TransData.pdf"}],"oa":"1","_id":"2114","date_updated":"2022-01-06T06:54:47Z","urn":"21146","type":"conference","year":"2005","citation":{"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.","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).","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.","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} }","short":"M. Korzeniowski, C. Scheideler, in: ISPAN, 2005, pp. 182--187.","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."},"page":"182--187"},{"page":"188--193","year":"2005","type":"conference","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.","apa":"Kothapalli, K., & Scheideler, C. (2005). Supervised Peer-to-Peer Systems. In ISPAN (pp. 188--193).","ama":"Kothapalli K, Scheideler C. Supervised Peer-to-Peer Systems. In: ISPAN. ; 2005: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} }"},"oa":"1","urn":"21156","_id":"2115","date_updated":"2022-01-06T06:54:47Z","date_created":"2018-04-03T05:26:10Z","status":"public","has_accepted_license":"1","publication":"ISPAN","department":[{"_id":"79"}],"file_date_updated":"2018-04-13T08:50:40Z","author":[{"last_name":"Kothapalli","first_name":"Kishore","full_name":"Kothapalli, Kishore"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file":[{"creator":"florida","file_id":"2326","file_size":69350,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-13T08:50:40Z","file_name":"KS-ISPAN-05-Supervised.pdf","date_created":"2018-04-13T08:50:40Z","access_level":"open_access"}],"title":"Supervised Peer-to-Peer Systems","ddc":["040"],"user_id":"15504"},{"date_created":"2018-04-03T05:26:50Z","has_accepted_license":"1","status":"public","file":[{"date_created":"2018-04-13T08:55:51Z","file_name":"KORS-ISPAN-05.pdf","access_level":"open_access","file_size":135267,"creator":"florida","file_id":"2327","date_updated":"2018-04-13T08:55:51Z","content_type":"application/pdf","relation":"main_file"}],"department":[{"_id":"79"}],"publication":"ISPAN","file_date_updated":"2018-04-13T08:55:51Z","author":[{"full_name":"Onus, Melih","first_name":"Melih","last_name":"Onus"},{"last_name":"W. Richa","full_name":"W. Richa, Andrea","first_name":"Andrea"},{"full_name":"Kothapalli, Kishore","first_name":"Kishore","last_name":"Kothapalli"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"user_id":"15504","ddc":["040"],"title":"Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks","page":"346--351","type":"conference","year":"2005","citation":{"short":"M. Onus, A. W. Richa, K. Kothapalli, C. Scheideler, in: ISPAN, 2005, pp. 346--351.","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.","ama":"Onus M, W. Richa A, Kothapalli K, Scheideler C. Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks. In: ISPAN. ; 2005: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).","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.","mla":"Onus, Melih, et al. “Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks.” ISPAN, 2005, pp. 346--351.","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} }"},"oa":"1","urn":"21165","date_updated":"2022-01-06T06:54:48Z","_id":"2116"},{"oa":"1","urn":"21175","date_updated":"2022-01-06T06:54:48Z","_id":"2117","page":"116--125","type":"conference","year":"2005","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.","ama":"Kothapalli K, Scheideler C, Onus M, W. Richa A. Constant density spanners for wireless ad-hoc networks. In: SPAA. ; 2005:116--125.","apa":"Kothapalli, K., Scheideler, C., Onus, M., & W. Richa, A. (2005). Constant density spanners for wireless ad-hoc networks. In SPAA (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.","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} }","mla":"Kothapalli, Kishore, et al. “Constant Density Spanners for Wireless Ad-Hoc Networks.” SPAA, 2005, pp. 116--125."},"user_id":"15504","ddc":["040"],"title":"Constant density spanners for wireless ad-hoc networks","date_created":"2018-04-03T05:28:33Z","has_accepted_license":"1","status":"public","file":[{"content_type":"application/pdf","date_updated":"2018-04-13T08:56:49Z","relation":"main_file","file_size":118644,"file_id":"2328","creator":"florida","access_level":"open_access","date_created":"2018-04-13T08:56:49Z","file_name":"SPAA-05.pdf"}],"department":[{"_id":"79"}],"publication":"SPAA","file_date_updated":"2018-04-13T08:56:49Z","author":[{"last_name":"Kothapalli","first_name":"Kishore","full_name":"Kothapalli, Kishore"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Onus","full_name":"Onus, Melih","first_name":"Melih"},{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, Andrea"}]},{"publication":"STOC","department":[{"_id":"79"}],"file_date_updated":"2018-04-13T08:58:22Z","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"content_type":"application/pdf","date_updated":"2018-04-13T08:58:22Z","relation":"main_file","file_size":134460,"file_id":"2330","creator":"florida","access_level":"open_access","date_created":"2018-04-13T08:58:22Z","file_name":"STOC-05.pdf"}],"date_created":"2018-04-03T05:29:27Z","has_accepted_license":"1","status":"public","title":"How to spread adversarial nodes?: rotate!","ddc":["040"],"user_id":"15504","page":"704--713","citation":{"short":"C. Scheideler, in: STOC, 2005, pp. 704--713.","ieee":"C. Scheideler, “How to spread adversarial nodes?: rotate!,” in STOC, 2005, pp. 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.","bibtex":"@inproceedings{Scheideler_2005, title={How to spread adversarial nodes?: rotate!}, booktitle={STOC}, author={Scheideler, Christian}, year={2005}, pages={704--713} }","mla":"Scheideler, Christian. “How to Spread Adversarial Nodes?: Rotate!” STOC, 2005, pp. 704--713."},"type":"conference","year":"2005","urn":"21185","date_updated":"2022-01-06T06:54:49Z","_id":"2118","oa":"1"},{"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","file":[{"access_level":"open_access","file_name":"IMA-05.pdf","date_created":"2018-04-13T08:57:39Z","relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-13T08:57:39Z","file_id":"2329","creator":"florida","file_size":295333}],"has_accepted_license":"1","status":"public","date_created":"2018-04-05T07:05:16Z","title":"Overlay networks for wireless ad hoc networks","ddc":["040"],"user_id":"15504","year":"2005","citation":{"short":"C. Scheideler, in: IMA Workshop on Wireless Communications, 2005.","ieee":"C. Scheideler, “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.","ama":"Scheideler C. Overlay networks for wireless ad hoc networks. In: IMA Workshop on Wireless Communications. ; 2005.","chicago":"Scheideler, Christian. “Overlay Networks for Wireless Ad Hoc Networks.” In IMA Workshop on Wireless Communications, 2005.","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} }"},"type":"conference","_id":"2212","date_updated":"2022-01-06T06:55:26Z","urn":"22129","oa":"1"},{"doi":"10.1016/j.jalgor.2004.07.006","issue":"1","date_updated":"2022-01-06T06:54:25Z","_id":"2029","intvolume":" 61","page":"20--44","year":"2006","type":"journal_article","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} }","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","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","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."},"title":"Improved bounds for the unsplittable flow problem","user_id":"15504","volume":61,"date_created":"2018-03-29T12:01:37Z","status":"public","department":[{"_id":"79"}],"publication":"J. Algorithms","author":[{"last_name":"Kolman","full_name":"Kolman, Petr","first_name":"Petr"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}]},{"year":"2006","type":"journal_article","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","doi":"10.1109/TMC.2006.138","issue":"9","date_updated":"2022-01-06T06:54:45Z","_id":"2110","status":"public","date_created":"2018-04-03T05:21:30Z","author":[{"full_name":"Ateniese, Giuseppe","first_name":"Giuseppe","last_name":"Ateniese"},{"last_name":"Riley","first_name":"Chris","full_name":"Riley, Chris"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"department":[{"_id":"79"}],"publication":"IEEE Trans. Mob. Comput.","title":"Survivable Monitoring in Dynamic Networks","user_id":"15504"},{"ddc":["040"],"title":"Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds","user_id":"15504","has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:22:43Z","author":[{"last_name":"Kothapalli","first_name":"Kishore","full_name":"Kothapalli, Kishore"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Melih","full_name":"Onus, Melih","last_name":"Onus"},{"full_name":"Schindelhauer, Christian","first_name":"Christian","last_name":"Schindelhauer"}],"publication":"IPDPS","file_date_updated":"2018-04-13T09:57:03Z","department":[{"_id":"79"}],"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"}],"oa":"1","date_updated":"2022-01-06T06:54:46Z","_id":"2111","urn":"21110","citation":{"ama":"Kothapalli K, Scheideler C, Onus M, Schindelhauer C. 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.","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.","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.","short":"K. Kothapalli, C. Scheideler, M. Onus, C. Schindelhauer, 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."},"year":"2006","type":"conference"},{"date_created":"2018-04-03T05:23:39Z","status":"public","has_accepted_license":"1","file":[{"date_created":"2018-04-13T09:57:51Z","file_name":"OPODIS06.pdf","access_level":"open_access","creator":"florida","file_id":"2335","file_size":198976,"relation":"main_file","date_updated":"2018-04-13T09:57:51Z","content_type":"application/pdf"}],"file_date_updated":"2018-04-13T09:57:51Z","publication":"OPODIS","department":[{"_id":"79"}],"author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"user_id":"15504","ddc":["040"],"title":"Robust Random Number Generation for Peer-to-Peer Systems","page":"275--289","year":"2006","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.","ama":"Awerbuch B, Scheideler C. Robust Random Number Generation for Peer-to-Peer Systems. In: OPODIS. Lecture Notes in Computer Science. ; 2006:275--289.","apa":"Awerbuch, B., & Scheideler, C. (2006). Robust Random Number Generation for Peer-to-Peer Systems. In OPODIS (pp. 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."},"series_title":"Lecture Notes in Computer Science","oa":"1","urn":"21128","date_updated":"2022-01-06T06:54:46Z","_id":"2112"},{"type":"conference","citation":{"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} }","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.” In SPAA, 318--327, 2006.","apa":"Awerbuch, B., & Scheideler, C. (2006). Towards a scalable and robust DHT. In SPAA (pp. 318--327).","ama":"Awerbuch B, Scheideler C. Towards a scalable and robust DHT. In: SPAA. ; 2006:318--327.","ieee":"B. Awerbuch and C. Scheideler, “Towards a scalable and robust DHT,” in SPAA, 2006, pp. 318--327.","short":"B. Awerbuch, C. Scheideler, in: SPAA, 2006, pp. 318--327."},"year":"2006","page":"318--327","_id":"2113","date_updated":"2022-01-06T06:54:46Z","urn":"21137","oa":"1","author":[{"first_name":"Baruch","full_name":"Awerbuch, Baruch","last_name":"Awerbuch"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"SPAA","department":[{"_id":"79"}],"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,"file_id":"2337","creator":"florida","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","title":"Towards a scalable and robust DHT","ddc":["040"],"user_id":"15504"},{"author":[{"last_name":"Bagchi","first_name":"Amitabha","full_name":"Bagchi, Amitabha"},{"first_name":"Ankur","full_name":"Bhargava, Ankur","last_name":"Bhargava"},{"last_name":"Chaudhary","full_name":"Chaudhary, Amitabh","first_name":"Amitabh"},{"full_name":"Eppstein, David","first_name":"David","last_name":"Eppstein"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"department":[{"_id":"79"}],"publication":"Theory Comput. Syst.","status":"public","date_created":"2018-03-29T12:32:54Z","user_id":"15504","title":"The Effect of Faults on Network Expansion","type":"journal_article","year":"2006","citation":{"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} }","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.","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.","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."},"page":"903--928","date_updated":"2022-01-06T06:54:27Z","_id":"2043","issue":"6","doi":"10.1007/s00224-006-1349-0"},{"citation":{"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.","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.","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.","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} }","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."},"type":"conference","year":"2006","oa":"1","date_updated":"2022-01-06T06:55:27Z","_id":"2213","urn":"22137","status":"public","has_accepted_license":"1","date_created":"2018-04-05T07:06:44Z","author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"6th International HNI Symposium on New Trends in Parallel and Distributed Computing","department":[{"_id":"79"}],"file_date_updated":"2018-04-13T09:59:14Z","file":[{"file_name":"HNI-Symposium-06.pdf","date_created":"2018-04-13T09:59:14Z","access_level":"open_access","file_size":85116,"file_id":"2336","creator":"florida","date_updated":"2018-04-13T09:59:14Z","content_type":"application/pdf","relation":"main_file"}],"title":"Towards a paradigm for robust distributed algorithms and data structures","ddc":["040"],"user_id":"15504"},{"user_id":"15504","title":"Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks","department":[{"_id":"79"}],"publication":"SIAM J. Discrete Math.","author":[{"first_name":"Amitabha","full_name":"Bagchi, Amitabha","last_name":"Bagchi"},{"last_name":"Chaudhary","full_name":"Chaudhary, Amitabh","first_name":"Amitabh"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Kolman","full_name":"Kolman, Petr","first_name":"Petr"}],"date_created":"2018-03-29T11:50:23Z","status":"public","date_updated":"2022-01-06T06:54:20Z","_id":"2017","issue":"1","doi":"10.1137/S0895480102419743","page":"141--157","citation":{"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.","short":"A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, SIAM J. Discrete Math. (2007) 141--157.","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} }","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.","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.","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","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"},"year":"2007","type":"journal_article"},{"department":[{"_id":"79"}],"publication":"Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007","author":[{"last_name":"Onus","full_name":"Onus, Melih","first_name":"Melih"},{"last_name":"W. Richa","full_name":"W. Richa, Andrea","first_name":"Andrea"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publication_identifier":{"isbn":["978-1-61197-287-0"]},"date_created":"2018-03-29T11:54:37Z","status":"public","title":"Linearization: Locally Self-Stabilizing Sorting in Graphs","user_id":"15504","year":"2007","type":"conference","citation":{"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.","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.","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} }","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.","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","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","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."},"date_updated":"2022-01-06T06:54:23Z","_id":"2020","doi":"10.1137/1.9781611972870.10"},{"type":"conference","year":"2007","citation":{"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.","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} }","short":"B. Awerbuch, C. Scheideler, in: 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.","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."},"oa":"1","urn":"20228","date_updated":"2022-01-06T06:54:23Z","_id":"2022","date_created":"2018-03-29T11:55:52Z","has_accepted_license":"1","status":"public","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":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file":[{"access_level":"open_access","date_created":"2018-04-13T10:00:55Z","file_name":"IPTPS07.pdf","relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-13T10:00:55Z","creator":"florida","file_id":"2338","file_size":191943}],"title":"Towards Scalable and Robust Overlay Networks","ddc":["040"],"user_id":"15504"},{"publication_identifier":{"isbn":["978-1-59593-616-5"]},"department":[{"_id":"79"}],"title":"A denial-of-service resistant DHT","oa":"1","doi":"10.1145/1281100.1281178","date_updated":"2022-01-06T06:54:24Z","has_accepted_license":"1","status":"public","date_created":"2018-03-29T11:56:35Z","file":[{"relation":"main_file","date_updated":"2018-04-13T10:02:18Z","content_type":"application/pdf","creator":"florida","file_id":"2340","file_size":193097,"access_level":"open_access","file_name":"DISC-07.pdf","date_created":"2018-04-13T10:02:18Z"}],"author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publisher":"ACM","publication":"Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007","file_date_updated":"2018-04-13T10:02:18Z","user_id":"15504","ddc":["040"],"year":"2007","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.","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.","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","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"},"type":"conference","page":"370--371","_id":"2023","urn":"20237"},{"title":"A Denial-of-Service Resistant DHT","user_id":"15504","volume":4731,"publication_identifier":{"isbn":["978-3-540-75141-0"]},"status":"public","date_created":"2018-03-29T11:57:42Z","author":[{"first_name":"Baruch","full_name":"Awerbuch, Baruch","last_name":"Awerbuch"},{"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"}],"doi":"10.1007/978-3-540-75142-7_6","_id":"2024","date_updated":"2022-01-06T06:54:24Z","intvolume":" 4731","citation":{"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.","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","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","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.","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."},"year":"2007","type":"conference","page":"33--47","series_title":"Lecture Notes in Computer Science"},{"publication":"Handbook of Approximation Algorithms and Metaheuristics.","department":[{"_id":"79"}],"author":[{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, Andrea"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2018-03-29T12:00:39Z","status":"public","publication_identifier":{"isbn":["978-1-58488-550-4"]},"user_id":"15504","title":"Overlay Networks for Peer-to-Peer Networks","year":"2007","citation":{"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} }","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.","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","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","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.","ieee":"A. W. Richa and C. Scheideler, “Overlay Networks for Peer-to-Peer Networks,” in Handbook of Approximation Algorithms and Metaheuristics., 2007.","short":"A. W. Richa, C. Scheideler, in: Handbook of Approximation Algorithms and Metaheuristics., 2007."},"type":"book_chapter","_id":"2028","date_updated":"2022-01-06T06:54:25Z","doi":"10.1201/9781420010749.ch72"},{"urn":"22147","date_updated":"2022-01-06T06:55:27Z","_id":"2214","oa":"1","year":"2007","type":"conference","citation":{"mla":"Brinkmann, André, et al. “Dynamic and Redundant Data Placement.” 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} }","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.","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."},"language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}],"ddc":["040"],"title":"Dynamic and redundant data placement","user_id":"15415","publication":"IEEE International Conference on Distributed Computing Systems (ICDCS)","department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-13T10:01:42Z","author":[{"last_name":"Brinkmann","first_name":"André","full_name":"Brinkmann, André"},{"last_name":"Effert","first_name":"Sascha","full_name":"Effert, Sascha"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"file_size":164121,"creator":"florida","file_id":"2339","content_type":"application/pdf","date_updated":"2018-04-13T10:01:42Z","relation":"main_file","date_created":"2018-04-13T10:01:42Z","file_name":"ICDCS07.pdf","access_level":"open_access"}],"date_created":"2018-04-05T07:08:35Z","status":"public","has_accepted_license":"1"},{"type":"journal_article","year":"2007","citation":{"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","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)."},"doi":"10.1145/1273445.1273449","date_updated":"2022-01-06T06:55:25Z","_id":"2209","status":"public","date_created":"2018-04-05T06:08:43Z","author":[{"last_name":"Aggarwal","first_name":"Vinay","full_name":"Aggarwal, Vinay"},{"last_name":"Feldmann","full_name":"Feldmann, Anja","first_name":"Anja"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"department":[{"_id":"79"}],"publication":"ACM Computer Commucation Review","user_id":"15504","title":"Can ISPs and P2P users cooperate for improved performance?"},{"_id":"1937","date_updated":"2022-01-06T06:54:03Z","page":"130--152","year":"2008","citation":{"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} }","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.","ieee":"C. Scheideler, “Algorithms for Overlay Networks,” Bulletin of the EATCS, pp. 130--152, 2008.","short":"C. Scheideler, Bulletin of the EATCS (2008) 130--152."},"type":"journal_article","user_id":"15504","title":"Algorithms for Overlay Networks","date_created":"2018-03-29T09:28:22Z","status":"public","publication":"Bulletin of the EATCS","department":[{"_id":"79"}],"author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}]},{"page":"45--54","type":"conference","year":"2008","citation":{"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} }","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.","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.","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","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","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."},"doi":"10.1145/1400751.1400759","date_updated":"2022-01-06T06:54:03Z","_id":"1938","publication_identifier":{"isbn":["978-1-59593-989-0"]},"date_created":"2018-03-29T09:29:06Z","status":"public","publication":"Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008","department":[{"_id":"79"}],"author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"full_name":"W. Richa, Andr{\\'{e}}a","first_name":"Andr{\\'{e}}a","last_name":"W. Richa"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publisher":"ACM","title":"A jamming-resistant MAC protocol for single-hop wireless networks","user_id":"15504"},{"user_id":"14955","ddc":["040"],"file":[{"access_level":"open_access","date_created":"2018-04-13T10:03:13Z","file_name":"SODA08.pdf","content_type":"application/pdf","date_updated":"2018-04-13T10:03:13Z","relation":"main_file","file_size":211264,"creator":"florida","file_id":"2341"}],"file_date_updated":"2018-04-13T10:03:13Z","publication":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008","publisher":"SIAM","author":[{"full_name":"Mense, Mario","first_name":"Mario","last_name":"Mense"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"date_created":"2018-03-29T09:30:18Z","has_accepted_license":"1","status":"public","urn":"19408","_id":"1940","page":"1135--1144","citation":{"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} }","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."},"type":"conference","year":"2008","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"}]},{"user_id":"15504","title":"Tiara: A Self-stabilizing Deterministic Skip List","publisher":"Springer","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"}],"publication":"Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings","department":[{"_id":"79"}],"status":"public","date_created":"2018-03-29T09:31:18Z","publication_identifier":{"isbn":["978-3-540-89334-9"]},"volume":5340,"_id":"1941","date_updated":"2022-01-06T06:54:03Z","intvolume":" 5340","doi":"10.1007/978-3-540-89335-6_12","series_title":"Lecture Notes in Computer Science","type":"conference","citation":{"mla":"Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List.” Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings, vol. 5340, Springer, 2008, pp. 124--140, doi:10.1007/978-3-540-89335-6_12.","bibtex":"@inproceedings{Clouser_Nesterenko_Scheideler_2008, series={Lecture Notes in Computer Science}, title={Tiara: A Self-stabilizing Deterministic Skip List}, volume={5340}, DOI={10.1007/978-3-540-89335-6_12}, booktitle={Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings}, publisher={Springer}, author={Clouser, Thomas and Nesterenko, Mikhail and Scheideler, Christian}, year={2008}, pages={124--140}, collection={Lecture Notes in Computer Science} }","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","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.","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."},"year":"2008","page":"124--140"},{"citation":{"short":"C. Scheideler, in: Taschenbuch Der Algorithmen, Springer, 2008, pp. 229--236.","ieee":"C. Scheideler, “Broadcasting: Wie verbreite ich schnell Informationen?,” in Taschenbuch der Algorithmen, Springer, 2008, pp. 229--236.","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.","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","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} }"},"year":"2008","type":"book_chapter","page":"229--236","series_title":"eXamen.press","doi":"10.1007/978-3-540-76394-9_22","date_updated":"2022-01-06T06:54:03Z","_id":"1942","status":"public","date_created":"2018-03-29T09:32:34Z","publication_identifier":{"isbn":["978-3-540-76393-2"]},"author":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"Springer","department":[{"_id":"79"}],"publication":"Taschenbuch der Algorithmen","user_id":"15504","title":"Broadcasting: Wie verbreite ich schnell Informationen?"},{"_id":"1925","date_updated":"2022-01-06T06:54:00Z","issue":"2","doi":"10.1007/s00224-009-9202-x","page":"187","citation":{"ieee":"R. D. Kleinberg and C. Scheideler, “Foreword,” Theory Comput. Syst., no. 2, p. 187, 2009.","short":"R. D. Kleinberg, C. Scheideler, Theory Comput. Syst. (2009) 187.","bibtex":"@article{D. Kleinberg_Scheideler_2009, title={Foreword}, DOI={10.1007/s00224-009-9202-x}, number={2}, journal={Theory Comput. Syst.}, author={D. Kleinberg, Robert and Scheideler, Christian}, year={2009}, pages={187} }","mla":"D. Kleinberg, Robert, and Christian Scheideler. “Foreword.” Theory Comput. Syst., no. 2, 2009, p. 187, doi:10.1007/s00224-009-9202-x.","chicago":"D. Kleinberg, Robert, and Christian Scheideler. “Foreword.” Theory Comput. Syst., no. 2 (2009): 187. https://doi.org/10.1007/s00224-009-9202-x.","apa":"D. Kleinberg, R., & Scheideler, C. (2009). Foreword. Theory Comput. Syst., (2), 187. https://doi.org/10.1007/s00224-009-9202-x","ama":"D. Kleinberg R, Scheideler C. Foreword. Theory Comput Syst. 2009;(2):187. doi:10.1007/s00224-009-9202-x"},"type":"journal_article","year":"2009","user_id":"15504","title":"Foreword","publication":"Theory Comput. Syst.","department":[{"_id":"79"}],"author":[{"first_name":"Robert","full_name":"D. Kleinberg, Robert","last_name":"D. Kleinberg"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2018-03-29T09:01:30Z","status":"public"},{"user_id":"15504","title":"Towards a Scalable and Robust DHT","date_created":"2018-03-29T09:08:11Z","status":"public","department":[{"_id":"79"}],"publication":"Theory Comput. Syst.","author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"issue":"2","doi":"10.1007/s00224-008-9099-9","date_updated":"2022-01-06T06:54:00Z","_id":"1927","page":"234--260","year":"2009","citation":{"chicago":"Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.” Theory Comput. Syst., no. 2 (2009): 234--260. https://doi.org/10.1007/s00224-008-9099-9.","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","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","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} }","short":"B. Awerbuch, C. Scheideler, Theory Comput. Syst. (2009) 234--260.","ieee":"B. Awerbuch and C. Scheideler, “Towards a Scalable and Robust DHT,” Theory Comput. Syst., no. 2, pp. 234--260, 2009."},"type":"journal_article"},{"doi":"10.1016/j.tcs.2008.10.003","issue":"6-7","date_updated":"2022-01-06T06:54:01Z","_id":"1928","year":"2009","citation":{"chicago":"Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.” Theor. Comput. Sci., no. 6–7 (2009): 453--466. https://doi.org/10.1016/j.tcs.2008.10.003.","ama":"Awerbuch B, Scheideler C. Robust random number generation for peer-to-peer systems. Theor Comput Sci. 2009;(6-7):453--466. doi:10.1016/j.tcs.2008.10.003","apa":"Awerbuch, B., & Scheideler, C. (2009). Robust random number generation for peer-to-peer systems. Theor. Comput. Sci., (6–7), 453--466. https://doi.org/10.1016/j.tcs.2008.10.003","bibtex":"@article{Awerbuch_Scheideler_2009, title={Robust random number generation for peer-to-peer systems}, DOI={10.1016/j.tcs.2008.10.003}, number={6–7}, journal={Theor. Comput. Sci.}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2009}, pages={453--466} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.” Theor. Comput. Sci., no. 6–7, 2009, pp. 453--466, doi:10.1016/j.tcs.2008.10.003.","short":"B. Awerbuch, C. Scheideler, Theor. Comput. Sci. (2009) 453--466.","ieee":"B. Awerbuch and C. Scheideler, “Robust random number generation for peer-to-peer systems,” Theor. Comput. Sci., no. 6–7, pp. 453--466, 2009."},"type":"journal_article","page":"453--466","title":"Robust random number generation for peer-to-peer systems","user_id":"15504","status":"public","date_created":"2018-03-29T09:08:12Z","author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"department":[{"_id":"79"}],"publication":"Theor. Comput. Sci."},{"intvolume":" 5556","_id":"1929","date_updated":"2022-01-06T06:54:01Z","doi":"10.1007/978-3-642-02930-1_47","series_title":"Lecture Notes in Computer Science","page":"571--582","citation":{"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.","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} }","short":"C. Scheideler, S. Schmid, in: Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, Springer, 2009, pp. 571--582.","ieee":"C. Scheideler and S. Schmid, “A Distributed and Oblivious Heap,” in Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, 2009, vol. 5556, pp. 571--582."},"type":"conference","year":"2009","title":"A Distributed and Oblivious Heap","user_id":"15504","department":[{"_id":"79"}],"publication":"Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II","publisher":"Springer","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"}],"publication_identifier":{"isbn":["978-3-642-02929-5"]},"volume":5556,"date_created":"2018-03-29T09:08:14Z","status":"public"},{"user_id":"15504","ddc":["040"],"date_created":"2018-03-29T09:12:59Z","has_accepted_license":"1","status":"public","volume":5878,"file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-13T10:05:53Z","creator":"florida","file_id":"2342","file_size":139275,"access_level":"open_access","file_name":"isaac09.pdf","date_created":"2018-04-13T10:05:53Z"}],"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","author":[{"last_name":"Jacob","first_name":"Riko","full_name":"Jacob, Riko"},{"last_name":"Ritscher","full_name":"Ritscher, Stephan","first_name":"Stephan"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"}],"publisher":"Springer","urn":"19304","intvolume":" 5878","_id":"1930","page":"771--780","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","title":"A Self-stabilizing and Local Delaunay Graph Construction","department":[{"_id":"79"}],"oa":"1","doi":"10.1007/978-3-642-10631-6_78","date_updated":"2022-01-06T06:54:02Z","series_title":"Lecture Notes in Computer Science"},{"doi":"10.1145/1582716.1582741","_id":"1932","date_updated":"2022-01-06T06:54:02Z","citation":{"ieee":"R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “A distributed polylogarithmic time algorithm for self-stabilizing skip graphs,” in Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140.","short":"R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140.","bibtex":"@inproceedings{Jacob_W. Richa_Scheideler_Schmid_Täubig_2009, title={A distributed polylogarithmic time algorithm for self-stabilizing skip graphs}, DOI={10.1145/1582716.1582741}, booktitle={Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009}, author={Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo}, year={2009}, pages={131--140} }","mla":"Jacob, Riko, et al. “A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs.” Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140, doi:10.1145/1582716.1582741.","ama":"Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009. ; 2009:131--140. doi:10.1145/1582716.1582741","apa":"Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., & Täubig, H. (2009). A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009 (pp. 131--140). https://doi.org/10.1145/1582716.1582741","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."},"year":"2009","type":"conference","page":"131--140","title":"A distributed polylogarithmic time algorithm for self-stabilizing skip graphs","user_id":"15504","publication_identifier":{"isbn":["978-1-60558-396-9"]},"status":"public","date_created":"2018-03-29T09:16:22Z","author":[{"full_name":"Jacob, Riko","first_name":"Riko","last_name":"Jacob"},{"last_name":"W. Richa","full_name":"W. Richa, Andrea","first_name":"Andrea"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"last_name":"Täubig","first_name":"Hanjo","full_name":"Täubig, Hanjo"}],"department":[{"_id":"79"}],"publication":"Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009"},{"user_id":"15504","title":"A DoS-resilient information system for dynamic data management","publication":"SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009","department":[{"_id":"79"}],"author":[{"last_name":"Baumgart","first_name":"Matthias","full_name":"Baumgart, Matthias"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"}],"date_created":"2018-03-29T09:18:06Z","status":"public","publication_identifier":{"isbn":["978-1-60558-606-9"]},"_id":"1933","date_updated":"2022-01-06T06:54:02Z","doi":"10.1145/1583991.1584064","page":"300--309","year":"2009","type":"conference","citation":{"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.","chicago":"Baumgart, Matthias, Christian Scheideler, and Stefan Schmid. “A DoS-Resilient Information System for Dynamic Data Management.” In SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, 300--309, 2009. https://doi.org/10.1145/1583991.1584064.","apa":"Baumgart, M., Scheideler, C., & Schmid, S. (2009). A DoS-resilient information system for dynamic data management. In SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009 (pp. 300--309). https://doi.org/10.1145/1583991.1584064","ama":"Baumgart M, Scheideler C, Schmid S. A DoS-resilient information system for dynamic data management. In: SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009. ; 2009:300--309. doi:10.1145/1583991.1584064","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} }","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."}},{"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.","bibtex":"@inproceedings{Gall_Jacob_W. Richa_Scheideler_Schmid_Täubig_2009, series={Lecture Notes in Computer Science}, title={Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization}, volume={5873}, DOI={10.1007/978-3-642-05118-0_58}, booktitle={Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings}, publisher={Springer}, author={Gall, Dominik and Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo}, year={2009}, pages={781--782}, collection={Lecture Notes in Computer Science} }","mla":"Gall, Dominik, et al. “Brief Announcement: On the Time Complexity of Distributed Topological Self-Stabilization.” Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, vol. 5873, Springer, 2009, pp. 781--782, doi:10.1007/978-3-642-05118-0_58.","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."},"page":"781--782","series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-642-05118-0_58","date_updated":"2022-01-06T06:54:02Z","_id":"1934","intvolume":" 5873","volume":5873,"publication_identifier":{"isbn":["978-3-642-05117-3"]},"status":"public","date_created":"2018-03-29T09:19:17Z","publisher":"Springer","author":[{"last_name":"Gall","full_name":"Gall, Dominik","first_name":"Dominik"},{"last_name":"Jacob","full_name":"Jacob, Riko","first_name":"Riko"},{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. 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":"Täubig","full_name":"Täubig, Hanjo","first_name":"Hanjo"}],"department":[{"_id":"79"}],"publication":"Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings","title":"Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization","user_id":"15504"},{"author":[{"full_name":"Doerr, Benjamin","first_name":"Benjamin","last_name":"Doerr"},{"last_name":"Ann Goldberg","full_name":"Ann Goldberg, Leslie","first_name":"Leslie"},{"last_name":"Minder","first_name":"Lorenz","full_name":"Minder, Lorenz"},{"last_name":"Sauerwald","first_name":"Thomas","full_name":"Sauerwald, Thomas"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany","publication":"Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009","department":[{"_id":"79"}],"volume":"09371","status":"public","date_created":"2018-03-29T09:20:44Z","title":"Stabilizing Consensus with the Power of Two Choices","user_id":"15504","series_title":"Dagstuhl Seminar Proceedings","type":"conference","year":"2009","citation":{"chicago":"Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler. “Stabilizing Consensus with the Power of Two Choices.” In Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, Vol. 09371. Dagstuhl Seminar Proceedings. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009. https://doi.org/10.1145/1989493.1989516.","ama":"Doerr B, Ann Goldberg L, Minder L, Sauerwald T, Scheideler C. Stabilizing Consensus with the Power of Two Choices. In: Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009. Vol 09371. Dagstuhl Seminar Proceedings. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany; 2009. doi:10.1145/1989493.1989516","apa":"Doerr, B., Ann Goldberg, L., Minder, L., Sauerwald, T., & Scheideler, C. (2009). Stabilizing Consensus with the Power of Two Choices. In Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009 (Vol. 09371). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. https://doi.org/10.1145/1989493.1989516","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.","short":"B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009.","ieee":"B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Stabilizing Consensus with the Power of Two Choices,” in Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, 2009, vol. 09371."},"intvolume":" 9371","_id":"1935","date_updated":"2022-01-06T06:54:02Z","doi":"10.1145/1989493.1989516"},{"date_updated":"2022-01-06T06:53:57Z","_id":"1903","doi":"10.1007/s00287-010-0470-2","issue":"5","page":"468--474","citation":{"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.","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} }","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","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."},"year":"2010","type":"journal_article","language":[{"iso":"eng"}],"title":"Algorithmische Grundlagen verteilter Speichersysteme","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"publication":"Informatik Spektrum","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2018-03-28T07:21:50Z","status":"public"},{"page":"809--810","type":"journal_article","year":"2010","citation":{"short":"C. Gavoille, B. Patt-Shamir, C. Scheideler, Theory of Computing Systems (2010) 809--810.","ieee":"C. Gavoille, B. Patt-Shamir, and C. Scheideler, “Foreword,” Theory of Computing Systems, no. 4, pp. 809--810, 2010.","chicago":"Gavoille, Cyril, Boaz Patt-Shamir, and Christian Scheideler. “Foreword.” Theory of Computing Systems, no. 4 (2010): 809--810. https://doi.org/10.1007/s00224-010-9284-5.","apa":"Gavoille, C., Patt-Shamir, B., & Scheideler, C. (2010). Foreword. Theory of Computing Systems, (4), 809--810. https://doi.org/10.1007/s00224-010-9284-5","ama":"Gavoille C, Patt-Shamir B, Scheideler C. Foreword. Theory of Computing Systems. 2010;(4):809--810. doi:10.1007/s00224-010-9284-5","bibtex":"@article{Gavoille_Patt-Shamir_Scheideler_2010, title={Foreword}, DOI={10.1007/s00224-010-9284-5}, number={4}, journal={Theory of Computing Systems}, author={Gavoille, Cyril and Patt-Shamir, Boaz and Scheideler, Christian}, year={2010}, pages={809--810} }","mla":"Gavoille, Cyril, et al. “Foreword.” Theory of Computing Systems, no. 4, 2010, pp. 809--810, doi:10.1007/s00224-010-9284-5."},"_id":"1904","date_updated":"2022-01-06T06:53:57Z","issue":"4","doi":"10.1007/s00224-010-9284-5","department":[{"_id":"79"}],"publication":"Theory of Computing Systems","author":[{"full_name":"Gavoille, Cyril","first_name":"Cyril","last_name":"Gavoille"},{"full_name":"Patt-Shamir, Boaz","first_name":"Boaz","last_name":"Patt-Shamir"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"date_created":"2018-03-28T07:22:21Z","status":"public","user_id":"15504","title":"Foreword"},{"series_title":"Lecture Notes in Computer Science","page":"294--305","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.","apa":"Gall, D., Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., & Täubig, H. (2010). Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. In LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings (Vol. 6034, pp. 294--305). Springer. https://doi.org/10.1007/978-3-642-12200-2_27","ama":"Gall D, Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. In: LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings. Vol 6034. Lecture Notes in Computer Science. Springer; 2010:294--305. doi:10.1007/978-3-642-12200-2_27","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","date_updated":"2022-01-06T06:53:57Z","_id":"1905","intvolume":" 6034","doi":"10.1007/978-3-642-12200-2_27","department":[{"_id":"79"}],"publication":"LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings","publisher":"Springer","author":[{"full_name":"Gall, Dominik","first_name":"Dominik","last_name":"Gall"},{"last_name":"Jacob","first_name":"Riko","full_name":"Jacob, Riko"},{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"},{"full_name":"Täubig, Hanjo","first_name":"Hanjo","last_name":"Täubig"}],"publication_identifier":{"isbn":["978-3-642-12199-9"]},"volume":6034,"date_created":"2018-03-28T07:22:42Z","status":"public","title":"Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization","user_id":"15504"},{"_id":"1906","date_updated":"2022-01-06T06:53:57Z","doi":"10.1145/1835698.1835726","citation":{"bibtex":"@inproceedings{Richa_Zhang_Scheideler_Schmid_2010, title={Brief announcement: towards robust medium access in multi-hop networks}, DOI={10.1145/1835698.1835726}, booktitle={Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010}, publisher={ACM}, author={Richa, Andrea W. and Zhang, Jin and Scheideler, Christian and Schmid, Stefan}, year={2010}, pages={114--115} }","mla":"Richa, Andrea W., et al. “Brief Announcement: Towards Robust Medium Access in Multi-Hop Networks.” Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, ACM, 2010, pp. 114--115, doi:10.1145/1835698.1835726.","ama":"Richa AW, Zhang J, Scheideler C, Schmid S. Brief announcement: towards robust medium access in multi-hop networks. In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010. ACM; 2010:114--115. doi:10.1145/1835698.1835726","apa":"Richa, A. W., Zhang, J., Scheideler, C., & Schmid, S. (2010). Brief announcement: towards robust medium access in multi-hop networks. In Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010 (pp. 114--115). ACM. https://doi.org/10.1145/1835698.1835726","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.","ieee":"A. W. Richa, J. Zhang, C. Scheideler, and S. Schmid, “Brief announcement: towards robust medium access in multi-hop networks,” in Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, 2010, pp. 114--115.","short":"A.W. Richa, J. Zhang, C. Scheideler, S. Schmid, in: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, ACM, 2010, pp. 114--115."},"year":"2010","type":"conference","page":"114--115","user_id":"15504","title":"Brief announcement: towards robust medium access in multi-hop networks","publisher":"ACM","author":[{"last_name":"Richa","full_name":"Richa, Andrea W.","first_name":"Andrea W."},{"last_name":"Zhang","full_name":"Zhang, Jin","first_name":"Jin"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"}],"publication":"Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010","department":[{"_id":"79"}],"status":"public","date_created":"2018-03-28T07:23:32Z","publication_identifier":{"isbn":["978-1-60558-888-9"]}},{"type":"conference","citation":{"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} }","chicago":"Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin Zhang. “A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks.” In Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, 6343:179--193. Lecture Notes in Computer Science. Springer, 2010. https://doi.org/10.1007/978-3-642-15763-9_17.","apa":"Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2010). A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks. In Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings (Vol. 6343, pp. 179--193). Springer. https://doi.org/10.1007/978-3-642-15763-9_17","ama":"Richa AW, Scheideler C, Schmid S, Zhang J. A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks. In: Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings. Vol 6343. Lecture Notes in Computer Science. Springer; 2010:179--193. doi:10.1007/978-3-642-15763-9_17","ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks,” in Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, 2010, vol. 6343, pp. 179--193.","short":"A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, Springer, 2010, pp. 179--193."},"year":"2010","page":"179--193","series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-642-15763-9_17","_id":"1907","intvolume":" 6343","date_updated":"2022-01-06T06:53:58Z","volume":6343,"publication_identifier":{"isbn":["978-3-642-15762-2"]},"status":"public","date_created":"2018-03-28T07:24:22Z","publisher":"Springer","author":[{"first_name":"Andrea W.","full_name":"Richa, Andrea W.","last_name":"Richa"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"},{"first_name":"Jin","full_name":"Zhang, Jin","last_name":"Zhang"}],"department":[{"_id":"79"}],"publication":"Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings","title":"A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks","user_id":"15504"}]