[{"_id":"2120","intvolume":" 3142","urn":"21200","type":"conference","year":"2004","citation":{"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.","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.","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} }","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."},"page":"183--195","user_id":"15504","ddc":["040"],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:31:04Z","volume":3142,"file":[{"date_created":"2018-04-12T09:20:16Z","file_name":"ICALP-04.pdf","access_level":"open_access","file_size":145383,"creator":"florida","file_id":"2312","date_updated":"2018-04-12T09:20:16Z","content_type":"application/pdf","relation":"main_file"}],"author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publication":"ICALP","file_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"}]},{"date_updated":"2022-01-06T06:54:50Z","_id":"2121","urn":"21212","oa":"1","year":"2004","type":"conference","citation":{"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.","ieee":"C. Riley and C. Scheideler, “A Distributed Hash Table for Computational Grids,” in IPDPS, 2004.","short":"C. Riley, C. Scheideler, in: IPDPS, 2004."},"title":"A Distributed Hash Table for Computational Grids","ddc":["040"],"user_id":"15504","author":[{"first_name":"Chris","full_name":"Riley, Chris","last_name":"Riley"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"IPDPS","file_date_updated":"2018-04-12T09:50:26Z","department":[{"_id":"79"}],"file":[{"file_name":"IPDPS-04.pdf","date_created":"2018-04-12T09:50:26Z","access_level":"open_access","file_id":"2316","creator":"florida","file_size":91542,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:50:26Z"}],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:31:59Z"},{"file":[{"content_type":"application/pdf","date_updated":"2018-04-12T11:39:38Z","relation":"main_file","file_size":136987,"creator":"florida","file_id":"2318","access_level":"open_access","date_created":"2018-04-12T11:39:38Z","file_name":"IPTPS-04.pdf"}],"author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publication":"IPTPS","file_date_updated":"2018-04-12T11:39:38Z","has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:32:33Z","volume":3279,"user_id":"15504","ddc":["040"],"type":"conference","year":"2004","citation":{"short":"B. Awerbuch, C. Scheideler, in: IPTPS, 2004, pp. 237--249.","ieee":"B. Awerbuch and C. Scheideler, “Robust Distributed Name Service,” in IPTPS, 2004, vol. 3279, pp. 237--249.","apa":"Awerbuch, B., & Scheideler, C. (2004). Robust Distributed Name Service. In IPTPS (Vol. 3279, pp. 237--249).","ama":"Awerbuch B, Scheideler C. Robust Distributed Name Service. In: IPTPS. Vol 3279. Lecture Notes in Computer Science. ; 2004:237--249.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.” In IPTPS, 3279:237--249. Lecture Notes in Computer Science, 2004.","bibtex":"@inproceedings{Awerbuch_Scheideler_2004, series={Lecture Notes in Computer Science}, title={Robust Distributed Name Service}, volume={3279}, booktitle={IPTPS}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={237--249}, collection={Lecture Notes in Computer Science} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.” IPTPS, vol. 3279, 2004, pp. 237--249."},"page":"237--249","intvolume":" 3279","_id":"2122","urn":"21229","department":[{"_id":"79"}],"title":"Robust Distributed Name Service","series_title":"Lecture Notes in Computer Science","date_updated":"2022-01-06T06:54:50Z","oa":"1"},{"title":"Survivable Monitoring in Dynamic Networks","ddc":["040"],"user_id":"15504","author":[{"full_name":"Ateniese, Giuseppe","first_name":"Giuseppe","last_name":"Ateniese"},{"first_name":"Chris","full_name":"Riley, Chris","last_name":"Riley"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publication":"IWIA","department":[{"_id":"79"}],"file_date_updated":"2018-04-12T11:38:22Z","file":[{"access_level":"open_access","date_created":"2018-04-12T11:38:22Z","file_name":"IIAW-04.pdf","relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T11:38:22Z","file_id":"2317","creator":"florida","file_size":255111}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:33:37Z","_id":"2123","date_updated":"2022-01-06T06:54:50Z","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"},{"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:34:17Z","author":[{"first_name":"Baruch","full_name":"Awerbuch, Baruch","last_name":"Awerbuch"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file_date_updated":"2018-04-13T08:36:08Z","publication":"SODA","department":[{"_id":"79"}],"file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-13T08:36:08Z","file_id":"2323","creator":"florida","file_size":193831,"access_level":"open_access","date_created":"2018-04-13T08:36:08Z","file_name":"SODA-04.pdf"}],"ddc":["040"],"title":"The hyperring: a low-congestion deterministic data structure for distributed environments","user_id":"15504","year":"2004","type":"conference","citation":{"mla":"Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments.” SODA, 2004, pp. 318--327.","bibtex":"@inproceedings{Awerbuch_Scheideler_2004, title={The hyperring: a low-congestion deterministic data structure for distributed environments}, booktitle={SODA}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={318--327} }","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.","ieee":"B. Awerbuch and C. Scheideler, “The hyperring: a low-congestion deterministic data structure for distributed environments,” in SODA, 2004, pp. 318--327.","short":"B. Awerbuch, C. Scheideler, in: SODA, 2004, pp. 318--327."},"page":"318--327","oa":"1","_id":"2124","date_updated":"2022-01-06T06:54:51Z","urn":"21247"},{"page":"44--53","year":"2004","citation":{"ieee":"B. Awerbuch and C. Scheideler, “Consistent and compact data management in distributed storage systems,” in SPAA, 2004, pp. 44--53.","short":"B. Awerbuch, C. Scheideler, in: 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} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data Management in Distributed Storage Systems.” SPAA, 2004, pp. 44--53.","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).","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data Management in Distributed Storage Systems.” In SPAA, 44--53, 2004."},"type":"conference","urn":"21256","_id":"2125","date_updated":"2022-01-06T06:54:51Z","oa":"1","file":[{"access_level":"open_access","file_name":"AS-SPAA-04.pdf","date_created":"2018-04-12T09:41:38Z","relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:41:38Z","creator":"florida","file_id":"2315","file_size":170429}],"publication":"SPAA","file_date_updated":"2018-04-12T09:41:38Z","department":[{"_id":"79"}],"author":[{"first_name":"Baruch","full_name":"Awerbuch, Baruch","last_name":"Awerbuch"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2018-04-03T05:34:56Z","status":"public","has_accepted_license":"1","user_id":"15504","ddc":["040"],"title":"Consistent and compact data management in distributed storage systems"},{"page":"170--179","year":"2004","type":"conference","citation":{"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.","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."},"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":[{"file_size":118175,"creator":"florida","file_id":"2314","date_updated":"2018-04-12T09:40:42Z","content_type":"application/pdf","relation":"main_file","file_name":"BKRST-SPAA-04.pdf","date_created":"2018-04-12T09:40:12Z","access_level":"open_access"}],"file_date_updated":"2018-04-12T09:40:42Z","department":[{"_id":"79"}],"publication":"SPAA","author":[{"full_name":"Bhargava, Ankur","first_name":"Ankur","last_name":"Bhargava"},{"full_name":"Kothapalli, Kishore","first_name":"Kishore","last_name":"Kothapalli"},{"first_name":"Chris","full_name":"Riley, Chris","last_name":"Riley"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Thober, Mark","first_name":"Mark","last_name":"Thober"}],"user_id":"15504","title":"Pagoda: a dynamic overlay network for routing, data management, and multicasting","ddc":["040"]},{"user_id":"15504","title":"The effect of faults on network expansion","ddc":["040"],"file":[{"file_id":"2313","creator":"florida","file_size":197503,"relation":"main_file","date_updated":"2018-04-12T09:21:24Z","content_type":"application/pdf","date_created":"2018-04-12T09:21:24Z","file_name":"BBCES-SPAA-04.pdf","access_level":"open_access"}],"publication":"SPAA","file_date_updated":"2018-04-12T09:21:24Z","department":[{"_id":"79"}],"publisher":"ACM","author":[{"first_name":"Amitabha","full_name":"Bagchi, Amitabha","last_name":"Bagchi"},{"full_name":"Bhargava, Ankur","first_name":"Ankur","last_name":"Bhargava"},{"last_name":"Chaudhary","first_name":"Amitabh","full_name":"Chaudhary, Amitabh"},{"full_name":"Eppstein, David","first_name":"David","last_name":"Eppstein"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2018-04-03T05:36:11Z","status":"public","has_accepted_license":"1","urn":"21276","_id":"2127","date_updated":"2022-01-06T06:54:52Z","oa":"1","page":"286--293","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."},"type":"conference","year":"2004"},{"_id":"19790","date_updated":"2022-01-06T06:54:12Z","language":[{"iso":"eng"}],"year":"2003","type":"conference","citation":{"ieee":"C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, and U. Rückert, “Storage Management as Means to cope with Exponential Information Growth,” in Proceedings of SSGRR 2003, 2003.","short":"C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, U. Rückert, in: Proceedings of SSGRR 2003, 2003.","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.","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."},"user_id":"15415","ddc":["000"],"title":"Storage Management as Means to cope with Exponential Information Growth","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."}],"date_created":"2020-09-30T12:04:14Z","has_accepted_license":"1","status":"public","file":[{"file_name":"pub-hni-908.pdf","date_created":"2020-09-30T12:03:57Z","access_level":"closed","file_size":499057,"file_id":"19793","creator":"koala","content_type":"application/pdf","date_updated":"2020-09-30T12:03:57Z","success":1,"relation":"main_file"}],"department":[{"_id":"63"},{"_id":"58"},{"_id":"79"}],"file_date_updated":"2020-09-30T12:03:57Z","publication":"Proceedings of SSGRR 2003","author":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Salzwedel, Kay","first_name":"Kay","last_name":"Salzwedel"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Brinkmann","first_name":"André","full_name":"Brinkmann, André"},{"full_name":"Vodisek, Mario","first_name":"Mario","last_name":"Vodisek"},{"full_name":"Rückert, Ulrich","first_name":"Ulrich","last_name":"Rückert"}]},{"date_created":"2018-04-03T05:37:10Z","status":"public","volume":2832,"publication":"ESA","department":[{"_id":"79"},{"_id":"63"}],"author":[{"last_name":"Damerow","first_name":"Valentina","full_name":"Damerow, Valentina"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Räcke","full_name":"Räcke, Harald","first_name":"Harald"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"}],"publisher":"Springer","user_id":"14955","title":"Smoothed Motion Complexity","language":[{"iso":"eng"}],"page":"161--171","type":"conference","citation":{"short":"V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, in: ESA, Springer, 2003, pp. 161--171.","ieee":"V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, and C. Sohler, “Smoothed Motion Complexity,” in ESA, 2003, vol. 2832, pp. 161--171.","chicago":"Damerow, Valentina, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, and Christian Sohler. “Smoothed Motion Complexity.” In ESA, 2832:161--171. Lecture Notes in Computer Science. Springer, 2003. https://doi.org/10.1007/978-3-540-39658-1_17.","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","mla":"Damerow, Valentina, et al. “Smoothed Motion Complexity.” ESA, vol. 2832, Springer, 2003, pp. 161--171, doi:10.1007/978-3-540-39658-1_17.","bibtex":"@inproceedings{Damerow_Meyer auf der Heide_Räcke_Scheideler_Sohler_2003, series={Lecture Notes in Computer Science}, title={Smoothed Motion Complexity}, volume={2832}, DOI={10.1007/978-3-540-39658-1_17}, booktitle={ESA}, publisher={Springer}, author={Damerow, Valentina and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian}, year={2003}, pages={161--171}, collection={Lecture Notes in Computer Science} }"},"year":"2003","series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-540-39658-1_17","_id":"2128","intvolume":" 2832","date_updated":"2022-01-06T06:54:52Z"},{"department":[{"_id":"79"},{"_id":"63"}],"title":"Anycasting in Adversarial Systems: Routing and Admission Control","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:53Z","oa":"1","file":[{"file_name":"ICALP-03.pdf","date_created":"2018-04-12T09:04:48Z","access_level":"open_access","file_size":154427,"file_id":"2307","creator":"florida","content_type":"application/pdf","date_updated":"2018-04-12T09:04:48Z","relation":"main_file"}],"publisher":"Springer","author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"last_name":"Brinkmann","first_name":"André","full_name":"Brinkmann, André"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file_date_updated":"2018-04-12T09:04:48Z","publication":"ICALP","has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:38:36Z","volume":2719,"user_id":"14955","ddc":["040"],"citation":{"chicago":"Awerbuch, Baruch, André Brinkmann, and Christian Scheideler. “Anycasting in Adversarial Systems: Routing and Admission Control.” In ICALP, 2719:1153--1168. Lecture Notes in Computer Science. Springer, 2003.","apa":"Awerbuch, B., Brinkmann, A., & Scheideler, C. (2003). Anycasting in Adversarial Systems: Routing and Admission Control. In ICALP (Vol. 2719, pp. 1153--1168). Springer.","ama":"Awerbuch B, Brinkmann A, Scheideler C. Anycasting in Adversarial Systems: Routing and Admission Control. In: ICALP. Vol 2719. Lecture Notes in Computer Science. Springer; 2003:1153--1168.","bibtex":"@inproceedings{Awerbuch_Brinkmann_Scheideler_2003, series={Lecture Notes in Computer Science}, title={Anycasting in Adversarial Systems: Routing and Admission Control}, volume={2719}, booktitle={ICALP}, publisher={Springer}, author={Awerbuch, Baruch and Brinkmann, André and Scheideler, Christian}, year={2003}, pages={1153--1168}, collection={Lecture Notes in Computer Science} }","mla":"Awerbuch, Baruch, et al. “Anycasting in Adversarial Systems: Routing and Admission Control.” ICALP, vol. 2719, Springer, 2003, pp. 1153--1168.","short":"B. Awerbuch, A. Brinkmann, C. Scheideler, in: ICALP, Springer, 2003, pp. 1153--1168.","ieee":"B. Awerbuch, A. Brinkmann, and C. Scheideler, “Anycasting in Adversarial Systems: Routing and Admission Control,” in ICALP, 2003, vol. 2719, pp. 1153--1168."},"type":"conference","year":"2003","page":"1153--1168","_id":"2129","intvolume":" 2719","urn":"21297"},{"title":"Peer-to-peer systems for prefix search","ddc":["040"],"user_id":"15504","file_date_updated":"2018-04-12T09:10:10Z","publication":"PODC","department":[{"_id":"79"}],"author":[{"last_name":"Awerbuch","full_name":"Awerbuch, Baruch","first_name":"Baruch"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publisher":"ACM","file":[{"access_level":"open_access","file_name":"PODC-03.pdf","date_created":"2018-04-12T09:10:10Z","date_updated":"2018-04-12T09:10:10Z","content_type":"application/pdf","relation":"main_file","file_size":127013,"creator":"florida","file_id":"2308"}],"date_created":"2018-04-03T05:39:48Z","status":"public","has_accepted_license":"1","urn":"21303","date_updated":"2022-01-06T06:54:53Z","_id":"2130","oa":"1","page":"123--132","year":"2003","type":"conference","citation":{"short":"B. Awerbuch, C. Scheideler, in: PODC, ACM, 2003, pp. 123--132.","ieee":"B. Awerbuch and C. Scheideler, “Peer-to-peer systems for prefix search,” in PODC, 2003, pp. 123--132.","ama":"Awerbuch B, Scheideler C. Peer-to-peer systems for prefix search. In: PODC. ACM; 2003:123--132.","apa":"Awerbuch, B., & Scheideler, C. (2003). Peer-to-peer systems for prefix search. In PODC (pp. 123--132). ACM.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” In PODC, 123--132. ACM, 2003.","bibtex":"@inproceedings{Awerbuch_Scheideler_2003, title={Peer-to-peer systems for prefix search}, booktitle={PODC}, publisher={ACM}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2003}, pages={123--132} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” PODC, ACM, 2003, pp. 123--132."}},{"_id":"2131","intvolume":" 2764","urn":"21313","year":"2003","citation":{"ieee":"A. Czumaj, C. Riley, and C. Scheideler, “Perfectly Balanced Allocation,” in RANDOM-APPROX, 2003, vol. 2764, pp. 240--251.","short":"A. Czumaj, C. Riley, C. Scheideler, in: RANDOM-APPROX, Springer, 2003, pp. 240--251.","mla":"Czumaj, Artur, et al. “Perfectly Balanced Allocation.” RANDOM-APPROX, vol. 2764, Springer, 2003, pp. 240--251.","bibtex":"@inproceedings{Czumaj_Riley_Scheideler_2003, series={Lecture Notes in Computer Science}, title={Perfectly Balanced Allocation}, volume={2764}, booktitle={RANDOM-APPROX}, publisher={Springer}, author={Czumaj, Artur and Riley, Chris and Scheideler, Christian}, year={2003}, pages={240--251}, collection={Lecture Notes in Computer Science} }","apa":"Czumaj, A., Riley, C., & Scheideler, C. (2003). Perfectly Balanced Allocation. In RANDOM-APPROX (Vol. 2764, pp. 240--251). Springer.","ama":"Czumaj A, Riley C, Scheideler C. Perfectly Balanced Allocation. In: RANDOM-APPROX. Vol 2764. Lecture Notes in Computer Science. Springer; 2003:240--251.","chicago":"Czumaj, Artur, Chris Riley, and Christian Scheideler. “Perfectly Balanced Allocation.” In RANDOM-APPROX, 2764:240--251. Lecture Notes in Computer Science. Springer, 2003."},"type":"conference","page":"240--251","ddc":["040"],"user_id":"15504","volume":2764,"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:41:01Z","author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"full_name":"Riley, Chris","first_name":"Chris","last_name":"Riley"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publisher":"Springer","publication":"RANDOM-APPROX","file_date_updated":"2018-04-12T09:16:17Z","file":[{"access_level":"open_access","file_name":"RANDOM-03.pdf","date_created":"2018-04-12T09:16:17Z","content_type":"application/pdf","date_updated":"2018-04-12T09:16:17Z","relation":"main_file","file_size":112587,"creator":"florida","file_id":"2310"}],"oa":"1","date_updated":"2022-01-06T06:54:54Z","series_title":"Lecture Notes in Computer Science","title":"Perfectly Balanced Allocation","department":[{"_id":"79"}]},{"ddc":["040"],"title":"On local algorithms for topology control and routing in ad hoc networks","user_id":"15504","status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:41:53Z","publisher":"ACM","author":[{"last_name":"Jia","first_name":"Lujun","full_name":"Jia, Lujun"},{"full_name":"Rajaraman, Rajmohan","first_name":"Rajmohan","last_name":"Rajaraman"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"department":[{"_id":"79"}],"file_date_updated":"2018-04-12T09:18:55Z","publication":"SPAA","file":[{"date_updated":"2018-04-12T09:18:55Z","content_type":"application/pdf","relation":"main_file","file_size":224200,"creator":"florida","file_id":"2311","access_level":"open_access","file_name":"JRS-SPAA-03.pdf","date_created":"2018-04-12T09:18:55Z"}],"oa":"1","_id":"2132","date_updated":"2022-01-06T06:54:54Z","urn":"21320","citation":{"short":"L. Jia, R. Rajaraman, C. Scheideler, in: SPAA, ACM, 2003, pp. 220--229.","ieee":"L. Jia, R. Rajaraman, and C. Scheideler, “On local algorithms for topology control and routing in ad hoc networks,” in SPAA, 2003, pp. 220--229.","apa":"Jia, L., Rajaraman, R., & Scheideler, C. (2003). On local algorithms for topology control and routing in ad hoc networks. In SPAA (pp. 220--229). ACM.","ama":"Jia L, Rajaraman R, Scheideler C. On local algorithms for topology control and routing in ad hoc networks. In: SPAA. ACM; 2003:220--229.","chicago":"Jia, Lujun, Rajmohan Rajaraman, and Christian Scheideler. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” In SPAA, 220--229. ACM, 2003.","mla":"Jia, Lujun, et al. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” SPAA, ACM, 2003, pp. 220--229.","bibtex":"@inproceedings{Jia_Rajaraman_Scheideler_2003, title={On local algorithms for topology control and routing in ad hoc networks}, booktitle={SPAA}, publisher={ACM}, author={Jia, Lujun and Rajaraman, Rajmohan and Scheideler, Christian}, year={2003}, pages={220--229} }"},"year":"2003","type":"conference","page":"220--229"},{"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:42:48Z","publisher":"ACM","author":[{"last_name":"Kothapalli","full_name":"Kothapalli, Kishore","first_name":"Kishore"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file_date_updated":"2018-04-12T09:15:24Z","department":[{"_id":"79"}],"publication":"SPAA","file":[{"creator":"florida","file_id":"2309","file_size":121448,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:15:24Z","date_created":"2018-04-12T09:13:43Z","file_name":"KS-SPAA-03.pdf","access_level":"open_access"}],"ddc":["040"],"title":"Information gathering in adversarial systems: lines and cycles","user_id":"15504","type":"conference","year":"2003","citation":{"ama":"Kothapalli K, Scheideler C. Information gathering in adversarial systems: lines and cycles. In: SPAA. ACM; 2003:333--342.","apa":"Kothapalli, K., & Scheideler, C. (2003). Information gathering in adversarial systems: lines and cycles. In SPAA (pp. 333--342). ACM.","chicago":"Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial Systems: Lines and Cycles.” In SPAA, 333--342. ACM, 2003.","mla":"Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial Systems: Lines and Cycles.” SPAA, ACM, 2003, pp. 333--342.","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} }","short":"K. Kothapalli, C. Scheideler, in: SPAA, ACM, 2003, pp. 333--342.","ieee":"K. Kothapalli and C. Scheideler, “Information gathering in adversarial systems: lines and cycles,” in SPAA, 2003, pp. 333--342."},"page":"333--342","oa":"1","_id":"2133","date_updated":"2022-01-06T06:54:55Z","urn":"21338"},{"title":"Improved Bounds for Acyclic Job Shop Scheduling","user_id":"15504","author":[{"last_name":"Feige","full_name":"Feige, Uriel","first_name":"Uriel"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"department":[{"_id":"79"}],"publication":"Combinatorica","status":"public","date_created":"2018-04-03T05:43:36Z","date_updated":"2022-01-06T06:54:55Z","_id":"2134","doi":"10.1007/s004930200018","issue":"3","citation":{"ieee":"U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling,” Combinatorica, no. 3, pp. 361--399, 2002.","short":"U. Feige, C. Scheideler, Combinatorica (2002) 361--399.","bibtex":"@article{Feige_Scheideler_2002, title={Improved Bounds for Acyclic Job Shop Scheduling}, DOI={10.1007/s004930200018}, number={3}, journal={Combinatorica}, author={Feige, Uriel and Scheideler, Christian}, year={2002}, pages={361--399} }","mla":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling.” Combinatorica, no. 3, 2002, pp. 361--399, doi:10.1007/s004930200018.","apa":"Feige, U., & Scheideler, C. (2002). Improved Bounds for Acyclic Job Shop Scheduling. Combinatorica, (3), 361--399. https://doi.org/10.1007/s004930200018","ama":"Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling. Combinatorica. 2002;(3):361--399. doi:10.1007/s004930200018","chicago":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling.” Combinatorica, no. 3 (2002): 361--399. https://doi.org/10.1007/s004930200018."},"type":"journal_article","year":"2002","page":"361--399"},{"urn":"21357","date_updated":"2022-01-06T06:54:55Z","_id":"2135","oa":"1","page":"184--193","citation":{"ama":"Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem. In: SODA. ACM/SIAM; 2002:184--193.","apa":"Kolman, P., & Scheideler, C. (2002). Improved bounds for the unsplittable flow problem. In SODA (pp. 184--193). ACM/SIAM.","chicago":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” In SODA, 184--193. ACM/SIAM, 2002.","bibtex":"@inproceedings{Kolman_Scheideler_2002, title={Improved bounds for the unsplittable flow problem}, booktitle={SODA}, publisher={ACM/SIAM}, author={Kolman, Petr and Scheideler, Christian}, year={2002}, pages={184--193} }","mla":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” SODA, ACM/SIAM, 2002, pp. 184--193.","short":"P. Kolman, C. Scheideler, in: SODA, ACM/SIAM, 2002, pp. 184--193.","ieee":"P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,” in SODA, 2002, pp. 184--193."},"year":"2002","type":"conference","title":"Improved bounds for the unsplittable flow problem","ddc":["040"],"user_id":"15504","file_date_updated":"2018-04-12T08:59:58Z","publication":"SODA","department":[{"_id":"79"}],"author":[{"last_name":"Kolman","full_name":"Kolman, Petr","first_name":"Petr"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"ACM/SIAM","file":[{"date_updated":"2018-04-12T08:59:58Z","content_type":"application/pdf","relation":"main_file","file_size":246604,"creator":"florida","file_id":"2303","access_level":"open_access","date_created":"2018-04-12T08:59:58Z","file_name":"SODA-02.pdf"}],"date_created":"2018-04-03T05:44:11Z","status":"public","has_accepted_license":"1"},{"ddc":["040"],"title":"Compact, adaptive placement schemes for non-uniform requirements","user_id":"14955","file_date_updated":"2018-04-12T09:02:22Z","publication":"SPAA","department":[{"_id":"79"},{"_id":"63"}],"author":[{"last_name":"Brinkmann","first_name":"André","full_name":"Brinkmann, André"},{"last_name":"Salzwedel","first_name":"Kay","full_name":"Salzwedel, Kay"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file":[{"date_updated":"2018-04-12T09:02:22Z","content_type":"application/pdf","relation":"main_file","file_size":123373,"file_id":"2305","creator":"florida","access_level":"open_access","file_name":"BSS-SPAA-02.pdf","date_created":"2018-04-12T09:02:22Z"}],"date_created":"2018-04-03T05:44:56Z","status":"public","has_accepted_license":"1","urn":"21366","_id":"2136","date_updated":"2022-01-06T06:54:56Z","oa":"1","page":"53--62","year":"2002","citation":{"bibtex":"@inproceedings{Brinkmann_Salzwedel_Scheideler_2002, title={Compact, adaptive placement schemes for non-uniform requirements}, booktitle={SPAA}, author={Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}, year={2002}, pages={53--62} }","mla":"Brinkmann, André, et al. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” SPAA, 2002, pp. 53--62.","chicago":"Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” In SPAA, 53--62, 2002.","apa":"Brinkmann, A., Salzwedel, K., & Scheideler, C. (2002). Compact, adaptive placement schemes for non-uniform requirements. In SPAA (pp. 53--62).","ama":"Brinkmann A, Salzwedel K, Scheideler C. Compact, adaptive placement schemes for non-uniform requirements. In: SPAA. ; 2002:53--62.","ieee":"A. Brinkmann, K. Salzwedel, and C. Scheideler, “Compact, adaptive placement schemes for non-uniform requirements,” in SPAA, 2002, pp. 53--62.","short":"A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2002, pp. 53--62."},"type":"conference","language":[{"iso":"eng"}]},{"oa":"1","date_updated":"2022-01-06T06:54:57Z","_id":"2137","urn":"21376","year":"2002","type":"conference","citation":{"short":"A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, in: SPAA, 2002, pp. 265--274.","ieee":"A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, “Algorithms for fault-tolerant routing in circuit switched networks,” in SPAA, 2002, pp. 265--274.","apa":"Bagchi, A., Chaudhary, A., Scheideler, C., & Kolman, P. (2002). Algorithms for fault-tolerant routing in circuit switched networks. In SPAA (pp. 265--274).","ama":"Bagchi A, Chaudhary A, Scheideler C, Kolman P. Algorithms for fault-tolerant routing in circuit switched networks. In: SPAA. ; 2002:265--274.","chicago":"Bagchi, Amitabha, Amitabh Chaudhary, Christian Scheideler, and Petr Kolman. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” In SPAA, 265--274, 2002.","bibtex":"@inproceedings{Bagchi_Chaudhary_Scheideler_Kolman_2002, title={Algorithms for fault-tolerant routing in circuit switched networks}, booktitle={SPAA}, author={Bagchi, Amitabha and Chaudhary, Amitabh and Scheideler, Christian and Kolman, Petr}, year={2002}, pages={265--274} }","mla":"Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” SPAA, 2002, pp. 265--274."},"page":"265--274","ddc":["040"],"title":"Algorithms for fault-tolerant routing in circuit switched networks","user_id":"15504","has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:45:44Z","author":[{"last_name":"Bagchi","full_name":"Bagchi, Amitabha","first_name":"Amitabha"},{"last_name":"Chaudhary","full_name":"Chaudhary, Amitabh","first_name":"Amitabh"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"first_name":"Petr","full_name":"Kolman, Petr","last_name":"Kolman"}],"file_date_updated":"2018-04-12T09:03:44Z","department":[{"_id":"79"}],"publication":"SPAA","file":[{"file_size":187124,"file_id":"2306","creator":"florida","date_updated":"2018-04-12T09:03:44Z","content_type":"application/pdf","relation":"main_file","file_name":"BCKS-SPAA-02.pdf","date_created":"2018-04-12T09:03:44Z","access_level":"open_access"}]},{"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:46:38Z","volume":2285,"file":[{"access_level":"open_access","date_created":"2018-04-12T09:01:03Z","file_name":"STACS-02.pdf","content_type":"application/pdf","date_updated":"2018-04-12T09:01:03Z","relation":"main_file","file_size":273875,"creator":"florida","file_id":"2304"}],"author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publisher":"Springer","publication":"STACS","file_date_updated":"2018-04-12T09:01:03Z","user_id":"15504","ddc":["040"],"type":"conference","year":"2002","citation":{"ieee":"C. Scheideler, “Models and Techniques for Communication in Dynamic Networks,” in STACS, 2002, vol. 2285, pp. 27--49.","short":"C. Scheideler, in: STACS, Springer, 2002, pp. 27--49.","bibtex":"@inproceedings{Scheideler_2002, series={Lecture Notes in Computer Science}, title={Models and Techniques for Communication in Dynamic Networks}, volume={2285}, booktitle={STACS}, publisher={Springer}, author={Scheideler, Christian}, year={2002}, pages={27--49}, collection={Lecture Notes in Computer Science} }","mla":"Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” STACS, vol. 2285, Springer, 2002, pp. 27--49.","chicago":"Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” In STACS, 2285:27--49. Lecture Notes in Computer Science. Springer, 2002.","apa":"Scheideler, C. (2002). Models and Techniques for Communication in Dynamic Networks. In STACS (Vol. 2285, pp. 27--49). Springer.","ama":"Scheideler C. Models and Techniques for Communication in Dynamic Networks. In: STACS. Vol 2285. Lecture Notes in Computer Science. Springer; 2002:27--49."},"page":"27--49","intvolume":" 2285","_id":"2138","urn":"21386","department":[{"_id":"79"}],"title":"Models and Techniques for Communication in Dynamic Networks","series_title":"Lecture Notes in Computer Science","oa":"1","date_updated":"2022-01-06T06:54:57Z"}]