[{"author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publication":"6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007","department":[{"_id":"79"}],"file_date_updated":"2018-04-13T10:00:55Z","file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-13T10:00:55Z","creator":"florida","file_id":"2338","file_size":191943,"access_level":"open_access","file_name":"IPTPS07.pdf","date_created":"2018-04-13T10:00:55Z"}],"has_accepted_license":"1","status":"public","date_created":"2018-03-29T11:55:52Z","ddc":["040"],"title":"Towards Scalable and Robust Overlay Networks","user_id":"15504","type":"conference","year":"2007","citation":{"ieee":"B. Awerbuch and C. Scheideler, “Towards Scalable and Robust Overlay Networks,” in 6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.","short":"B. Awerbuch, C. Scheideler, in: 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.","mla":"Awerbuch, Baruch, and Christian Scheideler. “Towards Scalable and Robust Overlay Networks.” 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.","bibtex":"@inproceedings{Awerbuch_Scheideler_2007, title={Towards Scalable and Robust Overlay Networks}, booktitle={6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2007} }","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Towards Scalable and Robust Overlay Networks.” In 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.","apa":"Awerbuch, B., & Scheideler, C. (2007). Towards Scalable and Robust Overlay Networks. In 6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007.","ama":"Awerbuch B, Scheideler C. Towards Scalable and Robust Overlay Networks. In: 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007. ; 2007."},"date_updated":"2022-01-06T06:54:23Z","_id":"2022","urn":"20228","oa":"1"},{"publication_identifier":{"isbn":["978-1-59593-616-5"]},"department":[{"_id":"79"}],"title":"A denial-of-service resistant DHT","oa":"1","doi":"10.1145/1281100.1281178","date_updated":"2022-01-06T06:54:24Z","date_created":"2018-03-29T11:56:35Z","has_accepted_license":"1","status":"public","file":[{"content_type":"application/pdf","date_updated":"2018-04-13T10:02:18Z","relation":"main_file","file_size":193097,"file_id":"2340","creator":"florida","access_level":"open_access","file_name":"DISC-07.pdf","date_created":"2018-04-13T10:02:18Z"}],"publication":"Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007","file_date_updated":"2018-04-13T10:02:18Z","publisher":"ACM","author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"user_id":"15504","ddc":["040"],"page":"370--371","citation":{"bibtex":"@inproceedings{Awerbuch_Scheideler_2007, title={A denial-of-service resistant DHT}, DOI={10.1145/1281100.1281178}, booktitle={Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007}, publisher={ACM}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2007}, pages={370--371} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.” Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, ACM, 2007, pp. 370--371, doi:10.1145/1281100.1281178.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.” In Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, 370--371. ACM, 2007. https://doi.org/10.1145/1281100.1281178.","apa":"Awerbuch, B., & Scheideler, C. (2007). A denial-of-service resistant DHT. In Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007 (pp. 370--371). ACM. https://doi.org/10.1145/1281100.1281178","ama":"Awerbuch B, Scheideler C. A denial-of-service resistant DHT. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007. ACM; 2007:370--371. doi:10.1145/1281100.1281178","ieee":"B. Awerbuch and C. Scheideler, “A denial-of-service resistant DHT,” in Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, 2007, pp. 370--371.","short":"B. Awerbuch, C. Scheideler, in: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, ACM, 2007, pp. 370--371."},"year":"2007","type":"conference","urn":"20237","_id":"2023"},{"publisher":"Springer","author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"department":[{"_id":"79"}],"publication":"Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings","volume":4731,"publication_identifier":{"isbn":["978-3-540-75141-0"]},"status":"public","date_created":"2018-03-29T11:57:42Z","title":"A Denial-of-Service Resistant DHT","user_id":"15504","series_title":"Lecture Notes in Computer Science","type":"conference","year":"2007","citation":{"chicago":"Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.” In Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, 4731:33--47. Lecture Notes in Computer Science. Springer, 2007. https://doi.org/10.1007/978-3-540-75142-7_6.","apa":"Awerbuch, B., & Scheideler, C. (2007). A Denial-of-Service Resistant DHT. In Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings (Vol. 4731, pp. 33--47). Springer. https://doi.org/10.1007/978-3-540-75142-7_6","ama":"Awerbuch B, Scheideler C. A Denial-of-Service Resistant DHT. In: Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings. Vol 4731. Lecture Notes in Computer Science. Springer; 2007:33--47. doi:10.1007/978-3-540-75142-7_6","mla":"Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.” Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, vol. 4731, Springer, 2007, pp. 33--47, doi:10.1007/978-3-540-75142-7_6.","bibtex":"@inproceedings{Awerbuch_Scheideler_2007, series={Lecture Notes in Computer Science}, title={A Denial-of-Service Resistant DHT}, volume={4731}, DOI={10.1007/978-3-540-75142-7_6}, booktitle={Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings}, publisher={Springer}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2007}, pages={33--47}, collection={Lecture Notes in Computer Science} }","short":"B. Awerbuch, C. Scheideler, in: Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, Springer, 2007, pp. 33--47.","ieee":"B. Awerbuch and C. Scheideler, “A Denial-of-Service Resistant DHT,” in Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, 2007, vol. 4731, pp. 33--47."},"page":"33--47","date_updated":"2022-01-06T06:54:24Z","_id":"2024","intvolume":" 4731","doi":"10.1007/978-3-540-75142-7_6"},{"department":[{"_id":"79"}],"publication":"Handbook of Approximation Algorithms and Metaheuristics.","author":[{"last_name":"W. Richa","full_name":"W. Richa, Andrea","first_name":"Andrea"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2018-03-29T12:00:39Z","status":"public","publication_identifier":{"isbn":["978-1-58488-550-4"]},"user_id":"15504","title":"Overlay Networks for Peer-to-Peer Networks","year":"2007","citation":{"ieee":"A. W. Richa and C. Scheideler, “Overlay Networks for Peer-to-Peer Networks,” in Handbook of Approximation Algorithms and Metaheuristics., 2007.","short":"A. W. Richa, C. Scheideler, in: Handbook of Approximation Algorithms and Metaheuristics., 2007.","mla":"W. Richa, Andrea, and Christian Scheideler. “Overlay Networks for Peer-to-Peer Networks.” Handbook of Approximation Algorithms and Metaheuristics., 2007, doi:10.1201/9781420010749.ch72.","bibtex":"@inbook{W. Richa_Scheideler_2007, title={Overlay Networks for Peer-to-Peer Networks}, DOI={10.1201/9781420010749.ch72}, booktitle={Handbook of Approximation Algorithms and Metaheuristics.}, author={W. Richa, Andrea and Scheideler, Christian}, year={2007} }","chicago":"W. Richa, Andrea, and Christian Scheideler. “Overlay Networks for Peer-to-Peer Networks.” In Handbook of Approximation Algorithms and Metaheuristics., 2007. https://doi.org/10.1201/9781420010749.ch72.","apa":"W. Richa, A., & Scheideler, C. (2007). Overlay Networks for Peer-to-Peer Networks. In Handbook of Approximation Algorithms and Metaheuristics. https://doi.org/10.1201/9781420010749.ch72","ama":"W. Richa A, Scheideler C. Overlay Networks for Peer-to-Peer Networks. In: Handbook of Approximation Algorithms and Metaheuristics. ; 2007. doi:10.1201/9781420010749.ch72"},"type":"book_chapter","_id":"2028","date_updated":"2022-01-06T06:54:25Z","doi":"10.1201/9781420010749.ch72"},{"abstract":[{"lang":"eng","text":"We present a randomized block-level storage virtualization for arbitrary heterogeneous storage systems that can distribute data in a fair and redundant way and can adapt this distribution in an efficient way as storage devices enter or leave the system. More precisely, our virtualization strategies can distribute a set of data blocks among a set of storage devices of arbitrary non-uniform capacities so that a storage device representing x% of the capacity in the system will get x% of the data (as long as this is in principle possible) and the different copies of each data block are stored so that no two copies of a data block are located in the same device. Achieving these two properties is not easy, and no virtualization strategy has been presented so far that has been formally shown to satisfy fairness and redundancy while being time- and space-eflcient and allowing an efficient adaptation to a changing set of devices."}],"title":"Dynamic and redundant data placement","ddc":["040"],"user_id":"15415","author":[{"first_name":"André","full_name":"Brinkmann, André","last_name":"Brinkmann"},{"full_name":"Effert, Sascha","first_name":"Sascha","last_name":"Effert"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"IEEE International Conference on Distributed Computing Systems (ICDCS)","file_date_updated":"2018-04-13T10:01:42Z","file":[{"file_size":164121,"file_id":"2339","creator":"florida","content_type":"application/pdf","date_updated":"2018-04-13T10:01:42Z","relation":"main_file","date_created":"2018-04-13T10:01:42Z","file_name":"ICDCS07.pdf","access_level":"open_access"}],"has_accepted_license":"1","status":"public","date_created":"2018-04-05T07:08:35Z","_id":"2214","date_updated":"2022-01-06T06:55:27Z","urn":"22147","oa":"1","type":"conference","year":"2007","citation":{"chicago":"Brinkmann, André, Sascha Effert, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Dynamic and Redundant Data Placement.” In IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.","ama":"Brinkmann A, Effert S, Meyer auf der Heide F, Scheideler C. Dynamic and redundant data placement. In: IEEE International Conference on Distributed Computing Systems (ICDCS). ; 2007.","apa":"Brinkmann, A., Effert, S., Meyer auf der Heide, F., & Scheideler, C. (2007). Dynamic and redundant data placement. IEEE International Conference on Distributed Computing Systems (ICDCS).","mla":"Brinkmann, André, et al. “Dynamic and Redundant Data Placement.” IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.","bibtex":"@inproceedings{Brinkmann_Effert_Meyer auf der Heide_Scheideler_2007, title={Dynamic and redundant data placement}, booktitle={IEEE International Conference on Distributed Computing Systems (ICDCS)}, author={Brinkmann, André and Effert, Sascha and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2007} }","short":"A. Brinkmann, S. Effert, F. Meyer auf der Heide, C. Scheideler, in: IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.","ieee":"A. Brinkmann, S. Effert, F. Meyer auf der Heide, and C. Scheideler, “Dynamic and redundant data placement,” 2007."},"language":[{"iso":"eng"}]},{"doi":"10.1145/1273445.1273449","date_updated":"2022-01-06T06:55:25Z","_id":"2209","type":"journal_article","citation":{"short":"V. Aggarwal, A. Feldmann, C. Scheideler, ACM Computer Commucation Review (2007).","ieee":"V. Aggarwal, A. Feldmann, and C. Scheideler, “Can ISPs and P2P users cooperate for improved performance?,” ACM Computer Commucation Review, 2007.","ama":"Aggarwal V, Feldmann A, Scheideler C. Can ISPs and P2P users cooperate for improved performance? ACM Computer Commucation Review. 2007. doi:10.1145/1273445.1273449","apa":"Aggarwal, V., Feldmann, A., & Scheideler, C. (2007). Can ISPs and P2P users cooperate for improved performance? ACM Computer Commucation Review. https://doi.org/10.1145/1273445.1273449","chicago":"Aggarwal, Vinay, Anja Feldmann, and Christian Scheideler. “Can ISPs and P2P Users Cooperate for Improved Performance?” ACM Computer Commucation Review, 2007. https://doi.org/10.1145/1273445.1273449.","mla":"Aggarwal, Vinay, et al. “Can ISPs and P2P Users Cooperate for Improved Performance?” ACM Computer Commucation Review, 2007, doi:10.1145/1273445.1273449.","bibtex":"@article{Aggarwal_Feldmann_Scheideler_2007, title={Can ISPs and P2P users cooperate for improved performance?}, DOI={10.1145/1273445.1273449}, journal={ACM Computer Commucation Review}, author={Aggarwal, Vinay and Feldmann, Anja and Scheideler, Christian}, year={2007} }"},"year":"2007","title":"Can ISPs and P2P users cooperate for improved performance?","user_id":"15504","date_created":"2018-04-05T06:08:43Z","status":"public","department":[{"_id":"79"}],"publication":"ACM Computer Commucation Review","author":[{"last_name":"Aggarwal","full_name":"Aggarwal, Vinay","first_name":"Vinay"},{"full_name":"Feldmann, Anja","first_name":"Anja","last_name":"Feldmann"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}]},{"doi":"10.1016/j.jalgor.2004.07.006","issue":"1","date_updated":"2022-01-06T06:54:25Z","_id":"2029","intvolume":" 61","page":"20--44","year":"2006","type":"journal_article","citation":{"ieee":"P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,” J. Algorithms, vol. 61, no. 1, pp. 20--44, 2006.","short":"P. Kolman, C. Scheideler, J. Algorithms 61 (2006) 20--44.","mla":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” J. Algorithms, vol. 61, no. 1, 2006, pp. 20--44, doi:10.1016/j.jalgor.2004.07.006.","bibtex":"@article{Kolman_Scheideler_2006, title={Improved bounds for the unsplittable flow problem}, volume={61}, DOI={10.1016/j.jalgor.2004.07.006}, number={1}, journal={J. Algorithms}, author={Kolman, Petr and Scheideler, Christian}, year={2006}, pages={20--44} }","ama":"Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem. J Algorithms. 2006;61(1):20--44. doi:10.1016/j.jalgor.2004.07.006","apa":"Kolman, P., & Scheideler, C. (2006). Improved bounds for the unsplittable flow problem. J. Algorithms, 61(1), 20--44. https://doi.org/10.1016/j.jalgor.2004.07.006","chicago":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” J. Algorithms 61, no. 1 (2006): 20--44. https://doi.org/10.1016/j.jalgor.2004.07.006."},"title":"Improved bounds for the unsplittable flow problem","user_id":"15504","volume":61,"date_created":"2018-03-29T12:01:37Z","status":"public","department":[{"_id":"79"}],"publication":"J. Algorithms","author":[{"full_name":"Kolman, Petr","first_name":"Petr","last_name":"Kolman"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}]},{"title":"Survivable Monitoring in Dynamic Networks","user_id":"15504","publication":"IEEE Trans. Mob. Comput.","department":[{"_id":"79"}],"author":[{"full_name":"Ateniese, Giuseppe","first_name":"Giuseppe","last_name":"Ateniese"},{"last_name":"Riley","full_name":"Riley, Chris","first_name":"Chris"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2018-04-03T05:21:30Z","status":"public","date_updated":"2022-01-06T06:54:45Z","_id":"2110","doi":"10.1109/TMC.2006.138","issue":"9","page":"1242--1254","year":"2006","type":"journal_article","citation":{"chicago":"Ateniese, Giuseppe, Chris Riley, and Christian Scheideler. “Survivable Monitoring in Dynamic Networks.” IEEE Trans. Mob. Comput., no. 9 (2006): 1242--1254. https://doi.org/10.1109/TMC.2006.138.","ama":"Ateniese G, Riley C, Scheideler C. Survivable Monitoring in Dynamic Networks. IEEE Trans Mob Comput. 2006;(9):1242--1254. doi:10.1109/TMC.2006.138","apa":"Ateniese, G., Riley, C., & Scheideler, C. (2006). Survivable Monitoring in Dynamic Networks. IEEE Trans. Mob. Comput., (9), 1242--1254. https://doi.org/10.1109/TMC.2006.138","bibtex":"@article{Ateniese_Riley_Scheideler_2006, title={Survivable Monitoring in Dynamic Networks}, DOI={10.1109/TMC.2006.138}, number={9}, journal={IEEE Trans. Mob. Comput.}, author={Ateniese, Giuseppe and Riley, Chris and Scheideler, Christian}, year={2006}, pages={1242--1254} }","mla":"Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.” IEEE Trans. Mob. Comput., no. 9, 2006, pp. 1242--1254, doi:10.1109/TMC.2006.138.","short":"G. Ateniese, C. Riley, C. Scheideler, IEEE Trans. Mob. Comput. (2006) 1242--1254.","ieee":"G. Ateniese, C. Riley, and C. Scheideler, “Survivable Monitoring in Dynamic Networks,” IEEE Trans. Mob. Comput., no. 9, pp. 1242--1254, 2006."}},{"file_date_updated":"2018-04-13T09:57:03Z","publication":"IPDPS","department":[{"_id":"79"}],"author":[{"last_name":"Kothapalli","first_name":"Kishore","full_name":"Kothapalli, Kishore"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Onus","full_name":"Onus, Melih","first_name":"Melih"},{"first_name":"Christian","full_name":"Schindelhauer, Christian","last_name":"Schindelhauer"}],"file":[{"access_level":"open_access","file_name":"IPDPS06.pdf","date_created":"2018-04-13T09:57:03Z","date_updated":"2018-04-13T09:57:03Z","content_type":"application/pdf","relation":"main_file","file_size":192708,"creator":"florida","file_id":"2334"}],"date_created":"2018-04-03T05:22:43Z","status":"public","has_accepted_license":"1","ddc":["040"],"title":"Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds","user_id":"15504","year":"2006","citation":{"apa":"Kothapalli, K., Scheideler, C., Onus, M., & Schindelhauer, C. (2006). Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds. In IPDPS.","ama":"Kothapalli K, Scheideler C, Onus M, Schindelhauer C. Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds. In: IPDPS. ; 2006.","chicago":"Kothapalli, Kishore, Christian Scheideler, Melih Onus, and Christian Schindelhauer. “Distributed Coloring in O/Spl Tilde/(/Spl Radic/(Log n)) Bit Rounds.” In IPDPS, 2006.","mla":"Kothapalli, Kishore, et al. “Distributed Coloring in O/Spl Tilde/(/Spl Radic/(Log n)) Bit Rounds.” IPDPS, 2006.","bibtex":"@inproceedings{Kothapalli_Scheideler_Onus_Schindelhauer_2006, title={Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds}, booktitle={IPDPS}, author={Kothapalli, Kishore and Scheideler, Christian and Onus, Melih and Schindelhauer, Christian}, year={2006} }","short":"K. Kothapalli, C. Scheideler, M. Onus, C. Schindelhauer, in: IPDPS, 2006.","ieee":"K. Kothapalli, C. Scheideler, M. Onus, and C. Schindelhauer, “Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds,” in IPDPS, 2006."},"type":"conference","urn":"21110","_id":"2111","date_updated":"2022-01-06T06:54:46Z","oa":"1"},{"urn":"21128","date_updated":"2022-01-06T06:54:46Z","_id":"2112","oa":"1","series_title":"Lecture Notes in Computer Science","page":"275--289","year":"2006","type":"conference","citation":{"ieee":"B. Awerbuch and C. Scheideler, “Robust Random Number Generation for Peer-to-Peer Systems,” in OPODIS, 2006, pp. 275--289.","short":"B. Awerbuch, C. Scheideler, in: OPODIS, 2006, pp. 275--289.","mla":"Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.” OPODIS, 2006, pp. 275--289.","bibtex":"@inproceedings{Awerbuch_Scheideler_2006, series={Lecture Notes in Computer Science}, title={Robust Random Number Generation for Peer-to-Peer Systems}, booktitle={OPODIS}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2006}, pages={275--289}, collection={Lecture Notes in Computer Science} }","ama":"Awerbuch B, Scheideler C. Robust Random Number Generation for Peer-to-Peer Systems. In: OPODIS. Lecture Notes in Computer Science. ; 2006:275--289.","apa":"Awerbuch, B., & Scheideler, C. (2006). Robust Random Number Generation for Peer-to-Peer Systems. In OPODIS (pp. 275--289).","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.” In OPODIS, 275--289. Lecture Notes in Computer Science, 2006."},"user_id":"15504","ddc":["040"],"title":"Robust Random Number Generation for Peer-to-Peer Systems","file":[{"file_size":198976,"creator":"florida","file_id":"2335","content_type":"application/pdf","date_updated":"2018-04-13T09:57:51Z","relation":"main_file","file_name":"OPODIS06.pdf","date_created":"2018-04-13T09:57:51Z","access_level":"open_access"}],"publication":"OPODIS","file_date_updated":"2018-04-13T09:57:51Z","department":[{"_id":"79"}],"author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"date_created":"2018-04-03T05:23:39Z","has_accepted_license":"1","status":"public"},{"publication":"SPAA","file_date_updated":"2018-04-13T10:00:09Z","department":[{"_id":"79"}],"author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file":[{"access_level":"open_access","date_created":"2018-04-13T10:00:09Z","file_name":"SPAA06.pdf","relation":"main_file","date_updated":"2018-04-13T10:00:09Z","content_type":"application/pdf","file_id":"2337","creator":"florida","file_size":144588}],"date_created":"2018-04-03T05:24:22Z","has_accepted_license":"1","status":"public","ddc":["040"],"title":"Towards a scalable and robust DHT","user_id":"15504","page":"318--327","citation":{"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.","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} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.” SPAA, 2006, pp. 318--327.","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.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.” In SPAA, 318--327, 2006."},"type":"conference","year":"2006","urn":"21137","_id":"2113","date_updated":"2022-01-06T06:54:46Z","oa":"1"},{"page":"903--928","year":"2006","type":"journal_article","citation":{"ieee":"A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler, “The Effect of Faults on Network Expansion,” Theory Comput. Syst., no. 6, pp. 903--928, 2006.","short":"A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, Theory Comput. Syst. (2006) 903--928.","mla":"Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” Theory Comput. Syst., no. 6, 2006, pp. 903--928, doi:10.1007/s00224-006-1349-0.","bibtex":"@article{Bagchi_Bhargava_Chaudhary_Eppstein_Scheideler_2006, title={The Effect of Faults on Network Expansion}, DOI={10.1007/s00224-006-1349-0}, number={6}, journal={Theory Comput. Syst.}, author={Bagchi, Amitabha and Bhargava, Ankur and Chaudhary, Amitabh and Eppstein, David and Scheideler, Christian}, year={2006}, pages={903--928} }","ama":"Bagchi A, Bhargava A, Chaudhary A, Eppstein D, Scheideler C. The Effect of Faults on Network Expansion. Theory Comput Syst. 2006;(6):903--928. doi:10.1007/s00224-006-1349-0","apa":"Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., & Scheideler, C. (2006). The Effect of Faults on Network Expansion. Theory Comput. Syst., (6), 903--928. https://doi.org/10.1007/s00224-006-1349-0","chicago":"Bagchi, Amitabha, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, and Christian Scheideler. “The Effect of Faults on Network Expansion.” Theory Comput. Syst., no. 6 (2006): 903--928. https://doi.org/10.1007/s00224-006-1349-0."},"_id":"2043","date_updated":"2022-01-06T06:54:27Z","doi":"10.1007/s00224-006-1349-0","issue":"6","department":[{"_id":"79"}],"publication":"Theory Comput. Syst.","author":[{"first_name":"Amitabha","full_name":"Bagchi, Amitabha","last_name":"Bagchi"},{"last_name":"Bhargava","first_name":"Ankur","full_name":"Bhargava, Ankur"},{"last_name":"Chaudhary","full_name":"Chaudhary, Amitabh","first_name":"Amitabh"},{"first_name":"David","full_name":"Eppstein, David","last_name":"Eppstein"},{"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"},{"type":"conference","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.","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."},"date_updated":"2022-01-06T06:55:27Z","_id":"2213","urn":"22137","oa":"1","file":[{"creator":"florida","file_id":"2336","file_size":85116,"relation":"main_file","date_updated":"2018-04-13T09:59:14Z","content_type":"application/pdf","date_created":"2018-04-13T09:59:14Z","file_name":"HNI-Symposium-06.pdf","access_level":"open_access"}],"author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"6th International HNI Symposium on New Trends in Parallel and Distributed Computing","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"]},{"file":[{"date_created":"2018-04-13T08:45:41Z","file_name":"KS-ISPAN-05-TransData.pdf","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"}],"publication":"ISPAN","department":[{"_id":"79"}],"file_date_updated":"2018-04-13T08:45:41Z","author":[{"last_name":"Korzeniowski","first_name":"Miroslaw","full_name":"Korzeniowski, Miroslaw"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2018-04-03T05:25:16Z","has_accepted_license":"1","status":"public","user_id":"15504","ddc":["040"],"title":"Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment","page":"182--187","year":"2005","type":"conference","citation":{"ieee":"M. Korzeniowski and C. Scheideler, “Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment,” in ISPAN, 2005, pp. 182--187.","short":"M. Korzeniowski, C. Scheideler, in: ISPAN, 2005, pp. 182--187.","mla":"Korzeniowski, Miroslaw, and Christian Scheideler. “Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment.” ISPAN, 2005, pp. 182--187.","bibtex":"@inproceedings{Korzeniowski_Scheideler_2005, title={Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment}, booktitle={ISPAN}, author={Korzeniowski, Miroslaw and Scheideler, Christian}, year={2005}, pages={182--187} }","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.","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."},"urn":"21146","date_updated":"2022-01-06T06:54:47Z","_id":"2114","oa":"1"},{"citation":{"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.","ama":"Kothapalli K, Scheideler C. Supervised Peer-to-Peer Systems. In: ISPAN. ; 2005:188--193.","apa":"Kothapalli, K., & Scheideler, C. (2005). Supervised Peer-to-Peer Systems. In ISPAN (pp. 188--193).","chicago":"Kothapalli, Kishore, and Christian Scheideler. “Supervised Peer-to-Peer Systems.” In ISPAN, 188--193, 2005.","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."},"year":"2005","type":"conference","page":"188--193","_id":"2115","date_updated":"2022-01-06T06:54:47Z","urn":"21156","oa":"1","author":[{"last_name":"Kothapalli","full_name":"Kothapalli, Kishore","first_name":"Kishore"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"department":[{"_id":"79"}],"file_date_updated":"2018-04-13T08:50:40Z","publication":"ISPAN","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","file_name":"KS-ISPAN-05-Supervised.pdf","date_created":"2018-04-13T08:50:40Z"}],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:26:10Z","ddc":["040"],"title":"Supervised Peer-to-Peer Systems","user_id":"15504"},{"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:26:50Z","file":[{"access_level":"open_access","date_created":"2018-04-13T08:55:51Z","file_name":"KORS-ISPAN-05.pdf","content_type":"application/pdf","date_updated":"2018-04-13T08:55:51Z","relation":"main_file","file_size":135267,"creator":"florida","file_id":"2327"}],"author":[{"last_name":"Onus","first_name":"Melih","full_name":"Onus, Melih"},{"first_name":"Andrea","full_name":"W. Richa, Andrea","last_name":"W. Richa"},{"full_name":"Kothapalli, Kishore","first_name":"Kishore","last_name":"Kothapalli"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file_date_updated":"2018-04-13T08:55:51Z","publication":"ISPAN","department":[{"_id":"79"}],"user_id":"15504","ddc":["040"],"title":"Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks","type":"conference","year":"2005","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.","bibtex":"@inproceedings{Onus_W. Richa_Kothapalli_Scheideler_2005, title={Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks}, booktitle={ISPAN}, author={Onus, Melih and W. Richa, Andrea and Kothapalli, Kishore and Scheideler, Christian}, year={2005}, pages={346--351} }","mla":"Onus, Melih, et al. “Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks.” ISPAN, 2005, pp. 346--351.","apa":"Onus, M., W. Richa, A., Kothapalli, K., & Scheideler, C. (2005). Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks. In ISPAN (pp. 346--351).","ama":"Onus M, W. Richa A, Kothapalli K, Scheideler C. Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks. In: ISPAN. ; 2005:346--351.","chicago":"Onus, Melih, Andrea W. Richa, Kishore Kothapalli, and Christian Scheideler. “Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks.” In ISPAN, 346--351, 2005."},"page":"346--351","oa":"1","_id":"2116","date_updated":"2022-01-06T06:54:48Z","urn":"21165"},{"urn":"21175","date_updated":"2022-01-06T06:54:48Z","_id":"2117","oa":"1","page":"116--125","year":"2005","type":"conference","citation":{"mla":"Kothapalli, Kishore, et al. “Constant Density Spanners for Wireless Ad-Hoc Networks.” SPAA, 2005, pp. 116--125.","bibtex":"@inproceedings{Kothapalli_Scheideler_Onus_W. Richa_2005, title={Constant density spanners for wireless ad-hoc networks}, booktitle={SPAA}, author={Kothapalli, Kishore and Scheideler, Christian and Onus, Melih and W. Richa, Andrea}, year={2005}, pages={116--125} }","chicago":"Kothapalli, Kishore, Christian Scheideler, Melih Onus, and Andrea W. Richa. “Constant Density Spanners for Wireless Ad-Hoc Networks.” In SPAA, 116--125, 2005.","ama":"Kothapalli K, Scheideler C, Onus M, W. Richa A. Constant density spanners for wireless ad-hoc networks. In: SPAA. ; 2005:116--125.","apa":"Kothapalli, K., Scheideler, C., Onus, M., & W. Richa, A. (2005). Constant density spanners for wireless ad-hoc networks. In SPAA (pp. 116--125).","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."},"user_id":"15504","ddc":["040"],"title":"Constant density spanners for wireless ad-hoc networks","file":[{"date_created":"2018-04-13T08:56:49Z","file_name":"SPAA-05.pdf","access_level":"open_access","file_size":118644,"creator":"florida","file_id":"2328","content_type":"application/pdf","date_updated":"2018-04-13T08:56:49Z","relation":"main_file"}],"publication":"SPAA","file_date_updated":"2018-04-13T08:56:49Z","department":[{"_id":"79"}],"author":[{"last_name":"Kothapalli","full_name":"Kothapalli, Kishore","first_name":"Kishore"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"first_name":"Melih","full_name":"Onus, Melih","last_name":"Onus"},{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"}],"date_created":"2018-04-03T05:28:33Z","status":"public","has_accepted_license":"1"},{"type":"conference","year":"2005","citation":{"short":"C. Scheideler, in: STOC, 2005, pp. 704--713.","ieee":"C. Scheideler, “How to spread adversarial nodes?: rotate!,” in STOC, 2005, pp. 704--713.","chicago":"Scheideler, Christian. “How to Spread Adversarial Nodes?: Rotate!” In STOC, 704--713, 2005.","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).","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."},"page":"704--713","oa":"1","_id":"2118","date_updated":"2022-01-06T06:54:49Z","urn":"21185","status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:29:27Z","file":[{"file_size":134460,"creator":"florida","file_id":"2330","date_updated":"2018-04-13T08:58:22Z","content_type":"application/pdf","relation":"main_file","file_name":"STOC-05.pdf","date_created":"2018-04-13T08:58:22Z","access_level":"open_access"}],"author":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"department":[{"_id":"79"}],"publication":"STOC","file_date_updated":"2018-04-13T08:58:22Z","user_id":"15504","ddc":["040"],"title":"How to spread adversarial nodes?: rotate!"},{"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":[{"file_size":295333,"creator":"florida","file_id":"2329","content_type":"application/pdf","date_updated":"2018-04-13T08:57:39Z","relation":"main_file","date_created":"2018-04-13T08:57:39Z","file_name":"IMA-05.pdf","access_level":"open_access"}],"department":[{"_id":"79"}],"file_date_updated":"2018-04-13T08:57:39Z","publication":"IMA Workshop on Wireless Communications","author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"oa":"1","urn":"22129","_id":"2212","date_updated":"2022-01-06T06:55:26Z","type":"conference","citation":{"ieee":"C. Scheideler, “Overlay networks for wireless ad hoc networks,” in IMA Workshop on Wireless Communications, 2005.","short":"C. Scheideler, in: IMA Workshop on Wireless Communications, 2005.","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.","chicago":"Scheideler, Christian. “Overlay Networks for Wireless Ad Hoc Networks.” In IMA Workshop on Wireless Communications, 2005.","ama":"Scheideler C. Overlay networks for wireless ad hoc networks. In: IMA Workshop on Wireless Communications. ; 2005.","apa":"Scheideler, C. (2005). Overlay networks for wireless ad hoc networks. In IMA Workshop on Wireless Communications."},"year":"2005"},{"status":"public","date_created":"2018-04-03T05:30:23Z","author":[{"last_name":"Kolman","full_name":"Kolman, Petr","first_name":"Petr"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"department":[{"_id":"79"}],"publication":"Algorithmica","user_id":"15504","title":"Simple On-Line Algorithms for the Maximum Disjoint Paths Problem","year":"2004","type":"journal_article","citation":{"apa":"Kolman, P., & Scheideler, C. (2004). Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. Algorithmica, (3), 209--233. https://doi.org/10.1007/s00453-004-1086-1","ama":"Kolman P, Scheideler C. Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. Algorithmica. 2004;(3):209--233. doi:10.1007/s00453-004-1086-1","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} }","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."},"page":"209--233","issue":"3","doi":"10.1007/s00453-004-1086-1","date_updated":"2022-01-06T06:54:49Z","_id":"2119"},{"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:31:04Z","volume":3142,"file":[{"access_level":"open_access","file_name":"ICALP-04.pdf","date_created":"2018-04-12T09:20:16Z","relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:20:16Z","creator":"florida","file_id":"2312","file_size":145383}],"author":[{"first_name":"Baruch","full_name":"Awerbuch, Baruch","last_name":"Awerbuch"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file_date_updated":"2018-04-12T09:20:16Z","publication":"ICALP","user_id":"15504","ddc":["040"],"citation":{"bibtex":"@inproceedings{Awerbuch_Scheideler_2004, series={Lecture Notes in Computer Science}, title={Group Spreading: A Protocol for Provably Secure Distributed Name Service}, volume={3142}, booktitle={ICALP}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={183--195}, collection={Lecture Notes in Computer Science} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “Group Spreading: A Protocol for Provably Secure Distributed Name Service.” ICALP, vol. 3142, 2004, pp. 183--195.","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.","ama":"Awerbuch B, Scheideler C. Group Spreading: A Protocol for Provably Secure Distributed Name Service. In: ICALP. Vol 3142. Lecture Notes in Computer Science. ; 2004:183--195.","apa":"Awerbuch, B., & Scheideler, C. (2004). Group Spreading: A Protocol for Provably Secure Distributed Name Service. In ICALP (Vol. 3142, pp. 183--195).","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."},"year":"2004","type":"conference","page":"183--195","_id":"2120","intvolume":" 3142","urn":"21200","department":[{"_id":"79"}],"title":"Group Spreading: A Protocol for Provably Secure Distributed Name Service","series_title":"Lecture Notes in Computer Science","oa":"1","date_updated":"2022-01-06T06:54:49Z"},{"date_created":"2018-04-03T05:31:59Z","status":"public","has_accepted_license":"1","file":[{"file_name":"IPDPS-04.pdf","date_created":"2018-04-12T09:50:26Z","access_level":"open_access","file_size":91542,"file_id":"2316","creator":"florida","content_type":"application/pdf","date_updated":"2018-04-12T09:50:26Z","relation":"main_file"}],"publication":"IPDPS","file_date_updated":"2018-04-12T09:50:26Z","department":[{"_id":"79"}],"author":[{"full_name":"Riley, Chris","first_name":"Chris","last_name":"Riley"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"user_id":"15504","title":"A Distributed Hash Table for Computational Grids","ddc":["040"],"citation":{"chicago":"Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational Grids.” In IPDPS, 2004.","ama":"Riley C, Scheideler C. A Distributed Hash Table for Computational Grids. In: IPDPS. ; 2004.","apa":"Riley, C., & Scheideler, C. (2004). A Distributed Hash Table for Computational Grids. In IPDPS.","mla":"Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational Grids.” IPDPS, 2004.","bibtex":"@inproceedings{Riley_Scheideler_2004, title={A Distributed Hash Table for Computational Grids}, booktitle={IPDPS}, author={Riley, Chris and Scheideler, Christian}, year={2004} }","short":"C. Riley, C. Scheideler, in: IPDPS, 2004.","ieee":"C. Riley and C. Scheideler, “A Distributed Hash Table for Computational Grids,” in IPDPS, 2004."},"type":"conference","year":"2004","oa":"1","urn":"21212","date_updated":"2022-01-06T06:54:50Z","_id":"2121"},{"user_id":"15504","ddc":["040"],"file":[{"access_level":"open_access","date_created":"2018-04-12T11:39:38Z","file_name":"IPTPS-04.pdf","content_type":"application/pdf","date_updated":"2018-04-12T11:39:38Z","relation":"main_file","file_size":136987,"creator":"florida","file_id":"2318"}],"file_date_updated":"2018-04-12T11:39:38Z","publication":"IPTPS","author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2018-04-03T05:32:33Z","has_accepted_license":"1","status":"public","volume":3279,"urn":"21229","intvolume":" 3279","_id":"2122","page":"237--249","year":"2004","type":"conference","citation":{"mla":"Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.” IPTPS, vol. 3279, 2004, pp. 237--249.","bibtex":"@inproceedings{Awerbuch_Scheideler_2004, series={Lecture Notes in Computer Science}, title={Robust Distributed Name Service}, volume={3279}, booktitle={IPTPS}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={237--249}, collection={Lecture Notes in Computer Science} }","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.","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."},"title":"Robust Distributed Name Service","department":[{"_id":"79"}],"date_updated":"2022-01-06T06:54:50Z","oa":"1","series_title":"Lecture Notes in Computer Science"},{"type":"conference","year":"2004","citation":{"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.","bibtex":"@inproceedings{Ateniese_Riley_Scheideler_2004, title={Survivable Monitoring in Dynamic Networks}, booktitle={IWIA}, author={Ateniese, Giuseppe and Riley, Chris and Scheideler, Christian}, year={2004}, pages={33--47} }","mla":"Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.” IWIA, 2004, pp. 33--47.","short":"G. Ateniese, C. Riley, C. Scheideler, in: IWIA, 2004, pp. 33--47.","ieee":"G. Ateniese, C. Riley, and C. Scheideler, “Survivable Monitoring in Dynamic Networks,” in IWIA, 2004, pp. 33--47."},"page":"33--47","_id":"2123","date_updated":"2022-01-06T06:54:50Z","urn":"21238","oa":"1","file":[{"file_id":"2317","creator":"florida","file_size":255111,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T11:38:22Z","date_created":"2018-04-12T11:38:22Z","file_name":"IIAW-04.pdf","access_level":"open_access"}],"author":[{"first_name":"Giuseppe","full_name":"Ateniese, Giuseppe","last_name":"Ateniese"},{"last_name":"Riley","first_name":"Chris","full_name":"Riley, Chris"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"department":[{"_id":"79"}],"publication":"IWIA","file_date_updated":"2018-04-12T11:38:22Z","status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:33:37Z","user_id":"15504","ddc":["040"],"title":"Survivable Monitoring in Dynamic Networks"},{"page":"318--327","type":"conference","year":"2004","citation":{"ama":"Awerbuch B, Scheideler C. The hyperring: a low-congestion deterministic data structure for distributed environments. In: SODA. ; 2004:318--327.","apa":"Awerbuch, B., & Scheideler, C. (2004). The hyperring: a low-congestion deterministic data structure for distributed environments. In SODA (pp. 318--327).","chicago":"Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments.” In SODA, 318--327, 2004.","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.","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."},"urn":"21247","_id":"2124","date_updated":"2022-01-06T06:54:51Z","oa":"1","publication":"SODA","file_date_updated":"2018-04-13T08:36:08Z","department":[{"_id":"79"}],"author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file":[{"relation":"main_file","date_updated":"2018-04-13T08:36:08Z","content_type":"application/pdf","file_id":"2323","creator":"florida","file_size":193831,"access_level":"open_access","date_created":"2018-04-13T08:36:08Z","file_name":"SODA-04.pdf"}],"date_created":"2018-04-03T05:34:17Z","status":"public","has_accepted_license":"1","ddc":["040"],"title":"The hyperring: a low-congestion deterministic data structure for distributed environments","user_id":"15504"},{"page":"44--53","type":"conference","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.","mla":"Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data Management in Distributed Storage Systems.” SPAA, 2004, pp. 44--53.","bibtex":"@inproceedings{Awerbuch_Scheideler_2004, title={Consistent and compact data management in distributed storage systems}, booktitle={SPAA}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={44--53} }","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)."},"year":"2004","urn":"21256","_id":"2125","date_updated":"2022-01-06T06:54:51Z","oa":"1","file":[{"file_name":"AS-SPAA-04.pdf","date_created":"2018-04-12T09:41:38Z","access_level":"open_access","creator":"florida","file_id":"2315","file_size":170429,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:41:38Z"}],"publication":"SPAA","file_date_updated":"2018-04-12T09:41:38Z","department":[{"_id":"79"}],"author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"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","citation":{"short":"A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, M. Thober, in: SPAA, 2004, pp. 170--179.","ieee":"A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, and M. Thober, “Pagoda: a dynamic overlay network for routing, data management, and multicasting,” in SPAA, 2004, pp. 170--179.","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.","ama":"Bhargava A, Kothapalli K, Riley C, Scheideler C, Thober M. Pagoda: a dynamic overlay network for routing, data management, and multicasting. In: SPAA. ; 2004:170--179.","apa":"Bhargava, A., Kothapalli, K., Riley, C., Scheideler, C., & Thober, M. (2004). Pagoda: a dynamic overlay network for routing, data management, and multicasting. In SPAA (pp. 170--179).","bibtex":"@inproceedings{Bhargava_Kothapalli_Riley_Scheideler_Thober_2004, title={Pagoda: a dynamic overlay network for routing, data management, and multicasting}, booktitle={SPAA}, author={Bhargava, Ankur and Kothapalli, Kishore and Riley, Chris and Scheideler, Christian and Thober, Mark}, year={2004}, pages={170--179} }","mla":"Bhargava, Ankur, et al. “Pagoda: A Dynamic Overlay Network for Routing, Data Management, and Multicasting.” SPAA, 2004, pp. 170--179."},"year":"2004","type":"conference","urn":"21266","date_updated":"2022-01-06T06:54:52Z","_id":"2126","oa":"1","file":[{"access_level":"open_access","date_created":"2018-04-12T09:40:12Z","file_name":"BKRST-SPAA-04.pdf","relation":"main_file","date_updated":"2018-04-12T09:40:42Z","content_type":"application/pdf","file_id":"2314","creator":"florida","file_size":118175}],"department":[{"_id":"79"}],"file_date_updated":"2018-04-12T09:40:42Z","publication":"SPAA","author":[{"last_name":"Bhargava","full_name":"Bhargava, Ankur","first_name":"Ankur"},{"first_name":"Kishore","full_name":"Kothapalli, Kishore","last_name":"Kothapalli"},{"last_name":"Riley","full_name":"Riley, Chris","first_name":"Chris"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Thober","full_name":"Thober, Mark","first_name":"Mark"}],"date_created":"2018-04-03T05:35:31Z","status":"public","has_accepted_license":"1","user_id":"15504","ddc":["040"],"title":"Pagoda: a dynamic overlay network for routing, data management, and multicasting"},{"date_created":"2018-04-03T05:36:11Z","status":"public","has_accepted_license":"1","publication":"SPAA","department":[{"_id":"79"}],"file_date_updated":"2018-04-12T09:21:24Z","publisher":"ACM","author":[{"first_name":"Amitabha","full_name":"Bagchi, Amitabha","last_name":"Bagchi"},{"last_name":"Bhargava","first_name":"Ankur","full_name":"Bhargava, Ankur"},{"full_name":"Chaudhary, Amitabh","first_name":"Amitabh","last_name":"Chaudhary"},{"last_name":"Eppstein","first_name":"David","full_name":"Eppstein, David"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file":[{"access_level":"open_access","file_name":"BBCES-SPAA-04.pdf","date_created":"2018-04-12T09:21:24Z","relation":"main_file","date_updated":"2018-04-12T09:21:24Z","content_type":"application/pdf","file_id":"2313","creator":"florida","file_size":197503}],"ddc":["040"],"title":"The effect of faults on network expansion","user_id":"15504","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.","apa":"Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., & Scheideler, C. (2004). The effect of faults on network expansion. In SPAA (pp. 286--293). ACM.","ama":"Bagchi A, Bhargava A, Chaudhary A, Eppstein D, Scheideler C. The effect of faults on network expansion. In: SPAA. ACM; 2004:286--293.","mla":"Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” SPAA, ACM, 2004, pp. 286--293.","bibtex":"@inproceedings{Bagchi_Bhargava_Chaudhary_Eppstein_Scheideler_2004, title={The effect of faults on network expansion}, booktitle={SPAA}, publisher={ACM}, author={Bagchi, Amitabha and Bhargava, Ankur and Chaudhary, Amitabh and Eppstein, David and Scheideler, Christian}, year={2004}, pages={286--293} }","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","oa":"1","urn":"21276","_id":"2127","date_updated":"2022-01-06T06:54:52Z"},{"_id":"19790","date_updated":"2022-01-06T06:54:12Z","citation":{"mla":"Scheideler, Christian, et al. “Storage Management as Means to Cope with Exponential Information Growth.” Proceedings of SSGRR 2003, 2003.","bibtex":"@inproceedings{Scheideler_Salzwedel_Meyer auf der Heide_Brinkmann_Vodisek_Rückert_2003, title={Storage Management as Means to cope with Exponential Information Growth}, booktitle={Proceedings of SSGRR 2003}, author={Scheideler, Christian and Salzwedel, Kay and Meyer auf der Heide, Friedhelm and Brinkmann, André and Vodisek, Mario and Rückert, Ulrich}, year={2003} }","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.","ieee":"C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, and U. Rückert, “Storage Management as Means to cope with Exponential Information Growth,” in Proceedings of SSGRR 2003, 2003.","short":"C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, U. Rückert, in: Proceedings of SSGRR 2003, 2003."},"year":"2003","type":"conference","language":[{"iso":"eng"}],"title":"Storage Management as Means to cope with Exponential Information Growth","ddc":["000"],"user_id":"15415","abstract":[{"text":"The advances in Internet technology have led to tremendous improvements in business, education, and science and have changed the way we think, live, and communicate. Information exchange has become ubiquitous by the possibilities offered through modern technologies. We are able to offer information 24 hours a day through our web sites and can leave messages every time and from anywhere in the world. This change in communication has led to new challenges. Enterprises have to deal with an information amount that doubles every year. The technological foundation to cope with this information explosion is given by Storage Area Networks (SANs), which are able to connect a great number of storage systems over a fast interconnection network. However, to be able to use the benefits of a SAN, an easy-to-use and efficient management support has to be given to the storage administrator. In this paper, we will suggest new storage management concepts and we will introduce a new management environment that is able to significantly reduce management costs and increases the performance and resource utilization of the given SAN infrastructure.","lang":"eng"}],"date_created":"2020-09-30T12:04:14Z","status":"public","has_accepted_license":"1","publication":"Proceedings of SSGRR 2003","department":[{"_id":"63"},{"_id":"58"},{"_id":"79"}],"file_date_updated":"2020-09-30T12:03:57Z","author":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Salzwedel","full_name":"Salzwedel, Kay","first_name":"Kay"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Brinkmann","full_name":"Brinkmann, André","first_name":"André"},{"last_name":"Vodisek","first_name":"Mario","full_name":"Vodisek, Mario"},{"full_name":"Rückert, Ulrich","first_name":"Ulrich","last_name":"Rückert"}],"file":[{"access_level":"closed","file_name":"pub-hni-908.pdf","date_created":"2020-09-30T12:03:57Z","content_type":"application/pdf","date_updated":"2020-09-30T12:03:57Z","success":1,"relation":"main_file","file_size":499057,"creator":"koala","file_id":"19793"}]},{"title":"Smoothed Motion Complexity","user_id":"14955","publisher":"Springer","author":[{"last_name":"Damerow","first_name":"Valentina","full_name":"Damerow, Valentina"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Räcke","first_name":"Harald","full_name":"Räcke, Harald"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Sohler","first_name":"Christian","full_name":"Sohler, Christian"}],"publication":"ESA","department":[{"_id":"79"},{"_id":"63"}],"volume":2832,"status":"public","date_created":"2018-04-03T05:37:10Z","date_updated":"2022-01-06T06:54:52Z","_id":"2128","intvolume":" 2832","doi":"10.1007/978-3-540-39658-1_17","series_title":"Lecture Notes in Computer Science","citation":{"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.","chicago":"Damerow, Valentina, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, and Christian Sohler. “Smoothed Motion Complexity.” In ESA, 2832:161--171. Lecture Notes in Computer Science. Springer, 2003. https://doi.org/10.1007/978-3-540-39658-1_17.","apa":"Damerow, V., Meyer auf der Heide, F., Räcke, H., Scheideler, C., & Sohler, C. (2003). Smoothed Motion Complexity. In ESA (Vol. 2832, pp. 161--171). Springer. https://doi.org/10.1007/978-3-540-39658-1_17","ama":"Damerow V, Meyer auf der Heide F, Räcke H, Scheideler C, Sohler C. Smoothed Motion Complexity. In: ESA. Vol 2832. Lecture Notes in Computer Science. Springer; 2003:161--171. doi:10.1007/978-3-540-39658-1_17","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.","short":"V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, in: ESA, Springer, 2003, pp. 161--171."},"year":"2003","type":"conference","page":"161--171","language":[{"iso":"eng"}]},{"title":"Anycasting in Adversarial Systems: Routing and Admission Control","department":[{"_id":"79"},{"_id":"63"}],"oa":"1","date_updated":"2022-01-06T06:54:53Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","ddc":["040"],"user_id":"14955","volume":2719,"date_created":"2018-04-03T05:38:36Z","has_accepted_license":"1","status":"public","publication":"ICALP","file_date_updated":"2018-04-12T09:04:48Z","publisher":"Springer","author":[{"first_name":"Baruch","full_name":"Awerbuch, Baruch","last_name":"Awerbuch"},{"last_name":"Brinkmann","first_name":"André","full_name":"Brinkmann, André"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file":[{"access_level":"open_access","date_created":"2018-04-12T09:04:48Z","file_name":"ICALP-03.pdf","relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:04:48Z","creator":"florida","file_id":"2307","file_size":154427}],"urn":"21297","_id":"2129","intvolume":" 2719","page":"1153--1168","year":"2003","type":"conference","citation":{"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.","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.","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.","apa":"Awerbuch, B., Brinkmann, A., & Scheideler, C. (2003). Anycasting in Adversarial Systems: Routing and Admission Control. In ICALP (Vol. 2719, pp. 1153--1168). Springer.","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."}},{"user_id":"15504","title":"Peer-to-peer systems for prefix search","ddc":["040"],"file":[{"file_name":"PODC-03.pdf","date_created":"2018-04-12T09:10:10Z","access_level":"open_access","file_size":127013,"file_id":"2308","creator":"florida","date_updated":"2018-04-12T09:10:10Z","content_type":"application/pdf","relation":"main_file"}],"file_date_updated":"2018-04-12T09:10:10Z","publication":"PODC","department":[{"_id":"79"}],"publisher":"ACM","author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"date_created":"2018-04-03T05:39:48Z","has_accepted_license":"1","status":"public","urn":"21303","_id":"2130","date_updated":"2022-01-06T06:54:53Z","oa":"1","page":"123--132","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.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” In PODC, 123--132. ACM, 2003.","apa":"Awerbuch, B., & Scheideler, C. (2003). Peer-to-peer systems for prefix search. In PODC (pp. 123--132). ACM.","ama":"Awerbuch B, Scheideler C. Peer-to-peer systems for prefix search. In: PODC. ACM; 2003:123--132.","mla":"Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” PODC, ACM, 2003, pp. 123--132.","bibtex":"@inproceedings{Awerbuch_Scheideler_2003, title={Peer-to-peer systems for prefix search}, booktitle={PODC}, publisher={ACM}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2003}, pages={123--132} }"},"type":"conference","year":"2003"},{"department":[{"_id":"79"}],"title":"Perfectly Balanced Allocation","series_title":"Lecture Notes in Computer Science","oa":"1","date_updated":"2022-01-06T06:54:54Z","date_created":"2018-04-03T05:41:01Z","has_accepted_license":"1","status":"public","volume":2764,"file":[{"access_level":"open_access","file_name":"RANDOM-03.pdf","date_created":"2018-04-12T09:16:17Z","relation":"main_file","date_updated":"2018-04-12T09:16:17Z","content_type":"application/pdf","creator":"florida","file_id":"2310","file_size":112587}],"publication":"RANDOM-APPROX","file_date_updated":"2018-04-12T09:16:17Z","author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"last_name":"Riley","full_name":"Riley, Chris","first_name":"Chris"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publisher":"Springer","user_id":"15504","ddc":["040"],"page":"240--251","type":"conference","citation":{"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} }","ama":"Czumaj A, Riley C, Scheideler C. Perfectly Balanced Allocation. In: RANDOM-APPROX. Vol 2764. Lecture Notes in Computer Science. Springer; 2003:240--251.","apa":"Czumaj, A., Riley, C., & Scheideler, C. (2003). Perfectly Balanced Allocation. In RANDOM-APPROX (Vol. 2764, pp. 240--251). Springer.","chicago":"Czumaj, Artur, Chris Riley, and Christian Scheideler. “Perfectly Balanced Allocation.” In RANDOM-APPROX, 2764:240--251. Lecture Notes in Computer Science. Springer, 2003.","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."},"year":"2003","urn":"21313","_id":"2131","intvolume":" 2764"},{"urn":"21320","date_updated":"2022-01-06T06:54:54Z","_id":"2132","oa":"1","page":"220--229","type":"conference","year":"2003","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.","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.","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.","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} }","mla":"Jia, Lujun, et al. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” SPAA, ACM, 2003, pp. 220--229."},"user_id":"15504","title":"On local algorithms for topology control and routing in ad hoc networks","ddc":["040"],"file":[{"access_level":"open_access","file_name":"JRS-SPAA-03.pdf","date_created":"2018-04-12T09:18:55Z","relation":"main_file","date_updated":"2018-04-12T09:18:55Z","content_type":"application/pdf","creator":"florida","file_id":"2311","file_size":224200}],"publication":"SPAA","department":[{"_id":"79"}],"file_date_updated":"2018-04-12T09:18:55Z","publisher":"ACM","author":[{"last_name":"Jia","full_name":"Jia, Lujun","first_name":"Lujun"},{"last_name":"Rajaraman","full_name":"Rajaraman, Rajmohan","first_name":"Rajmohan"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2018-04-03T05:41:53Z","has_accepted_license":"1","status":"public"},{"file":[{"file_size":121448,"creator":"florida","file_id":"2309","content_type":"application/pdf","date_updated":"2018-04-12T09:15:24Z","relation":"main_file","file_name":"KS-SPAA-03.pdf","date_created":"2018-04-12T09:13:43Z","access_level":"open_access"}],"author":[{"last_name":"Kothapalli","full_name":"Kothapalli, Kishore","first_name":"Kishore"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publisher":"ACM","file_date_updated":"2018-04-12T09:15:24Z","publication":"SPAA","department":[{"_id":"79"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:42:48Z","user_id":"15504","ddc":["040"],"title":"Information gathering in adversarial systems: lines and cycles","year":"2003","type":"conference","citation":{"ieee":"K. Kothapalli and C. Scheideler, “Information gathering in adversarial systems: lines and cycles,” in SPAA, 2003, pp. 333--342.","short":"K. Kothapalli, C. Scheideler, in: SPAA, ACM, 2003, pp. 333--342.","bibtex":"@inproceedings{Kothapalli_Scheideler_2003, title={Information gathering in adversarial systems: lines and cycles}, booktitle={SPAA}, publisher={ACM}, author={Kothapalli, Kishore and Scheideler, Christian}, year={2003}, pages={333--342} }","mla":"Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial Systems: Lines and Cycles.” SPAA, ACM, 2003, pp. 333--342.","chicago":"Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial Systems: Lines and Cycles.” In SPAA, 333--342. ACM, 2003.","apa":"Kothapalli, K., & Scheideler, C. (2003). Information gathering in adversarial systems: lines and cycles. In SPAA (pp. 333--342). ACM.","ama":"Kothapalli K, Scheideler C. Information gathering in adversarial systems: lines and cycles. In: SPAA. ACM; 2003:333--342."},"page":"333--342","date_updated":"2022-01-06T06:54:55Z","_id":"2133","urn":"21338","oa":"1"},{"citation":{"ieee":"U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling,” Combinatorica, no. 3, pp. 361--399, 2002.","short":"U. Feige, C. Scheideler, Combinatorica (2002) 361--399.","mla":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling.” Combinatorica, no. 3, 2002, pp. 361--399, doi:10.1007/s004930200018.","bibtex":"@article{Feige_Scheideler_2002, title={Improved Bounds for Acyclic Job Shop Scheduling}, DOI={10.1007/s004930200018}, number={3}, journal={Combinatorica}, author={Feige, Uriel and Scheideler, Christian}, year={2002}, pages={361--399} }","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."},"year":"2002","type":"journal_article","page":"361--399","date_updated":"2022-01-06T06:54:55Z","_id":"2134","doi":"10.1007/s004930200018","issue":"3","author":[{"full_name":"Feige, Uriel","first_name":"Uriel","last_name":"Feige"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"department":[{"_id":"79"}],"publication":"Combinatorica","status":"public","date_created":"2018-04-03T05:43:36Z","title":"Improved Bounds for Acyclic Job Shop Scheduling","user_id":"15504"},{"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:44:11Z","publisher":"ACM/SIAM","author":[{"last_name":"Kolman","full_name":"Kolman, Petr","first_name":"Petr"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"department":[{"_id":"79"}],"publication":"SODA","file_date_updated":"2018-04-12T08:59:58Z","file":[{"file_size":246604,"file_id":"2303","creator":"florida","content_type":"application/pdf","date_updated":"2018-04-12T08:59:58Z","relation":"main_file","file_name":"SODA-02.pdf","date_created":"2018-04-12T08:59:58Z","access_level":"open_access"}],"ddc":["040"],"title":"Improved bounds for the unsplittable flow problem","user_id":"15504","citation":{"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.","chicago":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” In SODA, 184--193. ACM/SIAM, 2002.","apa":"Kolman, P., & Scheideler, C. (2002). Improved bounds for the unsplittable flow problem. In SODA (pp. 184--193). ACM/SIAM.","ama":"Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem. In: SODA. ACM/SIAM; 2002:184--193.","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."},"type":"conference","year":"2002","page":"184--193","oa":"1","date_updated":"2022-01-06T06:54:55Z","_id":"2135","urn":"21357"},{"type":"conference","citation":{"short":"A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2002, pp. 53--62.","ieee":"A. Brinkmann, K. Salzwedel, and C. Scheideler, “Compact, adaptive placement schemes for non-uniform requirements,” in SPAA, 2002, pp. 53--62.","ama":"Brinkmann A, Salzwedel K, Scheideler C. Compact, adaptive placement schemes for non-uniform requirements. In: SPAA. ; 2002:53--62.","apa":"Brinkmann, A., Salzwedel, K., & Scheideler, C. (2002). Compact, adaptive placement schemes for non-uniform requirements. In SPAA (pp. 53--62).","chicago":"Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” In SPAA, 53--62, 2002.","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."},"year":"2002","page":"53--62","language":[{"iso":"eng"}],"_id":"2136","date_updated":"2022-01-06T06:54:56Z","urn":"21366","oa":"1","author":[{"last_name":"Brinkmann","full_name":"Brinkmann, André","first_name":"André"},{"full_name":"Salzwedel, Kay","first_name":"Kay","last_name":"Salzwedel"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publication":"SPAA","department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T09:02:22Z","file":[{"file_name":"BSS-SPAA-02.pdf","date_created":"2018-04-12T09:02:22Z","access_level":"open_access","creator":"florida","file_id":"2305","file_size":123373,"relation":"main_file","date_updated":"2018-04-12T09:02:22Z","content_type":"application/pdf"}],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:44:56Z","ddc":["040"],"title":"Compact, adaptive placement schemes for non-uniform requirements","user_id":"14955"},{"oa":"1","date_updated":"2022-01-06T06:54:57Z","_id":"2137","urn":"21376","year":"2002","type":"conference","citation":{"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.","chicago":"Bagchi, Amitabha, Amitabh Chaudhary, Christian Scheideler, and Petr Kolman. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” In SPAA, 265--274, 2002.","ama":"Bagchi A, Chaudhary A, Scheideler C, Kolman P. Algorithms for fault-tolerant routing in circuit switched networks. In: SPAA. ; 2002: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).","ieee":"A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, “Algorithms for fault-tolerant routing in circuit switched networks,” in SPAA, 2002, pp. 265--274.","short":"A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, in: SPAA, 2002, pp. 265--274."},"page":"265--274","title":"Algorithms for fault-tolerant routing in circuit switched networks","ddc":["040"],"user_id":"15504","status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:45:44Z","author":[{"last_name":"Bagchi","full_name":"Bagchi, Amitabha","first_name":"Amitabha"},{"first_name":"Amitabh","full_name":"Chaudhary, Amitabh","last_name":"Chaudhary"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Kolman","first_name":"Petr","full_name":"Kolman, Petr"}],"publication":"SPAA","department":[{"_id":"79"}],"file_date_updated":"2018-04-12T09:03:44Z","file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:03:44Z","file_id":"2306","creator":"florida","file_size":187124,"access_level":"open_access","file_name":"BCKS-SPAA-02.pdf","date_created":"2018-04-12T09:03:44Z"}]},{"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","volume":2285,"date_created":"2018-04-03T05:46:38Z","has_accepted_license":"1","status":"public","publication":"STACS","file_date_updated":"2018-04-12T09:01:03Z","publisher":"Springer","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"file_name":"STACS-02.pdf","date_created":"2018-04-12T09:01:03Z","access_level":"open_access","creator":"florida","file_id":"2304","file_size":273875,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:01:03Z"}],"ddc":["040"],"user_id":"15504","page":"27--49","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.","mla":"Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” STACS, vol. 2285, Springer, 2002, pp. 27--49.","bibtex":"@inproceedings{Scheideler_2002, series={Lecture Notes in Computer Science}, title={Models and Techniques for Communication in Dynamic Networks}, volume={2285}, booktitle={STACS}, publisher={Springer}, author={Scheideler, Christian}, year={2002}, pages={27--49}, collection={Lecture Notes in Computer Science} }","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.","chicago":"Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” In STACS, 2285:27--49. Lecture Notes in Computer Science. Springer, 2002."},"year":"2002","type":"conference","urn":"21386","intvolume":" 2285","_id":"2138"},{"issue":"1","doi":"10.1007/s004930170007","date_updated":"2022-01-06T06:54:57Z","_id":"2139","intvolume":" 21","language":[{"iso":"eng"}],"page":"95--138","type":"journal_article","citation":{"chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica 21, no. 1 (2001): 95--138. https://doi.org/10.1007/s004930170007.","apa":"Meyer auf der Heide, F., & Scheideler, C. (2001). Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica, 21(1), 95--138. https://doi.org/10.1007/s004930170007","ama":"Meyer auf der Heide F, Scheideler C. Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica. 2001;21(1):95--138. doi:10.1007/s004930170007","bibtex":"@article{Meyer auf der Heide_Scheideler_2001, title={Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols}, volume={21}, DOI={10.1007/s004930170007}, number={1}, journal={Combinatorica}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2001}, pages={95--138} }","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica, vol. 21, no. 1, 2001, pp. 95--138, doi:10.1007/s004930170007.","short":"F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138.","ieee":"F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols,” Combinatorica, vol. 21, no. 1, pp. 95--138, 2001."},"year":"2001","user_id":"14955","title":"Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols","date_created":"2018-04-03T05:47:20Z","status":"public","volume":21,"publication":"Combinatorica","department":[{"_id":"79"},{"_id":"63"}],"author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}]},{"title":"Simple Routing Strategies for Adversarial Systems","ddc":["040"],"user_id":"15504","author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"full_name":"Berenbrink, Petra","first_name":"Petra","last_name":"Berenbrink"},{"last_name":"Brinkmann","full_name":"Brinkmann, André","first_name":"André"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publisher":"IEEE Computer Society","department":[{"_id":"79"}],"file_date_updated":"2018-04-12T08:59:00Z","publication":"FOCS","file":[{"file_size":151156,"creator":"florida","file_id":"2302","date_updated":"2018-04-12T08:59:00Z","content_type":"application/pdf","relation":"main_file","file_name":"FOCS-01.pdf","date_created":"2018-04-12T08:59:00Z","access_level":"open_access"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:48:28Z","date_updated":"2022-01-06T06:54:59Z","_id":"2140","urn":"21406","oa":"1","year":"2001","citation":{"mla":"Awerbuch, Baruch, et al. “Simple Routing Strategies for Adversarial Systems.” FOCS, IEEE Computer Society, 2001, pp. 158--167.","bibtex":"@inproceedings{Awerbuch_Berenbrink_Brinkmann_Scheideler_2001, title={Simple Routing Strategies for Adversarial Systems}, booktitle={FOCS}, publisher={IEEE Computer Society}, author={Awerbuch, Baruch and Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}, year={2001}, pages={158--167} }","apa":"Awerbuch, B., Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). Simple Routing Strategies for Adversarial Systems. In FOCS (pp. 158--167). IEEE Computer Society.","ama":"Awerbuch B, Berenbrink P, Brinkmann A, Scheideler C. Simple Routing Strategies for Adversarial Systems. In: FOCS. IEEE Computer Society; 2001:158--167.","chicago":"Awerbuch, Baruch, Petra Berenbrink, André Brinkmann, and Christian Scheideler. “Simple Routing Strategies for Adversarial Systems.” In FOCS, 158--167. IEEE Computer Society, 2001.","ieee":"B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler, “Simple Routing Strategies for Adversarial Systems,” in FOCS, 2001, pp. 158--167.","short":"B. Awerbuch, P. Berenbrink, A. Brinkmann, C. Scheideler, in: FOCS, IEEE Computer Society, 2001, pp. 158--167."},"type":"conference","page":"158--167"},{"title":"SIMLAB-A Simulation Environment for Storage Area Networks","department":[{"_id":"79"},{"_id":"63"}],"date_updated":"2022-01-06T06:54:59Z","oa":"1","language":[{"iso":"eng"}],"user_id":"14955","ddc":["040"],"file":[{"date_created":"2018-04-12T08:39:01Z","file_name":"PDP-00.pdf","access_level":"open_access","file_id":"2298","creator":"florida","file_size":85778,"relation":"main_file","date_updated":"2018-04-12T08:39:01Z","content_type":"application/pdf"}],"publication":"PDP","file_date_updated":"2018-04-12T08:39:01Z","publisher":"IEEE Computer Society","author":[{"full_name":"Berenbrink, Petra","first_name":"Petra","last_name":"Berenbrink"},{"last_name":"Brinkmann","first_name":"André","full_name":"Brinkmann, André"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"date_created":"2018-04-03T05:49:21Z","has_accepted_license":"1","status":"public","urn":"21415","_id":"2141","page":"227--234","year":"2001","citation":{"ieee":"P. Berenbrink, A. Brinkmann, and C. Scheideler, “SIMLAB-A Simulation Environment for Storage Area Networks,” in PDP, 2001, pp. 227--234.","short":"P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society, 2001, pp. 227--234.","mla":"Berenbrink, Petra, et al. “SIMLAB-A Simulation Environment for Storage Area Networks.” PDP, IEEE Computer Society, 2001, pp. 227--234.","bibtex":"@inproceedings{Berenbrink_Brinkmann_Scheideler_2001, title={SIMLAB-A Simulation Environment for Storage Area Networks}, booktitle={PDP}, publisher={IEEE Computer Society}, author={Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}, year={2001}, pages={227--234} }","apa":"Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). SIMLAB-A Simulation Environment for Storage Area Networks. In PDP (pp. 227--234). IEEE Computer Society.","ama":"Berenbrink P, Brinkmann A, Scheideler C. SIMLAB-A Simulation Environment for Storage Area Networks. In: PDP. IEEE Computer Society; 2001:227--234.","chicago":"Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “SIMLAB-A Simulation Environment for Storage Area Networks.” In PDP, 227--234. IEEE Computer Society, 2001."},"type":"conference"},{"user_id":"15504","title":"Simple on-line algorithms for the maximum disjoint paths problem","ddc":["040"],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:50:16Z","file":[{"file_name":"SPAA-01.pdf","date_created":"2018-04-12T08:58:07Z","access_level":"open_access","file_id":"2301","creator":"florida","file_size":335171,"relation":"main_file","date_updated":"2018-04-12T08:58:07Z","content_type":"application/pdf"}],"author":[{"full_name":"Kolman, Petr","first_name":"Petr","last_name":"Kolman"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"department":[{"_id":"79"}],"publication":"SPAA","file_date_updated":"2018-04-12T08:58:07Z","oa":"1","_id":"2142","date_updated":"2022-01-06T06:54:59Z","urn":"21421","year":"2001","citation":{"mla":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” SPAA, 2001, pp. 38--47.","bibtex":"@inproceedings{Kolman_Scheideler_2001, title={Simple on-line algorithms for the maximum disjoint paths problem}, booktitle={SPAA}, author={Kolman, Petr and Scheideler, Christian}, year={2001}, pages={38--47} }","chicago":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” In SPAA, 38--47, 2001.","apa":"Kolman, P., & Scheideler, C. (2001). Simple on-line algorithms for the maximum disjoint paths problem. In SPAA (pp. 38--47).","ama":"Kolman P, Scheideler C. Simple on-line algorithms for the maximum disjoint paths problem. In: SPAA. ; 2001:38--47.","ieee":"P. Kolman and C. Scheideler, “Simple on-line algorithms for the maximum disjoint paths problem,” in SPAA, 2001, pp. 38--47.","short":"P. Kolman, C. Scheideler, in: SPAA, 2001, pp. 38--47."},"type":"conference","page":"38--47"},{"author":[{"last_name":"Adler","first_name":"Micah","full_name":"Adler, Micah"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"Theory Comput. Syst.","volume":33,"status":"public","date_created":"2018-04-03T05:51:02Z","title":"Efficient Communication Strategies for Ad Hoc Wireless Networks","user_id":"14955","citation":{"ama":"Adler M, Scheideler C. Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput Syst. 2000;33(5/6):337--391. doi:10.1007/s002240010006","apa":"Adler, M., & Scheideler, C. (2000). Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput. Syst., 33(5/6), 337--391. https://doi.org/10.1007/s002240010006","chicago":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.” Theory Comput. Syst. 33, no. 5/6 (2000): 337--391. https://doi.org/10.1007/s002240010006.","bibtex":"@article{Adler_Scheideler_2000, title={Efficient Communication Strategies for Ad Hoc Wireless Networks}, volume={33}, DOI={10.1007/s002240010006}, number={5/6}, journal={Theory Comput. Syst.}, author={Adler, Micah and Scheideler, Christian}, year={2000}, pages={337--391} }","mla":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.” Theory Comput. Syst., vol. 33, no. 5/6, 2000, pp. 337--391, doi:10.1007/s002240010006.","short":"M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391.","ieee":"M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad Hoc Wireless Networks,” Theory Comput. Syst., vol. 33, no. 5/6, pp. 337--391, 2000."},"year":"2000","type":"journal_article","page":"337--391","language":[{"iso":"eng"}],"_id":"2143","intvolume":" 33","date_updated":"2022-01-06T06:54:59Z","doi":"10.1007/s002240010006","issue":"5/6"},{"issue":"4","doi":"10.1137/S0097539799353431","intvolume":" 30","_id":"2145","date_updated":"2022-01-06T06:55:00Z","language":[{"iso":"eng"}],"page":"1126--1155","citation":{"ieee":"C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,” SIAM J. Comput., vol. 30, no. 4, pp. 1126--1155, 2000.","short":"C. Scheideler, B. Vöcking, SIAM J. Comput. 30 (2000) 1126--1155.","bibtex":"@article{Scheideler_Vöcking_2000, title={From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols}, volume={30}, DOI={10.1137/S0097539799353431}, number={4}, journal={SIAM J. Comput.}, author={Scheideler, Christian and Vöcking, Berthold}, year={2000}, pages={1126--1155} }","mla":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” SIAM J. Comput., vol. 30, no. 4, 2000, pp. 1126--1155, doi:10.1137/S0097539799353431.","chicago":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” SIAM J. Comput. 30, no. 4 (2000): 1126--1155. https://doi.org/10.1137/S0097539799353431.","ama":"Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J Comput. 2000;30(4):1126--1155. doi:10.1137/S0097539799353431","apa":"Scheideler, C., & Vöcking, B. (2000). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J. Comput., 30(4), 1126--1155. https://doi.org/10.1137/S0097539799353431"},"type":"journal_article","year":"2000","user_id":"14955","title":"From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols","date_created":"2018-04-03T06:12:15Z","status":"public","volume":30,"publication":"SIAM J. Comput.","department":[{"_id":"79"},{"_id":"63"}],"author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Vöcking","full_name":"Vöcking, Berthold","first_name":"Berthold"}]},{"year":"2000","type":"conference","citation":{"ieee":"P. Berenbrink, A. Brinkmann, and C. Scheideler, “Distributed Path Selection for Storage Networks,” in PDPTA, 2000.","short":"P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.","mla":"Berenbrink, Petra, et al. “Distributed Path Selection for Storage Networks.” PDPTA, 2000.","bibtex":"@inproceedings{Berenbrink_Brinkmann_Scheideler_2000, title={Distributed Path Selection for Storage Networks}, booktitle={PDPTA}, author={Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}, year={2000} }","ama":"Berenbrink P, Brinkmann A, Scheideler C. Distributed Path Selection for Storage Networks. In: PDPTA. ; 2000.","apa":"Berenbrink, P., Brinkmann, A., & Scheideler, C. (2000). Distributed Path Selection for Storage Networks. In PDPTA.","chicago":"Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “Distributed Path Selection for Storage Networks.” In PDPTA, 2000."},"language":[{"iso":"eng"}],"oa":"1","_id":"2146","date_updated":"2022-01-06T06:55:00Z","urn":"21467","has_accepted_license":"1","status":"public","date_created":"2018-04-03T06:13:07Z","author":[{"full_name":"Berenbrink, Petra","first_name":"Petra","last_name":"Berenbrink"},{"full_name":"Brinkmann, André","first_name":"André","last_name":"Brinkmann"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publication":"PDPTA","file_date_updated":"2018-04-12T08:47:50Z","department":[{"_id":"79"},{"_id":"63"}],"file":[{"access_level":"open_access","date_created":"2018-04-12T08:47:50Z","file_name":"PDPTA-00.pdf","relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T08:47:50Z","file_id":"2299","creator":"florida","file_size":168677}],"ddc":["040"],"title":"Distributed Path Selection for Storage Networks","user_id":"14955"},{"user_id":"14955","ddc":["040"],"title":"Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma","status":"public","has_accepted_license":"1","date_created":"2018-04-03T06:16:48Z","file":[{"content_type":"application/pdf","date_updated":"2018-04-12T08:36:17Z","relation":"main_file","file_size":185001,"creator":"florida","file_id":"2295","access_level":"open_access","file_name":"SODA-00.pdf","date_created":"2018-04-12T08:36:17Z"}],"author":[{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file_date_updated":"2018-04-12T08:36:17Z","publication":"SODA","department":[{"_id":"79"},{"_id":"63"}],"oa":"1","_id":"2147","date_updated":"2022-01-06T06:55:00Z","urn":"21476","language":[{"iso":"eng"}],"year":"2000","type":"conference","citation":{"chicago":"Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” In SODA, 30--39, 2000.","ama":"Czumaj A, Scheideler C. Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In: SODA. ; 2000:30--39.","apa":"Czumaj, A., & Scheideler, C. (2000). Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In SODA (pp. 30--39).","bibtex":"@inproceedings{Czumaj_Scheideler_2000, title={Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma}, booktitle={SODA}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={30--39} }","mla":"Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” SODA, 2000, pp. 30--39.","short":"A. Czumaj, C. Scheideler, in: SODA, 2000, pp. 30--39.","ieee":"A. Czumaj and C. Scheideler, “Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma,” in SODA, 2000, pp. 30--39."},"page":"30--39"},{"_id":"2148","date_updated":"2022-01-06T06:55:00Z","intvolume":" 17","issue":"3-4","year":"2000","citation":{"ama":"Czumaj A, Scheideler C. Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct Algorithms. 2000;17(3-4):213--237.","apa":"Czumaj, A., & Scheideler, C. (2000). Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct. Algorithms, 17(3–4), 213--237.","chicago":"Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms 17, no. 3–4 (2000): 213--237.","mla":"Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms, vol. 17, no. 3–4, 2000, pp. 213--237.","bibtex":"@article{Czumaj_Scheideler_2000, title={Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma}, volume={17}, number={3–4}, journal={Random Struct. Algorithms}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={213--237} }","short":"A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237.","ieee":"A. Czumaj and C. Scheideler, “Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma,” Random Struct. Algorithms, vol. 17, no. 3–4, pp. 213--237, 2000."},"type":"journal_article","page":"213--237","language":[{"iso":"eng"}],"title":"Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma","user_id":"14955","author":[{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"Random Struct. Algorithms","volume":17,"status":"public","date_created":"2018-04-03T06:17:52Z"},{"date_created":"2018-04-03T06:18:45Z","has_accepted_license":"1","status":"public","file":[{"access_level":"open_access","date_created":"2018-04-12T08:38:13Z","file_name":"spaa_00.pdf","date_updated":"2018-04-12T08:38:13Z","content_type":"application/pdf","relation":"main_file","file_size":222176,"creator":"florida","file_id":"2297"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"SPAA","file_date_updated":"2018-04-12T08:38:13Z","author":[{"last_name":"Brinkmann","first_name":"André","full_name":"Brinkmann, André"},{"full_name":"Salzwedel, Kay","first_name":"Kay","last_name":"Salzwedel"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"user_id":"14955","title":"Efficient, distributed data placement strategies for storage area networks (extended abstract)","ddc":["040"],"language":[{"iso":"eng"}],"page":"119--128","year":"2000","citation":{"chicago":"Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” In SPAA, 119--128, 2000.","ama":"Brinkmann A, Salzwedel K, Scheideler C. Efficient, distributed data placement strategies for storage area networks (extended abstract). In: SPAA. ; 2000:119--128.","apa":"Brinkmann, A., Salzwedel, K., & Scheideler, C. (2000). Efficient, distributed data placement strategies for storage area networks (extended abstract). In SPAA (pp. 119--128).","mla":"Brinkmann, André, et al. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” SPAA, 2000, pp. 119--128.","bibtex":"@inproceedings{Brinkmann_Salzwedel_Scheideler_2000, title={Efficient, distributed data placement strategies for storage area networks (extended abstract)}, booktitle={SPAA}, author={Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}, year={2000}, pages={119--128} }","short":"A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.","ieee":"A. Brinkmann, K. Salzwedel, and C. Scheideler, “Efficient, distributed data placement strategies for storage area networks (extended abstract),” in SPAA, 2000, pp. 119--128."},"type":"conference","oa":"1","urn":"21493","_id":"2149","date_updated":"2022-01-06T06:55:02Z"}]