[{"_id":"2113","date_updated":"2022-01-06T06:54:46Z","urn":"21137","oa":"1","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."},"type":"conference","year":"2006","page":"318--327","user_id":"15504","title":"Towards a scalable and robust DHT","ddc":["040"],"file":[{"relation":"main_file","date_updated":"2018-04-13T10:00:09Z","content_type":"application/pdf","creator":"florida","file_id":"2337","file_size":144588,"access_level":"open_access","file_name":"SPAA06.pdf","date_created":"2018-04-13T10:00:09Z"}],"author":[{"last_name":"Awerbuch","full_name":"Awerbuch, Baruch","first_name":"Baruch"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publication":"SPAA","department":[{"_id":"79"}],"file_date_updated":"2018-04-13T10:00:09Z","has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:24:22Z"},{"department":[{"_id":"79"}],"publication":"Theory Comput. Syst.","author":[{"last_name":"Bagchi","first_name":"Amitabha","full_name":"Bagchi, Amitabha"},{"last_name":"Bhargava","full_name":"Bhargava, Ankur","first_name":"Ankur"},{"last_name":"Chaudhary","first_name":"Amitabh","full_name":"Chaudhary, Amitabh"},{"first_name":"David","full_name":"Eppstein, David","last_name":"Eppstein"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2018-03-29T12:32:54Z","status":"public","user_id":"15504","title":"The Effect of Faults on Network Expansion","page":"903--928","citation":{"ieee":"A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler, “The Effect of Faults on Network Expansion,” Theory Comput. Syst., no. 6, pp. 903--928, 2006.","short":"A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, Theory Comput. Syst. (2006) 903--928.","mla":"Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” Theory Comput. Syst., no. 6, 2006, pp. 903--928, doi:10.1007/s00224-006-1349-0.","bibtex":"@article{Bagchi_Bhargava_Chaudhary_Eppstein_Scheideler_2006, title={The Effect of Faults on Network Expansion}, DOI={10.1007/s00224-006-1349-0}, number={6}, journal={Theory Comput. Syst.}, author={Bagchi, Amitabha and Bhargava, Ankur and Chaudhary, Amitabh and Eppstein, David and Scheideler, Christian}, year={2006}, pages={903--928} }","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.","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"},"year":"2006","type":"journal_article","date_updated":"2022-01-06T06:54:27Z","_id":"2043","issue":"6","doi":"10.1007/s00224-006-1349-0"},{"department":[{"_id":"79"}],"publication":"6th International HNI Symposium on New Trends in Parallel and Distributed Computing","file_date_updated":"2018-04-13T09:59:14Z","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"access_level":"open_access","date_created":"2018-04-13T09:59:14Z","file_name":"HNI-Symposium-06.pdf","relation":"main_file","date_updated":"2018-04-13T09:59:14Z","content_type":"application/pdf","file_id":"2336","creator":"florida","file_size":85116}],"date_created":"2018-04-05T07:06:44Z","status":"public","has_accepted_license":"1","title":"Towards a paradigm for robust distributed algorithms and data structures","ddc":["040"],"user_id":"15504","year":"2006","citation":{"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.","short":"C. Scheideler, in: 6th International HNI Symposium on New Trends in Parallel and Distributed Computing, 2006.","mla":"Scheideler, Christian. “Towards a Paradigm for Robust Distributed Algorithms and Data Structures.” 6th International HNI Symposium on New Trends in Parallel and Distributed Computing, 2006.","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} }","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.","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.","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."},"type":"conference","urn":"22137","date_updated":"2022-01-06T06:55:27Z","_id":"2213","oa":"1"},{"publication":"ISPAN","department":[{"_id":"79"}],"file_date_updated":"2018-04-13T08:45:41Z","author":[{"first_name":"Miroslaw","full_name":"Korzeniowski, Miroslaw","last_name":"Korzeniowski"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file":[{"access_level":"open_access","date_created":"2018-04-13T08:45:41Z","file_name":"KS-ISPAN-05-TransData.pdf","relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-13T08:45:41Z","creator":"florida","file_id":"2325","file_size":110389}],"date_created":"2018-04-03T05:25:16Z","status":"public","has_accepted_license":"1","ddc":["040"],"title":"Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment","user_id":"15504","page":"182--187","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.","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).","ama":"Korzeniowski M, Scheideler C. Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment. In: ISPAN. ; 2005:182--187.","bibtex":"@inproceedings{Korzeniowski_Scheideler_2005, title={Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment}, booktitle={ISPAN}, author={Korzeniowski, Miroslaw and Scheideler, Christian}, year={2005}, pages={182--187} }","mla":"Korzeniowski, Miroslaw, and Christian Scheideler. “Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment.” ISPAN, 2005, pp. 182--187.","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."},"type":"conference","urn":"21146","date_updated":"2022-01-06T06:54:47Z","_id":"2114","oa":"1"},{"oa":"1","urn":"21156","_id":"2115","date_updated":"2022-01-06T06:54:47Z","page":"188--193","type":"conference","year":"2005","citation":{"short":"K. Kothapalli, C. Scheideler, in: ISPAN, 2005, pp. 188--193.","ieee":"K. Kothapalli and C. Scheideler, “Supervised Peer-to-Peer Systems,” in ISPAN, 2005, pp. 188--193.","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.","bibtex":"@inproceedings{Kothapalli_Scheideler_2005, title={Supervised Peer-to-Peer Systems}, booktitle={ISPAN}, author={Kothapalli, Kishore and Scheideler, Christian}, year={2005}, pages={188--193} }","mla":"Kothapalli, Kishore, and Christian Scheideler. “Supervised Peer-to-Peer Systems.” ISPAN, 2005, pp. 188--193."},"title":"Supervised Peer-to-Peer Systems","ddc":["040"],"user_id":"15504","date_created":"2018-04-03T05:26:10Z","has_accepted_license":"1","status":"public","department":[{"_id":"79"}],"publication":"ISPAN","file_date_updated":"2018-04-13T08:50:40Z","author":[{"last_name":"Kothapalli","first_name":"Kishore","full_name":"Kothapalli, Kishore"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"relation":"main_file","date_updated":"2018-04-13T08:50:40Z","content_type":"application/pdf","creator":"florida","file_id":"2326","file_size":69350,"access_level":"open_access","date_created":"2018-04-13T08:50:40Z","file_name":"KS-ISPAN-05-Supervised.pdf"}]},{"type":"conference","year":"2005","citation":{"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.","bibtex":"@inproceedings{Onus_W. Richa_Kothapalli_Scheideler_2005, title={Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks}, booktitle={ISPAN}, author={Onus, Melih and W. Richa, Andrea and Kothapalli, Kishore and Scheideler, Christian}, year={2005}, pages={346--351} }","mla":"Onus, Melih, et al. “Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks.” ISPAN, 2005, pp. 346--351.","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."},"page":"346--351","oa":"1","_id":"2116","date_updated":"2022-01-06T06:54:48Z","urn":"21165","status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:26:50Z","author":[{"last_name":"Onus","full_name":"Onus, Melih","first_name":"Melih"},{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, Andrea"},{"first_name":"Kishore","full_name":"Kothapalli, Kishore","last_name":"Kothapalli"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publication":"ISPAN","department":[{"_id":"79"}],"file_date_updated":"2018-04-13T08:55:51Z","file":[{"date_created":"2018-04-13T08:55:51Z","file_name":"KORS-ISPAN-05.pdf","access_level":"open_access","file_size":135267,"file_id":"2327","creator":"florida","content_type":"application/pdf","date_updated":"2018-04-13T08:55:51Z","relation":"main_file"}],"ddc":["040"],"title":"Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks","user_id":"15504"},{"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:28:33Z","author":[{"last_name":"Kothapalli","full_name":"Kothapalli, Kishore","first_name":"Kishore"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Onus, Melih","first_name":"Melih","last_name":"Onus"},{"last_name":"W. Richa","full_name":"W. Richa, Andrea","first_name":"Andrea"}],"department":[{"_id":"79"}],"publication":"SPAA","file_date_updated":"2018-04-13T08:56:49Z","file":[{"file_name":"SPAA-05.pdf","date_created":"2018-04-13T08:56:49Z","access_level":"open_access","file_size":118644,"file_id":"2328","creator":"florida","date_updated":"2018-04-13T08:56:49Z","content_type":"application/pdf","relation":"main_file"}],"title":"Constant density spanners for wireless ad-hoc networks","ddc":["040"],"user_id":"15504","year":"2005","citation":{"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.","short":"K. Kothapalli, C. Scheideler, M. Onus, A. W. Richa, in: SPAA, 2005, pp. 116--125.","bibtex":"@inproceedings{Kothapalli_Scheideler_Onus_W. Richa_2005, title={Constant density spanners for wireless ad-hoc networks}, booktitle={SPAA}, author={Kothapalli, Kishore and Scheideler, Christian and Onus, Melih and W. Richa, Andrea}, year={2005}, pages={116--125} }","mla":"Kothapalli, Kishore, et al. “Constant Density Spanners for Wireless Ad-Hoc Networks.” SPAA, 2005, pp. 116--125.","chicago":"Kothapalli, Kishore, Christian Scheideler, Melih Onus, and Andrea W. Richa. “Constant Density Spanners for Wireless Ad-Hoc Networks.” In SPAA, 116--125, 2005.","apa":"Kothapalli, K., Scheideler, C., Onus, M., & W. Richa, A. (2005). Constant density spanners for wireless ad-hoc networks. In SPAA (pp. 116--125).","ama":"Kothapalli K, Scheideler C, Onus M, W. Richa A. Constant density spanners for wireless ad-hoc networks. In: SPAA. ; 2005:116--125."},"type":"conference","page":"116--125","oa":"1","date_updated":"2022-01-06T06:54:48Z","_id":"2117","urn":"21175"},{"user_id":"15504","title":"How to spread adversarial nodes?: rotate!","ddc":["040"],"file":[{"content_type":"application/pdf","date_updated":"2018-04-13T08:58:22Z","relation":"main_file","file_size":134460,"creator":"florida","file_id":"2330","access_level":"open_access","file_name":"STOC-05.pdf","date_created":"2018-04-13T08:58:22Z"}],"author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"department":[{"_id":"79"}],"publication":"STOC","file_date_updated":"2018-04-13T08:58:22Z","has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:29:27Z","_id":"2118","date_updated":"2022-01-06T06:54:49Z","urn":"21185","oa":"1","year":"2005","citation":{"ieee":"C. Scheideler, “How to spread adversarial nodes?: rotate!,” in STOC, 2005, pp. 704--713.","short":"C. Scheideler, in: STOC, 2005, pp. 704--713.","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.","chicago":"Scheideler, Christian. “How to Spread Adversarial Nodes?: Rotate!” In STOC, 704--713, 2005.","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."},"type":"conference","page":"704--713"},{"user_id":"15504","ddc":["040"],"title":"Overlay networks for wireless ad hoc networks","file":[{"access_level":"open_access","date_created":"2018-04-13T08:57:39Z","file_name":"IMA-05.pdf","relation":"main_file","date_updated":"2018-04-13T08:57:39Z","content_type":"application/pdf","file_id":"2329","creator":"florida","file_size":295333}],"author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"department":[{"_id":"79"}],"file_date_updated":"2018-04-13T08:57:39Z","publication":"IMA Workshop on Wireless Communications","has_accepted_license":"1","status":"public","date_created":"2018-04-05T07:05:16Z","date_updated":"2022-01-06T06:55:26Z","_id":"2212","urn":"22129","oa":"1","type":"conference","citation":{"ama":"Scheideler C. Overlay networks for wireless ad hoc networks. In: IMA Workshop on Wireless Communications. ; 2005.","apa":"Scheideler, C. (2005). Overlay networks for wireless ad hoc networks. In IMA Workshop on Wireless Communications.","chicago":"Scheideler, Christian. “Overlay Networks for Wireless Ad Hoc Networks.” In 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} }","mla":"Scheideler, Christian. “Overlay Networks for Wireless Ad Hoc Networks.” IMA Workshop on Wireless Communications, 2005.","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."},"year":"2005"},{"title":"Simple On-Line Algorithms for the Maximum Disjoint Paths Problem","user_id":"15504","date_created":"2018-04-03T05:30:23Z","status":"public","department":[{"_id":"79"}],"publication":"Algorithmica","author":[{"full_name":"Kolman, Petr","first_name":"Petr","last_name":"Kolman"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"doi":"10.1007/s00453-004-1086-1","issue":"3","date_updated":"2022-01-06T06:54:49Z","_id":"2119","page":"209--233","type":"journal_article","year":"2004","citation":{"short":"P. Kolman, C. Scheideler, Algorithmica (2004) 209--233.","ieee":"P. Kolman and C. Scheideler, “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem,” Algorithmica, no. 3, pp. 209--233, 2004.","ama":"Kolman P, Scheideler C. Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. Algorithmica. 2004;(3):209--233. doi:10.1007/s00453-004-1086-1","apa":"Kolman, P., & Scheideler, C. (2004). Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. Algorithmica, (3), 209--233. https://doi.org/10.1007/s00453-004-1086-1","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.","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.","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} }"}}]