[{"urn":"20228","date_updated":"2022-01-06T06:54:23Z","_id":"2022","oa":"1","citation":{"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.","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.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Towards Scalable and Robust Overlay Networks.” In 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.","mla":"Awerbuch, Baruch, and Christian Scheideler. “Towards Scalable and Robust Overlay Networks.” 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.","bibtex":"@inproceedings{Awerbuch_Scheideler_2007, title={Towards Scalable and Robust Overlay Networks}, booktitle={6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2007} }","short":"B. Awerbuch, C. Scheideler, in: 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.","ieee":"B. Awerbuch and C. Scheideler, “Towards Scalable and Robust Overlay Networks,” in 6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007."},"type":"conference","year":"2007","ddc":["040"],"title":"Towards Scalable and Robust Overlay Networks","user_id":"15504","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","author":[{"first_name":"Baruch","full_name":"Awerbuch, Baruch","last_name":"Awerbuch"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file":[{"file_name":"IPTPS07.pdf","date_created":"2018-04-13T10:00:55Z","access_level":"open_access","file_size":191943,"creator":"florida","file_id":"2338","date_updated":"2018-04-13T10:00:55Z","content_type":"application/pdf","relation":"main_file"}],"date_created":"2018-03-29T11:55:52Z","has_accepted_license":"1","status":"public"},{"publisher":"ACM","author":[{"first_name":"Baruch","full_name":"Awerbuch, Baruch","last_name":"Awerbuch"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file_date_updated":"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":[{"access_level":"open_access","file_name":"DISC-07.pdf","date_created":"2018-04-13T10:02:18Z","relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-13T10:02:18Z","creator":"florida","file_id":"2340","file_size":193097}],"status":"public","has_accepted_license":"1","date_created":"2018-03-29T11:56:35Z","ddc":["040"],"user_id":"15504","citation":{"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.","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.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.” In Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, 370--371. ACM, 2007. https://doi.org/10.1145/1281100.1281178.","ama":"Awerbuch B, Scheideler C. A denial-of-service resistant DHT. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007. ACM; 2007:370--371. doi:10.1145/1281100.1281178","apa":"Awerbuch, B., & Scheideler, C. (2007). A denial-of-service resistant DHT. In Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007 (pp. 370--371). ACM. https://doi.org/10.1145/1281100.1281178","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.","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} }"},"year":"2007","type":"conference","page":"370--371","_id":"2023","urn":"20237","department":[{"_id":"79"}],"publication_identifier":{"isbn":["978-1-59593-616-5"]},"title":"A denial-of-service resistant DHT","date_updated":"2022-01-06T06:54:24Z","doi":"10.1145/1281100.1281178","oa":"1"},{"doi":"10.1007/978-3-540-75142-7_6","_id":"2024","date_updated":"2022-01-06T06:54:24Z","intvolume":" 4731","page":"33--47","year":"2007","type":"conference","citation":{"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.","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.","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","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","bibtex":"@inproceedings{Awerbuch_Scheideler_2007, series={Lecture Notes in Computer Science}, title={A Denial-of-Service Resistant DHT}, volume={4731}, DOI={10.1007/978-3-540-75142-7_6}, booktitle={Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings}, publisher={Springer}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2007}, pages={33--47}, collection={Lecture Notes in Computer Science} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.” Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, vol. 4731, Springer, 2007, pp. 33--47, doi:10.1007/978-3-540-75142-7_6."},"series_title":"Lecture Notes in Computer Science","user_id":"15504","title":"A Denial-of-Service Resistant DHT","date_created":"2018-03-29T11:57:42Z","status":"public","publication_identifier":{"isbn":["978-3-540-75141-0"]},"volume":4731,"department":[{"_id":"79"}],"publication":"Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings","publisher":"Springer","author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}]},{"publication_identifier":{"isbn":["978-1-58488-550-4"]},"date_created":"2018-03-29T12:00:39Z","status":"public","publication":"Handbook of Approximation Algorithms and Metaheuristics.","department":[{"_id":"79"}],"author":[{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"title":"Overlay Networks for Peer-to-Peer Networks","user_id":"15504","year":"2007","citation":{"bibtex":"@inbook{W. Richa_Scheideler_2007, title={Overlay Networks for Peer-to-Peer Networks}, DOI={10.1201/9781420010749.ch72}, booktitle={Handbook of Approximation Algorithms and Metaheuristics.}, author={W. Richa, Andrea and Scheideler, Christian}, year={2007} }","mla":"W. Richa, Andrea, and Christian Scheideler. “Overlay Networks for Peer-to-Peer Networks.” Handbook of Approximation Algorithms and Metaheuristics., 2007, doi:10.1201/9781420010749.ch72.","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.","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","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","ieee":"A. W. Richa and C. Scheideler, “Overlay Networks for Peer-to-Peer Networks,” in Handbook of Approximation Algorithms and Metaheuristics., 2007.","short":"A. W. Richa, C. Scheideler, in: Handbook of Approximation Algorithms and Metaheuristics., 2007."},"type":"book_chapter","doi":"10.1201/9781420010749.ch72","date_updated":"2022-01-06T06:54:25Z","_id":"2028"},{"ddc":["040"],"title":"Dynamic and redundant data placement","user_id":"15415","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."}],"status":"public","has_accepted_license":"1","date_created":"2018-04-05T07:08:35Z","author":[{"full_name":"Brinkmann, André","first_name":"André","last_name":"Brinkmann"},{"last_name":"Effert","first_name":"Sascha","full_name":"Effert, Sascha"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"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,"creator":"florida","file_id":"2339","content_type":"application/pdf","date_updated":"2018-04-13T10:01:42Z","relation":"main_file","date_created":"2018-04-13T10:01:42Z","file_name":"ICDCS07.pdf","access_level":"open_access"}],"oa":"1","_id":"2214","date_updated":"2022-01-06T06:55:27Z","urn":"22147","year":"2007","type":"conference","citation":{"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).","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.","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.","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","_id":"2209","date_updated":"2022-01-06T06:55:25Z","year":"2007","citation":{"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.","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","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} }","mla":"Aggarwal, Vinay, et al. “Can ISPs and P2P Users Cooperate for Improved Performance?” ACM Computer Commucation Review, 2007, doi:10.1145/1273445.1273449.","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."},"type":"journal_article","user_id":"15504","title":"Can ISPs and P2P users cooperate for improved performance?","status":"public","date_created":"2018-04-05T06:08:43Z","author":[{"last_name":"Aggarwal","first_name":"Vinay","full_name":"Aggarwal, Vinay"},{"last_name":"Feldmann","first_name":"Anja","full_name":"Feldmann, Anja"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"department":[{"_id":"79"}],"publication":"ACM Computer Commucation Review"},{"title":"Improved bounds for the unsplittable flow problem","user_id":"15504","department":[{"_id":"79"}],"publication":"J. Algorithms","author":[{"first_name":"Petr","full_name":"Kolman, Petr","last_name":"Kolman"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"volume":61,"date_created":"2018-03-29T12:01:37Z","status":"public","_id":"2029","intvolume":" 61","date_updated":"2022-01-06T06:54:25Z","doi":"10.1016/j.jalgor.2004.07.006","issue":"1","page":"20--44","type":"journal_article","year":"2006","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.","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} }","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.","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."}},{"page":"1242--1254","citation":{"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.","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} }","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","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.","ieee":"G. Ateniese, C. Riley, and C. Scheideler, “Survivable Monitoring in Dynamic Networks,” IEEE Trans. Mob. Comput., no. 9, pp. 1242--1254, 2006.","short":"G. Ateniese, C. Riley, C. Scheideler, IEEE Trans. Mob. Comput. (2006) 1242--1254."},"type":"journal_article","year":"2006","issue":"9","doi":"10.1109/TMC.2006.138","date_updated":"2022-01-06T06:54:45Z","_id":"2110","date_created":"2018-04-03T05:21:30Z","status":"public","department":[{"_id":"79"}],"publication":"IEEE Trans. Mob. Comput.","author":[{"last_name":"Ateniese","first_name":"Giuseppe","full_name":"Ateniese, Giuseppe"},{"last_name":"Riley","first_name":"Chris","full_name":"Riley, Chris"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"user_id":"15504","title":"Survivable Monitoring in Dynamic Networks"},{"date_updated":"2022-01-06T06:54:46Z","_id":"2111","urn":"21110","oa":"1","citation":{"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.","short":"K. Kothapalli, C. Scheideler, M. Onus, C. Schindelhauer, 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} }","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.","ama":"Kothapalli K, Scheideler C, Onus M, Schindelhauer C. Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds. In: IPDPS. ; 2006.","apa":"Kothapalli, K., Scheideler, C., Onus, M., & Schindelhauer, C. (2006). Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds. In IPDPS."},"year":"2006","type":"conference","user_id":"15504","title":"Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds","ddc":["040"],"file":[{"access_level":"open_access","date_created":"2018-04-13T09:57:03Z","file_name":"IPDPS06.pdf","relation":"main_file","date_updated":"2018-04-13T09:57:03Z","content_type":"application/pdf","file_id":"2334","creator":"florida","file_size":192708}],"author":[{"full_name":"Kothapalli, Kishore","first_name":"Kishore","last_name":"Kothapalli"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Melih","full_name":"Onus, Melih","last_name":"Onus"},{"last_name":"Schindelhauer","first_name":"Christian","full_name":"Schindelhauer, Christian"}],"file_date_updated":"2018-04-13T09:57:03Z","publication":"IPDPS","department":[{"_id":"79"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:22:43Z"},{"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:23:39Z","author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publication":"OPODIS","file_date_updated":"2018-04-13T09:57:51Z","department":[{"_id":"79"}],"file":[{"file_name":"OPODIS06.pdf","date_created":"2018-04-13T09:57:51Z","access_level":"open_access","file_size":198976,"file_id":"2335","creator":"florida","content_type":"application/pdf","date_updated":"2018-04-13T09:57:51Z","relation":"main_file"}],"title":"Robust Random Number Generation for Peer-to-Peer Systems","ddc":["040"],"user_id":"15504","type":"conference","year":"2006","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} }","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.","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)."},"page":"275--289","series_title":"Lecture Notes in Computer Science","oa":"1","date_updated":"2022-01-06T06:54:46Z","_id":"2112","urn":"21128"},{"_id":"2113","date_updated":"2022-01-06T06:54:46Z","urn":"21137","oa":"1","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.","ama":"Awerbuch B, Scheideler C. Towards a scalable and robust DHT. In: SPAA. ; 2006:318--327.","apa":"Awerbuch, B., & Scheideler, C. (2006). Towards a scalable and robust DHT. In SPAA (pp. 318--327).","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.” In SPAA, 318--327, 2006."},"type":"conference","year":"2006","page":"318--327","ddc":["040"],"title":"Towards a scalable and robust DHT","user_id":"15504","author":[{"last_name":"Awerbuch","full_name":"Awerbuch, Baruch","first_name":"Baruch"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file_date_updated":"2018-04-13T10:00:09Z","publication":"SPAA","department":[{"_id":"79"}],"file":[{"file_name":"SPAA06.pdf","date_created":"2018-04-13T10:00:09Z","access_level":"open_access","file_size":144588,"creator":"florida","file_id":"2337","content_type":"application/pdf","date_updated":"2018-04-13T10:00:09Z","relation":"main_file"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:24:22Z"},{"type":"journal_article","year":"2006","citation":{"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.","bibtex":"@article{Bagchi_Bhargava_Chaudhary_Eppstein_Scheideler_2006, title={The Effect of Faults on Network Expansion}, DOI={10.1007/s00224-006-1349-0}, number={6}, journal={Theory Comput. Syst.}, author={Bagchi, Amitabha and Bhargava, Ankur and Chaudhary, Amitabh and Eppstein, David and Scheideler, Christian}, year={2006}, pages={903--928} }","mla":"Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” Theory Comput. Syst., no. 6, 2006, pp. 903--928, doi:10.1007/s00224-006-1349-0.","short":"A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, Theory Comput. Syst. (2006) 903--928.","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."},"page":"903--928","issue":"6","doi":"10.1007/s00224-006-1349-0","_id":"2043","date_updated":"2022-01-06T06:54:27Z","status":"public","date_created":"2018-03-29T12:32:54Z","author":[{"last_name":"Bagchi","first_name":"Amitabha","full_name":"Bagchi, Amitabha"},{"first_name":"Ankur","full_name":"Bhargava, Ankur","last_name":"Bhargava"},{"last_name":"Chaudhary","full_name":"Chaudhary, Amitabh","first_name":"Amitabh"},{"last_name":"Eppstein","first_name":"David","full_name":"Eppstein, David"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"department":[{"_id":"79"}],"publication":"Theory Comput. Syst.","user_id":"15504","title":"The Effect of Faults on Network Expansion"},{"type":"conference","citation":{"short":"C. Scheideler, in: 6th International HNI Symposium on New Trends in Parallel and Distributed Computing, 2006.","ieee":"C. Scheideler, “Towards a paradigm for robust distributed algorithms and data structures,” in 6th International HNI Symposium on New Trends in Parallel and Distributed Computing, 2006.","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.","mla":"Scheideler, Christian. “Towards a Paradigm for Robust Distributed Algorithms and Data Structures.” 6th International HNI Symposium on New Trends in Parallel and Distributed Computing, 2006.","bibtex":"@inproceedings{Scheideler_2006, title={Towards a paradigm for robust distributed algorithms and data structures}, booktitle={6th International HNI Symposium on New Trends in Parallel and Distributed Computing}, author={Scheideler, Christian}, year={2006} }"},"year":"2006","urn":"22137","date_updated":"2022-01-06T06:55:27Z","_id":"2213","oa":"1","publication":"6th International HNI Symposium on New Trends in Parallel and Distributed Computing","department":[{"_id":"79"}],"file_date_updated":"2018-04-13T09:59:14Z","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"file_size":85116,"creator":"florida","file_id":"2336","date_updated":"2018-04-13T09:59:14Z","content_type":"application/pdf","relation":"main_file","file_name":"HNI-Symposium-06.pdf","date_created":"2018-04-13T09:59:14Z","access_level":"open_access"}],"date_created":"2018-04-05T07:06:44Z","has_accepted_license":"1","status":"public","ddc":["040"],"title":"Towards a paradigm for robust distributed algorithms and data structures","user_id":"15504"},{"date_created":"2018-04-03T05:25:16Z","has_accepted_license":"1","status":"public","file_date_updated":"2018-04-13T08:45:41Z","publication":"ISPAN","department":[{"_id":"79"}],"author":[{"full_name":"Korzeniowski, Miroslaw","first_name":"Miroslaw","last_name":"Korzeniowski"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file":[{"date_updated":"2018-04-13T08:45:41Z","content_type":"application/pdf","relation":"main_file","file_size":110389,"file_id":"2325","creator":"florida","access_level":"open_access","date_created":"2018-04-13T08:45:41Z","file_name":"KS-ISPAN-05-TransData.pdf"}],"ddc":["040"],"title":"Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment","user_id":"15504","page":"182--187","citation":{"chicago":"Korzeniowski, Miroslaw, and Christian Scheideler. “Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment.” In ISPAN, 182--187, 2005.","apa":"Korzeniowski, M., & Scheideler, C. (2005). Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment. In ISPAN (pp. 182--187).","ama":"Korzeniowski M, Scheideler C. Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment. In: ISPAN. ; 2005:182--187.","bibtex":"@inproceedings{Korzeniowski_Scheideler_2005, title={Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment}, booktitle={ISPAN}, author={Korzeniowski, Miroslaw and Scheideler, Christian}, year={2005}, pages={182--187} }","mla":"Korzeniowski, Miroslaw, and Christian Scheideler. “Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment.” ISPAN, 2005, pp. 182--187.","short":"M. Korzeniowski, C. Scheideler, in: ISPAN, 2005, pp. 182--187.","ieee":"M. Korzeniowski and C. Scheideler, “Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment,” in ISPAN, 2005, pp. 182--187."},"type":"conference","year":"2005","oa":"1","urn":"21146","_id":"2114","date_updated":"2022-01-06T06:54:47Z"},{"date_created":"2018-04-03T05:26:10Z","status":"public","has_accepted_license":"1","department":[{"_id":"79"}],"publication":"ISPAN","file_date_updated":"2018-04-13T08:50:40Z","author":[{"full_name":"Kothapalli, Kishore","first_name":"Kishore","last_name":"Kothapalli"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"relation":"main_file","date_updated":"2018-04-13T08:50:40Z","content_type":"application/pdf","file_id":"2326","creator":"florida","file_size":69350,"access_level":"open_access","file_name":"KS-ISPAN-05-Supervised.pdf","date_created":"2018-04-13T08:50:40Z"}],"title":"Supervised Peer-to-Peer Systems","ddc":["040"],"user_id":"15504","page":"188--193","type":"conference","year":"2005","citation":{"mla":"Kothapalli, Kishore, and Christian Scheideler. “Supervised Peer-to-Peer Systems.” ISPAN, 2005, pp. 188--193.","bibtex":"@inproceedings{Kothapalli_Scheideler_2005, title={Supervised Peer-to-Peer Systems}, booktitle={ISPAN}, author={Kothapalli, Kishore and Scheideler, Christian}, year={2005}, pages={188--193} }","chicago":"Kothapalli, Kishore, and Christian Scheideler. “Supervised Peer-to-Peer Systems.” In ISPAN, 188--193, 2005.","apa":"Kothapalli, K., & Scheideler, C. (2005). Supervised Peer-to-Peer Systems. In ISPAN (pp. 188--193).","ama":"Kothapalli K, Scheideler C. Supervised Peer-to-Peer Systems. In: ISPAN. ; 2005:188--193.","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."},"oa":"1","urn":"21156","date_updated":"2022-01-06T06:54:47Z","_id":"2115"},{"title":"Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks","ddc":["040"],"user_id":"15504","date_created":"2018-04-03T05:26:50Z","has_accepted_license":"1","status":"public","publication":"ISPAN","department":[{"_id":"79"}],"file_date_updated":"2018-04-13T08:55:51Z","author":[{"last_name":"Onus","first_name":"Melih","full_name":"Onus, Melih"},{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"last_name":"Kothapalli","full_name":"Kothapalli, Kishore","first_name":"Kishore"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"date_created":"2018-04-13T08:55:51Z","file_name":"KORS-ISPAN-05.pdf","access_level":"open_access","file_size":135267,"creator":"florida","file_id":"2327","date_updated":"2018-04-13T08:55:51Z","content_type":"application/pdf","relation":"main_file"}],"oa":"1","urn":"21165","date_updated":"2022-01-06T06:54:48Z","_id":"2116","page":"346--351","type":"conference","year":"2005","citation":{"ama":"Onus M, W. Richa A, Kothapalli K, Scheideler C. Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks. In: ISPAN. ; 2005:346--351.","apa":"Onus, M., W. Richa, A., Kothapalli, K., & Scheideler, C. (2005). Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks. In ISPAN (pp. 346--351).","chicago":"Onus, Melih, Andrea W. Richa, Kishore Kothapalli, and Christian Scheideler. “Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks.” In ISPAN, 346--351, 2005.","mla":"Onus, Melih, et al. “Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks.” ISPAN, 2005, pp. 346--351.","bibtex":"@inproceedings{Onus_W. Richa_Kothapalli_Scheideler_2005, title={Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks}, booktitle={ISPAN}, author={Onus, Melih and W. Richa, Andrea and Kothapalli, Kishore and Scheideler, Christian}, year={2005}, pages={346--351} }","short":"M. Onus, A. W. Richa, K. Kothapalli, C. Scheideler, in: ISPAN, 2005, pp. 346--351.","ieee":"M. Onus, A. W. Richa, K. Kothapalli, and C. Scheideler, “Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks,” in ISPAN, 2005, pp. 346--351."}},{"date_created":"2018-04-03T05:28:33Z","status":"public","has_accepted_license":"1","department":[{"_id":"79"}],"publication":"SPAA","file_date_updated":"2018-04-13T08:56:49Z","author":[{"first_name":"Kishore","full_name":"Kothapalli, Kishore","last_name":"Kothapalli"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"first_name":"Melih","full_name":"Onus, Melih","last_name":"Onus"},{"first_name":"Andrea","full_name":"W. Richa, Andrea","last_name":"W. Richa"}],"file":[{"content_type":"application/pdf","date_updated":"2018-04-13T08:56:49Z","relation":"main_file","file_size":118644,"file_id":"2328","creator":"florida","access_level":"open_access","file_name":"SPAA-05.pdf","date_created":"2018-04-13T08:56:49Z"}],"ddc":["040"],"title":"Constant density spanners for wireless ad-hoc networks","user_id":"15504","page":"116--125","year":"2005","citation":{"bibtex":"@inproceedings{Kothapalli_Scheideler_Onus_W. Richa_2005, title={Constant density spanners for wireless ad-hoc networks}, booktitle={SPAA}, author={Kothapalli, Kishore and Scheideler, Christian and Onus, Melih and W. Richa, Andrea}, year={2005}, pages={116--125} }","mla":"Kothapalli, Kishore, et al. “Constant Density Spanners for Wireless Ad-Hoc Networks.” SPAA, 2005, pp. 116--125.","chicago":"Kothapalli, Kishore, Christian Scheideler, Melih Onus, and Andrea W. Richa. “Constant Density Spanners for Wireless Ad-Hoc Networks.” In SPAA, 116--125, 2005.","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."},"type":"conference","oa":"1","urn":"21175","date_updated":"2022-01-06T06:54:48Z","_id":"2117"},{"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.","apa":"Scheideler, C. (2005). How to spread adversarial nodes?: rotate! In STOC (pp. 704--713).","ama":"Scheideler C. How to spread adversarial nodes?: rotate! In: STOC. ; 2005:704--713.","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."},"year":"2005","type":"conference","page":"704--713","oa":"1","date_updated":"2022-01-06T06:54:49Z","_id":"2118","urn":"21185","has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:29:27Z","file":[{"date_updated":"2018-04-13T08:58:22Z","content_type":"application/pdf","relation":"main_file","file_size":134460,"file_id":"2330","creator":"florida","access_level":"open_access","date_created":"2018-04-13T08:58:22Z","file_name":"STOC-05.pdf"}],"author":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publication":"STOC","department":[{"_id":"79"}],"file_date_updated":"2018-04-13T08:58:22Z","user_id":"15504","ddc":["040"],"title":"How to spread adversarial nodes?: rotate!"},{"has_accepted_license":"1","status":"public","date_created":"2018-04-05T07:05:16Z","file":[{"date_created":"2018-04-13T08:57:39Z","file_name":"IMA-05.pdf","access_level":"open_access","file_id":"2329","creator":"florida","file_size":295333,"relation":"main_file","date_updated":"2018-04-13T08:57:39Z","content_type":"application/pdf"}],"author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file_date_updated":"2018-04-13T08:57:39Z","department":[{"_id":"79"}],"publication":"IMA Workshop on Wireless Communications","user_id":"15504","ddc":["040"],"title":"Overlay networks for wireless ad hoc networks","type":"conference","citation":{"short":"C. Scheideler, in: IMA Workshop on Wireless Communications, 2005.","ieee":"C. Scheideler, “Overlay networks for wireless ad hoc networks,” in IMA Workshop on Wireless Communications, 2005.","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.","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."},"year":"2005","oa":"1","_id":"2212","date_updated":"2022-01-06T06:55:26Z","urn":"22129"},{"date_created":"2018-04-03T05:30:23Z","status":"public","department":[{"_id":"79"}],"publication":"Algorithmica","author":[{"first_name":"Petr","full_name":"Kolman, Petr","last_name":"Kolman"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"title":"Simple On-Line Algorithms for the Maximum Disjoint Paths Problem","user_id":"15504","page":"209--233","year":"2004","citation":{"chicago":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” Algorithmica, no. 3 (2004): 209--233. https://doi.org/10.1007/s00453-004-1086-1.","ama":"Kolman P, Scheideler C. Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. Algorithmica. 2004;(3):209--233. doi:10.1007/s00453-004-1086-1","apa":"Kolman, P., & Scheideler, C. (2004). Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. Algorithmica, (3), 209--233. https://doi.org/10.1007/s00453-004-1086-1","bibtex":"@article{Kolman_Scheideler_2004, title={Simple On-Line Algorithms for the Maximum Disjoint Paths Problem}, DOI={10.1007/s00453-004-1086-1}, number={3}, journal={Algorithmica}, author={Kolman, Petr and Scheideler, Christian}, year={2004}, pages={209--233} }","mla":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” Algorithmica, no. 3, 2004, pp. 209--233, doi:10.1007/s00453-004-1086-1.","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."},"type":"journal_article","doi":"10.1007/s00453-004-1086-1","issue":"3","_id":"2119","date_updated":"2022-01-06T06:54:49Z"}]