[{"date_created":"2018-04-03T05:47:20Z","status":"public","volume":21,"department":[{"_id":"79"},{"_id":"63"}],"publication":"Combinatorica","author":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"user_id":"14955","title":"Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols","language":[{"iso":"eng"}],"page":"95--138","type":"journal_article","year":"2001","citation":{"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.","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."},"issue":"1","doi":"10.1007/s004930170007","date_updated":"2022-01-06T06:54:57Z","_id":"2139","intvolume":" 21"},{"user_id":"15504","ddc":["040"],"title":"Simple Routing Strategies for Adversarial Systems","file":[{"file_size":151156,"file_id":"2302","creator":"florida","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"}],"department":[{"_id":"79"}],"file_date_updated":"2018-04-12T08:59:00Z","publication":"FOCS","author":[{"first_name":"Baruch","full_name":"Awerbuch, Baruch","last_name":"Awerbuch"},{"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","date_created":"2018-04-03T05:48:28Z","status":"public","has_accepted_license":"1","urn":"21406","_id":"2140","date_updated":"2022-01-06T06:54:59Z","oa":"1","page":"158--167","type":"conference","year":"2001","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.","apa":"Awerbuch, B., Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). Simple Routing Strategies for Adversarial Systems. In FOCS (pp. 158--167). IEEE Computer Society.","ama":"Awerbuch B, Berenbrink P, Brinkmann A, Scheideler C. Simple Routing Strategies for Adversarial Systems. In: FOCS. IEEE Computer Society; 2001: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.","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} }","mla":"Awerbuch, Baruch, et al. “Simple Routing Strategies for Adversarial Systems.” FOCS, IEEE Computer Society, 2001, pp. 158--167."}},{"ddc":["040"],"user_id":"14955","publication":"PDP","file_date_updated":"2018-04-12T08:39:01Z","publisher":"IEEE Computer Society","author":[{"full_name":"Berenbrink, Petra","first_name":"Petra","last_name":"Berenbrink"},{"last_name":"Brinkmann","first_name":"André","full_name":"Brinkmann, André"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"content_type":"application/pdf","date_updated":"2018-04-12T08:39:01Z","relation":"main_file","file_size":85778,"creator":"florida","file_id":"2298","access_level":"open_access","file_name":"PDP-00.pdf","date_created":"2018-04-12T08:39:01Z"}],"date_created":"2018-04-03T05:49:21Z","status":"public","has_accepted_license":"1","urn":"21415","_id":"2141","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.","mla":"Berenbrink, Petra, et al. “SIMLAB-A Simulation Environment for Storage Area Networks.” 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} }","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.","chicago":"Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “SIMLAB-A Simulation Environment for Storage Area Networks.” In PDP, 227--234. IEEE Computer Society, 2001."},"type":"conference","year":"2001","title":"SIMLAB-A Simulation Environment for Storage Area Networks","department":[{"_id":"79"},{"_id":"63"}],"date_updated":"2022-01-06T06:54:59Z","oa":"1","language":[{"iso":"eng"}]},{"oa":"1","date_updated":"2022-01-06T06:54:59Z","_id":"2142","urn":"21421","type":"conference","year":"2001","citation":{"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.","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.","chicago":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” In SPAA, 38--47, 2001.","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} }"},"page":"38--47","ddc":["040"],"title":"Simple on-line algorithms for the maximum disjoint paths problem","user_id":"15504","has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:50:16Z","author":[{"first_name":"Petr","full_name":"Kolman, Petr","last_name":"Kolman"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"department":[{"_id":"79"}],"publication":"SPAA","file_date_updated":"2018-04-12T08:58:07Z","file":[{"access_level":"open_access","file_name":"SPAA-01.pdf","date_created":"2018-04-12T08:58:07Z","content_type":"application/pdf","date_updated":"2018-04-12T08:58:07Z","relation":"main_file","file_size":335171,"creator":"florida","file_id":"2301"}]},{"language":[{"iso":"eng"}],"page":"337--391","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","_id":"2143","date_updated":"2022-01-06T06:54:59Z","intvolume":" 33","issue":"5/6","doi":"10.1007/s002240010006","publication":"Theory Comput. Syst.","department":[{"_id":"79"},{"_id":"63"}],"author":[{"last_name":"Adler","first_name":"Micah","full_name":"Adler, Micah"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"date_created":"2018-04-03T05:51:02Z","status":"public","volume":33,"user_id":"14955","title":"Efficient Communication Strategies for Ad Hoc Wireless Networks"},{"department":[{"_id":"79"},{"_id":"63"}],"publication":"SIAM J. Comput.","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"}],"volume":30,"date_created":"2018-04-03T06:12:15Z","status":"public","title":"From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols","user_id":"14955","page":"1126--1155","citation":{"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.","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.","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."},"year":"2000","type":"journal_article","language":[{"iso":"eng"}],"intvolume":" 30","_id":"2145","date_updated":"2022-01-06T06:55:00Z","doi":"10.1137/S0097539799353431","issue":"4"},{"oa":"1","urn":"21467","_id":"2146","date_updated":"2022-01-06T06:55:00Z","language":[{"iso":"eng"}],"year":"2000","type":"conference","citation":{"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.","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} }","short":"P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.","ieee":"P. Berenbrink, A. Brinkmann, and C. Scheideler, “Distributed Path Selection for Storage Networks,” in PDPTA, 2000."},"user_id":"14955","ddc":["040"],"title":"Distributed Path Selection for Storage Networks","date_created":"2018-04-03T06:13:07Z","status":"public","has_accepted_license":"1","file":[{"file_name":"PDPTA-00.pdf","date_created":"2018-04-12T08:47:50Z","access_level":"open_access","file_size":168677,"creator":"florida","file_id":"2299","date_updated":"2018-04-12T08:47:50Z","content_type":"application/pdf","relation":"main_file"}],"publication":"PDPTA","department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T08:47:50Z","author":[{"first_name":"Petra","full_name":"Berenbrink, Petra","last_name":"Berenbrink"},{"last_name":"Brinkmann","full_name":"Brinkmann, André","first_name":"André"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}]},{"page":"30--39","year":"2000","type":"conference","citation":{"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.","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.","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} }","short":"A. Czumaj, C. Scheideler, in: SODA, 2000, pp. 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."},"language":[{"iso":"eng"}],"oa":"1","urn":"21476","_id":"2147","date_updated":"2022-01-06T06:55:00Z","date_created":"2018-04-03T06:16:48Z","status":"public","has_accepted_license":"1","department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T08:36:17Z","publication":"SODA","author":[{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"relation":"main_file","date_updated":"2018-04-12T08:36:17Z","content_type":"application/pdf","creator":"florida","file_id":"2295","file_size":185001,"access_level":"open_access","date_created":"2018-04-12T08:36:17Z","file_name":"SODA-00.pdf"}],"ddc":["040"],"title":"Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma","user_id":"14955"},{"page":"213--237","year":"2000","type":"journal_article","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.","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} }","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.","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."},"language":[{"iso":"eng"}],"issue":"3-4","_id":"2148","date_updated":"2022-01-06T06:55:00Z","intvolume":" 17","volume":17,"date_created":"2018-04-03T06:17:52Z","status":"public","publication":"Random Struct. Algorithms","department":[{"_id":"79"},{"_id":"63"}],"author":[{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"title":"Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma","user_id":"14955"},{"date_updated":"2022-01-06T06:55:02Z","_id":"2149","urn":"21493","oa":"1","citation":{"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).","chicago":"Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” In SPAA, 119--128, 2000.","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} }","short":"A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.","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."},"year":"2000","type":"conference","page":"119--128","language":[{"iso":"eng"}],"title":"Efficient, distributed data placement strategies for storage area networks (extended abstract)","ddc":["040"],"user_id":"14955","author":[{"last_name":"Brinkmann","full_name":"Brinkmann, André","first_name":"André"},{"last_name":"Salzwedel","full_name":"Salzwedel, Kay","first_name":"Kay"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T08:38:13Z","publication":"SPAA","file":[{"file_size":222176,"creator":"florida","file_id":"2297","content_type":"application/pdf","date_updated":"2018-04-12T08:38:13Z","relation":"main_file","date_created":"2018-04-12T08:38:13Z","file_name":"spaa_00.pdf","access_level":"open_access"}],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T06:18:45Z"},{"file":[{"access_level":"open_access","file_name":"STOC-00.pdf","date_created":"2018-04-12T08:49:23Z","relation":"main_file","date_updated":"2018-04-12T08:49:23Z","content_type":"application/pdf","file_id":"2300","creator":"florida","file_size":190083}],"publisher":"ACM","author":[{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file_date_updated":"2018-04-12T08:49:23Z","publication":"STOC","status":"public","has_accepted_license":"1","date_created":"2018-04-03T06:21:11Z","user_id":"14955","ddc":["040"],"type":"conference","citation":{"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} }","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.","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.","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.","short":"A. Czumaj, C. Scheideler, in: STOC, ACM, 2000, pp. 38--47."},"year":"2000","page":"38--47","_id":"2150","urn":"21509","department":[{"_id":"79"},{"_id":"63"}],"title":"A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:02Z","oa":"1"},{"ddc":["040"],"title":"A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T08:37:23Z","publication":"32nd ACM Symposium on Theory of Computing","author":[{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file":[{"file_size":190083,"file_id":"2296","creator":"florida","content_type":"application/pdf","date_updated":"2018-04-12T08:37:23Z","relation":"main_file","file_name":"STOC-00.pdf","date_created":"2018-04-12T08:37:23Z","access_level":"open_access"}],"date_created":"2018-04-05T07:02:46Z","has_accepted_license":"1","status":"public","urn":"22111","date_updated":"2022-01-06T06:55:26Z","_id":"2211","oa":"1","page":"38-47","year":"2000","citation":{"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.","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.","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} }","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.","short":"A. Czumaj, C. Scheideler, in: 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.","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."},"type":"conference","language":[{"iso":"eng"}]},{"doi":"10.1007/s002240000123","issue":"3","intvolume":" 32","_id":"2151","date_updated":"2022-01-06T06:55:02Z","year":"1999","type":"journal_article","citation":{"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.","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} }","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.","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.","short":"M. Flammini, C. Scheideler, Theory Comput. Syst. 32 (1999) 387--420."},"page":"387--420","language":[{"iso":"eng"}],"title":"Simple, Efficient Routing Schemes for All-Optical Networks","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"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"Theory Comput. Syst."},{"language":[{"iso":"eng"}],"citation":{"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.","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.","short":"P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121.","ieee":"P. Berenbrink and C. Scheideler, “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths,” in SODA, 1999, pp. 112--121."},"year":"1999","type":"conference","page":"112--121","_id":"2164","date_updated":"2022-01-06T06:55:09Z","urn":"21649","oa":"1","file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T07:34:50Z","file_id":"2288","creator":"florida","file_size":179058,"access_level":"open_access","file_name":"SODA-99.pdf","date_created":"2018-04-12T07:34:50Z"}],"author":[{"last_name":"Berenbrink","first_name":"Petra","full_name":"Berenbrink, Petra"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file_date_updated":"2018-04-12T07:34:50Z","publication":"SODA","department":[{"_id":"79"},{"_id":"63"}],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T08:56:06Z","user_id":"14955","ddc":["040"],"title":"Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths"},{"date_created":"2018-04-03T08:56:45Z","status":"public","has_accepted_license":"1","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"}],"file_date_updated":"2018-04-12T07:36:27Z","publication":"SPAA","department":[{"_id":"79"},{"_id":"63"}],"author":[{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"},{"first_name":"Marco","full_name":"Riedel, Marco","last_name":"Riedel"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"user_id":"14955","ddc":["040"],"title":"Simple Competitive Request Scheduling Strategies","language":[{"iso":"eng"}],"page":"33--42","citation":{"short":"P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.","ieee":"P. Berenbrink, M. Riedel, and C. Scheideler, “Simple Competitive Request Scheduling Strategies,” in SPAA, 1999, pp. 33--42.","chicago":"Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Simple Competitive Request Scheduling Strategies.” In SPAA, 33--42, 1999.","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.","mla":"Berenbrink, Petra, et al. “Simple Competitive Request Scheduling Strategies.” 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} }"},"type":"conference","year":"1999","oa":"1","urn":"21658","_id":"2165","date_updated":"2022-01-06T06:55:09Z"},{"user_id":"14955","ddc":["040"],"title":"Design of the PRESTO Multimedia Storage Network (Extended Abstract)","status":"public","has_accepted_license":"1","date_created":"2018-04-05T07:00:11Z","file":[{"date_updated":"2018-04-12T08:34:00Z","content_type":"application/pdf","relation":"main_file","file_size":211926,"file_id":"2294","creator":"florida","access_level":"open_access","date_created":"2018-04-12T08:34:00Z","file_name":"CDMLarge-99.pdf"}],"author":[{"last_name":"Berenbrink","first_name":"Petra","full_name":"Berenbrink, Petra"},{"full_name":"Riedel, Marco","first_name":"Marco","last_name":"Riedel"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publication":"International Workshop on Communication and Data Management in Large Networks (CDMLarge)","department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T08:34:00Z","oa":"1","_id":"2210","date_updated":"2022-01-06T06:55:26Z","urn":"22109","language":[{"iso":"eng"}],"type":"conference","citation":{"short":"P. Berenbrink, M. Riedel, C. Scheideler, in: International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.","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.","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.","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).","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.","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."},"year":"1999","page":"2-12"},{"type":"conference","year":"1999","citation":{"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} }","ama":"Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. In: STOC. ; 1999:215--224.","apa":"Scheideler, C., & Vöcking, B. (1999). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. In STOC (pp. 215--224).","chicago":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” In STOC, 215--224, 1999.","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.","short":"C. Scheideler, B. Vöcking, in: STOC, 1999, pp. 215--224."},"page":"215--224","language":[{"iso":"eng"}],"_id":"2166","date_updated":"2022-01-06T06:55:10Z","urn":"21668","oa":"1","author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Berthold","full_name":"Vöcking, Berthold","last_name":"Vöcking"}],"file_date_updated":"2018-04-12T07:35:46Z","publication":"STOC","department":[{"_id":"79"},{"_id":"63"}],"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"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T08:57:30Z","title":"From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols","ddc":["040"],"user_id":"14955"},{"date_created":"2018-04-03T08:59:06Z","status":"public","volume":31,"publication":"Theory Comput. Syst.","department":[{"_id":"79"},{"_id":"63"}],"author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"}],"user_id":"14955","title":"Universal Continuous Routing Strategies","language":[{"iso":"eng"}],"page":"425--449","year":"1998","citation":{"short":"C. Scheideler, B. Vöcking, Theory Comput. Syst. 31 (1998) 425--449.","ieee":"C. Scheideler and B. Vöcking, “Universal Continuous Routing Strategies,” Theory Comput. Syst., vol. 31, no. 4, pp. 425--449, 1998.","ama":"Scheideler C, Vöcking B. Universal Continuous Routing Strategies. Theory Comput Syst. 1998;31(4):425--449. doi: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","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.","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} }","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."},"type":"journal_article","issue":"4","doi":"10.1007/s002240000096","intvolume":" 31","_id":"2168","date_updated":"2022-01-06T06:55:10Z"},{"department":[{"_id":"79"},{"_id":"63"}],"publication":"SPAA","file_date_updated":"2018-04-12T07:08:12Z","author":[{"first_name":"Micah","full_name":"Adler, Micah","last_name":"Adler"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file":[{"file_size":492778,"creator":"florida","file_id":"2285","date_updated":"2018-04-12T07:08:12Z","content_type":"application/pdf","relation":"main_file","date_created":"2018-04-12T07:08:12Z","file_name":"SPAA98.pdf","access_level":"open_access"}],"date_created":"2018-04-03T08:59:55Z","has_accepted_license":"1","status":"public","title":"Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)","ddc":["040"],"user_id":"14955","page":"259--268","year":"1998","citation":{"mla":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” SPAA, 1998, pp. 259--268.","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} }","ama":"Adler M, Scheideler C. Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). In: SPAA. ; 1998:259--268.","apa":"Adler, M., & Scheideler, C. (1998). Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). In SPAA (pp. 259--268).","chicago":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” In SPAA, 259--268, 1998.","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"}],"urn":"21699","_id":"2169","date_updated":"2022-01-06T06:55:10Z","oa":"1"},{"date_updated":"2022-01-06T06:55:11Z","_id":"2170","urn":"21705","oa":"1","type":"conference","year":"1998","citation":{"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.","chicago":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” In STOC, 624--633, 1998.","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.","ieee":"U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract),” in STOC, 1998, pp. 624--633.","short":"U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633."},"page":"624--633","language":[{"iso":"eng"}],"title":"Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)","ddc":["040"],"user_id":"14955","author":[{"full_name":"Feige, Uriel","first_name":"Uriel","last_name":"Feige"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"STOC","file_date_updated":"2018-04-12T07:15:50Z","file":[{"access_level":"open_access","date_created":"2018-04-12T07:15:50Z","file_name":"STOC98.pdf","date_updated":"2018-04-12T07:15:50Z","content_type":"application/pdf","relation":"main_file","file_size":228487,"file_id":"2286","creator":"florida"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T09:00:31Z"},{"date_updated":"2022-01-06T06:55:13Z","oa":"1","language":[{"iso":"eng"}],"title":"Optimal Wormhole Routing in the (n, d)-Torus","department":[{"_id":"79"},{"_id":"63"}],"_id":"2175","urn":"21759","year":"1997","citation":{"short":"S. Bock, F. Meyer auf der Heide, C. Scheideler, in: IPPS, IEEE Computer Society, 1997, pp. 326--332.","ieee":"S. Bock, F. Meyer auf der Heide, and C. Scheideler, “Optimal Wormhole Routing in the (n, d)-Torus,” in IPPS, 1997, pp. 326--332.","apa":"Bock, S., Meyer auf der Heide, F., & Scheideler, C. (1997). Optimal Wormhole Routing in the (n, d)-Torus. In IPPS (pp. 326--332). IEEE Computer Society.","ama":"Bock S, Meyer auf der Heide F, Scheideler C. Optimal Wormhole Routing in the (n, d)-Torus. In: IPPS. IEEE Computer Society; 1997:326--332.","chicago":"Bock, Stefan, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Optimal Wormhole Routing in the (n, d)-Torus.” In IPPS, 326--332. IEEE Computer Society, 1997.","bibtex":"@inproceedings{Bock_Meyer auf der Heide_Scheideler_1997, title={Optimal Wormhole Routing in the (n, d)-Torus}, booktitle={IPPS}, publisher={IEEE Computer Society}, author={Bock, Stefan and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1997}, pages={326--332} }","mla":"Bock, Stefan, et al. “Optimal Wormhole Routing in the (n, d)-Torus.” IPPS, IEEE Computer Society, 1997, pp. 326--332."},"type":"conference","page":"326--332","ddc":["040"],"user_id":"14955","publisher":"IEEE Computer Society","author":[{"full_name":"Bock, Stefan","first_name":"Stefan","last_name":"Bock"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file_date_updated":"2018-04-12T07:11:50Z","publication":"IPPS","file":[{"file_name":"IPPS97.pdf","date_created":"2018-04-12T07:07:20Z","access_level":"open_access","file_id":"2284","creator":"florida","file_size":88749,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T07:11:50Z"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T09:11:47Z"},{"date_created":"2018-04-03T09:17:10Z","status":"public","has_accepted_license":"1","department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T07:11:32Z","publication":"SPAA","author":[{"first_name":"Michele","full_name":"Flammini, Michele","last_name":"Flammini"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file":[{"file_name":"SPAA97.pdf","date_created":"2018-04-12T07:06:34Z","access_level":"open_access","file_id":"2283","creator":"florida","file_size":365709,"relation":"main_file","date_updated":"2018-04-12T07:11:32Z","content_type":"application/pdf"}],"ddc":["040"],"title":"Simple, Efficient Routing Schemes for All-Optical Networks","user_id":"14955","page":"170--179","year":"1997","type":"conference","citation":{"short":"M. Flammini, C. Scheideler, in: SPAA, 1997, pp. 170--179.","ieee":"M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” in SPAA, 1997, pp. 170--179.","apa":"Flammini, M., & Scheideler, C. (1997). Simple, Efficient Routing Schemes for All-Optical Networks. In SPAA (pp. 170--179).","ama":"Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical Networks. In: SPAA. ; 1997:170--179.","chicago":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” In SPAA, 170--179, 1997.","bibtex":"@inproceedings{Flammini_Scheideler_1997, title={Simple, Efficient Routing Schemes for All-Optical Networks}, booktitle={SPAA}, author={Flammini, Michele and Scheideler, Christian}, year={1997}, pages={170--179} }","mla":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” SPAA, 1997, pp. 170--179."},"language":[{"iso":"eng"}],"oa":"1","urn":"21792","date_updated":"2022-01-06T06:55:13Z","_id":"2179"},{"issue":"2","doi":"10.1016/0304-3975(96)00032-1","_id":"2182","date_updated":"2022-01-06T06:55:16Z","language":[{"iso":"eng"}],"page":"245--281","year":"1996","type":"journal_article","citation":{"mla":"Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.” Theor. Comput. Sci., no. 2, 1996, pp. 245--281, doi:10.1016/0304-3975(96)00032-1.","bibtex":"@article{Meyer auf der Heide_Scheideler_Stemann_1996, title={Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations}, DOI={10.1016/0304-3975(96)00032-1}, number={2}, journal={Theor. Comput. Sci.}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian and Stemann, Volker}, year={1996}, pages={245--281} }","apa":"Meyer auf der Heide, F., Scheideler, C., & Stemann, V. (1996). Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theor. Comput. Sci., (2), 245--281. https://doi.org/10.1016/0304-3975(96)00032-1","ama":"Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theor Comput Sci. 1996;(2):245--281. doi:10.1016/0304-3975(96)00032-1","chicago":"Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.” Theor. Comput. Sci., no. 2 (1996): 245--281. https://doi.org/10.1016/0304-3975(96)00032-1.","ieee":"F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations,” Theor. Comput. Sci., no. 2, pp. 245--281, 1996.","short":"F. Meyer auf der Heide, C. Scheideler, V. Stemann, Theor. Comput. Sci. (1996) 245--281."},"user_id":"14955","title":"Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations","date_created":"2018-04-03T09:30:20Z","status":"public","publication":"Theor. Comput. Sci.","department":[{"_id":"79"},{"_id":"63"}],"author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Stemann","full_name":"Stemann, Volker","first_name":"Volker"}]},{"ddc":["040"],"title":"Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols","user_id":"14955","date_created":"2018-04-03T09:31:52Z","has_accepted_license":"1","status":"public","file_date_updated":"2018-04-12T07:10:17Z","publication":"FOCS","department":[{"_id":"79"},{"_id":"63"}],"author":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file":[{"date_created":"2018-04-12T07:01:11Z","file_name":"FOCS96.pdf","access_level":"open_access","file_id":"2281","creator":"florida","file_size":248409,"relation":"main_file","date_updated":"2018-04-12T07:10:17Z","content_type":"application/pdf"}],"oa":"1","urn":"21832","date_updated":"2022-01-06T06:55:17Z","_id":"2183","page":"370--379","year":"1996","type":"conference","citation":{"ieee":"F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols,” in FOCS, 1996, pp. 370--379.","short":"F. Meyer auf der Heide, C. Scheideler, in: FOCS, 1996, pp. 370--379.","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” FOCS, 1996, pp. 370--379.","bibtex":"@inproceedings{Meyer auf der Heide_Scheideler_1996, title={Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols}, booktitle={FOCS}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1996}, pages={370--379} }","ama":"Meyer auf der Heide F, Scheideler C. Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In: FOCS. ; 1996:370--379.","apa":"Meyer auf der Heide, F., & Scheideler, C. (1996). Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In FOCS (pp. 370--379).","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” In FOCS, 370--379, 1996."},"language":[{"iso":"eng"}]},{"page":"16--33","year":"1996","type":"conference","citation":{"bibtex":"@inproceedings{Meyer auf der Heide_Scheideler_1996, series={Lecture Notes in Computer Science}, title={Communication in Parallel Systems}, volume={1175}, booktitle={SOFSEM}, publisher={Springer}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1996}, pages={16--33}, collection={Lecture Notes in Computer Science} }","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” SOFSEM, vol. 1175, Springer, 1996, pp. 16--33.","apa":"Meyer auf der Heide, F., & Scheideler, C. (1996). Communication in Parallel Systems. In SOFSEM (Vol. 1175, pp. 16--33). Springer.","ama":"Meyer auf der Heide F, Scheideler C. Communication in Parallel Systems. In: SOFSEM. Vol 1175. Lecture Notes in Computer Science. Springer; 1996:16--33.","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” In SOFSEM, 1175:16--33. Lecture Notes in Computer Science. Springer, 1996.","ieee":"F. Meyer auf der Heide and C. Scheideler, “Communication in Parallel Systems,” in SOFSEM, 1996, vol. 1175, pp. 16--33.","short":"F. Meyer auf der Heide, C. Scheideler, in: SOFSEM, Springer, 1996, pp. 16--33."},"urn":"21840","intvolume":" 1175","_id":"2184","publication":"SOFSEM","file_date_updated":"2018-04-12T07:10:36Z","author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publisher":"Springer","file":[{"creator":"florida","file_id":"2282","file_size":597639,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T07:10:36Z","file_name":"SOFSEM96.pdf","date_created":"2018-04-12T07:01:59Z","access_level":"open_access"}],"volume":1175,"date_created":"2018-04-03T09:32:47Z","status":"public","has_accepted_license":"1","ddc":["040"],"user_id":"14955","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:17Z","oa":"1","department":[{"_id":"79"},{"_id":"63"}],"title":"Communication in Parallel Systems"},{"date_updated":"2022-01-06T06:55:18Z","oa":"1","language":[{"iso":"eng"}],"title":"Universal Algorithms for Store-and-Forward and Wormhole Routing","department":[{"_id":"79"},{"_id":"63"}],"urn":"21868","_id":"2186","page":"356--365","year":"1996","citation":{"short":"R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöcking, in: STOC, ACM, 1996, pp. 356--365.","ieee":"R. Cypher, F. Meyer auf der Heide, C. Scheideler, and B. Vöcking, “Universal Algorithms for Store-and-Forward and Wormhole Routing,” in STOC, 1996, pp. 356--365.","apa":"Cypher, R., Meyer auf der Heide, F., Scheideler, C., & Vöcking, B. (1996). Universal Algorithms for Store-and-Forward and Wormhole Routing. In STOC (pp. 356--365). ACM.","ama":"Cypher R, Meyer auf der Heide F, Scheideler C, Vöcking B. Universal Algorithms for Store-and-Forward and Wormhole Routing. In: STOC. ACM; 1996:356--365.","chicago":"Cypher, Robert, Friedhelm Meyer auf der Heide, Christian Scheideler, and Berthold Vöcking. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” In STOC, 356--365. ACM, 1996.","mla":"Cypher, Robert, et al. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” STOC, ACM, 1996, pp. 356--365.","bibtex":"@inproceedings{Cypher_Meyer auf der Heide_Scheideler_Vöcking_1996, title={Universal Algorithms for Store-and-Forward and Wormhole Routing}, booktitle={STOC}, publisher={ACM}, author={Cypher, Robert and Meyer auf der Heide, Friedhelm and Scheideler, Christian and Vöcking, Berthold}, year={1996}, pages={356--365} }"},"type":"conference","ddc":["040"],"user_id":"14955","file_date_updated":"2018-04-12T07:11:03Z","publication":"STOC","publisher":"ACM","author":[{"last_name":"Cypher","first_name":"Robert","full_name":"Cypher, Robert"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"}],"file":[{"access_level":"open_access","date_created":"2018-04-12T06:58:59Z","file_name":"STOC96.pdf","relation":"main_file","date_updated":"2018-04-12T07:11:03Z","content_type":"application/pdf","file_id":"2280","creator":"florida","file_size":700595}],"date_created":"2018-04-03T09:39:17Z","status":"public","has_accepted_license":"1"},{"series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:18Z","oa":"1","doi":"10.1007/3-540-60313-1_154","department":[{"_id":"79"},{"_id":"63"}],"title":"Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks","citation":{"ieee":"F. Meyer auf der Heide and C. Scheideler, “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks,” in ESA, 1995, pp. 341--354.","short":"F. Meyer auf der Heide, C. Scheideler, in: ESA, 1995, pp. 341--354.","bibtex":"@inproceedings{Meyer auf der Heide_Scheideler_1995, series={Lecture Notes in Computer Science}, title={Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks}, DOI={10.1007/3-540-60313-1_154}, booktitle={ESA}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1995}, pages={341--354}, collection={Lecture Notes in Computer Science} }","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.” ESA, 1995, pp. 341--354, doi:10.1007/3-540-60313-1_154.","ama":"Meyer auf der Heide F, Scheideler C. Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. In: ESA. Lecture Notes in Computer Science. ; 1995:341--354. doi:10.1007/3-540-60313-1_154","apa":"Meyer auf der Heide, F., & Scheideler, C. (1995). Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. In ESA (pp. 341--354). https://doi.org/10.1007/3-540-60313-1_154","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.” In ESA, 341--354. Lecture Notes in Computer Science, 1995. https://doi.org/10.1007/3-540-60313-1_154."},"year":"1995","type":"conference","page":"341--354","_id":"2187","urn":"21878","file":[{"access_level":"open_access","date_created":"2018-04-12T06:57:17Z","file_name":"ESA95.pdf","content_type":"application/pdf","date_updated":"2018-04-12T07:09:35Z","relation":"main_file","file_size":177256,"creator":"florida","file_id":"2279"}],"author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file_date_updated":"2018-04-12T07:09:35Z","publication":"ESA","has_accepted_license":"1","status":"public","date_created":"2018-04-03T09:40:55Z","user_id":"14955","ddc":["040"]},{"oa":"1","_id":"2207","date_updated":"2022-01-06T06:55:24Z","urn":"22075","year":"1995","type":"conference","citation":{"bibtex":"@inproceedings{Meyer auf der Heide_Scheideler_1995, title={Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)}, booktitle={SPAA}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1995}, pages={137--146} }","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” SPAA, 1995, pp. 137--146.","apa":"Meyer auf der Heide, F., & Scheideler, C. (1995). Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). In SPAA (pp. 137--146).","ama":"Meyer auf der Heide F, Scheideler C. Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). In: SPAA. ; 1995:137--146.","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” In SPAA, 137--146, 1995.","ieee":"F. Meyer auf der Heide and C. Scheideler, “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract),” in SPAA, 1995, pp. 137--146.","short":"F. Meyer auf der Heide, C. Scheideler, in: SPAA, 1995, pp. 137--146."},"page":"137--146","language":[{"iso":"eng"}],"ddc":["040"],"title":"Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)","user_id":"14955","status":"public","has_accepted_license":"1","date_created":"2018-04-04T12:43:41Z","author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file_date_updated":"2018-04-12T07:09:52Z","department":[{"_id":"79"},{"_id":"63"}],"publication":"SPAA","file":[{"access_level":"open_access","file_name":"SPAA95.pdf","date_created":"2018-04-12T06:56:32Z","relation":"main_file","date_updated":"2018-04-12T07:09:52Z","content_type":"application/pdf","file_id":"2278","creator":"florida","file_size":284222}]},{"oa":"1","urn":"22085","_id":"2208","date_updated":"2022-01-06T06:55:24Z","page":"267--278","type":"conference","year":"1995","citation":{"short":"F. Meyer auf der Heide, C. Scheideler, V. Stemann, in: STACS, 1995, pp. 267--278.","ieee":"F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations,” in STACS, 1995, pp. 267--278.","chicago":"Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” In STACS, 267--278, 1995.","ama":"Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In: STACS. ; 1995:267--278.","apa":"Meyer auf der Heide, F., Scheideler, C., & Stemann, V. (1995). Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In STACS (pp. 267--278).","mla":"Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” STACS, 1995, pp. 267--278.","bibtex":"@inproceedings{Meyer auf der Heide_Scheideler_Stemann_1995, title={Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations}, booktitle={STACS}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian and Stemann, Volker}, year={1995}, pages={267--278} }"},"language":[{"iso":"eng"}],"title":"Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations","ddc":["040"],"user_id":"14955","date_created":"2018-04-04T12:44:26Z","status":"public","has_accepted_license":"1","department":[{"_id":"79"},{"_id":"63"}],"publication":"STACS","file_date_updated":"2018-04-12T07:09:13Z","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"},{"first_name":"Volker","full_name":"Stemann, Volker","last_name":"Stemann"}],"file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T07:09:13Z","file_id":"2277","creator":"florida","file_size":407467,"access_level":"open_access","file_name":"STACS95.pdf","date_created":"2018-04-12T06:54:40Z"}]}]