[{"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"}],"oa":"1","date_updated":"2022-01-06T06:55:02Z","date_created":"2018-04-03T06:21:11Z","has_accepted_license":"1","status":"public","file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T08:49:23Z","creator":"florida","file_id":"2300","file_size":190083,"access_level":"open_access","date_created":"2018-04-12T08:49:23Z","file_name":"STOC-00.pdf"}],"file_date_updated":"2018-04-12T08:49:23Z","publication":"STOC","publisher":"ACM","author":[{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"user_id":"14955","ddc":["040"],"page":"38--47","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.","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.","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.","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","type":"conference","urn":"21509","_id":"2150"},{"has_accepted_license":"1","status":"public","date_created":"2018-04-05T07:02:46Z","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:37:23Z","publication":"32nd ACM Symposium on Theory of Computing","department":[{"_id":"79"},{"_id":"63"}],"file":[{"file_size":190083,"creator":"florida","file_id":"2296","date_updated":"2018-04-12T08:37:23Z","content_type":"application/pdf","relation":"main_file","date_created":"2018-04-12T08:37:23Z","file_name":"STOC-00.pdf","access_level":"open_access"}],"title":"A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ","ddc":["040"],"user_id":"14955","year":"2000","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.","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.","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."},"type":"conference","page":"38-47","language":[{"iso":"eng"}],"oa":"1","_id":"2211","date_updated":"2022-01-06T06:55:26Z","urn":"22111"},{"year":"1999","citation":{"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","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","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."},"type":"journal_article","page":"387--420","language":[{"iso":"eng"}],"_id":"2151","date_updated":"2022-01-06T06:55:02Z","intvolume":" 32","doi":"10.1007/s002240000123","issue":"3","author":[{"full_name":"Flammini, Michele","first_name":"Michele","last_name":"Flammini"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"Theory Comput. Syst.","department":[{"_id":"79"},{"_id":"63"}],"volume":32,"status":"public","date_created":"2018-04-03T06:22:14Z","title":"Simple, Efficient Routing Schemes for All-Optical Networks","user_id":"14955"},{"date_created":"2018-04-03T08:56:06Z","has_accepted_license":"1","status":"public","file":[{"access_level":"open_access","file_name":"SODA-99.pdf","date_created":"2018-04-12T07:34:50Z","relation":"main_file","date_updated":"2018-04-12T07:34:50Z","content_type":"application/pdf","file_id":"2288","creator":"florida","file_size":179058}],"publication":"SODA","file_date_updated":"2018-04-12T07:34:50Z","department":[{"_id":"79"},{"_id":"63"}],"author":[{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"user_id":"14955","title":"Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths","ddc":["040"],"language":[{"iso":"eng"}],"page":"112--121","year":"1999","citation":{"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.","chicago":"Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” In SODA, 112--121, 1999.","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).","mla":"Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” SODA, 1999, pp. 112--121.","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} }"},"type":"conference","oa":"1","urn":"21649","_id":"2164","date_updated":"2022-01-06T06:55:09Z"},{"user_id":"14955","ddc":["040"],"title":"Simple Competitive Request Scheduling Strategies","file":[{"date_updated":"2018-04-12T07:36:27Z","content_type":"application/pdf","relation":"main_file","file_size":144422,"creator":"florida","file_id":"2290","access_level":"open_access","file_name":"SPAA-99.pdf","date_created":"2018-04-12T07:36:27Z"}],"author":[{"first_name":"Petra","full_name":"Berenbrink, Petra","last_name":"Berenbrink"},{"last_name":"Riedel","first_name":"Marco","full_name":"Riedel, Marco"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file_date_updated":"2018-04-12T07:36:27Z","department":[{"_id":"79"},{"_id":"63"}],"publication":"SPAA","status":"public","has_accepted_license":"1","date_created":"2018-04-03T08:56:45Z","_id":"2165","date_updated":"2022-01-06T06:55:09Z","urn":"21658","oa":"1","language":[{"iso":"eng"}],"type":"conference","citation":{"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} }","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.","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."},"year":"1999","page":"33--42"},{"urn":"22109","_id":"2210","date_updated":"2022-01-06T06:55:26Z","oa":"1","page":"2-12","year":"1999","type":"conference","citation":{"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.","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.","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.","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} }","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."},"language":[{"iso":"eng"}],"ddc":["040"],"title":"Design of the PRESTO Multimedia Storage Network (Extended Abstract)","user_id":"14955","file_date_updated":"2018-04-12T08:34:00Z","publication":"International Workshop on Communication and Data Management in Large Networks (CDMLarge)","department":[{"_id":"79"},{"_id":"63"}],"author":[{"full_name":"Berenbrink, Petra","first_name":"Petra","last_name":"Berenbrink"},{"last_name":"Riedel","full_name":"Riedel, Marco","first_name":"Marco"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"file_name":"CDMLarge-99.pdf","date_created":"2018-04-12T08:34:00Z","access_level":"open_access","file_id":"2294","creator":"florida","file_size":211926,"relation":"main_file","date_updated":"2018-04-12T08:34:00Z","content_type":"application/pdf"}],"date_created":"2018-04-05T07:00:11Z","has_accepted_license":"1","status":"public"},{"page":"215--224","type":"conference","year":"1999","citation":{"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.","chicago":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” In STOC, 215--224, 1999.","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).","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} }","mla":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” STOC, 1999, pp. 215--224."},"language":[{"iso":"eng"}],"oa":"1","urn":"21668","date_updated":"2022-01-06T06:55:10Z","_id":"2166","date_created":"2018-04-03T08:57:30Z","has_accepted_license":"1","status":"public","publication":"STOC","file_date_updated":"2018-04-12T07:35:46Z","department":[{"_id":"79"},{"_id":"63"}],"author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"}],"file":[{"date_updated":"2018-04-12T07:35:46Z","content_type":"application/pdf","relation":"main_file","file_size":227305,"file_id":"2289","creator":"florida","access_level":"open_access","file_name":"STOC-99.pdf","date_created":"2018-04-12T07:35:46Z"}],"title":"From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols","ddc":["040"],"user_id":"14955"},{"date_updated":"2022-01-06T06:55:10Z","_id":"2168","intvolume":" 31","doi":"10.1007/s002240000096","issue":"4","page":"425--449","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.","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","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} }"},"year":"1998","type":"journal_article","language":[{"iso":"eng"}],"title":"Universal Continuous Routing Strategies","user_id":"14955","publication":"Theory Comput. Syst.","department":[{"_id":"79"},{"_id":"63"}],"author":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Vöcking","full_name":"Vöcking, Berthold","first_name":"Berthold"}],"volume":31,"date_created":"2018-04-03T08:59:06Z","status":"public"},{"oa":"1","_id":"2169","date_updated":"2022-01-06T06:55:10Z","urn":"21699","citation":{"short":"M. Adler, C. Scheideler, in: SPAA, 1998, pp. 259--268.","ieee":"M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract),” in SPAA, 1998, pp. 259--268.","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.","chicago":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” In SPAA, 259--268, 1998.","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} }"},"year":"1998","type":"conference","page":"259--268","language":[{"iso":"eng"}],"ddc":["040"],"title":"Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)","user_id":"14955","status":"public","has_accepted_license":"1","date_created":"2018-04-03T08:59:55Z","author":[{"full_name":"Adler, Micah","first_name":"Micah","last_name":"Adler"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"SPAA","file_date_updated":"2018-04-12T07:08:12Z","department":[{"_id":"79"},{"_id":"63"}],"file":[{"access_level":"open_access","date_created":"2018-04-12T07:08:12Z","file_name":"SPAA98.pdf","content_type":"application/pdf","date_updated":"2018-04-12T07:08:12Z","relation":"main_file","file_size":492778,"creator":"florida","file_id":"2285"}]},{"_id":"2170","date_updated":"2022-01-06T06:55:11Z","urn":"21705","oa":"1","language":[{"iso":"eng"}],"type":"conference","citation":{"chicago":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” In STOC, 624--633, 1998.","ama":"Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). In: STOC. ; 1998:624--633.","apa":"Feige, U., & Scheideler, C. (1998). Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). In STOC (pp. 624--633).","mla":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” STOC, 1998, pp. 624--633.","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} }","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","user_id":"14955","title":"Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)","ddc":["040"],"file":[{"creator":"florida","file_id":"2286","file_size":228487,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T07:15:50Z","date_created":"2018-04-12T07:15:50Z","file_name":"STOC98.pdf","access_level":"open_access"}],"author":[{"full_name":"Feige, Uriel","first_name":"Uriel","last_name":"Feige"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file_date_updated":"2018-04-12T07:15:50Z","publication":"STOC","department":[{"_id":"79"},{"_id":"63"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T09:00:31Z"},{"ddc":["040"],"user_id":"14955","status":"public","has_accepted_license":"1","date_created":"2018-04-03T09:11:47Z","publisher":"IEEE Computer Society","author":[{"first_name":"Stefan","full_name":"Bock, Stefan","last_name":"Bock"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publication":"IPPS","file_date_updated":"2018-04-12T07:11:50Z","file":[{"access_level":"open_access","file_name":"IPPS97.pdf","date_created":"2018-04-12T07:07:20Z","relation":"main_file","date_updated":"2018-04-12T07:11:50Z","content_type":"application/pdf","creator":"florida","file_id":"2284","file_size":88749}],"_id":"2175","urn":"21759","type":"conference","citation":{"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.","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.","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.","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.","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."},"year":"1997","page":"326--332","title":"Optimal Wormhole Routing in the (n, d)-Torus","department":[{"_id":"79"},{"_id":"63"}],"oa":"1","date_updated":"2022-01-06T06:55:13Z","language":[{"iso":"eng"}]},{"status":"public","has_accepted_license":"1","date_created":"2018-04-03T09:17:10Z","author":[{"last_name":"Flammini","first_name":"Michele","full_name":"Flammini, Michele"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"SPAA","file_date_updated":"2018-04-12T07:11:32Z","file":[{"content_type":"application/pdf","date_updated":"2018-04-12T07:11:32Z","relation":"main_file","file_size":365709,"creator":"florida","file_id":"2283","access_level":"open_access","date_created":"2018-04-12T07:06:34Z","file_name":"SPAA97.pdf"}],"title":"Simple, Efficient Routing Schemes for All-Optical Networks","ddc":["040"],"user_id":"14955","year":"1997","type":"conference","citation":{"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.","chicago":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” In SPAA, 170--179, 1997.","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.","ieee":"M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” in SPAA, 1997, pp. 170--179.","short":"M. Flammini, C. Scheideler, in: SPAA, 1997, pp. 170--179."},"page":"170--179","language":[{"iso":"eng"}],"oa":"1","_id":"2179","date_updated":"2022-01-06T06:55:13Z","urn":"21792"},{"date_created":"2018-04-03T09:30:20Z","status":"public","department":[{"_id":"79"},{"_id":"63"}],"publication":"Theor. Comput. Sci.","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"first_name":"Volker","full_name":"Stemann, Volker","last_name":"Stemann"}],"user_id":"14955","title":"Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations","language":[{"iso":"eng"}],"page":"245--281","type":"journal_article","year":"1996","citation":{"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.","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} }","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.","short":"F. Meyer auf der Heide, C. Scheideler, V. Stemann, Theor. Comput. Sci. (1996) 245--281.","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."},"issue":"2","doi":"10.1016/0304-3975(96)00032-1","_id":"2182","date_updated":"2022-01-06T06:55:16Z"},{"file":[{"creator":"florida","file_id":"2281","file_size":248409,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T07:10:17Z","date_created":"2018-04-12T07:01:11Z","file_name":"FOCS96.pdf","access_level":"open_access"}],"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"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"FOCS","file_date_updated":"2018-04-12T07:10:17Z","has_accepted_license":"1","status":"public","date_created":"2018-04-03T09:31:52Z","user_id":"14955","ddc":["040"],"title":"Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols","language":[{"iso":"eng"}],"citation":{"chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” In FOCS, 370--379, 1996.","apa":"Meyer auf der Heide, F., & Scheideler, C. (1996). Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In FOCS (pp. 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.","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} }","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” FOCS, 1996, pp. 370--379.","short":"F. Meyer auf der Heide, C. Scheideler, in: FOCS, 1996, pp. 370--379.","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."},"type":"conference","year":"1996","page":"370--379","date_updated":"2022-01-06T06:55:17Z","_id":"2183","urn":"21832","oa":"1"},{"date_updated":"2022-01-06T06:55:17Z","oa":"1","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"title":"Communication in Parallel Systems","department":[{"_id":"79"},{"_id":"63"}],"intvolume":" 1175","_id":"2184","urn":"21840","year":"1996","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."},"type":"conference","page":"16--33","ddc":["040"],"user_id":"14955","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"}],"publisher":"Springer","file_date_updated":"2018-04-12T07:10:36Z","publication":"SOFSEM","file":[{"date_created":"2018-04-12T07:01:59Z","file_name":"SOFSEM96.pdf","access_level":"open_access","file_size":597639,"file_id":"2282","creator":"florida","content_type":"application/pdf","date_updated":"2018-04-12T07:10:36Z","relation":"main_file"}],"volume":1175,"has_accepted_license":"1","status":"public","date_created":"2018-04-03T09:32:47Z"},{"ddc":["040"],"user_id":"14955","date_created":"2018-04-03T09:39:17Z","has_accepted_license":"1","status":"public","publication":"STOC","file_date_updated":"2018-04-12T07:11:03Z","author":[{"full_name":"Cypher, Robert","first_name":"Robert","last_name":"Cypher"},{"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"},{"first_name":"Berthold","full_name":"Vöcking, Berthold","last_name":"Vöcking"}],"publisher":"ACM","file":[{"file_name":"STOC96.pdf","date_created":"2018-04-12T06:58:59Z","access_level":"open_access","file_size":700595,"creator":"florida","file_id":"2280","date_updated":"2018-04-12T07:11:03Z","content_type":"application/pdf","relation":"main_file"}],"urn":"21868","_id":"2186","page":"356--365","year":"1996","type":"conference","citation":{"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.","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.","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} }","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."},"title":"Universal Algorithms for Store-and-Forward and Wormhole Routing","department":[{"_id":"79"},{"_id":"63"}],"oa":"1","date_updated":"2022-01-06T06:55:18Z","language":[{"iso":"eng"}]},{"ddc":["040"],"user_id":"14955","status":"public","has_accepted_license":"1","date_created":"2018-04-03T09:40:55Z","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"}],"file_date_updated":"2018-04-12T07:09:35Z","publication":"ESA","file":[{"access_level":"open_access","file_name":"ESA95.pdf","date_created":"2018-04-12T06:57:17Z","relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T07:09:35Z","file_id":"2279","creator":"florida","file_size":177256}],"_id":"2187","urn":"21878","type":"conference","year":"1995","citation":{"short":"F. Meyer auf der Heide, C. Scheideler, in: ESA, 1995, pp. 341--354.","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.","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.","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."},"page":"341--354","title":"Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks","department":[{"_id":"79"},{"_id":"63"}],"doi":"10.1007/3-540-60313-1_154","oa":"1","date_updated":"2022-01-06T06:55:18Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science"},{"file":[{"date_updated":"2018-04-12T07:09:52Z","content_type":"application/pdf","relation":"main_file","file_size":284222,"file_id":"2278","creator":"florida","access_level":"open_access","date_created":"2018-04-12T06:56:32Z","file_name":"SPAA95.pdf"}],"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"}],"file_date_updated":"2018-04-12T07:09:52Z","department":[{"_id":"79"},{"_id":"63"}],"publication":"SPAA","has_accepted_license":"1","status":"public","date_created":"2018-04-04T12:43:41Z","user_id":"14955","title":"Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)","ddc":["040"],"language":[{"iso":"eng"}],"citation":{"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.","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.","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” In SPAA, 137--146, 1995.","ama":"Meyer auf der Heide F, Scheideler C. Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). In: SPAA. ; 1995: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)."},"year":"1995","type":"conference","page":"137--146","date_updated":"2022-01-06T06:55:24Z","_id":"2207","urn":"22075","oa":"1"},{"language":[{"iso":"eng"}],"page":"267--278","citation":{"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} }","mla":"Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” STACS, 1995, pp. 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).","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.","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.","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.","short":"F. Meyer auf der Heide, C. Scheideler, V. Stemann, in: STACS, 1995, pp. 267--278."},"type":"conference","year":"1995","oa":"1","urn":"22085","_id":"2208","date_updated":"2022-01-06T06:55:24Z","date_created":"2018-04-04T12:44:26Z","has_accepted_license":"1","status":"public","file":[{"access_level":"open_access","date_created":"2018-04-12T06:54:40Z","file_name":"STACS95.pdf","date_updated":"2018-04-12T07:09:13Z","content_type":"application/pdf","relation":"main_file","file_size":407467,"file_id":"2277","creator":"florida"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"STACS","file_date_updated":"2018-04-12T07:09:13Z","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"},{"last_name":"Stemann","first_name":"Volker","full_name":"Stemann, Volker"}],"user_id":"14955","ddc":["040"],"title":"Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations"}]