[{"citation":{"ieee":"F. Meyer auf der Heide and C. Scheideler, “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks,” in ESA, 1995, pp. 341--354.","short":"F. Meyer auf der Heide, C. Scheideler, in: ESA, 1995, pp. 341--354.","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.","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} }","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.","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","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"},"year":"1995","type":"conference","page":"341--354","_id":"2187","urn":"21878","file":[{"creator":"florida","file_id":"2279","file_size":177256,"relation":"main_file","date_updated":"2018-04-12T07:09:35Z","content_type":"application/pdf","date_created":"2018-04-12T06:57:17Z","file_name":"ESA95.pdf","access_level":"open_access"}],"author":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publication":"ESA","file_date_updated":"2018-04-12T07:09:35Z","has_accepted_license":"1","status":"public","date_created":"2018-04-03T09:40:55Z","user_id":"14955","ddc":["040"],"series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:18Z","oa":"1","doi":"10.1007/3-540-60313-1_154","department":[{"_id":"79"},{"_id":"63"}],"title":"Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks"},{"date_updated":"2022-01-06T06:55:24Z","_id":"2207","urn":"22075","oa":"1","language":[{"iso":"eng"}],"type":"conference","year":"1995","citation":{"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.","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” SPAA, 1995, pp. 137--146.","bibtex":"@inproceedings{Meyer auf der Heide_Scheideler_1995, title={Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)}, booktitle={SPAA}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1995}, pages={137--146} }","short":"F. Meyer auf der Heide, C. Scheideler, in: SPAA, 1995, pp. 137--146.","ieee":"F. Meyer auf der Heide and C. Scheideler, “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract),” in SPAA, 1995, pp. 137--146."},"page":"137--146","user_id":"14955","ddc":["040"],"title":"Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)","file":[{"relation":"main_file","date_updated":"2018-04-12T07:09:52Z","content_type":"application/pdf","file_id":"2278","creator":"florida","file_size":284222,"access_level":"open_access","file_name":"SPAA95.pdf","date_created":"2018-04-12T06:56:32Z"}],"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"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"SPAA","file_date_updated":"2018-04-12T07:09:52Z","has_accepted_license":"1","status":"public","date_created":"2018-04-04T12:43:41Z"},{"urn":"22085","_id":"2208","date_updated":"2022-01-06T06:55:24Z","oa":"1","language":[{"iso":"eng"}],"page":"267--278","year":"1995","citation":{"ieee":"F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations,” in STACS, 1995, pp. 267--278.","short":"F. Meyer auf der Heide, C. Scheideler, V. Stemann, in: STACS, 1995, pp. 267--278.","mla":"Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” STACS, 1995, pp. 267--278.","bibtex":"@inproceedings{Meyer auf der Heide_Scheideler_Stemann_1995, title={Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations}, booktitle={STACS}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian and Stemann, Volker}, year={1995}, pages={267--278} }","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.","apa":"Meyer auf der Heide, F., Scheideler, C., & Stemann, V. (1995). Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In STACS (pp. 267--278).","ama":"Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In: STACS. ; 1995:267--278."},"type":"conference","user_id":"14955","title":"Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations","ddc":["040"],"file":[{"file_name":"STACS95.pdf","date_created":"2018-04-12T06:54:40Z","access_level":"open_access","file_size":407467,"file_id":"2277","creator":"florida","date_updated":"2018-04-12T07:09:13Z","content_type":"application/pdf","relation":"main_file"}],"publication":"STACS","file_date_updated":"2018-04-12T07:09:13Z","department":[{"_id":"79"},{"_id":"63"}],"author":[{"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"},{"full_name":"Stemann, Volker","first_name":"Volker","last_name":"Stemann"}],"date_created":"2018-04-04T12:44:26Z","has_accepted_license":"1","status":"public"},{"year":"1996","citation":{"short":"F. Meyer auf der Heide, C. Scheideler, V. Stemann, Theor. Comput. Sci. (1996) 245--281.","ieee":"F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations,” Theor. Comput. Sci., no. 2, pp. 245--281, 1996.","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","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","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.","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} }"},"type":"journal_article","page":"245--281","language":[{"iso":"eng"}],"doi":"10.1016/0304-3975(96)00032-1","issue":"2","_id":"2182","date_updated":"2022-01-06T06:55:16Z","status":"public","date_created":"2018-04-03T09:30:20Z","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"},{"full_name":"Stemann, Volker","first_name":"Volker","last_name":"Stemann"}],"publication":"Theor. Comput. Sci.","department":[{"_id":"79"},{"_id":"63"}],"title":"Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations","user_id":"14955"},{"title":"Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols","ddc":["040"],"user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"publication":"FOCS","file_date_updated":"2018-04-12T07:10:17Z","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file":[{"file_name":"FOCS96.pdf","date_created":"2018-04-12T07:01:11Z","access_level":"open_access","creator":"florida","file_id":"2281","file_size":248409,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T07:10:17Z"}],"date_created":"2018-04-03T09:31:52Z","has_accepted_license":"1","status":"public","urn":"21832","_id":"2183","date_updated":"2022-01-06T06:55:17Z","oa":"1","page":"370--379","citation":{"ieee":"F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols,” in FOCS, 1996, pp. 370--379.","short":"F. Meyer auf der Heide, C. Scheideler, in: FOCS, 1996, pp. 370--379.","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” FOCS, 1996, pp. 370--379.","bibtex":"@inproceedings{Meyer auf der Heide_Scheideler_1996, title={Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols}, booktitle={FOCS}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1996}, pages={370--379} }","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."},"type":"conference","year":"1996","language":[{"iso":"eng"}]},{"series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:17Z","oa":"1","department":[{"_id":"79"},{"_id":"63"}],"title":"Communication in Parallel Systems","citation":{"bibtex":"@inproceedings{Meyer auf der Heide_Scheideler_1996, series={Lecture Notes in Computer Science}, title={Communication in Parallel Systems}, volume={1175}, booktitle={SOFSEM}, publisher={Springer}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1996}, pages={16--33}, collection={Lecture Notes in Computer Science} }","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” SOFSEM, vol. 1175, Springer, 1996, pp. 16--33.","apa":"Meyer auf der Heide, F., & Scheideler, C. (1996). Communication in Parallel Systems. In SOFSEM (Vol. 1175, pp. 16--33). Springer.","ama":"Meyer auf der Heide F, Scheideler C. Communication in Parallel Systems. In: SOFSEM. Vol 1175. Lecture Notes in Computer Science. Springer; 1996:16--33.","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” In SOFSEM, 1175:16--33. Lecture Notes in Computer Science. Springer, 1996.","ieee":"F. Meyer auf der Heide and C. Scheideler, “Communication in Parallel Systems,” in SOFSEM, 1996, vol. 1175, pp. 16--33.","short":"F. Meyer auf der Heide, C. Scheideler, in: SOFSEM, Springer, 1996, pp. 16--33."},"year":"1996","type":"conference","page":"16--33","intvolume":" 1175","_id":"2184","urn":"21840","file":[{"access_level":"open_access","date_created":"2018-04-12T07:01:59Z","file_name":"SOFSEM96.pdf","date_updated":"2018-04-12T07:10:36Z","content_type":"application/pdf","relation":"main_file","file_size":597639,"creator":"florida","file_id":"2282"}],"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"}],"publisher":"Springer","publication":"SOFSEM","file_date_updated":"2018-04-12T07:10:36Z","has_accepted_license":"1","status":"public","date_created":"2018-04-03T09:32:47Z","volume":1175,"user_id":"14955","ddc":["040"]},{"type":"conference","year":"1996","citation":{"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.","short":"R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöcking, in: 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} }","mla":"Cypher, Robert, et al. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” STOC, ACM, 1996, pp. 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: STOC. ACM; 1996:356--365.","apa":"Cypher, R., Meyer auf der Heide, F., Scheideler, C., & Vöcking, B. (1996). Universal Algorithms for Store-and-Forward and Wormhole Routing. In STOC (pp. 356--365). ACM.","chicago":"Cypher, Robert, Friedhelm Meyer auf der Heide, Christian Scheideler, and Berthold Vöcking. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” In STOC, 356--365. ACM, 1996."},"page":"356--365","_id":"2186","urn":"21868","has_accepted_license":"1","status":"public","date_created":"2018-04-03T09:39:17Z","file":[{"access_level":"open_access","file_name":"STOC96.pdf","date_created":"2018-04-12T06:58:59Z","date_updated":"2018-04-12T07:11:03Z","content_type":"application/pdf","relation":"main_file","file_size":700595,"creator":"florida","file_id":"2280"}],"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"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"}],"publisher":"ACM","file_date_updated":"2018-04-12T07:11:03Z","publication":"STOC","user_id":"14955","ddc":["040"],"language":[{"iso":"eng"}],"oa":"1","date_updated":"2022-01-06T06:55:18Z","department":[{"_id":"79"},{"_id":"63"}],"title":"Universal Algorithms for Store-and-Forward and Wormhole Routing"},{"oa":"1","date_updated":"2022-01-06T06:55:13Z","language":[{"iso":"eng"}],"title":"Optimal Wormhole Routing in the (n, d)-Torus","department":[{"_id":"79"},{"_id":"63"}],"_id":"2175","urn":"21759","year":"1997","type":"conference","citation":{"chicago":"Bock, Stefan, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Optimal Wormhole Routing in the (n, d)-Torus.” In IPPS, 326--332. IEEE Computer Society, 1997.","ama":"Bock S, Meyer auf der Heide F, Scheideler C. Optimal Wormhole Routing in the (n, d)-Torus. In: IPPS. IEEE Computer Society; 1997:326--332.","apa":"Bock, S., Meyer auf der Heide, F., & Scheideler, C. (1997). Optimal Wormhole Routing in the (n, d)-Torus. In IPPS (pp. 326--332). IEEE Computer Society.","bibtex":"@inproceedings{Bock_Meyer auf der Heide_Scheideler_1997, title={Optimal Wormhole Routing in the (n, d)-Torus}, booktitle={IPPS}, publisher={IEEE Computer Society}, author={Bock, Stefan and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1997}, pages={326--332} }","mla":"Bock, Stefan, et al. “Optimal Wormhole Routing in the (n, d)-Torus.” IPPS, IEEE Computer Society, 1997, pp. 326--332.","short":"S. Bock, F. Meyer auf der Heide, C. Scheideler, in: IPPS, IEEE Computer Society, 1997, pp. 326--332.","ieee":"S. Bock, F. Meyer auf der Heide, and C. Scheideler, “Optimal Wormhole Routing in the (n, d)-Torus,” in IPPS, 1997, pp. 326--332."},"page":"326--332","user_id":"14955","ddc":["040"],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T09:11:47Z","file":[{"access_level":"open_access","file_name":"IPPS97.pdf","date_created":"2018-04-12T07:07:20Z","relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T07:11:50Z","creator":"florida","file_id":"2284","file_size":88749}],"author":[{"first_name":"Stefan","full_name":"Bock, Stefan","last_name":"Bock"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publisher":"IEEE Computer Society","file_date_updated":"2018-04-12T07:11:50Z","publication":"IPPS"},{"user_id":"14955","ddc":["040"],"title":"Simple, Efficient Routing Schemes for All-Optical Networks","file":[{"content_type":"application/pdf","date_updated":"2018-04-12T07:11:32Z","relation":"main_file","file_size":365709,"file_id":"2283","creator":"florida","access_level":"open_access","date_created":"2018-04-12T07:06:34Z","file_name":"SPAA97.pdf"}],"author":[{"full_name":"Flammini, Michele","first_name":"Michele","last_name":"Flammini"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T07:11:32Z","publication":"SPAA","status":"public","has_accepted_license":"1","date_created":"2018-04-03T09:17:10Z","date_updated":"2022-01-06T06:55:13Z","_id":"2179","urn":"21792","oa":"1","language":[{"iso":"eng"}],"year":"1997","type":"conference","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} }","chicago":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” In SPAA, 170--179, 1997.","ama":"Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical Networks. In: SPAA. ; 1997:170--179.","apa":"Flammini, M., & Scheideler, C. (1997). Simple, Efficient Routing Schemes for All-Optical Networks. In SPAA (pp. 170--179)."},"page":"170--179"},{"doi":"10.1007/s002240000096","issue":"4","_id":"2168","intvolume":" 31","date_updated":"2022-01-06T06:55:10Z","page":"425--449","year":"1998","citation":{"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","mla":"Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.” Theory Comput. Syst., vol. 31, no. 4, 1998, pp. 425--449, doi:10.1007/s002240000096.","bibtex":"@article{Scheideler_Vöcking_1998, title={Universal Continuous Routing Strategies}, volume={31}, DOI={10.1007/s002240000096}, number={4}, journal={Theory Comput. Syst.}, author={Scheideler, Christian and Vöcking, Berthold}, year={1998}, pages={425--449} }","short":"C. Scheideler, B. Vöcking, Theory Comput. Syst. 31 (1998) 425--449.","ieee":"C. Scheideler and B. Vöcking, “Universal Continuous Routing Strategies,” Theory Comput. Syst., vol. 31, no. 4, pp. 425--449, 1998."},"type":"journal_article","language":[{"iso":"eng"}],"title":"Universal Continuous Routing Strategies","user_id":"14955","volume":31,"date_created":"2018-04-03T08:59:06Z","status":"public","department":[{"_id":"79"},{"_id":"63"}],"publication":"Theory Comput. Syst.","author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Vöcking","first_name":"Berthold","full_name":"Vöcking, Berthold"}]},{"author":[{"last_name":"Adler","first_name":"Micah","full_name":"Adler, Micah"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publication":"SPAA","file_date_updated":"2018-04-12T07:08:12Z","department":[{"_id":"79"},{"_id":"63"}],"file":[{"date_updated":"2018-04-12T07:08:12Z","content_type":"application/pdf","relation":"main_file","file_size":492778,"file_id":"2285","creator":"florida","access_level":"open_access","date_created":"2018-04-12T07:08:12Z","file_name":"SPAA98.pdf"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T08:59:55Z","ddc":["040"],"title":"Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)","user_id":"14955","year":"1998","type":"conference","citation":{"short":"M. Adler, C. Scheideler, in: SPAA, 1998, pp. 259--268.","ieee":"M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract),” in SPAA, 1998, pp. 259--268.","apa":"Adler, M., & Scheideler, C. (1998). Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). In SPAA (pp. 259--268).","ama":"Adler M, Scheideler C. Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). In: SPAA. ; 1998:259--268.","chicago":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” In SPAA, 259--268, 1998.","mla":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” SPAA, 1998, pp. 259--268.","bibtex":"@inproceedings{Adler_Scheideler_1998, title={Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)}, booktitle={SPAA}, author={Adler, Micah and Scheideler, Christian}, year={1998}, pages={259--268} }"},"page":"259--268","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:10Z","_id":"2169","urn":"21699","oa":"1"},{"author":[{"first_name":"Uriel","full_name":"Feige, Uriel","last_name":"Feige"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"STOC","file_date_updated":"2018-04-12T07:15:50Z","department":[{"_id":"79"},{"_id":"63"}],"file":[{"content_type":"application/pdf","date_updated":"2018-04-12T07:15:50Z","relation":"main_file","file_size":228487,"file_id":"2286","creator":"florida","access_level":"open_access","date_created":"2018-04-12T07:15:50Z","file_name":"STOC98.pdf"}],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T09:00:31Z","ddc":["040"],"title":"Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)","user_id":"14955","citation":{"bibtex":"@inproceedings{Feige_Scheideler_1998, title={Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)}, booktitle={STOC}, author={Feige, Uriel and Scheideler, Christian}, year={1998}, pages={624--633} }","mla":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” STOC, 1998, pp. 624--633.","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.","ieee":"U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract),” in STOC, 1998, pp. 624--633.","short":"U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633."},"type":"conference","year":"1998","page":"624--633","language":[{"iso":"eng"}],"_id":"2170","date_updated":"2022-01-06T06:55:11Z","urn":"21705","oa":"1"},{"type":"journal_article","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.","bibtex":"@article{Flammini_Scheideler_1999, title={Simple, Efficient Routing Schemes for All-Optical Networks}, volume={32}, DOI={10.1007/s002240000123}, number={3}, journal={Theory Comput. Syst.}, author={Flammini, Michele and Scheideler, Christian}, year={1999}, pages={387--420} }","mla":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” Theory Comput. Syst., vol. 32, no. 3, 1999, pp. 387--420, doi:10.1007/s002240000123.","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.","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"},"year":"1999","page":"387--420","language":[{"iso":"eng"}],"doi":"10.1007/s002240000123","issue":"3","intvolume":" 32","_id":"2151","date_updated":"2022-01-06T06:55:02Z","volume":32,"status":"public","date_created":"2018-04-03T06:22:14Z","author":[{"last_name":"Flammini","full_name":"Flammini, Michele","first_name":"Michele"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"Theory Comput. Syst.","title":"Simple, Efficient Routing Schemes for All-Optical Networks","user_id":"14955"},{"file":[{"file_size":179058,"creator":"florida","file_id":"2288","date_updated":"2018-04-12T07:34:50Z","content_type":"application/pdf","relation":"main_file","date_created":"2018-04-12T07:34:50Z","file_name":"SODA-99.pdf","access_level":"open_access"}],"author":[{"first_name":"Petra","full_name":"Berenbrink, Petra","last_name":"Berenbrink"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file_date_updated":"2018-04-12T07:34:50Z","department":[{"_id":"79"},{"_id":"63"}],"publication":"SODA","status":"public","has_accepted_license":"1","date_created":"2018-04-03T08:56:06Z","user_id":"14955","title":"Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths","ddc":["040"],"language":[{"iso":"eng"}],"citation":{"chicago":"Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” In SODA, 112--121, 1999.","apa":"Berenbrink, P., & Scheideler, C. (1999). Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In SODA (pp. 112--121).","ama":"Berenbrink P, Scheideler C. Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In: SODA. ; 1999: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} }","mla":"Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” SODA, 1999, pp. 112--121.","short":"P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121.","ieee":"P. Berenbrink and C. Scheideler, “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths,” in SODA, 1999, pp. 112--121."},"type":"conference","year":"1999","page":"112--121","date_updated":"2022-01-06T06:55:09Z","_id":"2164","urn":"21649","oa":"1"},{"title":"Simple Competitive Request Scheduling Strategies","ddc":["040"],"user_id":"14955","date_created":"2018-04-03T08:56:45Z","status":"public","has_accepted_license":"1","publication":"SPAA","file_date_updated":"2018-04-12T07:36:27Z","department":[{"_id":"79"},{"_id":"63"}],"author":[{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"},{"last_name":"Riedel","full_name":"Riedel, Marco","first_name":"Marco"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file":[{"access_level":"open_access","file_name":"SPAA-99.pdf","date_created":"2018-04-12T07:36:27Z","content_type":"application/pdf","date_updated":"2018-04-12T07:36:27Z","relation":"main_file","file_size":144422,"creator":"florida","file_id":"2290"}],"oa":"1","urn":"21658","_id":"2165","date_updated":"2022-01-06T06:55:09Z","page":"33--42","year":"1999","citation":{"short":"P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.","ieee":"P. Berenbrink, M. Riedel, and C. Scheideler, “Simple Competitive Request Scheduling Strategies,” in SPAA, 1999, pp. 33--42.","apa":"Berenbrink, P., Riedel, M., & Scheideler, C. (1999). Simple Competitive Request Scheduling Strategies. In SPAA (pp. 33--42).","ama":"Berenbrink P, Riedel M, Scheideler C. Simple Competitive Request Scheduling Strategies. In: SPAA. ; 1999:33--42.","chicago":"Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Simple Competitive Request Scheduling Strategies.” In SPAA, 33--42, 1999.","mla":"Berenbrink, Petra, et al. “Simple Competitive Request Scheduling Strategies.” SPAA, 1999, pp. 33--42.","bibtex":"@inproceedings{Berenbrink_Riedel_Scheideler_1999, title={Simple Competitive Request Scheduling Strategies}, booktitle={SPAA}, author={Berenbrink, Petra and Riedel, Marco and Scheideler, Christian}, year={1999}, pages={33--42} }"},"type":"conference","language":[{"iso":"eng"}]},{"ddc":["040"],"title":"Design of the PRESTO Multimedia Storage Network (Extended Abstract)","user_id":"14955","date_created":"2018-04-05T07:00:11Z","has_accepted_license":"1","status":"public","file_date_updated":"2018-04-12T08:34:00Z","publication":"International Workshop on Communication and Data Management in Large Networks (CDMLarge)","department":[{"_id":"79"},{"_id":"63"}],"author":[{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"},{"first_name":"Marco","full_name":"Riedel, Marco","last_name":"Riedel"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file":[{"access_level":"open_access","date_created":"2018-04-12T08:34:00Z","file_name":"CDMLarge-99.pdf","relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T08:34:00Z","file_id":"2294","creator":"florida","file_size":211926}],"oa":"1","urn":"22109","_id":"2210","date_updated":"2022-01-06T06:55:26Z","page":"2-12","citation":{"apa":"Berenbrink, P., Riedel, M., & Scheideler, C. (1999). Design of the PRESTO Multimedia Storage Network (Extended Abstract). In International Workshop on Communication and Data Management in Large Networks (CDMLarge) (pp. 2–12).","ama":"Berenbrink P, Riedel M, Scheideler C. Design of the PRESTO Multimedia Storage Network (Extended Abstract). In: International Workshop on Communication and Data Management in Large Networks (CDMLarge). ; 1999:2-12.","chicago":"Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” In International Workshop on Communication and Data Management in Large Networks (CDMLarge), 2–12, 1999.","bibtex":"@inproceedings{Berenbrink_Riedel_Scheideler_1999, title={Design of the PRESTO Multimedia Storage Network (Extended Abstract)}, booktitle={International Workshop on Communication and Data Management in Large Networks (CDMLarge)}, author={Berenbrink, Petra and Riedel, Marco and Scheideler, Christian}, year={1999}, pages={2–12} }","mla":"Berenbrink, Petra, et al. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.","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."},"year":"1999","type":"conference","language":[{"iso":"eng"}]},{"oa":"1","urn":"21668","_id":"2166","date_updated":"2022-01-06T06:55:10Z","page":"215--224","type":"conference","year":"1999","citation":{"short":"C. Scheideler, B. Vöcking, in: STOC, 1999, pp. 215--224.","ieee":"C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,” in STOC, 1999, pp. 215--224.","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."},"language":[{"iso":"eng"}],"ddc":["040"],"title":"From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols","user_id":"14955","date_created":"2018-04-03T08:57:30Z","has_accepted_license":"1","status":"public","publication":"STOC","file_date_updated":"2018-04-12T07:35:46Z","department":[{"_id":"79"},{"_id":"63"}],"author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"}],"file":[{"date_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","content_type":"application/pdf","date_updated":"2018-04-12T07:35:46Z"}]},{"doi":"10.1007/s002240010006","issue":"5/6","date_updated":"2022-01-06T06:54:59Z","_id":"2143","intvolume":" 33","citation":{"ieee":"M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad Hoc Wireless Networks,” Theory Comput. Syst., vol. 33, no. 5/6, pp. 337--391, 2000.","short":"M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391.","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.","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","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","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."},"year":"2000","type":"journal_article","page":"337--391","language":[{"iso":"eng"}],"title":"Efficient Communication Strategies for Ad Hoc Wireless Networks","user_id":"14955","volume":33,"status":"public","date_created":"2018-04-03T05:51:02Z","author":[{"full_name":"Adler, Micah","first_name":"Micah","last_name":"Adler"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publication":"Theory Comput. Syst.","department":[{"_id":"79"},{"_id":"63"}]},{"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":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Berthold","full_name":"Vöcking, Berthold","last_name":"Vöcking"}],"publication":"SIAM J. Comput.","department":[{"_id":"79"},{"_id":"63"}],"issue":"4","doi":"10.1137/S0097539799353431","_id":"2145","intvolume":" 30","date_updated":"2022-01-06T06:55:00Z","language":[{"iso":"eng"}],"year":"2000","citation":{"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","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","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.","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.","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} }","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."},"type":"journal_article","page":"1126--1155"},{"language":[{"iso":"eng"}],"type":"conference","citation":{"short":"P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.","ieee":"P. Berenbrink, A. Brinkmann, and C. Scheideler, “Distributed Path Selection for Storage Networks,” in PDPTA, 2000.","ama":"Berenbrink P, Brinkmann A, Scheideler C. 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.","chicago":"Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “Distributed Path Selection for Storage Networks.” 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."},"year":"2000","date_updated":"2022-01-06T06:55:00Z","_id":"2146","urn":"21467","oa":"1","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"}],"author":[{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"},{"last_name":"Brinkmann","full_name":"Brinkmann, André","first_name":"André"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file_date_updated":"2018-04-12T08:47:50Z","publication":"PDPTA","department":[{"_id":"79"},{"_id":"63"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T06:13:07Z","user_id":"14955","title":"Distributed Path Selection for Storage Networks","ddc":["040"]},{"language":[{"iso":"eng"}],"page":"30--39","type":"conference","year":"2000","citation":{"chicago":"Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” In SODA, 30--39, 2000.","ama":"Czumaj A, Scheideler C. Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In: SODA. ; 2000:30--39.","apa":"Czumaj, A., & Scheideler, C. (2000). Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In SODA (pp. 30--39).","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} }","mla":"Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” SODA, 2000, pp. 30--39.","short":"A. Czumaj, C. Scheideler, in: SODA, 2000, pp. 30--39.","ieee":"A. Czumaj and C. Scheideler, “Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma,” in SODA, 2000, pp. 30--39."},"oa":"1","urn":"21476","_id":"2147","date_updated":"2022-01-06T06:55:00Z","date_created":"2018-04-03T06:16:48Z","has_accepted_license":"1","status":"public","file":[{"access_level":"open_access","date_created":"2018-04-12T08:36:17Z","file_name":"SODA-00.pdf","relation":"main_file","date_updated":"2018-04-12T08:36:17Z","content_type":"application/pdf","creator":"florida","file_id":"2295","file_size":185001}],"file_date_updated":"2018-04-12T08:36:17Z","publication":"SODA","department":[{"_id":"79"},{"_id":"63"}],"author":[{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"user_id":"14955","title":"Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma","ddc":["040"]},{"issue":"3-4","_id":"2148","date_updated":"2022-01-06T06:55:00Z","intvolume":" 17","language":[{"iso":"eng"}],"citation":{"short":"A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237.","ieee":"A. Czumaj and C. Scheideler, “Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma,” Random Struct. Algorithms, vol. 17, no. 3–4, pp. 213--237, 2000.","chicago":"Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms 17, no. 3–4 (2000): 213--237.","ama":"Czumaj A, Scheideler C. Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct Algorithms. 2000;17(3-4):213--237.","apa":"Czumaj, A., & Scheideler, C. (2000). Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct. Algorithms, 17(3–4), 213--237.","mla":"Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms, vol. 17, no. 3–4, 2000, pp. 213--237.","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} }"},"type":"journal_article","year":"2000","page":"213--237","user_id":"14955","title":"Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma","status":"public","date_created":"2018-04-03T06:17:52Z","volume":17,"author":[{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"Random Struct. Algorithms"},{"status":"public","has_accepted_license":"1","date_created":"2018-04-03T06:18:45Z","author":[{"last_name":"Brinkmann","first_name":"André","full_name":"Brinkmann, André"},{"last_name":"Salzwedel","full_name":"Salzwedel, Kay","first_name":"Kay"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file_date_updated":"2018-04-12T08:38:13Z","department":[{"_id":"79"},{"_id":"63"}],"publication":"SPAA","file":[{"content_type":"application/pdf","date_updated":"2018-04-12T08:38:13Z","relation":"main_file","file_size":222176,"file_id":"2297","creator":"florida","access_level":"open_access","file_name":"spaa_00.pdf","date_created":"2018-04-12T08:38:13Z"}],"title":"Efficient, distributed data placement strategies for storage area networks (extended abstract)","ddc":["040"],"user_id":"14955","type":"conference","year":"2000","citation":{"ieee":"A. Brinkmann, K. Salzwedel, and C. Scheideler, “Efficient, distributed data placement strategies for storage area networks (extended abstract),” in SPAA, 2000, pp. 119--128.","short":"A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.","bibtex":"@inproceedings{Brinkmann_Salzwedel_Scheideler_2000, title={Efficient, distributed data placement strategies for storage area networks (extended abstract)}, booktitle={SPAA}, author={Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}, year={2000}, pages={119--128} }","mla":"Brinkmann, André, et al. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” SPAA, 2000, pp. 119--128.","ama":"Brinkmann A, Salzwedel K, Scheideler C. Efficient, distributed data placement strategies for storage area networks (extended abstract). In: SPAA. ; 2000:119--128.","apa":"Brinkmann, A., Salzwedel, K., & Scheideler, C. (2000). Efficient, distributed data placement strategies for storage area networks (extended abstract). In SPAA (pp. 119--128).","chicago":"Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” In SPAA, 119--128, 2000."},"page":"119--128","language":[{"iso":"eng"}],"oa":"1","_id":"2149","date_updated":"2022-01-06T06:55:02Z","urn":"21493"},{"department":[{"_id":"79"},{"_id":"63"}],"title":"A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:02Z","oa":"1","publication":"STOC","file_date_updated":"2018-04-12T08:49:23Z","publisher":"ACM","author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file":[{"file_size":190083,"creator":"florida","file_id":"2300","content_type":"application/pdf","date_updated":"2018-04-12T08:49:23Z","relation":"main_file","date_created":"2018-04-12T08:49:23Z","file_name":"STOC-00.pdf","access_level":"open_access"}],"date_created":"2018-04-03T06:21:11Z","has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"14955","page":"38--47","citation":{"bibtex":"@inproceedings{Czumaj_Scheideler_2000, title={A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)}, booktitle={STOC}, publisher={ACM}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={38--47} }","mla":"Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (Extended Abstract).” STOC, ACM, 2000, pp. 38--47.","ama":"Czumaj A, Scheideler C. A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In: STOC. ACM; 2000:38--47.","apa":"Czumaj, A., & Scheideler, C. (2000). A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In STOC (pp. 38--47). ACM.","chicago":"Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (Extended Abstract).” In STOC, 38--47. ACM, 2000.","ieee":"A. Czumaj and C. Scheideler, “A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract),” in STOC, 2000, pp. 38--47.","short":"A. Czumaj, C. Scheideler, in: STOC, ACM, 2000, pp. 38--47."},"type":"conference","year":"2000","urn":"21509","_id":"2150"},{"user_id":"14955","ddc":["040"],"title":"A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ","file":[{"date_updated":"2018-04-12T08:37:23Z","content_type":"application/pdf","relation":"main_file","file_size":190083,"creator":"florida","file_id":"2296","access_level":"open_access","file_name":"STOC-00.pdf","date_created":"2018-04-12T08:37:23Z"}],"department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T08:37:23Z","publication":"32nd ACM Symposium on Theory of Computing","author":[{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2018-04-05T07:02:46Z","has_accepted_license":"1","status":"public","urn":"22111","_id":"2211","date_updated":"2022-01-06T06:55:26Z","oa":"1","language":[{"iso":"eng"}],"page":"38-47","citation":{"chicago":"Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” In 32nd ACM Symposium on Theory of Computing, 38–47, 2000.","ama":"Czumaj A, Scheideler C. A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In: 32nd ACM Symposium on Theory of Computing. ; 2000:38-47.","apa":"Czumaj, A., & Scheideler, C. (2000). A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In 32nd ACM Symposium on Theory of Computing (pp. 38–47).","bibtex":"@inproceedings{Czumaj_Scheideler_2000, title={A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems }, booktitle={32nd ACM Symposium on Theory of Computing}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={38–47} }","mla":"Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.","short":"A. Czumaj, C. Scheideler, in: 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.","ieee":"A. Czumaj and C. Scheideler, “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ,” in 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47."},"type":"conference","year":"2000"},{"page":"95--138","citation":{"mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica, vol. 21, no. 1, 2001, pp. 95--138, doi:10.1007/s004930170007.","bibtex":"@article{Meyer auf der Heide_Scheideler_2001, title={Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols}, volume={21}, DOI={10.1007/s004930170007}, number={1}, journal={Combinatorica}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2001}, pages={95--138} }","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica 21, no. 1 (2001): 95--138. https://doi.org/10.1007/s004930170007.","ama":"Meyer auf der Heide F, Scheideler C. Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica. 2001;21(1):95--138. doi:10.1007/s004930170007","apa":"Meyer auf der Heide, F., & Scheideler, C. (2001). Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica, 21(1), 95--138. https://doi.org/10.1007/s004930170007","ieee":"F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols,” Combinatorica, vol. 21, no. 1, pp. 95--138, 2001.","short":"F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138."},"type":"journal_article","year":"2001","language":[{"iso":"eng"}],"doi":"10.1007/s004930170007","issue":"1","date_updated":"2022-01-06T06:54:57Z","_id":"2139","intvolume":" 21","volume":21,"date_created":"2018-04-03T05:47:20Z","status":"public","department":[{"_id":"79"},{"_id":"63"}],"publication":"Combinatorica","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"title":"Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols","user_id":"14955"},{"year":"2001","type":"conference","citation":{"ieee":"B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler, “Simple Routing Strategies for Adversarial Systems,” in FOCS, 2001, pp. 158--167.","short":"B. Awerbuch, P. Berenbrink, A. Brinkmann, C. Scheideler, in: FOCS, IEEE Computer Society, 2001, pp. 158--167.","bibtex":"@inproceedings{Awerbuch_Berenbrink_Brinkmann_Scheideler_2001, title={Simple Routing Strategies for Adversarial Systems}, booktitle={FOCS}, publisher={IEEE Computer Society}, author={Awerbuch, Baruch and Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}, year={2001}, pages={158--167} }","mla":"Awerbuch, Baruch, et al. “Simple Routing Strategies for Adversarial Systems.” FOCS, IEEE Computer Society, 2001, pp. 158--167.","chicago":"Awerbuch, Baruch, Petra Berenbrink, André Brinkmann, and Christian Scheideler. “Simple Routing Strategies for Adversarial Systems.” In FOCS, 158--167. IEEE Computer Society, 2001.","apa":"Awerbuch, B., Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). Simple Routing Strategies for Adversarial Systems. In FOCS (pp. 158--167). IEEE Computer Society.","ama":"Awerbuch B, Berenbrink P, Brinkmann A, Scheideler C. Simple Routing Strategies for Adversarial Systems. In: FOCS. IEEE Computer Society; 2001:158--167."},"page":"158--167","oa":"1","_id":"2140","date_updated":"2022-01-06T06:54:59Z","urn":"21406","has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:48:28Z","file":[{"file_id":"2302","creator":"florida","file_size":151156,"relation":"main_file","date_updated":"2018-04-12T08:59:00Z","content_type":"application/pdf","date_created":"2018-04-12T08:59:00Z","file_name":"FOCS-01.pdf","access_level":"open_access"}],"author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"last_name":"Berenbrink","first_name":"Petra","full_name":"Berenbrink, Petra"},{"last_name":"Brinkmann","full_name":"Brinkmann, André","first_name":"André"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publisher":"IEEE Computer Society","file_date_updated":"2018-04-12T08:59:00Z","department":[{"_id":"79"}],"publication":"FOCS","user_id":"15504","ddc":["040"],"title":"Simple Routing Strategies for Adversarial Systems"},{"department":[{"_id":"79"},{"_id":"63"}],"title":"SIMLAB-A Simulation Environment for Storage Area Networks","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:59Z","oa":"1","publisher":"IEEE Computer Society","author":[{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"},{"last_name":"Brinkmann","first_name":"André","full_name":"Brinkmann, André"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"PDP","file_date_updated":"2018-04-12T08:39:01Z","file":[{"date_updated":"2018-04-12T08:39:01Z","content_type":"application/pdf","relation":"main_file","file_size":85778,"creator":"florida","file_id":"2298","access_level":"open_access","file_name":"PDP-00.pdf","date_created":"2018-04-12T08:39:01Z"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:49:21Z","ddc":["040"],"user_id":"14955","year":"2001","type":"conference","citation":{"apa":"Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). SIMLAB-A Simulation Environment for Storage Area Networks. In PDP (pp. 227--234). IEEE Computer Society.","ama":"Berenbrink P, Brinkmann A, Scheideler C. SIMLAB-A Simulation Environment for Storage Area Networks. In: PDP. IEEE Computer Society; 2001:227--234.","chicago":"Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “SIMLAB-A Simulation Environment for Storage Area Networks.” In PDP, 227--234. IEEE Computer Society, 2001.","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} }","mla":"Berenbrink, Petra, et al. “SIMLAB-A Simulation Environment for Storage Area Networks.” PDP, IEEE Computer Society, 2001, pp. 227--234.","short":"P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society, 2001, pp. 227--234.","ieee":"P. Berenbrink, A. Brinkmann, and C. Scheideler, “SIMLAB-A Simulation Environment for Storage Area Networks,” in PDP, 2001, pp. 227--234."},"page":"227--234","_id":"2141","urn":"21415"},{"ddc":["040"],"title":"Simple on-line algorithms for the maximum disjoint paths problem","user_id":"15504","author":[{"last_name":"Kolman","full_name":"Kolman, Petr","first_name":"Petr"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"department":[{"_id":"79"}],"file_date_updated":"2018-04-12T08:58:07Z","publication":"SPAA","file":[{"access_level":"open_access","file_name":"SPAA-01.pdf","date_created":"2018-04-12T08:58:07Z","date_updated":"2018-04-12T08:58:07Z","content_type":"application/pdf","relation":"main_file","file_size":335171,"file_id":"2301","creator":"florida"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:50:16Z","date_updated":"2022-01-06T06:54:59Z","_id":"2142","urn":"21421","oa":"1","type":"conference","year":"2001","citation":{"ama":"Kolman P, Scheideler C. Simple on-line algorithms for the maximum disjoint paths problem. In: SPAA. ; 2001:38--47.","apa":"Kolman, P., & Scheideler, C. (2001). Simple on-line algorithms for the maximum disjoint paths problem. In SPAA (pp. 38--47).","chicago":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” In SPAA, 38--47, 2001.","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} }","mla":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” SPAA, 2001, pp. 38--47.","short":"P. Kolman, C. Scheideler, in: SPAA, 2001, pp. 38--47.","ieee":"P. Kolman and C. Scheideler, “Simple on-line algorithms for the maximum disjoint paths problem,” in SPAA, 2001, pp. 38--47."},"page":"38--47"},{"user_id":"15504","title":"Improved Bounds for Acyclic Job Shop Scheduling","department":[{"_id":"79"}],"publication":"Combinatorica","author":[{"full_name":"Feige, Uriel","first_name":"Uriel","last_name":"Feige"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2018-04-03T05:43:36Z","status":"public","_id":"2134","date_updated":"2022-01-06T06:54:55Z","issue":"3","doi":"10.1007/s004930200018","page":"361--399","type":"journal_article","citation":{"short":"U. Feige, C. Scheideler, Combinatorica (2002) 361--399.","ieee":"U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling,” Combinatorica, no. 3, pp. 361--399, 2002.","chicago":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling.” Combinatorica, no. 3 (2002): 361--399. https://doi.org/10.1007/s004930200018.","ama":"Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling. Combinatorica. 2002;(3):361--399. doi:10.1007/s004930200018","apa":"Feige, U., & Scheideler, C. (2002). Improved Bounds for Acyclic Job Shop Scheduling. Combinatorica, (3), 361--399. https://doi.org/10.1007/s004930200018","bibtex":"@article{Feige_Scheideler_2002, title={Improved Bounds for Acyclic Job Shop Scheduling}, DOI={10.1007/s004930200018}, number={3}, journal={Combinatorica}, author={Feige, Uriel and Scheideler, Christian}, year={2002}, pages={361--399} }","mla":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling.” Combinatorica, no. 3, 2002, pp. 361--399, doi:10.1007/s004930200018."},"year":"2002"},{"file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T08:59:58Z","creator":"florida","file_id":"2303","file_size":246604,"access_level":"open_access","date_created":"2018-04-12T08:59:58Z","file_name":"SODA-02.pdf"}],"author":[{"full_name":"Kolman, Petr","first_name":"Petr","last_name":"Kolman"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publisher":"ACM/SIAM","file_date_updated":"2018-04-12T08:59:58Z","publication":"SODA","department":[{"_id":"79"}],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:44:11Z","user_id":"15504","title":"Improved bounds for the unsplittable flow problem","ddc":["040"],"citation":{"short":"P. Kolman, C. Scheideler, in: SODA, ACM/SIAM, 2002, pp. 184--193.","ieee":"P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,” in SODA, 2002, pp. 184--193.","apa":"Kolman, P., & Scheideler, C. (2002). Improved bounds for the unsplittable flow problem. In SODA (pp. 184--193). ACM/SIAM.","ama":"Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem. In: SODA. ACM/SIAM; 2002:184--193.","chicago":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” In SODA, 184--193. ACM/SIAM, 2002.","mla":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” SODA, ACM/SIAM, 2002, pp. 184--193.","bibtex":"@inproceedings{Kolman_Scheideler_2002, title={Improved bounds for the unsplittable flow problem}, booktitle={SODA}, publisher={ACM/SIAM}, author={Kolman, Petr and Scheideler, Christian}, year={2002}, pages={184--193} }"},"year":"2002","type":"conference","page":"184--193","_id":"2135","date_updated":"2022-01-06T06:54:55Z","urn":"21357","oa":"1"},{"page":"53--62","type":"conference","year":"2002","citation":{"ieee":"A. Brinkmann, K. Salzwedel, and C. Scheideler, “Compact, adaptive placement schemes for non-uniform requirements,” in SPAA, 2002, pp. 53--62.","short":"A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2002, pp. 53--62.","bibtex":"@inproceedings{Brinkmann_Salzwedel_Scheideler_2002, title={Compact, adaptive placement schemes for non-uniform requirements}, booktitle={SPAA}, author={Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}, year={2002}, pages={53--62} }","mla":"Brinkmann, André, et al. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” SPAA, 2002, pp. 53--62.","ama":"Brinkmann A, Salzwedel K, Scheideler C. Compact, adaptive placement schemes for non-uniform requirements. In: SPAA. ; 2002:53--62.","apa":"Brinkmann, A., Salzwedel, K., & Scheideler, C. (2002). Compact, adaptive placement schemes for non-uniform requirements. In SPAA (pp. 53--62).","chicago":"Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” In SPAA, 53--62, 2002."},"language":[{"iso":"eng"}],"oa":"1","urn":"21366","_id":"2136","date_updated":"2022-01-06T06:54:56Z","date_created":"2018-04-03T05:44:56Z","has_accepted_license":"1","status":"public","publication":"SPAA","department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T09:02:22Z","author":[{"last_name":"Brinkmann","first_name":"André","full_name":"Brinkmann, André"},{"last_name":"Salzwedel","first_name":"Kay","full_name":"Salzwedel, Kay"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:02:22Z","file_id":"2305","creator":"florida","file_size":123373,"access_level":"open_access","date_created":"2018-04-12T09:02:22Z","file_name":"BSS-SPAA-02.pdf"}],"ddc":["040"],"title":"Compact, adaptive placement schemes for non-uniform requirements","user_id":"14955"},{"user_id":"15504","ddc":["040"],"title":"Algorithms for fault-tolerant routing in circuit switched networks","date_created":"2018-04-03T05:45:44Z","has_accepted_license":"1","status":"public","file":[{"access_level":"open_access","file_name":"BCKS-SPAA-02.pdf","date_created":"2018-04-12T09:03:44Z","relation":"main_file","date_updated":"2018-04-12T09:03:44Z","content_type":"application/pdf","creator":"florida","file_id":"2306","file_size":187124}],"file_date_updated":"2018-04-12T09:03:44Z","department":[{"_id":"79"}],"publication":"SPAA","author":[{"full_name":"Bagchi, Amitabha","first_name":"Amitabha","last_name":"Bagchi"},{"last_name":"Chaudhary","full_name":"Chaudhary, Amitabh","first_name":"Amitabh"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"first_name":"Petr","full_name":"Kolman, Petr","last_name":"Kolman"}],"oa":"1","urn":"21376","_id":"2137","date_updated":"2022-01-06T06:54:57Z","page":"265--274","year":"2002","type":"conference","citation":{"mla":"Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” SPAA, 2002, pp. 265--274.","bibtex":"@inproceedings{Bagchi_Chaudhary_Scheideler_Kolman_2002, title={Algorithms for fault-tolerant routing in circuit switched networks}, booktitle={SPAA}, author={Bagchi, Amitabha and Chaudhary, Amitabh and Scheideler, Christian and Kolman, Petr}, year={2002}, pages={265--274} }","chicago":"Bagchi, Amitabha, Amitabh Chaudhary, Christian Scheideler, and Petr Kolman. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” In SPAA, 265--274, 2002.","ama":"Bagchi A, Chaudhary A, Scheideler C, Kolman P. Algorithms for fault-tolerant routing in circuit switched networks. In: SPAA. ; 2002:265--274.","apa":"Bagchi, A., Chaudhary, A., Scheideler, C., & Kolman, P. (2002). Algorithms for fault-tolerant routing in circuit switched networks. In SPAA (pp. 265--274).","ieee":"A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, “Algorithms for fault-tolerant routing in circuit switched networks,” in SPAA, 2002, pp. 265--274.","short":"A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, in: SPAA, 2002, pp. 265--274."}},{"department":[{"_id":"79"}],"title":"Models and Techniques for Communication in Dynamic Networks","series_title":"Lecture Notes in Computer Science","oa":"1","date_updated":"2022-01-06T06:54:57Z","volume":2285,"date_created":"2018-04-03T05:46:38Z","has_accepted_license":"1","status":"public","file_date_updated":"2018-04-12T09:01:03Z","publication":"STACS","author":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"Springer","file":[{"file_name":"STACS-02.pdf","date_created":"2018-04-12T09:01:03Z","access_level":"open_access","file_id":"2304","creator":"florida","file_size":273875,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:01:03Z"}],"ddc":["040"],"user_id":"15504","page":"27--49","citation":{"ieee":"C. Scheideler, “Models and Techniques for Communication in Dynamic Networks,” in STACS, 2002, vol. 2285, pp. 27--49.","short":"C. Scheideler, in: STACS, Springer, 2002, pp. 27--49.","bibtex":"@inproceedings{Scheideler_2002, series={Lecture Notes in Computer Science}, title={Models and Techniques for Communication in Dynamic Networks}, volume={2285}, booktitle={STACS}, publisher={Springer}, author={Scheideler, Christian}, year={2002}, pages={27--49}, collection={Lecture Notes in Computer Science} }","mla":"Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” STACS, vol. 2285, Springer, 2002, pp. 27--49.","chicago":"Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” In STACS, 2285:27--49. Lecture Notes in Computer Science. Springer, 2002.","ama":"Scheideler C. Models and Techniques for Communication in Dynamic Networks. In: STACS. Vol 2285. Lecture Notes in Computer Science. Springer; 2002:27--49.","apa":"Scheideler, C. (2002). Models and Techniques for Communication in Dynamic Networks. In STACS (Vol. 2285, pp. 27--49). Springer."},"type":"conference","year":"2002","urn":"21386","_id":"2138","intvolume":" 2285"},{"date_updated":"2022-01-06T06:54:12Z","_id":"19790","type":"conference","year":"2003","citation":{"short":"C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, U. Rückert, in: Proceedings of SSGRR 2003, 2003.","ieee":"C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, and U. Rückert, “Storage Management as Means to cope with Exponential Information Growth,” in Proceedings of SSGRR 2003, 2003.","chicago":"Scheideler, Christian, Kay Salzwedel, Friedhelm Meyer auf der Heide, André Brinkmann, Mario Vodisek, and Ulrich Rückert. “Storage Management as Means to Cope with Exponential Information Growth.” In Proceedings of SSGRR 2003, 2003.","ama":"Scheideler C, Salzwedel K, Meyer auf der Heide F, Brinkmann A, Vodisek M, Rückert U. Storage Management as Means to cope with Exponential Information Growth. In: Proceedings of SSGRR 2003. ; 2003.","apa":"Scheideler, C., Salzwedel, K., Meyer auf der Heide, F., Brinkmann, A., Vodisek, M., & Rückert, U. (2003). Storage Management as Means to cope with Exponential Information Growth. In Proceedings of SSGRR 2003.","mla":"Scheideler, Christian, et al. “Storage Management as Means to Cope with Exponential Information Growth.” Proceedings of SSGRR 2003, 2003.","bibtex":"@inproceedings{Scheideler_Salzwedel_Meyer auf der Heide_Brinkmann_Vodisek_Rückert_2003, title={Storage Management as Means to cope with Exponential Information Growth}, booktitle={Proceedings of SSGRR 2003}, author={Scheideler, Christian and Salzwedel, Kay and Meyer auf der Heide, Friedhelm and Brinkmann, André and Vodisek, Mario and Rückert, Ulrich}, year={2003} }"},"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"The advances in Internet technology have led to tremendous improvements in business, education, and science and have changed the way we think, live, and communicate. Information exchange has become ubiquitous by the possibilities offered through modern technologies. We are able to offer information 24 hours a day through our web sites and can leave messages every time and from anywhere in the world. This change in communication has led to new challenges. Enterprises have to deal with an information amount that doubles every year. The technological foundation to cope with this information explosion is given by Storage Area Networks (SANs), which are able to connect a great number of storage systems over a fast interconnection network. However, to be able to use the benefits of a SAN, an easy-to-use and efficient management support has to be given to the storage administrator. In this paper, we will suggest new storage management concepts and we will introduce a new management environment that is able to significantly reduce management costs and increases the performance and resource utilization of the given SAN infrastructure."}],"title":"Storage Management as Means to cope with Exponential Information Growth","ddc":["000"],"user_id":"15415","department":[{"_id":"63"},{"_id":"58"},{"_id":"79"}],"publication":"Proceedings of SSGRR 2003","file_date_updated":"2020-09-30T12:03:57Z","author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Kay","full_name":"Salzwedel, Kay","last_name":"Salzwedel"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Brinkmann","first_name":"André","full_name":"Brinkmann, André"},{"full_name":"Vodisek, Mario","first_name":"Mario","last_name":"Vodisek"},{"first_name":"Ulrich","full_name":"Rückert, Ulrich","last_name":"Rückert"}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2020-09-30T12:03:57Z","creator":"koala","file_id":"19793","file_size":499057,"access_level":"closed","file_name":"pub-hni-908.pdf","date_created":"2020-09-30T12:03:57Z"}],"date_created":"2020-09-30T12:04:14Z","status":"public","has_accepted_license":"1"},{"series_title":"Lecture Notes in Computer Science","type":"conference","year":"2003","citation":{"mla":"Damerow, Valentina, et al. “Smoothed Motion Complexity.” ESA, vol. 2832, Springer, 2003, pp. 161--171, doi:10.1007/978-3-540-39658-1_17.","bibtex":"@inproceedings{Damerow_Meyer auf der Heide_Räcke_Scheideler_Sohler_2003, series={Lecture Notes in Computer Science}, title={Smoothed Motion Complexity}, volume={2832}, DOI={10.1007/978-3-540-39658-1_17}, booktitle={ESA}, publisher={Springer}, author={Damerow, Valentina and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian}, year={2003}, pages={161--171}, collection={Lecture Notes in Computer Science} }","chicago":"Damerow, Valentina, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, and Christian Sohler. “Smoothed Motion Complexity.” In ESA, 2832:161--171. Lecture Notes in Computer Science. Springer, 2003. https://doi.org/10.1007/978-3-540-39658-1_17.","apa":"Damerow, V., Meyer auf der Heide, F., Räcke, H., Scheideler, C., & Sohler, C. (2003). Smoothed Motion Complexity. In ESA (Vol. 2832, pp. 161--171). Springer. https://doi.org/10.1007/978-3-540-39658-1_17","ama":"Damerow V, Meyer auf der Heide F, Räcke H, Scheideler C, Sohler C. Smoothed Motion Complexity. In: ESA. Vol 2832. Lecture Notes in Computer Science. Springer; 2003:161--171. doi:10.1007/978-3-540-39658-1_17","ieee":"V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, and C. Sohler, “Smoothed Motion Complexity,” in ESA, 2003, vol. 2832, pp. 161--171.","short":"V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, in: ESA, Springer, 2003, pp. 161--171."},"page":"161--171","language":[{"iso":"eng"}],"_id":"2128","intvolume":" 2832","date_updated":"2022-01-06T06:54:52Z","doi":"10.1007/978-3-540-39658-1_17","publisher":"Springer","author":[{"first_name":"Valentina","full_name":"Damerow, Valentina","last_name":"Damerow"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Räcke, Harald","first_name":"Harald","last_name":"Räcke"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"ESA","volume":2832,"status":"public","date_created":"2018-04-03T05:37:10Z","title":"Smoothed Motion Complexity","user_id":"14955"},{"page":"1153--1168","year":"2003","type":"conference","citation":{"ieee":"B. Awerbuch, A. Brinkmann, and C. Scheideler, “Anycasting in Adversarial Systems: Routing and Admission Control,” in ICALP, 2003, vol. 2719, pp. 1153--1168.","short":"B. Awerbuch, A. Brinkmann, C. Scheideler, in: ICALP, Springer, 2003, pp. 1153--1168.","mla":"Awerbuch, Baruch, et al. “Anycasting in Adversarial Systems: Routing and Admission Control.” ICALP, vol. 2719, Springer, 2003, pp. 1153--1168.","bibtex":"@inproceedings{Awerbuch_Brinkmann_Scheideler_2003, series={Lecture Notes in Computer Science}, title={Anycasting in Adversarial Systems: Routing and Admission Control}, volume={2719}, booktitle={ICALP}, publisher={Springer}, author={Awerbuch, Baruch and Brinkmann, André and Scheideler, Christian}, year={2003}, pages={1153--1168}, collection={Lecture Notes in Computer Science} }","ama":"Awerbuch B, Brinkmann A, Scheideler C. Anycasting in Adversarial Systems: Routing and Admission Control. In: ICALP. Vol 2719. Lecture Notes in Computer Science. Springer; 2003:1153--1168.","apa":"Awerbuch, B., Brinkmann, A., & Scheideler, C. (2003). Anycasting in Adversarial Systems: Routing and Admission Control. In ICALP (Vol. 2719, pp. 1153--1168). Springer.","chicago":"Awerbuch, Baruch, André Brinkmann, and Christian Scheideler. “Anycasting in Adversarial Systems: Routing and Admission Control.” In ICALP, 2719:1153--1168. Lecture Notes in Computer Science. Springer, 2003."},"urn":"21297","intvolume":" 2719","_id":"2129","date_created":"2018-04-03T05:38:36Z","status":"public","has_accepted_license":"1","volume":2719,"file":[{"access_level":"open_access","file_name":"ICALP-03.pdf","date_created":"2018-04-12T09:04:48Z","content_type":"application/pdf","date_updated":"2018-04-12T09:04:48Z","relation":"main_file","file_size":154427,"creator":"florida","file_id":"2307"}],"file_date_updated":"2018-04-12T09:04:48Z","publication":"ICALP","publisher":"Springer","author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"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"],"language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","oa":"1","date_updated":"2022-01-06T06:54:53Z","department":[{"_id":"79"},{"_id":"63"}],"title":"Anycasting in Adversarial Systems: Routing and Admission Control"},{"user_id":"15504","ddc":["040"],"title":"Peer-to-peer systems for prefix search","has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:39:48Z","file":[{"file_name":"PODC-03.pdf","date_created":"2018-04-12T09:10:10Z","access_level":"open_access","file_id":"2308","creator":"florida","file_size":127013,"relation":"main_file","date_updated":"2018-04-12T09:10:10Z","content_type":"application/pdf"}],"publisher":"ACM","author":[{"last_name":"Awerbuch","full_name":"Awerbuch, Baruch","first_name":"Baruch"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"department":[{"_id":"79"}],"publication":"PODC","file_date_updated":"2018-04-12T09:10:10Z","oa":"1","_id":"2130","date_updated":"2022-01-06T06:54:53Z","urn":"21303","type":"conference","citation":{"ieee":"B. Awerbuch and C. Scheideler, “Peer-to-peer systems for prefix search,” in PODC, 2003, pp. 123--132.","short":"B. Awerbuch, C. Scheideler, in: PODC, ACM, 2003, pp. 123--132.","bibtex":"@inproceedings{Awerbuch_Scheideler_2003, title={Peer-to-peer systems for prefix search}, booktitle={PODC}, publisher={ACM}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2003}, pages={123--132} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” PODC, ACM, 2003, pp. 123--132.","apa":"Awerbuch, B., & Scheideler, C. (2003). Peer-to-peer systems for prefix search. In PODC (pp. 123--132). ACM.","ama":"Awerbuch B, Scheideler C. Peer-to-peer systems for prefix search. In: PODC. ACM; 2003:123--132.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” In PODC, 123--132. ACM, 2003."},"year":"2003","page":"123--132"},{"year":"2003","type":"conference","citation":{"short":"A. Czumaj, C. Riley, C. Scheideler, in: RANDOM-APPROX, Springer, 2003, pp. 240--251.","ieee":"A. Czumaj, C. Riley, and C. Scheideler, “Perfectly Balanced Allocation,” in RANDOM-APPROX, 2003, vol. 2764, pp. 240--251.","ama":"Czumaj A, Riley C, Scheideler C. Perfectly Balanced Allocation. In: RANDOM-APPROX. Vol 2764. Lecture Notes in Computer Science. Springer; 2003:240--251.","apa":"Czumaj, A., Riley, C., & Scheideler, C. (2003). Perfectly Balanced Allocation. In RANDOM-APPROX (Vol. 2764, pp. 240--251). Springer.","chicago":"Czumaj, Artur, Chris Riley, and Christian Scheideler. “Perfectly Balanced Allocation.” In RANDOM-APPROX, 2764:240--251. Lecture Notes in Computer Science. Springer, 2003.","mla":"Czumaj, Artur, et al. “Perfectly Balanced Allocation.” RANDOM-APPROX, vol. 2764, Springer, 2003, pp. 240--251.","bibtex":"@inproceedings{Czumaj_Riley_Scheideler_2003, series={Lecture Notes in Computer Science}, title={Perfectly Balanced Allocation}, volume={2764}, booktitle={RANDOM-APPROX}, publisher={Springer}, author={Czumaj, Artur and Riley, Chris and Scheideler, Christian}, year={2003}, pages={240--251}, collection={Lecture Notes in Computer Science} }"},"page":"240--251","_id":"2131","intvolume":" 2764","urn":"21313","file":[{"file_id":"2310","creator":"florida","file_size":112587,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:16:17Z","file_name":"RANDOM-03.pdf","date_created":"2018-04-12T09:16:17Z","access_level":"open_access"}],"publisher":"Springer","author":[{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"},{"last_name":"Riley","first_name":"Chris","full_name":"Riley, Chris"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publication":"RANDOM-APPROX","file_date_updated":"2018-04-12T09:16:17Z","has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:41:01Z","volume":2764,"user_id":"15504","ddc":["040"],"series_title":"Lecture Notes in Computer Science","date_updated":"2022-01-06T06:54:54Z","oa":"1","department":[{"_id":"79"}],"title":"Perfectly Balanced Allocation"},{"date_created":"2018-04-03T05:41:53Z","status":"public","has_accepted_license":"1","department":[{"_id":"79"}],"publication":"SPAA","file_date_updated":"2018-04-12T09:18:55Z","author":[{"last_name":"Jia","full_name":"Jia, Lujun","first_name":"Lujun"},{"last_name":"Rajaraman","first_name":"Rajmohan","full_name":"Rajaraman, Rajmohan"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publisher":"ACM","file":[{"file_size":224200,"creator":"florida","file_id":"2311","content_type":"application/pdf","date_updated":"2018-04-12T09:18:55Z","relation":"main_file","file_name":"JRS-SPAA-03.pdf","date_created":"2018-04-12T09:18:55Z","access_level":"open_access"}],"title":"On local algorithms for topology control and routing in ad hoc networks","ddc":["040"],"user_id":"15504","page":"220--229","year":"2003","citation":{"chicago":"Jia, Lujun, Rajmohan Rajaraman, and Christian Scheideler. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” In SPAA, 220--229. ACM, 2003.","apa":"Jia, L., Rajaraman, R., & Scheideler, C. (2003). On local algorithms for topology control and routing in ad hoc networks. In SPAA (pp. 220--229). ACM.","ama":"Jia L, Rajaraman R, Scheideler C. On local algorithms for topology control and routing in ad hoc networks. In: SPAA. ACM; 2003:220--229.","mla":"Jia, Lujun, et al. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” SPAA, ACM, 2003, pp. 220--229.","bibtex":"@inproceedings{Jia_Rajaraman_Scheideler_2003, title={On local algorithms for topology control and routing in ad hoc networks}, booktitle={SPAA}, publisher={ACM}, author={Jia, Lujun and Rajaraman, Rajmohan and Scheideler, Christian}, year={2003}, pages={220--229} }","short":"L. Jia, R. Rajaraman, C. Scheideler, in: SPAA, ACM, 2003, pp. 220--229.","ieee":"L. Jia, R. Rajaraman, and C. Scheideler, “On local algorithms for topology control and routing in ad hoc networks,” in SPAA, 2003, pp. 220--229."},"type":"conference","oa":"1","urn":"21320","date_updated":"2022-01-06T06:54:54Z","_id":"2132"},{"title":"Information gathering in adversarial systems: lines and cycles","ddc":["040"],"user_id":"15504","author":[{"full_name":"Kothapalli, Kishore","first_name":"Kishore","last_name":"Kothapalli"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publisher":"ACM","file_date_updated":"2018-04-12T09:15:24Z","department":[{"_id":"79"}],"publication":"SPAA","file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:15:24Z","file_id":"2309","creator":"florida","file_size":121448,"access_level":"open_access","file_name":"KS-SPAA-03.pdf","date_created":"2018-04-12T09:13:43Z"}],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:42:48Z","date_updated":"2022-01-06T06:54:55Z","_id":"2133","urn":"21338","oa":"1","type":"conference","year":"2003","citation":{"short":"K. Kothapalli, C. Scheideler, in: SPAA, ACM, 2003, pp. 333--342.","ieee":"K. Kothapalli and C. Scheideler, “Information gathering in adversarial systems: lines and cycles,” in SPAA, 2003, pp. 333--342.","ama":"Kothapalli K, Scheideler C. Information gathering in adversarial systems: lines and cycles. In: SPAA. ACM; 2003:333--342.","apa":"Kothapalli, K., & Scheideler, C. (2003). Information gathering in adversarial systems: lines and cycles. In SPAA (pp. 333--342). ACM.","chicago":"Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial Systems: Lines and Cycles.” In SPAA, 333--342. ACM, 2003.","mla":"Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial Systems: Lines and Cycles.” SPAA, ACM, 2003, pp. 333--342.","bibtex":"@inproceedings{Kothapalli_Scheideler_2003, title={Information gathering in adversarial systems: lines and cycles}, booktitle={SPAA}, publisher={ACM}, author={Kothapalli, Kishore and Scheideler, Christian}, year={2003}, pages={333--342} }"},"page":"333--342"},{"date_created":"2018-04-03T05:30:23Z","status":"public","department":[{"_id":"79"}],"publication":"Algorithmica","author":[{"last_name":"Kolman","full_name":"Kolman, Petr","first_name":"Petr"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"user_id":"15504","title":"Simple On-Line Algorithms for the Maximum Disjoint Paths Problem","page":"209--233","year":"2004","type":"journal_article","citation":{"ieee":"P. Kolman and C. Scheideler, “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem,” Algorithmica, no. 3, pp. 209--233, 2004.","short":"P. Kolman, C. Scheideler, Algorithmica (2004) 209--233.","mla":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” Algorithmica, no. 3, 2004, pp. 209--233, doi:10.1007/s00453-004-1086-1.","bibtex":"@article{Kolman_Scheideler_2004, title={Simple On-Line Algorithms for the Maximum Disjoint Paths Problem}, DOI={10.1007/s00453-004-1086-1}, number={3}, journal={Algorithmica}, author={Kolman, Petr and Scheideler, Christian}, year={2004}, pages={209--233} }","chicago":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” Algorithmica, no. 3 (2004): 209--233. https://doi.org/10.1007/s00453-004-1086-1.","ama":"Kolman P, Scheideler C. Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. Algorithmica. 2004;(3):209--233. doi:10.1007/s00453-004-1086-1","apa":"Kolman, P., & Scheideler, C. (2004). Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. Algorithmica, (3), 209--233. https://doi.org/10.1007/s00453-004-1086-1"},"issue":"3","doi":"10.1007/s00453-004-1086-1","_id":"2119","date_updated":"2022-01-06T06:54:49Z"},{"date_updated":"2022-01-06T06:54:49Z","oa":"1","series_title":"Lecture Notes in Computer Science","title":"Group Spreading: A Protocol for Provably Secure Distributed Name Service","department":[{"_id":"79"}],"intvolume":" 3142","_id":"2120","urn":"21200","type":"conference","citation":{"apa":"Awerbuch, B., & Scheideler, C. (2004). Group Spreading: A Protocol for Provably Secure Distributed Name Service. In ICALP (Vol. 3142, pp. 183--195).","ama":"Awerbuch B, Scheideler C. Group Spreading: A Protocol for Provably Secure Distributed Name Service. In: ICALP. Vol 3142. Lecture Notes in Computer Science. ; 2004:183--195.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Group Spreading: A Protocol for Provably Secure Distributed Name Service.” In ICALP, 3142:183--195. Lecture Notes in Computer Science, 2004.","mla":"Awerbuch, Baruch, and Christian Scheideler. “Group Spreading: A Protocol for Provably Secure Distributed Name Service.” ICALP, vol. 3142, 2004, pp. 183--195.","bibtex":"@inproceedings{Awerbuch_Scheideler_2004, series={Lecture Notes in Computer Science}, title={Group Spreading: A Protocol for Provably Secure Distributed Name Service}, volume={3142}, booktitle={ICALP}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={183--195}, collection={Lecture Notes in Computer Science} }","short":"B. Awerbuch, C. Scheideler, in: ICALP, 2004, pp. 183--195.","ieee":"B. Awerbuch and C. Scheideler, “Group Spreading: A Protocol for Provably Secure Distributed Name Service,” in ICALP, 2004, vol. 3142, pp. 183--195."},"year":"2004","page":"183--195","ddc":["040"],"user_id":"15504","author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file_date_updated":"2018-04-12T09:20:16Z","publication":"ICALP","file":[{"content_type":"application/pdf","date_updated":"2018-04-12T09:20:16Z","relation":"main_file","file_size":145383,"creator":"florida","file_id":"2312","access_level":"open_access","file_name":"ICALP-04.pdf","date_created":"2018-04-12T09:20:16Z"}],"volume":3142,"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:31:04Z"},{"title":"A Distributed Hash Table for Computational Grids","ddc":["040"],"user_id":"15504","author":[{"last_name":"Riley","full_name":"Riley, Chris","first_name":"Chris"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file_date_updated":"2018-04-12T09:50:26Z","department":[{"_id":"79"}],"publication":"IPDPS","file":[{"creator":"florida","file_id":"2316","file_size":91542,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:50:26Z","file_name":"IPDPS-04.pdf","date_created":"2018-04-12T09:50:26Z","access_level":"open_access"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:31:59Z","date_updated":"2022-01-06T06:54:50Z","_id":"2121","urn":"21212","oa":"1","citation":{"mla":"Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational Grids.” IPDPS, 2004.","bibtex":"@inproceedings{Riley_Scheideler_2004, title={A Distributed Hash Table for Computational Grids}, booktitle={IPDPS}, author={Riley, Chris and Scheideler, Christian}, year={2004} }","chicago":"Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational Grids.” In IPDPS, 2004.","apa":"Riley, C., & Scheideler, C. (2004). A Distributed Hash Table for Computational Grids. In IPDPS.","ama":"Riley C, Scheideler C. A Distributed Hash Table for Computational Grids. In: IPDPS. ; 2004.","ieee":"C. Riley and C. Scheideler, “A Distributed Hash Table for Computational Grids,” in IPDPS, 2004.","short":"C. Riley, C. Scheideler, in: IPDPS, 2004."},"type":"conference","year":"2004"},{"oa":"1","date_updated":"2022-01-06T06:54:50Z","series_title":"Lecture Notes in Computer Science","title":"Robust Distributed Name Service","department":[{"_id":"79"}],"urn":"21229","_id":"2122","intvolume":" 3279","page":"237--249","type":"conference","citation":{"ieee":"B. Awerbuch and C. Scheideler, “Robust Distributed Name Service,” in IPTPS, 2004, vol. 3279, pp. 237--249.","short":"B. Awerbuch, C. Scheideler, in: IPTPS, 2004, pp. 237--249.","bibtex":"@inproceedings{Awerbuch_Scheideler_2004, series={Lecture Notes in Computer Science}, title={Robust Distributed Name Service}, volume={3279}, booktitle={IPTPS}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={237--249}, collection={Lecture Notes in Computer Science} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.” IPTPS, vol. 3279, 2004, pp. 237--249.","apa":"Awerbuch, B., & Scheideler, C. (2004). Robust Distributed Name Service. In IPTPS (Vol. 3279, pp. 237--249).","ama":"Awerbuch B, Scheideler C. Robust Distributed Name Service. In: IPTPS. Vol 3279. Lecture Notes in Computer Science. ; 2004:237--249.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.” In IPTPS, 3279:237--249. Lecture Notes in Computer Science, 2004."},"year":"2004","ddc":["040"],"user_id":"15504","volume":3279,"date_created":"2018-04-03T05:32:33Z","status":"public","has_accepted_license":"1","publication":"IPTPS","file_date_updated":"2018-04-12T11:39:38Z","author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file":[{"creator":"florida","file_id":"2318","file_size":136987,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T11:39:38Z","date_created":"2018-04-12T11:39:38Z","file_name":"IPTPS-04.pdf","access_level":"open_access"}]},{"user_id":"15504","ddc":["040"],"title":"Survivable Monitoring in Dynamic Networks","file":[{"file_size":255111,"creator":"florida","file_id":"2317","content_type":"application/pdf","date_updated":"2018-04-12T11:38:22Z","relation":"main_file","file_name":"IIAW-04.pdf","date_created":"2018-04-12T11:38:22Z","access_level":"open_access"}],"publication":"IWIA","department":[{"_id":"79"}],"file_date_updated":"2018-04-12T11:38:22Z","author":[{"last_name":"Ateniese","full_name":"Ateniese, Giuseppe","first_name":"Giuseppe"},{"full_name":"Riley, Chris","first_name":"Chris","last_name":"Riley"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"date_created":"2018-04-03T05:33:37Z","has_accepted_license":"1","status":"public","urn":"21238","date_updated":"2022-01-06T06:54:50Z","_id":"2123","oa":"1","page":"33--47","year":"2004","type":"conference","citation":{"mla":"Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.” IWIA, 2004, pp. 33--47.","bibtex":"@inproceedings{Ateniese_Riley_Scheideler_2004, title={Survivable Monitoring in Dynamic Networks}, booktitle={IWIA}, author={Ateniese, Giuseppe and Riley, Chris and Scheideler, Christian}, year={2004}, pages={33--47} }","chicago":"Ateniese, Giuseppe, Chris Riley, and Christian Scheideler. “Survivable Monitoring in Dynamic Networks.” In IWIA, 33--47, 2004.","apa":"Ateniese, G., Riley, C., & Scheideler, C. (2004). Survivable Monitoring in Dynamic Networks. In IWIA (pp. 33--47).","ama":"Ateniese G, Riley C, Scheideler C. Survivable Monitoring in Dynamic Networks. In: IWIA. ; 2004:33--47.","ieee":"G. Ateniese, C. Riley, and C. Scheideler, “Survivable Monitoring in Dynamic Networks,” in IWIA, 2004, pp. 33--47.","short":"G. Ateniese, C. Riley, C. Scheideler, in: IWIA, 2004, pp. 33--47."}},{"urn":"21247","date_updated":"2022-01-06T06:54:51Z","_id":"2124","oa":"1","page":"318--327","year":"2004","citation":{"chicago":"Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments.” In SODA, 318--327, 2004.","apa":"Awerbuch, B., & Scheideler, C. (2004). The hyperring: a low-congestion deterministic data structure for distributed environments. In SODA (pp. 318--327).","ama":"Awerbuch B, Scheideler C. The hyperring: a low-congestion deterministic data structure for distributed environments. In: SODA. ; 2004:318--327.","mla":"Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments.” SODA, 2004, pp. 318--327.","bibtex":"@inproceedings{Awerbuch_Scheideler_2004, title={The hyperring: a low-congestion deterministic data structure for distributed environments}, booktitle={SODA}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={318--327} }","short":"B. Awerbuch, C. Scheideler, in: SODA, 2004, pp. 318--327.","ieee":"B. Awerbuch and C. Scheideler, “The hyperring: a low-congestion deterministic data structure for distributed environments,” in SODA, 2004, pp. 318--327."},"type":"conference","user_id":"15504","ddc":["040"],"title":"The hyperring: a low-congestion deterministic data structure for distributed environments","file":[{"relation":"main_file","date_updated":"2018-04-13T08:36:08Z","content_type":"application/pdf","file_id":"2323","creator":"florida","file_size":193831,"access_level":"open_access","file_name":"SODA-04.pdf","date_created":"2018-04-13T08:36:08Z"}],"publication":"SODA","department":[{"_id":"79"}],"file_date_updated":"2018-04-13T08:36:08Z","author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"date_created":"2018-04-03T05:34:17Z","status":"public","has_accepted_license":"1"},{"oa":"1","urn":"21256","_id":"2125","date_updated":"2022-01-06T06:54:51Z","page":"44--53","type":"conference","year":"2004","citation":{"ieee":"B. Awerbuch and C. Scheideler, “Consistent and compact data management in distributed storage systems,” in SPAA, 2004, pp. 44--53.","short":"B. Awerbuch, C. Scheideler, in: SPAA, 2004, pp. 44--53.","mla":"Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data Management in Distributed Storage Systems.” SPAA, 2004, pp. 44--53.","bibtex":"@inproceedings{Awerbuch_Scheideler_2004, title={Consistent and compact data management in distributed storage systems}, booktitle={SPAA}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={44--53} }","apa":"Awerbuch, B., & Scheideler, C. (2004). Consistent and compact data management in distributed storage systems. In SPAA (pp. 44--53).","ama":"Awerbuch B, Scheideler C. Consistent and compact data management in distributed storage systems. In: SPAA. ; 2004:44--53.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data Management in Distributed Storage Systems.” In SPAA, 44--53, 2004."},"title":"Consistent and compact data management in distributed storage systems","ddc":["040"],"user_id":"15504","date_created":"2018-04-03T05:34:56Z","status":"public","has_accepted_license":"1","department":[{"_id":"79"}],"publication":"SPAA","file_date_updated":"2018-04-12T09:41:38Z","author":[{"last_name":"Awerbuch","full_name":"Awerbuch, Baruch","first_name":"Baruch"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file":[{"file_name":"AS-SPAA-04.pdf","date_created":"2018-04-12T09:41:38Z","access_level":"open_access","file_size":170429,"creator":"florida","file_id":"2315","content_type":"application/pdf","date_updated":"2018-04-12T09:41:38Z","relation":"main_file"}]},{"urn":"21266","date_updated":"2022-01-06T06:54:52Z","_id":"2126","oa":"1","page":"170--179","year":"2004","type":"conference","citation":{"ieee":"A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, and M. Thober, “Pagoda: a dynamic overlay network for routing, data management, and multicasting,” in SPAA, 2004, pp. 170--179.","short":"A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, M. Thober, in: SPAA, 2004, pp. 170--179.","bibtex":"@inproceedings{Bhargava_Kothapalli_Riley_Scheideler_Thober_2004, title={Pagoda: a dynamic overlay network for routing, data management, and multicasting}, booktitle={SPAA}, author={Bhargava, Ankur and Kothapalli, Kishore and Riley, Chris and Scheideler, Christian and Thober, Mark}, year={2004}, pages={170--179} }","mla":"Bhargava, Ankur, et al. “Pagoda: A Dynamic Overlay Network for Routing, Data Management, and Multicasting.” SPAA, 2004, pp. 170--179.","ama":"Bhargava A, Kothapalli K, Riley C, Scheideler C, Thober M. Pagoda: a dynamic overlay network for routing, data management, and multicasting. In: SPAA. ; 2004:170--179.","apa":"Bhargava, A., Kothapalli, K., Riley, C., Scheideler, C., & Thober, M. (2004). Pagoda: a dynamic overlay network for routing, data management, and multicasting. In SPAA (pp. 170--179).","chicago":"Bhargava, Ankur, Kishore Kothapalli, Chris Riley, Christian Scheideler, and Mark Thober. “Pagoda: A Dynamic Overlay Network for Routing, Data Management, and Multicasting.” In SPAA, 170--179, 2004."},"ddc":["040"],"title":"Pagoda: a dynamic overlay network for routing, data management, and multicasting","user_id":"15504","department":[{"_id":"79"}],"file_date_updated":"2018-04-12T09:40:42Z","publication":"SPAA","author":[{"full_name":"Bhargava, Ankur","first_name":"Ankur","last_name":"Bhargava"},{"last_name":"Kothapalli","first_name":"Kishore","full_name":"Kothapalli, Kishore"},{"first_name":"Chris","full_name":"Riley, Chris","last_name":"Riley"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Mark","full_name":"Thober, Mark","last_name":"Thober"}],"file":[{"access_level":"open_access","file_name":"BKRST-SPAA-04.pdf","date_created":"2018-04-12T09:40:12Z","relation":"main_file","date_updated":"2018-04-12T09:40:42Z","content_type":"application/pdf","file_id":"2314","creator":"florida","file_size":118175}],"date_created":"2018-04-03T05:35:31Z","has_accepted_license":"1","status":"public"},{"user_id":"15504","ddc":["040"],"title":"The effect of faults on network expansion","has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:36:11Z","file":[{"file_id":"2313","creator":"florida","file_size":197503,"relation":"main_file","date_updated":"2018-04-12T09:21:24Z","content_type":"application/pdf","date_created":"2018-04-12T09:21:24Z","file_name":"BBCES-SPAA-04.pdf","access_level":"open_access"}],"publisher":"ACM","author":[{"first_name":"Amitabha","full_name":"Bagchi, Amitabha","last_name":"Bagchi"},{"full_name":"Bhargava, Ankur","first_name":"Ankur","last_name":"Bhargava"},{"first_name":"Amitabh","full_name":"Chaudhary, Amitabh","last_name":"Chaudhary"},{"full_name":"Eppstein, David","first_name":"David","last_name":"Eppstein"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file_date_updated":"2018-04-12T09:21:24Z","publication":"SPAA","department":[{"_id":"79"}],"oa":"1","date_updated":"2022-01-06T06:54:52Z","_id":"2127","urn":"21276","type":"conference","citation":{"apa":"Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., & Scheideler, C. (2004). The effect of faults on network expansion. In SPAA (pp. 286--293). ACM.","ama":"Bagchi A, Bhargava A, Chaudhary A, Eppstein D, Scheideler C. The effect of faults on network expansion. In: SPAA. ACM; 2004:286--293.","chicago":"Bagchi, Amitabha, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, and Christian Scheideler. “The Effect of Faults on Network Expansion.” In SPAA, 286--293. ACM, 2004.","bibtex":"@inproceedings{Bagchi_Bhargava_Chaudhary_Eppstein_Scheideler_2004, title={The effect of faults on network expansion}, booktitle={SPAA}, publisher={ACM}, author={Bagchi, Amitabha and Bhargava, Ankur and Chaudhary, Amitabh and Eppstein, David and Scheideler, Christian}, year={2004}, pages={286--293} }","mla":"Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” SPAA, ACM, 2004, pp. 286--293.","short":"A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, in: SPAA, ACM, 2004, pp. 286--293.","ieee":"A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler, “The effect of faults on network expansion,” in SPAA, 2004, pp. 286--293."},"year":"2004","page":"286--293"}]