[{"oa":"1","_id":"2133","date_updated":"2022-01-06T06:54:55Z","urn":"21338","citation":{"short":"K. Kothapalli, C. Scheideler, in: SPAA, ACM, 2003, pp. 333--342.","ieee":"K. Kothapalli and C. Scheideler, “Information gathering in adversarial systems: lines and cycles,” in SPAA, 2003, pp. 333--342.","ama":"Kothapalli K, Scheideler C. Information gathering in adversarial systems: lines and cycles. In: SPAA. ACM; 2003:333--342.","apa":"Kothapalli, K., & Scheideler, C. (2003). Information gathering in adversarial systems: lines and cycles. In SPAA (pp. 333--342). ACM.","chicago":"Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial Systems: Lines and Cycles.” In SPAA, 333--342. ACM, 2003.","mla":"Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial Systems: Lines and Cycles.” SPAA, ACM, 2003, pp. 333--342.","bibtex":"@inproceedings{Kothapalli_Scheideler_2003, title={Information gathering in adversarial systems: lines and cycles}, booktitle={SPAA}, publisher={ACM}, author={Kothapalli, Kishore and Scheideler, Christian}, year={2003}, pages={333--342} }"},"type":"conference","year":"2003","page":"333--342","ddc":["040"],"title":"Information gathering in adversarial systems: lines and cycles","user_id":"15504","status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:42:48Z","author":[{"last_name":"Kothapalli","first_name":"Kishore","full_name":"Kothapalli, Kishore"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"ACM","department":[{"_id":"79"}],"file_date_updated":"2018-04-12T09:15:24Z","publication":"SPAA","file":[{"access_level":"open_access","file_name":"KS-SPAA-03.pdf","date_created":"2018-04-12T09:13:43Z","relation":"main_file","date_updated":"2018-04-12T09:15:24Z","content_type":"application/pdf","file_id":"2309","creator":"florida","file_size":121448}]},{"date_created":"2018-04-03T05:30:23Z","status":"public","publication":"Algorithmica","department":[{"_id":"79"}],"author":[{"full_name":"Kolman, Petr","first_name":"Petr","last_name":"Kolman"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"user_id":"15504","title":"Simple On-Line Algorithms for the Maximum Disjoint Paths Problem","page":"209--233","year":"2004","type":"journal_article","citation":{"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.","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."},"issue":"3","doi":"10.1007/s00453-004-1086-1","_id":"2119","date_updated":"2022-01-06T06:54:49Z"},{"title":"Group Spreading: A Protocol for Provably Secure Distributed Name Service","department":[{"_id":"79"}],"oa":"1","date_updated":"2022-01-06T06:54:49Z","series_title":"Lecture Notes in Computer Science","user_id":"15504","ddc":["040"],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:31:04Z","volume":3142,"file":[{"content_type":"application/pdf","date_updated":"2018-04-12T09:20:16Z","relation":"main_file","file_size":145383,"creator":"florida","file_id":"2312","access_level":"open_access","date_created":"2018-04-12T09:20:16Z","file_name":"ICALP-04.pdf"}],"author":[{"last_name":"Awerbuch","full_name":"Awerbuch, Baruch","first_name":"Baruch"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file_date_updated":"2018-04-12T09:20:16Z","publication":"ICALP","_id":"2120","intvolume":" 3142","urn":"21200","citation":{"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).","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.","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.","short":"B. Awerbuch, C. Scheideler, in: ICALP, 2004, pp. 183--195.","ieee":"B. Awerbuch and C. Scheideler, “Group Spreading: A Protocol for Provably Secure Distributed Name Service,” in ICALP, 2004, vol. 3142, pp. 183--195."},"type":"conference","year":"2004","page":"183--195"},{"oa":"1","date_updated":"2022-01-06T06:54:50Z","_id":"2121","urn":"21212","year":"2004","type":"conference","citation":{"bibtex":"@inproceedings{Riley_Scheideler_2004, title={A Distributed Hash Table for Computational Grids}, booktitle={IPDPS}, author={Riley, Chris and Scheideler, Christian}, year={2004} }","mla":"Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational Grids.” IPDPS, 2004.","chicago":"Riley, Chris, and Christian Scheideler. “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.","ama":"Riley C, Scheideler C. A Distributed Hash Table for Computational Grids. In: IPDPS. ; 2004.","ieee":"C. Riley and C. Scheideler, “A Distributed Hash Table for Computational Grids,” in IPDPS, 2004.","short":"C. Riley, C. Scheideler, in: IPDPS, 2004."},"user_id":"15504","ddc":["040"],"title":"A Distributed Hash Table for Computational Grids","status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:31:59Z","file":[{"access_level":"open_access","date_created":"2018-04-12T09:50:26Z","file_name":"IPDPS-04.pdf","relation":"main_file","date_updated":"2018-04-12T09:50:26Z","content_type":"application/pdf","creator":"florida","file_id":"2316","file_size":91542}],"author":[{"last_name":"Riley","full_name":"Riley, Chris","first_name":"Chris"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file_date_updated":"2018-04-12T09:50:26Z","department":[{"_id":"79"}],"publication":"IPDPS"},{"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:32:33Z","volume":3279,"file":[{"date_updated":"2018-04-12T11:39:38Z","content_type":"application/pdf","relation":"main_file","file_size":136987,"creator":"florida","file_id":"2318","access_level":"open_access","date_created":"2018-04-12T11:39:38Z","file_name":"IPTPS-04.pdf"}],"author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publication":"IPTPS","file_date_updated":"2018-04-12T11:39:38Z","user_id":"15504","ddc":["040"],"year":"2004","citation":{"ieee":"B. Awerbuch and C. Scheideler, “Robust Distributed Name Service,” in IPTPS, 2004, vol. 3279, pp. 237--249.","short":"B. Awerbuch, C. Scheideler, in: IPTPS, 2004, pp. 237--249.","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} }","ama":"Awerbuch B, Scheideler C. Robust Distributed Name Service. In: IPTPS. Vol 3279. Lecture Notes in Computer Science. ; 2004:237--249.","apa":"Awerbuch, B., & Scheideler, C. (2004). Robust Distributed Name Service. In IPTPS (Vol. 3279, pp. 237--249).","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.” In IPTPS, 3279:237--249. Lecture Notes in Computer Science, 2004."},"type":"conference","page":"237--249","intvolume":" 3279","_id":"2122","urn":"21229","department":[{"_id":"79"}],"title":"Robust Distributed Name Service","series_title":"Lecture Notes in Computer Science","oa":"1","date_updated":"2022-01-06T06:54:50Z"},{"urn":"21238","_id":"2123","date_updated":"2022-01-06T06:54:50Z","oa":"1","page":"33--47","year":"2004","citation":{"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.","chicago":"Ateniese, Giuseppe, Chris Riley, and Christian Scheideler. “Survivable Monitoring in Dynamic Networks.” In IWIA, 33--47, 2004.","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."},"type":"conference","user_id":"15504","title":"Survivable Monitoring in Dynamic Networks","ddc":["040"],"file":[{"relation":"main_file","date_updated":"2018-04-12T11:38:22Z","content_type":"application/pdf","creator":"florida","file_id":"2317","file_size":255111,"access_level":"open_access","file_name":"IIAW-04.pdf","date_created":"2018-04-12T11:38:22Z"}],"publication":"IWIA","department":[{"_id":"79"}],"file_date_updated":"2018-04-12T11:38:22Z","author":[{"full_name":"Ateniese, Giuseppe","first_name":"Giuseppe","last_name":"Ateniese"},{"last_name":"Riley","full_name":"Riley, Chris","first_name":"Chris"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"date_created":"2018-04-03T05:33:37Z","status":"public","has_accepted_license":"1"},{"ddc":["040"],"title":"The hyperring: a low-congestion deterministic data structure for distributed environments","user_id":"15504","date_created":"2018-04-03T05:34:17Z","has_accepted_license":"1","status":"public","publication":"SODA","department":[{"_id":"79"}],"file_date_updated":"2018-04-13T08:36:08Z","author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file":[{"file_id":"2323","creator":"florida","file_size":193831,"relation":"main_file","date_updated":"2018-04-13T08:36:08Z","content_type":"application/pdf","date_created":"2018-04-13T08:36:08Z","file_name":"SODA-04.pdf","access_level":"open_access"}],"oa":"1","urn":"21247","date_updated":"2022-01-06T06:54:51Z","_id":"2124","page":"318--327","citation":{"ieee":"B. Awerbuch and C. Scheideler, “The hyperring: a low-congestion deterministic data structure for distributed environments,” in SODA, 2004, pp. 318--327.","short":"B. Awerbuch, C. Scheideler, in: SODA, 2004, pp. 318--327.","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.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments.” In SODA, 318--327, 2004.","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)."},"year":"2004","type":"conference"},{"date_created":"2018-04-03T05:34:56Z","has_accepted_license":"1","status":"public","publication":"SPAA","file_date_updated":"2018-04-12T09:41:38Z","department":[{"_id":"79"}],"author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:41:38Z","creator":"florida","file_id":"2315","file_size":170429,"access_level":"open_access","date_created":"2018-04-12T09:41:38Z","file_name":"AS-SPAA-04.pdf"}],"ddc":["040"],"title":"Consistent and compact data management in distributed storage systems","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","oa":"1","urn":"21256","date_updated":"2022-01-06T06:54:51Z","_id":"2125"},{"type":"conference","year":"2004","citation":{"ieee":"A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, and M. Thober, “Pagoda: a dynamic overlay network for routing, data management, and multicasting,” in SPAA, 2004, pp. 170--179.","short":"A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, M. Thober, in: SPAA, 2004, pp. 170--179.","mla":"Bhargava, Ankur, et al. “Pagoda: A Dynamic Overlay Network for Routing, Data Management, and Multicasting.” SPAA, 2004, pp. 170--179.","bibtex":"@inproceedings{Bhargava_Kothapalli_Riley_Scheideler_Thober_2004, title={Pagoda: a dynamic overlay network for routing, data management, and multicasting}, booktitle={SPAA}, author={Bhargava, Ankur and Kothapalli, Kishore and Riley, Chris and Scheideler, Christian and Thober, Mark}, year={2004}, pages={170--179} }","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).","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."},"page":"170--179","oa":"1","_id":"2126","date_updated":"2022-01-06T06:54:52Z","urn":"21266","status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:35:31Z","file":[{"creator":"florida","file_id":"2314","file_size":118175,"relation":"main_file","date_updated":"2018-04-12T09:40:42Z","content_type":"application/pdf","file_name":"BKRST-SPAA-04.pdf","date_created":"2018-04-12T09:40:12Z","access_level":"open_access"}],"author":[{"first_name":"Ankur","full_name":"Bhargava, Ankur","last_name":"Bhargava"},{"last_name":"Kothapalli","first_name":"Kishore","full_name":"Kothapalli, Kishore"},{"first_name":"Chris","full_name":"Riley, Chris","last_name":"Riley"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Thober","full_name":"Thober, Mark","first_name":"Mark"}],"department":[{"_id":"79"}],"publication":"SPAA","file_date_updated":"2018-04-12T09:40:42Z","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","department":[{"_id":"79"}],"publication":"SPAA","file_date_updated":"2018-04-12T09:21:24Z","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"},{"full_name":"Eppstein, David","first_name":"David","last_name":"Eppstein"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"ACM","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","type":"conference","year":"2004","citation":{"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.","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.","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.","bibtex":"@inproceedings{Bagchi_Bhargava_Chaudhary_Eppstein_Scheideler_2004, title={The effect of faults on network expansion}, booktitle={SPAA}, publisher={ACM}, author={Bagchi, Amitabha and Bhargava, Ankur and Chaudhary, Amitabh and Eppstein, David and Scheideler, Christian}, year={2004}, pages={286--293} }","mla":"Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” SPAA, ACM, 2004, pp. 286--293."},"oa":"1","urn":"21276","date_updated":"2022-01-06T06:54:52Z","_id":"2127"},{"oa":"1","date_updated":"2022-01-06T06:54:47Z","_id":"2114","urn":"21146","citation":{"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.","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.","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."},"type":"conference","year":"2005","page":"182--187","title":"Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment","ddc":["040"],"user_id":"15504","status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:25:16Z","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","publication":"ISPAN","department":[{"_id":"79"}],"file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-13T08:45:41Z","file_id":"2325","creator":"florida","file_size":110389,"access_level":"open_access","file_name":"KS-ISPAN-05-TransData.pdf","date_created":"2018-04-13T08:45:41Z"}]},{"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:26:10Z","author":[{"last_name":"Kothapalli","full_name":"Kothapalli, Kishore","first_name":"Kishore"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"department":[{"_id":"79"}],"file_date_updated":"2018-04-13T08:50:40Z","publication":"ISPAN","file":[{"date_updated":"2018-04-13T08:50:40Z","content_type":"application/pdf","relation":"main_file","file_size":69350,"creator":"florida","file_id":"2326","access_level":"open_access","file_name":"KS-ISPAN-05-Supervised.pdf","date_created":"2018-04-13T08:50:40Z"}],"ddc":["040"],"title":"Supervised Peer-to-Peer Systems","user_id":"15504","year":"2005","type":"conference","citation":{"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.","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} }","short":"K. Kothapalli, C. Scheideler, in: ISPAN, 2005, pp. 188--193.","ieee":"K. Kothapalli and C. Scheideler, “Supervised Peer-to-Peer Systems,” in ISPAN, 2005, pp. 188--193."},"page":"188--193","oa":"1","date_updated":"2022-01-06T06:54:47Z","_id":"2115","urn":"21156"},{"file":[{"file_id":"2327","creator":"florida","file_size":135267,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-13T08:55:51Z","file_name":"KORS-ISPAN-05.pdf","date_created":"2018-04-13T08:55:51Z","access_level":"open_access"}],"publication":"ISPAN","file_date_updated":"2018-04-13T08:55:51Z","department":[{"_id":"79"}],"author":[{"full_name":"Onus, Melih","first_name":"Melih","last_name":"Onus"},{"full_name":"W. Richa, Andrea","first_name":"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"}],"date_created":"2018-04-03T05:26:50Z","has_accepted_license":"1","status":"public","user_id":"15504","ddc":["040"],"title":"Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks","page":"346--351","type":"conference","citation":{"ieee":"M. Onus, A. W. Richa, K. Kothapalli, and C. Scheideler, “Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks,” in ISPAN, 2005, pp. 346--351.","short":"M. Onus, A. W. Richa, K. Kothapalli, C. Scheideler, in: ISPAN, 2005, pp. 346--351.","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."},"year":"2005","urn":"21165","date_updated":"2022-01-06T06:54:48Z","_id":"2116","oa":"1"},{"year":"2005","type":"conference","citation":{"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.","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.","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).","chicago":"Kothapalli, Kishore, Christian Scheideler, Melih Onus, and Andrea W. Richa. “Constant Density Spanners for Wireless Ad-Hoc Networks.” In SPAA, 116--125, 2005."},"page":"116--125","_id":"2117","date_updated":"2022-01-06T06:54:48Z","urn":"21175","oa":"1","file":[{"date_created":"2018-04-13T08:56:49Z","file_name":"SPAA-05.pdf","access_level":"open_access","file_size":118644,"file_id":"2328","creator":"florida","date_updated":"2018-04-13T08:56:49Z","content_type":"application/pdf","relation":"main_file"}],"author":[{"last_name":"Kothapalli","full_name":"Kothapalli, Kishore","first_name":"Kishore"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Onus","full_name":"Onus, Melih","first_name":"Melih"},{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, Andrea"}],"publication":"SPAA","file_date_updated":"2018-04-13T08:56:49Z","department":[{"_id":"79"}],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:28:33Z","user_id":"15504","ddc":["040"],"title":"Constant density spanners for wireless ad-hoc networks"},{"year":"2005","type":"conference","citation":{"ieee":"C. Scheideler, “How to spread adversarial nodes?: rotate!,” in STOC, 2005, pp. 704--713.","short":"C. Scheideler, in: STOC, 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} }","mla":"Scheideler, Christian. “How to Spread Adversarial Nodes?: Rotate!” STOC, 2005, pp. 704--713.","ama":"Scheideler C. How to spread adversarial nodes?: rotate! In: STOC. ; 2005:704--713.","apa":"Scheideler, C. (2005). How to spread adversarial nodes?: rotate! In STOC (pp. 704--713).","chicago":"Scheideler, Christian. “How to Spread Adversarial Nodes?: Rotate!” In STOC, 704--713, 2005."},"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","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publication":"STOC","file_date_updated":"2018-04-13T08:58:22Z","department":[{"_id":"79"}],"file":[{"file_size":134460,"creator":"florida","file_id":"2330","date_updated":"2018-04-13T08:58:22Z","content_type":"application/pdf","relation":"main_file","date_created":"2018-04-13T08:58:22Z","file_name":"STOC-05.pdf","access_level":"open_access"}],"ddc":["040"],"title":"How to spread adversarial nodes?: rotate!","user_id":"15504"},{"title":"Overlay networks for wireless ad hoc networks","ddc":["040"],"user_id":"15504","file_date_updated":"2018-04-13T08:57:39Z","publication":"IMA Workshop on Wireless Communications","department":[{"_id":"79"}],"author":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file":[{"file_size":295333,"creator":"florida","file_id":"2329","content_type":"application/pdf","date_updated":"2018-04-13T08:57:39Z","relation":"main_file","file_name":"IMA-05.pdf","date_created":"2018-04-13T08:57:39Z","access_level":"open_access"}],"date_created":"2018-04-05T07:05:16Z","has_accepted_license":"1","status":"public","urn":"22129","date_updated":"2022-01-06T06:55:26Z","_id":"2212","oa":"1","year":"2005","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.","apa":"Scheideler, C. (2005). Overlay networks for wireless ad hoc networks. In IMA Workshop on Wireless Communications.","ama":"Scheideler C. Overlay networks for wireless ad hoc networks. In: IMA Workshop on Wireless Communications. ; 2005.","chicago":"Scheideler, Christian. “Overlay Networks for Wireless Ad Hoc Networks.” In IMA Workshop on Wireless Communications, 2005."},"type":"conference"},{"publication":"J. Algorithms","department":[{"_id":"79"}],"author":[{"full_name":"Kolman, Petr","first_name":"Petr","last_name":"Kolman"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"date_created":"2018-03-29T12:01:37Z","status":"public","volume":61,"user_id":"15504","title":"Improved bounds for the unsplittable flow problem","page":"20--44","citation":{"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.","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","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} }","short":"P. Kolman, C. Scheideler, J. Algorithms 61 (2006) 20--44.","ieee":"P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,” J. Algorithms, vol. 61, no. 1, pp. 20--44, 2006."},"type":"journal_article","year":"2006","intvolume":" 61","_id":"2029","date_updated":"2022-01-06T06:54:25Z","issue":"1","doi":"10.1016/j.jalgor.2004.07.006"},{"type":"journal_article","year":"2006","citation":{"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.","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."},"page":"1242--1254","_id":"2110","date_updated":"2022-01-06T06:54:45Z","doi":"10.1109/TMC.2006.138","issue":"9","author":[{"full_name":"Ateniese, Giuseppe","first_name":"Giuseppe","last_name":"Ateniese"},{"last_name":"Riley","first_name":"Chris","full_name":"Riley, Chris"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publication":"IEEE Trans. Mob. Comput.","department":[{"_id":"79"}],"status":"public","date_created":"2018-04-03T05:21:30Z","title":"Survivable Monitoring in Dynamic Networks","user_id":"15504"},{"date_updated":"2022-01-06T06:54:46Z","_id":"2111","urn":"21110","oa":"1","type":"conference","year":"2006","citation":{"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.","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.","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.","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} }","mla":"Kothapalli, Kishore, et al. “Distributed Coloring in O/Spl Tilde/(/Spl Radic/(Log n)) Bit Rounds.” IPDPS, 2006."},"user_id":"15504","title":"Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds","ddc":["040"],"file":[{"date_created":"2018-04-13T09:57:03Z","file_name":"IPDPS06.pdf","access_level":"open_access","file_size":192708,"file_id":"2334","creator":"florida","date_updated":"2018-04-13T09:57:03Z","content_type":"application/pdf","relation":"main_file"}],"author":[{"full_name":"Kothapalli, Kishore","first_name":"Kishore","last_name":"Kothapalli"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Onus","full_name":"Onus, Melih","first_name":"Melih"},{"first_name":"Christian","full_name":"Schindelhauer, Christian","last_name":"Schindelhauer"}],"file_date_updated":"2018-04-13T09:57:03Z","publication":"IPDPS","department":[{"_id":"79"}],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:22:43Z"},{"series_title":"Lecture Notes in Computer Science","year":"2006","citation":{"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} }","apa":"Awerbuch, B., & Scheideler, C. (2006). Robust Random Number Generation for Peer-to-Peer Systems. In OPODIS (pp. 275--289).","ama":"Awerbuch B, Scheideler C. Robust Random Number Generation for Peer-to-Peer Systems. In: OPODIS. Lecture Notes in Computer Science. ; 2006: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.","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."},"type":"conference","page":"275--289","date_updated":"2022-01-06T06:54:46Z","_id":"2112","urn":"21128","oa":"1","file":[{"file_name":"OPODIS06.pdf","date_created":"2018-04-13T09:57:51Z","access_level":"open_access","file_id":"2335","creator":"florida","file_size":198976,"relation":"main_file","date_updated":"2018-04-13T09:57:51Z","content_type":"application/pdf"}],"author":[{"last_name":"Awerbuch","full_name":"Awerbuch, Baruch","first_name":"Baruch"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file_date_updated":"2018-04-13T09:57:51Z","publication":"OPODIS","department":[{"_id":"79"}],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:23:39Z","user_id":"15504","ddc":["040"],"title":"Robust Random Number Generation for Peer-to-Peer Systems"}]