[{"oa":"1","date_updated":"2022-01-06T06:54:46Z","_id":"2113","urn":"21137","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","title":"Towards a scalable and robust DHT","ddc":["040"],"user_id":"15504","status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:24:22Z","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":"SPAA","file_date_updated":"2018-04-13T10:00:09Z","file":[{"creator":"florida","file_id":"2337","file_size":144588,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-13T10:00:09Z","file_name":"SPAA06.pdf","date_created":"2018-04-13T10:00:09Z","access_level":"open_access"}]},{"publication":"Theory Comput. Syst.","department":[{"_id":"79"}],"author":[{"last_name":"Bagchi","full_name":"Bagchi, Amitabha","first_name":"Amitabha"},{"last_name":"Bhargava","full_name":"Bhargava, Ankur","first_name":"Ankur"},{"full_name":"Chaudhary, Amitabh","first_name":"Amitabh","last_name":"Chaudhary"},{"last_name":"Eppstein","full_name":"Eppstein, David","first_name":"David"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"date_created":"2018-03-29T12:32:54Z","status":"public","title":"The Effect of Faults on Network Expansion","user_id":"15504","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.","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.","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","doi":"10.1007/s00224-006-1349-0","issue":"6"},{"file":[{"file_name":"HNI-Symposium-06.pdf","date_created":"2018-04-13T09:59:14Z","access_level":"open_access","creator":"florida","file_id":"2336","file_size":85116,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-13T09:59:14Z"}],"author":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publication":"6th International HNI Symposium on New Trends in Parallel and Distributed Computing","file_date_updated":"2018-04-13T09:59:14Z","department":[{"_id":"79"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-05T07:06:44Z","user_id":"15504","title":"Towards a paradigm for robust distributed algorithms and data structures","ddc":["040"],"year":"2006","type":"conference","citation":{"bibtex":"@inproceedings{Scheideler_2006, title={Towards a paradigm for robust distributed algorithms and data structures}, booktitle={6th International HNI Symposium on New Trends in Parallel and Distributed Computing}, author={Scheideler, Christian}, year={2006} }","mla":"Scheideler, Christian. “Towards a Paradigm for Robust Distributed Algorithms and Data Structures.” 6th International HNI Symposium on New Trends in Parallel and Distributed Computing, 2006.","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.","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."},"_id":"2213","date_updated":"2022-01-06T06:55:27Z","urn":"22137","oa":"1"},{"file":[{"file_name":"KS-ISPAN-05-TransData.pdf","date_created":"2018-04-13T08:45:41Z","access_level":"open_access","creator":"florida","file_id":"2325","file_size":110389,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-13T08:45:41Z"}],"author":[{"first_name":"Miroslaw","full_name":"Korzeniowski, Miroslaw","last_name":"Korzeniowski"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file_date_updated":"2018-04-13T08:45:41Z","publication":"ISPAN","department":[{"_id":"79"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:25:16Z","user_id":"15504","ddc":["040"],"title":"Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment","citation":{"ieee":"M. Korzeniowski and C. Scheideler, “Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment,” in ISPAN, 2005, pp. 182--187.","short":"M. Korzeniowski, C. Scheideler, in: ISPAN, 2005, pp. 182--187.","bibtex":"@inproceedings{Korzeniowski_Scheideler_2005, title={Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment}, booktitle={ISPAN}, author={Korzeniowski, Miroslaw and Scheideler, Christian}, year={2005}, pages={182--187} }","mla":"Korzeniowski, Miroslaw, and Christian Scheideler. “Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment.” ISPAN, 2005, pp. 182--187.","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."},"type":"conference","year":"2005","page":"182--187","_id":"2114","date_updated":"2022-01-06T06:54:47Z","urn":"21146","oa":"1"},{"citation":{"ieee":"K. Kothapalli and C. Scheideler, “Supervised Peer-to-Peer Systems,” in ISPAN, 2005, pp. 188--193.","short":"K. Kothapalli, C. Scheideler, in: 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} }","mla":"Kothapalli, Kishore, and Christian Scheideler. “Supervised Peer-to-Peer Systems.” 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."},"year":"2005","type":"conference","page":"188--193","oa":"1","_id":"2115","date_updated":"2022-01-06T06:54:47Z","urn":"21156","status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:26:10Z","author":[{"first_name":"Kishore","full_name":"Kothapalli, Kishore","last_name":"Kothapalli"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file_date_updated":"2018-04-13T08:50:40Z","department":[{"_id":"79"}],"publication":"ISPAN","file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-13T08:50:40Z","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"}],"title":"Supervised Peer-to-Peer Systems","ddc":["040"],"user_id":"15504"},{"author":[{"first_name":"Melih","full_name":"Onus, Melih","last_name":"Onus"},{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"first_name":"Kishore","full_name":"Kothapalli, Kishore","last_name":"Kothapalli"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file_date_updated":"2018-04-13T08:55:51Z","publication":"ISPAN","department":[{"_id":"79"}],"file":[{"file_name":"KORS-ISPAN-05.pdf","date_created":"2018-04-13T08:55:51Z","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"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:26:50Z","ddc":["040"],"title":"Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks","user_id":"15504","year":"2005","type":"conference","citation":{"ieee":"M. Onus, A. W. Richa, K. Kothapalli, and C. Scheideler, “Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks,” in ISPAN, 2005, pp. 346--351.","short":"M. Onus, A. W. Richa, K. Kothapalli, C. Scheideler, in: ISPAN, 2005, pp. 346--351.","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} }","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.","apa":"Onus, M., W. Richa, A., Kothapalli, K., & Scheideler, C. (2005). Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks. In ISPAN (pp. 346--351).","ama":"Onus M, W. Richa A, Kothapalli K, Scheideler C. Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks. In: ISPAN. ; 2005:346--351."},"page":"346--351","_id":"2116","date_updated":"2022-01-06T06:54:48Z","urn":"21165","oa":"1"},{"author":[{"full_name":"Kothapalli, Kishore","first_name":"Kishore","last_name":"Kothapalli"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"full_name":"Onus, Melih","first_name":"Melih","last_name":"Onus"},{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, Andrea"}],"publication":"SPAA","department":[{"_id":"79"}],"file_date_updated":"2018-04-13T08:56:49Z","file":[{"access_level":"open_access","file_name":"SPAA-05.pdf","date_created":"2018-04-13T08:56:49Z","relation":"main_file","date_updated":"2018-04-13T08:56:49Z","content_type":"application/pdf","file_id":"2328","creator":"florida","file_size":118644}],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:28:33Z","title":"Constant density spanners for wireless ad-hoc networks","ddc":["040"],"user_id":"15504","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.","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.","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."},"type":"conference","page":"116--125","date_updated":"2022-01-06T06:54:48Z","_id":"2117","urn":"21175","oa":"1"},{"date_created":"2018-04-03T05:29:27Z","status":"public","has_accepted_license":"1","publication":"STOC","file_date_updated":"2018-04-13T08:58:22Z","department":[{"_id":"79"}],"author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"file_size":134460,"file_id":"2330","creator":"florida","content_type":"application/pdf","date_updated":"2018-04-13T08:58:22Z","relation":"main_file","file_name":"STOC-05.pdf","date_created":"2018-04-13T08:58:22Z","access_level":"open_access"}],"ddc":["040"],"title":"How to spread adversarial nodes?: rotate!","user_id":"15504","page":"704--713","type":"conference","citation":{"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.","ama":"Scheideler C. How to spread adversarial nodes?: rotate! In: STOC. ; 2005:704--713.","apa":"Scheideler, C. (2005). How to spread adversarial nodes?: rotate! In STOC (pp. 704--713).","chicago":"Scheideler, Christian. “How to Spread Adversarial Nodes?: Rotate!” In STOC, 704--713, 2005.","ieee":"C. Scheideler, “How to spread adversarial nodes?: rotate!,” in STOC, 2005, pp. 704--713.","short":"C. Scheideler, in: STOC, 2005, pp. 704--713."},"year":"2005","oa":"1","urn":"21185","_id":"2118","date_updated":"2022-01-06T06:54:49Z"},{"oa":"1","urn":"22129","_id":"2212","date_updated":"2022-01-06T06:55:26Z","year":"2005","citation":{"chicago":"Scheideler, Christian. “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.","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} }","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."},"type":"conference","user_id":"15504","title":"Overlay networks for wireless ad hoc networks","ddc":["040"],"date_created":"2018-04-05T07:05:16Z","status":"public","has_accepted_license":"1","file":[{"date_created":"2018-04-13T08:57:39Z","file_name":"IMA-05.pdf","access_level":"open_access","file_id":"2329","creator":"florida","file_size":295333,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-13T08:57:39Z"}],"file_date_updated":"2018-04-13T08:57:39Z","publication":"IMA Workshop on Wireless Communications","department":[{"_id":"79"}],"author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}]},{"user_id":"15504","title":"Simple On-Line Algorithms for the Maximum Disjoint Paths Problem","date_created":"2018-04-03T05:30:23Z","status":"public","publication":"Algorithmica","department":[{"_id":"79"}],"author":[{"last_name":"Kolman","full_name":"Kolman, Petr","first_name":"Petr"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"issue":"3","doi":"10.1007/s00453-004-1086-1","_id":"2119","date_updated":"2022-01-06T06:54:49Z","page":"209--233","type":"journal_article","year":"2004","citation":{"chicago":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” Algorithmica, no. 3 (2004): 209--233. https://doi.org/10.1007/s00453-004-1086-1.","ama":"Kolman P, Scheideler C. Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. Algorithmica. 2004;(3):209--233. doi:10.1007/s00453-004-1086-1","apa":"Kolman, P., & Scheideler, C. (2004). Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. Algorithmica, (3), 209--233. https://doi.org/10.1007/s00453-004-1086-1","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} }","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."}},{"intvolume":" 3142","_id":"2120","urn":"21200","citation":{"ieee":"B. Awerbuch and C. Scheideler, “Group Spreading: A Protocol for Provably Secure Distributed Name Service,” in ICALP, 2004, vol. 3142, pp. 183--195.","short":"B. Awerbuch, C. Scheideler, in: ICALP, 2004, pp. 183--195.","mla":"Awerbuch, Baruch, and Christian Scheideler. “Group Spreading: A Protocol for Provably Secure Distributed Name Service.” ICALP, vol. 3142, 2004, pp. 183--195.","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} }","apa":"Awerbuch, B., & Scheideler, C. (2004). Group Spreading: A Protocol for Provably Secure Distributed Name Service. In ICALP (Vol. 3142, pp. 183--195).","ama":"Awerbuch B, Scheideler C. Group Spreading: A Protocol for Provably Secure Distributed Name Service. In: ICALP. Vol 3142. Lecture Notes in Computer Science. ; 2004:183--195.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Group Spreading: A Protocol for Provably Secure Distributed Name Service.” In ICALP, 3142:183--195. Lecture Notes in Computer Science, 2004."},"type":"conference","year":"2004","page":"183--195","ddc":["040"],"user_id":"15504","volume":3142,"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:31:04Z","author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publication":"ICALP","file_date_updated":"2018-04-12T09:20:16Z","file":[{"date_created":"2018-04-12T09:20:16Z","file_name":"ICALP-04.pdf","access_level":"open_access","file_id":"2312","creator":"florida","file_size":145383,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:20:16Z"}],"oa":"1","date_updated":"2022-01-06T06:54:49Z","series_title":"Lecture Notes in Computer Science","title":"Group Spreading: A Protocol for Provably Secure Distributed Name Service","department":[{"_id":"79"}]},{"department":[{"_id":"79"}],"file_date_updated":"2018-04-12T09:50:26Z","publication":"IPDPS","author":[{"last_name":"Riley","full_name":"Riley, Chris","first_name":"Chris"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file":[{"relation":"main_file","date_updated":"2018-04-12T09:50:26Z","content_type":"application/pdf","file_id":"2316","creator":"florida","file_size":91542,"access_level":"open_access","date_created":"2018-04-12T09:50:26Z","file_name":"IPDPS-04.pdf"}],"date_created":"2018-04-03T05:31:59Z","has_accepted_license":"1","status":"public","ddc":["040"],"title":"A Distributed Hash Table for Computational Grids","user_id":"15504","type":"conference","citation":{"ieee":"C. Riley and C. Scheideler, “A Distributed Hash Table for Computational Grids,” in IPDPS, 2004.","short":"C. Riley, C. Scheideler, in: IPDPS, 2004.","bibtex":"@inproceedings{Riley_Scheideler_2004, title={A Distributed Hash Table for Computational Grids}, booktitle={IPDPS}, author={Riley, Chris and Scheideler, Christian}, year={2004} }","mla":"Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational Grids.” IPDPS, 2004.","apa":"Riley, C., & Scheideler, C. (2004). A Distributed Hash Table for Computational Grids. In IPDPS.","ama":"Riley C, Scheideler C. A Distributed Hash Table for Computational Grids. In: IPDPS. ; 2004.","chicago":"Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational Grids.” In IPDPS, 2004."},"year":"2004","urn":"21212","date_updated":"2022-01-06T06:54:50Z","_id":"2121","oa":"1"},{"oa":"1","date_updated":"2022-01-06T06:54:50Z","series_title":"Lecture Notes in Computer Science","title":"Robust Distributed Name Service","department":[{"_id":"79"}],"urn":"21229","_id":"2122","intvolume":" 3279","page":"237--249","year":"2004","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.","bibtex":"@inproceedings{Awerbuch_Scheideler_2004, series={Lecture Notes in Computer Science}, title={Robust Distributed Name Service}, volume={3279}, booktitle={IPTPS}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={237--249}, collection={Lecture Notes in Computer Science} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.” IPTPS, vol. 3279, 2004, pp. 237--249.","ama":"Awerbuch B, Scheideler C. Robust Distributed Name Service. In: IPTPS. Vol 3279. Lecture Notes in Computer Science. ; 2004:237--249.","apa":"Awerbuch, B., & Scheideler, C. (2004). Robust Distributed Name Service. In IPTPS (Vol. 3279, pp. 237--249).","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.” In IPTPS, 3279:237--249. Lecture Notes in Computer Science, 2004."},"type":"conference","ddc":["040"],"user_id":"15504","volume":3279,"date_created":"2018-04-03T05:32:33Z","status":"public","has_accepted_license":"1","file_date_updated":"2018-04-12T11:39:38Z","publication":"IPTPS","author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file":[{"creator":"florida","file_id":"2318","file_size":136987,"relation":"main_file","date_updated":"2018-04-12T11:39:38Z","content_type":"application/pdf","file_name":"IPTPS-04.pdf","date_created":"2018-04-12T11:39:38Z","access_level":"open_access"}]},{"title":"Survivable Monitoring in Dynamic Networks","ddc":["040"],"user_id":"15504","author":[{"last_name":"Ateniese","first_name":"Giuseppe","full_name":"Ateniese, Giuseppe"},{"full_name":"Riley, Chris","first_name":"Chris","last_name":"Riley"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"department":[{"_id":"79"}],"file_date_updated":"2018-04-12T11:38:22Z","publication":"IWIA","file":[{"file_id":"2317","creator":"florida","file_size":255111,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T11:38:22Z","file_name":"IIAW-04.pdf","date_created":"2018-04-12T11:38:22Z","access_level":"open_access"}],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:33:37Z","date_updated":"2022-01-06T06:54:50Z","_id":"2123","urn":"21238","oa":"1","year":"2004","type":"conference","citation":{"short":"G. Ateniese, C. Riley, C. Scheideler, in: IWIA, 2004, pp. 33--47.","ieee":"G. Ateniese, C. Riley, and C. Scheideler, “Survivable Monitoring in Dynamic Networks,” in IWIA, 2004, pp. 33--47.","chicago":"Ateniese, Giuseppe, Chris Riley, and Christian Scheideler. “Survivable Monitoring in Dynamic Networks.” In IWIA, 33--47, 2004.","apa":"Ateniese, G., Riley, C., & Scheideler, C. (2004). Survivable Monitoring in Dynamic Networks. In IWIA (pp. 33--47).","ama":"Ateniese G, Riley C, Scheideler C. Survivable Monitoring in Dynamic Networks. In: IWIA. ; 2004:33--47.","mla":"Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.” IWIA, 2004, pp. 33--47.","bibtex":"@inproceedings{Ateniese_Riley_Scheideler_2004, title={Survivable Monitoring in Dynamic Networks}, booktitle={IWIA}, author={Ateniese, Giuseppe and Riley, Chris and Scheideler, Christian}, year={2004}, pages={33--47} }"},"page":"33--47"},{"oa":"1","urn":"21247","_id":"2124","date_updated":"2022-01-06T06:54:51Z","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","ddc":["040"],"title":"The hyperring: a low-congestion deterministic data structure for distributed environments","user_id":"15504","date_created":"2018-04-03T05:34:17Z","has_accepted_license":"1","status":"public","publication":"SODA","file_date_updated":"2018-04-13T08:36:08Z","department":[{"_id":"79"}],"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-13T08:36:08Z","content_type":"application/pdf","relation":"main_file","file_size":193831,"file_id":"2323","creator":"florida","access_level":"open_access","date_created":"2018-04-13T08:36:08Z","file_name":"SODA-04.pdf"}]},{"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).","bibtex":"@inproceedings{Awerbuch_Scheideler_2004, title={Consistent and compact data management in distributed storage systems}, booktitle={SPAA}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={44--53} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data Management in Distributed Storage Systems.” SPAA, 2004, pp. 44--53."},"year":"2004","type":"conference","page":"44--53","oa":"1","date_updated":"2022-01-06T06:54:51Z","_id":"2125","urn":"21256","has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:34:56Z","file":[{"file_size":170429,"creator":"florida","file_id":"2315","date_updated":"2018-04-12T09:41:38Z","content_type":"application/pdf","relation":"main_file","file_name":"AS-SPAA-04.pdf","date_created":"2018-04-12T09:41:38Z","access_level":"open_access"}],"author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publication":"SPAA","department":[{"_id":"79"}],"file_date_updated":"2018-04-12T09:41:38Z","user_id":"15504","title":"Consistent and compact data management in distributed storage systems","ddc":["040"]},{"user_id":"15504","title":"Pagoda: a dynamic overlay network for routing, data management, and multicasting","ddc":["040"],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:35:31Z","file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:40:42Z","file_id":"2314","creator":"florida","file_size":118175,"access_level":"open_access","file_name":"BKRST-SPAA-04.pdf","date_created":"2018-04-12T09:40:12Z"}],"author":[{"last_name":"Bhargava","first_name":"Ankur","full_name":"Bhargava, Ankur"},{"last_name":"Kothapalli","full_name":"Kothapalli, Kishore","first_name":"Kishore"},{"full_name":"Riley, Chris","first_name":"Chris","last_name":"Riley"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Thober","full_name":"Thober, Mark","first_name":"Mark"}],"publication":"SPAA","department":[{"_id":"79"}],"file_date_updated":"2018-04-12T09:40:42Z","oa":"1","date_updated":"2022-01-06T06:54:52Z","_id":"2126","urn":"21266","year":"2004","citation":{"mla":"Bhargava, Ankur, et al. “Pagoda: A Dynamic Overlay Network for Routing, Data Management, and Multicasting.” SPAA, 2004, pp. 170--179.","bibtex":"@inproceedings{Bhargava_Kothapalli_Riley_Scheideler_Thober_2004, title={Pagoda: a dynamic overlay network for routing, data management, and multicasting}, booktitle={SPAA}, author={Bhargava, Ankur and Kothapalli, Kishore and Riley, Chris and Scheideler, Christian and Thober, Mark}, year={2004}, pages={170--179} }","apa":"Bhargava, A., Kothapalli, K., Riley, C., Scheideler, C., & Thober, M. (2004). Pagoda: a dynamic overlay network for routing, data management, and multicasting. In SPAA (pp. 170--179).","ama":"Bhargava A, Kothapalli K, Riley C, Scheideler C, Thober M. Pagoda: a dynamic overlay network for routing, data management, and multicasting. In: SPAA. ; 2004:170--179.","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.","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.","short":"A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, M. Thober, in: SPAA, 2004, pp. 170--179."},"type":"conference","page":"170--179"},{"page":"286--293","type":"conference","year":"2004","citation":{"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.","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.","short":"A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, in: SPAA, ACM, 2004, pp. 286--293.","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."},"urn":"21276","_id":"2127","date_updated":"2022-01-06T06:54:52Z","oa":"1","publication":"SPAA","file_date_updated":"2018-04-12T09:21:24Z","department":[{"_id":"79"}],"publisher":"ACM","author":[{"full_name":"Bagchi, Amitabha","first_name":"Amitabha","last_name":"Bagchi"},{"full_name":"Bhargava, Ankur","first_name":"Ankur","last_name":"Bhargava"},{"first_name":"Amitabh","full_name":"Chaudhary, Amitabh","last_name":"Chaudhary"},{"full_name":"Eppstein, David","first_name":"David","last_name":"Eppstein"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file":[{"date_created":"2018-04-12T09:21:24Z","file_name":"BBCES-SPAA-04.pdf","access_level":"open_access","creator":"florida","file_id":"2313","file_size":197503,"relation":"main_file","date_updated":"2018-04-12T09:21:24Z","content_type":"application/pdf"}],"date_created":"2018-04-03T05:36:11Z","status":"public","has_accepted_license":"1","ddc":["040"],"title":"The effect of faults on network expansion","user_id":"15504"},{"title":"Storage Management as Means to cope with Exponential Information Growth","ddc":["000"],"user_id":"15415","abstract":[{"lang":"eng","text":"The advances in Internet technology have led to tremendous improvements in business, education, and science and have changed the way we think, live, and communicate. Information exchange has become ubiquitous by the possibilities offered through modern technologies. We are able to offer information 24 hours a day through our web sites and can leave messages every time and from anywhere in the world. This change in communication has led to new challenges. Enterprises have to deal with an information amount that doubles every year. The technological foundation to cope with this information explosion is given by Storage Area Networks (SANs), which are able to connect a great number of storage systems over a fast interconnection network. However, to be able to use the benefits of a SAN, an easy-to-use and efficient management support has to be given to the storage administrator. In this paper, we will suggest new storage management concepts and we will introduce a new management environment that is able to significantly reduce management costs and increases the performance and resource utilization of the given SAN infrastructure."}],"has_accepted_license":"1","status":"public","date_created":"2020-09-30T12:04:14Z","author":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"first_name":"Kay","full_name":"Salzwedel, Kay","last_name":"Salzwedel"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Brinkmann","first_name":"André","full_name":"Brinkmann, André"},{"last_name":"Vodisek","full_name":"Vodisek, Mario","first_name":"Mario"},{"last_name":"Rückert","full_name":"Rückert, Ulrich","first_name":"Ulrich"}],"file_date_updated":"2020-09-30T12:03:57Z","department":[{"_id":"63"},{"_id":"58"},{"_id":"79"}],"publication":"Proceedings of SSGRR 2003","file":[{"creator":"koala","file_id":"19793","file_size":499057,"success":1,"relation":"main_file","date_updated":"2020-09-30T12:03:57Z","content_type":"application/pdf","file_name":"pub-hni-908.pdf","date_created":"2020-09-30T12:03:57Z","access_level":"closed"}],"_id":"19790","date_updated":"2022-01-06T06:54:12Z","year":"2003","citation":{"apa":"Scheideler, C., Salzwedel, K., Meyer auf der Heide, F., Brinkmann, A., Vodisek, M., & Rückert, U. (2003). Storage Management as Means to cope with Exponential Information Growth. In Proceedings of SSGRR 2003.","ama":"Scheideler C, Salzwedel K, Meyer auf der Heide F, Brinkmann A, Vodisek M, Rückert U. Storage Management as Means to cope with Exponential Information Growth. In: Proceedings of SSGRR 2003. ; 2003.","chicago":"Scheideler, Christian, Kay Salzwedel, Friedhelm Meyer auf der Heide, André Brinkmann, Mario Vodisek, and Ulrich Rückert. “Storage Management as Means to Cope with Exponential Information Growth.” In Proceedings of SSGRR 2003, 2003.","bibtex":"@inproceedings{Scheideler_Salzwedel_Meyer auf der Heide_Brinkmann_Vodisek_Rückert_2003, title={Storage Management as Means to cope with Exponential Information Growth}, booktitle={Proceedings of SSGRR 2003}, author={Scheideler, Christian and Salzwedel, Kay and Meyer auf der Heide, Friedhelm and Brinkmann, André and Vodisek, Mario and Rückert, Ulrich}, year={2003} }","mla":"Scheideler, Christian, et al. “Storage Management as Means to Cope with Exponential Information Growth.” Proceedings of SSGRR 2003, 2003.","short":"C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, U. Rückert, in: Proceedings of SSGRR 2003, 2003.","ieee":"C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, and U. Rückert, “Storage Management as Means to cope with Exponential Information Growth,” in Proceedings of SSGRR 2003, 2003."},"type":"conference","language":[{"iso":"eng"}]},{"department":[{"_id":"79"},{"_id":"63"}],"publication":"ESA","publisher":"Springer","author":[{"first_name":"Valentina","full_name":"Damerow, Valentina","last_name":"Damerow"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Räcke","first_name":"Harald","full_name":"Räcke, Harald"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"}],"date_created":"2018-04-03T05:37:10Z","status":"public","volume":2832,"user_id":"14955","title":"Smoothed Motion Complexity","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"page":"161--171","type":"conference","year":"2003","citation":{"short":"V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, in: ESA, Springer, 2003, pp. 161--171.","ieee":"V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, and C. Sohler, “Smoothed Motion Complexity,” in ESA, 2003, vol. 2832, pp. 161--171.","ama":"Damerow V, Meyer auf der Heide F, Räcke H, Scheideler C, Sohler C. Smoothed Motion Complexity. In: ESA. Vol 2832. Lecture Notes in Computer Science. Springer; 2003:161--171. doi:10.1007/978-3-540-39658-1_17","apa":"Damerow, V., Meyer auf der Heide, F., Räcke, H., Scheideler, C., & Sohler, C. (2003). Smoothed Motion Complexity. In ESA (Vol. 2832, pp. 161--171). Springer. https://doi.org/10.1007/978-3-540-39658-1_17","chicago":"Damerow, Valentina, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, and Christian Sohler. “Smoothed Motion Complexity.” In ESA, 2832:161--171. Lecture Notes in Computer Science. Springer, 2003. https://doi.org/10.1007/978-3-540-39658-1_17.","bibtex":"@inproceedings{Damerow_Meyer auf der Heide_Räcke_Scheideler_Sohler_2003, series={Lecture Notes in Computer Science}, title={Smoothed Motion Complexity}, volume={2832}, DOI={10.1007/978-3-540-39658-1_17}, booktitle={ESA}, publisher={Springer}, author={Damerow, Valentina and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian}, year={2003}, pages={161--171}, collection={Lecture Notes in Computer Science} }","mla":"Damerow, Valentina, et al. “Smoothed Motion Complexity.” ESA, vol. 2832, Springer, 2003, pp. 161--171, doi:10.1007/978-3-540-39658-1_17."},"intvolume":" 2832","_id":"2128","date_updated":"2022-01-06T06:54:52Z","doi":"10.1007/978-3-540-39658-1_17"}]