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