[{"year":"2001","type":"journal_article","citation":{"chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica 21, no. 1 (2001): 95--138. https://doi.org/10.1007/s004930170007.","apa":"Meyer auf der Heide, F., & Scheideler, C. (2001). Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica, 21(1), 95--138. https://doi.org/10.1007/s004930170007","ama":"Meyer auf der Heide F, Scheideler C. Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica. 2001;21(1):95--138. doi:10.1007/s004930170007","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.","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} }","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."},"page":"95--138","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:57Z","_id":"2139","intvolume":" 21","doi":"10.1007/s004930170007","issue":"1","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"Combinatorica","volume":21,"status":"public","date_created":"2018-04-03T05:47:20Z","title":"Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols","user_id":"14955"},{"type":"conference","year":"2001","citation":{"ieee":"B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler, “Simple Routing Strategies for Adversarial Systems,” in FOCS, 2001, pp. 158--167.","short":"B. Awerbuch, P. Berenbrink, A. Brinkmann, C. Scheideler, in: FOCS, IEEE Computer Society, 2001, pp. 158--167.","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} }","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.","chicago":"Awerbuch, Baruch, Petra Berenbrink, André Brinkmann, and Christian Scheideler. “Simple Routing Strategies for Adversarial Systems.” In FOCS, 158--167. IEEE Computer Society, 2001."},"page":"158--167","_id":"2140","date_updated":"2022-01-06T06:54:59Z","urn":"21406","oa":"1","publisher":"IEEE Computer Society","author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"last_name":"Berenbrink","first_name":"Petra","full_name":"Berenbrink, Petra"},{"first_name":"André","full_name":"Brinkmann, André","last_name":"Brinkmann"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"department":[{"_id":"79"}],"publication":"FOCS","file_date_updated":"2018-04-12T08:59:00Z","file":[{"file_size":151156,"creator":"florida","file_id":"2302","date_updated":"2018-04-12T08:59:00Z","content_type":"application/pdf","relation":"main_file","date_created":"2018-04-12T08:59:00Z","file_name":"FOCS-01.pdf","access_level":"open_access"}],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:48:28Z","ddc":["040"],"title":"Simple Routing Strategies for Adversarial Systems","user_id":"15504"},{"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","date_created":"2018-04-03T05:49:21Z","has_accepted_license":"1","status":"public","file_date_updated":"2018-04-12T08:39:01Z","publication":"PDP","author":[{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"},{"last_name":"Brinkmann","first_name":"André","full_name":"Brinkmann, André"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"IEEE Computer Society","file":[{"access_level":"open_access","date_created":"2018-04-12T08:39:01Z","file_name":"PDP-00.pdf","relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T08:39:01Z","file_id":"2298","creator":"florida","file_size":85778}],"ddc":["040"],"user_id":"14955","page":"227--234","citation":{"ieee":"P. Berenbrink, A. Brinkmann, and C. Scheideler, “SIMLAB-A Simulation Environment for Storage Area Networks,” in PDP, 2001, pp. 227--234.","short":"P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society, 2001, pp. 227--234.","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.","apa":"Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). SIMLAB-A Simulation Environment for Storage Area Networks. In PDP (pp. 227--234). IEEE Computer Society.","ama":"Berenbrink P, Brinkmann A, Scheideler C. SIMLAB-A Simulation Environment for Storage Area Networks. In: PDP. IEEE Computer Society; 2001:227--234."},"year":"2001","type":"conference","urn":"21415","_id":"2141"},{"ddc":["040"],"title":"Simple on-line algorithms for the maximum disjoint paths problem","user_id":"15504","status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:50:16Z","author":[{"last_name":"Kolman","first_name":"Petr","full_name":"Kolman, Petr"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"department":[{"_id":"79"}],"file_date_updated":"2018-04-12T08:58:07Z","publication":"SPAA","file":[{"file_name":"SPAA-01.pdf","date_created":"2018-04-12T08:58:07Z","access_level":"open_access","file_size":335171,"file_id":"2301","creator":"florida","date_updated":"2018-04-12T08:58:07Z","content_type":"application/pdf","relation":"main_file"}],"oa":"1","_id":"2142","date_updated":"2022-01-06T06:54:59Z","urn":"21421","year":"2001","type":"conference","citation":{"ama":"Kolman P, Scheideler C. Simple on-line algorithms for the maximum disjoint paths problem. In: SPAA. ; 2001:38--47.","apa":"Kolman, P., & Scheideler, C. (2001). Simple on-line algorithms for the maximum disjoint paths problem. In SPAA (pp. 38--47).","chicago":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” In SPAA, 38--47, 2001.","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} }","mla":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” SPAA, 2001, pp. 38--47.","short":"P. Kolman, C. Scheideler, in: SPAA, 2001, pp. 38--47.","ieee":"P. Kolman and C. Scheideler, “Simple on-line algorithms for the maximum disjoint paths problem,” in SPAA, 2001, pp. 38--47."},"page":"38--47"},{"status":"public","date_created":"2018-04-03T05:51:02Z","volume":33,"author":[{"first_name":"Micah","full_name":"Adler, Micah","last_name":"Adler"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publication":"Theory Comput. Syst.","department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","title":"Efficient Communication Strategies for Ad Hoc Wireless Networks","language":[{"iso":"eng"}],"citation":{"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.","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} }","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.","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","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","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.","short":"M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391."},"year":"2000","type":"journal_article","page":"337--391","issue":"5/6","doi":"10.1007/s002240010006","_id":"2143","date_updated":"2022-01-06T06:54:59Z","intvolume":" 33"},{"title":"From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols","user_id":"14955","author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Vöcking","first_name":"Berthold","full_name":"Vöcking, Berthold"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"SIAM J. Comput.","volume":30,"status":"public","date_created":"2018-04-03T06:12:15Z","_id":"2145","intvolume":" 30","date_updated":"2022-01-06T06:55:00Z","doi":"10.1137/S0097539799353431","issue":"4","year":"2000","type":"journal_article","citation":{"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","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","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.","bibtex":"@article{Scheideler_Vöcking_2000, title={From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols}, volume={30}, DOI={10.1137/S0097539799353431}, number={4}, journal={SIAM J. Comput.}, author={Scheideler, Christian and Vöcking, Berthold}, year={2000}, pages={1126--1155} }","mla":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” SIAM J. Comput., vol. 30, no. 4, 2000, pp. 1126--1155, doi:10.1137/S0097539799353431.","short":"C. Scheideler, B. Vöcking, SIAM J. Comput. 30 (2000) 1126--1155.","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."},"page":"1126--1155","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"year":"2000","type":"conference","citation":{"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} }","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.","chicago":"Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “Distributed Path Selection for Storage Networks.” In PDPTA, 2000.","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."},"urn":"21467","_id":"2146","date_updated":"2022-01-06T06:55:00Z","oa":"1","file":[{"date_updated":"2018-04-12T08:47:50Z","content_type":"application/pdf","relation":"main_file","file_size":168677,"creator":"florida","file_id":"2299","access_level":"open_access","date_created":"2018-04-12T08:47:50Z","file_name":"PDPTA-00.pdf"}],"publication":"PDPTA","department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T08:47:50Z","author":[{"full_name":"Berenbrink, Petra","first_name":"Petra","last_name":"Berenbrink"},{"full_name":"Brinkmann, André","first_name":"André","last_name":"Brinkmann"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"date_created":"2018-04-03T06:13:07Z","status":"public","has_accepted_license":"1","user_id":"14955","title":"Distributed Path Selection for Storage Networks","ddc":["040"]},{"ddc":["040"],"title":"Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma","user_id":"14955","author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publication":"SODA","file_date_updated":"2018-04-12T08:36:17Z","department":[{"_id":"79"},{"_id":"63"}],"file":[{"access_level":"open_access","date_created":"2018-04-12T08:36:17Z","file_name":"SODA-00.pdf","relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T08:36:17Z","creator":"florida","file_id":"2295","file_size":185001}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T06:16:48Z","_id":"2147","date_updated":"2022-01-06T06:55:00Z","urn":"21476","oa":"1","year":"2000","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} }","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.","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).","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.","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."},"page":"30--39","language":[{"iso":"eng"}]},{"type":"journal_article","citation":{"short":"A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237.","ieee":"A. Czumaj and C. Scheideler, “Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma,” Random Struct. Algorithms, vol. 17, no. 3–4, pp. 213--237, 2000.","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.","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.","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} }"},"year":"2000","page":"213--237","language":[{"iso":"eng"}],"issue":"3-4","_id":"2148","intvolume":" 17","date_updated":"2022-01-06T06:55:00Z","volume":17,"status":"public","date_created":"2018-04-03T06:17:52Z","author":[{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"Random Struct. Algorithms","department":[{"_id":"79"},{"_id":"63"}],"title":"Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma","user_id":"14955"},{"date_created":"2018-04-03T06:18:45Z","has_accepted_license":"1","status":"public","file":[{"content_type":"application/pdf","date_updated":"2018-04-12T08:38:13Z","relation":"main_file","file_size":222176,"creator":"florida","file_id":"2297","access_level":"open_access","file_name":"spaa_00.pdf","date_created":"2018-04-12T08:38:13Z"}],"department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T08:38:13Z","publication":"SPAA","author":[{"full_name":"Brinkmann, André","first_name":"André","last_name":"Brinkmann"},{"last_name":"Salzwedel","full_name":"Salzwedel, Kay","first_name":"Kay"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"user_id":"14955","title":"Efficient, distributed data placement strategies for storage area networks (extended abstract)","ddc":["040"],"language":[{"iso":"eng"}],"page":"119--128","year":"2000","type":"conference","citation":{"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} }","mla":"Brinkmann, André, et al. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” SPAA, 2000, pp. 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).","ama":"Brinkmann A, Salzwedel K, Scheideler C. Efficient, distributed data placement strategies for storage area networks (extended abstract). In: SPAA. ; 2000: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.","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."},"oa":"1","urn":"21493","_id":"2149","date_updated":"2022-01-06T06:55:02Z"}]