[{"citation":{"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} }","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","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","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.","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.","short":"F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138."},"type":"journal_article","year":"2001","page":"95--138","language":[{"iso":"eng"}],"_id":"2139","intvolume":" 21","date_updated":"2022-01-06T06:54:57Z","doi":"10.1007/s004930170007","issue":"1","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"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"},{"date_created":"2018-04-03T05:48:28Z","status":"public","has_accepted_license":"1","publication":"FOCS","department":[{"_id":"79"}],"file_date_updated":"2018-04-12T08:59:00Z","author":[{"last_name":"Awerbuch","full_name":"Awerbuch, Baruch","first_name":"Baruch"},{"last_name":"Berenbrink","first_name":"Petra","full_name":"Berenbrink, Petra"},{"first_name":"André","full_name":"Brinkmann, André","last_name":"Brinkmann"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publisher":"IEEE Computer Society","file":[{"creator":"florida","file_id":"2302","file_size":151156,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T08:59:00Z","date_created":"2018-04-12T08:59:00Z","file_name":"FOCS-01.pdf","access_level":"open_access"}],"ddc":["040"],"title":"Simple Routing Strategies for Adversarial Systems","user_id":"15504","page":"158--167","year":"2001","citation":{"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.","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} }","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."},"type":"conference","oa":"1","urn":"21406","date_updated":"2022-01-06T06:54:59Z","_id":"2140"},{"page":"227--234","type":"conference","year":"2001","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.","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."},"urn":"21415","_id":"2141","date_created":"2018-04-03T05:49:21Z","has_accepted_license":"1","status":"public","file":[{"relation":"main_file","date_updated":"2018-04-12T08:39:01Z","content_type":"application/pdf","creator":"florida","file_id":"2298","file_size":85778,"access_level":"open_access","file_name":"PDP-00.pdf","date_created":"2018-04-12T08:39:01Z"}],"file_date_updated":"2018-04-12T08:39:01Z","publication":"PDP","publisher":"IEEE Computer Society","author":[{"last_name":"Berenbrink","first_name":"Petra","full_name":"Berenbrink, Petra"},{"last_name":"Brinkmann","full_name":"Brinkmann, André","first_name":"André"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"user_id":"14955","ddc":["040"],"language":[{"iso":"eng"}],"oa":"1","date_updated":"2022-01-06T06:54:59Z","department":[{"_id":"79"},{"_id":"63"}],"title":"SIMLAB-A Simulation Environment for Storage Area Networks"},{"page":"38--47","year":"2001","type":"conference","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.","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).","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","date_updated":"2022-01-06T06:54:59Z","_id":"2142","oa":"1","file":[{"content_type":"application/pdf","date_updated":"2018-04-12T08:58:07Z","relation":"main_file","file_size":335171,"file_id":"2301","creator":"florida","access_level":"open_access","file_name":"SPAA-01.pdf","date_created":"2018-04-12T08:58:07Z"}],"department":[{"_id":"79"}],"publication":"SPAA","file_date_updated":"2018-04-12T08:58:07Z","author":[{"full_name":"Kolman, Petr","first_name":"Petr","last_name":"Kolman"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2018-04-03T05:50:16Z","status":"public","has_accepted_license":"1","user_id":"15504","title":"Simple on-line algorithms for the maximum disjoint paths problem","ddc":["040"]},{"user_id":"14955","title":"Efficient Communication Strategies for Ad Hoc Wireless Networks","author":[{"last_name":"Adler","first_name":"Micah","full_name":"Adler, Micah"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"Theory Comput. Syst.","department":[{"_id":"79"},{"_id":"63"}],"status":"public","date_created":"2018-04-03T05:51:02Z","volume":33,"_id":"2143","intvolume":" 33","date_updated":"2022-01-06T06:54:59Z","issue":"5/6","doi":"10.1007/s002240010006","language":[{"iso":"eng"}],"year":"2000","type":"journal_article","citation":{"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.","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.","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} }"},"page":"337--391"},{"date_created":"2018-04-03T06:12:15Z","status":"public","volume":30,"department":[{"_id":"79"},{"_id":"63"}],"publication":"SIAM J. Comput.","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"first_name":"Berthold","full_name":"Vöcking, Berthold","last_name":"Vöcking"}],"user_id":"14955","title":"From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols","language":[{"iso":"eng"}],"page":"1126--1155","citation":{"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.","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","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."},"type":"journal_article","year":"2000","issue":"4","doi":"10.1137/S0097539799353431","_id":"2145","intvolume":" 30","date_updated":"2022-01-06T06:55:00Z"},{"has_accepted_license":"1","status":"public","date_created":"2018-04-03T06:13:07Z","file":[{"date_updated":"2018-04-12T08:47:50Z","content_type":"application/pdf","relation":"main_file","file_size":168677,"file_id":"2299","creator":"florida","access_level":"open_access","file_name":"PDPTA-00.pdf","date_created":"2018-04-12T08:47:50Z"}],"author":[{"first_name":"Petra","full_name":"Berenbrink, Petra","last_name":"Berenbrink"},{"first_name":"André","full_name":"Brinkmann, André","last_name":"Brinkmann"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publication":"PDPTA","file_date_updated":"2018-04-12T08:47:50Z","department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","ddc":["040"],"title":"Distributed Path Selection for Storage Networks","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} }","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.","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."},"oa":"1","date_updated":"2022-01-06T06:55:00Z","_id":"2146","urn":"21467"},{"title":"Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma","ddc":["040"],"user_id":"14955","has_accepted_license":"1","status":"public","date_created":"2018-04-03T06:16:48Z","author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file_date_updated":"2018-04-12T08:36:17Z","department":[{"_id":"79"},{"_id":"63"}],"publication":"SODA","file":[{"file_size":185001,"file_id":"2295","creator":"florida","date_updated":"2018-04-12T08:36:17Z","content_type":"application/pdf","relation":"main_file","file_name":"SODA-00.pdf","date_created":"2018-04-12T08:36:17Z","access_level":"open_access"}],"oa":"1","date_updated":"2022-01-06T06:55:00Z","_id":"2147","urn":"21476","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"}]},{"intvolume":" 17","_id":"2148","date_updated":"2022-01-06T06:55:00Z","issue":"3-4","language":[{"iso":"eng"}],"page":"213--237","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.","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.","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","user_id":"14955","title":"Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma","department":[{"_id":"79"},{"_id":"63"}],"publication":"Random Struct. Algorithms","author":[{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"date_created":"2018-04-03T06:17:52Z","status":"public","volume":17},{"title":"Efficient, distributed data placement strategies for storage area networks (extended abstract)","ddc":["040"],"user_id":"14955","date_created":"2018-04-03T06:18:45Z","status":"public","has_accepted_license":"1","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","first_name":"Kay","full_name":"Salzwedel, Kay"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file":[{"access_level":"open_access","date_created":"2018-04-12T08:38:13Z","file_name":"spaa_00.pdf","relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T08:38:13Z","creator":"florida","file_id":"2297","file_size":222176}],"oa":"1","urn":"21493","date_updated":"2022-01-06T06:55:02Z","_id":"2149","page":"119--128","year":"2000","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} }","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."},"type":"conference","language":[{"iso":"eng"}]},{"date_updated":"2022-01-06T06:55:02Z","oa":"1","language":[{"iso":"eng"}],"title":"A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)","department":[{"_id":"79"},{"_id":"63"}],"_id":"2150","urn":"21509","year":"2000","type":"conference","citation":{"ama":"Czumaj A, Scheideler C. A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In: STOC. ACM; 2000:38--47.","apa":"Czumaj, A., & Scheideler, C. (2000). A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In STOC (pp. 38--47). ACM.","chicago":"Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (Extended Abstract).” In STOC, 38--47. ACM, 2000.","mla":"Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (Extended Abstract).” STOC, ACM, 2000, pp. 38--47.","bibtex":"@inproceedings{Czumaj_Scheideler_2000, title={A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)}, booktitle={STOC}, publisher={ACM}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={38--47} }","short":"A. Czumaj, C. Scheideler, in: STOC, ACM, 2000, pp. 38--47.","ieee":"A. Czumaj and C. Scheideler, “A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract),” in STOC, 2000, pp. 38--47."},"page":"38--47","ddc":["040"],"user_id":"14955","publisher":"ACM","author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"STOC","file_date_updated":"2018-04-12T08:49:23Z","file":[{"access_level":"open_access","date_created":"2018-04-12T08:49:23Z","file_name":"STOC-00.pdf","content_type":"application/pdf","date_updated":"2018-04-12T08:49:23Z","relation":"main_file","file_size":190083,"file_id":"2300","creator":"florida"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T06:21:11Z"},{"page":"38-47","citation":{"ieee":"A. Czumaj and C. Scheideler, “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ,” in 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.","short":"A. Czumaj, C. Scheideler, in: 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.","mla":"Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.","bibtex":"@inproceedings{Czumaj_Scheideler_2000, title={A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems }, booktitle={32nd ACM Symposium on Theory of Computing}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={38–47} }","apa":"Czumaj, A., & Scheideler, C. (2000). A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In 32nd ACM Symposium on Theory of Computing (pp. 38–47).","ama":"Czumaj A, Scheideler C. A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In: 32nd ACM Symposium on Theory of Computing. ; 2000:38-47.","chicago":"Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” In 32nd ACM Symposium on Theory of Computing, 38–47, 2000."},"year":"2000","type":"conference","language":[{"iso":"eng"}],"oa":"1","urn":"22111","_id":"2211","date_updated":"2022-01-06T06:55:26Z","date_created":"2018-04-05T07:02:46Z","has_accepted_license":"1","status":"public","file_date_updated":"2018-04-12T08:37:23Z","publication":"32nd ACM Symposium on Theory of Computing","department":[{"_id":"79"},{"_id":"63"}],"author":[{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"date_updated":"2018-04-12T08:37:23Z","content_type":"application/pdf","relation":"main_file","file_size":190083,"creator":"florida","file_id":"2296","access_level":"open_access","date_created":"2018-04-12T08:37:23Z","file_name":"STOC-00.pdf"}],"ddc":["040"],"title":"A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ","user_id":"14955"},{"volume":32,"status":"public","date_created":"2018-04-03T06:22:14Z","author":[{"last_name":"Flammini","first_name":"Michele","full_name":"Flammini, Michele"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"Theory Comput. Syst.","department":[{"_id":"79"},{"_id":"63"}],"title":"Simple, Efficient Routing Schemes for All-Optical Networks","user_id":"14955","type":"journal_article","citation":{"apa":"Flammini, M., & Scheideler, C. (1999). Simple, Efficient Routing Schemes for All-Optical Networks. Theory Comput. Syst., 32(3), 387--420. https://doi.org/10.1007/s002240000123","ama":"Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical Networks. Theory Comput Syst. 1999;32(3):387--420. doi:10.1007/s002240000123","chicago":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” Theory Comput. Syst. 32, no. 3 (1999): 387--420. https://doi.org/10.1007/s002240000123.","bibtex":"@article{Flammini_Scheideler_1999, title={Simple, Efficient Routing Schemes for All-Optical Networks}, volume={32}, DOI={10.1007/s002240000123}, number={3}, journal={Theory Comput. Syst.}, author={Flammini, Michele and Scheideler, Christian}, year={1999}, pages={387--420} }","mla":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” Theory Comput. Syst., vol. 32, no. 3, 1999, pp. 387--420, doi:10.1007/s002240000123.","short":"M. Flammini, C. Scheideler, Theory Comput. Syst. 32 (1999) 387--420.","ieee":"M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” Theory Comput. Syst., vol. 32, no. 3, pp. 387--420, 1999."},"year":"1999","page":"387--420","language":[{"iso":"eng"}],"doi":"10.1007/s002240000123","issue":"3","_id":"2151","intvolume":" 32","date_updated":"2022-01-06T06:55:02Z"},{"author":[{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T07:34:50Z","publication":"SODA","file":[{"file_name":"SODA-99.pdf","date_created":"2018-04-12T07:34:50Z","access_level":"open_access","file_id":"2288","creator":"florida","file_size":179058,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T07:34:50Z"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T08:56:06Z","ddc":["040"],"title":"Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths","user_id":"14955","citation":{"bibtex":"@inproceedings{Berenbrink_Scheideler_1999, title={Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths}, booktitle={SODA}, author={Berenbrink, Petra and Scheideler, Christian}, year={1999}, pages={112--121} }","mla":"Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” SODA, 1999, pp. 112--121.","ama":"Berenbrink P, Scheideler C. Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In: SODA. ; 1999:112--121.","apa":"Berenbrink, P., & Scheideler, C. (1999). Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In SODA (pp. 112--121).","chicago":"Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” In SODA, 112--121, 1999.","ieee":"P. Berenbrink and C. Scheideler, “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths,” in SODA, 1999, pp. 112--121.","short":"P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121."},"type":"conference","year":"1999","page":"112--121","language":[{"iso":"eng"}],"_id":"2164","date_updated":"2022-01-06T06:55:09Z","urn":"21649","oa":"1"},{"language":[{"iso":"eng"}],"type":"conference","citation":{"ieee":"P. Berenbrink, M. Riedel, and C. Scheideler, “Simple Competitive Request Scheduling Strategies,” in SPAA, 1999, pp. 33--42.","short":"P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.","bibtex":"@inproceedings{Berenbrink_Riedel_Scheideler_1999, title={Simple Competitive Request Scheduling Strategies}, booktitle={SPAA}, author={Berenbrink, Petra and Riedel, Marco and Scheideler, Christian}, year={1999}, pages={33--42} }","mla":"Berenbrink, Petra, et al. “Simple Competitive Request Scheduling Strategies.” SPAA, 1999, pp. 33--42.","apa":"Berenbrink, P., Riedel, M., & Scheideler, C. (1999). Simple Competitive Request Scheduling Strategies. In SPAA (pp. 33--42).","ama":"Berenbrink P, Riedel M, Scheideler C. Simple Competitive Request Scheduling Strategies. In: SPAA. ; 1999:33--42.","chicago":"Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Simple Competitive Request Scheduling Strategies.” In SPAA, 33--42, 1999."},"year":"1999","page":"33--42","oa":"1","date_updated":"2022-01-06T06:55:09Z","_id":"2165","urn":"21658","has_accepted_license":"1","status":"public","date_created":"2018-04-03T08:56:45Z","file":[{"content_type":"application/pdf","date_updated":"2018-04-12T07:36:27Z","relation":"main_file","file_size":144422,"file_id":"2290","creator":"florida","access_level":"open_access","date_created":"2018-04-12T07:36:27Z","file_name":"SPAA-99.pdf"}],"author":[{"full_name":"Berenbrink, Petra","first_name":"Petra","last_name":"Berenbrink"},{"last_name":"Riedel","first_name":"Marco","full_name":"Riedel, Marco"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file_date_updated":"2018-04-12T07:36:27Z","publication":"SPAA","department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","title":"Simple Competitive Request Scheduling Strategies","ddc":["040"]},{"user_id":"14955","ddc":["040"],"title":"Design of the PRESTO Multimedia Storage Network (Extended Abstract)","date_created":"2018-04-05T07:00:11Z","has_accepted_license":"1","status":"public","file":[{"date_created":"2018-04-12T08:34:00Z","file_name":"CDMLarge-99.pdf","access_level":"open_access","creator":"florida","file_id":"2294","file_size":211926,"relation":"main_file","date_updated":"2018-04-12T08:34:00Z","content_type":"application/pdf"}],"publication":"International Workshop on Communication and Data Management in Large Networks (CDMLarge)","file_date_updated":"2018-04-12T08:34:00Z","department":[{"_id":"79"},{"_id":"63"}],"author":[{"first_name":"Petra","full_name":"Berenbrink, Petra","last_name":"Berenbrink"},{"last_name":"Riedel","full_name":"Riedel, Marco","first_name":"Marco"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"oa":"1","urn":"22109","date_updated":"2022-01-06T06:55:26Z","_id":"2210","language":[{"iso":"eng"}],"page":"2-12","year":"1999","type":"conference","citation":{"ieee":"P. Berenbrink, M. Riedel, and C. Scheideler, “Design of the PRESTO Multimedia Storage Network (Extended Abstract),” in International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.","short":"P. Berenbrink, M. Riedel, C. Scheideler, in: International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.","bibtex":"@inproceedings{Berenbrink_Riedel_Scheideler_1999, title={Design of the PRESTO Multimedia Storage Network (Extended Abstract)}, booktitle={International Workshop on Communication and Data Management in Large Networks (CDMLarge)}, author={Berenbrink, Petra and Riedel, Marco and Scheideler, Christian}, year={1999}, pages={2–12} }","mla":"Berenbrink, Petra, et al. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.","chicago":"Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” In International Workshop on Communication and Data Management in Large Networks (CDMLarge), 2–12, 1999.","apa":"Berenbrink, P., Riedel, M., & Scheideler, C. (1999). Design of the PRESTO Multimedia Storage Network (Extended Abstract). In International Workshop on Communication and Data Management in Large Networks (CDMLarge) (pp. 2–12).","ama":"Berenbrink P, Riedel M, Scheideler C. Design of the PRESTO Multimedia Storage Network (Extended Abstract). In: International Workshop on Communication and Data Management in Large Networks (CDMLarge). ; 1999:2-12."}},{"ddc":["040"],"title":"From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols","user_id":"14955","publication":"STOC","department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T07:35:46Z","author":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Vöcking","first_name":"Berthold","full_name":"Vöcking, Berthold"}],"file":[{"date_created":"2018-04-12T07:35:46Z","file_name":"STOC-99.pdf","access_level":"open_access","file_size":227305,"file_id":"2289","creator":"florida","date_updated":"2018-04-12T07:35:46Z","content_type":"application/pdf","relation":"main_file"}],"date_created":"2018-04-03T08:57:30Z","has_accepted_license":"1","status":"public","urn":"21668","date_updated":"2022-01-06T06:55:10Z","_id":"2166","oa":"1","page":"215--224","year":"1999","citation":{"chicago":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” In STOC, 215--224, 1999.","apa":"Scheideler, C., & Vöcking, B. (1999). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. In STOC (pp. 215--224).","ama":"Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. In: STOC. ; 1999:215--224.","mla":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” STOC, 1999, pp. 215--224.","bibtex":"@inproceedings{Scheideler_Vöcking_1999, title={From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols}, booktitle={STOC}, author={Scheideler, Christian and Vöcking, Berthold}, year={1999}, pages={215--224} }","short":"C. Scheideler, B. Vöcking, in: STOC, 1999, pp. 215--224.","ieee":"C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,” in STOC, 1999, pp. 215--224."},"type":"conference","language":[{"iso":"eng"}]},{"title":"Universal Continuous Routing Strategies","user_id":"14955","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Vöcking","full_name":"Vöcking, Berthold","first_name":"Berthold"}],"publication":"Theory Comput. Syst.","department":[{"_id":"79"},{"_id":"63"}],"volume":31,"status":"public","date_created":"2018-04-03T08:59:06Z","date_updated":"2022-01-06T06:55:10Z","_id":"2168","intvolume":" 31","doi":"10.1007/s002240000096","issue":"4","year":"1998","citation":{"ieee":"C. Scheideler and B. Vöcking, “Universal Continuous Routing Strategies,” Theory Comput. Syst., vol. 31, no. 4, pp. 425--449, 1998.","short":"C. Scheideler, B. Vöcking, Theory Comput. Syst. 31 (1998) 425--449.","mla":"Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.” Theory Comput. Syst., vol. 31, no. 4, 1998, pp. 425--449, doi:10.1007/s002240000096.","bibtex":"@article{Scheideler_Vöcking_1998, title={Universal Continuous Routing Strategies}, volume={31}, DOI={10.1007/s002240000096}, number={4}, journal={Theory Comput. Syst.}, author={Scheideler, Christian and Vöcking, Berthold}, year={1998}, pages={425--449} }","chicago":"Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.” Theory Comput. Syst. 31, no. 4 (1998): 425--449. https://doi.org/10.1007/s002240000096.","apa":"Scheideler, C., & Vöcking, B. (1998). Universal Continuous Routing Strategies. Theory Comput. Syst., 31(4), 425--449. https://doi.org/10.1007/s002240000096","ama":"Scheideler C, Vöcking B. Universal Continuous Routing Strategies. Theory Comput Syst. 1998;31(4):425--449. doi:10.1007/s002240000096"},"type":"journal_article","page":"425--449","language":[{"iso":"eng"}]},{"date_created":"2018-04-03T08:59:55Z","has_accepted_license":"1","status":"public","department":[{"_id":"79"},{"_id":"63"}],"publication":"SPAA","file_date_updated":"2018-04-12T07:08:12Z","author":[{"last_name":"Adler","first_name":"Micah","full_name":"Adler, Micah"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file":[{"date_updated":"2018-04-12T07:08:12Z","content_type":"application/pdf","relation":"main_file","file_size":492778,"creator":"florida","file_id":"2285","access_level":"open_access","date_created":"2018-04-12T07:08:12Z","file_name":"SPAA98.pdf"}],"ddc":["040"],"title":"Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)","user_id":"14955","page":"259--268","year":"1998","citation":{"bibtex":"@inproceedings{Adler_Scheideler_1998, title={Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)}, booktitle={SPAA}, author={Adler, Micah and Scheideler, Christian}, year={1998}, pages={259--268} }","mla":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” SPAA, 1998, pp. 259--268.","chicago":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” In SPAA, 259--268, 1998.","apa":"Adler, M., & Scheideler, C. (1998). Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). In SPAA (pp. 259--268).","ama":"Adler M, Scheideler C. Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). In: SPAA. ; 1998:259--268.","ieee":"M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract),” in SPAA, 1998, pp. 259--268.","short":"M. Adler, C. Scheideler, in: SPAA, 1998, pp. 259--268."},"type":"conference","language":[{"iso":"eng"}],"oa":"1","urn":"21699","_id":"2169","date_updated":"2022-01-06T06:55:10Z"},{"language":[{"iso":"eng"}],"type":"conference","citation":{"apa":"Feige, U., & Scheideler, C. (1998). Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). In STOC (pp. 624--633).","ama":"Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). In: STOC. ; 1998:624--633.","chicago":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” In STOC, 624--633, 1998.","bibtex":"@inproceedings{Feige_Scheideler_1998, title={Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)}, booktitle={STOC}, author={Feige, Uriel and Scheideler, Christian}, year={1998}, pages={624--633} }","mla":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” STOC, 1998, pp. 624--633.","short":"U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633.","ieee":"U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract),” in STOC, 1998, pp. 624--633."},"year":"1998","page":"624--633","oa":"1","date_updated":"2022-01-06T06:55:11Z","_id":"2170","urn":"21705","status":"public","has_accepted_license":"1","date_created":"2018-04-03T09:00:31Z","file":[{"relation":"main_file","date_updated":"2018-04-12T07:15:50Z","content_type":"application/pdf","creator":"florida","file_id":"2286","file_size":228487,"access_level":"open_access","file_name":"STOC98.pdf","date_created":"2018-04-12T07:15:50Z"}],"author":[{"first_name":"Uriel","full_name":"Feige, Uriel","last_name":"Feige"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"STOC","file_date_updated":"2018-04-12T07:15:50Z","user_id":"14955","title":"Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)","ddc":["040"]}]