---
_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'
...
---
_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: <i>SPAA</i>. ; 1997:170--179.'
  apa: Flammini, M., &#38; Scheideler, C. (1997). Simple, Efficient Routing Schemes
    for All-Optical Networks. In <i>SPAA</i> (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 <i>SPAA</i>, 170--179, 1997.
  ieee: M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical
    Networks,” in <i>SPAA</i>, 1997, pp. 170--179.
  mla: Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes
    for All-Optical Networks.” <i>SPAA</i>, 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: '2181'
author:
- first_name: Christian
  full_name: Scheideler, Christian
  last_name: Scheideler
citation:
  ama: Scheideler C. <i>Universal Routing Strategies</i>. University of Paderborn,
    Germany; 1996.
  apa: Scheideler, C. (1996). <i>Universal routing strategies</i>. University of Paderborn,
    Germany.
  bibtex: '@book{Scheideler_1996, title={Universal routing strategies}, publisher={University
    of Paderborn, Germany}, author={Scheideler, Christian}, year={1996} }'
  chicago: Scheideler, Christian. <i>Universal Routing Strategies</i>. University
    of Paderborn, Germany, 1996.
  ieee: C. Scheideler, <i>Universal routing strategies</i>. University of Paderborn,
    Germany, 1996.
  mla: Scheideler, Christian. <i>Universal Routing Strategies</i>. University of Paderborn,
    Germany, 1996.
  short: C. Scheideler, Universal Routing Strategies, University of Paderborn, Germany,
    1996.
date_created: 2018-04-03T09:29:45Z
date_updated: 2022-01-06T06:55:15Z
department:
- _id: '79'
- _id: '63'
language:
- iso: eng
publisher: University of Paderborn, Germany
status: public
title: Universal routing strategies
type: dissertation
user_id: '14955'
year: '1996'
...
---
_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. <i>Theor Comput Sci</i>. 1996;(2):245--281.
    doi:<a href="https://doi.org/10.1016/0304-3975(96)00032-1">10.1016/0304-3975(96)00032-1</a>
  apa: Meyer auf der Heide, F., Scheideler, C., &#38; Stemann, V. (1996). Exploiting
    Storage Redundancy to Speed up Randomized Shared Memory Simulations. <i>Theor.
    Comput. Sci.</i>, (2), 245--281. <a href="https://doi.org/10.1016/0304-3975(96)00032-1">https://doi.org/10.1016/0304-3975(96)00032-1</a>
  bibtex: '@article{Meyer auf der Heide_Scheideler_Stemann_1996, title={Exploiting
    Storage Redundancy to Speed up Randomized Shared Memory Simulations}, DOI={<a
    href="https://doi.org/10.1016/0304-3975(96)00032-1">10.1016/0304-3975(96)00032-1</a>},
    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.”
    <i>Theor. Comput. Sci.</i>, no. 2 (1996): 245--281. <a href="https://doi.org/10.1016/0304-3975(96)00032-1">https://doi.org/10.1016/0304-3975(96)00032-1</a>.'
  ieee: F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage
    Redundancy to Speed up Randomized Shared Memory Simulations,” <i>Theor. Comput.
    Sci.</i>, no. 2, pp. 245--281, 1996.
  mla: Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed
    up Randomized Shared Memory Simulations.” <i>Theor. Comput. Sci.</i>, no. 2, 1996,
    pp. 245--281, doi:<a href="https://doi.org/10.1016/0304-3975(96)00032-1">10.1016/0304-3975(96)00032-1</a>.
  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: <i>FOCS</i>. ; 1996:370--379.'
  apa: 'Meyer auf der Heide, F., &#38; Scheideler, C. (1996). Deterministic Routing
    with Bounded Buffers: Turning Offline into Online Protocols. In <i>FOCS</i> (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 <i>FOCS</i>,
    370--379, 1996.'
  ieee: 'F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing with Bounded
    Buffers: Turning Offline into Online Protocols,” in <i>FOCS</i>, 1996, pp. 370--379.'
  mla: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing
    with Bounded Buffers: Turning Offline into Online Protocols.” <i>FOCS</i>, 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:
    <i>SOFSEM</i>. Vol 1175. Lecture Notes in Computer Science. Springer; 1996:16--33.'
  apa: Meyer auf der Heide, F., &#38; Scheideler, C. (1996). Communication in Parallel
    Systems. In <i>SOFSEM</i> (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 <i>SOFSEM</i>, 1175:16--33. Lecture Notes in Computer
    Science. Springer, 1996.
  ieee: F. Meyer auf der Heide and C. Scheideler, “Communication in Parallel Systems,”
    in <i>SOFSEM</i>, 1996, vol. 1175, pp. 16--33.
  mla: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in
    Parallel Systems.” <i>SOFSEM</i>, 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: <i>STOC</i>. ACM; 1996:356--365.'
  apa: Cypher, R., Meyer auf der Heide, F., Scheideler, C., &#38; Vöcking, B. (1996).
    Universal Algorithms for Store-and-Forward and Wormhole Routing. In <i>STOC</i>
    (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 <i>STOC</i>, 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 <i>STOC</i>, 1996,
    pp. 356--365.
  mla: Cypher, Robert, et al. “Universal Algorithms for Store-and-Forward and Wormhole
    Routing.” <i>STOC</i>, 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: '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: <i>ESA</i>. Lecture Notes in Computer
    Science. ; 1995:341--354. doi:<a href="https://doi.org/10.1007/3-540-60313-1_154">10.1007/3-540-60313-1_154</a>'
  apa: Meyer auf der Heide, F., &#38; Scheideler, C. (1995). Routing with Bounded
    Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. In <i>ESA</i> (pp.
    341--354). <a href="https://doi.org/10.1007/3-540-60313-1_154">https://doi.org/10.1007/3-540-60313-1_154</a>
  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={<a href="https://doi.org/10.1007/3-540-60313-1_154">10.1007/3-540-60313-1_154</a>},
    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 <i>ESA</i>,
    341--354. Lecture Notes in Computer Science, 1995. <a href="https://doi.org/10.1007/3-540-60313-1_154">https://doi.org/10.1007/3-540-60313-1_154</a>.
  ieee: F. Meyer auf der Heide and C. Scheideler, “Routing with Bounded Buffers and
    Hot-Potato Routing in Vertex-Symmetric Networks,” in <i>ESA</i>, 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.” <i>ESA</i>, 1995,
    pp. 341--354, doi:<a href="https://doi.org/10.1007/3-540-60313-1_154">10.1007/3-540-60313-1_154</a>.
  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: <i>SPAA</i>. ; 1995:137--146.'
  apa: Meyer auf der Heide, F., &#38; Scheideler, C. (1995). Space-Efficient Routing
    in Vertex-Symmetric Networks (Extended Abstract). In <i>SPAA</i> (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 <i>SPAA</i>, 137--146,
    1995.
  ieee: F. Meyer auf der Heide and C. Scheideler, “Space-Efficient Routing in Vertex-Symmetric
    Networks (Extended Abstract),” in <i>SPAA</i>, 1995, pp. 137--146.
  mla: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient
    Routing in Vertex-Symmetric Networks (Extended Abstract).” <i>SPAA</i>, 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: <i>STACS</i>. ; 1995:267--278.'
  apa: Meyer auf der Heide, F., Scheideler, C., &#38; Stemann, V. (1995). Exploiting
    Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In <i>STACS</i>
    (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 <i>STACS</i>, 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 <i>STACS</i>,
    1995, pp. 267--278.
  mla: Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed
    Up Randomized Shared Memory Simulations.” <i>STACS</i>, 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: '21607'
author:
- first_name: J
  full_name: Raggam, J
  last_name: Raggam
- first_name: Gerhard
  full_name: Triebnig, Gerhard
  last_name: Triebnig
- first_name: MF
  full_name: Buchroithner, MF
  last_name: Buchroithner
- first_name: Gitta
  full_name: Domik, Gitta
  id: '90'
  last_name: Domik
- first_name: Franz
  full_name: Leberl, Franz
  last_name: Leberl
citation:
  ama: Raggam J, Triebnig G, Buchroithner M, Domik G, Leberl F. Radargrammetric aspects
    of SAR data evaluation. <i>Thematic Applications of SAR data</i>. 1985:57.
  apa: Raggam, J., Triebnig, G., Buchroithner, M., Domik, G., &#38; Leberl, F. (1985).
    Radargrammetric aspects of SAR data evaluation. <i>Thematic Applications of SAR
    Data</i>, 57.
  bibtex: '@article{Raggam_Triebnig_Buchroithner_Domik_Leberl_1985, title={Radargrammetric
    aspects of SAR data evaluation}, journal={Thematic Applications of SAR data},
    author={Raggam, J and Triebnig, Gerhard and Buchroithner, MF and Domik, Gitta
    and Leberl, Franz}, year={1985}, pages={57} }'
  chicago: Raggam, J, Gerhard Triebnig, MF Buchroithner, Gitta Domik, and Franz Leberl.
    “Radargrammetric Aspects of SAR Data Evaluation.” <i>Thematic Applications of
    SAR Data</i>, 1985, 57.
  ieee: J. Raggam, G. Triebnig, M. Buchroithner, G. Domik, and F. Leberl, “Radargrammetric
    aspects of SAR data evaluation,” <i>Thematic Applications of SAR data</i>, p.
    57, 1985.
  mla: Raggam, J., et al. “Radargrammetric Aspects of SAR Data Evaluation.” <i>Thematic
    Applications of SAR Data</i>, 1985, p. 57.
  short: J. Raggam, G. Triebnig, M. Buchroithner, G. Domik, F. Leberl, Thematic Applications
    of SAR Data (1985) 57.
conference:
  location: Frascati, Italy
date_created: 2021-04-12T08:08:09Z
date_updated: 2022-01-06T06:55:07Z
department:
- _id: '79'
- _id: '7'
- _id: '65'
- _id: '69'
language:
- iso: eng
page: '57'
publication: Thematic Applications of SAR data
status: public
title: Radargrammetric aspects of SAR data evaluation
type: journal_article
user_id: '90'
year: '1985'
...