---
_id: '2122'
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. Robust Distributed Name Service. In: <i>IPTPS</i>.
    Vol 3279. Lecture Notes in Computer Science. ; 2004:237--249.'
  apa: Awerbuch, B., &#38; Scheideler, C. (2004). Robust Distributed Name Service.
    In <i>IPTPS</i> (Vol. 3279, pp. 237--249).
  bibtex: '@inproceedings{Awerbuch_Scheideler_2004, series={Lecture Notes in Computer
    Science}, title={Robust Distributed Name Service}, volume={3279}, booktitle={IPTPS},
    author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={237--249},
    collection={Lecture Notes in Computer Science} }'
  chicago: Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.”
    In <i>IPTPS</i>, 3279:237--249. Lecture Notes in Computer Science, 2004.
  ieee: B. Awerbuch and C. Scheideler, “Robust Distributed Name Service,” in <i>IPTPS</i>,
    2004, vol. 3279, pp. 237--249.
  mla: Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.”
    <i>IPTPS</i>, vol. 3279, 2004, pp. 237--249.
  short: 'B. Awerbuch, C. Scheideler, in: IPTPS, 2004, pp. 237--249.'
date_created: 2018-04-03T05:32:33Z
date_updated: 2022-01-06T06:54:50Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
  content_type: application/pdf
  creator: florida
  date_created: 2018-04-12T11:39:38Z
  date_updated: 2018-04-12T11:39:38Z
  file_id: '2318'
  file_name: IPTPS-04.pdf
  file_size: 136987
  relation: main_file
file_date_updated: 2018-04-12T11:39:38Z
has_accepted_license: '1'
intvolume: '      3279'
oa: '1'
page: 237--249
publication: IPTPS
series_title: Lecture Notes in Computer Science
status: public
title: Robust Distributed Name Service
type: conference
urn: '21229'
user_id: '15504'
volume: 3279
year: '2004'
...
---
_id: '2123'
author:
- first_name: Giuseppe
  full_name: Ateniese, Giuseppe
  last_name: Ateniese
- first_name: Chris
  full_name: Riley, Chris
  last_name: Riley
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Ateniese G, Riley C, Scheideler C. Survivable Monitoring in Dynamic Networks.
    In: <i>IWIA</i>. ; 2004:33--47.'
  apa: Ateniese, G., Riley, C., &#38; Scheideler, C. (2004). Survivable Monitoring
    in Dynamic Networks. In <i>IWIA</i> (pp. 33--47).
  bibtex: '@inproceedings{Ateniese_Riley_Scheideler_2004, title={Survivable Monitoring
    in Dynamic Networks}, booktitle={IWIA}, author={Ateniese, Giuseppe and Riley,
    Chris and Scheideler, Christian}, year={2004}, pages={33--47} }'
  chicago: Ateniese, Giuseppe, Chris Riley, and Christian Scheideler. “Survivable
    Monitoring in Dynamic Networks.” In <i>IWIA</i>, 33--47, 2004.
  ieee: G. Ateniese, C. Riley, and C. Scheideler, “Survivable Monitoring in Dynamic
    Networks,” in <i>IWIA</i>, 2004, pp. 33--47.
  mla: Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.” <i>IWIA</i>,
    2004, pp. 33--47.
  short: 'G. Ateniese, C. Riley, C. Scheideler, in: IWIA, 2004, pp. 33--47.'
date_created: 2018-04-03T05:33:37Z
date_updated: 2022-01-06T06:54:50Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
  content_type: application/pdf
  creator: florida
  date_created: 2018-04-12T11:38:22Z
  date_updated: 2018-04-12T11:38:22Z
  file_id: '2317'
  file_name: IIAW-04.pdf
  file_size: 255111
  relation: main_file
file_date_updated: 2018-04-12T11:38:22Z
has_accepted_license: '1'
oa: '1'
page: 33--47
publication: IWIA
status: public
title: Survivable Monitoring in Dynamic Networks
type: conference
urn: '21238'
user_id: '15504'
year: '2004'
...
---
_id: '2124'
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. The hyperring: a low-congestion deterministic data
    structure for distributed environments. In: <i>SODA</i>. ; 2004:318--327.'
  apa: 'Awerbuch, B., &#38; Scheideler, C. (2004). The hyperring: a low-congestion
    deterministic data structure for distributed environments. In <i>SODA</i> (pp.
    318--327).'
  bibtex: '@inproceedings{Awerbuch_Scheideler_2004, title={The hyperring: a low-congestion
    deterministic data structure for distributed environments}, booktitle={SODA},
    author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={318--327}
    }'
  chicago: 'Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion
    Deterministic Data Structure for Distributed Environments.” In <i>SODA</i>, 318--327,
    2004.'
  ieee: 'B. Awerbuch and C. Scheideler, “The hyperring: a low-congestion deterministic
    data structure for distributed environments,” in <i>SODA</i>, 2004, pp. 318--327.'
  mla: 'Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion
    Deterministic Data Structure for Distributed Environments.” <i>SODA</i>, 2004,
    pp. 318--327.'
  short: 'B. Awerbuch, C. Scheideler, in: SODA, 2004, pp. 318--327.'
date_created: 2018-04-03T05:34:17Z
date_updated: 2022-01-06T06:54:51Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
  content_type: application/pdf
  creator: florida
  date_created: 2018-04-13T08:36:08Z
  date_updated: 2018-04-13T08:36:08Z
  file_id: '2323'
  file_name: SODA-04.pdf
  file_size: 193831
  relation: main_file
file_date_updated: 2018-04-13T08:36:08Z
has_accepted_license: '1'
oa: '1'
page: 318--327
publication: SODA
status: public
title: 'The hyperring: a low-congestion deterministic data structure for distributed
  environments'
type: conference
urn: '21247'
user_id: '15504'
year: '2004'
...
---
_id: '2125'
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. Consistent and compact data management in distributed
    storage systems. In: <i>SPAA</i>. ; 2004:44--53.'
  apa: Awerbuch, B., &#38; Scheideler, C. (2004). Consistent and compact data management
    in distributed storage systems. In <i>SPAA</i> (pp. 44--53).
  bibtex: '@inproceedings{Awerbuch_Scheideler_2004, title={Consistent and compact
    data management in distributed storage systems}, booktitle={SPAA}, author={Awerbuch,
    Baruch and Scheideler, Christian}, year={2004}, pages={44--53} }'
  chicago: Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data
    Management in Distributed Storage Systems.” In <i>SPAA</i>, 44--53, 2004.
  ieee: B. Awerbuch and C. Scheideler, “Consistent and compact data management in
    distributed storage systems,” in <i>SPAA</i>, 2004, pp. 44--53.
  mla: Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data Management
    in Distributed Storage Systems.” <i>SPAA</i>, 2004, pp. 44--53.
  short: 'B. Awerbuch, C. Scheideler, in: SPAA, 2004, pp. 44--53.'
date_created: 2018-04-03T05:34:56Z
date_updated: 2022-01-06T06:54:51Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
  content_type: application/pdf
  creator: florida
  date_created: 2018-04-12T09:41:38Z
  date_updated: 2018-04-12T09:41:38Z
  file_id: '2315'
  file_name: AS-SPAA-04.pdf
  file_size: 170429
  relation: main_file
file_date_updated: 2018-04-12T09:41:38Z
has_accepted_license: '1'
oa: '1'
page: 44--53
publication: SPAA
status: public
title: Consistent and compact data management in distributed storage systems
type: conference
urn: '21256'
user_id: '15504'
year: '2004'
...
---
_id: '2126'
author:
- first_name: Ankur
  full_name: Bhargava, Ankur
  last_name: Bhargava
- first_name: Kishore
  full_name: Kothapalli, Kishore
  last_name: Kothapalli
- first_name: Chris
  full_name: Riley, Chris
  last_name: Riley
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Mark
  full_name: Thober, Mark
  last_name: Thober
citation:
  ama: 'Bhargava A, Kothapalli K, Riley C, Scheideler C, Thober M. Pagoda: a dynamic
    overlay network for routing, data management, and multicasting. In: <i>SPAA</i>.
    ; 2004:170--179.'
  apa: 'Bhargava, A., Kothapalli, K., Riley, C., Scheideler, C., &#38; Thober, M.
    (2004). Pagoda: a dynamic overlay network for routing, data management, and multicasting.
    In <i>SPAA</i> (pp. 170--179).'
  bibtex: '@inproceedings{Bhargava_Kothapalli_Riley_Scheideler_Thober_2004, title={Pagoda:
    a dynamic overlay network for routing, data management, and multicasting}, booktitle={SPAA},
    author={Bhargava, Ankur and Kothapalli, Kishore and Riley, Chris and Scheideler,
    Christian and Thober, Mark}, year={2004}, pages={170--179} }'
  chicago: 'Bhargava, Ankur, Kishore Kothapalli, Chris Riley, Christian Scheideler,
    and Mark Thober. “Pagoda: A Dynamic Overlay Network for Routing, Data Management,
    and Multicasting.” In <i>SPAA</i>, 170--179, 2004.'
  ieee: 'A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, and M. Thober, “Pagoda:
    a dynamic overlay network for routing, data management, and multicasting,” in
    <i>SPAA</i>, 2004, pp. 170--179.'
  mla: 'Bhargava, Ankur, et al. “Pagoda: A Dynamic Overlay Network for Routing, Data
    Management, and Multicasting.” <i>SPAA</i>, 2004, pp. 170--179.'
  short: 'A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, M. Thober, in: SPAA,
    2004, pp. 170--179.'
date_created: 2018-04-03T05:35:31Z
date_updated: 2022-01-06T06:54:52Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
  content_type: application/pdf
  creator: florida
  date_created: 2018-04-12T09:40:12Z
  date_updated: 2018-04-12T09:40:42Z
  file_id: '2314'
  file_name: BKRST-SPAA-04.pdf
  file_size: 118175
  relation: main_file
file_date_updated: 2018-04-12T09:40:42Z
has_accepted_license: '1'
oa: '1'
page: 170--179
publication: SPAA
status: public
title: 'Pagoda: a dynamic overlay network for routing, data management, and multicasting'
type: conference
urn: '21266'
user_id: '15504'
year: '2004'
...
---
_id: '2127'
author:
- first_name: Amitabha
  full_name: Bagchi, Amitabha
  last_name: Bagchi
- first_name: Ankur
  full_name: Bhargava, Ankur
  last_name: Bhargava
- first_name: Amitabh
  full_name: Chaudhary, Amitabh
  last_name: Chaudhary
- first_name: David
  full_name: Eppstein, David
  last_name: Eppstein
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Bagchi A, Bhargava A, Chaudhary A, Eppstein D, Scheideler C. The effect of
    faults on network expansion. In: <i>SPAA</i>. ACM; 2004:286--293.'
  apa: Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., &#38; Scheideler, C.
    (2004). The effect of faults on network expansion. In <i>SPAA</i> (pp. 286--293).
    ACM.
  bibtex: '@inproceedings{Bagchi_Bhargava_Chaudhary_Eppstein_Scheideler_2004, title={The
    effect of faults on network expansion}, booktitle={SPAA}, publisher={ACM}, author={Bagchi,
    Amitabha and Bhargava, Ankur and Chaudhary, Amitabh and Eppstein, David and Scheideler,
    Christian}, year={2004}, pages={286--293} }'
  chicago: Bagchi, Amitabha, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, and
    Christian Scheideler. “The Effect of Faults on Network Expansion.” In <i>SPAA</i>,
    286--293. ACM, 2004.
  ieee: A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler, “The
    effect of faults on network expansion,” in <i>SPAA</i>, 2004, pp. 286--293.
  mla: Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” <i>SPAA</i>,
    ACM, 2004, pp. 286--293.
  short: 'A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, in: SPAA,
    ACM, 2004, pp. 286--293.'
date_created: 2018-04-03T05:36:11Z
date_updated: 2022-01-06T06:54:52Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
  content_type: application/pdf
  creator: florida
  date_created: 2018-04-12T09:21:24Z
  date_updated: 2018-04-12T09:21:24Z
  file_id: '2313'
  file_name: BBCES-SPAA-04.pdf
  file_size: 197503
  relation: main_file
file_date_updated: 2018-04-12T09:21:24Z
has_accepted_license: '1'
oa: '1'
page: 286--293
publication: SPAA
publisher: ACM
status: public
title: The effect of faults on network expansion
type: conference
urn: '21276'
user_id: '15504'
year: '2004'
...
---
_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: <i>Proceedings of SSGRR 2003</i>. ; 2003.'
  apa: Scheideler, C., Salzwedel, K., Meyer auf der Heide, F., Brinkmann, A., Vodisek,
    M., &#38; Rückert, U. (2003). Storage Management as Means to cope with Exponential
    Information Growth. In <i>Proceedings of SSGRR 2003</i>.
  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 <i>Proceedings of SSGRR 2003</i>,
    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 <i>Proceedings of SSGRR 2003</i>, 2003.
  mla: Scheideler, Christian, et al. “Storage Management as Means to Cope with Exponential
    Information Growth.” <i>Proceedings of SSGRR 2003</i>, 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: <i>ESA</i>. Vol 2832. Lecture Notes in Computer Science.
    Springer; 2003:161--171. doi:<a href="https://doi.org/10.1007/978-3-540-39658-1_17">10.1007/978-3-540-39658-1_17</a>'
  apa: Damerow, V., Meyer auf der Heide, F., Räcke, H., Scheideler, C., &#38; Sohler,
    C. (2003). Smoothed Motion Complexity. In <i>ESA</i> (Vol. 2832, pp. 161--171).
    Springer. <a href="https://doi.org/10.1007/978-3-540-39658-1_17">https://doi.org/10.1007/978-3-540-39658-1_17</a>
  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={<a href="https://doi.org/10.1007/978-3-540-39658-1_17">10.1007/978-3-540-39658-1_17</a>},
    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 <i>ESA</i>,
    2832:161--171. Lecture Notes in Computer Science. Springer, 2003. <a href="https://doi.org/10.1007/978-3-540-39658-1_17">https://doi.org/10.1007/978-3-540-39658-1_17</a>.
  ieee: V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, and C. Sohler,
    “Smoothed Motion Complexity,” in <i>ESA</i>, 2003, vol. 2832, pp. 161--171.
  mla: Damerow, Valentina, et al. “Smoothed Motion Complexity.” <i>ESA</i>, vol. 2832,
    Springer, 2003, pp. 161--171, doi:<a href="https://doi.org/10.1007/978-3-540-39658-1_17">10.1007/978-3-540-39658-1_17</a>.
  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: <i>ICALP</i>. Vol 2719. Lecture Notes in Computer
    Science. Springer; 2003:1153--1168.'
  apa: 'Awerbuch, B., Brinkmann, A., &#38; Scheideler, C. (2003). Anycasting in Adversarial
    Systems: Routing and Admission Control. In <i>ICALP</i> (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 <i>ICALP</i>, 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 <i>ICALP</i>, 2003, vol. 2719, pp.
    1153--1168.'
  mla: 'Awerbuch, Baruch, et al. “Anycasting in Adversarial Systems: Routing and Admission
    Control.” <i>ICALP</i>, 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: <i>PODC</i>.
    ACM; 2003:123--132.'
  apa: Awerbuch, B., &#38; Scheideler, C. (2003). Peer-to-peer systems for prefix
    search. In <i>PODC</i> (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 <i>PODC</i>, 123--132. ACM, 2003.
  ieee: B. Awerbuch and C. Scheideler, “Peer-to-peer systems for prefix search,” in
    <i>PODC</i>, 2003, pp. 123--132.
  mla: Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix
    Search.” <i>PODC</i>, 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: <i>RANDOM-APPROX</i>.
    Vol 2764. Lecture Notes in Computer Science. Springer; 2003:240--251.'
  apa: Czumaj, A., Riley, C., &#38; Scheideler, C. (2003). Perfectly Balanced Allocation.
    In <i>RANDOM-APPROX</i> (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 <i>RANDOM-APPROX</i>, 2764:240--251. Lecture Notes in Computer
    Science. Springer, 2003.
  ieee: A. Czumaj, C. Riley, and C. Scheideler, “Perfectly Balanced Allocation,” in
    <i>RANDOM-APPROX</i>, 2003, vol. 2764, pp. 240--251.
  mla: Czumaj, Artur, et al. “Perfectly Balanced Allocation.” <i>RANDOM-APPROX</i>,
    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: <i>SPAA</i>. ACM; 2003:220--229.'
  apa: Jia, L., Rajaraman, R., &#38; Scheideler, C. (2003). On local algorithms for
    topology control and routing in ad hoc networks. In <i>SPAA</i> (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 <i>SPAA</i>, 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 <i>SPAA</i>, 2003, pp. 220--229.
  mla: Jia, Lujun, et al. “On Local Algorithms for Topology Control and Routing in
    Ad Hoc Networks.” <i>SPAA</i>, 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'
...
---
_id: '2133'
author:
- first_name: Kishore
  full_name: Kothapalli, Kishore
  last_name: Kothapalli
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Kothapalli K, Scheideler C. Information gathering in adversarial systems:
    lines and cycles. In: <i>SPAA</i>. ACM; 2003:333--342.'
  apa: 'Kothapalli, K., &#38; Scheideler, C. (2003). Information gathering in adversarial
    systems: lines and cycles. In <i>SPAA</i> (pp. 333--342). ACM.'
  bibtex: '@inproceedings{Kothapalli_Scheideler_2003, title={Information gathering
    in adversarial systems: lines and cycles}, booktitle={SPAA}, publisher={ACM},
    author={Kothapalli, Kishore and Scheideler, Christian}, year={2003}, pages={333--342}
    }'
  chicago: 'Kothapalli, Kishore, and Christian Scheideler. “Information Gathering
    in Adversarial Systems: Lines and Cycles.” In <i>SPAA</i>, 333--342. ACM, 2003.'
  ieee: 'K. Kothapalli and C. Scheideler, “Information gathering in adversarial systems:
    lines and cycles,” in <i>SPAA</i>, 2003, pp. 333--342.'
  mla: 'Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial
    Systems: Lines and Cycles.” <i>SPAA</i>, ACM, 2003, pp. 333--342.'
  short: 'K. Kothapalli, C. Scheideler, in: SPAA, ACM, 2003, pp. 333--342.'
date_created: 2018-04-03T05:42:48Z
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-12T09:13:43Z
  date_updated: 2018-04-12T09:15:24Z
  file_id: '2309'
  file_name: KS-SPAA-03.pdf
  file_size: 121448
  relation: main_file
file_date_updated: 2018-04-12T09:15:24Z
has_accepted_license: '1'
oa: '1'
page: 333--342
publication: SPAA
publisher: ACM
status: public
title: 'Information gathering in adversarial systems: lines and cycles'
type: conference
urn: '21338'
user_id: '15504'
year: '2003'
...
---
_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. <i>Combinatorica</i>.
    2002;(3):361--399. doi:<a href="https://doi.org/10.1007/s004930200018">10.1007/s004930200018</a>
  apa: Feige, U., &#38; Scheideler, C. (2002). Improved Bounds for Acyclic Job Shop
    Scheduling. <i>Combinatorica</i>, (3), 361--399. <a href="https://doi.org/10.1007/s004930200018">https://doi.org/10.1007/s004930200018</a>
  bibtex: '@article{Feige_Scheideler_2002, title={Improved Bounds for Acyclic Job
    Shop Scheduling}, DOI={<a href="https://doi.org/10.1007/s004930200018">10.1007/s004930200018</a>},
    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.” <i>Combinatorica</i>, no. 3 (2002): 361--399. <a href="https://doi.org/10.1007/s004930200018">https://doi.org/10.1007/s004930200018</a>.'
  ieee: U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling,”
    <i>Combinatorica</i>, no. 3, pp. 361--399, 2002.
  mla: Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop
    Scheduling.” <i>Combinatorica</i>, no. 3, 2002, pp. 361--399, doi:<a href="https://doi.org/10.1007/s004930200018">10.1007/s004930200018</a>.
  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: <i>SODA</i>. ACM/SIAM; 2002:184--193.'
  apa: Kolman, P., &#38; Scheideler, C. (2002). Improved bounds for the unsplittable
    flow problem. In <i>SODA</i> (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 <i>SODA</i>, 184--193. ACM/SIAM, 2002.
  ieee: P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,”
    in <i>SODA</i>, 2002, pp. 184--193.
  mla: Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable
    Flow Problem.” <i>SODA</i>, 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: <i>SPAA</i>. ; 2002:53--62.'
  apa: Brinkmann, A., Salzwedel, K., &#38; Scheideler, C. (2002). Compact, adaptive
    placement schemes for non-uniform requirements. In <i>SPAA</i> (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 <i>SPAA</i>, 53--62, 2002.
  ieee: A. Brinkmann, K. Salzwedel, and C. Scheideler, “Compact, adaptive placement
    schemes for non-uniform requirements,” in <i>SPAA</i>, 2002, pp. 53--62.
  mla: Brinkmann, André, et al. “Compact, Adaptive Placement Schemes for Non-Uniform
    Requirements.” <i>SPAA</i>, 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: <i>SPAA</i>. ; 2002:265--274.'
  apa: Bagchi, A., Chaudhary, A., Scheideler, C., &#38; Kolman, P. (2002). Algorithms
    for fault-tolerant routing in circuit switched networks. In <i>SPAA</i> (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 <i>SPAA</i>,
    265--274, 2002.
  ieee: A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, “Algorithms for fault-tolerant
    routing in circuit switched networks,” in <i>SPAA</i>, 2002, pp. 265--274.
  mla: Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit
    Switched Networks.” <i>SPAA</i>, 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: <i>STACS</i>. Vol 2285. Lecture Notes in Computer Science. Springer; 2002:27--49.'
  apa: Scheideler, C. (2002). Models and Techniques for Communication in Dynamic Networks.
    In <i>STACS</i> (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 <i>STACS</i>, 2285:27--49. Lecture Notes in Computer Science. Springer,
    2002.
  ieee: C. Scheideler, “Models and Techniques for Communication in Dynamic Networks,”
    in <i>STACS</i>, 2002, vol. 2285, pp. 27--49.
  mla: Scheideler, Christian. “Models and Techniques for Communication in Dynamic
    Networks.” <i>STACS</i>, 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: '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. <i>Combinatorica</i>. 2001;21(1):95--138.
    doi:<a href="https://doi.org/10.1007/s004930170007">10.1007/s004930170007</a>'
  apa: 'Meyer auf der Heide, F., &#38; Scheideler, C. (2001). Deterministic Routing
    With Bounded Buffers: Turning Offline Into Online Protocols. <i>Combinatorica</i>,
    <i>21</i>(1), 95--138. <a href="https://doi.org/10.1007/s004930170007">https://doi.org/10.1007/s004930170007</a>'
  bibtex: '@article{Meyer auf der Heide_Scheideler_2001, title={Deterministic Routing
    With Bounded Buffers: Turning Offline Into Online Protocols}, volume={21}, DOI={<a
    href="https://doi.org/10.1007/s004930170007">10.1007/s004930170007</a>}, 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.” <i>Combinatorica</i>
    21, no. 1 (2001): 95--138. <a href="https://doi.org/10.1007/s004930170007">https://doi.org/10.1007/s004930170007</a>.'
  ieee: 'F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing With Bounded
    Buffers: Turning Offline Into Online Protocols,” <i>Combinatorica</i>, 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.” <i>Combinatorica</i>,
    vol. 21, no. 1, 2001, pp. 95--138, doi:<a href="https://doi.org/10.1007/s004930170007">10.1007/s004930170007</a>.'
  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: <i>FOCS</i>. IEEE Computer Society; 2001:158--167.'
  apa: Awerbuch, B., Berenbrink, P., Brinkmann, A., &#38; Scheideler, C. (2001). Simple
    Routing Strategies for Adversarial Systems. In <i>FOCS</i> (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 <i>FOCS</i>, 158--167.
    IEEE Computer Society, 2001.
  ieee: B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler, “Simple Routing
    Strategies for Adversarial Systems,” in <i>FOCS</i>, 2001, pp. 158--167.
  mla: Awerbuch, Baruch, et al. “Simple Routing Strategies for Adversarial Systems.”
    <i>FOCS</i>, 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'
...