[{"department":[{"_id":"79"},{"_id":"63"}],"title":"Anycasting in Adversarial Systems: Routing and Admission Control","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:53Z","oa":"1","author":[{"last_name":"Awerbuch","full_name":"Awerbuch, Baruch","first_name":"Baruch"},{"last_name":"Brinkmann","first_name":"André","full_name":"Brinkmann, André"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publisher":"Springer","publication":"ICALP","file_date_updated":"2018-04-12T09:04:48Z","file":[{"date_updated":"2018-04-12T09:04:48Z","content_type":"application/pdf","relation":"main_file","file_size":154427,"file_id":"2307","creator":"florida","access_level":"open_access","file_name":"ICALP-03.pdf","date_created":"2018-04-12T09:04:48Z"}],"volume":2719,"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:38:36Z","ddc":["040"],"user_id":"14955","type":"conference","year":"2003","citation":{"short":"B. Awerbuch, A. Brinkmann, C. Scheideler, in: ICALP, Springer, 2003, pp. 1153--1168.","ieee":"B. Awerbuch, A. Brinkmann, and C. Scheideler, “Anycasting in Adversarial Systems: Routing and Admission Control,” in ICALP, 2003, vol. 2719, pp. 1153--1168.","apa":"Awerbuch, B., Brinkmann, A., & Scheideler, C. (2003). Anycasting in Adversarial Systems: Routing and Admission Control. In ICALP (Vol. 2719, pp. 1153--1168). Springer.","ama":"Awerbuch B, Brinkmann A, Scheideler C. Anycasting in Adversarial Systems: Routing and Admission Control. In: ICALP. Vol 2719. Lecture Notes in Computer Science. Springer; 2003:1153--1168.","chicago":"Awerbuch, Baruch, André Brinkmann, and Christian Scheideler. “Anycasting in Adversarial Systems: Routing and Admission Control.” In ICALP, 2719:1153--1168. Lecture Notes in Computer Science. Springer, 2003.","mla":"Awerbuch, Baruch, et al. “Anycasting in Adversarial Systems: Routing and Admission Control.” ICALP, vol. 2719, Springer, 2003, pp. 1153--1168.","bibtex":"@inproceedings{Awerbuch_Brinkmann_Scheideler_2003, series={Lecture Notes in Computer Science}, title={Anycasting in Adversarial Systems: Routing and Admission Control}, volume={2719}, booktitle={ICALP}, publisher={Springer}, author={Awerbuch, Baruch and Brinkmann, André and Scheideler, Christian}, year={2003}, pages={1153--1168}, collection={Lecture Notes in Computer Science} }"},"page":"1153--1168","_id":"2129","intvolume":" 2719","urn":"21297"},{"citation":{"bibtex":"@inproceedings{Awerbuch_Scheideler_2003, title={Peer-to-peer systems for prefix search}, booktitle={PODC}, publisher={ACM}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2003}, pages={123--132} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” PODC, ACM, 2003, pp. 123--132.","apa":"Awerbuch, B., & Scheideler, C. (2003). Peer-to-peer systems for prefix search. In PODC (pp. 123--132). ACM.","ama":"Awerbuch B, Scheideler C. Peer-to-peer systems for prefix search. In: PODC. ACM; 2003:123--132.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” In PODC, 123--132. ACM, 2003.","ieee":"B. Awerbuch and C. Scheideler, “Peer-to-peer systems for prefix search,” in PODC, 2003, pp. 123--132.","short":"B. Awerbuch, C. Scheideler, in: PODC, ACM, 2003, pp. 123--132."},"year":"2003","type":"conference","page":"123--132","_id":"2130","date_updated":"2022-01-06T06:54:53Z","urn":"21303","oa":"1","publisher":"ACM","author":[{"last_name":"Awerbuch","full_name":"Awerbuch, Baruch","first_name":"Baruch"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publication":"PODC","file_date_updated":"2018-04-12T09:10:10Z","department":[{"_id":"79"}],"file":[{"file_name":"PODC-03.pdf","date_created":"2018-04-12T09:10:10Z","access_level":"open_access","file_id":"2308","creator":"florida","file_size":127013,"relation":"main_file","date_updated":"2018-04-12T09:10:10Z","content_type":"application/pdf"}],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:39:48Z","ddc":["040"],"title":"Peer-to-peer systems for prefix search","user_id":"15504"},{"series_title":"Lecture Notes in Computer Science","oa":"1","date_updated":"2022-01-06T06:54:54Z","department":[{"_id":"79"}],"title":"Perfectly Balanced Allocation","page":"240--251","citation":{"bibtex":"@inproceedings{Czumaj_Riley_Scheideler_2003, series={Lecture Notes in Computer Science}, title={Perfectly Balanced Allocation}, volume={2764}, booktitle={RANDOM-APPROX}, publisher={Springer}, author={Czumaj, Artur and Riley, Chris and Scheideler, Christian}, year={2003}, pages={240--251}, collection={Lecture Notes in Computer Science} }","mla":"Czumaj, Artur, et al. “Perfectly Balanced Allocation.” RANDOM-APPROX, vol. 2764, Springer, 2003, pp. 240--251.","ama":"Czumaj A, Riley C, Scheideler C. Perfectly Balanced Allocation. In: RANDOM-APPROX. Vol 2764. Lecture Notes in Computer Science. Springer; 2003:240--251.","apa":"Czumaj, A., Riley, C., & Scheideler, C. (2003). Perfectly Balanced Allocation. In RANDOM-APPROX (Vol. 2764, pp. 240--251). Springer.","chicago":"Czumaj, Artur, Chris Riley, and Christian Scheideler. “Perfectly Balanced Allocation.” In RANDOM-APPROX, 2764:240--251. Lecture Notes in Computer Science. Springer, 2003.","ieee":"A. Czumaj, C. Riley, and C. Scheideler, “Perfectly Balanced Allocation,” in RANDOM-APPROX, 2003, vol. 2764, pp. 240--251.","short":"A. Czumaj, C. Riley, C. Scheideler, in: RANDOM-APPROX, Springer, 2003, pp. 240--251."},"type":"conference","year":"2003","urn":"21313","intvolume":" 2764","_id":"2131","date_created":"2018-04-03T05:41:01Z","has_accepted_license":"1","status":"public","volume":2764,"file":[{"file_size":112587,"file_id":"2310","creator":"florida","content_type":"application/pdf","date_updated":"2018-04-12T09:16:17Z","relation":"main_file","date_created":"2018-04-12T09:16:17Z","file_name":"RANDOM-03.pdf","access_level":"open_access"}],"file_date_updated":"2018-04-12T09:16:17Z","publication":"RANDOM-APPROX","author":[{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"},{"first_name":"Chris","full_name":"Riley, Chris","last_name":"Riley"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publisher":"Springer","user_id":"15504","ddc":["040"]},{"_id":"2132","date_updated":"2022-01-06T06:54:54Z","urn":"21320","oa":"1","type":"conference","year":"2003","citation":{"ieee":"L. Jia, R. Rajaraman, and C. Scheideler, “On local algorithms for topology control and routing in ad hoc networks,” in SPAA, 2003, pp. 220--229.","short":"L. Jia, R. Rajaraman, C. Scheideler, in: SPAA, ACM, 2003, pp. 220--229.","bibtex":"@inproceedings{Jia_Rajaraman_Scheideler_2003, title={On local algorithms for topology control and routing in ad hoc networks}, booktitle={SPAA}, publisher={ACM}, author={Jia, Lujun and Rajaraman, Rajmohan and Scheideler, Christian}, year={2003}, pages={220--229} }","mla":"Jia, Lujun, et al. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” SPAA, ACM, 2003, pp. 220--229.","chicago":"Jia, Lujun, Rajmohan Rajaraman, and Christian Scheideler. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” In SPAA, 220--229. ACM, 2003.","apa":"Jia, L., Rajaraman, R., & Scheideler, C. (2003). On local algorithms for topology control and routing in ad hoc networks. In SPAA (pp. 220--229). ACM.","ama":"Jia L, Rajaraman R, Scheideler C. On local algorithms for topology control and routing in ad hoc networks. In: SPAA. ACM; 2003:220--229."},"page":"220--229","title":"On local algorithms for topology control and routing in ad hoc networks","ddc":["040"],"user_id":"15504","publisher":"ACM","author":[{"first_name":"Lujun","full_name":"Jia, Lujun","last_name":"Jia"},{"last_name":"Rajaraman","first_name":"Rajmohan","full_name":"Rajaraman, Rajmohan"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file_date_updated":"2018-04-12T09:18:55Z","department":[{"_id":"79"}],"publication":"SPAA","file":[{"access_level":"open_access","file_name":"JRS-SPAA-03.pdf","date_created":"2018-04-12T09:18:55Z","relation":"main_file","date_updated":"2018-04-12T09:18:55Z","content_type":"application/pdf","creator":"florida","file_id":"2311","file_size":224200}],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:41:53Z"},{"oa":"1","date_updated":"2022-01-06T06:54:55Z","_id":"2133","urn":"21338","year":"2003","type":"conference","citation":{"bibtex":"@inproceedings{Kothapalli_Scheideler_2003, title={Information gathering in adversarial systems: lines and cycles}, booktitle={SPAA}, publisher={ACM}, author={Kothapalli, Kishore and Scheideler, Christian}, year={2003}, pages={333--342} }","mla":"Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial Systems: Lines and Cycles.” SPAA, ACM, 2003, pp. 333--342.","chicago":"Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial Systems: Lines and Cycles.” In SPAA, 333--342. ACM, 2003.","apa":"Kothapalli, K., & Scheideler, C. (2003). Information gathering in adversarial systems: lines and cycles. In SPAA (pp. 333--342). ACM.","ama":"Kothapalli K, Scheideler C. Information gathering in adversarial systems: lines and cycles. In: SPAA. ACM; 2003:333--342.","ieee":"K. Kothapalli and C. Scheideler, “Information gathering in adversarial systems: lines and cycles,” in SPAA, 2003, pp. 333--342.","short":"K. Kothapalli, C. Scheideler, in: SPAA, ACM, 2003, pp. 333--342."},"page":"333--342","user_id":"15504","ddc":["040"],"title":"Information gathering in adversarial systems: lines and cycles","has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:42:48Z","file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:15:24Z","creator":"florida","file_id":"2309","file_size":121448,"access_level":"open_access","file_name":"KS-SPAA-03.pdf","date_created":"2018-04-12T09:13:43Z"}],"author":[{"first_name":"Kishore","full_name":"Kothapalli, Kishore","last_name":"Kothapalli"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publisher":"ACM","file_date_updated":"2018-04-12T09:15:24Z","department":[{"_id":"79"}],"publication":"SPAA"},{"title":"Improved Bounds for Acyclic Job Shop Scheduling","user_id":"15504","publication":"Combinatorica","department":[{"_id":"79"}],"author":[{"last_name":"Feige","first_name":"Uriel","full_name":"Feige, Uriel"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"date_created":"2018-04-03T05:43:36Z","status":"public","date_updated":"2022-01-06T06:54:55Z","_id":"2134","doi":"10.1007/s004930200018","issue":"3","page":"361--399","year":"2002","citation":{"chicago":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling.” Combinatorica, no. 3 (2002): 361--399. https://doi.org/10.1007/s004930200018.","apa":"Feige, U., & Scheideler, C. (2002). Improved Bounds for Acyclic Job Shop Scheduling. Combinatorica, (3), 361--399. https://doi.org/10.1007/s004930200018","ama":"Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling. Combinatorica. 2002;(3):361--399. doi:10.1007/s004930200018","mla":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling.” Combinatorica, no. 3, 2002, pp. 361--399, doi:10.1007/s004930200018.","bibtex":"@article{Feige_Scheideler_2002, title={Improved Bounds for Acyclic Job Shop Scheduling}, DOI={10.1007/s004930200018}, number={3}, journal={Combinatorica}, author={Feige, Uriel and Scheideler, Christian}, year={2002}, pages={361--399} }","short":"U. Feige, C. Scheideler, Combinatorica (2002) 361--399.","ieee":"U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling,” Combinatorica, no. 3, pp. 361--399, 2002."},"type":"journal_article"},{"oa":"1","urn":"21357","date_updated":"2022-01-06T06:54:55Z","_id":"2135","page":"184--193","year":"2002","type":"conference","citation":{"mla":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” SODA, ACM/SIAM, 2002, pp. 184--193.","bibtex":"@inproceedings{Kolman_Scheideler_2002, title={Improved bounds for the unsplittable flow problem}, booktitle={SODA}, publisher={ACM/SIAM}, author={Kolman, Petr and Scheideler, Christian}, year={2002}, pages={184--193} }","chicago":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” In SODA, 184--193. ACM/SIAM, 2002.","apa":"Kolman, P., & Scheideler, C. (2002). Improved bounds for the unsplittable flow problem. In SODA (pp. 184--193). ACM/SIAM.","ama":"Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem. In: SODA. ACM/SIAM; 2002:184--193.","ieee":"P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,” in SODA, 2002, pp. 184--193.","short":"P. Kolman, C. Scheideler, in: SODA, ACM/SIAM, 2002, pp. 184--193."},"user_id":"15504","title":"Improved bounds for the unsplittable flow problem","ddc":["040"],"date_created":"2018-04-03T05:44:11Z","has_accepted_license":"1","status":"public","file":[{"relation":"main_file","date_updated":"2018-04-12T08:59:58Z","content_type":"application/pdf","creator":"florida","file_id":"2303","file_size":246604,"access_level":"open_access","file_name":"SODA-02.pdf","date_created":"2018-04-12T08:59:58Z"}],"file_date_updated":"2018-04-12T08:59:58Z","publication":"SODA","department":[{"_id":"79"}],"publisher":"ACM/SIAM","author":[{"last_name":"Kolman","first_name":"Petr","full_name":"Kolman, Petr"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}]},{"language":[{"iso":"eng"}],"page":"53--62","year":"2002","citation":{"ieee":"A. Brinkmann, K. Salzwedel, and C. Scheideler, “Compact, adaptive placement schemes for non-uniform requirements,” in SPAA, 2002, pp. 53--62.","short":"A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2002, pp. 53--62.","mla":"Brinkmann, André, et al. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” SPAA, 2002, pp. 53--62.","bibtex":"@inproceedings{Brinkmann_Salzwedel_Scheideler_2002, title={Compact, adaptive placement schemes for non-uniform requirements}, booktitle={SPAA}, author={Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}, year={2002}, pages={53--62} }","ama":"Brinkmann A, Salzwedel K, Scheideler C. Compact, adaptive placement schemes for non-uniform requirements. In: SPAA. ; 2002:53--62.","apa":"Brinkmann, A., Salzwedel, K., & Scheideler, C. (2002). Compact, adaptive placement schemes for non-uniform requirements. In SPAA (pp. 53--62).","chicago":"Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” In SPAA, 53--62, 2002."},"type":"conference","oa":"1","urn":"21366","date_updated":"2022-01-06T06:54:56Z","_id":"2136","date_created":"2018-04-03T05:44:56Z","has_accepted_license":"1","status":"public","file":[{"access_level":"open_access","file_name":"BSS-SPAA-02.pdf","date_created":"2018-04-12T09:02:22Z","date_updated":"2018-04-12T09:02:22Z","content_type":"application/pdf","relation":"main_file","file_size":123373,"creator":"florida","file_id":"2305"}],"file_date_updated":"2018-04-12T09:02:22Z","publication":"SPAA","department":[{"_id":"79"},{"_id":"63"}],"author":[{"first_name":"André","full_name":"Brinkmann, André","last_name":"Brinkmann"},{"full_name":"Salzwedel, Kay","first_name":"Kay","last_name":"Salzwedel"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"user_id":"14955","ddc":["040"],"title":"Compact, adaptive placement schemes for non-uniform requirements"},{"user_id":"15504","ddc":["040"],"title":"Algorithms for fault-tolerant routing in circuit switched networks","date_created":"2018-04-03T05:45:44Z","has_accepted_license":"1","status":"public","file":[{"access_level":"open_access","file_name":"BCKS-SPAA-02.pdf","date_created":"2018-04-12T09:03:44Z","content_type":"application/pdf","date_updated":"2018-04-12T09:03:44Z","relation":"main_file","file_size":187124,"creator":"florida","file_id":"2306"}],"department":[{"_id":"79"}],"file_date_updated":"2018-04-12T09:03:44Z","publication":"SPAA","author":[{"last_name":"Bagchi","full_name":"Bagchi, Amitabha","first_name":"Amitabha"},{"last_name":"Chaudhary","full_name":"Chaudhary, Amitabh","first_name":"Amitabh"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"full_name":"Kolman, Petr","first_name":"Petr","last_name":"Kolman"}],"oa":"1","urn":"21376","_id":"2137","date_updated":"2022-01-06T06:54:57Z","page":"265--274","year":"2002","type":"conference","citation":{"ieee":"A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, “Algorithms for fault-tolerant routing in circuit switched networks,” in SPAA, 2002, pp. 265--274.","short":"A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, in: SPAA, 2002, pp. 265--274.","bibtex":"@inproceedings{Bagchi_Chaudhary_Scheideler_Kolman_2002, title={Algorithms for fault-tolerant routing in circuit switched networks}, booktitle={SPAA}, author={Bagchi, Amitabha and Chaudhary, Amitabh and Scheideler, Christian and Kolman, Petr}, year={2002}, pages={265--274} }","mla":"Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” SPAA, 2002, pp. 265--274.","apa":"Bagchi, A., Chaudhary, A., Scheideler, C., & Kolman, P. (2002). Algorithms for fault-tolerant routing in circuit switched networks. In SPAA (pp. 265--274).","ama":"Bagchi A, Chaudhary A, Scheideler C, Kolman P. Algorithms for fault-tolerant routing in circuit switched networks. In: SPAA. ; 2002:265--274.","chicago":"Bagchi, Amitabha, Amitabh Chaudhary, Christian Scheideler, and Petr Kolman. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” In SPAA, 265--274, 2002."}},{"title":"Models and Techniques for Communication in Dynamic Networks","department":[{"_id":"79"}],"date_updated":"2022-01-06T06:54:57Z","oa":"1","series_title":"Lecture Notes in Computer Science","user_id":"15504","ddc":["040"],"file":[{"relation":"main_file","date_updated":"2018-04-12T09:01:03Z","content_type":"application/pdf","creator":"florida","file_id":"2304","file_size":273875,"access_level":"open_access","file_name":"STACS-02.pdf","date_created":"2018-04-12T09:01:03Z"}],"publication":"STACS","file_date_updated":"2018-04-12T09:01:03Z","publisher":"Springer","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"date_created":"2018-04-03T05:46:38Z","has_accepted_license":"1","status":"public","volume":2285,"urn":"21386","intvolume":" 2285","_id":"2138","page":"27--49","citation":{"short":"C. Scheideler, in: STACS, Springer, 2002, pp. 27--49.","ieee":"C. Scheideler, “Models and Techniques for Communication in Dynamic Networks,” in STACS, 2002, vol. 2285, pp. 27--49.","chicago":"Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” In STACS, 2285:27--49. Lecture Notes in Computer Science. Springer, 2002.","ama":"Scheideler C. Models and Techniques for Communication in Dynamic Networks. In: STACS. Vol 2285. Lecture Notes in Computer Science. Springer; 2002:27--49.","apa":"Scheideler, C. (2002). Models and Techniques for Communication in Dynamic Networks. In STACS (Vol. 2285, pp. 27--49). Springer.","mla":"Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” STACS, vol. 2285, Springer, 2002, pp. 27--49.","bibtex":"@inproceedings{Scheideler_2002, series={Lecture Notes in Computer Science}, title={Models and Techniques for Communication in Dynamic Networks}, volume={2285}, booktitle={STACS}, publisher={Springer}, author={Scheideler, Christian}, year={2002}, pages={27--49}, collection={Lecture Notes in Computer Science} }"},"year":"2002","type":"conference"},{"intvolume":" 21","_id":"2139","date_updated":"2022-01-06T06:54:57Z","doi":"10.1007/s004930170007","issue":"1","page":"95--138","year":"2001","type":"journal_article","citation":{"short":"F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138.","ieee":"F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols,” Combinatorica, vol. 21, no. 1, pp. 95--138, 2001.","apa":"Meyer auf der Heide, F., & Scheideler, C. (2001). Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica, 21(1), 95--138. https://doi.org/10.1007/s004930170007","ama":"Meyer auf der Heide F, Scheideler C. Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica. 2001;21(1):95--138. doi:10.1007/s004930170007","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica 21, no. 1 (2001): 95--138. https://doi.org/10.1007/s004930170007.","bibtex":"@article{Meyer auf der Heide_Scheideler_2001, title={Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols}, volume={21}, DOI={10.1007/s004930170007}, number={1}, journal={Combinatorica}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2001}, pages={95--138} }","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica, vol. 21, no. 1, 2001, pp. 95--138, doi:10.1007/s004930170007."},"language":[{"iso":"eng"}],"title":"Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"publication":"Combinatorica","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"volume":21,"date_created":"2018-04-03T05:47:20Z","status":"public"},{"date_created":"2018-04-03T05:48:28Z","status":"public","has_accepted_license":"1","file":[{"file_id":"2302","creator":"florida","file_size":151156,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T08:59:00Z","file_name":"FOCS-01.pdf","date_created":"2018-04-12T08:59:00Z","access_level":"open_access"}],"department":[{"_id":"79"}],"file_date_updated":"2018-04-12T08:59:00Z","publication":"FOCS","author":[{"last_name":"Awerbuch","full_name":"Awerbuch, Baruch","first_name":"Baruch"},{"last_name":"Berenbrink","first_name":"Petra","full_name":"Berenbrink, Petra"},{"full_name":"Brinkmann, André","first_name":"André","last_name":"Brinkmann"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publisher":"IEEE Computer Society","user_id":"15504","ddc":["040"],"title":"Simple Routing Strategies for Adversarial Systems","page":"158--167","year":"2001","type":"conference","citation":{"short":"B. Awerbuch, P. Berenbrink, A. Brinkmann, C. Scheideler, in: FOCS, IEEE Computer Society, 2001, pp. 158--167.","ieee":"B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler, “Simple Routing Strategies for Adversarial Systems,” in FOCS, 2001, pp. 158--167.","chicago":"Awerbuch, Baruch, Petra Berenbrink, André Brinkmann, and Christian Scheideler. “Simple Routing Strategies for Adversarial Systems.” In FOCS, 158--167. IEEE Computer Society, 2001.","ama":"Awerbuch B, Berenbrink P, Brinkmann A, Scheideler C. Simple Routing Strategies for Adversarial Systems. In: FOCS. IEEE Computer Society; 2001:158--167.","apa":"Awerbuch, B., Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). Simple Routing Strategies for Adversarial Systems. In FOCS (pp. 158--167). IEEE Computer Society.","mla":"Awerbuch, Baruch, et al. “Simple Routing Strategies for Adversarial Systems.” FOCS, IEEE Computer Society, 2001, pp. 158--167.","bibtex":"@inproceedings{Awerbuch_Berenbrink_Brinkmann_Scheideler_2001, title={Simple Routing Strategies for Adversarial Systems}, booktitle={FOCS}, publisher={IEEE Computer Society}, author={Awerbuch, Baruch and Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}, year={2001}, pages={158--167} }"},"oa":"1","urn":"21406","date_updated":"2022-01-06T06:54:59Z","_id":"2140"},{"date_created":"2018-04-03T05:49:21Z","status":"public","has_accepted_license":"1","publication":"PDP","file_date_updated":"2018-04-12T08:39:01Z","publisher":"IEEE Computer Society","author":[{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"},{"last_name":"Brinkmann","first_name":"André","full_name":"Brinkmann, André"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file":[{"file_name":"PDP-00.pdf","date_created":"2018-04-12T08:39:01Z","access_level":"open_access","creator":"florida","file_id":"2298","file_size":85778,"relation":"main_file","date_updated":"2018-04-12T08:39:01Z","content_type":"application/pdf"}],"ddc":["040"],"user_id":"14955","page":"227--234","year":"2001","type":"conference","citation":{"bibtex":"@inproceedings{Berenbrink_Brinkmann_Scheideler_2001, title={SIMLAB-A Simulation Environment for Storage Area Networks}, booktitle={PDP}, publisher={IEEE Computer Society}, author={Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}, year={2001}, pages={227--234} }","mla":"Berenbrink, Petra, et al. “SIMLAB-A Simulation Environment for Storage Area Networks.” PDP, IEEE Computer Society, 2001, pp. 227--234.","chicago":"Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “SIMLAB-A Simulation Environment for Storage Area Networks.” In PDP, 227--234. IEEE Computer Society, 2001.","ama":"Berenbrink P, Brinkmann A, Scheideler C. SIMLAB-A Simulation Environment for Storage Area Networks. In: PDP. IEEE Computer Society; 2001:227--234.","apa":"Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). SIMLAB-A Simulation Environment for Storage Area Networks. In PDP (pp. 227--234). IEEE Computer Society.","ieee":"P. Berenbrink, A. Brinkmann, and C. Scheideler, “SIMLAB-A Simulation Environment for Storage Area Networks,” in PDP, 2001, pp. 227--234.","short":"P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society, 2001, pp. 227--234."},"urn":"21415","_id":"2141","department":[{"_id":"79"},{"_id":"63"}],"title":"SIMLAB-A Simulation Environment for Storage Area Networks","language":[{"iso":"eng"}],"oa":"1","date_updated":"2022-01-06T06:54:59Z"},{"page":"38--47","type":"conference","year":"2001","citation":{"mla":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” SPAA, 2001, pp. 38--47.","bibtex":"@inproceedings{Kolman_Scheideler_2001, title={Simple on-line algorithms for the maximum disjoint paths problem}, booktitle={SPAA}, author={Kolman, Petr and Scheideler, Christian}, year={2001}, pages={38--47} }","chicago":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” In SPAA, 38--47, 2001.","apa":"Kolman, P., & Scheideler, C. (2001). Simple on-line algorithms for the maximum disjoint paths problem. In SPAA (pp. 38--47).","ama":"Kolman P, Scheideler C. Simple on-line algorithms for the maximum disjoint paths problem. In: SPAA. ; 2001:38--47.","ieee":"P. Kolman and C. Scheideler, “Simple on-line algorithms for the maximum disjoint paths problem,” in SPAA, 2001, pp. 38--47.","short":"P. Kolman, C. Scheideler, in: SPAA, 2001, pp. 38--47."},"urn":"21421","_id":"2142","date_updated":"2022-01-06T06:54:59Z","oa":"1","publication":"SPAA","department":[{"_id":"79"}],"file_date_updated":"2018-04-12T08:58:07Z","author":[{"first_name":"Petr","full_name":"Kolman, Petr","last_name":"Kolman"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file":[{"file_name":"SPAA-01.pdf","date_created":"2018-04-12T08:58:07Z","access_level":"open_access","file_size":335171,"creator":"florida","file_id":"2301","date_updated":"2018-04-12T08:58:07Z","content_type":"application/pdf","relation":"main_file"}],"date_created":"2018-04-03T05:50:16Z","status":"public","has_accepted_license":"1","ddc":["040"],"title":"Simple on-line algorithms for the maximum disjoint paths problem","user_id":"15504"},{"volume":33,"status":"public","date_created":"2018-04-03T05:51:02Z","author":[{"last_name":"Adler","full_name":"Adler, Micah","first_name":"Micah"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publication":"Theory Comput. Syst.","department":[{"_id":"79"},{"_id":"63"}],"title":"Efficient Communication Strategies for Ad Hoc Wireless Networks","user_id":"14955","type":"journal_article","year":"2000","citation":{"ama":"Adler M, Scheideler C. Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput Syst. 2000;33(5/6):337--391. doi:10.1007/s002240010006","apa":"Adler, M., & Scheideler, C. (2000). Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput. Syst., 33(5/6), 337--391. https://doi.org/10.1007/s002240010006","chicago":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.” Theory Comput. Syst. 33, no. 5/6 (2000): 337--391. https://doi.org/10.1007/s002240010006.","bibtex":"@article{Adler_Scheideler_2000, title={Efficient Communication Strategies for Ad Hoc Wireless Networks}, volume={33}, DOI={10.1007/s002240010006}, number={5/6}, journal={Theory Comput. Syst.}, author={Adler, Micah and Scheideler, Christian}, year={2000}, pages={337--391} }","mla":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.” Theory Comput. Syst., vol. 33, no. 5/6, 2000, pp. 337--391, doi:10.1007/s002240010006.","short":"M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391.","ieee":"M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad Hoc Wireless Networks,” Theory Comput. Syst., vol. 33, no. 5/6, pp. 337--391, 2000."},"page":"337--391","language":[{"iso":"eng"}],"doi":"10.1007/s002240010006","issue":"5/6","_id":"2143","date_updated":"2022-01-06T06:54:59Z","intvolume":" 33"},{"type":"journal_article","citation":{"mla":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” SIAM J. Comput., vol. 30, no. 4, 2000, pp. 1126--1155, doi:10.1137/S0097539799353431.","bibtex":"@article{Scheideler_Vöcking_2000, title={From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols}, volume={30}, DOI={10.1137/S0097539799353431}, number={4}, journal={SIAM J. Comput.}, author={Scheideler, Christian and Vöcking, Berthold}, year={2000}, pages={1126--1155} }","chicago":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” SIAM J. Comput. 30, no. 4 (2000): 1126--1155. https://doi.org/10.1137/S0097539799353431.","ama":"Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J Comput. 2000;30(4):1126--1155. doi:10.1137/S0097539799353431","apa":"Scheideler, C., & Vöcking, B. (2000). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J. Comput., 30(4), 1126--1155. https://doi.org/10.1137/S0097539799353431","ieee":"C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,” SIAM J. Comput., vol. 30, no. 4, pp. 1126--1155, 2000.","short":"C. Scheideler, B. Vöcking, SIAM J. Comput. 30 (2000) 1126--1155."},"year":"2000","page":"1126--1155","language":[{"iso":"eng"}],"doi":"10.1137/S0097539799353431","issue":"4","_id":"2145","intvolume":" 30","date_updated":"2022-01-06T06:55:00Z","volume":30,"status":"public","date_created":"2018-04-03T06:12:15Z","author":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"SIAM J. Comput.","title":"From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols","user_id":"14955"},{"language":[{"iso":"eng"}],"citation":{"ieee":"P. Berenbrink, A. Brinkmann, and C. Scheideler, “Distributed Path Selection for Storage Networks,” in PDPTA, 2000.","short":"P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.","mla":"Berenbrink, Petra, et al. “Distributed Path Selection for Storage Networks.” PDPTA, 2000.","bibtex":"@inproceedings{Berenbrink_Brinkmann_Scheideler_2000, title={Distributed Path Selection for Storage Networks}, booktitle={PDPTA}, author={Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}, year={2000} }","chicago":"Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “Distributed Path Selection for Storage Networks.” In PDPTA, 2000.","apa":"Berenbrink, P., Brinkmann, A., & Scheideler, C. (2000). Distributed Path Selection for Storage Networks. In PDPTA.","ama":"Berenbrink P, Brinkmann A, Scheideler C. Distributed Path Selection for Storage Networks. In: PDPTA. ; 2000."},"year":"2000","type":"conference","oa":"1","urn":"21467","_id":"2146","date_updated":"2022-01-06T06:55:00Z","date_created":"2018-04-03T06:13:07Z","has_accepted_license":"1","status":"public","file":[{"access_level":"open_access","date_created":"2018-04-12T08:47:50Z","file_name":"PDPTA-00.pdf","content_type":"application/pdf","date_updated":"2018-04-12T08:47:50Z","relation":"main_file","file_size":168677,"file_id":"2299","creator":"florida"}],"publication":"PDPTA","department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T08:47:50Z","author":[{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"},{"last_name":"Brinkmann","full_name":"Brinkmann, André","first_name":"André"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"user_id":"14955","ddc":["040"],"title":"Distributed Path Selection for Storage Networks"},{"language":[{"iso":"eng"}],"type":"conference","citation":{"mla":"Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” SODA, 2000, pp. 30--39.","bibtex":"@inproceedings{Czumaj_Scheideler_2000, title={Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma}, booktitle={SODA}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={30--39} }","ama":"Czumaj A, Scheideler C. Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In: SODA. ; 2000:30--39.","apa":"Czumaj, A., & Scheideler, C. (2000). Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In SODA (pp. 30--39).","chicago":"Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” In SODA, 30--39, 2000.","ieee":"A. Czumaj and C. Scheideler, “Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma,” in SODA, 2000, pp. 30--39.","short":"A. Czumaj, C. Scheideler, in: SODA, 2000, pp. 30--39."},"year":"2000","page":"30--39","oa":"1","date_updated":"2022-01-06T06:55:00Z","_id":"2147","urn":"21476","status":"public","has_accepted_license":"1","date_created":"2018-04-03T06:16:48Z","file":[{"content_type":"application/pdf","date_updated":"2018-04-12T08:36:17Z","relation":"main_file","file_size":185001,"creator":"florida","file_id":"2295","access_level":"open_access","file_name":"SODA-00.pdf","date_created":"2018-04-12T08:36:17Z"}],"author":[{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T08:36:17Z","publication":"SODA","user_id":"14955","title":"Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma","ddc":["040"]},{"_id":"2148","intvolume":" 17","date_updated":"2022-01-06T06:55:00Z","issue":"3-4","year":"2000","citation":{"ieee":"A. Czumaj and C. Scheideler, “Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma,” Random Struct. Algorithms, vol. 17, no. 3–4, pp. 213--237, 2000.","short":"A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237.","mla":"Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms, vol. 17, no. 3–4, 2000, pp. 213--237.","bibtex":"@article{Czumaj_Scheideler_2000, title={Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma}, volume={17}, number={3–4}, journal={Random Struct. Algorithms}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={213--237} }","ama":"Czumaj A, Scheideler C. Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct Algorithms. 2000;17(3-4):213--237.","apa":"Czumaj, A., & Scheideler, C. (2000). Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct. Algorithms, 17(3–4), 213--237.","chicago":"Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms 17, no. 3–4 (2000): 213--237."},"type":"journal_article","page":"213--237","language":[{"iso":"eng"}],"title":"Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma","user_id":"14955","author":[{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publication":"Random Struct. Algorithms","department":[{"_id":"79"},{"_id":"63"}],"volume":17,"status":"public","date_created":"2018-04-03T06:17:52Z"},{"department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T08:38:13Z","publication":"SPAA","author":[{"last_name":"Brinkmann","first_name":"André","full_name":"Brinkmann, André"},{"last_name":"Salzwedel","full_name":"Salzwedel, Kay","first_name":"Kay"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file":[{"date_created":"2018-04-12T08:38:13Z","file_name":"spaa_00.pdf","access_level":"open_access","file_size":222176,"creator":"florida","file_id":"2297","date_updated":"2018-04-12T08:38:13Z","content_type":"application/pdf","relation":"main_file"}],"date_created":"2018-04-03T06:18:45Z","status":"public","has_accepted_license":"1","title":"Efficient, distributed data placement strategies for storage area networks (extended abstract)","ddc":["040"],"user_id":"14955","page":"119--128","year":"2000","type":"conference","citation":{"ieee":"A. Brinkmann, K. Salzwedel, and C. Scheideler, “Efficient, distributed data placement strategies for storage area networks (extended abstract),” in SPAA, 2000, pp. 119--128.","short":"A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.","mla":"Brinkmann, André, et al. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” SPAA, 2000, pp. 119--128.","bibtex":"@inproceedings{Brinkmann_Salzwedel_Scheideler_2000, title={Efficient, distributed data placement strategies for storage area networks (extended abstract)}, booktitle={SPAA}, author={Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}, year={2000}, pages={119--128} }","chicago":"Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” In SPAA, 119--128, 2000.","ama":"Brinkmann A, Salzwedel K, Scheideler C. Efficient, distributed data placement strategies for storage area networks (extended abstract). In: SPAA. ; 2000:119--128.","apa":"Brinkmann, A., Salzwedel, K., & Scheideler, C. (2000). Efficient, distributed data placement strategies for storage area networks (extended abstract). In SPAA (pp. 119--128)."},"language":[{"iso":"eng"}],"urn":"21493","date_updated":"2022-01-06T06:55:02Z","_id":"2149","oa":"1"}]