[{"user_id":"15504","editor":[{"full_name":"B. Gibbons, Phillip","first_name":"Phillip","last_name":"B. Gibbons"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"_id":"2027","publisher":"ACM","date_updated":"2022-01-06T06:54:25Z","year":"2007","status":"public","title":"SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007","publication_identifier":{"isbn":["978-1-59593-667-7"]},"type":"conference_editor","department":[{"_id":"79"}],"date_created":"2018-03-29T11:59:46Z","citation":{"chicago":"B. Gibbons, Phillip, and Christian Scheideler, eds. <i>SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007</i>. ACM, 2007.","short":"P. B. Gibbons, C. Scheideler, eds., SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007, ACM, 2007.","apa":"B. Gibbons, P., &#38; Scheideler, C. (Eds.). (2007). <i>SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007</i>. ACM.","ieee":"P. B. Gibbons and C. Scheideler, Eds., <i>SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007</i>. ACM, 2007.","ama":"B. Gibbons P, Scheideler C, eds. <i>SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007</i>. ACM; 2007.","bibtex":"@book{B. Gibbons_Scheideler_2007, title={SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007}, publisher={ACM}, year={2007} }","mla":"B. Gibbons, Phillip, and Christian Scheideler, editors. <i>SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007</i>. ACM, 2007."}},{"doi":"10.1201/9781420010749.ch72","user_id":"15504","_id":"2028","date_updated":"2022-01-06T06:54:25Z","author":[{"first_name":"Andrea","last_name":"W. Richa","full_name":"W. Richa, Andrea"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"publication_identifier":{"isbn":["978-1-58488-550-4"]},"status":"public","year":"2007","title":"Overlay Networks for Peer-to-Peer Networks","department":[{"_id":"79"}],"type":"book_chapter","date_created":"2018-03-29T12:00:39Z","citation":{"ama":"W. Richa A, Scheideler C. Overlay Networks for Peer-to-Peer Networks. In: <i>Handbook of Approximation Algorithms and Metaheuristics.</i> ; 2007. doi:<a href=\"https://doi.org/10.1201/9781420010749.ch72\">10.1201/9781420010749.ch72</a>","bibtex":"@inbook{W. Richa_Scheideler_2007, title={Overlay Networks for Peer-to-Peer Networks}, DOI={<a href=\"https://doi.org/10.1201/9781420010749.ch72\">10.1201/9781420010749.ch72</a>}, 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.” <i>Handbook of Approximation Algorithms and Metaheuristics.</i>, 2007, doi:<a href=\"https://doi.org/10.1201/9781420010749.ch72\">10.1201/9781420010749.ch72</a>.","chicago":"W. Richa, Andrea, and Christian Scheideler. “Overlay Networks for Peer-to-Peer Networks.” In <i>Handbook of Approximation Algorithms and Metaheuristics.</i>, 2007. <a href=\"https://doi.org/10.1201/9781420010749.ch72\">https://doi.org/10.1201/9781420010749.ch72</a>.","short":"A. W. Richa, C. Scheideler, in: Handbook of Approximation Algorithms and Metaheuristics., 2007.","apa":"W. Richa, A., &#38; Scheideler, C. (2007). Overlay Networks for Peer-to-Peer Networks. In <i>Handbook of Approximation Algorithms and Metaheuristics.</i> <a href=\"https://doi.org/10.1201/9781420010749.ch72\">https://doi.org/10.1201/9781420010749.ch72</a>","ieee":"A. W. Richa and C. Scheideler, “Overlay Networks for Peer-to-Peer Networks,” in <i>Handbook of Approximation Algorithms and Metaheuristics.</i>, 2007."},"publication":"Handbook of Approximation Algorithms and Metaheuristics."},{"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."}],"publication":"IEEE International Conference on Distributed Computing Systems (ICDCS)","file_date_updated":"2018-04-13T10:01:42Z","citation":{"short":"A. Brinkmann, S. Effert, F. Meyer auf der Heide, C. Scheideler, 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 <i>IEEE International Conference on Distributed Computing Systems (ICDCS)</i>, 2007.","apa":"Brinkmann, A., Effert, S., Meyer auf der Heide, F., &#38; Scheideler, C. (2007). Dynamic and redundant data placement. <i>IEEE International Conference on Distributed Computing Systems (ICDCS)</i>.","ieee":"A. Brinkmann, S. Effert, F. Meyer auf der Heide, and C. Scheideler, “Dynamic and redundant data placement,” 2007.","ama":"Brinkmann A, Effert S, Meyer auf der Heide F, Scheideler C. Dynamic and redundant data placement. In: <i>IEEE International Conference on Distributed Computing Systems (ICDCS)</i>. ; 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} }","mla":"Brinkmann, André, et al. “Dynamic and Redundant Data Placement.” <i>IEEE International Conference on Distributed Computing Systems (ICDCS)</i>, 2007."},"type":"conference","oa":"1","department":[{"_id":"79"},{"_id":"63"}],"file":[{"content_type":"application/pdf","file_id":"2339","date_updated":"2018-04-13T10:01:42Z","relation":"main_file","file_size":164121,"access_level":"open_access","file_name":"ICDCS07.pdf","date_created":"2018-04-13T10:01:42Z","creator":"florida"}],"date_created":"2018-04-05T07:08:35Z","date_updated":"2022-01-06T06:55:27Z","has_accepted_license":"1","status":"public","title":"Dynamic and redundant data placement","year":"2007","author":[{"last_name":"Brinkmann","first_name":"André","full_name":"Brinkmann, André"},{"last_name":"Effert","first_name":"Sascha","full_name":"Effert, Sascha"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"ddc":["040"],"user_id":"15415","_id":"2214","language":[{"iso":"eng"}],"urn":"22147"},{"date_created":"2018-04-05T06:08:43Z","type":"journal_article","department":[{"_id":"79"}],"publication":"ACM Computer Commucation Review","citation":{"apa":"Aggarwal, V., Feldmann, A., &#38; Scheideler, C. (2007). Can ISPs and P2P users cooperate for improved performance? <i>ACM Computer Commucation Review</i>. <a href=\"https://doi.org/10.1145/1273445.1273449\">https://doi.org/10.1145/1273445.1273449</a>","ieee":"V. Aggarwal, A. Feldmann, and C. Scheideler, “Can ISPs and P2P users cooperate for improved performance?,” <i>ACM Computer Commucation Review</i>, 2007.","short":"V. Aggarwal, A. Feldmann, C. Scheideler, ACM Computer Commucation Review (2007).","chicago":"Aggarwal, Vinay, Anja Feldmann, and Christian Scheideler. “Can ISPs and P2P Users Cooperate for Improved Performance?” <i>ACM Computer Commucation Review</i>, 2007. <a href=\"https://doi.org/10.1145/1273445.1273449\">https://doi.org/10.1145/1273445.1273449</a>.","mla":"Aggarwal, Vinay, et al. “Can ISPs and P2P Users Cooperate for Improved Performance?” <i>ACM Computer Commucation Review</i>, 2007, doi:<a href=\"https://doi.org/10.1145/1273445.1273449\">10.1145/1273445.1273449</a>.","ama":"Aggarwal V, Feldmann A, Scheideler C. Can ISPs and P2P users cooperate for improved performance? <i>ACM Computer Commucation Review</i>. 2007. doi:<a href=\"https://doi.org/10.1145/1273445.1273449\">10.1145/1273445.1273449</a>","bibtex":"@article{Aggarwal_Feldmann_Scheideler_2007, title={Can ISPs and P2P users cooperate for improved performance?}, DOI={<a href=\"https://doi.org/10.1145/1273445.1273449\">10.1145/1273445.1273449</a>}, journal={ACM Computer Commucation Review}, author={Aggarwal, Vinay and Feldmann, Anja and Scheideler, Christian}, year={2007} }"},"_id":"2209","doi":"10.1145/1273445.1273449","user_id":"15504","year":"2007","status":"public","title":"Can ISPs and P2P users cooperate for improved performance?","author":[{"last_name":"Aggarwal","first_name":"Vinay","full_name":"Aggarwal, Vinay"},{"last_name":"Feldmann","first_name":"Anja","full_name":"Feldmann, Anja"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"date_updated":"2022-01-06T06:55:25Z"},{"intvolume":"        61","date_updated":"2022-01-06T06:54:25Z","author":[{"full_name":"Kolman, Petr","last_name":"Kolman","first_name":"Petr"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"title":"Improved bounds for the unsplittable flow problem","year":"2006","status":"public","volume":61,"doi":"10.1016/j.jalgor.2004.07.006","user_id":"15504","_id":"2029","page":"20--44","citation":{"apa":"Kolman, P., &#38; Scheideler, C. (2006). Improved bounds for the unsplittable flow problem. <i>J. Algorithms</i>, <i>61</i>(1), 20--44. <a href=\"https://doi.org/10.1016/j.jalgor.2004.07.006\">https://doi.org/10.1016/j.jalgor.2004.07.006</a>","ieee":"P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,” <i>J. Algorithms</i>, vol. 61, no. 1, pp. 20--44, 2006.","chicago":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” <i>J. Algorithms</i> 61, no. 1 (2006): 20--44. <a href=\"https://doi.org/10.1016/j.jalgor.2004.07.006\">https://doi.org/10.1016/j.jalgor.2004.07.006</a>.","short":"P. Kolman, C. Scheideler, J. Algorithms 61 (2006) 20--44.","mla":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” <i>J. Algorithms</i>, vol. 61, no. 1, 2006, pp. 20--44, doi:<a href=\"https://doi.org/10.1016/j.jalgor.2004.07.006\">10.1016/j.jalgor.2004.07.006</a>.","ama":"Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem. <i>J Algorithms</i>. 2006;61(1):20--44. doi:<a href=\"https://doi.org/10.1016/j.jalgor.2004.07.006\">10.1016/j.jalgor.2004.07.006</a>","bibtex":"@article{Kolman_Scheideler_2006, title={Improved bounds for the unsplittable flow problem}, volume={61}, DOI={<a href=\"https://doi.org/10.1016/j.jalgor.2004.07.006\">10.1016/j.jalgor.2004.07.006</a>}, number={1}, journal={J. Algorithms}, author={Kolman, Petr and Scheideler, Christian}, year={2006}, pages={20--44} }"},"issue":"1","publication":"J. Algorithms","department":[{"_id":"79"}],"type":"journal_article","date_created":"2018-03-29T12:01:37Z"},{"doi":"10.1109/TMC.2006.138","user_id":"15504","page":"1242--1254","_id":"2110","date_updated":"2022-01-06T06:54:45Z","title":"Survivable Monitoring in Dynamic Networks","year":"2006","status":"public","author":[{"full_name":"Ateniese, Giuseppe","last_name":"Ateniese","first_name":"Giuseppe"},{"full_name":"Riley, Chris","first_name":"Chris","last_name":"Riley"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"type":"journal_article","department":[{"_id":"79"}],"date_created":"2018-04-03T05:21:30Z","publication":"IEEE Trans. Mob. Comput.","issue":"9","citation":{"mla":"Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.” <i>IEEE Trans. Mob. Comput.</i>, no. 9, 2006, pp. 1242--1254, doi:<a href=\"https://doi.org/10.1109/TMC.2006.138\">10.1109/TMC.2006.138</a>.","ama":"Ateniese G, Riley C, Scheideler C. Survivable Monitoring in Dynamic Networks. <i>IEEE Trans Mob Comput</i>. 2006;(9):1242--1254. doi:<a href=\"https://doi.org/10.1109/TMC.2006.138\">10.1109/TMC.2006.138</a>","bibtex":"@article{Ateniese_Riley_Scheideler_2006, title={Survivable Monitoring in Dynamic Networks}, DOI={<a href=\"https://doi.org/10.1109/TMC.2006.138\">10.1109/TMC.2006.138</a>}, number={9}, journal={IEEE Trans. Mob. Comput.}, author={Ateniese, Giuseppe and Riley, Chris and Scheideler, Christian}, year={2006}, pages={1242--1254} }","apa":"Ateniese, G., Riley, C., &#38; Scheideler, C. (2006). Survivable Monitoring in Dynamic Networks. <i>IEEE Trans. Mob. Comput.</i>, (9), 1242--1254. <a href=\"https://doi.org/10.1109/TMC.2006.138\">https://doi.org/10.1109/TMC.2006.138</a>","ieee":"G. Ateniese, C. Riley, and C. Scheideler, “Survivable Monitoring in Dynamic Networks,” <i>IEEE Trans. Mob. Comput.</i>, no. 9, pp. 1242--1254, 2006.","short":"G. Ateniese, C. Riley, C. Scheideler, IEEE Trans. Mob. Comput. (2006) 1242--1254.","chicago":"Ateniese, Giuseppe, Chris Riley, and Christian Scheideler. “Survivable Monitoring in Dynamic Networks.” <i>IEEE Trans. Mob. Comput.</i>, no. 9 (2006): 1242--1254. <a href=\"https://doi.org/10.1109/TMC.2006.138\">https://doi.org/10.1109/TMC.2006.138</a>."}},{"file":[{"content_type":"application/pdf","file_id":"2334","access_level":"open_access","file_size":192708,"file_name":"IPDPS06.pdf","date_updated":"2018-04-13T09:57:03Z","relation":"main_file","date_created":"2018-04-13T09:57:03Z","creator":"florida"}],"date_created":"2018-04-03T05:22:43Z","type":"conference","department":[{"_id":"79"}],"oa":"1","file_date_updated":"2018-04-13T09:57:03Z","publication":"IPDPS","citation":{"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} }","ama":"Kothapalli K, Scheideler C, Onus M, Schindelhauer C. Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds. In: <i>IPDPS</i>. ; 2006.","mla":"Kothapalli, Kishore, et al. “Distributed Coloring in O/Spl Tilde/(/Spl Radic/(Log n)) Bit Rounds.” <i>IPDPS</i>, 2006.","chicago":"Kothapalli, Kishore, Christian Scheideler, Melih Onus, and Christian Schindelhauer. “Distributed Coloring in O/Spl Tilde/(/Spl Radic/(Log n)) Bit Rounds.” In <i>IPDPS</i>, 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 <i>IPDPS</i>, 2006.","apa":"Kothapalli, K., Scheideler, C., Onus, M., &#38; Schindelhauer, C. (2006). Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds. In <i>IPDPS</i>."},"urn":"21110","_id":"2111","user_id":"15504","ddc":["040"],"status":"public","title":"Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds","year":"2006","author":[{"full_name":"Kothapalli, Kishore","last_name":"Kothapalli","first_name":"Kishore"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Onus","first_name":"Melih","full_name":"Onus, Melih"},{"first_name":"Christian","last_name":"Schindelhauer","full_name":"Schindelhauer, Christian"}],"date_updated":"2022-01-06T06:54:46Z","has_accepted_license":"1"},{"citation":{"short":"B. Awerbuch, C. Scheideler, in: OPODIS, 2006, pp. 275--289.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.” In <i>OPODIS</i>, 275--289. Lecture Notes in Computer Science, 2006.","ieee":"B. Awerbuch and C. Scheideler, “Robust Random Number Generation for Peer-to-Peer Systems,” in <i>OPODIS</i>, 2006, pp. 275--289.","apa":"Awerbuch, B., &#38; Scheideler, C. (2006). Robust Random Number Generation for Peer-to-Peer Systems. In <i>OPODIS</i> (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: <i>OPODIS</i>. Lecture Notes in Computer Science. ; 2006:275--289.","mla":"Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.” <i>OPODIS</i>, 2006, pp. 275--289."},"file_date_updated":"2018-04-13T09:57:51Z","publication":"OPODIS","date_created":"2018-04-03T05:23:39Z","file":[{"access_level":"open_access","file_size":198976,"file_name":"OPODIS06.pdf","date_updated":"2018-04-13T09:57:51Z","relation":"main_file","content_type":"application/pdf","file_id":"2335","creator":"florida","date_created":"2018-04-13T09:57:51Z"}],"department":[{"_id":"79"}],"oa":"1","type":"conference","author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"title":"Robust Random Number Generation for Peer-to-Peer Systems","status":"public","year":"2006","has_accepted_license":"1","date_updated":"2022-01-06T06:54:46Z","_id":"2112","series_title":"Lecture Notes in Computer Science","urn":"21128","page":"275--289","user_id":"15504","ddc":["040"]},{"user_id":"15504","ddc":["040"],"page":"318--327","urn":"21137","_id":"2113","date_updated":"2022-01-06T06:54:46Z","has_accepted_license":"1","title":"Towards a scalable and robust DHT","status":"public","year":"2006","author":[{"full_name":"Awerbuch, Baruch","last_name":"Awerbuch","first_name":"Baruch"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"type":"conference","department":[{"_id":"79"}],"oa":"1","file":[{"date_created":"2018-04-13T10:00:09Z","creator":"florida","content_type":"application/pdf","file_id":"2337","file_size":144588,"access_level":"open_access","file_name":"SPAA06.pdf","date_updated":"2018-04-13T10:00:09Z","relation":"main_file"}],"date_created":"2018-04-03T05:24:22Z","file_date_updated":"2018-04-13T10:00:09Z","publication":"SPAA","citation":{"chicago":"Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.” In <i>SPAA</i>, 318--327, 2006.","short":"B. Awerbuch, C. Scheideler, in: SPAA, 2006, pp. 318--327.","ieee":"B. Awerbuch and C. Scheideler, “Towards a scalable and robust DHT,” in <i>SPAA</i>, 2006, pp. 318--327.","apa":"Awerbuch, B., &#38; Scheideler, C. (2006). Towards a scalable and robust DHT. In <i>SPAA</i> (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} }","ama":"Awerbuch B, Scheideler C. Towards a scalable and robust DHT. In: <i>SPAA</i>. ; 2006:318--327.","mla":"Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.” <i>SPAA</i>, 2006, pp. 318--327."}},{"date_created":"2018-03-29T12:32:54Z","department":[{"_id":"79"}],"type":"journal_article","citation":{"mla":"Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” <i>Theory Comput. Syst.</i>, no. 6, 2006, pp. 903--928, doi:<a href=\"https://doi.org/10.1007/s00224-006-1349-0\">10.1007/s00224-006-1349-0</a>.","bibtex":"@article{Bagchi_Bhargava_Chaudhary_Eppstein_Scheideler_2006, title={The Effect of Faults on Network Expansion}, DOI={<a href=\"https://doi.org/10.1007/s00224-006-1349-0\">10.1007/s00224-006-1349-0</a>}, 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. <i>Theory Comput Syst</i>. 2006;(6):903--928. doi:<a href=\"https://doi.org/10.1007/s00224-006-1349-0\">10.1007/s00224-006-1349-0</a>","ieee":"A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler, “The Effect of Faults on Network Expansion,” <i>Theory Comput. Syst.</i>, no. 6, pp. 903--928, 2006.","apa":"Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., &#38; Scheideler, C. (2006). The Effect of Faults on Network Expansion. <i>Theory Comput. Syst.</i>, (6), 903--928. <a href=\"https://doi.org/10.1007/s00224-006-1349-0\">https://doi.org/10.1007/s00224-006-1349-0</a>","short":"A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, Theory Comput. Syst. (2006) 903--928.","chicago":"Bagchi, Amitabha, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, and Christian Scheideler. “The Effect of Faults on Network Expansion.” <i>Theory Comput. Syst.</i>, no. 6 (2006): 903--928. <a href=\"https://doi.org/10.1007/s00224-006-1349-0\">https://doi.org/10.1007/s00224-006-1349-0</a>."},"issue":"6","publication":"Theory Comput. Syst.","_id":"2043","page":"903--928","doi":"10.1007/s00224-006-1349-0","user_id":"15504","author":[{"last_name":"Bagchi","first_name":"Amitabha","full_name":"Bagchi, Amitabha"},{"full_name":"Bhargava, Ankur","first_name":"Ankur","last_name":"Bhargava"},{"full_name":"Chaudhary, Amitabh","last_name":"Chaudhary","first_name":"Amitabh"},{"full_name":"Eppstein, David","last_name":"Eppstein","first_name":"David"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"status":"public","title":"The Effect of Faults on Network Expansion","year":"2006","date_updated":"2022-01-06T06:54:27Z"},{"date_updated":"2022-01-06T06:55:27Z","has_accepted_license":"1","title":"Towards a paradigm for robust distributed algorithms and data structures","status":"public","year":"2006","author":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"ddc":["040"],"user_id":"15504","urn":"22137","_id":"2213","publication":"6th International HNI Symposium on New Trends in Parallel and Distributed Computing","file_date_updated":"2018-04-13T09:59:14Z","citation":{"ieee":"C. Scheideler, “Towards a paradigm for robust distributed algorithms and data structures,” in <i>6th International HNI Symposium on New Trends in Parallel and Distributed Computing</i>, 2006.","apa":"Scheideler, C. (2006). Towards a paradigm for robust distributed algorithms and data structures. In <i>6th International HNI Symposium on New Trends in Parallel and Distributed Computing</i>.","short":"C. Scheideler, 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 <i>6th International HNI Symposium on New Trends in Parallel and Distributed Computing</i>, 2006.","mla":"Scheideler, Christian. “Towards a Paradigm for Robust Distributed Algorithms and Data Structures.” <i>6th International HNI Symposium on New Trends in Parallel and Distributed Computing</i>, 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} }","ama":"Scheideler C. Towards a paradigm for robust distributed algorithms and data structures. In: <i>6th International HNI Symposium on New Trends in Parallel and Distributed Computing</i>. ; 2006."},"type":"conference","oa":"1","department":[{"_id":"79"}],"file":[{"creator":"florida","date_created":"2018-04-13T09:59:14Z","file_size":85116,"access_level":"open_access","file_name":"HNI-Symposium-06.pdf","date_updated":"2018-04-13T09:59:14Z","relation":"main_file","content_type":"application/pdf","file_id":"2336"}],"date_created":"2018-04-05T07:06:44Z"},{"page":"182--187","_id":"2114","urn":"21146","ddc":["040"],"user_id":"15504","year":"2005","title":"Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment","status":"public","author":[{"first_name":"Miroslaw","last_name":"Korzeniowski","full_name":"Korzeniowski, Miroslaw"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"date_updated":"2022-01-06T06:54:47Z","has_accepted_license":"1","file":[{"date_created":"2018-04-13T08:45:41Z","creator":"florida","content_type":"application/pdf","file_id":"2325","date_updated":"2018-04-13T08:45:41Z","relation":"main_file","file_size":110389,"access_level":"open_access","file_name":"KS-ISPAN-05-TransData.pdf"}],"date_created":"2018-04-03T05:25:16Z","type":"conference","oa":"1","department":[{"_id":"79"}],"publication":"ISPAN","file_date_updated":"2018-04-13T08:45:41Z","citation":{"short":"M. Korzeniowski, C. Scheideler, in: ISPAN, 2005, pp. 182--187.","chicago":"Korzeniowski, Miroslaw, and Christian Scheideler. “Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment.” In <i>ISPAN</i>, 182--187, 2005.","apa":"Korzeniowski, M., &#38; Scheideler, C. (2005). Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment. In <i>ISPAN</i> (pp. 182--187).","ieee":"M. Korzeniowski and C. Scheideler, “Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment,” in <i>ISPAN</i>, 2005, pp. 182--187.","ama":"Korzeniowski M, Scheideler C. Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment. In: <i>ISPAN</i>. ; 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.” <i>ISPAN</i>, 2005, pp. 182--187."}},{"ddc":["040"],"user_id":"15504","page":"188--193","_id":"2115","urn":"21156","date_updated":"2022-01-06T06:54:47Z","has_accepted_license":"1","year":"2005","status":"public","title":"Supervised Peer-to-Peer Systems","author":[{"full_name":"Kothapalli, Kishore","last_name":"Kothapalli","first_name":"Kishore"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"type":"conference","oa":"1","department":[{"_id":"79"}],"file":[{"creator":"florida","date_created":"2018-04-13T08:50:40Z","relation":"main_file","date_updated":"2018-04-13T08:50:40Z","file_name":"KS-ISPAN-05-Supervised.pdf","file_size":69350,"access_level":"open_access","file_id":"2326","content_type":"application/pdf"}],"date_created":"2018-04-03T05:26:10Z","publication":"ISPAN","file_date_updated":"2018-04-13T08:50:40Z","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} }","short":"K. Kothapalli, C. Scheideler, in: ISPAN, 2005, pp. 188--193.","ama":"Kothapalli K, Scheideler C. Supervised Peer-to-Peer Systems. In: <i>ISPAN</i>. ; 2005:188--193.","chicago":"Kothapalli, Kishore, and Christian Scheideler. “Supervised Peer-to-Peer Systems.” In <i>ISPAN</i>, 188--193, 2005.","ieee":"K. Kothapalli and C. Scheideler, “Supervised Peer-to-Peer Systems,” in <i>ISPAN</i>, 2005, pp. 188--193.","mla":"Kothapalli, Kishore, and Christian Scheideler. “Supervised Peer-to-Peer Systems.” <i>ISPAN</i>, 2005, pp. 188--193.","apa":"Kothapalli, K., &#38; Scheideler, C. (2005). Supervised Peer-to-Peer Systems. In <i>ISPAN</i> (pp. 188--193)."}},{"publication":"ISPAN","file_date_updated":"2018-04-13T08:55:51Z","citation":{"mla":"Onus, Melih, et al. “Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks.” <i>ISPAN</i>, 2005, pp. 346--351.","ama":"Onus M, W. Richa A, Kothapalli K, Scheideler C. Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks. In: <i>ISPAN</i>. ; 2005: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} }","apa":"Onus, M., W. Richa, A., Kothapalli, K., &#38; Scheideler, C. (2005). Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks. In <i>ISPAN</i> (pp. 346--351).","ieee":"M. Onus, A. W. Richa, K. Kothapalli, and C. Scheideler, “Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks,” in <i>ISPAN</i>, 2005, pp. 346--351.","chicago":"Onus, Melih, Andrea W. Richa, Kishore Kothapalli, and Christian Scheideler. “Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks.” In <i>ISPAN</i>, 346--351, 2005.","short":"M. Onus, A. W. Richa, K. Kothapalli, C. Scheideler, in: ISPAN, 2005, pp. 346--351."},"file":[{"date_created":"2018-04-13T08:55:51Z","creator":"florida","file_id":"2327","content_type":"application/pdf","file_name":"KORS-ISPAN-05.pdf","access_level":"open_access","file_size":135267,"relation":"main_file","date_updated":"2018-04-13T08:55:51Z"}],"date_created":"2018-04-03T05:26:50Z","type":"conference","oa":"1","department":[{"_id":"79"}],"title":"Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks","status":"public","year":"2005","author":[{"last_name":"Onus","first_name":"Melih","full_name":"Onus, Melih"},{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, Andrea"},{"first_name":"Kishore","last_name":"Kothapalli","full_name":"Kothapalli, Kishore"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_updated":"2022-01-06T06:54:48Z","has_accepted_license":"1","page":"346--351","_id":"2116","urn":"21165","ddc":["040"],"user_id":"15504"},{"file_date_updated":"2018-04-13T08:56:49Z","publication":"SPAA","citation":{"ama":"Kothapalli K, Scheideler C, Onus M, W. Richa A. Constant density spanners for wireless ad-hoc networks. In: <i>SPAA</i>. ; 2005:116--125.","bibtex":"@inproceedings{Kothapalli_Scheideler_Onus_W. Richa_2005, title={Constant density spanners for wireless ad-hoc networks}, booktitle={SPAA}, author={Kothapalli, Kishore and Scheideler, Christian and Onus, Melih and W. Richa, Andrea}, year={2005}, pages={116--125} }","mla":"Kothapalli, Kishore, et al. “Constant Density Spanners for Wireless Ad-Hoc Networks.” <i>SPAA</i>, 2005, pp. 116--125.","chicago":"Kothapalli, Kishore, Christian Scheideler, Melih Onus, and Andrea W. Richa. “Constant Density Spanners for Wireless Ad-Hoc Networks.” In <i>SPAA</i>, 116--125, 2005.","short":"K. Kothapalli, C. Scheideler, M. Onus, A. W. Richa, in: SPAA, 2005, pp. 116--125.","apa":"Kothapalli, K., Scheideler, C., Onus, M., &#38; W. Richa, A. (2005). Constant density spanners for wireless ad-hoc networks. In <i>SPAA</i> (pp. 116--125).","ieee":"K. Kothapalli, C. Scheideler, M. Onus, and A. W. Richa, “Constant density spanners for wireless ad-hoc networks,” in <i>SPAA</i>, 2005, pp. 116--125."},"type":"conference","department":[{"_id":"79"}],"oa":"1","file":[{"creator":"florida","date_created":"2018-04-13T08:56:49Z","file_name":"SPAA-05.pdf","access_level":"open_access","file_size":118644,"relation":"main_file","date_updated":"2018-04-13T08:56:49Z","file_id":"2328","content_type":"application/pdf"}],"date_created":"2018-04-03T05:28:33Z","date_updated":"2022-01-06T06:54:48Z","has_accepted_license":"1","year":"2005","title":"Constant density spanners for wireless ad-hoc networks","status":"public","author":[{"full_name":"Kothapalli, Kishore","last_name":"Kothapalli","first_name":"Kishore"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"full_name":"Onus, Melih","first_name":"Melih","last_name":"Onus"},{"first_name":"Andrea","last_name":"W. Richa","full_name":"W. Richa, Andrea"}],"user_id":"15504","ddc":["040"],"page":"116--125","_id":"2117","urn":"21175"},{"date_updated":"2022-01-06T06:54:49Z","has_accepted_license":"1","title":"How to spread adversarial nodes?: rotate!","year":"2005","status":"public","author":[{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"ddc":["040"],"user_id":"15504","page":"704--713","urn":"21185","_id":"2118","publication":"STOC","file_date_updated":"2018-04-13T08:58:22Z","citation":{"ieee":"C. Scheideler, “How to spread adversarial nodes?: rotate!,” in <i>STOC</i>, 2005, pp. 704--713.","apa":"Scheideler, C. (2005). How to spread adversarial nodes?: rotate! In <i>STOC</i> (pp. 704--713).","short":"C. Scheideler, in: STOC, 2005, pp. 704--713.","chicago":"Scheideler, Christian. “How to Spread Adversarial Nodes?: Rotate!” In <i>STOC</i>, 704--713, 2005.","mla":"Scheideler, Christian. “How to Spread Adversarial Nodes?: Rotate!” <i>STOC</i>, 2005, pp. 704--713.","bibtex":"@inproceedings{Scheideler_2005, title={How to spread adversarial nodes?: rotate!}, booktitle={STOC}, author={Scheideler, Christian}, year={2005}, pages={704--713} }","ama":"Scheideler C. How to spread adversarial nodes?: rotate! In: <i>STOC</i>. ; 2005:704--713."},"type":"conference","oa":"1","department":[{"_id":"79"}],"file":[{"date_created":"2018-04-13T08:58:22Z","creator":"florida","file_id":"2330","content_type":"application/pdf","relation":"main_file","date_updated":"2018-04-13T08:58:22Z","file_name":"STOC-05.pdf","file_size":134460,"access_level":"open_access"}],"date_created":"2018-04-03T05:29:27Z"},{"urn":"22129","_id":"2212","user_id":"15504","ddc":["040"],"author":[{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"title":"Overlay networks for wireless ad hoc networks","status":"public","year":"2005","has_accepted_license":"1","date_updated":"2022-01-06T06:55:26Z","date_created":"2018-04-05T07:05:16Z","file":[{"creator":"florida","date_created":"2018-04-13T08:57:39Z","file_name":"IMA-05.pdf","access_level":"open_access","file_size":295333,"relation":"main_file","date_updated":"2018-04-13T08:57:39Z","file_id":"2329","content_type":"application/pdf"}],"department":[{"_id":"79"}],"oa":"1","type":"conference","citation":{"ieee":"C. Scheideler, “Overlay networks for wireless ad hoc networks,” in <i>IMA Workshop on Wireless Communications</i>, 2005.","apa":"Scheideler, C. (2005). Overlay networks for wireless ad hoc networks. In <i>IMA Workshop on Wireless Communications</i>.","mla":"Scheideler, Christian. “Overlay Networks for Wireless Ad Hoc Networks.” <i>IMA Workshop on Wireless Communications</i>, 2005.","bibtex":"@inproceedings{Scheideler_2005, title={Overlay networks for wireless ad hoc networks}, booktitle={IMA Workshop on Wireless Communications}, author={Scheideler, Christian}, year={2005} }","chicago":"Scheideler, Christian. “Overlay Networks for Wireless Ad Hoc Networks.” In <i>IMA Workshop on Wireless Communications</i>, 2005.","short":"C. Scheideler, in: IMA Workshop on Wireless Communications, 2005.","ama":"Scheideler C. Overlay networks for wireless ad hoc networks. In: <i>IMA Workshop on Wireless Communications</i>. ; 2005."},"file_date_updated":"2018-04-13T08:57:39Z","publication":"IMA Workshop on Wireless Communications"},{"year":"2004","status":"public","title":"Simple On-Line Algorithms for the Maximum Disjoint Paths Problem","author":[{"full_name":"Kolman, Petr","first_name":"Petr","last_name":"Kolman"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_updated":"2022-01-06T06:54:49Z","page":"209--233","_id":"2119","doi":"10.1007/s00453-004-1086-1","user_id":"15504","publication":"Algorithmica","issue":"3","citation":{"bibtex":"@article{Kolman_Scheideler_2004, title={Simple On-Line Algorithms for the Maximum Disjoint Paths Problem}, DOI={<a href=\"https://doi.org/10.1007/s00453-004-1086-1\">10.1007/s00453-004-1086-1</a>}, number={3}, journal={Algorithmica}, author={Kolman, Petr and Scheideler, Christian}, year={2004}, pages={209--233} }","ama":"Kolman P, Scheideler C. Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. <i>Algorithmica</i>. 2004;(3):209--233. doi:<a href=\"https://doi.org/10.1007/s00453-004-1086-1\">10.1007/s00453-004-1086-1</a>","mla":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” <i>Algorithmica</i>, no. 3, 2004, pp. 209--233, doi:<a href=\"https://doi.org/10.1007/s00453-004-1086-1\">10.1007/s00453-004-1086-1</a>.","short":"P. Kolman, C. Scheideler, Algorithmica (2004) 209--233.","chicago":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” <i>Algorithmica</i>, no. 3 (2004): 209--233. <a href=\"https://doi.org/10.1007/s00453-004-1086-1\">https://doi.org/10.1007/s00453-004-1086-1</a>.","ieee":"P. Kolman and C. Scheideler, “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem,” <i>Algorithmica</i>, no. 3, pp. 209--233, 2004.","apa":"Kolman, P., &#38; Scheideler, C. (2004). Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. <i>Algorithmica</i>, (3), 209--233. <a href=\"https://doi.org/10.1007/s00453-004-1086-1\">https://doi.org/10.1007/s00453-004-1086-1</a>"},"date_created":"2018-04-03T05:30:23Z","type":"journal_article","department":[{"_id":"79"}]},{"oa":"1","citation":{"mla":"Awerbuch, Baruch, and Christian Scheideler. “Group Spreading: A Protocol for Provably Secure Distributed Name Service.” <i>ICALP</i>, vol. 3142, 2004, pp. 183--195.","bibtex":"@inproceedings{Awerbuch_Scheideler_2004, series={Lecture Notes in Computer Science}, title={Group Spreading: A Protocol for Provably Secure Distributed Name Service}, volume={3142}, booktitle={ICALP}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={183--195}, collection={Lecture Notes in Computer Science} }","ama":"Awerbuch B, Scheideler C. Group Spreading: A Protocol for Provably Secure Distributed Name Service. In: <i>ICALP</i>. Vol 3142. Lecture Notes in Computer Science. ; 2004:183--195.","ieee":"B. Awerbuch and C. Scheideler, “Group Spreading: A Protocol for Provably Secure Distributed Name Service,” in <i>ICALP</i>, 2004, vol. 3142, pp. 183--195.","apa":"Awerbuch, B., &#38; Scheideler, C. (2004). Group Spreading: A Protocol for Provably Secure Distributed Name Service. In <i>ICALP</i> (Vol. 3142, pp. 183--195).","short":"B. Awerbuch, C. Scheideler, in: ICALP, 2004, pp. 183--195.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Group Spreading: A Protocol for Provably Secure Distributed Name Service.” In <i>ICALP</i>, 3142:183--195. Lecture Notes in Computer Science, 2004."},"file_date_updated":"2018-04-12T09:20:16Z","urn":"21200","_id":"2120","page":"183--195","volume":3142,"user_id":"15504","ddc":["040"],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:31:04Z","file":[{"creator":"florida","date_created":"2018-04-12T09:20:16Z","date_updated":"2018-04-12T09:20:16Z","relation":"main_file","access_level":"open_access","file_size":145383,"file_name":"ICALP-04.pdf","content_type":"application/pdf","file_id":"2312"}],"department":[{"_id":"79"}],"type":"conference","publication":"ICALP","series_title":"Lecture Notes in Computer Science","author":[{"full_name":"Awerbuch, Baruch","last_name":"Awerbuch","first_name":"Baruch"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"title":"Group Spreading: A Protocol for Provably Secure Distributed Name Service","year":"2004","intvolume":"      3142","date_updated":"2022-01-06T06:54:49Z"},{"urn":"21212","_id":"2121","user_id":"15504","ddc":["040"],"year":"2004","title":"A Distributed Hash Table for Computational Grids","status":"public","author":[{"first_name":"Chris","last_name":"Riley","full_name":"Riley, Chris"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"date_updated":"2022-01-06T06:54:50Z","has_accepted_license":"1","file":[{"access_level":"open_access","file_size":91542,"file_name":"IPDPS-04.pdf","date_updated":"2018-04-12T09:50:26Z","relation":"main_file","content_type":"application/pdf","file_id":"2316","creator":"florida","date_created":"2018-04-12T09:50:26Z"}],"date_created":"2018-04-03T05:31:59Z","type":"conference","department":[{"_id":"79"}],"oa":"1","file_date_updated":"2018-04-12T09:50:26Z","publication":"IPDPS","citation":{"bibtex":"@inproceedings{Riley_Scheideler_2004, title={A Distributed Hash Table for Computational Grids}, booktitle={IPDPS}, author={Riley, Chris and Scheideler, Christian}, year={2004} }","ama":"Riley C, Scheideler C. A Distributed Hash Table for Computational Grids. In: <i>IPDPS</i>. ; 2004.","mla":"Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational Grids.” <i>IPDPS</i>, 2004.","chicago":"Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational Grids.” In <i>IPDPS</i>, 2004.","short":"C. Riley, C. Scheideler, in: IPDPS, 2004.","ieee":"C. Riley and C. Scheideler, “A Distributed Hash Table for Computational Grids,” in <i>IPDPS</i>, 2004.","apa":"Riley, C., &#38; Scheideler, C. (2004). A Distributed Hash Table for Computational Grids. In <i>IPDPS</i>."}}]