--- _id: '2147' author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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} }' 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.' 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.' 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.' date_created: 2018-04-03T06:16:48Z 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:36:17Z date_updated: 2018-04-12T08:36:17Z file_id: '2295' file_name: SODA-00.pdf file_size: 185001 relation: main_file file_date_updated: 2018-04-12T08:36:17Z has_accepted_license: '1' language: - iso: eng oa: '1' page: 30--39 publication: SODA status: public title: 'Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma' type: conference urn: '21476' user_id: '14955' year: '2000' ... --- _id: '2148' author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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.' 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} }' 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.' 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.' 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.' short: A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237. date_created: 2018-04-03T06:17:52Z date_updated: 2022-01-06T06:55:00Z department: - _id: '79' - _id: '63' intvolume: ' 17' issue: 3-4 language: - iso: eng page: 213--237 publication: Random Struct. Algorithms status: public title: 'Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma' type: journal_article user_id: '14955' volume: 17 year: '2000' ... --- _id: '2149' author: - first_name: André full_name: Brinkmann, André last_name: Brinkmann - first_name: Kay full_name: Salzwedel, Kay last_name: Salzwedel - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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). 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} }' chicago: Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” In SPAA, 119--128, 2000. 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. mla: Brinkmann, André, et al. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” SPAA, 2000, pp. 119--128. short: 'A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.' date_created: 2018-04-03T06:18:45Z date_updated: 2022-01-06T06:55:02Z ddc: - '040' department: - _id: '79' - _id: '63' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T08:38:13Z date_updated: 2018-04-12T08:38:13Z file_id: '2297' file_name: spaa_00.pdf file_size: 222176 relation: main_file file_date_updated: 2018-04-12T08:38:13Z has_accepted_license: '1' language: - iso: eng oa: '1' page: 119--128 publication: SPAA status: public title: Efficient, distributed data placement strategies for storage area networks (extended abstract) type: conference urn: '21493' user_id: '14955' year: '2000' ... --- _id: '2150' author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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. 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} }' 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. 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. short: 'A. Czumaj, C. Scheideler, in: STOC, ACM, 2000, pp. 38--47.' date_created: 2018-04-03T06:21:11Z date_updated: 2022-01-06T06:55:02Z ddc: - '040' department: - _id: '79' - _id: '63' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T08:49:23Z date_updated: 2018-04-12T08:49:23Z file_id: '2300' file_name: STOC-00.pdf file_size: 190083 relation: main_file file_date_updated: 2018-04-12T08:49:23Z has_accepted_license: '1' language: - iso: eng oa: '1' page: 38--47 publication: STOC publisher: ACM status: public title: A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract) type: conference urn: '21509' user_id: '14955' year: '2000' ... --- _id: '2211' author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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} }' 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. 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. 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.' date_created: 2018-04-05T07:02:46Z 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:37:23Z date_updated: 2018-04-12T08:37:23Z file_id: '2296' file_name: STOC-00.pdf file_size: 190083 relation: main_file file_date_updated: 2018-04-12T08:37:23Z has_accepted_license: '1' language: - iso: eng oa: '1' page: 38-47 publication: 32nd ACM Symposium on Theory of Computing status: public title: 'A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ' type: conference urn: '22111' user_id: '14955' year: '2000' ... --- _id: '2139' 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. 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' 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.' 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.' 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.' short: F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138. date_created: 2018-04-03T05:47:20Z date_updated: 2022-01-06T06:54:57Z department: - _id: '79' - _id: '63' doi: 10.1007/s004930170007 intvolume: ' 21' issue: '1' language: - iso: eng page: 95--138 publication: Combinatorica status: public title: 'Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols' type: journal_article user_id: '14955' volume: 21 year: '2001' ... --- _id: '2140' author: - first_name: Baruch full_name: Awerbuch, Baruch last_name: Awerbuch - 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: 'Awerbuch B, Berenbrink P, Brinkmann A, Scheideler C. Simple Routing Strategies for Adversarial Systems. In: FOCS. IEEE Computer Society; 2001:158--167.' apa: Awerbuch, B., Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). Simple Routing Strategies for Adversarial Systems. In FOCS (pp. 158--167). IEEE Computer Society. 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} }' chicago: Awerbuch, Baruch, Petra Berenbrink, André Brinkmann, and Christian Scheideler. “Simple Routing Strategies for Adversarial Systems.” In FOCS, 158--167. IEEE Computer Society, 2001. ieee: B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler, “Simple Routing Strategies for Adversarial Systems,” in FOCS, 2001, pp. 158--167. mla: Awerbuch, Baruch, et al. “Simple Routing Strategies for Adversarial Systems.” FOCS, IEEE Computer Society, 2001, pp. 158--167. short: 'B. Awerbuch, P. Berenbrink, A. Brinkmann, C. Scheideler, in: FOCS, IEEE Computer Society, 2001, pp. 158--167.' date_created: 2018-04-03T05:48:28Z date_updated: 2022-01-06T06:54:59Z ddc: - '040' department: - _id: '79' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T08:59:00Z date_updated: 2018-04-12T08:59:00Z file_id: '2302' file_name: FOCS-01.pdf file_size: 151156 relation: main_file file_date_updated: 2018-04-12T08:59:00Z has_accepted_license: '1' oa: '1' page: 158--167 publication: FOCS publisher: IEEE Computer Society status: public title: Simple Routing Strategies for Adversarial Systems type: conference urn: '21406' user_id: '15504' year: '2001' ... --- _id: '2141' 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. SIMLAB-A Simulation Environment for Storage Area Networks. In: PDP. IEEE Computer Society; 2001:227--234.' apa: Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). SIMLAB-A Simulation Environment for Storage Area Networks. In PDP (pp. 227--234). IEEE Computer Society. 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} }' chicago: Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “SIMLAB-A Simulation Environment for Storage Area Networks.” In PDP, 227--234. IEEE Computer Society, 2001. ieee: P. Berenbrink, A. Brinkmann, and C. Scheideler, “SIMLAB-A Simulation Environment for Storage Area Networks,” in PDP, 2001, pp. 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.' date_created: 2018-04-03T05:49:21Z date_updated: 2022-01-06T06:54:59Z ddc: - '040' department: - _id: '79' - _id: '63' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T08:39:01Z date_updated: 2018-04-12T08:39:01Z file_id: '2298' file_name: PDP-00.pdf file_size: 85778 relation: main_file file_date_updated: 2018-04-12T08:39:01Z has_accepted_license: '1' language: - iso: eng oa: '1' page: 227--234 publication: PDP publisher: IEEE Computer Society status: public title: SIMLAB-A Simulation Environment for Storage Area Networks type: conference urn: '21415' user_id: '14955' year: '2001' ... --- _id: '2142' author: - first_name: Petr full_name: Kolman, Petr last_name: Kolman - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler 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). 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} }' chicago: Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” In SPAA, 38--47, 2001. ieee: P. Kolman and C. Scheideler, “Simple on-line algorithms for the maximum disjoint paths problem,” in SPAA, 2001, pp. 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.' date_created: 2018-04-03T05:50:16Z date_updated: 2022-01-06T06:54:59Z ddc: - '040' department: - _id: '79' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T08:58:07Z date_updated: 2018-04-12T08:58:07Z file_id: '2301' file_name: SPAA-01.pdf file_size: 335171 relation: main_file file_date_updated: 2018-04-12T08:58:07Z has_accepted_license: '1' oa: '1' page: 38--47 publication: SPAA status: public title: Simple on-line algorithms for the maximum disjoint paths problem type: conference urn: '21421' user_id: '15504' year: '2001' ... --- _id: '2134' 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. 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} }' 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.' ieee: U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling,” Combinatorica, no. 3, pp. 361--399, 2002. mla: Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling.” Combinatorica, no. 3, 2002, pp. 361--399, doi:10.1007/s004930200018. short: U. Feige, C. Scheideler, Combinatorica (2002) 361--399. date_created: 2018-04-03T05:43:36Z date_updated: 2022-01-06T06:54:55Z department: - _id: '79' doi: 10.1007/s004930200018 issue: '3' page: 361--399 publication: Combinatorica status: public title: Improved Bounds for Acyclic Job Shop Scheduling type: journal_article user_id: '15504' year: '2002' ... --- _id: '2135' author: - first_name: Petr full_name: Kolman, Petr last_name: Kolman - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem. In: SODA. ACM/SIAM; 2002:184--193.' apa: Kolman, P., & Scheideler, C. (2002). Improved bounds for the unsplittable flow problem. In SODA (pp. 184--193). ACM/SIAM. 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} }' chicago: Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” In SODA, 184--193. ACM/SIAM, 2002. ieee: P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,” in SODA, 2002, pp. 184--193. mla: Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” SODA, ACM/SIAM, 2002, pp. 184--193. short: 'P. Kolman, C. Scheideler, in: SODA, ACM/SIAM, 2002, pp. 184--193.' date_created: 2018-04-03T05:44:11Z date_updated: 2022-01-06T06:54:55Z ddc: - '040' department: - _id: '79' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T08:59:58Z date_updated: 2018-04-12T08:59:58Z file_id: '2303' file_name: SODA-02.pdf file_size: 246604 relation: main_file file_date_updated: 2018-04-12T08:59:58Z has_accepted_license: '1' oa: '1' page: 184--193 publication: SODA publisher: ACM/SIAM status: public title: Improved bounds for the unsplittable flow problem type: conference urn: '21357' user_id: '15504' year: '2002' ... --- _id: '2136' author: - first_name: André full_name: Brinkmann, André last_name: Brinkmann - first_name: Kay full_name: Salzwedel, Kay last_name: Salzwedel - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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). 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} }' chicago: Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” In SPAA, 53--62, 2002. ieee: A. Brinkmann, K. Salzwedel, and C. Scheideler, “Compact, adaptive placement schemes for non-uniform requirements,” in SPAA, 2002, pp. 53--62. mla: Brinkmann, André, et al. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” SPAA, 2002, pp. 53--62. short: 'A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2002, pp. 53--62.' date_created: 2018-04-03T05:44:56Z date_updated: 2022-01-06T06:54:56Z ddc: - '040' department: - _id: '79' - _id: '63' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T09:02:22Z date_updated: 2018-04-12T09:02:22Z file_id: '2305' file_name: BSS-SPAA-02.pdf file_size: 123373 relation: main_file file_date_updated: 2018-04-12T09:02:22Z has_accepted_license: '1' language: - iso: eng oa: '1' page: 53--62 publication: SPAA status: public title: Compact, adaptive placement schemes for non-uniform requirements type: conference urn: '21366' user_id: '14955' year: '2002' ... --- _id: '2137' author: - first_name: Amitabha full_name: Bagchi, Amitabha last_name: Bagchi - first_name: Amitabh full_name: Chaudhary, Amitabh last_name: Chaudhary - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Petr full_name: Kolman, Petr last_name: Kolman citation: 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). 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. 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. mla: Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” SPAA, 2002, pp. 265--274. short: 'A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, in: SPAA, 2002, pp. 265--274.' date_created: 2018-04-03T05:45:44Z date_updated: 2022-01-06T06:54:57Z ddc: - '040' department: - _id: '79' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T09:03:44Z date_updated: 2018-04-12T09:03:44Z file_id: '2306' file_name: BCKS-SPAA-02.pdf file_size: 187124 relation: main_file file_date_updated: 2018-04-12T09:03:44Z has_accepted_license: '1' oa: '1' page: 265--274 publication: SPAA status: public title: Algorithms for fault-tolerant routing in circuit switched networks type: conference urn: '21376' user_id: '15504' year: '2002' ... --- _id: '2138' author: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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. 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} }' chicago: Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” In STACS, 2285:27--49. Lecture Notes in Computer Science. Springer, 2002. ieee: C. Scheideler, “Models and Techniques for Communication in Dynamic Networks,” in STACS, 2002, vol. 2285, pp. 27--49. mla: Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” STACS, vol. 2285, Springer, 2002, pp. 27--49. short: 'C. Scheideler, in: STACS, Springer, 2002, pp. 27--49.' date_created: 2018-04-03T05:46:38Z date_updated: 2022-01-06T06:54:57Z ddc: - '040' department: - _id: '79' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T09:01:03Z date_updated: 2018-04-12T09:01:03Z file_id: '2304' file_name: STACS-02.pdf file_size: 273875 relation: main_file file_date_updated: 2018-04-12T09:01:03Z has_accepted_license: '1' intvolume: ' 2285' oa: '1' page: 27--49 publication: STACS publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Models and Techniques for Communication in Dynamic Networks type: conference urn: '21386' user_id: '15504' volume: 2285 year: '2002' ... --- _id: '19790' 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. author: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Kay full_name: Salzwedel, Kay last_name: Salzwedel - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: André full_name: Brinkmann, André last_name: Brinkmann - first_name: Mario full_name: Vodisek, Mario last_name: Vodisek - first_name: Ulrich full_name: Rückert, Ulrich last_name: Rückert citation: 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. 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} }' 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. 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. mla: Scheideler, Christian, et al. “Storage Management as Means to Cope with Exponential Information Growth.” Proceedings of SSGRR 2003, 2003. short: 'C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, U. Rückert, in: Proceedings of SSGRR 2003, 2003.' date_created: 2020-09-30T12:04:14Z date_updated: 2022-01-06T06:54:12Z ddc: - '000' department: - _id: '63' - _id: '58' - _id: '79' file: - access_level: closed content_type: application/pdf creator: koala date_created: 2020-09-30T12:03:57Z date_updated: 2020-09-30T12:03:57Z file_id: '19793' file_name: pub-hni-908.pdf file_size: 499057 relation: main_file success: 1 file_date_updated: 2020-09-30T12:03:57Z has_accepted_license: '1' language: - iso: eng publication: Proceedings of SSGRR 2003 status: public title: Storage Management as Means to cope with Exponential Information Growth type: conference user_id: '15415' year: '2003' ... --- _id: '2128' author: - first_name: Valentina full_name: Damerow, Valentina last_name: Damerow - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Harald full_name: Räcke, Harald last_name: Räcke - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: 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' 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 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. 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. 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. short: 'V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, in: ESA, Springer, 2003, pp. 161--171.' date_created: 2018-04-03T05:37:10Z date_updated: 2022-01-06T06:54:52Z department: - _id: '79' - _id: '63' doi: 10.1007/978-3-540-39658-1_17 intvolume: ' 2832' language: - iso: eng page: 161--171 publication: ESA publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Smoothed Motion Complexity type: conference user_id: '14955' volume: 2832 year: '2003' ... --- _id: '2129' author: - first_name: Baruch full_name: Awerbuch, Baruch last_name: Awerbuch - first_name: André full_name: Brinkmann, André last_name: Brinkmann - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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.' 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} }' 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.' ieee: 'B. Awerbuch, A. Brinkmann, and C. Scheideler, “Anycasting in Adversarial Systems: Routing and Admission Control,” in ICALP, 2003, vol. 2719, pp. 1153--1168.' mla: 'Awerbuch, Baruch, et al. “Anycasting in Adversarial Systems: Routing and Admission Control.” ICALP, vol. 2719, Springer, 2003, pp. 1153--1168.' short: 'B. Awerbuch, A. Brinkmann, C. Scheideler, in: ICALP, Springer, 2003, pp. 1153--1168.' date_created: 2018-04-03T05:38:36Z date_updated: 2022-01-06T06:54:53Z ddc: - '040' department: - _id: '79' - _id: '63' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T09:04:48Z date_updated: 2018-04-12T09:04:48Z file_id: '2307' file_name: ICALP-03.pdf file_size: 154427 relation: main_file file_date_updated: 2018-04-12T09:04:48Z has_accepted_license: '1' intvolume: ' 2719' language: - iso: eng oa: '1' page: 1153--1168 publication: ICALP publisher: Springer series_title: Lecture Notes in Computer Science status: public title: 'Anycasting in Adversarial Systems: Routing and Admission Control' type: conference urn: '21297' user_id: '14955' volume: 2719 year: '2003' ... --- _id: '2130' author: - first_name: Baruch full_name: Awerbuch, Baruch last_name: Awerbuch - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Awerbuch B, Scheideler C. Peer-to-peer systems for prefix search. In: PODC. ACM; 2003:123--132.' apa: Awerbuch, B., & Scheideler, C. (2003). Peer-to-peer systems for prefix search. In PODC (pp. 123--132). ACM. 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} }' chicago: Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” In PODC, 123--132. ACM, 2003. ieee: B. Awerbuch and C. Scheideler, “Peer-to-peer systems for prefix search,” in PODC, 2003, pp. 123--132. mla: Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” PODC, ACM, 2003, pp. 123--132. short: 'B. Awerbuch, C. Scheideler, in: PODC, ACM, 2003, pp. 123--132.' date_created: 2018-04-03T05:39:48Z date_updated: 2022-01-06T06:54:53Z ddc: - '040' department: - _id: '79' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T09:10:10Z date_updated: 2018-04-12T09:10:10Z file_id: '2308' file_name: PODC-03.pdf file_size: 127013 relation: main_file file_date_updated: 2018-04-12T09:10:10Z has_accepted_license: '1' oa: '1' page: 123--132 publication: PODC publisher: ACM status: public title: Peer-to-peer systems for prefix search type: conference urn: '21303' user_id: '15504' year: '2003' ... --- _id: '2131' author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Chris full_name: Riley, Chris last_name: Riley - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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. 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} }' chicago: Czumaj, Artur, Chris Riley, and Christian Scheideler. “Perfectly Balanced Allocation.” In RANDOM-APPROX, 2764:240--251. Lecture Notes in Computer Science. Springer, 2003. ieee: A. Czumaj, C. Riley, and C. Scheideler, “Perfectly Balanced Allocation,” in RANDOM-APPROX, 2003, vol. 2764, pp. 240--251. mla: Czumaj, Artur, et al. “Perfectly Balanced Allocation.” RANDOM-APPROX, vol. 2764, Springer, 2003, pp. 240--251. short: 'A. Czumaj, C. Riley, C. Scheideler, in: RANDOM-APPROX, Springer, 2003, pp. 240--251.' date_created: 2018-04-03T05:41:01Z date_updated: 2022-01-06T06:54:54Z ddc: - '040' department: - _id: '79' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T09:16:17Z date_updated: 2018-04-12T09:16:17Z file_id: '2310' file_name: RANDOM-03.pdf file_size: 112587 relation: main_file file_date_updated: 2018-04-12T09:16:17Z has_accepted_license: '1' intvolume: ' 2764' oa: '1' page: 240--251 publication: RANDOM-APPROX publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Perfectly Balanced Allocation type: conference urn: '21313' user_id: '15504' volume: 2764 year: '2003' ... --- _id: '2132' author: - first_name: Lujun full_name: Jia, Lujun last_name: Jia - first_name: Rajmohan full_name: Rajaraman, Rajmohan last_name: Rajaraman - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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.' 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. 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} }' 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. 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. mla: Jia, Lujun, et al. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” SPAA, ACM, 2003, pp. 220--229. short: 'L. Jia, R. Rajaraman, C. Scheideler, in: SPAA, ACM, 2003, pp. 220--229.' date_created: 2018-04-03T05:41:53Z date_updated: 2022-01-06T06:54:54Z ddc: - '040' department: - _id: '79' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T09:18:55Z date_updated: 2018-04-12T09:18:55Z file_id: '2311' file_name: JRS-SPAA-03.pdf file_size: 224200 relation: main_file file_date_updated: 2018-04-12T09:18:55Z has_accepted_license: '1' oa: '1' page: 220--229 publication: SPAA publisher: ACM status: public title: On local algorithms for topology control and routing in ad hoc networks type: conference urn: '21320' user_id: '15504' year: '2003' ...