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