---
_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: <i>PDP</i>. IEEE Computer Society; 2001:227--234.'
  apa: Berenbrink, P., Brinkmann, A., &#38; Scheideler, C. (2001). SIMLAB-A Simulation
    Environment for Storage Area Networks. In <i>PDP</i> (pp. 227--234). IEEE Computer
    Society.
  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 <i>PDP</i>, 227--234. IEEE
    Computer Society, 2001.
  ieee: P. Berenbrink, A. Brinkmann, and C. Scheideler, “SIMLAB-A Simulation Environment
    for Storage Area Networks,” in <i>PDP</i>, 2001, pp. 227--234.
  mla: Berenbrink, Petra, et al. “SIMLAB-A Simulation Environment for Storage Area
    Networks.” <i>PDP</i>, IEEE Computer Society, 2001, pp. 227--234.
  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: <i>SPAA</i>. ; 2001:38--47.'
  apa: Kolman, P., &#38; Scheideler, C. (2001). Simple on-line algorithms for the
    maximum disjoint paths problem. In <i>SPAA</i> (pp. 38--47).
  bibtex: '@inproceedings{Kolman_Scheideler_2001, title={Simple on-line algorithms
    for the maximum disjoint paths problem}, booktitle={SPAA}, author={Kolman, Petr
    and Scheideler, Christian}, year={2001}, pages={38--47} }'
  chicago: Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for
    the Maximum Disjoint Paths Problem.” In <i>SPAA</i>, 38--47, 2001.
  ieee: P. Kolman and C. Scheideler, “Simple on-line algorithms for the maximum disjoint
    paths problem,” in <i>SPAA</i>, 2001, pp. 38--47.
  mla: Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the
    Maximum Disjoint Paths Problem.” <i>SPAA</i>, 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: '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. <i>Theory Comput Syst</i>. 2000;33(5/6):337--391. doi:<a href="https://doi.org/10.1007/s002240010006">10.1007/s002240010006</a>
  apa: Adler, M., &#38; Scheideler, C. (2000). Efficient Communication Strategies
    for Ad Hoc Wireless Networks. <i>Theory Comput. Syst.</i>, <i>33</i>(5/6), 337--391.
    <a href="https://doi.org/10.1007/s002240010006">https://doi.org/10.1007/s002240010006</a>
  bibtex: '@article{Adler_Scheideler_2000, title={Efficient Communication Strategies
    for Ad Hoc Wireless Networks}, volume={33}, DOI={<a href="https://doi.org/10.1007/s002240010006">10.1007/s002240010006</a>},
    number={5/6}, journal={Theory Comput. Syst.}, author={Adler, Micah and Scheideler,
    Christian}, year={2000}, pages={337--391} }'
  chicago: 'Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies
    for Ad Hoc Wireless Networks.” <i>Theory Comput. Syst.</i> 33, no. 5/6 (2000):
    337--391. <a href="https://doi.org/10.1007/s002240010006">https://doi.org/10.1007/s002240010006</a>.'
  ieee: M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad Hoc
    Wireless Networks,” <i>Theory Comput. Syst.</i>, vol. 33, no. 5/6, pp. 337--391,
    2000.
  mla: Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies
    for Ad Hoc Wireless Networks.” <i>Theory Comput. Syst.</i>, vol. 33, no. 5/6,
    2000, pp. 337--391, doi:<a href="https://doi.org/10.1007/s002240010006">10.1007/s002240010006</a>.
  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. <i>SIAM J Comput</i>. 2000;30(4):1126--1155. doi:<a
    href="https://doi.org/10.1137/S0097539799353431">10.1137/S0097539799353431</a>'
  apa: 'Scheideler, C., &#38; Vöcking, B. (2000). From Static to Dynamic Routing:
    Efficient Transformations of Store-and-Forward Protocols. <i>SIAM J. Comput.</i>,
    <i>30</i>(4), 1126--1155. <a href="https://doi.org/10.1137/S0097539799353431">https://doi.org/10.1137/S0097539799353431</a>'
  bibtex: '@article{Scheideler_Vöcking_2000, title={From Static to Dynamic Routing:
    Efficient Transformations of Store-and-Forward Protocols}, volume={30}, DOI={<a
    href="https://doi.org/10.1137/S0097539799353431">10.1137/S0097539799353431</a>},
    number={4}, journal={SIAM J. Comput.}, author={Scheideler, Christian and Vöcking,
    Berthold}, year={2000}, pages={1126--1155} }'
  chicago: 'Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing:
    Efficient Transformations of Store-and-Forward Protocols.” <i>SIAM J. Comput.</i>
    30, no. 4 (2000): 1126--1155. <a href="https://doi.org/10.1137/S0097539799353431">https://doi.org/10.1137/S0097539799353431</a>.'
  ieee: 'C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient
    Transformations of Store-and-Forward Protocols,” <i>SIAM J. Comput.</i>, vol.
    30, no. 4, pp. 1126--1155, 2000.'
  mla: 'Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing:
    Efficient Transformations of Store-and-Forward Protocols.” <i>SIAM J. Comput.</i>,
    vol. 30, no. 4, 2000, pp. 1126--1155, doi:<a href="https://doi.org/10.1137/S0097539799353431">10.1137/S0097539799353431</a>.'
  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: <i>PDPTA</i>. ; 2000.'
  apa: Berenbrink, P., Brinkmann, A., &#38; Scheideler, C. (2000). Distributed Path
    Selection for Storage Networks. In <i>PDPTA</i>.
  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 <i>PDPTA</i>, 2000.
  ieee: P. Berenbrink, A. Brinkmann, and C. Scheideler, “Distributed Path Selection
    for Storage Networks,” in <i>PDPTA</i>, 2000.
  mla: Berenbrink, Petra, et al. “Distributed Path Selection for Storage Networks.”
    <i>PDPTA</i>, 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'
...
---
_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: <i>SODA</i>. ; 2000:30--39.'
  apa: 'Czumaj, A., &#38; Scheideler, C. (2000). Coloring non-uniform hypergraphs:
    a new algorithmic approach to the general Lovász local lemma. In <i>SODA</i> (pp.
    30--39).'
  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 <i>SODA</i>,
    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 <i>SODA</i>, 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.” <i>SODA</i>, 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. <i>Random Struct Algorithms</i>. 2000;17(3-4):213--237.'
  apa: 'Czumaj, A., &#38; Scheideler, C. (2000). Coloring nonuniform hypergraphs:
    A new algorithmic approach to the general Lovász local lemma. <i>Random Struct.
    Algorithms</i>, <i>17</i>(3–4), 213--237.'
  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.” <i>Random Struct.
    Algorithms</i> 17, no. 3–4 (2000): 213--237.'
  ieee: 'A. Czumaj and C. Scheideler, “Coloring nonuniform hypergraphs: A new algorithmic
    approach to the general Lovász local lemma,” <i>Random Struct. Algorithms</i>,
    vol. 17, no. 3–4, pp. 213--237, 2000.'
  mla: 'Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs:
    A New Algorithmic Approach to the General Lovász Local Lemma.” <i>Random Struct.
    Algorithms</i>, vol. 17, no. 3–4, 2000, pp. 213--237.'
  short: A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237.
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: <i>SPAA</i>. ; 2000:119--128.'
  apa: Brinkmann, A., Salzwedel, K., &#38; Scheideler, C. (2000). Efficient, distributed
    data placement strategies for storage area networks (extended abstract). In <i>SPAA</i>
    (pp. 119--128).
  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 <i>SPAA</i>, 119--128, 2000.
  ieee: A. Brinkmann, K. Salzwedel, and C. Scheideler, “Efficient, distributed data
    placement strategies for storage area networks (extended abstract),” in <i>SPAA</i>,
    2000, pp. 119--128.
  mla: Brinkmann, André, et al. “Efficient, Distributed Data Placement Strategies
    for Storage Area Networks (Extended Abstract).” <i>SPAA</i>, 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: <i>STOC</i>. ACM; 2000:38--47.'
  apa: Czumaj, A., &#38; Scheideler, C. (2000). A new algorithm approach to the general
    Lovász local lemma with applications to scheduling and satisfiability problems
    (extended abstract). In <i>STOC</i> (pp. 38--47). ACM.
  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 <i>STOC</i>, 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 <i>STOC</i>, 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).” <i>STOC</i>, 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: <i>32nd
    ACM Symposium on Theory of Computing</i>. ; 2000:38-47.'
  apa: Czumaj, A., &#38; Scheideler, C. (2000). A New Algorithmic Approach to the
    General Lovász Local Lemma with Applications to Scheduling and Satisfiability
    Problems . In <i>32nd ACM Symposium on Theory of Computing</i> (pp. 38–47).
  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 <i>32nd ACM Symposium on Theory of Computing</i>, 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
    <i>32nd ACM Symposium on Theory of Computing</i>, 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 .” <i>32nd ACM Symposium on Theory of Computing</i>, 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: '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. <i>Theory Comput Syst</i>. 1999;32(3):387--420. doi:<a href="https://doi.org/10.1007/s002240000123">10.1007/s002240000123</a>
  apa: Flammini, M., &#38; Scheideler, C. (1999). Simple, Efficient Routing Schemes
    for All-Optical Networks. <i>Theory Comput. Syst.</i>, <i>32</i>(3), 387--420.
    <a href="https://doi.org/10.1007/s002240000123">https://doi.org/10.1007/s002240000123</a>
  bibtex: '@article{Flammini_Scheideler_1999, title={Simple, Efficient Routing Schemes
    for All-Optical Networks}, volume={32}, DOI={<a href="https://doi.org/10.1007/s002240000123">10.1007/s002240000123</a>},
    number={3}, journal={Theory Comput. Syst.}, author={Flammini, Michele and Scheideler,
    Christian}, year={1999}, pages={387--420} }'
  chicago: 'Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing
    Schemes for All-Optical Networks.” <i>Theory Comput. Syst.</i> 32, no. 3 (1999):
    387--420. <a href="https://doi.org/10.1007/s002240000123">https://doi.org/10.1007/s002240000123</a>.'
  ieee: M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical
    Networks,” <i>Theory Comput. Syst.</i>, vol. 32, no. 3, pp. 387--420, 1999.
  mla: Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes
    for All-Optical Networks.” <i>Theory Comput. Syst.</i>, vol. 32, no. 3, 1999,
    pp. 387--420, doi:<a href="https://doi.org/10.1007/s002240000123">10.1007/s002240000123</a>.
  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: <i>SODA</i>. ; 1999:112--121.'
  apa: Berenbrink, P., &#38; Scheideler, C. (1999). Locally Efficient On-Line Strategies
    for Routing Packets Along Fixed Paths. In <i>SODA</i> (pp. 112--121).
  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 <i>SODA</i>, 112--121, 1999.
  ieee: P. Berenbrink and C. Scheideler, “Locally Efficient On-Line Strategies for
    Routing Packets Along Fixed Paths,” in <i>SODA</i>, 1999, pp. 112--121.
  mla: Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies
    for Routing Packets Along Fixed Paths.” <i>SODA</i>, 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: <i>SPAA</i>. ; 1999:33--42.'
  apa: Berenbrink, P., Riedel, M., &#38; Scheideler, C. (1999). Simple Competitive
    Request Scheduling Strategies. In <i>SPAA</i> (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 <i>SPAA</i>, 33--42, 1999.
  ieee: P. Berenbrink, M. Riedel, and C. Scheideler, “Simple Competitive Request Scheduling
    Strategies,” in <i>SPAA</i>, 1999, pp. 33--42.
  mla: Berenbrink, Petra, et al. “Simple Competitive Request Scheduling Strategies.”
    <i>SPAA</i>, 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: <i>International Workshop on Communication and
    Data Management in Large Networks (CDMLarge)</i>. ; 1999:2-12.'
  apa: Berenbrink, P., Riedel, M., &#38; Scheideler, C. (1999). Design of the PRESTO
    Multimedia Storage Network (Extended Abstract). In <i>International Workshop on
    Communication and Data Management in Large Networks (CDMLarge)</i> (pp. 2–12).
  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 <i>International Workshop
    on Communication and Data Management in Large Networks (CDMLarge)</i>, 2–12, 1999.
  ieee: P. Berenbrink, M. Riedel, and C. Scheideler, “Design of the PRESTO Multimedia
    Storage Network (Extended Abstract),” in <i>International Workshop on Communication
    and Data Management in Large Networks (CDMLarge)</i>, 1999, pp. 2–12.
  mla: Berenbrink, Petra, et al. “Design of the PRESTO Multimedia Storage Network
    (Extended Abstract).” <i>International Workshop on Communication and Data Management
    in Large Networks (CDMLarge)</i>, 1999, pp. 2–12.
  short: 'P. Berenbrink, M. Riedel, C. Scheideler, in: International Workshop on Communication
    and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.'
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: <i>STOC</i>. ; 1999:215--224.'
  apa: 'Scheideler, C., &#38; Vöcking, B. (1999). From Static to Dynamic Routing:
    Efficient Transformations of Store-and-Forward Protocols. In <i>STOC</i> (pp.
    215--224).'
  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 <i>STOC</i>, 215--224,
    1999.'
  ieee: 'C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient
    Transformations of Store-and-Forward Protocols,” in <i>STOC</i>, 1999, pp. 215--224.'
  mla: 'Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing:
    Efficient Transformations of Store-and-Forward Protocols.” <i>STOC</i>, 1999,
    pp. 215--224.'
  short: 'C. Scheideler, B. Vöcking, in: STOC, 1999, pp. 215--224.'
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: '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. <i>Theory
    Comput Syst</i>. 1998;31(4):425--449. doi:<a href="https://doi.org/10.1007/s002240000096">10.1007/s002240000096</a>
  apa: Scheideler, C., &#38; Vöcking, B. (1998). Universal Continuous Routing Strategies.
    <i>Theory Comput. Syst.</i>, <i>31</i>(4), 425--449. <a href="https://doi.org/10.1007/s002240000096">https://doi.org/10.1007/s002240000096</a>
  bibtex: '@article{Scheideler_Vöcking_1998, title={Universal Continuous Routing Strategies},
    volume={31}, DOI={<a href="https://doi.org/10.1007/s002240000096">10.1007/s002240000096</a>},
    number={4}, journal={Theory Comput. Syst.}, author={Scheideler, Christian and
    Vöcking, Berthold}, year={1998}, pages={425--449} }'
  chicago: 'Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing
    Strategies.” <i>Theory Comput. Syst.</i> 31, no. 4 (1998): 425--449. <a href="https://doi.org/10.1007/s002240000096">https://doi.org/10.1007/s002240000096</a>.'
  ieee: C. Scheideler and B. Vöcking, “Universal Continuous Routing Strategies,” <i>Theory
    Comput. Syst.</i>, vol. 31, no. 4, pp. 425--449, 1998.
  mla: Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing
    Strategies.” <i>Theory Comput. Syst.</i>, vol. 31, no. 4, 1998, pp. 425--449,
    doi:<a href="https://doi.org/10.1007/s002240000096">10.1007/s002240000096</a>.
  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: <i>SPAA</i>. ; 1998:259--268.'
  apa: Adler, M., &#38; Scheideler, C. (1998). Efficient Communication Strategies
    for Ad-Hoc Wireless Networks (Extended Abstract). In <i>SPAA</i> (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 <i>SPAA</i>, 259--268, 1998.
  ieee: M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad-Hoc
    Wireless Networks (Extended Abstract),” in <i>SPAA</i>, 1998, pp. 259--268.
  mla: Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies
    for Ad-Hoc Wireless Networks (Extended Abstract).” <i>SPAA</i>, 1998, pp. 259--268.
  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: <i>STOC</i>. ; 1998:624--633.'
  apa: Feige, U., &#38; Scheideler, C. (1998). Improved Bounds for Acyclic Job Shop
    Scheduling (Extended Abstract). In <i>STOC</i> (pp. 624--633).
  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 <i>STOC</i>, 624--633, 1998.
  ieee: U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling
    (Extended Abstract),” in <i>STOC</i>, 1998, pp. 624--633.
  mla: Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop
    Scheduling (Extended Abstract).” <i>STOC</i>, 1998, pp. 624--633.
  short: 'U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633.'
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: '2185'
author:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: Scheideler C. <i>Universal Routing Strategies for Interconnection Networks</i>.
    Vol 1390.; 1998. doi:<a href="https://doi.org/10.1007/BFb0052928">10.1007/BFb0052928</a>
  apa: Scheideler, C. (1998). <i>Universal Routing Strategies for Interconnection
    Networks</i> (Vol. 1390). <a href="https://doi.org/10.1007/BFb0052928">https://doi.org/10.1007/BFb0052928</a>
  bibtex: '@book{Scheideler_1998, series={Lecture Notes in Computer Science}, title={Universal
    Routing Strategies for Interconnection Networks}, volume={1390}, DOI={<a href="https://doi.org/10.1007/BFb0052928">10.1007/BFb0052928</a>},
    author={Scheideler, Christian}, year={1998}, collection={Lecture Notes in Computer
    Science} }'
  chicago: Scheideler, Christian. <i>Universal Routing Strategies for Interconnection
    Networks</i>. Vol. 1390. Lecture Notes in Computer Science, 1998. <a href="https://doi.org/10.1007/BFb0052928">https://doi.org/10.1007/BFb0052928</a>.
  ieee: C. Scheideler, <i>Universal Routing Strategies for Interconnection Networks</i>,
    vol. 1390. 1998.
  mla: Scheideler, Christian. <i>Universal Routing Strategies for Interconnection
    Networks</i>. Vol. 1390, 1998, doi:<a href="https://doi.org/10.1007/BFb0052928">10.1007/BFb0052928</a>.
  short: C. Scheideler, Universal Routing Strategies for Interconnection Networks,
    1998.
date_created: 2018-04-03T09:38:18Z
date_updated: 2022-01-06T06:55:17Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/BFb0052928
intvolume: '      1390'
language:
- iso: eng
publication_identifier:
  isbn:
  - 978-3-540-69792-3
series_title: Lecture Notes in Computer Science
status: public
title: Universal Routing Strategies for Interconnection Networks
type: book
user_id: '14955'
volume: 1390
year: '1998'
...
---
_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: <i>IPPS</i>. IEEE Computer Society; 1997:326--332.'
  apa: Bock, S., Meyer auf der Heide, F., &#38; Scheideler, C. (1997). Optimal Wormhole
    Routing in the (n, d)-Torus. In <i>IPPS</i> (pp. 326--332). IEEE Computer Society.
  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 <i>IPPS</i>, 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 <i>IPPS</i>, 1997, pp. 326--332.
  mla: Bock, Stefan, et al. “Optimal Wormhole Routing in the (n, d)-Torus.” <i>IPPS</i>,
    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'
...