[{"has_accepted_license":"1","date_updated":"2022-01-06T06:55:09Z","author":[{"last_name":"Berenbrink","first_name":"Petra","full_name":"Berenbrink, Petra"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"title":"Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths","status":"public","year":"1999","user_id":"14955","ddc":["040"],"urn":"21649","_id":"2164","language":[{"iso":"eng"}],"page":"112--121","citation":{"ieee":"P. Berenbrink and C. Scheideler, “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths,” in <i>SODA</i>, 1999, pp. 112--121.","apa":"Berenbrink, P., &#38; Scheideler, C. (1999). Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In <i>SODA</i> (pp. 112--121).","chicago":"Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” In <i>SODA</i>, 112--121, 1999.","short":"P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121.","mla":"Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” <i>SODA</i>, 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} }","ama":"Berenbrink P, Scheideler C. Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In: <i>SODA</i>. ; 1999:112--121."},"file_date_updated":"2018-04-12T07:34:50Z","publication":"SODA","department":[{"_id":"79"},{"_id":"63"}],"oa":"1","type":"conference","date_created":"2018-04-03T08:56:06Z","file":[{"file_id":"2288","content_type":"application/pdf","relation":"main_file","date_updated":"2018-04-12T07:34:50Z","file_name":"SODA-99.pdf","file_size":179058,"access_level":"open_access","date_created":"2018-04-12T07:34:50Z","creator":"florida"}]},{"citation":{"mla":"Berenbrink, Petra, et al. “Simple Competitive Request Scheduling Strategies.” <i>SPAA</i>, 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} }","ama":"Berenbrink P, Riedel M, Scheideler C. Simple Competitive Request Scheduling Strategies. In: <i>SPAA</i>. ; 1999:33--42.","ieee":"P. Berenbrink, M. Riedel, and C. Scheideler, “Simple Competitive Request Scheduling Strategies,” in <i>SPAA</i>, 1999, pp. 33--42.","apa":"Berenbrink, P., Riedel, M., &#38; Scheideler, C. (1999). Simple Competitive Request Scheduling Strategies. In <i>SPAA</i> (pp. 33--42).","short":"P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.","chicago":"Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Simple Competitive Request Scheduling Strategies.” In <i>SPAA</i>, 33--42, 1999."},"publication":"SPAA","file_date_updated":"2018-04-12T07:36:27Z","date_created":"2018-04-03T08:56:45Z","file":[{"file_name":"SPAA-99.pdf","file_size":144422,"access_level":"open_access","relation":"main_file","date_updated":"2018-04-12T07:36:27Z","file_id":"2290","content_type":"application/pdf","creator":"florida","date_created":"2018-04-12T07:36:27Z"}],"oa":"1","department":[{"_id":"79"},{"_id":"63"}],"type":"conference","author":[{"first_name":"Petra","last_name":"Berenbrink","full_name":"Berenbrink, Petra"},{"last_name":"Riedel","first_name":"Marco","full_name":"Riedel, Marco"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"year":"1999","title":"Simple Competitive Request Scheduling Strategies","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:55:09Z","urn":"21658","_id":"2165","language":[{"iso":"eng"}],"page":"33--42","ddc":["040"],"user_id":"14955"},{"author":[{"last_name":"Berenbrink","first_name":"Petra","full_name":"Berenbrink, Petra"},{"full_name":"Riedel, Marco","last_name":"Riedel","first_name":"Marco"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"year":"1999","title":"Design of the PRESTO Multimedia Storage Network (Extended Abstract)","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:55:26Z","_id":"2210","urn":"22109","language":[{"iso":"eng"}],"page":"2-12","user_id":"14955","ddc":["040"],"citation":{"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} }","ama":"Berenbrink P, Riedel M, Scheideler C. Design of the PRESTO Multimedia Storage Network (Extended Abstract). In: <i>International Workshop on Communication and Data Management in Large Networks (CDMLarge)</i>. ; 1999:2-12.","mla":"Berenbrink, Petra, et al. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” <i>International Workshop on Communication and Data Management in Large Networks (CDMLarge)</i>, 1999, pp. 2–12.","short":"P. Berenbrink, M. Riedel, C. Scheideler, in: International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.","chicago":"Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” In <i>International Workshop on Communication and Data Management in Large Networks (CDMLarge)</i>, 2–12, 1999.","ieee":"P. Berenbrink, M. Riedel, and C. Scheideler, “Design of the PRESTO Multimedia Storage Network (Extended Abstract),” in <i>International Workshop on Communication and Data Management in Large Networks (CDMLarge)</i>, 1999, pp. 2–12.","apa":"Berenbrink, P., Riedel, M., &#38; Scheideler, C. (1999). Design of the PRESTO Multimedia Storage Network (Extended Abstract). In <i>International Workshop on Communication and Data Management in Large Networks (CDMLarge)</i> (pp. 2–12)."},"file_date_updated":"2018-04-12T08:34:00Z","publication":"International Workshop on Communication and Data Management in Large Networks (CDMLarge)","date_created":"2018-04-05T07:00:11Z","file":[{"access_level":"open_access","file_size":211926,"file_name":"CDMLarge-99.pdf","date_updated":"2018-04-12T08:34:00Z","relation":"main_file","content_type":"application/pdf","file_id":"2294","creator":"florida","date_created":"2018-04-12T08:34:00Z"}],"department":[{"_id":"79"},{"_id":"63"}],"oa":"1","type":"conference"},{"page":"215--224","language":[{"iso":"eng"}],"_id":"2166","urn":"21668","ddc":["040"],"user_id":"14955","status":"public","title":"From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols","year":"1999","author":[{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"}],"date_updated":"2022-01-06T06:55:10Z","has_accepted_license":"1","file":[{"file_size":227305,"access_level":"open_access","file_name":"STOC-99.pdf","date_updated":"2018-04-12T07:35:46Z","relation":"main_file","content_type":"application/pdf","file_id":"2289","creator":"florida","date_created":"2018-04-12T07:35:46Z"}],"date_created":"2018-04-03T08:57:30Z","type":"conference","oa":"1","department":[{"_id":"79"},{"_id":"63"}],"publication":"STOC","file_date_updated":"2018-04-12T07:35:46Z","citation":{"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: <i>STOC</i>. ; 1999:215--224.","mla":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” <i>STOC</i>, 1999, pp. 215--224.","chicago":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” In <i>STOC</i>, 215--224, 1999.","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 <i>STOC</i>, 1999, pp. 215--224.","apa":"Scheideler, C., &#38; Vöcking, B. (1999). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. In <i>STOC</i> (pp. 215--224)."}},{"citation":{"chicago":"Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.” <i>Theory Comput. Syst.</i> 31, no. 4 (1998): 425--449. <a href=\"https://doi.org/10.1007/s002240000096\">https://doi.org/10.1007/s002240000096</a>.","ama":"Scheideler C, Vöcking B. Universal Continuous Routing Strategies. <i>Theory Comput Syst</i>. 1998;31(4):425--449. doi:<a href=\"https://doi.org/10.1007/s002240000096\">10.1007/s002240000096</a>","short":"C. Scheideler, B. Vöcking, Theory Comput. Syst. 31 (1998) 425--449.","bibtex":"@article{Scheideler_Vöcking_1998, title={Universal Continuous Routing Strategies}, volume={31}, DOI={<a href=\"https://doi.org/10.1007/s002240000096\">10.1007/s002240000096</a>}, 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.” <i>Theory Comput. Syst.</i>, vol. 31, no. 4, 1998, pp. 425--449, doi:<a href=\"https://doi.org/10.1007/s002240000096\">10.1007/s002240000096</a>.","apa":"Scheideler, C., &#38; Vöcking, B. (1998). Universal Continuous Routing Strategies. <i>Theory Comput. Syst.</i>, <i>31</i>(4), 425--449. <a href=\"https://doi.org/10.1007/s002240000096\">https://doi.org/10.1007/s002240000096</a>","ieee":"C. Scheideler and B. Vöcking, “Universal Continuous Routing Strategies,” <i>Theory Comput. Syst.</i>, vol. 31, no. 4, pp. 425--449, 1998."},"issue":"4","publication":"Theory Comput. Syst.","date_created":"2018-04-03T08:59:06Z","department":[{"_id":"79"},{"_id":"63"}],"type":"journal_article","author":[{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"full_name":"Vöcking, Berthold","last_name":"Vöcking","first_name":"Berthold"}],"year":"1998","title":"Universal Continuous Routing Strategies","status":"public","intvolume":"        31","date_updated":"2022-01-06T06:55:10Z","language":[{"iso":"eng"}],"_id":"2168","page":"425--449","volume":31,"doi":"10.1007/s002240000096","user_id":"14955"},{"status":"public","title":"Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)","year":"1998","author":[{"first_name":"Micah","last_name":"Adler","full_name":"Adler, Micah"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"date_updated":"2022-01-06T06:55:10Z","has_accepted_license":"1","page":"259--268","urn":"21699","_id":"2169","language":[{"iso":"eng"}],"ddc":["040"],"user_id":"14955","publication":"SPAA","file_date_updated":"2018-04-12T07:08:12Z","citation":{"mla":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” <i>SPAA</i>, 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: <i>SPAA</i>. ; 1998:259--268.","ieee":"M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract),” in <i>SPAA</i>, 1998, pp. 259--268.","apa":"Adler, M., &#38; Scheideler, C. (1998). Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). In <i>SPAA</i> (pp. 259--268).","chicago":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” In <i>SPAA</i>, 259--268, 1998.","short":"M. Adler, C. Scheideler, in: SPAA, 1998, pp. 259--268."},"file":[{"date_created":"2018-04-12T07:08:12Z","creator":"florida","file_id":"2285","content_type":"application/pdf","relation":"main_file","date_updated":"2018-04-12T07:08:12Z","file_name":"SPAA98.pdf","access_level":"open_access","file_size":492778}],"date_created":"2018-04-03T08:59:55Z","type":"conference","oa":"1","department":[{"_id":"79"},{"_id":"63"}]},{"has_accepted_license":"1","date_updated":"2022-01-06T06:55:11Z","author":[{"full_name":"Feige, Uriel","last_name":"Feige","first_name":"Uriel"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"year":"1998","title":"Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)","status":"public","user_id":"14955","ddc":["040"],"urn":"21705","_id":"2170","language":[{"iso":"eng"}],"page":"624--633","citation":{"mla":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” <i>STOC</i>, 1998, pp. 624--633.","ama":"Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). In: <i>STOC</i>. ; 1998: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} }","apa":"Feige, U., &#38; Scheideler, C. (1998). Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). In <i>STOC</i> (pp. 624--633).","ieee":"U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract),” in <i>STOC</i>, 1998, pp. 624--633.","chicago":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” In <i>STOC</i>, 624--633, 1998.","short":"U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633."},"file_date_updated":"2018-04-12T07:15:50Z","publication":"STOC","department":[{"_id":"79"},{"_id":"63"}],"oa":"1","type":"conference","date_created":"2018-04-03T09:00:31Z","file":[{"content_type":"application/pdf","file_id":"2286","access_level":"open_access","file_size":228487,"file_name":"STOC98.pdf","date_updated":"2018-04-12T07:15:50Z","relation":"main_file","date_created":"2018-04-12T07:15:50Z","creator":"florida"}]},{"date_updated":"2022-01-06T06:55:17Z","intvolume":"      1390","title":"Universal Routing Strategies for Interconnection Networks","status":"public","year":"1998","publication_identifier":{"isbn":["978-3-540-69792-3"]},"author":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"doi":"10.1007/BFb0052928","user_id":"14955","volume":1390,"_id":"2185","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"citation":{"short":"C. Scheideler, Universal Routing Strategies for Interconnection Networks, 1998.","chicago":"Scheideler, Christian. <i>Universal Routing Strategies for Interconnection Networks</i>. Vol. 1390. Lecture Notes in Computer Science, 1998. <a href=\"https://doi.org/10.1007/BFb0052928\">https://doi.org/10.1007/BFb0052928</a>.","apa":"Scheideler, C. (1998). <i>Universal Routing Strategies for Interconnection Networks</i> (Vol. 1390). <a href=\"https://doi.org/10.1007/BFb0052928\">https://doi.org/10.1007/BFb0052928</a>","ieee":"C. Scheideler, <i>Universal Routing Strategies for Interconnection Networks</i>, vol. 1390. 1998.","ama":"Scheideler C. <i>Universal Routing Strategies for Interconnection Networks</i>. Vol 1390.; 1998. doi:<a href=\"https://doi.org/10.1007/BFb0052928\">10.1007/BFb0052928</a>","bibtex":"@book{Scheideler_1998, series={Lecture Notes in Computer Science}, title={Universal Routing Strategies for Interconnection Networks}, volume={1390}, DOI={<a href=\"https://doi.org/10.1007/BFb0052928\">10.1007/BFb0052928</a>}, author={Scheideler, Christian}, year={1998}, collection={Lecture Notes in Computer Science} }","mla":"Scheideler, Christian. <i>Universal Routing Strategies for Interconnection Networks</i>. Vol. 1390, 1998, doi:<a href=\"https://doi.org/10.1007/BFb0052928\">10.1007/BFb0052928</a>."},"type":"book","department":[{"_id":"79"},{"_id":"63"}],"date_created":"2018-04-03T09:38:18Z"},{"oa":"1","file_date_updated":"2018-04-12T07:11:50Z","citation":{"mla":"Bock, Stefan, et al. “Optimal Wormhole Routing in the (n, d)-Torus.” <i>IPPS</i>, IEEE Computer Society, 1997, pp. 326--332.","ama":"Bock S, Meyer auf der Heide F, Scheideler C. Optimal Wormhole Routing in the (n, d)-Torus. In: <i>IPPS</i>. IEEE Computer Society; 1997:326--332.","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} }","apa":"Bock, S., Meyer auf der Heide, F., &#38; Scheideler, C. (1997). Optimal Wormhole Routing in the (n, d)-Torus. In <i>IPPS</i> (pp. 326--332). IEEE Computer Society.","ieee":"S. Bock, F. Meyer auf der Heide, and C. Scheideler, “Optimal Wormhole Routing in the (n, d)-Torus,” in <i>IPPS</i>, 1997, pp. 326--332.","short":"S. Bock, F. Meyer auf der Heide, C. Scheideler, in: IPPS, IEEE Computer Society, 1997, pp. 326--332.","chicago":"Bock, Stefan, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Optimal Wormhole Routing in the (n, d)-Torus.” In <i>IPPS</i>, 326--332. IEEE Computer Society, 1997."},"user_id":"14955","ddc":["040"],"page":"326--332","publisher":"IEEE Computer Society","_id":"2175","urn":"21759","has_accepted_license":"1","status":"public","type":"conference","department":[{"_id":"79"},{"_id":"63"}],"file":[{"creator":"florida","date_created":"2018-04-12T07:07:20Z","date_updated":"2018-04-12T07:11:50Z","relation":"main_file","file_size":88749,"access_level":"open_access","file_name":"IPPS97.pdf","content_type":"application/pdf","file_id":"2284"}],"date_created":"2018-04-03T09:11:47Z","publication":"IPPS","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:13Z","title":"Optimal Wormhole Routing in the (n, d)-Torus","year":"1997","author":[{"last_name":"Bock","first_name":"Stefan","full_name":"Bock, Stefan"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}]},{"citation":{"apa":"Flammini, M., &#38; Scheideler, C. (1997). Simple, Efficient Routing Schemes for All-Optical Networks. In <i>SPAA</i> (pp. 170--179).","ieee":"M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” in <i>SPAA</i>, 1997, pp. 170--179.","short":"M. Flammini, C. Scheideler, in: SPAA, 1997, pp. 170--179.","chicago":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” In <i>SPAA</i>, 170--179, 1997.","mla":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” <i>SPAA</i>, 1997, pp. 170--179.","ama":"Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical Networks. In: <i>SPAA</i>. ; 1997:170--179.","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} }"},"publication":"SPAA","file_date_updated":"2018-04-12T07:11:32Z","date_created":"2018-04-03T09:17:10Z","file":[{"file_size":365709,"access_level":"open_access","file_name":"SPAA97.pdf","date_updated":"2018-04-12T07:11:32Z","relation":"main_file","content_type":"application/pdf","file_id":"2283","creator":"florida","date_created":"2018-04-12T07:06:34Z"}],"oa":"1","department":[{"_id":"79"},{"_id":"63"}],"type":"conference","author":[{"last_name":"Flammini","first_name":"Michele","full_name":"Flammini, Michele"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"year":"1997","status":"public","title":"Simple, Efficient Routing Schemes for All-Optical Networks","has_accepted_license":"1","date_updated":"2022-01-06T06:55:13Z","_id":"2179","language":[{"iso":"eng"}],"urn":"21792","page":"170--179","ddc":["040"],"user_id":"14955"},{"date_created":"2018-04-03T09:29:45Z","department":[{"_id":"79"},{"_id":"63"}],"type":"dissertation","citation":{"mla":"Scheideler, Christian. <i>Universal Routing Strategies</i>. University of Paderborn, Germany, 1996.","bibtex":"@book{Scheideler_1996, title={Universal routing strategies}, publisher={University of Paderborn, Germany}, author={Scheideler, Christian}, year={1996} }","ama":"Scheideler C. <i>Universal Routing Strategies</i>. University of Paderborn, Germany; 1996.","ieee":"C. Scheideler, <i>Universal routing strategies</i>. University of Paderborn, Germany, 1996.","apa":"Scheideler, C. (1996). <i>Universal routing strategies</i>. University of Paderborn, Germany.","chicago":"Scheideler, Christian. <i>Universal Routing Strategies</i>. University of Paderborn, Germany, 1996.","short":"C. Scheideler, Universal Routing Strategies, University of Paderborn, Germany, 1996."},"publisher":"University of Paderborn, Germany","_id":"2181","language":[{"iso":"eng"}],"user_id":"14955","author":[{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"status":"public","title":"Universal routing strategies","year":"1996","date_updated":"2022-01-06T06:55:15Z"},{"date_created":"2018-04-03T09:30:20Z","type":"journal_article","department":[{"_id":"79"},{"_id":"63"}],"publication":"Theor. Comput. Sci.","issue":"2","citation":{"mla":"Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.” <i>Theor. Comput. Sci.</i>, no. 2, 1996, pp. 245--281, doi:<a href=\"https://doi.org/10.1016/0304-3975(96)00032-1\">10.1016/0304-3975(96)00032-1</a>.","bibtex":"@article{Meyer auf der Heide_Scheideler_Stemann_1996, title={Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations}, DOI={<a href=\"https://doi.org/10.1016/0304-3975(96)00032-1\">10.1016/0304-3975(96)00032-1</a>}, number={2}, journal={Theor. Comput. Sci.}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian and Stemann, Volker}, year={1996}, pages={245--281} }","ama":"Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. <i>Theor Comput Sci</i>. 1996;(2):245--281. doi:<a href=\"https://doi.org/10.1016/0304-3975(96)00032-1\">10.1016/0304-3975(96)00032-1</a>","ieee":"F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations,” <i>Theor. Comput. Sci.</i>, no. 2, pp. 245--281, 1996.","apa":"Meyer auf der Heide, F., Scheideler, C., &#38; Stemann, V. (1996). Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. <i>Theor. Comput. Sci.</i>, (2), 245--281. <a href=\"https://doi.org/10.1016/0304-3975(96)00032-1\">https://doi.org/10.1016/0304-3975(96)00032-1</a>","chicago":"Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.” <i>Theor. Comput. Sci.</i>, no. 2 (1996): 245--281. <a href=\"https://doi.org/10.1016/0304-3975(96)00032-1\">https://doi.org/10.1016/0304-3975(96)00032-1</a>.","short":"F. Meyer auf der Heide, C. Scheideler, V. Stemann, Theor. Comput. Sci. (1996) 245--281."},"page":"245--281","language":[{"iso":"eng"}],"_id":"2182","doi":"10.1016/0304-3975(96)00032-1","user_id":"14955","status":"public","year":"1996","title":"Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations","author":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"},{"last_name":"Stemann","first_name":"Volker","full_name":"Stemann, Volker"}],"date_updated":"2022-01-06T06:55:16Z"},{"author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"year":"1996","title":"Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:55:17Z","_id":"2183","urn":"21832","language":[{"iso":"eng"}],"page":"370--379","user_id":"14955","ddc":["040"],"citation":{"chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” In <i>FOCS</i>, 370--379, 1996.","ama":"Meyer auf der Heide F, Scheideler C. Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In: <i>FOCS</i>. ; 1996:370--379.","short":"F. Meyer auf der Heide, C. Scheideler, in: 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} }","apa":"Meyer auf der Heide, F., &#38; Scheideler, C. (1996). Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In <i>FOCS</i> (pp. 370--379).","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” <i>FOCS</i>, 1996, pp. 370--379.","ieee":"F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols,” in <i>FOCS</i>, 1996, pp. 370--379."},"file_date_updated":"2018-04-12T07:10:17Z","publication":"FOCS","date_created":"2018-04-03T09:31:52Z","file":[{"date_updated":"2018-04-12T07:10:17Z","relation":"main_file","file_size":248409,"access_level":"open_access","file_name":"FOCS96.pdf","content_type":"application/pdf","file_id":"2281","creator":"florida","date_created":"2018-04-12T07:01:11Z"}],"department":[{"_id":"79"},{"_id":"63"}],"oa":"1","type":"conference"},{"series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:17Z","intvolume":"      1175","title":"Communication in Parallel Systems","year":"1996","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"type":"conference","department":[{"_id":"79"},{"_id":"63"}],"file":[{"date_created":"2018-04-12T07:01:59Z","creator":"florida","file_id":"2282","content_type":"application/pdf","relation":"main_file","date_updated":"2018-04-12T07:10:36Z","file_name":"SOFSEM96.pdf","file_size":597639,"access_level":"open_access"}],"date_created":"2018-04-03T09:32:47Z","publication":"SOFSEM","ddc":["040"],"user_id":"14955","volume":1175,"page":"16--33","publisher":"Springer","_id":"2184","urn":"21840","has_accepted_license":"1","status":"public","oa":"1","file_date_updated":"2018-04-12T07:10:36Z","citation":{"short":"F. Meyer auf der Heide, C. Scheideler, in: SOFSEM, Springer, 1996, pp. 16--33.","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” In <i>SOFSEM</i>, 1175:16--33. Lecture Notes in Computer Science. Springer, 1996.","ieee":"F. Meyer auf der Heide and C. Scheideler, “Communication in Parallel Systems,” in <i>SOFSEM</i>, 1996, vol. 1175, pp. 16--33.","apa":"Meyer auf der Heide, F., &#38; Scheideler, C. (1996). Communication in Parallel Systems. In <i>SOFSEM</i> (Vol. 1175, pp. 16--33). Springer.","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} }","ama":"Meyer auf der Heide F, Scheideler C. Communication in Parallel Systems. In: <i>SOFSEM</i>. Vol 1175. Lecture Notes in Computer Science. Springer; 1996:16--33.","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” <i>SOFSEM</i>, vol. 1175, Springer, 1996, pp. 16--33."}},{"publication":"STOC","department":[{"_id":"79"},{"_id":"63"}],"type":"conference","date_created":"2018-04-03T09:39:17Z","file":[{"creator":"florida","date_created":"2018-04-12T06:58:59Z","file_name":"STOC96.pdf","access_level":"open_access","file_size":700595,"relation":"main_file","date_updated":"2018-04-12T07:11:03Z","file_id":"2280","content_type":"application/pdf"}],"date_updated":"2022-01-06T06:55:18Z","author":[{"first_name":"Robert","last_name":"Cypher","full_name":"Cypher, Robert"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"},{"first_name":"Berthold","last_name":"Vöcking","full_name":"Vöcking, Berthold"}],"title":"Universal Algorithms for Store-and-Forward and Wormhole Routing","year":"1996","language":[{"iso":"eng"}],"citation":{"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} }","ama":"Cypher R, Meyer auf der Heide F, Scheideler C, Vöcking B. Universal Algorithms for Store-and-Forward and Wormhole Routing. In: <i>STOC</i>. ACM; 1996:356--365.","mla":"Cypher, Robert, et al. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” <i>STOC</i>, ACM, 1996, pp. 356--365.","short":"R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöcking, in: STOC, ACM, 1996, pp. 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 <i>STOC</i>, 356--365. ACM, 1996.","ieee":"R. Cypher, F. Meyer auf der Heide, C. Scheideler, and B. Vöcking, “Universal Algorithms for Store-and-Forward and Wormhole Routing,” in <i>STOC</i>, 1996, pp. 356--365.","apa":"Cypher, R., Meyer auf der Heide, F., Scheideler, C., &#38; Vöcking, B. (1996). Universal Algorithms for Store-and-Forward and Wormhole Routing. In <i>STOC</i> (pp. 356--365). ACM."},"file_date_updated":"2018-04-12T07:11:03Z","oa":"1","has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"14955","_id":"2186","publisher":"ACM","urn":"21868","page":"356--365"},{"date_updated":"2022-01-06T06:55:18Z","author":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"year":"1995","title":"Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks","doi":"10.1007/3-540-60313-1_154","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"publication":"ESA","department":[{"_id":"79"},{"_id":"63"}],"type":"conference","date_created":"2018-04-03T09:40:55Z","file":[{"creator":"florida","date_created":"2018-04-12T06:57:17Z","file_name":"ESA95.pdf","file_size":177256,"access_level":"open_access","relation":"main_file","date_updated":"2018-04-12T07:09:35Z","file_id":"2279","content_type":"application/pdf"}],"has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"14955","_id":"2187","urn":"21878","page":"341--354","citation":{"short":"F. Meyer auf der Heide, C. Scheideler, in: ESA, 1995, pp. 341--354.","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.” In <i>ESA</i>, 341--354. Lecture Notes in Computer Science, 1995. <a href=\"https://doi.org/10.1007/3-540-60313-1_154\">https://doi.org/10.1007/3-540-60313-1_154</a>.","apa":"Meyer auf der Heide, F., &#38; Scheideler, C. (1995). Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. In <i>ESA</i> (pp. 341--354). <a href=\"https://doi.org/10.1007/3-540-60313-1_154\">https://doi.org/10.1007/3-540-60313-1_154</a>","ieee":"F. Meyer auf der Heide and C. Scheideler, “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks,” in <i>ESA</i>, 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: <i>ESA</i>. Lecture Notes in Computer Science. ; 1995:341--354. doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_154\">10.1007/3-540-60313-1_154</a>","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={<a href=\"https://doi.org/10.1007/3-540-60313-1_154\">10.1007/3-540-60313-1_154</a>}, 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.” <i>ESA</i>, 1995, pp. 341--354, doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_154\">10.1007/3-540-60313-1_154</a>."},"file_date_updated":"2018-04-12T07:09:35Z","oa":"1"},{"type":"conference","oa":"1","department":[{"_id":"79"},{"_id":"63"}],"file":[{"date_created":"2018-04-12T06:56:32Z","creator":"florida","content_type":"application/pdf","file_id":"2278","date_updated":"2018-04-12T07:09:52Z","relation":"main_file","file_size":284222,"access_level":"open_access","file_name":"SPAA95.pdf"}],"date_created":"2018-04-04T12:43:41Z","publication":"SPAA","file_date_updated":"2018-04-12T07:09:52Z","citation":{"ieee":"F. Meyer auf der Heide and C. Scheideler, “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract),” in <i>SPAA</i>, 1995, pp. 137--146.","apa":"Meyer auf der Heide, F., &#38; Scheideler, C. (1995). Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). In <i>SPAA</i> (pp. 137--146).","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” In <i>SPAA</i>, 137--146, 1995.","short":"F. Meyer auf der Heide, C. Scheideler, in: SPAA, 1995, pp. 137--146.","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” <i>SPAA</i>, 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} }","ama":"Meyer auf der Heide F, Scheideler C. Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). In: <i>SPAA</i>. ; 1995:137--146."},"ddc":["040"],"user_id":"14955","page":"137--146","language":[{"iso":"eng"}],"_id":"2207","urn":"22075","date_updated":"2022-01-06T06:55:24Z","has_accepted_license":"1","year":"1995","status":"public","title":"Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}]},{"type":"conference","oa":"1","department":[{"_id":"79"},{"_id":"63"}],"file":[{"creator":"florida","date_created":"2018-04-12T06:54:40Z","date_updated":"2018-04-12T07:09:13Z","relation":"main_file","access_level":"open_access","file_size":407467,"file_name":"STACS95.pdf","content_type":"application/pdf","file_id":"2277"}],"date_created":"2018-04-04T12:44:26Z","publication":"STACS","file_date_updated":"2018-04-12T07:09:13Z","citation":{"mla":"Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” <i>STACS</i>, 1995, pp. 267--278.","ama":"Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In: <i>STACS</i>. ; 1995: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} }","apa":"Meyer auf der Heide, F., Scheideler, C., &#38; Stemann, V. (1995). Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In <i>STACS</i> (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 <i>STACS</i>, 1995, pp. 267--278.","short":"F. Meyer auf der Heide, C. Scheideler, V. Stemann, 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 <i>STACS</i>, 267--278, 1995."},"ddc":["040"],"user_id":"14955","page":"267--278","urn":"22085","_id":"2208","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:24Z","has_accepted_license":"1","status":"public","title":"Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations","year":"1995","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"},{"last_name":"Stemann","first_name":"Volker","full_name":"Stemann, Volker"}]},{"user_id":"90","_id":"21607","language":[{"iso":"eng"}],"page":"57","date_updated":"2022-01-06T06:55:07Z","author":[{"first_name":"J","last_name":"Raggam","full_name":"Raggam, J"},{"full_name":"Triebnig, Gerhard","last_name":"Triebnig","first_name":"Gerhard"},{"first_name":"MF","last_name":"Buchroithner","full_name":"Buchroithner, MF"},{"id":"90","full_name":"Domik, Gitta","first_name":"Gitta","last_name":"Domik"},{"full_name":"Leberl, Franz","first_name":"Franz","last_name":"Leberl"}],"conference":{"location":"Frascati, Italy"},"status":"public","title":"Radargrammetric aspects of SAR data evaluation","year":"1985","department":[{"_id":"79"},{"_id":"7"},{"_id":"65"},{"_id":"69"}],"type":"journal_article","date_created":"2021-04-12T08:08:09Z","citation":{"ama":"Raggam J, Triebnig G, Buchroithner M, Domik G, Leberl F. Radargrammetric aspects of SAR data evaluation. <i>Thematic Applications of SAR data</i>. 1985:57.","bibtex":"@article{Raggam_Triebnig_Buchroithner_Domik_Leberl_1985, title={Radargrammetric aspects of SAR data evaluation}, journal={Thematic Applications of SAR data}, author={Raggam, J and Triebnig, Gerhard and Buchroithner, MF and Domik, Gitta and Leberl, Franz}, year={1985}, pages={57} }","mla":"Raggam, J., et al. “Radargrammetric Aspects of SAR Data Evaluation.” <i>Thematic Applications of SAR Data</i>, 1985, p. 57.","short":"J. Raggam, G. Triebnig, M. Buchroithner, G. Domik, F. Leberl, Thematic Applications of SAR Data (1985) 57.","chicago":"Raggam, J, Gerhard Triebnig, MF Buchroithner, Gitta Domik, and Franz Leberl. “Radargrammetric Aspects of SAR Data Evaluation.” <i>Thematic Applications of SAR Data</i>, 1985, 57.","apa":"Raggam, J., Triebnig, G., Buchroithner, M., Domik, G., &#38; Leberl, F. (1985). Radargrammetric aspects of SAR data evaluation. <i>Thematic Applications of SAR Data</i>, 57.","ieee":"J. Raggam, G. Triebnig, M. Buchroithner, G. Domik, and F. Leberl, “Radargrammetric aspects of SAR data evaluation,” <i>Thematic Applications of SAR data</i>, p. 57, 1985."},"publication":"Thematic Applications of SAR data"}]