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