---
_id: '2114'
author:
- first_name: Miroslaw
full_name: Korzeniowski, Miroslaw
last_name: Korzeniowski
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Korzeniowski M, Scheideler C. Transparent Data Structures, or How to Make
Search Trees Robust in a Distributed Environment. In: ISPAN. ; 2005:182--187.'
apa: Korzeniowski, M., & Scheideler, C. (2005). Transparent Data Structures,
or How to Make Search Trees Robust in a Distributed Environment. In ISPAN
(pp. 182--187).
bibtex: '@inproceedings{Korzeniowski_Scheideler_2005, title={Transparent Data Structures,
or How to Make Search Trees Robust in a Distributed Environment}, booktitle={ISPAN},
author={Korzeniowski, Miroslaw and Scheideler, Christian}, year={2005}, pages={182--187}
}'
chicago: Korzeniowski, Miroslaw, and Christian Scheideler. “Transparent Data Structures,
or How to Make Search Trees Robust in a Distributed Environment.” In ISPAN,
182--187, 2005.
ieee: M. Korzeniowski and C. Scheideler, “Transparent Data Structures, or How to
Make Search Trees Robust in a Distributed Environment,” in ISPAN, 2005,
pp. 182--187.
mla: Korzeniowski, Miroslaw, and Christian Scheideler. “Transparent Data Structures,
or How to Make Search Trees Robust in a Distributed Environment.” ISPAN,
2005, pp. 182--187.
short: 'M. Korzeniowski, C. Scheideler, in: ISPAN, 2005, pp. 182--187.'
date_created: 2018-04-03T05:25:16Z
date_updated: 2022-01-06T06:54:47Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T08:45:41Z
date_updated: 2018-04-13T08:45:41Z
file_id: '2325'
file_name: KS-ISPAN-05-TransData.pdf
file_size: 110389
relation: main_file
file_date_updated: 2018-04-13T08:45:41Z
has_accepted_license: '1'
oa: '1'
page: 182--187
publication: ISPAN
status: public
title: Transparent Data Structures, or How to Make Search Trees Robust in a Distributed
Environment
type: conference
urn: '21146'
user_id: '15504'
year: '2005'
...
---
_id: '2115'
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. Supervised Peer-to-Peer Systems. In: ISPAN.
; 2005:188--193.'
apa: Kothapalli, K., & Scheideler, C. (2005). Supervised Peer-to-Peer Systems.
In ISPAN (pp. 188--193).
bibtex: '@inproceedings{Kothapalli_Scheideler_2005, title={Supervised Peer-to-Peer
Systems}, booktitle={ISPAN}, author={Kothapalli, Kishore and Scheideler, Christian},
year={2005}, pages={188--193} }'
chicago: Kothapalli, Kishore, and Christian Scheideler. “Supervised Peer-to-Peer
Systems.” In ISPAN, 188--193, 2005.
ieee: K. Kothapalli and C. Scheideler, “Supervised Peer-to-Peer Systems,” in ISPAN,
2005, pp. 188--193.
mla: Kothapalli, Kishore, and Christian Scheideler. “Supervised Peer-to-Peer Systems.”
ISPAN, 2005, pp. 188--193.
short: 'K. Kothapalli, C. Scheideler, in: ISPAN, 2005, pp. 188--193.'
date_created: 2018-04-03T05:26:10Z
date_updated: 2022-01-06T06:54:47Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T08:50:40Z
date_updated: 2018-04-13T08:50:40Z
file_id: '2326'
file_name: KS-ISPAN-05-Supervised.pdf
file_size: 69350
relation: main_file
file_date_updated: 2018-04-13T08:50:40Z
has_accepted_license: '1'
oa: '1'
page: 188--193
publication: ISPAN
status: public
title: Supervised Peer-to-Peer Systems
type: conference
urn: '21156'
user_id: '15504'
year: '2005'
...
---
_id: '2116'
author:
- first_name: Melih
full_name: Onus, Melih
last_name: Onus
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Kishore
full_name: Kothapalli, Kishore
last_name: Kothapalli
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Onus M, W. Richa A, Kothapalli K, Scheideler C. Efficient Broadcasting and
Gathering in Wireless Ad-Hoc Networks. In: ISPAN. ; 2005:346--351.'
apa: Onus, M., W. Richa, A., Kothapalli, K., & Scheideler, C. (2005). Efficient
Broadcasting and Gathering in Wireless Ad-Hoc Networks. In ISPAN (pp. 346--351).
bibtex: '@inproceedings{Onus_W. Richa_Kothapalli_Scheideler_2005, title={Efficient
Broadcasting and Gathering in Wireless Ad-Hoc Networks}, booktitle={ISPAN}, author={Onus,
Melih and W. Richa, Andrea and Kothapalli, Kishore and Scheideler, Christian},
year={2005}, pages={346--351} }'
chicago: Onus, Melih, Andrea W. Richa, Kishore Kothapalli, and Christian Scheideler.
“Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks.” In ISPAN,
346--351, 2005.
ieee: M. Onus, A. W. Richa, K. Kothapalli, and C. Scheideler, “Efficient Broadcasting
and Gathering in Wireless Ad-Hoc Networks,” in ISPAN, 2005, pp. 346--351.
mla: Onus, Melih, et al. “Efficient Broadcasting and Gathering in Wireless Ad-Hoc
Networks.” ISPAN, 2005, pp. 346--351.
short: 'M. Onus, A. W. Richa, K. Kothapalli, C. Scheideler, in: ISPAN, 2005, pp.
346--351.'
date_created: 2018-04-03T05:26:50Z
date_updated: 2022-01-06T06:54:48Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T08:55:51Z
date_updated: 2018-04-13T08:55:51Z
file_id: '2327'
file_name: KORS-ISPAN-05.pdf
file_size: 135267
relation: main_file
file_date_updated: 2018-04-13T08:55:51Z
has_accepted_license: '1'
oa: '1'
page: 346--351
publication: ISPAN
status: public
title: Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks
type: conference
urn: '21165'
user_id: '15504'
year: '2005'
...
---
_id: '2117'
author:
- first_name: Kishore
full_name: Kothapalli, Kishore
last_name: Kothapalli
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Melih
full_name: Onus, Melih
last_name: Onus
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
citation:
ama: 'Kothapalli K, Scheideler C, Onus M, W. Richa A. Constant density spanners
for wireless ad-hoc networks. In: SPAA. ; 2005:116--125.'
apa: Kothapalli, K., Scheideler, C., Onus, M., & W. Richa, A. (2005). Constant
density spanners for wireless ad-hoc networks. In SPAA (pp. 116--125).
bibtex: '@inproceedings{Kothapalli_Scheideler_Onus_W. Richa_2005, title={Constant
density spanners for wireless ad-hoc networks}, booktitle={SPAA}, author={Kothapalli,
Kishore and Scheideler, Christian and Onus, Melih and W. Richa, Andrea}, year={2005},
pages={116--125} }'
chicago: Kothapalli, Kishore, Christian Scheideler, Melih Onus, and Andrea W. Richa.
“Constant Density Spanners for Wireless Ad-Hoc Networks.” In SPAA, 116--125,
2005.
ieee: K. Kothapalli, C. Scheideler, M. Onus, and A. W. Richa, “Constant density
spanners for wireless ad-hoc networks,” in SPAA, 2005, pp. 116--125.
mla: Kothapalli, Kishore, et al. “Constant Density Spanners for Wireless Ad-Hoc
Networks.” SPAA, 2005, pp. 116--125.
short: 'K. Kothapalli, C. Scheideler, M. Onus, A. W. Richa, in: SPAA, 2005, pp.
116--125.'
date_created: 2018-04-03T05:28:33Z
date_updated: 2022-01-06T06:54:48Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T08:56:49Z
date_updated: 2018-04-13T08:56:49Z
file_id: '2328'
file_name: SPAA-05.pdf
file_size: 118644
relation: main_file
file_date_updated: 2018-04-13T08:56:49Z
has_accepted_license: '1'
oa: '1'
page: 116--125
publication: SPAA
status: public
title: Constant density spanners for wireless ad-hoc networks
type: conference
urn: '21175'
user_id: '15504'
year: '2005'
...
---
_id: '2118'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Scheideler C. How to spread adversarial nodes?: rotate! In: STOC. ;
2005:704--713.'
apa: 'Scheideler, C. (2005). How to spread adversarial nodes?: rotate! In STOC
(pp. 704--713).'
bibtex: '@inproceedings{Scheideler_2005, title={How to spread adversarial nodes?:
rotate!}, booktitle={STOC}, author={Scheideler, Christian}, year={2005}, pages={704--713}
}'
chicago: 'Scheideler, Christian. “How to Spread Adversarial Nodes?: Rotate!” In
STOC, 704--713, 2005.'
ieee: 'C. Scheideler, “How to spread adversarial nodes?: rotate!,” in STOC,
2005, pp. 704--713.'
mla: 'Scheideler, Christian. “How to Spread Adversarial Nodes?: Rotate!” STOC,
2005, pp. 704--713.'
short: 'C. Scheideler, in: STOC, 2005, pp. 704--713.'
date_created: 2018-04-03T05:29:27Z
date_updated: 2022-01-06T06:54:49Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T08:58:22Z
date_updated: 2018-04-13T08:58:22Z
file_id: '2330'
file_name: STOC-05.pdf
file_size: 134460
relation: main_file
file_date_updated: 2018-04-13T08:58:22Z
has_accepted_license: '1'
oa: '1'
page: 704--713
publication: STOC
status: public
title: 'How to spread adversarial nodes?: rotate!'
type: conference
urn: '21185'
user_id: '15504'
year: '2005'
...
---
_id: '2212'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Scheideler C. Overlay networks for wireless ad hoc networks. In: IMA Workshop
on Wireless Communications. ; 2005.'
apa: Scheideler, C. (2005). Overlay networks for wireless ad hoc networks. In IMA
Workshop on Wireless Communications.
bibtex: '@inproceedings{Scheideler_2005, title={Overlay networks for wireless ad
hoc networks}, booktitle={IMA Workshop on Wireless Communications}, author={Scheideler,
Christian}, year={2005} }'
chicago: Scheideler, Christian. “Overlay Networks for Wireless Ad Hoc Networks.”
In IMA Workshop on Wireless Communications, 2005.
ieee: C. Scheideler, “Overlay networks for wireless ad hoc networks,” in IMA
Workshop on Wireless Communications, 2005.
mla: Scheideler, Christian. “Overlay Networks for Wireless Ad Hoc Networks.” IMA
Workshop on Wireless Communications, 2005.
short: 'C. Scheideler, in: IMA Workshop on Wireless Communications, 2005.'
date_created: 2018-04-05T07:05:16Z
date_updated: 2022-01-06T06:55:26Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T08:57:39Z
date_updated: 2018-04-13T08:57:39Z
file_id: '2329'
file_name: IMA-05.pdf
file_size: 295333
relation: main_file
file_date_updated: 2018-04-13T08:57:39Z
has_accepted_license: '1'
oa: '1'
publication: IMA Workshop on Wireless Communications
status: public
title: Overlay networks for wireless ad hoc networks
type: conference
urn: '22129'
user_id: '15504'
year: '2005'
...
---
_id: '2029'
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.
J Algorithms. 2006;61(1):20--44. doi:10.1016/j.jalgor.2004.07.006
apa: Kolman, P., & Scheideler, C. (2006). Improved bounds for the unsplittable
flow problem. J. Algorithms, 61(1), 20--44. https://doi.org/10.1016/j.jalgor.2004.07.006
bibtex: '@article{Kolman_Scheideler_2006, title={Improved bounds for the unsplittable
flow problem}, volume={61}, DOI={10.1016/j.jalgor.2004.07.006},
number={1}, journal={J. Algorithms}, author={Kolman, Petr and Scheideler, Christian},
year={2006}, pages={20--44} }'
chicago: 'Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable
Flow Problem.” J. Algorithms 61, no. 1 (2006): 20--44. https://doi.org/10.1016/j.jalgor.2004.07.006.'
ieee: P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,”
J. Algorithms, vol. 61, no. 1, pp. 20--44, 2006.
mla: Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable
Flow Problem.” J. Algorithms, vol. 61, no. 1, 2006, pp. 20--44, doi:10.1016/j.jalgor.2004.07.006.
short: P. Kolman, C. Scheideler, J. Algorithms 61 (2006) 20--44.
date_created: 2018-03-29T12:01:37Z
date_updated: 2022-01-06T06:54:25Z
department:
- _id: '79'
doi: 10.1016/j.jalgor.2004.07.006
intvolume: ' 61'
issue: '1'
page: 20--44
publication: J. Algorithms
status: public
title: Improved bounds for the unsplittable flow problem
type: journal_article
user_id: '15504'
volume: 61
year: '2006'
...
---
_id: '2110'
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.
IEEE Trans Mob Comput. 2006;(9):1242--1254. doi:10.1109/TMC.2006.138
apa: Ateniese, G., Riley, C., & Scheideler, C. (2006). Survivable Monitoring
in Dynamic Networks. IEEE Trans. Mob. Comput., (9), 1242--1254. https://doi.org/10.1109/TMC.2006.138
bibtex: '@article{Ateniese_Riley_Scheideler_2006, title={Survivable Monitoring in
Dynamic Networks}, DOI={10.1109/TMC.2006.138},
number={9}, journal={IEEE Trans. Mob. Comput.}, author={Ateniese, Giuseppe and
Riley, Chris and Scheideler, Christian}, year={2006}, pages={1242--1254} }'
chicago: 'Ateniese, Giuseppe, Chris Riley, and Christian Scheideler. “Survivable
Monitoring in Dynamic Networks.” IEEE Trans. Mob. Comput., no. 9 (2006):
1242--1254. https://doi.org/10.1109/TMC.2006.138.'
ieee: G. Ateniese, C. Riley, and C. Scheideler, “Survivable Monitoring in Dynamic
Networks,” IEEE Trans. Mob. Comput., no. 9, pp. 1242--1254, 2006.
mla: Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.” IEEE
Trans. Mob. Comput., no. 9, 2006, pp. 1242--1254, doi:10.1109/TMC.2006.138.
short: G. Ateniese, C. Riley, C. Scheideler, IEEE Trans. Mob. Comput. (2006) 1242--1254.
date_created: 2018-04-03T05:21:30Z
date_updated: 2022-01-06T06:54:45Z
department:
- _id: '79'
doi: 10.1109/TMC.2006.138
issue: '9'
page: 1242--1254
publication: IEEE Trans. Mob. Comput.
status: public
title: Survivable Monitoring in Dynamic Networks
type: journal_article
user_id: '15504'
year: '2006'
...
---
_id: '2111'
author:
- first_name: Kishore
full_name: Kothapalli, Kishore
last_name: Kothapalli
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Melih
full_name: Onus, Melih
last_name: Onus
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Kothapalli K, Scheideler C, Onus M, Schindelhauer C. Distributed coloring
in O/spl tilde/(/spl radic/(log n)) bit rounds. In: IPDPS. ; 2006.'
apa: Kothapalli, K., Scheideler, C., Onus, M., & Schindelhauer, C. (2006). Distributed
coloring in O/spl tilde/(/spl radic/(log n)) bit rounds. In IPDPS.
bibtex: '@inproceedings{Kothapalli_Scheideler_Onus_Schindelhauer_2006, title={Distributed
coloring in O/spl tilde/(/spl radic/(log n)) bit rounds}, booktitle={IPDPS}, author={Kothapalli,
Kishore and Scheideler, Christian and Onus, Melih and Schindelhauer, Christian},
year={2006} }'
chicago: Kothapalli, Kishore, Christian Scheideler, Melih Onus, and Christian Schindelhauer.
“Distributed Coloring in O/Spl Tilde/(/Spl Radic/(Log n)) Bit Rounds.” In IPDPS,
2006.
ieee: K. Kothapalli, C. Scheideler, M. Onus, and C. Schindelhauer, “Distributed
coloring in O/spl tilde/(/spl radic/(log n)) bit rounds,” in IPDPS, 2006.
mla: Kothapalli, Kishore, et al. “Distributed Coloring in O/Spl Tilde/(/Spl Radic/(Log
n)) Bit Rounds.” IPDPS, 2006.
short: 'K. Kothapalli, C. Scheideler, M. Onus, C. Schindelhauer, in: IPDPS, 2006.'
date_created: 2018-04-03T05:22:43Z
date_updated: 2022-01-06T06:54:46Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T09:57:03Z
date_updated: 2018-04-13T09:57:03Z
file_id: '2334'
file_name: IPDPS06.pdf
file_size: 192708
relation: main_file
file_date_updated: 2018-04-13T09:57:03Z
has_accepted_license: '1'
oa: '1'
publication: IPDPS
status: public
title: Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds
type: conference
urn: '21110'
user_id: '15504'
year: '2006'
...
---
_id: '2112'
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 Random Number Generation for Peer-to-Peer
Systems. In: OPODIS. Lecture Notes in Computer Science. ; 2006:275--289.'
apa: Awerbuch, B., & Scheideler, C. (2006). Robust Random Number Generation
for Peer-to-Peer Systems. In OPODIS (pp. 275--289).
bibtex: '@inproceedings{Awerbuch_Scheideler_2006, series={Lecture Notes in Computer
Science}, title={Robust Random Number Generation for Peer-to-Peer Systems}, booktitle={OPODIS},
author={Awerbuch, Baruch and Scheideler, Christian}, year={2006}, pages={275--289},
collection={Lecture Notes in Computer Science} }'
chicago: Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation
for Peer-to-Peer Systems.” In OPODIS, 275--289. Lecture Notes in Computer
Science, 2006.
ieee: B. Awerbuch and C. Scheideler, “Robust Random Number Generation for Peer-to-Peer
Systems,” in OPODIS, 2006, pp. 275--289.
mla: Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation
for Peer-to-Peer Systems.” OPODIS, 2006, pp. 275--289.
short: 'B. Awerbuch, C. Scheideler, in: OPODIS, 2006, pp. 275--289.'
date_created: 2018-04-03T05:23:39Z
date_updated: 2022-01-06T06:54:46Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T09:57:51Z
date_updated: 2018-04-13T09:57:51Z
file_id: '2335'
file_name: OPODIS06.pdf
file_size: 198976
relation: main_file
file_date_updated: 2018-04-13T09:57:51Z
has_accepted_license: '1'
oa: '1'
page: 275--289
publication: OPODIS
series_title: Lecture Notes in Computer Science
status: public
title: Robust Random Number Generation for Peer-to-Peer Systems
type: conference
urn: '21128'
user_id: '15504'
year: '2006'
...
---
_id: '2113'
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. Towards a scalable and robust DHT. In: SPAA.
; 2006:318--327.'
apa: Awerbuch, B., & Scheideler, C. (2006). Towards a scalable and robust DHT.
In SPAA (pp. 318--327).
bibtex: '@inproceedings{Awerbuch_Scheideler_2006, title={Towards a scalable and
robust DHT}, booktitle={SPAA}, author={Awerbuch, Baruch and Scheideler, Christian},
year={2006}, pages={318--327} }'
chicago: Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust
DHT.” In SPAA, 318--327, 2006.
ieee: B. Awerbuch and C. Scheideler, “Towards a scalable and robust DHT,” in SPAA,
2006, pp. 318--327.
mla: Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust
DHT.” SPAA, 2006, pp. 318--327.
short: 'B. Awerbuch, C. Scheideler, in: SPAA, 2006, pp. 318--327.'
date_created: 2018-04-03T05:24:22Z
date_updated: 2022-01-06T06:54:46Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T10:00:09Z
date_updated: 2018-04-13T10:00:09Z
file_id: '2337'
file_name: SPAA06.pdf
file_size: 144588
relation: main_file
file_date_updated: 2018-04-13T10:00:09Z
has_accepted_license: '1'
oa: '1'
page: 318--327
publication: SPAA
status: public
title: Towards a scalable and robust DHT
type: conference
urn: '21137'
user_id: '15504'
year: '2006'
...
---
_id: '2043'
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. Theory Comput Syst. 2006;(6):903--928. doi:10.1007/s00224-006-1349-0
apa: Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., & Scheideler, C.
(2006). The Effect of Faults on Network Expansion. Theory Comput. Syst.,
(6), 903--928. https://doi.org/10.1007/s00224-006-1349-0
bibtex: '@article{Bagchi_Bhargava_Chaudhary_Eppstein_Scheideler_2006, title={The
Effect of Faults on Network Expansion}, DOI={10.1007/s00224-006-1349-0},
number={6}, journal={Theory Comput. Syst.}, author={Bagchi, Amitabha and Bhargava,
Ankur and Chaudhary, Amitabh and Eppstein, David and Scheideler, Christian}, year={2006},
pages={903--928} }'
chicago: 'Bagchi, Amitabha, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, and
Christian Scheideler. “The Effect of Faults on Network Expansion.” Theory Comput.
Syst., no. 6 (2006): 903--928. https://doi.org/10.1007/s00224-006-1349-0.'
ieee: A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler, “The
Effect of Faults on Network Expansion,” Theory Comput. Syst., no. 6, pp.
903--928, 2006.
mla: Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” Theory
Comput. Syst., no. 6, 2006, pp. 903--928, doi:10.1007/s00224-006-1349-0.
short: A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, Theory
Comput. Syst. (2006) 903--928.
date_created: 2018-03-29T12:32:54Z
date_updated: 2022-01-06T06:54:27Z
department:
- _id: '79'
doi: 10.1007/s00224-006-1349-0
issue: '6'
page: 903--928
publication: Theory Comput. Syst.
status: public
title: The Effect of Faults on Network Expansion
type: journal_article
user_id: '15504'
year: '2006'
...
---
_id: '2213'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Scheideler C. Towards a paradigm for robust distributed algorithms and data
structures. In: 6th International HNI Symposium on New Trends in Parallel and
Distributed Computing. ; 2006.'
apa: Scheideler, C. (2006). Towards a paradigm for robust distributed algorithms
and data structures. In 6th International HNI Symposium on New Trends in Parallel
and Distributed Computing.
bibtex: '@inproceedings{Scheideler_2006, title={Towards a paradigm for robust distributed
algorithms and data structures}, booktitle={6th International HNI Symposium on
New Trends in Parallel and Distributed Computing}, author={Scheideler, Christian},
year={2006} }'
chicago: Scheideler, Christian. “Towards a Paradigm for Robust Distributed Algorithms
and Data Structures.” In 6th International HNI Symposium on New Trends in Parallel
and Distributed Computing, 2006.
ieee: C. Scheideler, “Towards a paradigm for robust distributed algorithms and data
structures,” in 6th International HNI Symposium on New Trends in Parallel and
Distributed Computing, 2006.
mla: Scheideler, Christian. “Towards a Paradigm for Robust Distributed Algorithms
and Data Structures.” 6th International HNI Symposium on New Trends in Parallel
and Distributed Computing, 2006.
short: 'C. Scheideler, in: 6th International HNI Symposium on New Trends in Parallel
and Distributed Computing, 2006.'
date_created: 2018-04-05T07:06:44Z
date_updated: 2022-01-06T06:55:27Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T09:59:14Z
date_updated: 2018-04-13T09:59:14Z
file_id: '2336'
file_name: HNI-Symposium-06.pdf
file_size: 85116
relation: main_file
file_date_updated: 2018-04-13T09:59:14Z
has_accepted_license: '1'
oa: '1'
publication: 6th International HNI Symposium on New Trends in Parallel and Distributed
Computing
status: public
title: Towards a paradigm for robust distributed algorithms and data structures
type: conference
urn: '22137'
user_id: '15504'
year: '2006'
...
---
_id: '2017'
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. SIAM J Discrete Math. 2007;(1):141--157.
doi:10.1137/S0895480102419743
apa: Bagchi, A., Chaudhary, A., Scheideler, C., & Kolman, P. (2007). Algorithms
for Fault-Tolerant Routing in Circuit-Switched Networks. SIAM J. Discrete Math.,
(1), 141--157. https://doi.org/10.1137/S0895480102419743
bibtex: '@article{Bagchi_Chaudhary_Scheideler_Kolman_2007, title={Algorithms for
Fault-Tolerant Routing in Circuit-Switched Networks}, DOI={10.1137/S0895480102419743},
number={1}, journal={SIAM J. Discrete Math.}, author={Bagchi, Amitabha and Chaudhary,
Amitabh and Scheideler, Christian and Kolman, Petr}, year={2007}, pages={141--157}
}'
chicago: 'Bagchi, Amitabha, Amitabh Chaudhary, Christian Scheideler, and Petr Kolman.
“Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks.” SIAM
J. Discrete Math., no. 1 (2007): 141--157. https://doi.org/10.1137/S0895480102419743.'
ieee: A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, “Algorithms for Fault-Tolerant
Routing in Circuit-Switched Networks,” SIAM J. Discrete Math., no. 1, pp.
141--157, 2007.
mla: Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit-Switched
Networks.” SIAM J. Discrete Math., no. 1, 2007, pp. 141--157, doi:10.1137/S0895480102419743.
short: A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, SIAM J. Discrete Math.
(2007) 141--157.
date_created: 2018-03-29T11:50:23Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '79'
doi: 10.1137/S0895480102419743
issue: '1'
page: 141--157
publication: SIAM J. Discrete Math.
status: public
title: Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks
type: journal_article
user_id: '15504'
year: '2007'
...
---
_id: '2020'
author:
- first_name: Melih
full_name: Onus, Melih
last_name: Onus
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Onus M, W. Richa A, Scheideler C. Linearization: Locally Self-Stabilizing
Sorting in Graphs. In: Proceedings of the Nine Workshop on Algorithm Engineering
and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007.
; 2007. doi:10.1137/1.9781611972870.10'
apa: 'Onus, M., W. Richa, A., & Scheideler, C. (2007). Linearization: Locally
Self-Stabilizing Sorting in Graphs. In Proceedings of the Nine Workshop on
Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA,
January 6, 2007. https://doi.org/10.1137/1.9781611972870.10'
bibtex: '@inproceedings{Onus_W. Richa_Scheideler_2007, title={Linearization: Locally
Self-Stabilizing Sorting in Graphs}, DOI={10.1137/1.9781611972870.10},
booktitle={Proceedings of the Nine Workshop on Algorithm Engineering and Experiments,
ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007}, author={Onus, Melih
and W. Richa, Andrea and Scheideler, Christian}, year={2007} }'
chicago: 'Onus, Melih, Andrea W. Richa, and Christian Scheideler. “Linearization:
Locally Self-Stabilizing Sorting in Graphs.” In Proceedings of the Nine Workshop
on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana,
USA, January 6, 2007, 2007. https://doi.org/10.1137/1.9781611972870.10.'
ieee: 'M. Onus, A. W. Richa, and C. Scheideler, “Linearization: Locally Self-Stabilizing
Sorting in Graphs,” in Proceedings of the Nine Workshop on Algorithm Engineering
and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007,
2007.'
mla: 'Onus, Melih, et al. “Linearization: Locally Self-Stabilizing Sorting in Graphs.”
Proceedings of the Nine Workshop on Algorithm Engineering and Experiments,
ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007, 2007, doi:10.1137/1.9781611972870.10.'
short: 'M. Onus, A. W. Richa, C. Scheideler, in: Proceedings of the Nine Workshop
on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana,
USA, January 6, 2007, 2007.'
date_created: 2018-03-29T11:54:37Z
date_updated: 2022-01-06T06:54:23Z
department:
- _id: '79'
doi: 10.1137/1.9781611972870.10
publication: Proceedings of the Nine Workshop on Algorithm Engineering and Experiments,
ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007
publication_identifier:
isbn:
- 978-1-61197-287-0
status: public
title: 'Linearization: Locally Self-Stabilizing Sorting in Graphs'
type: conference
user_id: '15504'
year: '2007'
...
---
_id: '2022'
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. Towards Scalable and Robust Overlay Networks. In:
6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA,
USA, February 26-27, 2007. ; 2007.'
apa: Awerbuch, B., & Scheideler, C. (2007). Towards Scalable and Robust Overlay
Networks. In 6th International workshop on Peer-To-Peer Systems, IPTPS 2007,
Bellevue, WA, USA, February 26-27, 2007.
bibtex: '@inproceedings{Awerbuch_Scheideler_2007, title={Towards Scalable and Robust
Overlay Networks}, booktitle={6th International workshop on Peer-To-Peer Systems,
IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007}, author={Awerbuch, Baruch
and Scheideler, Christian}, year={2007} }'
chicago: Awerbuch, Baruch, and Christian Scheideler. “Towards Scalable and Robust
Overlay Networks.” In 6th International Workshop on Peer-To-Peer Systems, IPTPS
2007, Bellevue, WA, USA, February 26-27, 2007, 2007.
ieee: B. Awerbuch and C. Scheideler, “Towards Scalable and Robust Overlay Networks,”
in 6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue,
WA, USA, February 26-27, 2007, 2007.
mla: Awerbuch, Baruch, and Christian Scheideler. “Towards Scalable and Robust Overlay
Networks.” 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007,
Bellevue, WA, USA, February 26-27, 2007, 2007.
short: 'B. Awerbuch, C. Scheideler, in: 6th International Workshop on Peer-To-Peer
Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.'
date_created: 2018-03-29T11:55:52Z
date_updated: 2022-01-06T06:54:23Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T10:00:55Z
date_updated: 2018-04-13T10:00:55Z
file_id: '2338'
file_name: IPTPS07.pdf
file_size: 191943
relation: main_file
file_date_updated: 2018-04-13T10:00:55Z
has_accepted_license: '1'
oa: '1'
publication: 6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue,
WA, USA, February 26-27, 2007
status: public
title: Towards Scalable and Robust Overlay Networks
type: conference
urn: '20228'
user_id: '15504'
year: '2007'
...
---
_id: '2023'
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. A denial-of-service resistant DHT. In: Proceedings
of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing,
PODC 2007, Portland, Oregon, USA, August 12-15, 2007. ACM; 2007:370--371.
doi:10.1145/1281100.1281178'
apa: Awerbuch, B., & Scheideler, C. (2007). A denial-of-service resistant DHT.
In Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed
Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007 (pp. 370--371).
ACM. https://doi.org/10.1145/1281100.1281178
bibtex: '@inproceedings{Awerbuch_Scheideler_2007, title={A denial-of-service resistant
DHT}, DOI={10.1145/1281100.1281178},
booktitle={Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles
of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007},
publisher={ACM}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2007},
pages={370--371} }'
chicago: Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant
DHT.” In Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles
of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007,
370--371. ACM, 2007. https://doi.org/10.1145/1281100.1281178.
ieee: B. Awerbuch and C. Scheideler, “A denial-of-service resistant DHT,” in Proceedings
of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing,
PODC 2007, Portland, Oregon, USA, August 12-15, 2007, 2007, pp. 370--371.
mla: Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant
DHT.” Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of
Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007,
ACM, 2007, pp. 370--371, doi:10.1145/1281100.1281178.
short: 'B. Awerbuch, C. Scheideler, in: Proceedings of the Twenty-Sixth Annual ACM
Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon,
USA, August 12-15, 2007, ACM, 2007, pp. 370--371.'
date_created: 2018-03-29T11:56:35Z
date_updated: 2022-01-06T06:54:24Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/1281100.1281178
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T10:02:18Z
date_updated: 2018-04-13T10:02:18Z
file_id: '2340'
file_name: DISC-07.pdf
file_size: 193097
relation: main_file
file_date_updated: 2018-04-13T10:02:18Z
has_accepted_license: '1'
oa: '1'
page: 370--371
publication: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of
Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007
publication_identifier:
isbn:
- 978-1-59593-616-5
publisher: ACM
status: public
title: A denial-of-service resistant DHT
type: conference
urn: '20237'
user_id: '15504'
year: '2007'
...
---
_id: '2024'
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. A Denial-of-Service Resistant DHT. In: Distributed
Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September
24-26, 2007, Proceedings. Vol 4731. Lecture Notes in Computer Science. Springer;
2007:33--47. doi:10.1007/978-3-540-75142-7_6'
apa: Awerbuch, B., & Scheideler, C. (2007). A Denial-of-Service Resistant DHT.
In Distributed Computing, 21st International Symposium, DISC 2007, Lemesos,
Cyprus, September 24-26, 2007, Proceedings (Vol. 4731, pp. 33--47). Springer.
https://doi.org/10.1007/978-3-540-75142-7_6
bibtex: '@inproceedings{Awerbuch_Scheideler_2007, series={Lecture Notes in Computer
Science}, title={A Denial-of-Service Resistant DHT}, volume={4731}, DOI={10.1007/978-3-540-75142-7_6},
booktitle={Distributed Computing, 21st International Symposium, DISC 2007, Lemesos,
Cyprus, September 24-26, 2007, Proceedings}, publisher={Springer}, author={Awerbuch,
Baruch and Scheideler, Christian}, year={2007}, pages={33--47}, collection={Lecture
Notes in Computer Science} }'
chicago: Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant
DHT.” In Distributed Computing, 21st International Symposium, DISC 2007, Lemesos,
Cyprus, September 24-26, 2007, Proceedings, 4731:33--47. Lecture Notes in
Computer Science. Springer, 2007. https://doi.org/10.1007/978-3-540-75142-7_6.
ieee: B. Awerbuch and C. Scheideler, “A Denial-of-Service Resistant DHT,” in Distributed
Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September
24-26, 2007, Proceedings, 2007, vol. 4731, pp. 33--47.
mla: Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant
DHT.” Distributed Computing, 21st International Symposium, DISC 2007, Lemesos,
Cyprus, September 24-26, 2007, Proceedings, vol. 4731, Springer, 2007, pp.
33--47, doi:10.1007/978-3-540-75142-7_6.
short: 'B. Awerbuch, C. Scheideler, in: Distributed Computing, 21st International
Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, Springer,
2007, pp. 33--47.'
date_created: 2018-03-29T11:57:42Z
date_updated: 2022-01-06T06:54:24Z
department:
- _id: '79'
doi: 10.1007/978-3-540-75142-7_6
intvolume: ' 4731'
page: 33--47
publication: Distributed Computing, 21st International Symposium, DISC 2007, Lemesos,
Cyprus, September 24-26, 2007, Proceedings
publication_identifier:
isbn:
- 978-3-540-75141-0
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: A Denial-of-Service Resistant DHT
type: conference
user_id: '15504'
volume: 4731
year: '2007'
...
---
_id: '2028'
author:
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'W. Richa A, Scheideler C. Overlay Networks for Peer-to-Peer Networks. In:
Handbook of Approximation Algorithms and Metaheuristics. ; 2007. doi:10.1201/9781420010749.ch72'
apa: W. Richa, A., & Scheideler, C. (2007). Overlay Networks for Peer-to-Peer
Networks. In Handbook of Approximation Algorithms and Metaheuristics. https://doi.org/10.1201/9781420010749.ch72
bibtex: '@inbook{W. Richa_Scheideler_2007, title={Overlay Networks for Peer-to-Peer
Networks}, DOI={10.1201/9781420010749.ch72},
booktitle={Handbook of Approximation Algorithms and Metaheuristics.}, author={W.
Richa, Andrea and Scheideler, Christian}, year={2007} }'
chicago: W. Richa, Andrea, and Christian Scheideler. “Overlay Networks for Peer-to-Peer
Networks.” In Handbook of Approximation Algorithms and Metaheuristics.,
2007. https://doi.org/10.1201/9781420010749.ch72.
ieee: A. W. Richa and C. Scheideler, “Overlay Networks for Peer-to-Peer Networks,”
in Handbook of Approximation Algorithms and Metaheuristics., 2007.
mla: W. Richa, Andrea, and Christian Scheideler. “Overlay Networks for Peer-to-Peer
Networks.” Handbook of Approximation Algorithms and Metaheuristics., 2007,
doi:10.1201/9781420010749.ch72.
short: 'A. W. Richa, C. Scheideler, in: Handbook of Approximation Algorithms and
Metaheuristics., 2007.'
date_created: 2018-03-29T12:00:39Z
date_updated: 2022-01-06T06:54:25Z
department:
- _id: '79'
doi: 10.1201/9781420010749.ch72
publication: Handbook of Approximation Algorithms and Metaheuristics.
publication_identifier:
isbn:
- 978-1-58488-550-4
status: public
title: Overlay Networks for Peer-to-Peer Networks
type: book_chapter
user_id: '15504'
year: '2007'
...
---
_id: '2214'
abstract:
- lang: eng
text: We present a randomized block-level storage virtualization for arbitrary heterogeneous
storage systems that can distribute data in a fair and redundant way and can adapt
this distribution in an efficient way as storage devices enter or leave the system.
More precisely, our virtualization strategies can distribute a set of data blocks
among a set of storage devices of arbitrary non-uniform capacities so that a storage
device representing x% of the capacity in the system will get x% of the data (as
long as this is in principle possible) and the different copies of each data block
are stored so that no two copies of a data block are located in the same device.
Achieving these two properties is not easy, and no virtualization strategy has
been presented so far that has been formally shown to satisfy fairness and redundancy
while being time- and space-eflcient and allowing an efficient adaptation to a
changing set of devices.
author:
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Sascha
full_name: Effert, Sascha
last_name: Effert
- 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: 'Brinkmann A, Effert S, Meyer auf der Heide F, Scheideler C. Dynamic and redundant
data placement. In: IEEE International Conference on Distributed Computing
Systems (ICDCS). ; 2007.'
apa: Brinkmann, A., Effert, S., Meyer auf der Heide, F., & Scheideler, C. (2007).
Dynamic and redundant data placement. IEEE International Conference on Distributed
Computing Systems (ICDCS).
bibtex: '@inproceedings{Brinkmann_Effert_Meyer auf der Heide_Scheideler_2007, title={Dynamic
and redundant data placement}, booktitle={IEEE International Conference on Distributed
Computing Systems (ICDCS)}, author={Brinkmann, André and Effert, Sascha and Meyer
auf der Heide, Friedhelm and Scheideler, Christian}, year={2007} }'
chicago: Brinkmann, André, Sascha Effert, Friedhelm Meyer auf der Heide, and Christian
Scheideler. “Dynamic and Redundant Data Placement.” In IEEE International Conference
on Distributed Computing Systems (ICDCS), 2007.
ieee: A. Brinkmann, S. Effert, F. Meyer auf der Heide, and C. Scheideler, “Dynamic
and redundant data placement,” 2007.
mla: Brinkmann, André, et al. “Dynamic and Redundant Data Placement.” IEEE International
Conference on Distributed Computing Systems (ICDCS), 2007.
short: 'A. Brinkmann, S. Effert, F. Meyer auf der Heide, C. Scheideler, in: IEEE
International Conference on Distributed Computing Systems (ICDCS), 2007.'
date_created: 2018-04-05T07:08:35Z
date_updated: 2022-01-06T06:55:27Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T10:01:42Z
date_updated: 2018-04-13T10:01:42Z
file_id: '2339'
file_name: ICDCS07.pdf
file_size: 164121
relation: main_file
file_date_updated: 2018-04-13T10:01:42Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
publication: IEEE International Conference on Distributed Computing Systems (ICDCS)
status: public
title: Dynamic and redundant data placement
type: conference
urn: '22147'
user_id: '15415'
year: '2007'
...
---
_id: '2209'
author:
- first_name: Vinay
full_name: Aggarwal, Vinay
last_name: Aggarwal
- first_name: Anja
full_name: Feldmann, Anja
last_name: Feldmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Aggarwal V, Feldmann A, Scheideler C. Can ISPs and P2P users cooperate for
improved performance? ACM Computer Commucation Review. 2007. doi:10.1145/1273445.1273449
apa: Aggarwal, V., Feldmann, A., & Scheideler, C. (2007). Can ISPs and P2P users
cooperate for improved performance? ACM Computer Commucation Review. https://doi.org/10.1145/1273445.1273449
bibtex: '@article{Aggarwal_Feldmann_Scheideler_2007, title={Can ISPs and P2P users
cooperate for improved performance?}, DOI={10.1145/1273445.1273449},
journal={ACM Computer Commucation Review}, author={Aggarwal, Vinay and Feldmann,
Anja and Scheideler, Christian}, year={2007} }'
chicago: Aggarwal, Vinay, Anja Feldmann, and Christian Scheideler. “Can ISPs and
P2P Users Cooperate for Improved Performance?” ACM Computer Commucation Review,
2007. https://doi.org/10.1145/1273445.1273449.
ieee: V. Aggarwal, A. Feldmann, and C. Scheideler, “Can ISPs and P2P users cooperate
for improved performance?,” ACM Computer Commucation Review, 2007.
mla: Aggarwal, Vinay, et al. “Can ISPs and P2P Users Cooperate for Improved Performance?”
ACM Computer Commucation Review, 2007, doi:10.1145/1273445.1273449.
short: V. Aggarwal, A. Feldmann, C. Scheideler, ACM Computer Commucation Review
(2007).
date_created: 2018-04-05T06:08:43Z
date_updated: 2022-01-06T06:55:25Z
department:
- _id: '79'
doi: 10.1145/1273445.1273449
publication: ACM Computer Commucation Review
status: public
title: Can ISPs and P2P users cooperate for improved performance?
type: journal_article
user_id: '15504'
year: '2007'
...
---
_id: '1937'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Scheideler C. Algorithms for Overlay Networks. Bulletin of the EATCS.
2008:130--152.
apa: Scheideler, C. (2008). Algorithms for Overlay Networks. Bulletin of the
EATCS, 130--152.
bibtex: '@article{Scheideler_2008, title={Algorithms for Overlay Networks}, journal={Bulletin
of the EATCS}, author={Scheideler, Christian}, year={2008}, pages={130--152} }'
chicago: Scheideler, Christian. “Algorithms for Overlay Networks.” Bulletin of
the EATCS, 2008, 130--152.
ieee: C. Scheideler, “Algorithms for Overlay Networks,” Bulletin of the EATCS,
pp. 130--152, 2008.
mla: Scheideler, Christian. “Algorithms for Overlay Networks.” Bulletin of the
EATCS, 2008, pp. 130--152.
short: C. Scheideler, Bulletin of the EATCS (2008) 130--152.
date_created: 2018-03-29T09:28:22Z
date_updated: 2022-01-06T06:54:03Z
department:
- _id: '79'
page: 130--152
publication: Bulletin of the EATCS
status: public
title: Algorithms for Overlay Networks
type: journal_article
user_id: '15504'
year: '2008'
...
---
_id: '1938'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Andr{\'{e}}a
full_name: W. Richa, Andr{\'{e}}a
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Awerbuch B, W. Richa A, Scheideler C. A jamming-resistant MAC protocol for
single-hop wireless networks. In: Proceedings of the Twenty-Seventh Annual
ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada,
August 18-21, 2008. ACM; 2008:45--54. doi:10.1145/1400751.1400759'
apa: Awerbuch, B., W. Richa, A., & Scheideler, C. (2008). A jamming-resistant
MAC protocol for single-hop wireless networks. In Proceedings of the Twenty-Seventh
Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto,
Canada, August 18-21, 2008 (pp. 45--54). ACM. https://doi.org/10.1145/1400751.1400759
bibtex: '@inproceedings{Awerbuch_W. Richa_Scheideler_2008, title={A jamming-resistant
MAC protocol for single-hop wireless networks}, DOI={10.1145/1400751.1400759},
booktitle={Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles
of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008}, publisher={ACM},
author={Awerbuch, Baruch and W. Richa, Andr{\’{e}}a and Scheideler, Christian},
year={2008}, pages={45--54} }'
chicago: Awerbuch, Baruch, Andr{\’{e}}a W. Richa, and Christian Scheideler. “A Jamming-Resistant
MAC Protocol for Single-Hop Wireless Networks.” In Proceedings of the Twenty-Seventh
Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto,
Canada, August 18-21, 2008, 45--54. ACM, 2008. https://doi.org/10.1145/1400751.1400759.
ieee: B. Awerbuch, A. W. Richa, and C. Scheideler, “A jamming-resistant MAC protocol
for single-hop wireless networks,” in Proceedings of the Twenty-Seventh Annual
ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada,
August 18-21, 2008, 2008, pp. 45--54.
mla: Awerbuch, Baruch, et al. “A Jamming-Resistant MAC Protocol for Single-Hop Wireless
Networks.” Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles
of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008,
ACM, 2008, pp. 45--54, doi:10.1145/1400751.1400759.
short: 'B. Awerbuch, A. W. Richa, C. Scheideler, in: Proceedings of the Twenty-Seventh
Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto,
Canada, August 18-21, 2008, ACM, 2008, pp. 45--54.'
date_created: 2018-03-29T09:29:06Z
date_updated: 2022-01-06T06:54:03Z
department:
- _id: '79'
doi: 10.1145/1400751.1400759
page: 45--54
publication: Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles
of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008
publication_identifier:
isbn:
- 978-1-59593-989-0
publisher: ACM
status: public
title: A jamming-resistant MAC protocol for single-hop wireless networks
type: conference
user_id: '15504'
year: '2008'
...
---
_id: '1940'
author:
- first_name: Mario
full_name: Mense, Mario
last_name: Mense
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Mense M, Scheideler C. SPREAD: an adaptive scheme for redundant and fair storage
in dynamic heterogeneous storage systems. In: Proceedings of the Nineteenth
Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California,
USA, January 20-22, 2008. SIAM; 2008:1135--1144.'
apa: 'Mense, M., & Scheideler, C. (2008). SPREAD: an adaptive scheme for redundant
and fair storage in dynamic heterogeneous storage systems. In Proceedings of
the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San
Francisco, California, USA, January 20-22, 2008 (pp. 1135--1144). SIAM.'
bibtex: '@inproceedings{Mense_Scheideler_2008, title={SPREAD: an adaptive scheme
for redundant and fair storage in dynamic heterogeneous storage systems}, booktitle={Proceedings
of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008,
San Francisco, California, USA, January 20-22, 2008}, publisher={SIAM}, author={Mense,
Mario and Scheideler, Christian}, year={2008}, pages={1135--1144} }'
chicago: 'Mense, Mario, and Christian Scheideler. “SPREAD: An Adaptive Scheme for
Redundant and Fair Storage in Dynamic Heterogeneous Storage Systems.” In Proceedings
of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008,
San Francisco, California, USA, January 20-22, 2008, 1135--1144. SIAM, 2008.'
ieee: 'M. Mense and C. Scheideler, “SPREAD: an adaptive scheme for redundant and
fair storage in dynamic heterogeneous storage systems,” in Proceedings of the
Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco,
California, USA, January 20-22, 2008, 2008, pp. 1135--1144.'
mla: 'Mense, Mario, and Christian Scheideler. “SPREAD: An Adaptive Scheme for Redundant
and Fair Storage in Dynamic Heterogeneous Storage Systems.” Proceedings of
the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San
Francisco, California, USA, January 20-22, 2008, SIAM, 2008, pp. 1135--1144.'
short: 'M. Mense, C. Scheideler, in: Proceedings of the Nineteenth Annual ACM-SIAM
Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January
20-22, 2008, SIAM, 2008, pp. 1135--1144.'
date_created: 2018-03-29T09:30:18Z
date_updated: 2022-01-06T06:54:03Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T10:03:13Z
date_updated: 2018-04-13T10:03:13Z
file_id: '2341'
file_name: SODA08.pdf
file_size: 211264
relation: main_file
file_date_updated: 2018-04-13T10:03:13Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 1135--1144
publication: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms,
SODA 2008, San Francisco, California, USA, January 20-22, 2008
publisher: SIAM
status: public
title: 'SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous
storage systems'
type: conference
urn: '19408'
user_id: '14955'
year: '2008'
...
---
_id: '1941'
author:
- first_name: Thomas
full_name: Clouser, Thomas
last_name: Clouser
- first_name: Mikhail
full_name: Nesterenko, Mikhail
last_name: Nesterenko
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Clouser T, Nesterenko M, Scheideler C. Tiara: A Self-stabilizing Deterministic
Skip List. In: Stabilization, Safety, and Security of Distributed Systems,
10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008.
Proceedings. Vol 5340. Lecture Notes in Computer Science. Springer; 2008:124--140.
doi:10.1007/978-3-540-89335-6_12'
apa: 'Clouser, T., Nesterenko, M., & Scheideler, C. (2008). Tiara: A Self-stabilizing
Deterministic Skip List. In Stabilization, Safety, and Security of Distributed
Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23,
2008. Proceedings (Vol. 5340, pp. 124--140). Springer. https://doi.org/10.1007/978-3-540-89335-6_12'
bibtex: '@inproceedings{Clouser_Nesterenko_Scheideler_2008, series={Lecture Notes
in Computer Science}, title={Tiara: A Self-stabilizing Deterministic Skip List},
volume={5340}, DOI={10.1007/978-3-540-89335-6_12},
booktitle={Stabilization, Safety, and Security of Distributed Systems, 10th International
Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings}, publisher={Springer},
author={Clouser, Thomas and Nesterenko, Mikhail and Scheideler, Christian}, year={2008},
pages={124--140}, collection={Lecture Notes in Computer Science} }'
chicago: 'Clouser, Thomas, Mikhail Nesterenko, and Christian Scheideler. “Tiara:
A Self-Stabilizing Deterministic Skip List.” In Stabilization, Safety, and
Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit,
MI, USA, November 21-23, 2008. Proceedings, 5340:124--140. Lecture Notes in
Computer Science. Springer, 2008. https://doi.org/10.1007/978-3-540-89335-6_12.'
ieee: 'T. Clouser, M. Nesterenko, and C. Scheideler, “Tiara: A Self-stabilizing
Deterministic Skip List,” in Stabilization, Safety, and Security of Distributed
Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23,
2008. Proceedings, 2008, vol. 5340, pp. 124--140.'
mla: 'Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List.”
Stabilization, Safety, and Security of Distributed Systems, 10th International
Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings,
vol. 5340, Springer, 2008, pp. 124--140, doi:10.1007/978-3-540-89335-6_12.'
short: 'T. Clouser, M. Nesterenko, C. Scheideler, in: Stabilization, Safety, and
Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit,
MI, USA, November 21-23, 2008. Proceedings, Springer, 2008, pp. 124--140.'
date_created: 2018-03-29T09:31:18Z
date_updated: 2022-01-06T06:54:03Z
department:
- _id: '79'
doi: 10.1007/978-3-540-89335-6_12
intvolume: ' 5340'
page: 124--140
publication: Stabilization, Safety, and Security of Distributed Systems, 10th International
Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings
publication_identifier:
isbn:
- 978-3-540-89334-9
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Tiara: A Self-stabilizing Deterministic Skip List'
type: conference
user_id: '15504'
volume: 5340
year: '2008'
...
---
_id: '1942'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Scheideler C. Broadcasting: Wie verbreite ich schnell Informationen? In: Taschenbuch
Der Algorithmen. eXamen.press. Springer; 2008:229--236. doi:10.1007/978-3-540-76394-9_22'
apa: 'Scheideler, C. (2008). Broadcasting: Wie verbreite ich schnell Informationen?
In Taschenbuch der Algorithmen (pp. 229--236). Springer. https://doi.org/10.1007/978-3-540-76394-9_22'
bibtex: '@inbook{Scheideler_2008, series={eXamen.press}, title={Broadcasting: Wie
verbreite ich schnell Informationen?}, DOI={10.1007/978-3-540-76394-9_22},
booktitle={Taschenbuch der Algorithmen}, publisher={Springer}, author={Scheideler,
Christian}, year={2008}, pages={229--236}, collection={eXamen.press} }'
chicago: 'Scheideler, Christian. “Broadcasting: Wie Verbreite Ich Schnell Informationen?”
In Taschenbuch Der Algorithmen, 229--236. EXamen.Press. Springer, 2008.
https://doi.org/10.1007/978-3-540-76394-9_22.'
ieee: 'C. Scheideler, “Broadcasting: Wie verbreite ich schnell Informationen?,”
in Taschenbuch der Algorithmen, Springer, 2008, pp. 229--236.'
mla: 'Scheideler, Christian. “Broadcasting: Wie Verbreite Ich Schnell Informationen?”
Taschenbuch Der Algorithmen, Springer, 2008, pp. 229--236, doi:10.1007/978-3-540-76394-9_22.'
short: 'C. Scheideler, in: Taschenbuch Der Algorithmen, Springer, 2008, pp. 229--236.'
date_created: 2018-03-29T09:32:34Z
date_updated: 2022-01-06T06:54:03Z
department:
- _id: '79'
doi: 10.1007/978-3-540-76394-9_22
page: 229--236
publication: Taschenbuch der Algorithmen
publication_identifier:
isbn:
- 978-3-540-76393-2
publisher: Springer
series_title: eXamen.press
status: public
title: 'Broadcasting: Wie verbreite ich schnell Informationen?'
type: book_chapter
user_id: '15504'
year: '2008'
...
---
_id: '1925'
author:
- first_name: Robert
full_name: D. Kleinberg, Robert
last_name: D. Kleinberg
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: D. Kleinberg R, Scheideler C. Foreword. Theory Comput Syst. 2009;(2):187.
doi:10.1007/s00224-009-9202-x
apa: D. Kleinberg, R., & Scheideler, C. (2009). Foreword. Theory Comput.
Syst., (2), 187. https://doi.org/10.1007/s00224-009-9202-x
bibtex: '@article{D. Kleinberg_Scheideler_2009, title={Foreword}, DOI={10.1007/s00224-009-9202-x},
number={2}, journal={Theory Comput. Syst.}, author={D. Kleinberg, Robert and Scheideler,
Christian}, year={2009}, pages={187} }'
chicago: 'D. Kleinberg, Robert, and Christian Scheideler. “Foreword.” Theory
Comput. Syst., no. 2 (2009): 187. https://doi.org/10.1007/s00224-009-9202-x.'
ieee: R. D. Kleinberg and C. Scheideler, “Foreword,” Theory Comput. Syst.,
no. 2, p. 187, 2009.
mla: D. Kleinberg, Robert, and Christian Scheideler. “Foreword.” Theory Comput.
Syst., no. 2, 2009, p. 187, doi:10.1007/s00224-009-9202-x.
short: R. D. Kleinberg, C. Scheideler, Theory Comput. Syst. (2009) 187.
date_created: 2018-03-29T09:01:30Z
date_updated: 2022-01-06T06:54:00Z
department:
- _id: '79'
doi: 10.1007/s00224-009-9202-x
issue: '2'
page: '187'
publication: Theory Comput. Syst.
status: public
title: Foreword
type: journal_article
user_id: '15504'
year: '2009'
...
---
_id: '1927'
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. Towards a Scalable and Robust DHT. Theory Comput
Syst. 2009;(2):234--260. doi:10.1007/s00224-008-9099-9
apa: Awerbuch, B., & Scheideler, C. (2009). Towards a Scalable and Robust DHT.
Theory Comput. Syst., (2), 234--260. https://doi.org/10.1007/s00224-008-9099-9
bibtex: '@article{Awerbuch_Scheideler_2009, title={Towards a Scalable and Robust
DHT}, DOI={10.1007/s00224-008-9099-9},
number={2}, journal={Theory Comput. Syst.}, author={Awerbuch, Baruch and Scheideler,
Christian}, year={2009}, pages={234--260} }'
chicago: 'Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust
DHT.” Theory Comput. Syst., no. 2 (2009): 234--260. https://doi.org/10.1007/s00224-008-9099-9.'
ieee: B. Awerbuch and C. Scheideler, “Towards a Scalable and Robust DHT,” Theory
Comput. Syst., no. 2, pp. 234--260, 2009.
mla: Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust
DHT.” Theory Comput. Syst., no. 2, 2009, pp. 234--260, doi:10.1007/s00224-008-9099-9.
short: B. Awerbuch, C. Scheideler, Theory Comput. Syst. (2009) 234--260.
date_created: 2018-03-29T09:08:11Z
date_updated: 2022-01-06T06:54:00Z
department:
- _id: '79'
doi: 10.1007/s00224-008-9099-9
issue: '2'
page: 234--260
publication: Theory Comput. Syst.
status: public
title: Towards a Scalable and Robust DHT
type: journal_article
user_id: '15504'
year: '2009'
...
---
_id: '1928'
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 random number generation for peer-to-peer
systems. Theor Comput Sci. 2009;(6-7):453--466. doi:10.1016/j.tcs.2008.10.003
apa: Awerbuch, B., & Scheideler, C. (2009). Robust random number generation
for peer-to-peer systems. Theor. Comput. Sci., (6–7), 453--466. https://doi.org/10.1016/j.tcs.2008.10.003
bibtex: '@article{Awerbuch_Scheideler_2009, title={Robust random number generation
for peer-to-peer systems}, DOI={10.1016/j.tcs.2008.10.003},
number={6–7}, journal={Theor. Comput. Sci.}, author={Awerbuch, Baruch and Scheideler,
Christian}, year={2009}, pages={453--466} }'
chicago: 'Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation
for Peer-to-Peer Systems.” Theor. Comput. Sci., no. 6–7 (2009): 453--466.
https://doi.org/10.1016/j.tcs.2008.10.003.'
ieee: B. Awerbuch and C. Scheideler, “Robust random number generation for peer-to-peer
systems,” Theor. Comput. Sci., no. 6–7, pp. 453--466, 2009.
mla: Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation
for Peer-to-Peer Systems.” Theor. Comput. Sci., no. 6–7, 2009, pp. 453--466,
doi:10.1016/j.tcs.2008.10.003.
short: B. Awerbuch, C. Scheideler, Theor. Comput. Sci. (2009) 453--466.
date_created: 2018-03-29T09:08:12Z
date_updated: 2022-01-06T06:54:01Z
department:
- _id: '79'
doi: 10.1016/j.tcs.2008.10.003
issue: 6-7
page: 453--466
publication: Theor. Comput. Sci.
status: public
title: Robust random number generation for peer-to-peer systems
type: journal_article
user_id: '15504'
year: '2009'
...
---
_id: '1929'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Scheideler C, Schmid S. A Distributed and Oblivious Heap. In: Automata,
Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes,
Greece, July 5-12, 2009, Proceedings, Part II. Vol 5556. Lecture Notes in
Computer Science. Springer; 2009:571--582. doi:10.1007/978-3-642-02930-1_47'
apa: Scheideler, C., & Schmid, S. (2009). A Distributed and Oblivious Heap.
In Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP
2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II (Vol. 5556, pp.
571--582). Springer. https://doi.org/10.1007/978-3-642-02930-1_47
bibtex: '@inproceedings{Scheideler_Schmid_2009, series={Lecture Notes in Computer
Science}, title={A Distributed and Oblivious Heap}, volume={5556}, DOI={10.1007/978-3-642-02930-1_47},
booktitle={Automata, Languages and Programming, 36th Internatilonal Colloquium,
ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II}, publisher={Springer},
author={Scheideler, Christian and Schmid, Stefan}, year={2009}, pages={571--582},
collection={Lecture Notes in Computer Science} }'
chicago: Scheideler, Christian, and Stefan Schmid. “A Distributed and Oblivious
Heap.” In Automata, Languages and Programming, 36th Internatilonal Colloquium,
ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, 5556:571--582.
Lecture Notes in Computer Science. Springer, 2009. https://doi.org/10.1007/978-3-642-02930-1_47.
ieee: C. Scheideler and S. Schmid, “A Distributed and Oblivious Heap,” in Automata,
Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes,
Greece, July 5-12, 2009, Proceedings, Part II, 2009, vol. 5556, pp. 571--582.
mla: Scheideler, Christian, and Stefan Schmid. “A Distributed and Oblivious Heap.”
Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP
2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, vol. 5556, Springer,
2009, pp. 571--582, doi:10.1007/978-3-642-02930-1_47.
short: 'C. Scheideler, S. Schmid, in: Automata, Languages and Programming, 36th
Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings,
Part II, Springer, 2009, pp. 571--582.'
date_created: 2018-03-29T09:08:14Z
date_updated: 2022-01-06T06:54:01Z
department:
- _id: '79'
doi: 10.1007/978-3-642-02930-1_47
intvolume: ' 5556'
page: 571--582
publication: Automata, Languages and Programming, 36th Internatilonal Colloquium,
ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II
publication_identifier:
isbn:
- 978-3-642-02929-5
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: A Distributed and Oblivious Heap
type: conference
user_id: '15504'
volume: 5556
year: '2009'
...
---
_id: '1930'
author:
- first_name: Riko
full_name: Jacob, Riko
last_name: Jacob
- first_name: Stephan
full_name: Ritscher, Stephan
last_name: Ritscher
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Jacob R, Ritscher S, Scheideler C, Schmid S. A Self-stabilizing and Local
Delaunay Graph Construction. In: Algorithms and Computation, 20th International
Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings.
Vol 5878. Lecture Notes in Computer Science. Springer; 2009:771--780. doi:10.1007/978-3-642-10631-6_78'
apa: Jacob, R., Ritscher, S., Scheideler, C., & Schmid, S. (2009). A Self-stabilizing
and Local Delaunay Graph Construction. In Algorithms and Computation, 20th
International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009.
Proceedings (Vol. 5878, pp. 771--780). Springer. https://doi.org/10.1007/978-3-642-10631-6_78
bibtex: '@inproceedings{Jacob_Ritscher_Scheideler_Schmid_2009, series={Lecture Notes
in Computer Science}, title={A Self-stabilizing and Local Delaunay Graph Construction},
volume={5878}, DOI={10.1007/978-3-642-10631-6_78},
booktitle={Algorithms and Computation, 20th International Symposium, ISAAC 2009,
Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, publisher={Springer},
author={Jacob, Riko and Ritscher, Stephan and Scheideler, Christian and Schmid,
Stefan}, year={2009}, pages={771--780}, collection={Lecture Notes in Computer
Science} }'
chicago: Jacob, Riko, Stephan Ritscher, Christian Scheideler, and Stefan Schmid.
“A Self-Stabilizing and Local Delaunay Graph Construction.” In Algorithms and
Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA,
December 16-18, 2009. Proceedings, 5878:771--780. Lecture Notes in Computer
Science. Springer, 2009. https://doi.org/10.1007/978-3-642-10631-6_78.
ieee: R. Jacob, S. Ritscher, C. Scheideler, and S. Schmid, “A Self-stabilizing and
Local Delaunay Graph Construction,” in Algorithms and Computation, 20th International
Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings,
2009, vol. 5878, pp. 771--780.
mla: Jacob, Riko, et al. “A Self-Stabilizing and Local Delaunay Graph Construction.”
Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu,
Hawaii, USA, December 16-18, 2009. Proceedings, vol. 5878, Springer, 2009,
pp. 771--780, doi:10.1007/978-3-642-10631-6_78.
short: 'R. Jacob, S. Ritscher, C. Scheideler, S. Schmid, in: Algorithms and Computation,
20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18,
2009. Proceedings, Springer, 2009, pp. 771--780.'
date_created: 2018-03-29T09:12:59Z
date_updated: 2022-01-06T06:54:02Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-10631-6_78
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T10:05:53Z
date_updated: 2018-04-13T10:05:53Z
file_id: '2342'
file_name: isaac09.pdf
file_size: 139275
relation: main_file
file_date_updated: 2018-04-13T10:05:53Z
has_accepted_license: '1'
intvolume: ' 5878'
oa: '1'
page: 771--780
publication: Algorithms and Computation, 20th International Symposium, ISAAC 2009,
Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: A Self-stabilizing and Local Delaunay Graph Construction
type: conference
urn: '19304'
user_id: '15504'
volume: 5878
year: '2009'
...
---
_id: '1932'
author:
- first_name: Riko
full_name: Jacob, Riko
last_name: Jacob
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Hanjo
full_name: Täubig, Hanjo
last_name: Täubig
citation:
ama: 'Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. A distributed polylogarithmic
time algorithm for self-stabilizing skip graphs. In: Proceedings of the 28th
Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary,
Alberta, Canada, August 10-12, 2009. ; 2009:131--140. doi:10.1145/1582716.1582741'
apa: Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., & Täubig, H. (2009).
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs.
In Proceedings of the 28th Annual ACM Symposium on Principles of Distributed
Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009 (pp. 131--140).
https://doi.org/10.1145/1582716.1582741
bibtex: '@inproceedings{Jacob_W. Richa_Scheideler_Schmid_Täubig_2009, title={A distributed
polylogarithmic time algorithm for self-stabilizing skip graphs}, DOI={10.1145/1582716.1582741},
booktitle={Proceedings of the 28th Annual ACM Symposium on Principles of Distributed
Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009}, author={Jacob,
Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig,
Hanjo}, year={2009}, pages={131--140} }'
chicago: Jacob, Riko, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and
Hanjo Täubig. “A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing
Skip Graphs.” In Proceedings of the 28th Annual ACM Symposium on Principles
of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009,
131--140, 2009. https://doi.org/10.1145/1582716.1582741.
ieee: R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “A distributed
polylogarithmic time algorithm for self-stabilizing skip graphs,” in Proceedings
of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC
2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140.
mla: Jacob, Riko, et al. “A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing
Skip Graphs.” Proceedings of the 28th Annual ACM Symposium on Principles of
Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009,
2009, pp. 131--140, doi:10.1145/1582716.1582741.
short: 'R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: Proceedings
of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC
2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140.'
date_created: 2018-03-29T09:16:22Z
date_updated: 2022-01-06T06:54:02Z
department:
- _id: '79'
doi: 10.1145/1582716.1582741
page: 131--140
publication: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed
Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009
publication_identifier:
isbn:
- 978-1-60558-396-9
status: public
title: A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
type: conference
user_id: '15504'
year: '2009'
...
---
_id: '1933'
author:
- first_name: Matthias
full_name: Baumgart, Matthias
last_name: Baumgart
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Baumgart M, Scheideler C, Schmid S. A DoS-resilient information system for
dynamic data management. In: SPAA 2009: Proceedings of the 21st Annual ACM
Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada,
August 11-13, 2009. ; 2009:300--309. doi:10.1145/1583991.1584064'
apa: 'Baumgart, M., Scheideler, C., & Schmid, S. (2009). A DoS-resilient information
system for dynamic data management. In SPAA 2009: Proceedings of the 21st Annual
ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta,
Canada, August 11-13, 2009 (pp. 300--309). https://doi.org/10.1145/1583991.1584064'
bibtex: '@inproceedings{Baumgart_Scheideler_Schmid_2009, title={A DoS-resilient
information system for dynamic data management}, DOI={10.1145/1583991.1584064},
booktitle={SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism
in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009},
author={Baumgart, Matthias and Scheideler, Christian and Schmid, Stefan}, year={2009},
pages={300--309} }'
chicago: 'Baumgart, Matthias, Christian Scheideler, and Stefan Schmid. “A DoS-Resilient
Information System for Dynamic Data Management.” In SPAA 2009: Proceedings
of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures,
Calgary, Alberta, Canada, August 11-13, 2009, 300--309, 2009. https://doi.org/10.1145/1583991.1584064.'
ieee: 'M. Baumgart, C. Scheideler, and S. Schmid, “A DoS-resilient information system
for dynamic data management,” in SPAA 2009: Proceedings of the 21st Annual
ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta,
Canada, August 11-13, 2009, 2009, pp. 300--309.'
mla: 'Baumgart, Matthias, et al. “A DoS-Resilient Information System for Dynamic
Data Management.” SPAA 2009: Proceedings of the 21st Annual ACM Symposium on
Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August
11-13, 2009, 2009, pp. 300--309, doi:10.1145/1583991.1584064.'
short: 'M. Baumgart, C. Scheideler, S. Schmid, in: SPAA 2009: Proceedings of the
21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary,
Alberta, Canada, August 11-13, 2009, 2009, pp. 300--309.'
date_created: 2018-03-29T09:18:06Z
date_updated: 2022-01-06T06:54:02Z
department:
- _id: '79'
doi: 10.1145/1583991.1584064
page: 300--309
publication: 'SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism
in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009'
publication_identifier:
isbn:
- 978-1-60558-606-9
status: public
title: A DoS-resilient information system for dynamic data management
type: conference
user_id: '15504'
year: '2009'
...
---
_id: '1934'
author:
- first_name: Dominik
full_name: Gall, Dominik
last_name: Gall
- first_name: Riko
full_name: Jacob, Riko
last_name: Jacob
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Hanjo
full_name: Täubig, Hanjo
last_name: Täubig
citation:
ama: 'Gall D, Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. Brief Announcement:
On the Time Complexity of Distributed Topological Self-stabilization. In: Stabilization,
Safety, and Security of Distributed Systems, 11th International Symposium, SSS
2009, Lyon, France, November 3-6, 2009. Proceedings. Vol 5873. Lecture Notes
in Computer Science. Springer; 2009:781--782. doi:10.1007/978-3-642-05118-0_58'
apa: 'Gall, D., Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., & Täubig,
H. (2009). Brief Announcement: On the Time Complexity of Distributed Topological
Self-stabilization. In Stabilization, Safety, and Security of Distributed Systems,
11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings
(Vol. 5873, pp. 781--782). Springer. https://doi.org/10.1007/978-3-642-05118-0_58'
bibtex: '@inproceedings{Gall_Jacob_W. Richa_Scheideler_Schmid_Täubig_2009, series={Lecture
Notes in Computer Science}, title={Brief Announcement: On the Time Complexity
of Distributed Topological Self-stabilization}, volume={5873}, DOI={10.1007/978-3-642-05118-0_58},
booktitle={Stabilization, Safety, and Security of Distributed Systems, 11th International
Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings}, publisher={Springer},
author={Gall, Dominik and Jacob, Riko and W. Richa, Andrea and Scheideler, Christian
and Schmid, Stefan and Täubig, Hanjo}, year={2009}, pages={781--782}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan
Schmid, and Hanjo Täubig. “Brief Announcement: On the Time Complexity of Distributed
Topological Self-Stabilization.” In Stabilization, Safety, and Security of
Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November
3-6, 2009. Proceedings, 5873:781--782. Lecture Notes in Computer Science.
Springer, 2009. https://doi.org/10.1007/978-3-642-05118-0_58.'
ieee: 'D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig,
“Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization,”
in Stabilization, Safety, and Security of Distributed Systems, 11th International
Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, 2009,
vol. 5873, pp. 781--782.'
mla: 'Gall, Dominik, et al. “Brief Announcement: On the Time Complexity of Distributed
Topological Self-Stabilization.” Stabilization, Safety, and Security of Distributed
Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009.
Proceedings, vol. 5873, Springer, 2009, pp. 781--782, doi:10.1007/978-3-642-05118-0_58.'
short: 'D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in:
Stabilization, Safety, and Security of Distributed Systems, 11th International
Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, Springer,
2009, pp. 781--782.'
date_created: 2018-03-29T09:19:17Z
date_updated: 2022-01-06T06:54:02Z
department:
- _id: '79'
doi: 10.1007/978-3-642-05118-0_58
intvolume: ' 5873'
page: 781--782
publication: Stabilization, Safety, and Security of Distributed Systems, 11th International
Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings
publication_identifier:
isbn:
- 978-3-642-05117-3
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization'
type: conference
user_id: '15504'
volume: 5873
year: '2009'
...
---
_id: '1935'
author:
- first_name: Benjamin
full_name: Doerr, Benjamin
last_name: Doerr
- first_name: Leslie
full_name: Ann Goldberg, Leslie
last_name: Ann Goldberg
- first_name: Lorenz
full_name: Minder, Lorenz
last_name: Minder
- first_name: Thomas
full_name: Sauerwald, Thomas
last_name: Sauerwald
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Doerr B, Ann Goldberg L, Minder L, Sauerwald T, Scheideler C. Stabilizing
Consensus with the Power of Two Choices. In: Algorithmic Methods for Distributed
Cooperative Systems, 06.09. - 11.09.2009. Vol 09371. Dagstuhl Seminar Proceedings.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany; 2009. doi:10.1145/1989493.1989516'
apa: Doerr, B., Ann Goldberg, L., Minder, L., Sauerwald, T., & Scheideler, C.
(2009). Stabilizing Consensus with the Power of Two Choices. In Algorithmic
Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009 (Vol. 09371).
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. https://doi.org/10.1145/1989493.1989516
bibtex: '@inproceedings{Doerr_Ann Goldberg_Minder_Sauerwald_Scheideler_2009, series={Dagstuhl
Seminar Proceedings}, title={Stabilizing Consensus with the Power of Two Choices},
volume={09371}, DOI={10.1145/1989493.1989516},
booktitle={Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009},
publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany}, author={Doerr,
Benjamin and Ann Goldberg, Leslie and Minder, Lorenz and Sauerwald, Thomas and
Scheideler, Christian}, year={2009}, collection={Dagstuhl Seminar Proceedings}
}'
chicago: Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald,
and Christian Scheideler. “Stabilizing Consensus with the Power of Two Choices.”
In Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009,
Vol. 09371. Dagstuhl Seminar Proceedings. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, Germany, 2009. https://doi.org/10.1145/1989493.1989516.
ieee: B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Stabilizing
Consensus with the Power of Two Choices,” in Algorithmic Methods for Distributed
Cooperative Systems, 06.09. - 11.09.2009, 2009, vol. 09371.
mla: Doerr, Benjamin, et al. “Stabilizing Consensus with the Power of Two Choices.”
Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009,
vol. 09371, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009,
doi:10.1145/1989493.1989516.
short: 'B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Algorithmic
Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, Germany, 2009.'
date_created: 2018-03-29T09:20:44Z
date_updated: 2022-01-06T06:54:02Z
department:
- _id: '79'
doi: 10.1145/1989493.1989516
intvolume: ' 9371'
publication: Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany
series_title: Dagstuhl Seminar Proceedings
status: public
title: Stabilizing Consensus with the Power of Two Choices
type: conference
user_id: '15504'
volume: '09371'
year: '2009'
...
---
_id: '1903'
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. Algorithmische Grundlagen verteilter Speichersysteme.
Informatik Spektrum. 2010;(5):468--474. doi:10.1007/s00287-010-0470-2
apa: Meyer auf der Heide, F., & Scheideler, C. (2010). Algorithmische Grundlagen
verteilter Speichersysteme. Informatik Spektrum, (5), 468--474. https://doi.org/10.1007/s00287-010-0470-2
bibtex: '@article{Meyer auf der Heide_Scheideler_2010, title={Algorithmische Grundlagen
verteilter Speichersysteme}, DOI={10.1007/s00287-010-0470-2},
number={5}, journal={Informatik Spektrum}, author={Meyer auf der Heide, Friedhelm
and Scheideler, Christian}, year={2010}, pages={468--474} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische
Grundlagen Verteilter Speichersysteme.” Informatik Spektrum, no. 5 (2010):
468--474. https://doi.org/10.1007/s00287-010-0470-2.'
ieee: F. Meyer auf der Heide and C. Scheideler, “Algorithmische Grundlagen verteilter
Speichersysteme,” Informatik Spektrum, no. 5, pp. 468--474, 2010.
mla: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen
Verteilter Speichersysteme.” Informatik Spektrum, no. 5, 2010, pp. 468--474,
doi:10.1007/s00287-010-0470-2.
short: F. Meyer auf der Heide, C. Scheideler, Informatik Spektrum (2010) 468--474.
date_created: 2018-03-28T07:21:50Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/s00287-010-0470-2
issue: '5'
language:
- iso: eng
page: 468--474
publication: Informatik Spektrum
status: public
title: Algorithmische Grundlagen verteilter Speichersysteme
type: journal_article
user_id: '14955'
year: '2010'
...
---
_id: '1904'
author:
- first_name: Cyril
full_name: Gavoille, Cyril
last_name: Gavoille
- first_name: Boaz
full_name: Patt-Shamir, Boaz
last_name: Patt-Shamir
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Gavoille C, Patt-Shamir B, Scheideler C. Foreword. Theory of Computing Systems.
2010;(4):809--810. doi:10.1007/s00224-010-9284-5
apa: Gavoille, C., Patt-Shamir, B., & Scheideler, C. (2010). Foreword. Theory
of Computing Systems, (4), 809--810. https://doi.org/10.1007/s00224-010-9284-5
bibtex: '@article{Gavoille_Patt-Shamir_Scheideler_2010, title={Foreword}, DOI={10.1007/s00224-010-9284-5},
number={4}, journal={Theory of Computing Systems}, author={Gavoille, Cyril and
Patt-Shamir, Boaz and Scheideler, Christian}, year={2010}, pages={809--810} }'
chicago: 'Gavoille, Cyril, Boaz Patt-Shamir, and Christian Scheideler. “Foreword.”
Theory of Computing Systems, no. 4 (2010): 809--810. https://doi.org/10.1007/s00224-010-9284-5.'
ieee: C. Gavoille, B. Patt-Shamir, and C. Scheideler, “Foreword,” Theory of Computing
Systems, no. 4, pp. 809--810, 2010.
mla: Gavoille, Cyril, et al. “Foreword.” Theory of Computing Systems, no.
4, 2010, pp. 809--810, doi:10.1007/s00224-010-9284-5.
short: C. Gavoille, B. Patt-Shamir, C. Scheideler, Theory of Computing Systems (2010)
809--810.
date_created: 2018-03-28T07:22:21Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '79'
doi: 10.1007/s00224-010-9284-5
issue: '4'
page: 809--810
publication: Theory of Computing Systems
status: public
title: Foreword
type: journal_article
user_id: '15504'
year: '2010'
...
---
_id: '1905'
author:
- first_name: Dominik
full_name: Gall, Dominik
last_name: Gall
- first_name: Riko
full_name: Jacob, Riko
last_name: Jacob
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Hanjo
full_name: Täubig, Hanjo
last_name: Täubig
citation:
ama: 'Gall D, Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. Time Complexity
of Distributed Topological Self-stabilization: The Case of Graph Linearization.
In: LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca,
Mexico, April 19-23, 2010. Proceedings. Vol 6034. Lecture Notes in Computer
Science. Springer; 2010:294--305. doi:10.1007/978-3-642-12200-2_27'
apa: 'Gall, D., Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., & Täubig,
H. (2010). Time Complexity of Distributed Topological Self-stabilization: The
Case of Graph Linearization. In LATIN 2010: Theoretical Informatics, 9th Latin
American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings (Vol. 6034,
pp. 294--305). Springer. https://doi.org/10.1007/978-3-642-12200-2_27'
bibtex: '@inproceedings{Gall_Jacob_W. Richa_Scheideler_Schmid_Täubig_2010, series={Lecture
Notes in Computer Science}, title={Time Complexity of Distributed Topological
Self-stabilization: The Case of Graph Linearization}, volume={6034}, DOI={10.1007/978-3-642-12200-2_27},
booktitle={LATIN 2010: Theoretical Informatics, 9th Latin American Symposium,
Oaxaca, Mexico, April 19-23, 2010. Proceedings}, publisher={Springer}, author={Gall,
Dominik and Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid,
Stefan and Täubig, Hanjo}, year={2010}, pages={294--305}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan
Schmid, and Hanjo Täubig. “Time Complexity of Distributed Topological Self-Stabilization:
The Case of Graph Linearization.” In LATIN 2010: Theoretical Informatics, 9th
Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings,
6034:294--305. Lecture Notes in Computer Science. Springer, 2010. https://doi.org/10.1007/978-3-642-12200-2_27.'
ieee: 'D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig,
“Time Complexity of Distributed Topological Self-stabilization: The Case of Graph
Linearization,” in LATIN 2010: Theoretical Informatics, 9th Latin American
Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings, 2010, vol. 6034,
pp. 294--305.'
mla: 'Gall, Dominik, et al. “Time Complexity of Distributed Topological Self-Stabilization:
The Case of Graph Linearization.” LATIN 2010: Theoretical Informatics, 9th
Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings,
vol. 6034, Springer, 2010, pp. 294--305, doi:10.1007/978-3-642-12200-2_27.'
short: 'D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in:
LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico,
April 19-23, 2010. Proceedings, Springer, 2010, pp. 294--305.'
date_created: 2018-03-28T07:22:42Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '79'
doi: 10.1007/978-3-642-12200-2_27
intvolume: ' 6034'
page: 294--305
publication: 'LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca,
Mexico, April 19-23, 2010. Proceedings'
publication_identifier:
isbn:
- 978-3-642-12199-9
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Time Complexity of Distributed Topological Self-stabilization: The Case of
Graph Linearization'
type: conference
user_id: '15504'
volume: 6034
year: '2010'
...
---
_id: '1906'
author:
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Richa AW, Zhang J, Scheideler C, Schmid S. Brief announcement: towards robust
medium access in multi-hop networks. In: Proceedings of the 29th Annual ACM
Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland,
July 25-28, 2010. ACM; 2010:114--115. doi:10.1145/1835698.1835726'
apa: 'Richa, A. W., Zhang, J., Scheideler, C., & Schmid, S. (2010). Brief announcement:
towards robust medium access in multi-hop networks. In Proceedings of the 29th
Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich,
Switzerland, July 25-28, 2010 (pp. 114--115). ACM. https://doi.org/10.1145/1835698.1835726'
bibtex: '@inproceedings{Richa_Zhang_Scheideler_Schmid_2010, title={Brief announcement:
towards robust medium access in multi-hop networks}, DOI={10.1145/1835698.1835726},
booktitle={Proceedings of the 29th Annual ACM Symposium on Principles of Distributed
Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010}, publisher={ACM},
author={Richa, Andrea W. and Zhang, Jin and Scheideler, Christian and Schmid,
Stefan}, year={2010}, pages={114--115} }'
chicago: 'Richa, Andrea W., Jin Zhang, Christian Scheideler, and Stefan Schmid.
“Brief Announcement: Towards Robust Medium Access in Multi-Hop Networks.” In Proceedings
of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC
2010, Zurich, Switzerland, July 25-28, 2010, 114--115. ACM, 2010. https://doi.org/10.1145/1835698.1835726.'
ieee: 'A. W. Richa, J. Zhang, C. Scheideler, and S. Schmid, “Brief announcement:
towards robust medium access in multi-hop networks,” in Proceedings of the
29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich,
Switzerland, July 25-28, 2010, 2010, pp. 114--115.'
mla: 'Richa, Andrea W., et al. “Brief Announcement: Towards Robust Medium Access
in Multi-Hop Networks.” Proceedings of the 29th Annual ACM Symposium on Principles
of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010,
ACM, 2010, pp. 114--115, doi:10.1145/1835698.1835726.'
short: 'A.W. Richa, J. Zhang, C. Scheideler, S. Schmid, in: Proceedings of the 29th
Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich,
Switzerland, July 25-28, 2010, ACM, 2010, pp. 114--115.'
date_created: 2018-03-28T07:23:32Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '79'
doi: 10.1145/1835698.1835726
page: 114--115
publication: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed
Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010
publication_identifier:
isbn:
- 978-1-60558-888-9
publisher: ACM
status: public
title: 'Brief announcement: towards robust medium access in multi-hop networks'
type: conference
user_id: '15504'
year: '2010'
...
---
_id: '1907'
author:
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: 'Richa AW, Scheideler C, Schmid S, Zhang J. A Jamming-Resistant MAC Protocol
for Multi-Hop Wireless Networks. In: Distributed Computing, 24th International
Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings.
Vol 6343. Lecture Notes in Computer Science. Springer; 2010:179--193. doi:10.1007/978-3-642-15763-9_17'
apa: Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2010). A Jamming-Resistant
MAC Protocol for Multi-Hop Wireless Networks. In Distributed Computing, 24th
International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010.
Proceedings (Vol. 6343, pp. 179--193). Springer. https://doi.org/10.1007/978-3-642-15763-9_17
bibtex: '@inproceedings{Richa_Scheideler_Schmid_Zhang_2010, series={Lecture Notes
in Computer Science}, title={A Jamming-Resistant MAC Protocol for Multi-Hop Wireless
Networks}, volume={6343}, DOI={10.1007/978-3-642-15763-9_17},
booktitle={Distributed Computing, 24th International Symposium, DISC 2010, Cambridge,
MA, USA, September 13-15, 2010. Proceedings}, publisher={Springer}, author={Richa,
Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2010},
pages={179--193}, collection={Lecture Notes in Computer Science} }'
chicago: Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin Zhang. “A
Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks.” In Distributed
Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September
13-15, 2010. Proceedings, 6343:179--193. Lecture Notes in Computer Science.
Springer, 2010. https://doi.org/10.1007/978-3-642-15763-9_17.
ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “A Jamming-Resistant
MAC Protocol for Multi-Hop Wireless Networks,” in Distributed Computing, 24th
International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010.
Proceedings, 2010, vol. 6343, pp. 179--193.
mla: Richa, Andrea W., et al. “A Jamming-Resistant MAC Protocol for Multi-Hop Wireless
Networks.” Distributed Computing, 24th International Symposium, DISC 2010,
Cambridge, MA, USA, September 13-15, 2010. Proceedings, vol. 6343, Springer,
2010, pp. 179--193, doi:10.1007/978-3-642-15763-9_17.
short: 'A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Distributed Computing,
24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15,
2010. Proceedings, Springer, 2010, pp. 179--193.'
date_created: 2018-03-28T07:24:22Z
date_updated: 2022-01-06T06:53:58Z
department:
- _id: '79'
doi: 10.1007/978-3-642-15763-9_17
intvolume: ' 6343'
page: 179--193
publication: Distributed Computing, 24th International Symposium, DISC 2010, Cambridge,
MA, USA, September 13-15, 2010. Proceedings
publication_identifier:
isbn:
- 978-3-642-15762-2
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks
type: conference
user_id: '15504'
volume: 6343
year: '2010'
...
---
_id: '1908'
author:
- first_name: Benjamin
full_name: Doerr, Benjamin
last_name: Doerr
- first_name: Leslie
full_name: Ann Goldberg, Leslie
last_name: Ann Goldberg
- first_name: Lorenz
full_name: Minder, Lorenz
last_name: Minder
- first_name: Thomas
full_name: Sauerwald, Thomas
last_name: Sauerwald
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Doerr B, Ann Goldberg L, Minder L, Sauerwald T, Scheideler C. Brief Announcement:
Stabilizing Consensus with the Power of Two Choices. In: Distributed Computing,
24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15,
2010. Proceedings. Vol 6343. Lecture Notes in Computer Science. Springer;
2010:528--530. doi:10.1007/978-3-642-15763-9_50'
apa: 'Doerr, B., Ann Goldberg, L., Minder, L., Sauerwald, T., & Scheideler,
C. (2010). Brief Announcement: Stabilizing Consensus with the Power of Two Choices.
In Distributed Computing, 24th International Symposium, DISC 2010, Cambridge,
MA, USA, September 13-15, 2010. Proceedings (Vol. 6343, pp. 528--530). Springer.
https://doi.org/10.1007/978-3-642-15763-9_50'
bibtex: '@inproceedings{Doerr_Ann Goldberg_Minder_Sauerwald_Scheideler_2010, series={Lecture
Notes in Computer Science}, title={Brief Announcement: Stabilizing Consensus with
the Power of Two Choices}, volume={6343}, DOI={10.1007/978-3-642-15763-9_50},
booktitle={Distributed Computing, 24th International Symposium, DISC 2010, Cambridge,
MA, USA, September 13-15, 2010. Proceedings}, publisher={Springer}, author={Doerr,
Benjamin and Ann Goldberg, Leslie and Minder, Lorenz and Sauerwald, Thomas and
Scheideler, Christian}, year={2010}, pages={528--530}, collection={Lecture Notes
in Computer Science} }'
chicago: 'Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald,
and Christian Scheideler. “Brief Announcement: Stabilizing Consensus with the
Power of Two Choices.” In Distributed Computing, 24th International Symposium,
DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, 6343:528--530.
Lecture Notes in Computer Science. Springer, 2010. https://doi.org/10.1007/978-3-642-15763-9_50.'
ieee: 'B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Brief
Announcement: Stabilizing Consensus with the Power of Two Choices,” in Distributed
Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September
13-15, 2010. Proceedings, 2010, vol. 6343, pp. 528--530.'
mla: 'Doerr, Benjamin, et al. “Brief Announcement: Stabilizing Consensus with the
Power of Two Choices.” Distributed Computing, 24th International Symposium,
DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, vol. 6343,
Springer, 2010, pp. 528--530, doi:10.1007/978-3-642-15763-9_50.'
short: 'B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Distributed
Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September
13-15, 2010. Proceedings, Springer, 2010, pp. 528--530.'
date_created: 2018-03-28T07:25:45Z
date_updated: 2022-01-06T06:53:58Z
department:
- _id: '79'
doi: 10.1007/978-3-642-15763-9_50
intvolume: ' 6343'
page: 528--530
publication: Distributed Computing, 24th International Symposium, DISC 2010, Cambridge,
MA, USA, September 13-15, 2010. Proceedings
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Brief Announcement: Stabilizing Consensus with the Power of Two Choices'
type: conference
user_id: '15504'
volume: 6343
year: '2010'
...
---
_id: '1891'
author:
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: 'W. Richa A, Scheideler C, Schmid S, Zhang J. Competitive and Fair Medium Access
Despite Reactive Jamming. In: 2011 International Conference on Distributed
Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011.
IEEE Computer Society; 2011:507--516. doi:10.1109/ICDCS.2011.8'
apa: W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2011). Competitive
and Fair Medium Access Despite Reactive Jamming. In 2011 International Conference
on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June
20-24, 2011 (pp. 507--516). IEEE Computer Society. https://doi.org/10.1109/ICDCS.2011.8
bibtex: '@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Competitive
and Fair Medium Access Despite Reactive Jamming}, DOI={10.1109/ICDCS.2011.8},
booktitle={2011 International Conference on Distributed Computing Systems, ICDCS
2011, Minneapolis, Minnesota, USA, June 20-24, 2011}, publisher={IEEE Computer
Society}, author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan
and Zhang, Jin}, year={2011}, pages={507--516} }'
chicago: W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Competitive
and Fair Medium Access Despite Reactive Jamming.” In 2011 International Conference
on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June
20-24, 2011, 507--516. IEEE Computer Society, 2011. https://doi.org/10.1109/ICDCS.2011.8.
ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and Fair
Medium Access Despite Reactive Jamming,” in 2011 International Conference on
Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24,
2011, 2011, pp. 507--516.
mla: W. Richa, Andrea, et al. “Competitive and Fair Medium Access Despite Reactive
Jamming.” 2011 International Conference on Distributed Computing Systems, ICDCS
2011, Minneapolis, Minnesota, USA, June 20-24, 2011, IEEE Computer Society,
2011, pp. 507--516, doi:10.1109/ICDCS.2011.8.
short: 'A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: 2011 International
Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota,
USA, June 20-24, 2011, IEEE Computer Society, 2011, pp. 507--516.'
date_created: 2018-03-28T07:08:13Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '79'
doi: 10.1109/ICDCS.2011.8
page: 507--516
publication: 2011 International Conference on Distributed Computing Systems, ICDCS
2011, Minneapolis, Minnesota, USA, June 20-24, 2011
publication_identifier:
isbn:
- 978-0-7695-4364-2
publisher: IEEE Computer Society
status: public
title: Competitive and Fair Medium Access Despite Reactive Jamming
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '1892'
author:
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: 'W. Richa A, Scheideler C, Schmid S, Zhang J. Towards jamming-resistant and
competitive medium access in the SINR model. In: Proceedings of the 3rd ACM
Workshop on Wireless of the Students, by the Students, for the Students, S3@MOBICOM
2011, Las Vegas, NV, USA, September 19 - 23, 2011. ACM; 2011:33--36. doi:10.1145/2030686.2030697'
apa: W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2011). Towards jamming-resistant
and competitive medium access in the SINR model. In Proceedings of the 3rd
ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM
2011, Las Vegas, NV, USA, September 19 - 23, 2011 (pp. 33--36). ACM. https://doi.org/10.1145/2030686.2030697
bibtex: '@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Towards jamming-resistant
and competitive medium access in the SINR model}, DOI={10.1145/2030686.2030697},
booktitle={Proceedings of the 3rd ACM workshop on Wireless of the students, by
the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September
19 - 23, 2011}, publisher={ACM}, author={W. Richa, Andrea and Scheideler, Christian
and Schmid, Stefan and Zhang, Jin}, year={2011}, pages={33--36} }'
chicago: W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Towards
Jamming-Resistant and Competitive Medium Access in the SINR Model.” In Proceedings
of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the
Students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011, 33--36.
ACM, 2011. https://doi.org/10.1145/2030686.2030697.
ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Towards jamming-resistant
and competitive medium access in the SINR model,” in Proceedings of the 3rd
ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM
2011, Las Vegas, NV, USA, September 19 - 23, 2011, 2011, pp. 33--36.
mla: W. Richa, Andrea, et al. “Towards Jamming-Resistant and Competitive Medium
Access in the SINR Model.” Proceedings of the 3rd ACM Workshop on Wireless
of the Students, by the Students, for the Students, S3@MOBICOM 2011, Las Vegas,
NV, USA, September 19 - 23, 2011, ACM, 2011, pp. 33--36, doi:10.1145/2030686.2030697.
short: 'A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the
3rd ACM Workshop on Wireless of the Students, by the Students, for the Students,
S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011, ACM, 2011, pp. 33--36.'
date_created: 2018-03-28T07:09:07Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '79'
doi: 10.1145/2030686.2030697
page: 33--36
publication: Proceedings of the 3rd ACM workshop on Wireless of the students, by the
students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 -
23, 2011
publication_identifier:
isbn:
- 978-1-4503-0868-7
publisher: ACM
status: public
title: Towards jamming-resistant and competitive medium access in the SINR model
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '1893'
author:
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: 'W. Richa A, Scheideler C, Schmid S, Zhang J. Self-stabilizing leader election
for single-hop wireless networks despite jamming. In: Proceedings of the 12th
ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc
2011, Paris, France, May 16-20, 2011. ACM; 2011:15. doi:10.1145/2107502.2107522'
apa: W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2011). Self-stabilizing
leader election for single-hop wireless networks despite jamming. In Proceedings
of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing,
MobiHoc 2011, Paris, France, May 16-20, 2011 (p. 15). ACM. https://doi.org/10.1145/2107502.2107522
bibtex: '@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Self-stabilizing
leader election for single-hop wireless networks despite jamming}, DOI={10.1145/2107502.2107522},
booktitle={Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc
Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011}, publisher={ACM},
author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang,
Jin}, year={2011}, pages={15} }'
chicago: W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Self-Stabilizing
Leader Election for Single-Hop Wireless Networks despite Jamming.” In Proceedings
of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing,
MobiHoc 2011, Paris, France, May 16-20, 2011, 15. ACM, 2011. https://doi.org/10.1145/2107502.2107522.
ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Self-stabilizing leader
election for single-hop wireless networks despite jamming,” in Proceedings
of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing,
MobiHoc 2011, Paris, France, May 16-20, 2011, 2011, p. 15.
mla: W. Richa, Andrea, et al. “Self-Stabilizing Leader Election for Single-Hop Wireless
Networks despite Jamming.” Proceedings of the 12th ACM Interational Symposium
on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20,
2011, ACM, 2011, p. 15, doi:10.1145/2107502.2107522.
short: 'A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the
12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc
2011, Paris, France, May 16-20, 2011, ACM, 2011, p. 15.'
date_created: 2018-03-28T07:09:54Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '79'
doi: 10.1145/2107502.2107522
page: '15'
publication: Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking
and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011
publication_identifier:
isbn:
- 978-1-4503-0722-2
publisher: ACM
status: public
title: Self-stabilizing leader election for single-hop wireless networks despite jamming
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '1895'
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Koutsopoulos A, Scheideler C. Re-Chord: a self-stabilizing
chord overlay network. In: SPAA 2011: Proceedings of the 23rd Annual ACM Symposium
on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011
(Co-Located with FCRC 2011). ; 2011:235--244. doi:10.1145/1989493.1989527'
apa: 'Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2011). Re-Chord:
a self-stabilizing chord overlay network. In SPAA 2011: Proceedings of the
23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San
Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011) (pp. 235--244).
https://doi.org/10.1145/1989493.1989527'
bibtex: '@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2011, title={Re-Chord:
a self-stabilizing chord overlay network}, DOI={10.1145/1989493.1989527},
booktitle={SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism
in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located
with FCRC 2011)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and
Scheideler, Christian}, year={2011}, pages={235--244} }'
chicago: 'Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler.
“Re-Chord: A Self-Stabilizing Chord Overlay Network.” In SPAA 2011: Proceedings
of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures,
San Jose, CA, USA, June 4-6, 2011 (Co-Located with FCRC 2011), 235--244, 2011.
https://doi.org/10.1145/1989493.1989527.'
ieee: 'S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “Re-Chord: a self-stabilizing
chord overlay network,” in SPAA 2011: Proceedings of the 23rd Annual ACM Symposium
on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011
(Co-located with FCRC 2011), 2011, pp. 235--244.'
mla: 'Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay
Network.” SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism
in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-Located
with FCRC 2011), 2011, pp. 235--244, doi:10.1145/1989493.1989527.'
short: 'S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: SPAA 2011: Proceedings
of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures,
San Jose, CA, USA, June 4-6, 2011 (Co-Located with FCRC 2011), 2011, pp. 235--244.'
date_created: 2018-03-28T07:12:49Z
date_updated: 2022-01-06T06:53:55Z
department:
- _id: '79'
doi: 10.1145/1989493.1989527
page: 235--244
publication: 'SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism
in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with
FCRC 2011)'
publication_identifier:
isbn:
- 978-1-4503-0743-7
status: public
title: 'Re-Chord: a self-stabilizing chord overlay network'
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '1899'
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Scheideler C. Hashed Patricia Trie: Efficient Longest Prefix
Matching in Peer-to-Peer Systems. In: WALCOM: Algorithms and Computation -
5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011.
Proceedings. Vol 6552. Lecture Notes in Computer Science. Springer; 2011:170--181.
doi:10.1007/978-3-642-19094-0_18'
apa: 'Kniesburges, S., & Scheideler, C. (2011). Hashed Patricia Trie: Efficient
Longest Prefix Matching in Peer-to-Peer Systems. In WALCOM: Algorithms and
Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February
18-20, 2011. Proceedings (Vol. 6552, pp. 170--181). Springer. https://doi.org/10.1007/978-3-642-19094-0_18'
bibtex: '@inproceedings{Kniesburges_Scheideler_2011, series={Lecture Notes in Computer
Science}, title={Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer
Systems}, volume={6552}, DOI={10.1007/978-3-642-19094-0_18},
booktitle={WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM
2011, New Delhi, India, February 18-20, 2011. Proceedings}, publisher={Springer},
author={Kniesburges, Sebastian and Scheideler, Christian}, year={2011}, pages={170--181},
collection={Lecture Notes in Computer Science} }'
chicago: 'Kniesburges, Sebastian, and Christian Scheideler. “Hashed Patricia Trie:
Efficient Longest Prefix Matching in Peer-to-Peer Systems.” In WALCOM: Algorithms
and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February
18-20, 2011. Proceedings, 6552:170--181. Lecture Notes in Computer Science.
Springer, 2011. https://doi.org/10.1007/978-3-642-19094-0_18.'
ieee: 'S. Kniesburges and C. Scheideler, “Hashed Patricia Trie: Efficient Longest
Prefix Matching in Peer-to-Peer Systems,” in WALCOM: Algorithms and Computation
- 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011.
Proceedings, 2011, vol. 6552, pp. 170--181.'
mla: 'Kniesburges, Sebastian, and Christian Scheideler. “Hashed Patricia Trie: Efficient
Longest Prefix Matching in Peer-to-Peer Systems.” WALCOM: Algorithms and Computation
- 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011.
Proceedings, vol. 6552, Springer, 2011, pp. 170--181, doi:10.1007/978-3-642-19094-0_18.'
short: 'S. Kniesburges, C. Scheideler, in: WALCOM: Algorithms and Computation -
5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011.
Proceedings, Springer, 2011, pp. 170--181.'
date_created: 2018-03-28T07:17:05Z
date_updated: 2022-01-06T06:53:56Z
department:
- _id: '79'
doi: 10.1007/978-3-642-19094-0_18
intvolume: ' 6552'
page: 170--181
publication: 'WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM
2011, New Delhi, India, February 18-20, 2011. Proceedings'
publication_identifier:
isbn:
- 978-3-642-19093-3
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems'
type: conference
user_id: '15504'
volume: 6552
year: '2011'
...
---
_id: '1900'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
citation:
ama: 'Scheideler C, Graffi K. Programming for Distributed Computing: From Physical
to Logical Networks. In: Computer Science, The Hardware, Software and Heart
of It. Springer; 2011:155--168. doi:10.1007/978-1-4614-1168-0_9'
apa: 'Scheideler, C., & Graffi, K. (2011). Programming for Distributed Computing:
From Physical to Logical Networks. In Computer Science, The Hardware, Software
and Heart of It (pp. 155--168). Springer. https://doi.org/10.1007/978-1-4614-1168-0_9'
bibtex: '@inbook{Scheideler_Graffi_2011, title={Programming for Distributed Computing:
From Physical to Logical Networks}, DOI={10.1007/978-1-4614-1168-0_9},
booktitle={Computer Science, The Hardware, Software and Heart of It}, publisher={Springer},
author={Scheideler, Christian and Graffi, Kalman}, year={2011}, pages={155--168}
}'
chicago: 'Scheideler, Christian, and Kalman Graffi. “Programming for Distributed
Computing: From Physical to Logical Networks.” In Computer Science, The Hardware,
Software and Heart of It, 155--168. Springer, 2011. https://doi.org/10.1007/978-1-4614-1168-0_9.'
ieee: 'C. Scheideler and K. Graffi, “Programming for Distributed Computing: From
Physical to Logical Networks,” in Computer Science, The Hardware, Software
and Heart of It, Springer, 2011, pp. 155--168.'
mla: 'Scheideler, Christian, and Kalman Graffi. “Programming for Distributed Computing:
From Physical to Logical Networks.” Computer Science, The Hardware, Software
and Heart of It, Springer, 2011, pp. 155--168, doi:10.1007/978-1-4614-1168-0_9.'
short: 'C. Scheideler, K. Graffi, in: Computer Science, The Hardware, Software and
Heart of It, Springer, 2011, pp. 155--168.'
date_created: 2018-03-28T07:17:53Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '79'
doi: 10.1007/978-1-4614-1168-0_9
page: 155--168
publication: Computer Science, The Hardware, Software and Heart of It
publication_identifier:
isbn:
- 978-1-4614-1167-3
publisher: Springer
status: public
title: 'Programming for Distributed Computing: From Physical to Logical Networks'
type: book_chapter
user_id: '15504'
year: '2011'
...
---
_id: '1901'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Scheideler C. Broadcasting - How Can I Quickly Disseminate Information? In:
Algorithms Unplugged. Springer; 2011:223--229. doi:10.1007/978-3-642-15328-0_22'
apa: Scheideler, C. (2011). Broadcasting - How Can I Quickly Disseminate Information?
In Algorithms Unplugged (pp. 223--229). Springer. https://doi.org/10.1007/978-3-642-15328-0_22
bibtex: '@inbook{Scheideler_2011, title={Broadcasting - How Can I Quickly Disseminate
Information?}, DOI={10.1007/978-3-642-15328-0_22},
booktitle={Algorithms Unplugged}, publisher={Springer}, author={Scheideler, Christian},
year={2011}, pages={223--229} }'
chicago: Scheideler, Christian. “Broadcasting - How Can I Quickly Disseminate Information?”
In Algorithms Unplugged, 223--229. Springer, 2011. https://doi.org/10.1007/978-3-642-15328-0_22.
ieee: C. Scheideler, “Broadcasting - How Can I Quickly Disseminate Information?,”
in Algorithms Unplugged, Springer, 2011, pp. 223--229.
mla: Scheideler, Christian. “Broadcasting - How Can I Quickly Disseminate Information?”
Algorithms Unplugged, Springer, 2011, pp. 223--229, doi:10.1007/978-3-642-15328-0_22.
short: 'C. Scheideler, in: Algorithms Unplugged, Springer, 2011, pp. 223--229.'
date_created: 2018-03-28T07:18:43Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '79'
doi: 10.1007/978-3-642-15328-0_22
page: 223--229
publication: Algorithms Unplugged
publication_identifier:
isbn:
- 978-3-642-15327-3
publisher: Springer
status: public
title: Broadcasting - How Can I Quickly Disseminate Information?
type: book_chapter
user_id: '15504'
year: '2011'
...
---
_id: '1924'
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. Towards Duality of Multicommodity Multiroute Cuts
and Flows: Multilevel Ball-Growing. In: 28th International Symposium on Theoretical
Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany.
; 2011:129--140. doi:10.4230/LIPIcs.STACS.2011.129'
apa: 'Kolman, P., & Scheideler, C. (2011). Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing. In 28th International Symposium
on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund,
Germany (pp. 129--140). https://doi.org/10.4230/LIPIcs.STACS.2011.129'
bibtex: '@inproceedings{Kolman_Scheideler_2011, title={Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing}, DOI={10.4230/LIPIcs.STACS.2011.129},
booktitle={28th International Symposium on Theoretical Aspects of Computer Science,
STACS 2011, March 10-12, 2011, Dortmund, Germany}, author={Kolman, Petr and Scheideler,
Christian}, year={2011}, pages={129--140} }'
chicago: 'Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing.” In 28th International
Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12,
2011, Dortmund, Germany, 129--140, 2011. https://doi.org/10.4230/LIPIcs.STACS.2011.129.'
ieee: 'P. Kolman and C. Scheideler, “Towards Duality of Multicommodity Multiroute
Cuts and Flows: Multilevel Ball-Growing,” in 28th International Symposium on
Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund,
Germany, 2011, pp. 129--140.'
mla: 'Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing.” 28th International Symposium
on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund,
Germany, 2011, pp. 129--140, doi:10.4230/LIPIcs.STACS.2011.129.'
short: 'P. Kolman, C. Scheideler, in: 28th International Symposium on Theoretical
Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany,
2011, pp. 129--140.'
date_created: 2018-03-29T08:44:00Z
date_updated: 2022-01-06T06:54:00Z
department:
- _id: '79'
doi: 10.4230/LIPIcs.STACS.2011.129
page: 129--140
publication: 28th International Symposium on Theoretical Aspects of Computer Science,
STACS 2011, March 10-12, 2011, Dortmund, Germany
status: public
title: 'Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing'
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '645'
abstract:
- lang: eng
text: In the standard consensus problem there are n processes with possibly di®erent
input values and the goal is to eventually reach a point at which all processes
commit to exactly one of these values. We are studying a slight variant of the
consensus problem called the stabilizing consensus problem [2]. In this problem,
we do not require that each process commits to a ¯nal value at some point, but
that eventually they arrive at a common, stable value without necessarily being
aware of that. This should work irrespective of the states in which the processes
are starting. Our main result is a simple randomized algorithm called median rule
that, with high probability, just needs O(logmlog log n + log n) time and work
per process to arrive at an almost stable consensus for any set of m legal values
as long as an adversary can corrupt the states of at most p n processes at any
time. Without adversarial involvement, just O(log n) time and work is needed for
a stable consensus, with high probability. As a by-product, we obtain a simple
distributed algorithm for approximating the median of n numbers in time O(logmlog
log n + log n) under adversarial presence.
author:
- first_name: Benjamin
full_name: Doerr, Benjamin
last_name: Doerr
- first_name: Leslie Ann
full_name: Goldberg, Leslie Ann
last_name: Goldberg
- first_name: Lorenz
full_name: Minder, Lorenz
last_name: Minder
- first_name: Thomas
full_name: Sauerwald, Thomas
last_name: Sauerwald
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Doerr B, Goldberg LA, Minder L, Sauerwald T, Scheideler C. Stabilizing consensus
with the power of two choices. In: Proceedings of the 23rd ACM Symposium on
Parallelism in Algorithms and Architectures (SPAA). ; 2011:149-158. doi:10.1145/1989493.1989516'
apa: Doerr, B., Goldberg, L. A., Minder, L., Sauerwald, T., & Scheideler, C.
(2011). Stabilizing consensus with the power of two choices. In Proceedings
of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
(pp. 149–158). https://doi.org/10.1145/1989493.1989516
bibtex: '@inproceedings{Doerr_Goldberg_Minder_Sauerwald_Scheideler_2011, title={Stabilizing
consensus with the power of two choices}, DOI={10.1145/1989493.1989516},
booktitle={Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Doerr, Benjamin and Goldberg, Leslie Ann and
Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian}, year={2011},
pages={149–158} }'
chicago: Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald,
and Christian Scheideler. “Stabilizing Consensus with the Power of Two Choices.”
In Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 149–58, 2011. https://doi.org/10.1145/1989493.1989516.
ieee: B. Doerr, L. A. Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Stabilizing
consensus with the power of two choices,” in Proceedings of the 23rd ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2011, pp. 149–158.
mla: Doerr, Benjamin, et al. “Stabilizing Consensus with the Power of Two Choices.”
Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 2011, pp. 149–58, doi:10.1145/1989493.1989516.
short: 'B. Doerr, L.A. Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Proceedings
of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
2011, pp. 149–158.'
date_created: 2017-10-17T12:42:57Z
date_updated: 2022-01-06T07:03:05Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/1989493.1989516
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:58:11Z
date_updated: 2018-03-14T13:58:11Z
file_id: '1228'
file_name: 645-spaa70-scheideler.pdf
file_size: 268500
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:58:11Z
has_accepted_license: '1'
page: 149-158
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: Stabilizing consensus with the power of two choices
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '646'
abstract:
- lang: eng
text: This paper presents a dynamic overlay network based on the De Bruijn graph
which we call Linearized De Bruijn (LDB) network. The LDB network has the advantage
that it has a guaranteed constant node degree and that the routing between any
two nodes takes at most O(log n) hops with high probability. Also, we show that
there is a simple local-control algorithm that can recover the LDB network from
any network topology that is weakly connected.
author:
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Richa AW, Scheideler C. Self-Stabilizing DeBruijn Networks. In: Proceedings
of the 13th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS). LNCS. ; 2011:416-430. doi:10.1007/978-3-642-24550-3_31'
apa: Richa, A. W., & Scheideler, C. (2011). Self-Stabilizing DeBruijn Networks.
In Proceedings of the 13th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS) (pp. 416–430). https://doi.org/10.1007/978-3-642-24550-3_31
bibtex: '@inproceedings{Richa_Scheideler_2011, series={LNCS}, title={Self-Stabilizing
DeBruijn Networks}, DOI={10.1007/978-3-642-24550-3_31},
booktitle={Proceedings of the 13th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, author={Richa, Andrea W. and Scheideler,
Christian}, year={2011}, pages={416–430}, collection={LNCS} }'
chicago: Richa, Andrea W., and Christian Scheideler. “Self-Stabilizing DeBruijn
Networks.” In Proceedings of the 13th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS), 416–30. LNCS, 2011. https://doi.org/10.1007/978-3-642-24550-3_31.
ieee: A. W. Richa and C. Scheideler, “Self-Stabilizing DeBruijn Networks,” in Proceedings
of the 13th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS), 2011, pp. 416–430.
mla: Richa, Andrea W., and Christian Scheideler. “Self-Stabilizing DeBruijn Networks.”
Proceedings of the 13th International Symposium on Stabilization, Safety, and
Security of Distributed Systems (SSS), 2011, pp. 416–30, doi:10.1007/978-3-642-24550-3_31.
short: 'A.W. Richa, C. Scheideler, in: Proceedings of the 13th International Symposium
on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp.
416–430.'
date_created: 2017-10-17T12:42:58Z
date_updated: 2022-01-06T07:03:06Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-24550-3_31
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:57:26Z
date_updated: 2018-03-14T13:57:26Z
file_id: '1227'
file_name: 646-SSS2011-Scheideler_02.pdf
file_size: 339664
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:57:26Z
has_accepted_license: '1'
page: 416-430
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 13th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
series_title: LNCS
status: public
title: Self-Stabilizing DeBruijn Networks
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '662'
abstract:
- lang: eng
text: We present Corona, a deterministic self-stabilizing algorithm for skip list
construction in structured overlay networks. Corona operates in the low-atomicity
message-passing asynchronous system model. Corona requires constant process memory
space for its operation and, therefore, scales well. We prove the general necessary
conditions limiting the initial states from which a self-stabilizing structured
overlay network in message-passing system can be constructed. The conditions require
that initial state information has to form a weakly connected graph and it should
only contain identiers that are present in the system. We formally describe Corona
and rigorously prove that it stabilizes from an arbitrary initial state subject
to the necessary conditions. We extend Corona to construct a skip graph.
author:
- first_name: Mikhail
full_name: Nesterenko, Mikhail
last_name: Nesterenko
- first_name: Rizal
full_name: Mohd, Rizal
last_name: Mohd
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Nesterenko M, Mohd R, Scheideler C. Corona: A Stabilizing Deterministic Message-Passing
Skip List. In: Proceedings of the 13th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS). LNCS. ; 2011:356--370.
doi:10.1007/978-3-642-24550-3_27'
apa: 'Nesterenko, M., Mohd, R., & Scheideler, C. (2011). Corona: A Stabilizing
Deterministic Message-Passing Skip List. In Proceedings of the 13th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)
(pp. 356--370). https://doi.org/10.1007/978-3-642-24550-3_27'
bibtex: '@inproceedings{Nesterenko_Mohd_Scheideler_2011, series={LNCS}, title={Corona:
A Stabilizing Deterministic Message-Passing Skip List}, DOI={10.1007/978-3-642-24550-3_27},
booktitle={Proceedings of the 13th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, author={Nesterenko, Mikhail and Mohd,
Rizal and Scheideler, Christian}, year={2011}, pages={356--370}, collection={LNCS}
}'
chicago: 'Nesterenko, Mikhail, Rizal Mohd, and Christian Scheideler. “Corona: A
Stabilizing Deterministic Message-Passing Skip List.” In Proceedings of the
13th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS), 356--370. LNCS, 2011. https://doi.org/10.1007/978-3-642-24550-3_27.'
ieee: 'M. Nesterenko, R. Mohd, and C. Scheideler, “Corona: A Stabilizing Deterministic
Message-Passing Skip List,” in Proceedings of the 13th International Symposium
on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011,
pp. 356--370.'
mla: 'Nesterenko, Mikhail, et al. “Corona: A Stabilizing Deterministic Message-Passing
Skip List.” Proceedings of the 13th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS), 2011, pp. 356--370, doi:10.1007/978-3-642-24550-3_27.'
short: 'M. Nesterenko, R. Mohd, C. Scheideler, in: Proceedings of the 13th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS),
2011, pp. 356--370.'
date_created: 2017-10-17T12:43:01Z
date_updated: 2022-01-06T07:03:13Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-24550-3_27
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:46:48Z
date_updated: 2018-03-14T13:46:48Z
file_id: '1217'
file_name: 662-SSS2011-Corona-Scheideler.pdf
file_size: 305543
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:46:48Z
has_accepted_license: '1'
page: 356--370
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 13th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
series_title: LNCS
status: public
title: 'Corona: A Stabilizing Deterministic Message-Passing Skip List'
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '1882'
author:
- first_name: Shlomi
full_name: Dolev, Shlomi
last_name: Dolev
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Dolev S, Scheideler C. Editorial for Algorithmic Aspects of Wireless Sensor
Networks. Theor Comput Sci. 2012:1. doi:10.1016/j.tcs.2012.07.012
apa: Dolev, S., & Scheideler, C. (2012). Editorial for Algorithmic Aspects of
Wireless Sensor Networks. Theor. Comput. Sci., 1. https://doi.org/10.1016/j.tcs.2012.07.012
bibtex: '@article{Dolev_Scheideler_2012, title={Editorial for Algorithmic Aspects
of Wireless Sensor Networks}, DOI={10.1016/j.tcs.2012.07.012},
journal={Theor. Comput. Sci.}, author={Dolev, Shlomi and Scheideler, Christian},
year={2012}, pages={1} }'
chicago: Dolev, Shlomi, and Christian Scheideler. “Editorial for Algorithmic Aspects
of Wireless Sensor Networks.” Theor. Comput. Sci., 2012, 1. https://doi.org/10.1016/j.tcs.2012.07.012.
ieee: S. Dolev and C. Scheideler, “Editorial for Algorithmic Aspects of Wireless
Sensor Networks,” Theor. Comput. Sci., p. 1, 2012.
mla: Dolev, Shlomi, and Christian Scheideler. “Editorial for Algorithmic Aspects
of Wireless Sensor Networks.” Theor. Comput. Sci., 2012, p. 1, doi:10.1016/j.tcs.2012.07.012.
short: S. Dolev, C. Scheideler, Theor. Comput. Sci. (2012) 1.
date_created: 2018-03-28T06:44:05Z
date_updated: 2022-01-06T06:53:52Z
department:
- _id: '79'
doi: 10.1016/j.tcs.2012.07.012
page: '1'
publication: Theor. Comput. Sci.
status: public
title: Editorial for Algorithmic Aspects of Wireless Sensor Networks
type: journal_article
user_id: '15504'
year: '2012'
...
---
_id: '1884'
author:
- first_name: Burkhard
full_name: Monien, Burkhard
last_name: Monien
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Monien B, Scheideler C. Selfish Distributed Optimization. In: Euro-Par
2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes
Island, Greece, August 27-31, 2012. Proceedings. Vol 7484. Lecture Notes in
Computer Science. Springer; 2012:1--2. doi:10.1007/978-3-642-32820-6_1'
apa: Monien, B., & Scheideler, C. (2012). Selfish Distributed Optimization.
In Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par
2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings (Vol. 7484, pp.
1--2). Springer. https://doi.org/10.1007/978-3-642-32820-6_1
bibtex: '@inproceedings{Monien_Scheideler_2012, series={Lecture Notes in Computer
Science}, title={Selfish Distributed Optimization}, volume={7484}, DOI={10.1007/978-3-642-32820-6_1},
booktitle={Euro-Par 2012 Parallel Processing - 18th International Conference,
Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings}, publisher={Springer},
author={Monien, Burkhard and Scheideler, Christian}, year={2012}, pages={1--2},
collection={Lecture Notes in Computer Science} }'
chicago: Monien, Burkhard, and Christian Scheideler. “Selfish Distributed Optimization.”
In Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par
2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings, 7484:1--2. Lecture
Notes in Computer Science. Springer, 2012. https://doi.org/10.1007/978-3-642-32820-6_1.
ieee: B. Monien and C. Scheideler, “Selfish Distributed Optimization,” in Euro-Par
2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes
Island, Greece, August 27-31, 2012. Proceedings, 2012, vol. 7484, pp. 1--2.
mla: Monien, Burkhard, and Christian Scheideler. “Selfish Distributed Optimization.”
Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par
2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings, vol. 7484, Springer,
2012, pp. 1--2, doi:10.1007/978-3-642-32820-6_1.
short: 'B. Monien, C. Scheideler, in: Euro-Par 2012 Parallel Processing - 18th International
Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings,
Springer, 2012, pp. 1--2.'
date_created: 2018-03-28T06:44:57Z
date_updated: 2022-01-06T06:53:52Z
department:
- _id: '79'
doi: 10.1007/978-3-642-32820-6_1
intvolume: ' 7484'
page: 1--2
publication: Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par
2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings
publication_identifier:
isbn:
- 978-3-642-32819-0
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Selfish Distributed Optimization
type: conference
user_id: '15504'
volume: 7484
year: '2012'
...
---
_id: '570'
abstract:
- lang: eng
text: 'This article studies the construction of self-stabilizing topologies for
distributed systems. While recent research has focused on chain topologies where
nodes need to be linearized with respect to their identiers, we explore a natural
and relevant 2-dimensional generalization. In particular, we present a local self-stabilizing
algorithm DStab which is based on the concept of \local Delaunay graphs" and which
forwards temporary edges in greedy fashion reminiscent of compass routing. DStab
constructs a Delaunay graph from any initial connected topology and in a distributed
manner in time O(n3) in the worst-case; if the initial network contains the Delaunay
graph, the convergence time is only O(n) rounds. DStab also ensures that individual
node joins and leaves aect a small part of the network only. Such self-stabilizing
Delaunay networks have interesting applications and our construction gives insights
into the necessary geometric reasoning that is required for higherdimensional
linearization problems.Keywords: Distributed Algorithms, Topology Control, Social
Networks'
author:
- first_name: Riko
full_name: Jacob, Riko
last_name: Jacob
- first_name: Stephan
full_name: Ritscher, Stephan
last_name: Ritscher
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Jacob R, Ritscher S, Scheideler C, Schmid S. Towards higher-dimensional topological
self-stabilization: A distributed algorithm for Delaunay graphs. Theoretical
Computer Science. 2012:137-148. doi:10.1016/j.tcs.2012.07.029'
apa: 'Jacob, R., Ritscher, S., Scheideler, C., & Schmid, S. (2012). Towards
higher-dimensional topological self-stabilization: A distributed algorithm for
Delaunay graphs. Theoretical Computer Science, 137–148. https://doi.org/10.1016/j.tcs.2012.07.029'
bibtex: '@article{Jacob_Ritscher_Scheideler_Schmid_2012, title={Towards higher-dimensional
topological self-stabilization: A distributed algorithm for Delaunay graphs},
DOI={10.1016/j.tcs.2012.07.029},
journal={Theoretical Computer Science}, publisher={Elsevier}, author={Jacob, Riko
and Ritscher, Stephan and Scheideler, Christian and Schmid, Stefan}, year={2012},
pages={137–148} }'
chicago: 'Jacob, Riko, Stephan Ritscher, Christian Scheideler, and Stefan Schmid.
“Towards Higher-Dimensional Topological Self-Stabilization: A Distributed Algorithm
for Delaunay Graphs.” Theoretical Computer Science, 2012, 137–48. https://doi.org/10.1016/j.tcs.2012.07.029.'
ieee: 'R. Jacob, S. Ritscher, C. Scheideler, and S. Schmid, “Towards higher-dimensional
topological self-stabilization: A distributed algorithm for Delaunay graphs,”
Theoretical Computer Science, pp. 137–148, 2012.'
mla: 'Jacob, Riko, et al. “Towards Higher-Dimensional Topological Self-Stabilization:
A Distributed Algorithm for Delaunay Graphs.” Theoretical Computer Science,
Elsevier, 2012, pp. 137–48, doi:10.1016/j.tcs.2012.07.029.'
short: R. Jacob, S. Ritscher, C. Scheideler, S. Schmid, Theoretical Computer Science
(2012) 137–148.
date_created: 2017-10-17T12:42:43Z
date_updated: 2022-01-06T07:02:36Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1016/j.tcs.2012.07.029
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:16:20Z
date_updated: 2018-03-15T10:16:20Z
file_id: '1272'
file_name: 570-Delaunay-Journal.pdf
file_size: 250051
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:16:20Z
has_accepted_license: '1'
page: 137-148
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Theoretical Computer Science
publisher: Elsevier
status: public
title: 'Towards higher-dimensional topological self-stabilization: A distributed algorithm
for Delaunay graphs'
type: journal_article
user_id: '477'
year: '2012'
...
---
_id: '574'
abstract:
- lang: eng
text: 'We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm.
Tiara is truly deterministic which allows it to achieve exact performance bounds.
Tiara allows logarithmic searches and topology updates. It is based on a novel
sparse 0-1 skip list. We then describe its extension to a ringed structure and
to a skip-graph.Key words: Peer-to-peer networks, overlay networks, self-stabilization.'
author:
- first_name: Thomas
full_name: Clouser, Thomas
last_name: Clouser
- first_name: Mikhail
full_name: Nesterenko, Mikhail
last_name: Nesterenko
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Clouser T, Nesterenko M, Scheideler C. Tiara: A self-stabilizing deterministic
skip list and skip graph. Theoretical Computer Science. 2012:18-35. doi:10.1016/j.tcs.2011.12.079'
apa: 'Clouser, T., Nesterenko, M., & Scheideler, C. (2012). Tiara: A self-stabilizing
deterministic skip list and skip graph. Theoretical Computer Science, 18–35.
https://doi.org/10.1016/j.tcs.2011.12.079'
bibtex: '@article{Clouser_Nesterenko_Scheideler_2012, title={Tiara: A self-stabilizing
deterministic skip list and skip graph}, DOI={10.1016/j.tcs.2011.12.079},
journal={Theoretical Computer Science}, publisher={Elsevier}, author={Clouser,
Thomas and Nesterenko, Mikhail and Scheideler, Christian}, year={2012}, pages={18–35}
}'
chicago: 'Clouser, Thomas, Mikhail Nesterenko, and Christian Scheideler. “Tiara:
A Self-Stabilizing Deterministic Skip List and Skip Graph.” Theoretical Computer
Science, 2012, 18–35. https://doi.org/10.1016/j.tcs.2011.12.079.'
ieee: 'T. Clouser, M. Nesterenko, and C. Scheideler, “Tiara: A self-stabilizing
deterministic skip list and skip graph,” Theoretical Computer Science,
pp. 18–35, 2012.'
mla: 'Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List
and Skip Graph.” Theoretical Computer Science, Elsevier, 2012, pp. 18–35,
doi:10.1016/j.tcs.2011.12.079.'
short: T. Clouser, M. Nesterenko, C. Scheideler, Theoretical Computer Science (2012)
18–35.
date_created: 2017-10-17T12:42:44Z
date_updated: 2022-01-06T07:02:38Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1016/j.tcs.2011.12.079
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T09:09:29Z
date_updated: 2018-03-15T09:09:29Z
file_id: '1268'
file_name: 574-tiara.pdf
file_size: 315843
relation: main_file
success: 1
file_date_updated: 2018-03-15T09:09:29Z
has_accepted_license: '1'
page: 18-35
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Theoretical Computer Science
publisher: Elsevier
status: public
title: 'Tiara: A self-stabilizing deterministic skip list and skip graph'
type: journal_article
user_id: '477'
year: '2012'
...
---
_id: '579'
abstract:
- lang: eng
text: A left-to-right maximum in a sequence of n numbers s_1, …, s_n is a number
that is strictly larger than all preceding numbers. In this article we present
a smoothed analysis of the number of left-to-right maxima in the presence of additive
random noise. We show that for every sequence of n numbers s_i ∈ [0,1] that are
perturbed by uniform noise from the interval [-ε,ε], the expected number of left-to-right
maxima is Θ(&sqrt;n/ε + log n) for ε>1/n. For Gaussian noise with standard deviation
σ we obtain a bound of O((log3/2 n)/σ + log n).We apply our results to the analysis
of the smoothed height of binary search trees and the smoothed number of comparisons
in the quicksort algorithm and prove bounds of Θ(&sqrt;n/ε + log n) and Θ(n/ε+1&sqrt;n/ε
+ n log n), respectively, for uniform random noise from the interval [-ε,ε]. Our
results can also be applied to bound the smoothed number of points on a convex
hull of points in the two-dimensional plane and to smoothed motion complexity,
a concept we describe in this article. We bound how often one needs to update
a data structure storing the smallest axis-aligned box enclosing a set of points
moving in d-dimensional space.
author:
- first_name: Valentina
full_name: Damerow, Valentina
last_name: Damerow
- first_name: Bodo
full_name: Manthey, Bodo
last_name: Manthey
- 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
- first_name: Till
full_name: Tantau, Till
last_name: Tantau
citation:
ama: Damerow V, Manthey B, Meyer auf der Heide F, et al. Smoothed analysis of left-to-right
maxima with applications. Transactions on Algorithms. 2012;(3):30. doi:10.1145/2229163.2229174
apa: Damerow, V., Manthey, B., Meyer auf der Heide, F., Räcke, H., Scheideler, C.,
Sohler, C., & Tantau, T. (2012). Smoothed analysis of left-to-right maxima
with applications. Transactions on Algorithms, (3), 30. https://doi.org/10.1145/2229163.2229174
bibtex: '@article{Damerow_Manthey_Meyer auf der Heide_Räcke_Scheideler_Sohler_Tantau_2012,
title={Smoothed analysis of left-to-right maxima with applications}, DOI={10.1145/2229163.2229174},
number={3}, journal={Transactions on Algorithms}, publisher={ACM}, author={Damerow,
Valentina and Manthey, Bodo and Meyer auf der Heide, Friedhelm and Räcke, Harald
and Scheideler, Christian and Sohler, Christian and Tantau, Till}, year={2012},
pages={30} }'
chicago: 'Damerow, Valentina, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald
Räcke, Christian Scheideler, Christian Sohler, and Till Tantau. “Smoothed Analysis
of Left-to-Right Maxima with Applications.” Transactions on Algorithms,
no. 3 (2012): 30. https://doi.org/10.1145/2229163.2229174.'
ieee: V. Damerow et al., “Smoothed analysis of left-to-right maxima with
applications,” Transactions on Algorithms, no. 3, p. 30, 2012.
mla: Damerow, Valentina, et al. “Smoothed Analysis of Left-to-Right Maxima with
Applications.” Transactions on Algorithms, no. 3, ACM, 2012, p. 30, doi:10.1145/2229163.2229174.
short: V. Damerow, B. Manthey, F. Meyer auf der Heide, H. Räcke, C. Scheideler,
C. Sohler, T. Tantau, Transactions on Algorithms (2012) 30.
date_created: 2017-10-17T12:42:45Z
date_updated: 2022-01-06T07:02:41Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1145/2229163.2229174
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T09:04:58Z
date_updated: 2018-03-15T09:04:58Z
file_id: '1266'
file_name: 579-a30-damerow.pdf
file_size: 329282
relation: main_file
success: 1
file_date_updated: 2018-03-15T09:04:58Z
has_accepted_license: '1'
issue: '3'
page: '30'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Transactions on Algorithms
publisher: ACM
status: public
title: Smoothed analysis of left-to-right maxima with applications
type: journal_article
user_id: '477'
year: '2012'
...
---
_id: '581'
abstract:
- lang: eng
text: 'Nanoparticles are getting more and more in the focus of the scientic community
since the potential for the development of very small particles interacting with
each other and completing medical and other tasks is getting bigger year by year.
In this work we introduce a distributed local algorithm for arranging a set of
nanoparticles on the discrete plane into specic geometric shapes, for instance
a rectangle. The concept of a particle we use can be seen as a simple mobile robot
with the following restrictions: it can only view the state of robots it is physically
connected to, is anonymous, has only a constant size memory, can only move by
using other particles as an anchor point on which it pulls itself alongside, and
it operates in Look-Compute-Move cycles. The main result of this work is the presentation
of a random distributed local algorithm which transforms any given connected set
of particles into a particular geometric shape. As an example we provide a version
of this algorithm for forming a rectangle with an arbitrary predened aspect ratio.
To the best of our knowledge this is the rst work that considers arrangement problems
for these types of robots.'
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Martina
full_name: 'Hüllmann (married name: Eikel), Martina'
last_name: 'Hüllmann (married name: Eikel)'
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Drees M, Hüllmann (married name: Eikel) M, Koutsopoulos A, Scheideler C. Self-Organizing
Particle Systems. In: Proceedings of the 26th IEEE International Parallel and
Distributed Processing Symposium (IPDPS). ; 2012:1272-1283. doi:10.1109/IPDPS.2012.116'
apa: 'Drees, M., Hüllmann (married name: Eikel), M., Koutsopoulos, A., & Scheideler,
C. (2012). Self-Organizing Particle Systems. In Proceedings of the 26th IEEE
International Parallel and Distributed Processing Symposium (IPDPS) (pp. 1272–1283).
https://doi.org/10.1109/IPDPS.2012.116'
bibtex: '@inproceedings{Drees_Hüllmann (married name: Eikel)_Koutsopoulos_Scheideler_2012,
title={Self-Organizing Particle Systems}, DOI={10.1109/IPDPS.2012.116},
booktitle={Proceedings of the 26th IEEE International Parallel and Distributed
Processing Symposium (IPDPS)}, author={Drees, Maximilian and Hüllmann (married
name: Eikel), Martina and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012},
pages={1272–1283} }'
chicago: 'Drees, Maximilian, Martina Hüllmann (married name: Eikel), Andreas Koutsopoulos,
and Christian Scheideler. “Self-Organizing Particle Systems.” In Proceedings
of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS),
1272–83, 2012. https://doi.org/10.1109/IPDPS.2012.116.'
ieee: 'M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, and C. Scheideler,
“Self-Organizing Particle Systems,” in Proceedings of the 26th IEEE International
Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–1283.'
mla: Drees, Maximilian, et al. “Self-Organizing Particle Systems.” Proceedings
of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS),
2012, pp. 1272–83, doi:10.1109/IPDPS.2012.116.
short: 'M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, C. Scheideler,
in: Proceedings of the 26th IEEE International Parallel and Distributed Processing
Symposium (IPDPS), 2012, pp. 1272–1283.'
date_created: 2017-10-17T12:42:45Z
date_updated: 2022-01-06T07:02:42Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1109/IPDPS.2012.116
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:39:33Z
date_updated: 2018-03-15T08:39:33Z
file_id: '1263'
file_name: 581-IPDPS2012-Scheideler_Huellmann.pdf
file_size: 373131
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:39:33Z
has_accepted_license: '1'
language:
- iso: eng
page: 1272-1283
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 26th IEEE International Parallel and Distributed Processing
Symposium (IPDPS)
status: public
title: Self-Organizing Particle Systems
type: conference
user_id: '14955'
year: '2012'
...
---
_id: '623'
abstract:
- lang: eng
text: 'This paper initiates the formal study of a fundamental problem: How to efficiently
allocate a shared communication medium among a set of K co-existing networks in
the presence of arbitrary external interference? While most literature on medium
access focuses on how to share a medium among nodes, these approaches are often
either not directly applicable to co-existing networks as they would violate the
independence requirement, or they yield a low throughput if applied to multiple
networks. We present the randomized medium access (MAC) protocol COMAC which guarantees
that a given communication channel is shared fairly among competing and independent
networks, and that the available bandwidth is used efficiently. These performance
guarantees hold in the presence of arbitrary external interference or even under
adversarial jamming. Concretely, we show that the co-existing networks can use
a Ω(ε2 min{ε, 1/poly(K)})-fraction of the non-jammed time steps for successful
message transmissions, where ε is the (arbitrarily distributed) fraction of time
which is not jammed.'
author:
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: 'Jin '
full_name: 'Zhang, Jin '
last_name: Zhang
citation:
ama: 'Richa AW, Scheideler C, Schmid S, Zhang J. Competitive and fair throughput
for co-existing networks under adversarial interference. In: Proceedings of
the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing
(PODC). ; 2012:291-300. doi:10.1145/2332432.2332488'
apa: Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2012). Competitive
and fair throughput for co-existing networks under adversarial interference. In
Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and
Distributed Computing (PODC) (pp. 291–300). https://doi.org/10.1145/2332432.2332488
bibtex: '@inproceedings{Richa_Scheideler_Schmid_Zhang_2012, title={Competitive and
fair throughput for co-existing networks under adversarial interference}, DOI={10.1145/2332432.2332488}, booktitle={Proceedings
of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing
(PODC)}, author={Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan
and Zhang, Jin }, year={2012}, pages={291–300} }'
chicago: Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin Zhang.
“Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.”
In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles
and Distributed Computing (PODC), 291–300, 2012. https://doi.org/10.1145/2332432.2332488.
ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and fair
throughput for co-existing networks under adversarial interference,” in Proceedings
of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing
(PODC), 2012, pp. 291–300.
mla: Richa, Andrea W., et al. “Competitive and Fair Throughput for Co-Existing Networks
under Adversarial Interference.” Proceedings of the 31st Annual ACM SIGACT-SIGOPS
Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300,
doi:10.1145/2332432.2332488.
short: 'A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 31st
Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC),
2012, pp. 291–300.'
date_created: 2017-10-17T12:42:53Z
date_updated: 2022-01-06T07:02:58Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/2332432.2332488
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:45:25Z
date_updated: 2018-03-15T06:45:25Z
file_id: '1241'
file_name: 623-PODC-2012_01.pdf
file_size: 210382
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:45:25Z
has_accepted_license: '1'
page: 291-300
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles
and Distributed Computing (PODC)
status: public
title: Competitive and fair throughput for co-existing networks under adversarial
interference
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '625'
abstract:
- lang: eng
text: 'This paper initiates the study of self-adjusting distributed data structures
for networks. In particular, we present SplayNets: a binary search tree based
network that is self-adjusting to routing request.We derive entropy bounds on
the amortized routing cost and show that our splaying algorithm has some interesting
properties.'
author:
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Chen
full_name: Avin, Chen
last_name: Avin
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Bernhard
full_name: Häupler, Bernhard
last_name: Häupler
- first_name: Zvi
full_name: Lotker, Zvi
last_name: Lotker
citation:
ama: 'Schmid S, Avin C, Scheideler C, Häupler B, Lotker Z. Brief Announcement: SplayNets
- Towards Self-Adjusting Distributed Data Structures. In: Proceedings of the
26th International Symposium on Distributed Computing (DISC). LNCS. ; 2012:439-440.
doi:10.1007/978-3-642-33651-5_47'
apa: 'Schmid, S., Avin, C., Scheideler, C., Häupler, B., & Lotker, Z. (2012).
Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.
In Proceedings of the 26th International Symposium on Distributed Computing
(DISC) (pp. 439–440). https://doi.org/10.1007/978-3-642-33651-5_47'
bibtex: '@inproceedings{Schmid_Avin_Scheideler_Häupler_Lotker_2012, series={LNCS},
title={Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data
Structures}, DOI={10.1007/978-3-642-33651-5_47},
booktitle={Proceedings of the 26th International Symposium on Distributed Computing
(DISC)}, author={Schmid, Stefan and Avin, Chen and Scheideler, Christian and Häupler,
Bernhard and Lotker, Zvi}, year={2012}, pages={439–440}, collection={LNCS} }'
chicago: 'Schmid, Stefan, Chen Avin, Christian Scheideler, Bernhard Häupler, and
Zvi Lotker. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed
Data Structures.” In Proceedings of the 26th International Symposium on Distributed
Computing (DISC), 439–40. LNCS, 2012. https://doi.org/10.1007/978-3-642-33651-5_47.'
ieee: 'S. Schmid, C. Avin, C. Scheideler, B. Häupler, and Z. Lotker, “Brief Announcement:
SplayNets - Towards Self-Adjusting Distributed Data Structures,” in Proceedings
of the 26th International Symposium on Distributed Computing (DISC), 2012,
pp. 439–440.'
mla: 'Schmid, Stefan, et al. “Brief Announcement: SplayNets - Towards Self-Adjusting
Distributed Data Structures.” Proceedings of the 26th International Symposium
on Distributed Computing (DISC), 2012, pp. 439–40, doi:10.1007/978-3-642-33651-5_47.'
short: 'S. Schmid, C. Avin, C. Scheideler, B. Häupler, Z. Lotker, in: Proceedings
of the 26th International Symposium on Distributed Computing (DISC), 2012, pp.
439–440.'
date_created: 2017-10-17T12:42:53Z
date_updated: 2022-01-06T07:02:58Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-33651-5_47
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:44:09Z
date_updated: 2018-03-15T06:44:09Z
file_id: '1240'
file_name: 625-disc12adjBAshort.pdf
file_size: 717284
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:44:09Z
has_accepted_license: '1'
page: 439-440
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 26th International Symposium on Distributed Computing
(DISC)
series_title: LNCS
status: public
title: 'Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures'
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '626'
abstract:
- lang: eng
text: The design of ecient search structures for peer-to-peer systems has attracted
a lot of attention in recent years. In this announcement we address the problem
of nding the predecessor in a key set and present an ecient data structure called
hashed Predecessor Patricia trie. Our hashed Predecessor Patricia trie supports
PredecessorSearch(x) and Insert(x) and Delete(x) in O(log log u) hash table accesses
when u is the size of the universe of the keys. That is the costs only depend
on u and not the size of the data structure. One feature of our approach is that
it only uses the lookup interface of the hash table and therefore hash table accesses
may be realized by any distributed hash table (DHT).
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Scheideler C. Brief Announcement: Hashed Predecessor Patricia
Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.
In: Proceedings of the 26th International Symposium on Distributed Computing
(DISC). LNCS. ; 2012:435-436. doi:10.1007/978-3-642-33651-5_45'
apa: 'Kniesburges, S., & Scheideler, C. (2012). Brief Announcement: Hashed Predecessor
Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer
Systems. In Proceedings of the 26th International Symposium on Distributed
Computing (DISC) (pp. 435–436). https://doi.org/10.1007/978-3-642-33651-5_45'
bibtex: '@inproceedings{Kniesburges_Scheideler_2012, series={LNCS}, title={Brief
Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient
Predecessor Queries in Peer-to-Peer Systems}, DOI={10.1007/978-3-642-33651-5_45},
booktitle={Proceedings of the 26th International Symposium on Distributed Computing
(DISC)}, author={Kniesburges, Sebastian and Scheideler, Christian}, year={2012},
pages={435–436}, collection={LNCS} }'
chicago: 'Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement:
Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor
Queries in Peer-to-Peer Systems.” In Proceedings of the 26th International
Symposium on Distributed Computing (DISC), 435–36. LNCS, 2012. https://doi.org/10.1007/978-3-642-33651-5_45.'
ieee: 'S. Kniesburges and C. Scheideler, “Brief Announcement: Hashed Predecessor
Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer
Systems,” in Proceedings of the 26th International Symposium on Distributed
Computing (DISC), 2012, pp. 435–436.'
mla: 'Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed
Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries
in Peer-to-Peer Systems.” Proceedings of the 26th International Symposium on
Distributed Computing (DISC), 2012, pp. 435–36, doi:10.1007/978-3-642-33651-5_45.'
short: 'S. Kniesburges, C. Scheideler, in: Proceedings of the 26th International
Symposium on Distributed Computing (DISC), 2012, pp. 435–436.'
date_created: 2017-10-17T12:42:54Z
date_updated: 2022-01-06T07:02:59Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-33651-5_45
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:42:40Z
date_updated: 2018-03-15T06:42:40Z
file_id: '1239'
file_name: 626-Predecessor-Kniesburges_Scheideler.pdf
file_size: 184095
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:42:40Z
has_accepted_license: '1'
page: 435-436
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 26th International Symposium on Distributed Computing
(DISC)
series_title: LNCS
status: public
title: 'Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for
Efficient Predecessor Queries in Peer-to-Peer Systems'
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '632'
abstract:
- lang: eng
text: 'Given an integer h, a graph G = (V;E) with arbitrary positive edge capacities
and k pairs of vertices (s1; t1); (s2; t2); : : : ; (sk; tk), called terminals,
an h-route cut is a set F µ E of edges such that after the removal of the edges
in F no pair si ¡ ti is connected by h edge-disjoint paths (i.e., the connectivity
of every si ¡ ti pair is at most h ¡ 1 in (V;E n F)). The h-route cut is a natural
generalization of the classical cut problem for multicommodity °ows (take h =
1). The main result of this paper is an O(h722h log2 k)-approximation algorithm
for the minimum h-route cut problem in the case that s1 = s2 = ¢ ¢ ¢ = sk, called
the single source case. As a corollary of it we obtain an approximate duality
theorem for multiroute multicom-modity °ows and cuts with a single source. This
partially answers an open question posted in several previous papers dealing with
cuts for multicommodity multiroute problems.'
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. Approximate Duality of Multicommodity Multiroute Flows
and Cuts: Single Source Case. In: Proceedings of the 23th ACM SIAM Symposium
on Discrete Algorithms (SODA). ; 2012:800-810. doi:10.1137/1.9781611973099.64'
apa: 'Kolman, P., & Scheideler, C. (2012). Approximate Duality of Multicommodity
Multiroute Flows and Cuts: Single Source Case. In Proceedings of the 23th ACM
SIAM Symposium on Discrete Algorithms (SODA) (pp. 800–810). https://doi.org/10.1137/1.9781611973099.64'
bibtex: '@inproceedings{Kolman_Scheideler_2012, title={Approximate Duality of Multicommodity
Multiroute Flows and Cuts: Single Source Case}, DOI={10.1137/1.9781611973099.64},
booktitle={Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)},
author={Kolman, Petr and Scheideler, Christian}, year={2012}, pages={800–810}
}'
chicago: 'Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity
Multiroute Flows and Cuts: Single Source Case.” In Proceedings of the 23th
ACM SIAM Symposium on Discrete Algorithms (SODA), 800–810, 2012. https://doi.org/10.1137/1.9781611973099.64.'
ieee: 'P. Kolman and C. Scheideler, “Approximate Duality of Multicommodity Multiroute
Flows and Cuts: Single Source Case,” in Proceedings of the 23th ACM SIAM Symposium
on Discrete Algorithms (SODA), 2012, pp. 800–810.'
mla: 'Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity
Multiroute Flows and Cuts: Single Source Case.” Proceedings of the 23th ACM
SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–10, doi:10.1137/1.9781611973099.64.'
short: 'P. Kolman, C. Scheideler, in: Proceedings of the 23th ACM SIAM Symposium
on Discrete Algorithms (SODA), 2012, pp. 800–810.'
date_created: 2017-10-17T12:42:55Z
date_updated: 2022-01-06T07:03:01Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1137/1.9781611973099.64
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:35:58Z
date_updated: 2018-03-15T06:35:58Z
file_id: '1234'
file_name: 632-SODA2012-Scheideler_01.pdf
file_size: 220213
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:35:58Z
has_accepted_license: '1'
page: 800-810
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)
status: public
title: 'Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source
Case'
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '640'
abstract:
- lang: eng
text: Small-world networks have received significant attention because of their
potential as models for the interaction networks of complex systems. Specifically,
neither random networks nor regular lattices seem to be an adequate framework
within which to study real-world complex systems such as chemical-reaction networks,
neural networks, food webs, social networks, scientific-collaboration networks,
and computer networks. Small-world networks provide some desired properties like
an expected polylogarithmic distance between two processes in the network, which
allows routing in polylogarithmic hops by simple greedy routing, and robustness
against attacks or failures. By these properties, small-world networks are possible
solutions for large overlay networks comparable to structured overlay networks
like CAN, Pastry, Chord, which also provide polylogarithmic routing, but due to
their uniform structure, structured overlay networks are more vulnerable to attacks
or failures. In this paper we bring together a randomized process converging to
a small-world network and a self-stabilization process so that a small-world network
is formed out of any weakly connected initial state. To the best of our knowledge
this is the first distributed self-stabilization process for building a small-world
network.
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Koutsopoulos A, Scheideler C. A Self-Stabilization Process
for Small-World Networks. In: Proceedings of the 26th IEEE International Parallel
and Distributed Processing Symposium (IPDPS). ; 2012:1261--1271. doi:10.1109/IPDPS.2012.115'
apa: Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2012). A Self-Stabilization
Process for Small-World Networks. In Proceedings of the 26th IEEE International
Parallel and Distributed Processing Symposium (IPDPS) (pp. 1261--1271). https://doi.org/10.1109/IPDPS.2012.115
bibtex: '@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2012, title={A Self-Stabilization
Process for Small-World Networks}, DOI={10.1109/IPDPS.2012.115},
booktitle={Proceedings of the 26th IEEE International Parallel and Distributed
Processing Symposium (IPDPS)}, author={Kniesburges, Sebastian and Koutsopoulos,
Andreas and Scheideler, Christian}, year={2012}, pages={1261--1271} }'
chicago: Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler.
“A Self-Stabilization Process for Small-World Networks.” In Proceedings of
the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS),
1261--1271, 2012. https://doi.org/10.1109/IPDPS.2012.115.
ieee: S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A Self-Stabilization
Process for Small-World Networks,” in Proceedings of the 26th IEEE International
Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271.
mla: Kniesburges, Sebastian, et al. “A Self-Stabilization Process for Small-World
Networks.” Proceedings of the 26th IEEE International Parallel and Distributed
Processing Symposium (IPDPS), 2012, pp. 1261--1271, doi:10.1109/IPDPS.2012.115.
short: 'S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th
IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012,
pp. 1261--1271.'
date_created: 2017-10-17T12:42:56Z
date_updated: 2022-01-06T07:03:04Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/IPDPS.2012.115
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T14:13:13Z
date_updated: 2018-03-14T14:13:13Z
file_id: '1230'
file_name: 640-IPDPS2012-Kniesb-Kouts-Scheideler.pdf
file_size: 210176
relation: main_file
success: 1
file_date_updated: 2018-03-14T14:13:13Z
has_accepted_license: '1'
page: 1261--1271
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 26th IEEE International Parallel and Distributed Processing
Symposium (IPDPS)
status: public
title: A Self-Stabilization Process for Small-World Networks
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '1868'
author:
- first_name: Andr{\'{e}}a
full_name: W. Richa, Andr{\'{e}}a
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: W. Richa A, Scheideler C, Schmid S, Zhang J. Competitive throughput in multi-hop
wireless networks despite adaptive jamming. Distributed Computing. 2013;(3):159--171.
doi:10.1007/s00446-012-0180-x
apa: W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2013). Competitive
throughput in multi-hop wireless networks despite adaptive jamming. Distributed
Computing, (3), 159--171. https://doi.org/10.1007/s00446-012-0180-x
bibtex: '@article{W. Richa_Scheideler_Schmid_Zhang_2013, title={Competitive throughput
in multi-hop wireless networks despite adaptive jamming}, DOI={10.1007/s00446-012-0180-x},
number={3}, journal={Distributed Computing}, author={W. Richa, Andr{\’{e}}a and
Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2013}, pages={159--171}
}'
chicago: 'W. Richa, Andr{\’{e}}a, Christian Scheideler, Stefan Schmid, and Jin Zhang.
“Competitive Throughput in Multi-Hop Wireless Networks despite Adaptive Jamming.”
Distributed Computing, no. 3 (2013): 159--171. https://doi.org/10.1007/s00446-012-0180-x.'
ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive throughput
in multi-hop wireless networks despite adaptive jamming,” Distributed Computing,
no. 3, pp. 159--171, 2013.
mla: W. Richa, Andr{\’{e}}a, et al. “Competitive Throughput in Multi-Hop Wireless
Networks despite Adaptive Jamming.” Distributed Computing, no. 3, 2013,
pp. 159--171, doi:10.1007/s00446-012-0180-x.
short: A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, Distributed Computing (2013)
159--171.
date_created: 2018-03-28T06:31:02Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '79'
doi: 10.1007/s00446-012-0180-x
issue: '3'
page: 159--171
publication: Distributed Computing
status: public
title: Competitive throughput in multi-hop wireless networks despite adaptive jamming
type: journal_article
user_id: '15504'
year: '2013'
...
---
_id: '1870'
author:
- first_name: Rizal
full_name: Mohd Nor, Rizal
last_name: Mohd Nor
- first_name: Mikhail
full_name: Nesterenko, Mikhail
last_name: Nesterenko
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Mohd Nor R, Nesterenko M, Scheideler C. Corona: A stabilizing deterministic
message-passing skip list. Theor Comput Sci. 2013:119--129. doi:10.1016/j.tcs.2012.08.029
apa: Mohd Nor, R., Nesterenko, M., & Scheideler, C. (2013). Corona: A stabilizing
deterministic message-passing skip list. Theor. Comput. Sci., 119--129.
https://doi.org/10.1016/j.tcs.2012.08.029
bibtex: '@article{Mohd Nor_Nesterenko_Scheideler_2013, title={Corona: A stabilizing
deterministic message-passing skip list}, DOI={10.1016/j.tcs.2012.08.029},
journal={Theor. Comput. Sci.}, author={Mohd Nor, Rizal and Nesterenko, Mikhail
and Scheideler, Christian}, year={2013}, pages={119--129} }'
chicago: Mohd Nor, Rizal, Mikhail Nesterenko, and Christian Scheideler. “Corona:
A Stabilizing Deterministic Message-Passing Skip List.” Theor. Comput. Sci.,
2013, 119--129. https://doi.org/10.1016/j.tcs.2012.08.029.
ieee: R. Mohd Nor, M. Nesterenko, and C. Scheideler, “Corona: A stabilizing deterministic
message-passing skip list,” Theor. Comput. Sci., pp. 119--129, 2013.
mla: Mohd Nor, Rizal, et al. “Corona: A Stabilizing Deterministic Message-Passing
Skip List.” Theor. Comput. Sci., 2013, pp. 119--129, doi:10.1016/j.tcs.2012.08.029.
short: R. Mohd Nor, M. Nesterenko, C. Scheideler, Theor. Comput. Sci. (2013) 119--129.
date_created: 2018-03-28T06:32:26Z
date_updated: 2022-01-06T06:53:51Z
department:
- _id: '79'
doi: 10.1016/j.tcs.2012.08.029
page: 119--129
publication: Theor. Comput. Sci.
status: public
title: 'Corona: A stabilizing deterministic message-passing skip list'
type: journal_article
user_id: '15504'
year: '2013'
...
---
_id: '1871'
author:
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: W. Richa A, Scheideler C, Schmid S, Zhang J. An Efficient and Fair MAC Protocol
Robust to Reactive Interference. IEEE/ACM Trans Netw. 2013;(3):760--771.
doi:10.1109/TNET.2012.2210241
apa: W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2013). An Efficient
and Fair MAC Protocol Robust to Reactive Interference. IEEE/ACM Trans. Netw.,
(3), 760--771. https://doi.org/10.1109/TNET.2012.2210241
bibtex: '@article{W. Richa_Scheideler_Schmid_Zhang_2013, title={An Efficient and
Fair MAC Protocol Robust to Reactive Interference}, DOI={10.1109/TNET.2012.2210241},
number={3}, journal={IEEE/ACM Trans. Netw.}, author={W. Richa, Andrea and Scheideler,
Christian and Schmid, Stefan and Zhang, Jin}, year={2013}, pages={760--771} }'
chicago: 'W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang.
“An Efficient and Fair MAC Protocol Robust to Reactive Interference.” IEEE/ACM
Trans. Netw., no. 3 (2013): 760--771. https://doi.org/10.1109/TNET.2012.2210241.'
ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “An Efficient and Fair
MAC Protocol Robust to Reactive Interference,” IEEE/ACM Trans. Netw., no.
3, pp. 760--771, 2013.
mla: W. Richa, Andrea, et al. “An Efficient and Fair MAC Protocol Robust to Reactive
Interference.” IEEE/ACM Trans. Netw., no. 3, 2013, pp. 760--771, doi:10.1109/TNET.2012.2210241.
short: A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, IEEE/ACM Trans. Netw. (2013)
760--771.
date_created: 2018-03-28T06:32:59Z
date_updated: 2022-01-06T06:53:51Z
department:
- _id: '79'
doi: 10.1109/TNET.2012.2210241
issue: '3'
page: 760--771
publication: IEEE/ACM Trans. Netw.
status: public
title: An Efficient and Fair MAC Protocol Robust to Reactive Interference
type: journal_article
user_id: '15504'
year: '2013'
...
---
_id: '476'
abstract:
- lang: eng
text: 'An elementary h-route ow, for an integer h 1, is a set of h edge- disjoint
paths between a source and a sink, each path carrying a unit of ow, and an h-route
ow is a non-negative linear combination of elementary h-routeows. An h-route cut
is a set of edges whose removal decreases the maximum h-route ow between a given
source-sink pair (or between every source-sink pair in the multicommodity setting)
to zero. The main result of this paper is an approximate duality theorem for multicommodity
h-route cuts and ows, for h 3: The size of a minimum h-route cut is at least f=h
and at most O(log4 k f) where f is the size of the maximum h-routeow and k is
the number of commodities. The main step towards the proof of this duality is
the design and analysis of a polynomial-time approximation algorithm for the minimum
h-route cut problem for h = 3 that has an approximation ratio of O(log4 k). Previously,
polylogarithmic approximation was known only for h-route cuts for h 2. A key ingredient
of our algorithm is a novel rounding technique that we call multilevel ball-growing.
Though the proof of the duality relies on this algorithm, it is not a straightforward
corollary of it as in the case of classical multicommodity ows and cuts. Similar
results are shown also for the sparsest multiroute cut problem.'
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. Towards Duality of Multicommodity Multiroute Cuts
and Flows: Multilevel Ball-Growing. Theory of Computing Systems. 2013;(2):341-363.
doi:10.1007/s00224-013-9454-3'
apa: 'Kolman, P., & Scheideler, C. (2013). Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing. Theory of Computing Systems,
(2), 341–363. https://doi.org/10.1007/s00224-013-9454-3'
bibtex: '@article{Kolman_Scheideler_2013, title={Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing}, DOI={10.1007/s00224-013-9454-3},
number={2}, journal={Theory of Computing Systems}, publisher={Springer}, author={Kolman,
Petr and Scheideler, Christian}, year={2013}, pages={341–363} }'
chicago: 'Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing.” Theory of Computing Systems,
no. 2 (2013): 341–63. https://doi.org/10.1007/s00224-013-9454-3.'
ieee: 'P. Kolman and C. Scheideler, “Towards Duality of Multicommodity Multiroute
Cuts and Flows: Multilevel Ball-Growing,” Theory of Computing Systems,
no. 2, pp. 341–363, 2013.'
mla: 'Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing.” Theory of Computing Systems,
no. 2, Springer, 2013, pp. 341–63, doi:10.1007/s00224-013-9454-3.'
short: P. Kolman, C. Scheideler, Theory of Computing Systems (2013) 341–363.
date_created: 2017-10-17T12:42:24Z
date_updated: 2022-01-06T07:01:21Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/s00224-013-9454-3
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T14:07:18Z
date_updated: 2018-03-15T14:07:18Z
file_id: '1326'
file_name: 476-tocsrevised3b.pdf
file_size: 264308
relation: main_file
success: 1
file_date_updated: 2018-03-15T14:07:18Z
has_accepted_license: '1'
issue: '2'
page: 341-363
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Theory of Computing Systems
publisher: Springer
status: public
title: 'Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing'
type: journal_article
user_id: '477'
year: '2013'
...
---
_id: '513'
abstract:
- lang: eng
text: This paper initiates the study of self-adjusting networks (or distributed
data structures) whose topologies dynamically adapt to a communication pattern
$\sigma$. We present a fully decentralized self-adjusting solution called SplayNet.
A SplayNet is a distributed generalization of the classic splay tree concept.
It ensures short paths (which can be found using local-greedy routing) between
communication partners while minimizing topological rearrangements. We derive
an upper bound for the amortized communication cost of a SplayNet based on empirical
entropies of $\sigma$, and show that SplayNets have several interesting convergence
properties. For instance, SplayNets features a provable online optimality under
special requests scenarios. We also investigate the optimal static network and
prove different lower bounds for the average communication cost based on graph
cuts and on the empirical entropy of the communication pattern $\sigma$. From
these lower bounds it follows, e.g., that SplayNets are optimal in scenarios where
the requests follow a product distribution as well. Finally, this paper shows
that in contrast to the Minimum Linear Arrangement problem which is generally
NP-hard, the optimal static tree network can be computed in polynomial time for
any guest graph, despite the exponentially large graph family. We complement our
formal analysis with a small simulation study on a Facebook graph.
author:
- first_name: Chen
full_name: Avin, Chen
last_name: Avin
- first_name: Bernhard
full_name: Häupler, Bernhard
last_name: Häupler
- first_name: Zvi
full_name: Lotker, Zvi
last_name: Lotker
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Avin C, Häupler B, Lotker Z, Scheideler C, Schmid S. Locally Self-Adjusting
Tree Networks. In: Proceedings of the 27th IEEE International Parallel and
Distributed Processing Symposium (IPDPS). ; 2013:395-406. doi:10.1109/IPDPS.2013.40'
apa: Avin, C., Häupler, B., Lotker, Z., Scheideler, C., & Schmid, S. (2013).
Locally Self-Adjusting Tree Networks. In Proceedings of the 27th IEEE International
Parallel and Distributed Processing Symposium (IPDPS) (pp. 395–406). https://doi.org/10.1109/IPDPS.2013.40
bibtex: '@inproceedings{Avin_Häupler_Lotker_Scheideler_Schmid_2013, title={Locally
Self-Adjusting Tree Networks}, DOI={10.1109/IPDPS.2013.40},
booktitle={Proceedings of the 27th IEEE International Parallel and Distributed
Processing Symposium (IPDPS)}, author={Avin, Chen and Häupler, Bernhard and Lotker,
Zvi and Scheideler, Christian and Schmid, Stefan}, year={2013}, pages={395–406}
}'
chicago: Avin, Chen, Bernhard Häupler, Zvi Lotker, Christian Scheideler, and Stefan
Schmid. “Locally Self-Adjusting Tree Networks.” In Proceedings of the 27th
IEEE International Parallel and Distributed Processing Symposium (IPDPS),
395–406, 2013. https://doi.org/10.1109/IPDPS.2013.40.
ieee: C. Avin, B. Häupler, Z. Lotker, C. Scheideler, and S. Schmid, “Locally Self-Adjusting
Tree Networks,” in Proceedings of the 27th IEEE International Parallel and
Distributed Processing Symposium (IPDPS), 2013, pp. 395–406.
mla: Avin, Chen, et al. “Locally Self-Adjusting Tree Networks.” Proceedings of
the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS),
2013, pp. 395–406, doi:10.1109/IPDPS.2013.40.
short: 'C. Avin, B. Häupler, Z. Lotker, C. Scheideler, S. Schmid, in: Proceedings
of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS),
2013, pp. 395–406.'
date_created: 2017-10-17T12:42:32Z
date_updated: 2022-01-06T07:01:38Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/IPDPS.2013.40
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:45:15Z
date_updated: 2018-03-15T10:45:15Z
file_id: '1303'
file_name: 513-ipdps13_01.pdf
file_size: 518804
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:45:15Z
has_accepted_license: '1'
page: 395-406
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 27th IEEE International Parallel and Distributed Processing
Symposium (IPDPS)
status: public
title: Locally Self-Adjusting Tree Networks
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '519'
abstract:
- lang: eng
text: In this work we present the first scalable distributed information system,i.e.,
a system with low storage overhead, that is provably robust againstDenial-of-Service
(DoS) attacks by a current insider. We allow acurrent insider to have complete
knowledge about the information systemand to have the power to block any \epsilon-fraction
of its serversby a DoS-attack, where \epsilon can be chosen up to a constant.
The taskof the system is to serve any collection of lookup requests with at most
oneper non-blocked server in an efficient way despite this attack. Previously,scalable
solutions were only known for DoS-attacks of past insiders, where apast insider
only has complete knowledge about some past time pointt_0 of the information system.
Scheideler et al. (DISC 2007, SPAA 2009) showedthat in this case it is possible
to design an information system so that anyinformation that was inserted or last
updated after t_0 is safe against a DoS-attack. But their constructions would
not work at all for a current insider. The key idea behindour IRIS system is to
make extensive use of coding. More precisely, we presenttwo alternative distributed
coding strategies with an at most logarithmicstorage overhead that can handle
up to a constant fraction of blocked servers.
author:
- first_name: Martina
full_name: Eikel, Martina
last_name: Eikel
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Eikel M, Scheideler C. IRIS: A Robust Information System Against Insider DoS-Attacks.
In: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA). ; 2013:119-129. doi:10.1145/2486159.2486186'
apa: 'Eikel, M., & Scheideler, C. (2013). IRIS: A Robust Information System
Against Insider DoS-Attacks. In Proceedings of the 25th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA) (pp. 119–129). https://doi.org/10.1145/2486159.2486186'
bibtex: '@inproceedings{Eikel_Scheideler_2013, title={IRIS: A Robust Information
System Against Insider DoS-Attacks}, DOI={10.1145/2486159.2486186},
booktitle={Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Eikel, Martina and Scheideler, Christian},
year={2013}, pages={119–129} }'
chicago: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information
System Against Insider DoS-Attacks.” In Proceedings of the 25th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 119–29, 2013. https://doi.org/10.1145/2486159.2486186.'
ieee: 'M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider
DoS-Attacks,” in Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), 2013, pp. 119–129.'
mla: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System
Against Insider DoS-Attacks.” Proceedings of the 25th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 2013, pp. 119–29, doi:10.1145/2486159.2486186.'
short: 'M. Eikel, C. Scheideler, in: Proceedings of the 25th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 2013, pp. 119–129.'
date_created: 2017-10-17T12:42:33Z
date_updated: 2022-01-06T07:01:42Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/2486159.2486186
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:38:34Z
date_updated: 2018-03-15T10:38:34Z
file_id: '1299'
file_name: 519-iris-spaa2013_01.pdf
file_size: 554618
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:38:34Z
has_accepted_license: '1'
page: 119-129
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: 'IRIS: A Robust Information System Against Insider DoS-Attacks'
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '542'
abstract:
- lang: eng
text: 'We consider the problem of managing a dynamic heterogeneous storagesystem
in a distributed way so that the amount of data assigned to a hostin that system
is related to its capacity. Two central problems have to be solvedfor this: (1)
organizing the hosts in an overlay network with low degree and diameterso that
one can efficiently check the correct distribution of the data androute between
any two hosts, and (2) distributing the data among the hosts so thatthe distribution
respects the capacities of the hosts and can easily be adapted asthe set of hosts
or their capacities change. We present distributed protocols forthese problems
that are self-stabilizing and that do not need any global knowledgeabout the system
such as the number of nodes or the overall capacity of thesystem. Prior to this
work no solution was known satisfying these properties.'
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Koutsopoulos A, Scheideler C. CONE-DHT: A distributed self-stabilizing
algorithm for a heterogeneous storage system. In: Proceedings of the 27th International
Symposium on Distributed Computing (DISC). LNCS. ; 2013:537-549. doi:10.1007/978-3-642-41527-2_37'
apa: 'Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2013). CONE-DHT:
A distributed self-stabilizing algorithm for a heterogeneous storage system. In
Proceedings of the 27th International Symposium on Distributed Computing (DISC)
(pp. 537–549). https://doi.org/10.1007/978-3-642-41527-2_37'
bibtex: '@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2013, series={LNCS},
title={CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous
storage system}, DOI={10.1007/978-3-642-41527-2_37},
booktitle={Proceedings of the 27th International Symposium on Distributed Computing
(DISC)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler,
Christian}, year={2013}, pages={537–549}, collection={LNCS} }'
chicago: 'Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler.
“CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage
System.” In Proceedings of the 27th International Symposium on Distributed
Computing (DISC), 537–49. LNCS, 2013. https://doi.org/10.1007/978-3-642-41527-2_37.'
ieee: 'S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “CONE-DHT: A distributed
self-stabilizing algorithm for a heterogeneous storage system,” in Proceedings
of the 27th International Symposium on Distributed Computing (DISC), 2013,
pp. 537–549.'
mla: 'Kniesburges, Sebastian, et al. “CONE-DHT: A Distributed Self-Stabilizing Algorithm
for a Heterogeneous Storage System.” Proceedings of the 27th International
Symposium on Distributed Computing (DISC), 2013, pp. 537–49, doi:10.1007/978-3-642-41527-2_37.'
short: 'S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 27th
International Symposium on Distributed Computing (DISC), 2013, pp. 537–549.'
date_created: 2017-10-17T12:42:38Z
date_updated: 2022-01-06T07:01:53Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-41527-2_37
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:32:48Z
date_updated: 2018-03-15T10:32:48Z
file_id: '1289'
file_name: 542-CONE-DHT_A_distributed_self-stabilizing_algorithm_for_a_heterogeneous_storage_system.pdf
file_size: 262302
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:32:48Z
has_accepted_license: '1'
page: 537-549
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 27th International Symposium on Distributed Computing
(DISC)
series_title: LNCS
status: public
title: 'CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage
system'
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '564'
abstract:
- lang: eng
text: We consider the problem of resource discovery in distributed systems. In particular
we give an algorithm, such that each node in a network discovers the add ress
of any other node in the network. We model the knowledge of the nodes as a virtual
overlay network given by a directed graph such that complete knowledge of all
nodes corresponds to a complete graph in the overlay network. Although there are
several solutions for resource discovery, our solution is the first that achieves
worst-case optimal work for each node, i.e. the number of addresses (O(n)) or
bits (O(nlogn)) a node receives or sendscoincides with the lower bound, while
ensuring only a linearruntime (O(n)) on the number of rounds.
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Koutsopoulos A, Scheideler C. A Deterministic Worst-Case Message
Complexity Optimal Solution for Resource Discovery. In: Proceedings of 20th
International Colloqium on Structural Information and Communication Complexity
(SIROCCO). Lecture Notes in Computer Science. ; 2013:165-176. doi:10.1007/978-3-319-03578-9_14'
apa: Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2013). A Deterministic
Worst-Case Message Complexity Optimal Solution for Resource Discovery. In Proceedings
of 20th International Colloqium on Structural Information and Communication Complexity
(SIROCCO) (pp. 165–176). https://doi.org/10.1007/978-3-319-03578-9_14
bibtex: '@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2013, series={Lecture
Notes in Computer Science}, title={A Deterministic Worst-Case Message Complexity
Optimal Solution for Resource Discovery}, DOI={10.1007/978-3-319-03578-9_14},
booktitle={Proceedings of 20th International Colloqium on Structural Information
and Communication Complexity (SIROCCO)}, author={Kniesburges, Sebastian and Koutsopoulos,
Andreas and Scheideler, Christian}, year={2013}, pages={165–176}, collection={Lecture
Notes in Computer Science} }'
chicago: Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler.
“A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.”
In Proceedings of 20th International Colloqium on Structural Information and
Communication Complexity (SIROCCO), 165–76. Lecture Notes in Computer Science,
2013. https://doi.org/10.1007/978-3-319-03578-9_14.
ieee: S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A Deterministic Worst-Case
Message Complexity Optimal Solution for Resource Discovery,” in Proceedings
of 20th International Colloqium on Structural Information and Communication Complexity
(SIROCCO), 2013, pp. 165–176.
mla: Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity
Optimal Solution for Resource Discovery.” Proceedings of 20th International
Colloqium on Structural Information and Communication Complexity (SIROCCO),
2013, pp. 165–76, doi:10.1007/978-3-319-03578-9_14.
short: 'S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of 20th
International Colloqium on Structural Information and Communication Complexity
(SIROCCO), 2013, pp. 165–176.'
date_created: 2017-10-17T12:42:42Z
date_updated: 2022-01-06T07:02:17Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-03578-9_14
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:24:40Z
date_updated: 2018-03-15T10:24:40Z
file_id: '1277'
file_name: 564-SIROCCO13.pdf
file_size: 168884
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:24:40Z
has_accepted_license: '1'
page: 165-176
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of 20th International Colloqium on Structural Information
and Communication Complexity (SIROCCO)
series_title: Lecture Notes in Computer Science
status: public
title: A Deterministic Worst-Case Message Complexity Optimal Solution for Resource
Discovery
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '371'
abstract:
- lang: eng
text: In this work we present the first distributed storage system that is provably
robust against crash failures issued by an adaptive adversary, i.e., for each
batch of requests the adversary can decide based on the entire system state which
servers will be unavailable for that batch of requests. Despite up to \gamma n^{1/\log\log
n} crashed servers, with \gamma>0 constant and n denoting the number of servers,
our system can correctly process any batch of lookup and write requests (with
at most a polylogarithmic number of requests issued at each non-crashed server)
in at most a polylogarithmic number of communication rounds, with at most polylogarithmic
time and work at each server and only a logarithmic storage overhead. Our system
is based on previous work by Eikel and Scheideler (SPAA 2013), who presented IRIS,
a distributed information system that is provably robust against the same kind
of crash failures. However, IRIS is only able to serve lookup requests. Handling
both lookup and write requests has turned out to require major changes in the
design of IRIS.
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
- first_name: Martina
full_name: Eikel, Martina
last_name: Eikel
citation:
ama: 'Scheideler C, Setzer A, Eikel M. RoBuSt: A Crash-Failure-Resistant Distributed
Storage System. In: Proceedings of the 18th International Conference on Principles
of Distributed Systems (OPODIS). LNCS. ; 2014:107--122. doi:10.1007/978-3-319-14472-6_8'
apa: 'Scheideler, C., Setzer, A., & Eikel, M. (2014). RoBuSt: A Crash-Failure-Resistant
Distributed Storage System. In Proceedings of the 18th International Conference
on Principles of Distributed Systems (OPODIS) (pp. 107--122). https://doi.org/10.1007/978-3-319-14472-6_8'
bibtex: '@inproceedings{Scheideler_Setzer_Eikel_2014, series={LNCS}, title={RoBuSt:
A Crash-Failure-Resistant Distributed Storage System}, DOI={10.1007/978-3-319-14472-6_8},
booktitle={Proceedings of the 18th International Conference on Principles of Distributed
Systems (OPODIS)}, author={Scheideler, Christian and Setzer, Alexander and Eikel,
Martina}, year={2014}, pages={107--122}, collection={LNCS} }'
chicago: 'Scheideler, Christian, Alexander Setzer, and Martina Eikel. “RoBuSt: A
Crash-Failure-Resistant Distributed Storage System.” In Proceedings of the
18th International Conference on Principles of Distributed Systems (OPODIS),
107--122. LNCS, 2014. https://doi.org/10.1007/978-3-319-14472-6_8.'
ieee: 'C. Scheideler, A. Setzer, and M. Eikel, “RoBuSt: A Crash-Failure-Resistant
Distributed Storage System,” in Proceedings of the 18th International Conference
on Principles of Distributed Systems (OPODIS), 2014, pp. 107--122.'
mla: 'Scheideler, Christian, et al. “RoBuSt: A Crash-Failure-Resistant Distributed
Storage System.” Proceedings of the 18th International Conference on Principles
of Distributed Systems (OPODIS), 2014, pp. 107--122, doi:10.1007/978-3-319-14472-6_8.'
short: 'C. Scheideler, A. Setzer, M. Eikel, in: Proceedings of the 18th International
Conference on Principles of Distributed Systems (OPODIS), 2014, pp. 107--122.'
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:31Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-14472-6_8
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:16:32Z
date_updated: 2018-03-20T07:16:32Z
file_id: '1401'
file_name: 371-RoBuSt-OPODIS.pdf
file_size: 269941
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:16:32Z
has_accepted_license: '1'
page: 107--122
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 18th International Conference on Principles of Distributed
Systems (OPODIS)
series_title: LNCS
status: public
title: 'RoBuSt: A Crash-Failure-Resistant Distributed Storage System'
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '378'
abstract:
- lang: eng
text: The Chord peer-to-peer system is considered, together with CAN, Tapestry and
Pastry, as one of the pioneering works on peer-to-peer distributed hash tables
(DHT) that inspired a large volume of papers and projects on DHTs as well as peer-to-peer
systems in general. Chord, in particular, has been studied thoroughly, and many
variants of Chord have been presented that optimize various criteria. Also, several
implementations of Chord are available on various platforms. Though Chord is known
to be very efficient and scalable and it can handle churn quite well, no protocol
is known yet that guarantees that Chord is self-stabilizing, i.e., the Chord network
can be recovered from any initial state in which the network is still weakly connected.
This is not too surprising since it is known that the Chord network is not locally
checkable for its current topology. We present a slight extension of the Chord
network, called Re-Chord (reactive Chord), that turns out to be locally checkable,
and we present a self-stabilizing distributed protocol for it that can recover
the Re-Chord network from any initial state, in which the n peers are weakly connected,
in O(nlogn) communication rounds. We also show that our protocol allows a new
peer to join or an old peer to leave an already stable Re-Chord network so that
within O(logn)^2) communication rounds the Re-Chord network is stable again.
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Koutsopoulos A, Scheideler C. Re-Chord: A Self-stabilizing
Chord Overlay Network. Theory of Computing Systems. 2014;(3):591-612. doi:10.1007/s00224-012-9431-2'
apa: 'Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2014). Re-Chord:
A Self-stabilizing Chord Overlay Network. Theory of Computing Systems,
(3), 591–612. https://doi.org/10.1007/s00224-012-9431-2'
bibtex: '@article{Kniesburges_Koutsopoulos_Scheideler_2014, title={Re-Chord: A Self-stabilizing
Chord Overlay Network}, DOI={10.1007/s00224-012-9431-2},
number={3}, journal={Theory of Computing Systems}, publisher={Springer}, author={Kniesburges,
Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2014}, pages={591–612}
}'
chicago: 'Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler.
“Re-Chord: A Self-Stabilizing Chord Overlay Network.” Theory of Computing Systems,
no. 3 (2014): 591–612. https://doi.org/10.1007/s00224-012-9431-2.'
ieee: 'S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “Re-Chord: A Self-stabilizing
Chord Overlay Network,” Theory of Computing Systems, no. 3, pp. 591–612,
2014.'
mla: 'Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay
Network.” Theory of Computing Systems, no. 3, Springer, 2014, pp. 591–612,
doi:10.1007/s00224-012-9431-2.'
short: S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theory of Computing Systems
(2014) 591–612.
date_created: 2017-10-17T12:42:05Z
date_updated: 2022-01-06T06:59:35Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/s00224-012-9431-2
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:13:36Z
date_updated: 2018-03-20T07:13:36Z
file_id: '1396'
file_name: 378-re-chord_journal.pdf
file_size: 310961
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:13:36Z
has_accepted_license: '1'
issue: '3'
page: 591-612
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '2'
name: SFB 901 - Project Area A
publication: Theory of Computing Systems
publisher: Springer
status: public
title: 'Re-Chord: A Self-stabilizing Chord Overlay Network'
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '387'
abstract:
- lang: eng
text: This article studies the design of medium access control (MAC) protocols for
wireless networks that are provably robust against arbitrary and unpredictable
disruptions (e.g., due to unintentional external interference from co-existing
networks or due to jamming). We consider a wireless network consisting of a set
of n honest and reliable nodes within transmission (and interference) range of
each other, and we model the external disruptions with a powerful adaptive adversary.
This adversary may know the protocol and its entire history and can use this knowledge
to jam the wireless channel at will at any time. It is allowed to jam a (1 − )-fraction
of the timesteps, for an arbitrary constant > 0 unknown to the nodes. The nodes
cannot distinguish between the adversarial jamming or a collision of two or more
messages that are sent at the same time. We demonstrate, for the first time, that
there is a local-control MAC protocol requiring only very limited knowledge about
the adversary and the network that achieves a constant (asymptotically optimal)
throughput for the nonjammed time periods under any of the aforementioned adversarial
strategies. The derived principles are also useful to build robust applications
on top of the MAC layer, and we present an exemplary study for leader election,
one of the most fundamental tasks in distributed computing.
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: Awerbuch B, Richa AW, Scheideler C, Schmid S, Zhang J. Principles of Robust
Medium Access and an Application to Leader Election. Transactions on Algorithms.
2014;(4). doi:10.1145/2635818
apa: Awerbuch, B., Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2014).
Principles of Robust Medium Access and an Application to Leader Election. Transactions
on Algorithms, (4). https://doi.org/10.1145/2635818
bibtex: '@article{Awerbuch_Richa_Scheideler_Schmid_Zhang_2014, title={Principles
of Robust Medium Access and an Application to Leader Election}, DOI={10.1145/2635818},
number={4}, journal={Transactions on Algorithms}, publisher={ACM}, author={Awerbuch,
Baruch and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang,
Jin}, year={2014} }'
chicago: Awerbuch, Baruch, Andrea W. Richa, Christian Scheideler, Stefan Schmid,
and Jin Zhang. “Principles of Robust Medium Access and an Application to Leader
Election.” Transactions on Algorithms, no. 4 (2014). https://doi.org/10.1145/2635818.
ieee: B. Awerbuch, A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Principles
of Robust Medium Access and an Application to Leader Election,” Transactions
on Algorithms, no. 4, 2014.
mla: Awerbuch, Baruch, et al. “Principles of Robust Medium Access and an Application
to Leader Election.” Transactions on Algorithms, no. 4, ACM, 2014, doi:10.1145/2635818.
short: B. Awerbuch, A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, Transactions
on Algorithms (2014).
date_created: 2017-10-17T12:42:07Z
date_updated: 2022-01-06T06:59:47Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/2635818
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:02:33Z
date_updated: 2018-03-20T07:02:33Z
file_id: '1388'
file_name: 387-a24-awerbuch_2_.pdf
file_size: 521454
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:02:33Z
has_accepted_license: '1'
issue: '4'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Transactions on Algorithms
publisher: ACM
status: public
title: Principles of Robust Medium Access and an Application to Leader Election
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '1858'
author:
- first_name: Riko
full_name: Jacob, Riko
last_name: Jacob
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Hanjo
full_name: Täubig, Hanjo
last_name: Täubig
citation:
ama: 'Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. SKIP*: A Self-Stabilizing
Skip Graph. J ACM. 2014;(6):36:1--36:26. doi:10.1145/2629695'
apa: 'Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., & Täubig, H. (2014).
SKIP*: A Self-Stabilizing Skip Graph. J. ACM, (6), 36:1--36:26. https://doi.org/10.1145/2629695'
bibtex: '@article{Jacob_W. Richa_Scheideler_Schmid_Täubig_2014, title={SKIP*: A
Self-Stabilizing Skip Graph}, DOI={10.1145/2629695},
number={6}, journal={J. ACM}, author={Jacob, Riko and W. Richa, Andrea and Scheideler,
Christian and Schmid, Stefan and Täubig, Hanjo}, year={2014}, pages={36:1--36:26}
}'
chicago: 'Jacob, Riko, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and
Hanjo Täubig. “SKIP*: A Self-Stabilizing Skip Graph.” J. ACM, no. 6 (2014):
36:1--36:26. https://doi.org/10.1145/2629695.'
ieee: 'R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “SKIP*: A
Self-Stabilizing Skip Graph,” J. ACM, no. 6, pp. 36:1--36:26, 2014.'
mla: 'Jacob, Riko, et al. “SKIP*: A Self-Stabilizing Skip Graph.” J. ACM,
no. 6, 2014, pp. 36:1--36:26, doi:10.1145/2629695.'
short: R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, J. ACM (2014)
36:1--36:26.
date_created: 2018-03-28T06:17:25Z
date_updated: 2022-01-06T06:53:40Z
department:
- _id: '79'
doi: 10.1145/2629695
issue: '6'
page: 36:1--36:26
publication: J. ACM
status: public
title: 'SKIP*: A Self-Stabilizing Skip Graph'
type: journal_article
user_id: '15504'
year: '2014'
...
---
_id: '1863'
author:
- first_name: Zahra
full_name: Derakhshandeh, Zahra
last_name: Derakhshandeh
- first_name: Shlomi
full_name: Dolev, Shlomi
last_name: Dolev
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Derakhshandeh Z, Dolev S, Gmyr R, W. Richa A, Scheideler C, Strothmann TF.
Brief announcement: amoebot - a new model for programmable matter. In: 26th
ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague,
Czech Republic - June 23 - 25, 2014. ACM; 2014:220--222. doi:10.1145/2612669.2612712'
apa: 'Derakhshandeh, Z., Dolev, S., Gmyr, R., W. Richa, A., Scheideler, C., &
Strothmann, T. F. (2014). Brief announcement: amoebot - a new model for programmable
matter. In 26th ACM Symposium on Parallelism in Algorithms and Architectures,
SPAA’14, Prague, Czech Republic - June 23 - 25, 2014 (pp. 220--222). ACM.
https://doi.org/10.1145/2612669.2612712'
bibtex: '@inproceedings{Derakhshandeh_Dolev_Gmyr_W. Richa_Scheideler_Strothmann_2014,
title={Brief announcement: amoebot - a new model for programmable matter}, DOI={10.1145/2612669.2612712}, booktitle={26th
ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague,
Czech Republic - June 23 - 25, 2014}, publisher={ACM}, author={Derakhshandeh,
Zahra and Dolev, Shlomi and Gmyr, Robert and W. Richa, Andrea and Scheideler,
Christian and Strothmann, Thim Frederik}, year={2014}, pages={220--222} }'
chicago: 'Derakhshandeh, Zahra, Shlomi Dolev, Robert Gmyr, Andrea W. Richa, Christian
Scheideler, and Thim Frederik Strothmann. “Brief Announcement: Amoebot - a New
Model for Programmable Matter.” In 26th ACM Symposium on Parallelism in Algorithms
and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014, 220--222.
ACM, 2014. https://doi.org/10.1145/2612669.2612712.'
ieee: 'Z. Derakhshandeh, S. Dolev, R. Gmyr, A. W. Richa, C. Scheideler, and T. F.
Strothmann, “Brief announcement: amoebot - a new model for programmable matter,”
in 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14,
Prague, Czech Republic - June 23 - 25, 2014, 2014, pp. 220--222.'
mla: 'Derakhshandeh, Zahra, et al. “Brief Announcement: Amoebot - a New Model for
Programmable Matter.” 26th ACM Symposium on Parallelism in Algorithms and Architectures,
SPAA’14, Prague, Czech Republic - June 23 - 25, 2014, ACM, 2014, pp. 220--222,
doi:10.1145/2612669.2612712.'
short: 'Z. Derakhshandeh, S. Dolev, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann,
in: 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14,
Prague, Czech Republic - June 23 - 25, 2014, ACM, 2014, pp. 220--222.'
date_created: 2018-03-28T06:24:00Z
date_updated: 2022-01-06T06:53:47Z
department:
- _id: '79'
doi: 10.1145/2612669.2612712
language:
- iso: eng
page: 220--222
publication: 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'14,
Prague, Czech Republic - June 23 - 25, 2014
publication_identifier:
isbn:
- 978-1-4503-2821-0
publisher: ACM
status: public
title: 'Brief announcement: amoebot - a new model for programmable matter'
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '446'
abstract:
- lang: eng
text: 'This paper considers the problem of how to efficiently share a wireless medium
which is subject to harsh external interference or even jamming. While this problem
has already been studied intensively for simplistic single-hop or unit disk graph
models, we make a leap forward and study MAC protocols for the SINR interference
model (a.k.a. the physical model). We make two contributions. First, we introduce
a new adversarial SINR model which captures a wide range of interference phenomena.
Concretely, we consider a powerful, adaptive adversary which can jam nodes at
arbitrary times and which is only limited by some energy budget. The second contribution
of this paper is a distributed MAC protocol which provably achieves a constant
competitive throughput in this environment: we show that, with high probability,
the protocol ensures that a constant fraction of the non-blocked time periods
is used for successful transmissions.'
author:
- first_name: Adrian
full_name: Ogierman, Adrian
last_name: Ogierman
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: 'Ogierman A, Richa AW, Scheideler C, Schmid S, Zhang J. Competitive MAC under
adversarial SINR. In: Proceedings of the 33rd Annual IEEE International Conference
on Computer Communications (INFOCOM). ; 2014:2751--2759. doi:10.1109/INFOCOM.2014.6848224'
apa: Ogierman, A., Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2014).
Competitive MAC under adversarial SINR. In Proceedings of the 33rd Annual IEEE
International Conference on Computer Communications (INFOCOM) (pp. 2751--2759).
https://doi.org/10.1109/INFOCOM.2014.6848224
bibtex: '@inproceedings{Ogierman_Richa_Scheideler_Schmid_Zhang_2014, title={Competitive
MAC under adversarial SINR}, DOI={10.1109/INFOCOM.2014.6848224},
booktitle={Proceedings of the 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM)}, author={Ogierman, Adrian and Richa, Andrea W. and Scheideler,
Christian and Schmid, Stefan and Zhang, Jin}, year={2014}, pages={2751--2759}
}'
chicago: Ogierman, Adrian, Andrea W. Richa, Christian Scheideler, Stefan Schmid,
and Jin Zhang. “Competitive MAC under Adversarial SINR.” In Proceedings of
the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM),
2751--2759, 2014. https://doi.org/10.1109/INFOCOM.2014.6848224.
ieee: A. Ogierman, A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive
MAC under adversarial SINR,” in Proceedings of the 33rd Annual IEEE International
Conference on Computer Communications (INFOCOM), 2014, pp. 2751--2759.
mla: Ogierman, Adrian, et al. “Competitive MAC under Adversarial SINR.” Proceedings
of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM),
2014, pp. 2751--2759, doi:10.1109/INFOCOM.2014.6848224.
short: 'A. Ogierman, A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings
of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM),
2014, pp. 2751--2759.'
date_created: 2017-10-17T12:42:18Z
date_updated: 2022-01-06T07:01:05Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/INFOCOM.2014.6848224
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:27:04Z
date_updated: 2018-03-16T11:27:04Z
file_id: '1348'
file_name: 446-infocom14_01.pdf
file_size: 378095
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:27:04Z
has_accepted_license: '1'
page: 2751--2759
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM)
status: public
title: Competitive MAC under adversarial SINR
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '459'
abstract:
- lang: eng
text: In this survey article, we discuss two algorithmic research areas that emerge
from problems that arise when resources are offered in the cloud. The first area,
online leasing, captures problems arising from the fact that resources in the
cloud are not bought, but leased by cloud vendors. The second area, Distributed
Storage Systems, deals with problems arising from so-called cloud federations,
i.e., when several cloud providers are needed to fulfill a given task.
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- 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: 'Kniesburges S, Markarian C, Meyer auf der Heide F, Scheideler C. Algorithmic
Aspects of Resource Management in the Cloud. In: Proceedings of the 21st International
Colloquium on Structural Information and Communication Complexity (SIROCCO).
LNCS. ; 2014:1-13. doi:10.1007/978-3-319-09620-9_1'
apa: Kniesburges, S., Markarian, C., Meyer auf der Heide, F., & Scheideler,
C. (2014). Algorithmic Aspects of Resource Management in the Cloud. In Proceedings
of the 21st International Colloquium on Structural Information and Communication
Complexity (SIROCCO) (pp. 1–13). https://doi.org/10.1007/978-3-319-09620-9_1
bibtex: '@inproceedings{Kniesburges_Markarian_Meyer auf der Heide_Scheideler_2014,
series={LNCS}, title={Algorithmic Aspects of Resource Management in the Cloud},
DOI={10.1007/978-3-319-09620-9_1},
booktitle={Proceedings of the 21st International Colloquium on Structural Information
and Communication Complexity (SIROCCO)}, author={Kniesburges, Sebastian and Markarian,
Christine and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2014},
pages={1–13}, collection={LNCS} }'
chicago: Kniesburges, Sebastian, Christine Markarian, Friedhelm Meyer auf der Heide,
and Christian Scheideler. “Algorithmic Aspects of Resource Management in the Cloud.”
In Proceedings of the 21st International Colloquium on Structural Information
and Communication Complexity (SIROCCO), 1–13. LNCS, 2014. https://doi.org/10.1007/978-3-319-09620-9_1.
ieee: S. Kniesburges, C. Markarian, F. Meyer auf der Heide, and C. Scheideler, “Algorithmic
Aspects of Resource Management in the Cloud,” in Proceedings of the 21st International
Colloquium on Structural Information and Communication Complexity (SIROCCO),
2014, pp. 1–13.
mla: Kniesburges, Sebastian, et al. “Algorithmic Aspects of Resource Management
in the Cloud.” Proceedings of the 21st International Colloquium on Structural
Information and Communication Complexity (SIROCCO), 2014, pp. 1–13, doi:10.1007/978-3-319-09620-9_1.
short: 'S. Kniesburges, C. Markarian, F. Meyer auf der Heide, C. Scheideler, in:
Proceedings of the 21st International Colloquium on Structural Information and
Communication Complexity (SIROCCO), 2014, pp. 1–13.'
date_created: 2017-10-17T12:42:21Z
date_updated: 2022-01-06T07:01:14Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1007/978-3-319-09620-9_1
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:21:54Z
date_updated: 2018-03-16T11:21:54Z
file_id: '1338'
file_name: 459-SIROCCO2014.pdf
file_size: 274496
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:21:54Z
has_accepted_license: '1'
page: 1-13
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 21st International Colloquium on Structural Information
and Communication Complexity (SIROCCO)
series_title: LNCS
status: public
title: Algorithmic Aspects of Resource Management in the Cloud
type: conference
user_id: '477'
year: '2014'
...
---
_id: '464'
abstract:
- lang: eng
text: Topological self-stabilization is an important concept to build robust open
distributed systems (such as peer-to-peer systems) where nodes can organize themselves
into meaningful network topologies. The goal is to devise distributed algorithms
where nodes forward, insert, and delete links to neighboring nodes, and that converge
quickly to such a desirable topology, independently of the initial network configuration.
This article proposes a new model to study the parallel convergence time. Our
model sheds light on the achievable parallelism by avoiding bottlenecks of existing
models that can yield a distorted picture. As a case study, we consider local
graph linearization—i.e., how to build a sorted list of the nodes of a connected
graph in a distributed and self-stabilizing manner. In order to study the main
structure and properties of our model, we propose two variants of a most simple
local linearization algorithm. For each of these variants, we present analyses
of the worst-case and bestcase parallel time complexities, as well as the performance
under a greedy selection of the actions to be executed. It turns out that the
analysis is non-trivial despite the simple setting, and to complement our formal
insights we report on our experiments which indicate that the runtimes may be
better in the average case.
author:
- first_name: Dominik
full_name: Gall, Dominik
last_name: Gall
- first_name: Riko
full_name: Jacob, Riko
last_name: Jacob
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: 'Hanjo '
full_name: 'Täubig, Hanjo '
last_name: Täubig
citation:
ama: Gall D, Jacob R, Richa AW, Scheideler C, Schmid S, Täubig H. A Note on the
Parallel Runtime of Self-Stabilizing Graph Linearization. Theory of Computing
Systems. 2014;(1):110-135. doi:10.1007/s00224-013-9504-x
apa: Gall, D., Jacob, R., Richa, A. W., Scheideler, C., Schmid, S., & Täubig,
H. (2014). A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.
Theory of Computing Systems, (1), 110–135. https://doi.org/10.1007/s00224-013-9504-x
bibtex: '@article{Gall_Jacob_Richa_Scheideler_Schmid_Täubig_2014, title={A Note
on the Parallel Runtime of Self-Stabilizing Graph Linearization}, DOI={10.1007/s00224-013-9504-x},
number={1}, journal={Theory of Computing Systems}, publisher={Springer}, author={Gall,
Dominik and Jacob, Riko and Richa, Andrea W. and Scheideler, Christian and Schmid,
Stefan and Täubig, Hanjo }, year={2014}, pages={110–135} }'
chicago: 'Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan
Schmid, and Hanjo Täubig. “A Note on the Parallel Runtime of Self-Stabilizing
Graph Linearization.” Theory of Computing Systems, no. 1 (2014): 110–35.
https://doi.org/10.1007/s00224-013-9504-x.'
ieee: D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “A
Note on the Parallel Runtime of Self-Stabilizing Graph Linearization,” Theory
of Computing Systems, no. 1, pp. 110–135, 2014.
mla: Gall, Dominik, et al. “A Note on the Parallel Runtime of Self-Stabilizing Graph
Linearization.” Theory of Computing Systems, no. 1, Springer, 2014, pp.
110–35, doi:10.1007/s00224-013-9504-x.
short: D. Gall, R. Jacob, A.W. Richa, C. Scheideler, S. Schmid, H. Täubig, Theory
of Computing Systems (2014) 110–135.
date_created: 2017-10-17T12:42:22Z
date_updated: 2022-01-06T07:01:16Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/s00224-013-9504-x
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:19:45Z
date_updated: 2018-03-16T11:19:45Z
file_id: '1334'
file_name: 464-GJRSST2014.pdf
file_size: 947484
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:19:45Z
has_accepted_license: '1'
issue: '1'
page: 110-135
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Theory of Computing Systems
publisher: Springer
status: public
title: A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '393'
abstract:
- lang: eng
text: 'A fundamental problem for peer-to-peer systems is to maintain connectivity
while nodes are leaving, i.e., the nodes requesting to leave the peer-to-peer
system are excluded from the overlay network without affecting its connectivity.
There are a number of studies for safe node exclusion if the overlay is in a well-defined
state initially. Surprisingly, the problem is not formally studied yet for the
case in which the overlay network is in an arbitrary initial state, i.e., when
looking for a self-stabilizing solution for excluding leaving nodes. We study
this problem in two variants: the Finite Departure Problem (FDP) ) and the Finite
Sleep Problem (FSP). In the FDP the leaving nodes have to irrevocably decide when
it is safe to leave the network, whereas in the FSP, this leaving decision does
not have to be final: the nodes may resume computation if necessary. We show that
there is no self-stabilizing distributed algorithm for the FDP, even in a synchronous
message passing model. To allow a solution, we introduce an oracle called NIDEC
and show that it is sufficient even for the asynchronous message passing model
by proposing an algorithm that can solve the FDP using NIDEC. We also show that
a solution to the FSP does not require an oracle.'
author:
- first_name: Dianne
full_name: Foreback, Dianne
last_name: Foreback
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Mikhail
full_name: Nesterenko, Mikhail
last_name: Nesterenko
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Foreback D, Koutsopoulos A, Nesterenko M, Scheideler C, Strothmann TF. On
Stabilizing Departures in Overlay Networks. In: Proceedings of the 16th International
Symposium on Stabilization, Safety, and Security of Distributed Systems. LNCS.
; 2014:48--62. doi:10.1007/978-3-319-11764-5_4'
apa: Foreback, D., Koutsopoulos, A., Nesterenko, M., Scheideler, C., & Strothmann,
T. F. (2014). On Stabilizing Departures in Overlay Networks. In Proceedings
of the 16th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (pp. 48--62). https://doi.org/10.1007/978-3-319-11764-5_4
bibtex: '@inproceedings{Foreback_Koutsopoulos_Nesterenko_Scheideler_Strothmann_2014,
series={LNCS}, title={On Stabilizing Departures in Overlay Networks}, DOI={10.1007/978-3-319-11764-5_4},
booktitle={Proceedings of the 16th International Symposium on Stabilization, Safety,
and Security of Distributed Systems}, author={Foreback, Dianne and Koutsopoulos,
Andreas and Nesterenko, Mikhail and Scheideler, Christian and Strothmann, Thim
Frederik}, year={2014}, pages={48--62}, collection={LNCS} }'
chicago: Foreback, Dianne, Andreas Koutsopoulos, Mikhail Nesterenko, Christian Scheideler,
and Thim Frederik Strothmann. “On Stabilizing Departures in Overlay Networks.”
In Proceedings of the 16th International Symposium on Stabilization, Safety,
and Security of Distributed Systems, 48--62. LNCS, 2014. https://doi.org/10.1007/978-3-319-11764-5_4.
ieee: D. Foreback, A. Koutsopoulos, M. Nesterenko, C. Scheideler, and T. F. Strothmann,
“On Stabilizing Departures in Overlay Networks,” in Proceedings of the 16th
International Symposium on Stabilization, Safety, and Security of Distributed
Systems, 2014, pp. 48--62.
mla: Foreback, Dianne, et al. “On Stabilizing Departures in Overlay Networks.” Proceedings
of the 16th International Symposium on Stabilization, Safety, and Security of
Distributed Systems, 2014, pp. 48--62, doi:10.1007/978-3-319-11764-5_4.
short: 'D. Foreback, A. Koutsopoulos, M. Nesterenko, C. Scheideler, T.F. Strothmann,
in: Proceedings of the 16th International Symposium on Stabilization, Safety,
and Security of Distributed Systems, 2014, pp. 48--62.'
date_created: 2017-10-17T12:42:08Z
date_updated: 2022-01-06T06:59:56Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-11764-5_4
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:00:28Z
date_updated: 2018-03-20T07:00:28Z
file_id: '1384'
file_name: 393-departures.pdf
file_size: 287539
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:00:28Z
has_accepted_license: '1'
language:
- iso: eng
page: 48--62
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 16th International Symposium on Stabilization, Safety,
and Security of Distributed Systems
series_title: LNCS
status: public
title: On Stabilizing Departures in Overlay Networks
type: conference
user_id: '477'
year: '2014'
...
---
_id: '397'
abstract:
- lang: eng
text: We present a factor $14D^2$ approximation algorithm for the minimum linear
arrangement problem on series-parallel graphs, where $D$ is the maximum degree
in the graph. Given a suitable decomposition of the graph, our algorithm runs
in time $O(|E|)$ and is very easy to implement. Its divide-and-conquer approach
allows for an effective parallelization. Note that a suitable decomposition can
also be computed in time $O(|E|\log{|E|})$ (or even $O(\log{|E|}\log^*{|E|})$
on an EREW PRAM using $O(|E|)$ processors). For the proof of the approximation
ratio, we use a sophisticated charging method that uses techniques similar to
amortized analysis in advanced data structures. On general graphs, the minimum
linear arrangement problem is known to be NP-hard. To the best of our knowledge,
the minimum linear arrangement problem on series-parallel graphs has not been
studied before.
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Martina
full_name: Eikel, Martina
last_name: Eikel
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: 'Scheideler C, Eikel M, Setzer A. Minimum Linear Arrangement of Series-Parallel
Graphs. In: Proceedings of the 12th Workshop on Approximation and Online Algorithms
(WAOA). LNCS. ; 2014:168--180.'
apa: Scheideler, C., Eikel, M., & Setzer, A. (2014). Minimum Linear Arrangement
of Series-Parallel Graphs. In Proceedings of the 12th Workshop on Approximation
and Online Algorithms (WAOA) (pp. 168--180).
bibtex: '@inproceedings{Scheideler_Eikel_Setzer_2014, series={LNCS}, title={Minimum
Linear Arrangement of Series-Parallel Graphs}, booktitle={Proceedings of the 12th
Workshop on Approximation and Online Algorithms (WAOA)}, author={Scheideler, Christian
and Eikel, Martina and Setzer, Alexander}, year={2014}, pages={168--180}, collection={LNCS}
}'
chicago: Scheideler, Christian, Martina Eikel, and Alexander Setzer. “Minimum Linear
Arrangement of Series-Parallel Graphs.” In Proceedings of the 12th Workshop
on Approximation and Online Algorithms (WAOA), 168--180. LNCS, 2014.
ieee: C. Scheideler, M. Eikel, and A. Setzer, “Minimum Linear Arrangement of Series-Parallel
Graphs,” in Proceedings of the 12th Workshop on Approximation and Online Algorithms
(WAOA), 2014, pp. 168--180.
mla: Scheideler, Christian, et al. “Minimum Linear Arrangement of Series-Parallel
Graphs.” Proceedings of the 12th Workshop on Approximation and Online Algorithms
(WAOA), 2014, pp. 168--180.
short: 'C. Scheideler, M. Eikel, A. Setzer, in: Proceedings of the 12th Workshop
on Approximation and Online Algorithms (WAOA), 2014, pp. 168--180.'
date_created: 2017-10-17T12:42:09Z
date_updated: 2022-01-06T07:00:02Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T06:58:44Z
date_updated: 2018-03-20T06:58:44Z
file_id: '1381'
file_name: 397-WAOA14_01.pdf
file_size: 365818
relation: main_file
success: 1
file_date_updated: 2018-03-20T06:58:44Z
has_accepted_license: '1'
page: 168--180
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 12th Workshop on Approximation and Online Algorithms
(WAOA)
series_title: LNCS
status: public
title: Minimum Linear Arrangement of Series-Parallel Graphs
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '412'
abstract:
- lang: eng
text: In this paper we present and analyze HSkip+, a self-stabilizing overlay network
for nodes with arbitrary heterogeneous bandwidths. HSkip+ has the same topology
as the Skip+ graph proposed by Jacob et al. [PODC 2009] but its self-stabilization
mechanism significantly outperforms the self-stabilization mechanism proposed
for Skip+. Also, the nodes are now ordered according to their bandwidths and not
according to their identifiers. Various other solutions have already been proposed
for overlay networks with heterogeneous bandwidths, but they are not self-stabilizing.
In addition to HSkip+ being self-stabilizing, its performance is on par with the
best previous bounds on the time and work for joining or leaving a network of
peers of logarithmic diameter and degree and arbitrary bandwidths. Also, the dilation
and congestion for routing messages is on par with the best previous bounds for
such networks, so that HSkip+ combines the advantages of both worlds. Our theoretical
investigations are backed by simulations demonstrating that HSkip+ is indeed performing
much better than Skip+ and working correctly under high churn rates.
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
citation:
ama: 'Feldotto M, Scheideler C, Graffi K. HSkip+: A Self-Stabilizing Overlay Network
for Nodes with Heterogeneous Bandwidths. In: Proceedings of the 14th IEEE International
Conference on Peer-to-Peer Computing (P2P). ; 2014:1-10. doi:10.1109/P2P.2014.6934300'
apa: 'Feldotto, M., Scheideler, C., & Graffi, K. (2014). HSkip+: A Self-Stabilizing
Overlay Network for Nodes with Heterogeneous Bandwidths. In Proceedings of
the 14th IEEE International Conference on Peer-to-Peer Computing (P2P) (pp.
1–10). https://doi.org/10.1109/P2P.2014.6934300'
bibtex: '@inproceedings{Feldotto_Scheideler_Graffi_2014, title={HSkip+: A Self-Stabilizing
Overlay Network for Nodes with Heterogeneous Bandwidths}, DOI={10.1109/P2P.2014.6934300},
booktitle={Proceedings of the 14th IEEE International Conference on Peer-to-Peer
Computing (P2P)}, author={Feldotto, Matthias and Scheideler, Christian and Graffi,
Kalman}, year={2014}, pages={1–10} }'
chicago: 'Feldotto, Matthias, Christian Scheideler, and Kalman Graffi. “HSkip+:
A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.” In
Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing
(P2P), 1–10, 2014. https://doi.org/10.1109/P2P.2014.6934300.'
ieee: 'M. Feldotto, C. Scheideler, and K. Graffi, “HSkip+: A Self-Stabilizing Overlay
Network for Nodes with Heterogeneous Bandwidths,” in Proceedings of the 14th
IEEE International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10.'
mla: 'Feldotto, Matthias, et al. “HSkip+: A Self-Stabilizing Overlay Network for
Nodes with Heterogeneous Bandwidths.” Proceedings of the 14th IEEE International
Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10, doi:10.1109/P2P.2014.6934300.'
short: 'M. Feldotto, C. Scheideler, K. Graffi, in: Proceedings of the 14th IEEE
International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10.'
date_created: 2017-10-17T12:42:12Z
date_updated: 2022-01-06T07:00:20Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
- _id: '541'
doi: 10.1109/P2P.2014.6934300
external_id:
arxiv:
- '1408.0395'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:34:00Z
date_updated: 2018-03-16T11:34:00Z
file_id: '1361'
file_name: 412-FSG2014P2P.pdf
file_size: 472321
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:34:00Z
has_accepted_license: '1'
page: 1-10
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 14th IEEE International Conference on Peer-to-Peer
Computing (P2P)
status: public
title: 'HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths'
type: conference
user_id: '14052'
year: '2014'
...
---
_id: '284'
abstract:
- lang: eng
text: In this work, we present the first scalable distributed information system,
that is, a system with low storage overhead, that is provably robust against denial-of-service
(DoS) attacks by a current insider. We allow a current insider to have complete
knowledge about the information system and to have the power to block any ϵ-fraction
of its servers by a DoS attack, where ϵ can be chosen up to a constant. The task
of the system is to serve any collection of lookup requests with at most one per
nonblocked server in an efficient way despite this attack. Previously, scalable
solutions were only known for DoS attacks of past insiders, where a past insider
only has complete knowledge about some past time point t0 of the information system.
Scheideler et al. [Awerbuch and Scheideler 2007; Baumgart et al. 2009] showed
that in this case, it is possible to design an information system so that any
information that was inserted or last updated after t0 is safe against a DoS attack.
But their constructions would not work at all for a current insider. The key idea
behind our IRIS system is to make extensive use of coding. More precisely, we
present two alternative distributed coding strategies with an at most logarithmic
storage overhead that can handle up to a constant fraction of blocked servers.
author:
- first_name: Martina
full_name: Eikel, Martina
last_name: Eikel
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Eikel M, Scheideler C. IRIS: A Robust Information System Against Insider DoS
Attacks. Transactions on Parallel Computing. 2015;(3):18:1--18:33. doi:10.1145/2809806'
apa: 'Eikel, M., & Scheideler, C. (2015). IRIS: A Robust Information System
Against Insider DoS Attacks. Transactions on Parallel Computing, (3), 18:1--18:33.
https://doi.org/10.1145/2809806'
bibtex: '@article{Eikel_Scheideler_2015, title={IRIS: A Robust Information System
Against Insider DoS Attacks}, DOI={10.1145/2809806},
number={3}, journal={Transactions on Parallel Computing}, publisher={ACM}, author={Eikel,
Martina and Scheideler, Christian}, year={2015}, pages={18:1--18:33} }'
chicago: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information
System Against Insider DoS Attacks.” Transactions on Parallel Computing,
no. 3 (2015): 18:1--18:33. https://doi.org/10.1145/2809806.'
ieee: 'M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider
DoS Attacks,” Transactions on Parallel Computing, no. 3, pp. 18:1--18:33,
2015.'
mla: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System
Against Insider DoS Attacks.” Transactions on Parallel Computing, no. 3,
ACM, 2015, pp. 18:1--18:33, doi:10.1145/2809806.'
short: M. Eikel, C. Scheideler, Transactions on Parallel Computing (2015) 18:1--18:33.
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:58:03Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/2809806
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:25:04Z
date_updated: 2018-03-21T09:25:04Z
file_id: '1468'
file_name: 284-Eikel-Scheideler-ACM2015.pdf
file_size: 651726
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:25:04Z
has_accepted_license: '1'
issue: '3'
page: 18:1--18:33
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Transactions on Parallel Computing
publisher: ACM
status: public
title: 'IRIS: A Robust Information System Against Insider DoS Attacks'
type: journal_article
user_id: '477'
year: '2015'
...
---
_id: '241'
abstract:
- lang: eng
text: Distributed applications are commonly based on overlay networks interconnecting
their sites so that they can exchange information. For these overlay networks
to preserve their functionality, they should be able to recover from various problems
like membership changes or faults. Various self-stabilizing overlay networks have
already been proposed in recent years, which have the advantage of being able
to recover from any illegal state, but none of these networks can give any guarantees
on its functionality while the recovery process is going on. We initiate research
on overlay networks that are not only self-stabilizing but that also ensure that
searchability is maintained while the recovery process is going on, as long as
there are no corrupted messages in the system. More precisely, once a search message
from node u to another node v is successfully delivered, all future search messages
from u to v succeed as well. We call this property monotonic searchability. We
show that in general it is impossible to provide monotonic searchability if corrupted
messages are present in the system, which justifies the restriction to system
states without corrupted messages. Furthermore, we provide a self-stabilizing
protocol for the line for which we can also show monotonic searchability. It turns
out that even for the line it is non-trivial to achieve this property. Additionally,
we extend our protocol to deal with node departures in terms of the Finite Departure
Problem of Foreback et. al (SSS 2014). This makes our protocol even capable of
handling node dynamics.
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Scheideler C, Setzer A, Strothmann TF. Towards Establishing Monotonic Searchability
in Self-Stabilizing Data Structures. In: Proceedings of the 19th International
Conference on Principles of Distributed Systems (OPODIS). Leibniz International
Proceedings in Informatics (LIPIcs). ; 2015. doi:10.4230/LIPIcs.OPODIS.2015.24'
apa: Scheideler, C., Setzer, A., & Strothmann, T. F. (2015). Towards Establishing
Monotonic Searchability in Self-Stabilizing Data Structures. In Proceedings
of the 19th International Conference on Principles of Distributed Systems (OPODIS).
https://doi.org/10.4230/LIPIcs.OPODIS.2015.24
bibtex: '@inproceedings{Scheideler_Setzer_Strothmann_2015, series={Leibniz International
Proceedings in Informatics (LIPIcs)}, title={Towards Establishing Monotonic Searchability
in Self-Stabilizing Data Structures}, DOI={10.4230/LIPIcs.OPODIS.2015.24},
booktitle={Proceedings of the 19th International Conference on Principles of Distributed
Systems (OPODIS)}, author={Scheideler, Christian and Setzer, Alexander and Strothmann,
Thim Frederik}, year={2015}, collection={Leibniz International Proceedings in
Informatics (LIPIcs)} }'
chicago: Scheideler, Christian, Alexander Setzer, and Thim Frederik Strothmann.
“Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures.”
In Proceedings of the 19th International Conference on Principles of Distributed
Systems (OPODIS). Leibniz International Proceedings in Informatics (LIPIcs),
2015. https://doi.org/10.4230/LIPIcs.OPODIS.2015.24.
ieee: C. Scheideler, A. Setzer, and T. F. Strothmann, “Towards Establishing Monotonic
Searchability in Self-Stabilizing Data Structures,” in Proceedings of the 19th
International Conference on Principles of Distributed Systems (OPODIS), 2015.
mla: Scheideler, Christian, et al. “Towards Establishing Monotonic Searchability
in Self-Stabilizing Data Structures.” Proceedings of the 19th International
Conference on Principles of Distributed Systems (OPODIS), 2015, doi:10.4230/LIPIcs.OPODIS.2015.24.
short: 'C. Scheideler, A. Setzer, T.F. Strothmann, in: Proceedings of the 19th International
Conference on Principles of Distributed Systems (OPODIS), 2015.'
date_created: 2017-10-17T12:41:39Z
date_updated: 2022-01-06T06:56:07Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.4230/LIPIcs.OPODIS.2015.24
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:28:21Z
date_updated: 2018-03-21T10:28:21Z
file_id: '1497'
file_name: 241-ScheidelerSetzerStrothmann2015.pdf
file_size: 692363
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:28:21Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 19th International Conference on Principles of Distributed
Systems (OPODIS)
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures
type: conference
user_id: '477'
year: '2015'
...
---
_id: '242'
abstract:
- lang: eng
text: 'A fundamental problem for overlay networks is to safely exclude leaving nodes,
i.e., the nodes requesting to leave the overlay network are excluded from it without
affecting its connectivity. There are a number of studies for safe node exclusion
if the overlay is in a well-defined state, but almost no formal results are known
for the case in which the overlay network is in an arbitrary initial state, i.e.,
when looking for a self-stabilizing solution for excluding leaving nodes. We study
this problem in two variants: the Finite Departure Problem (FDP) and the Finite
Sleep Problem (FSP). In the FDP the leaving nodes have to irrevocably decide when
it is safe to leave the network, whereas in the FSP, this leaving decision does
not have to be final: the nodes may resume computation when woken up by an incoming
message. We are the first to present a self-stabilizing protocol for the FDP and
the FSP that can be combined with a large class of overlay maintenance protocols
so that these are then guaranteed to safely exclude leaving nodes from the system
from any initial state while operating as specified for the staying nodes. In
order to formally define the properties these overlay maintenance protocols have
to satisfy, we identify four basic primitives for manipulating edges in an overlay
network that might be of independent interest.'
author:
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Koutsopoulos A, Scheideler C, Strothmann TF. Towards a Universal Approach
for the Finite Departure Problem in Overlay Networks. In: Proceedings of the
17th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS). Lecture Notes in Computer Science. ; 2015:201-216. doi:10.1007/978-3-319-21741-3_14'
apa: Koutsopoulos, A., Scheideler, C., & Strothmann, T. F. (2015). Towards a
Universal Approach for the Finite Departure Problem in Overlay Networks. In Proceedings
of the 17th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS) (pp. 201–216). https://doi.org/10.1007/978-3-319-21741-3_14
bibtex: '@inproceedings{Koutsopoulos_Scheideler_Strothmann_2015, series={Lecture
Notes in Computer Science}, title={Towards a Universal Approach for the Finite
Departure Problem in Overlay Networks}, DOI={10.1007/978-3-319-21741-3_14},
booktitle={Proceedings of the 17th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, author={Koutsopoulos, Andreas and
Scheideler, Christian and Strothmann, Thim Frederik}, year={2015}, pages={201–216},
collection={Lecture Notes in Computer Science} }'
chicago: Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann.
“Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.”
In Proceedings of the 17th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS), 201–16. Lecture Notes in Computer
Science, 2015. https://doi.org/10.1007/978-3-319-21741-3_14.
ieee: A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Towards a Universal
Approach for the Finite Departure Problem in Overlay Networks,” in Proceedings
of the 17th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS), 2015, pp. 201–216.
mla: Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite
Departure Problem in Overlay Networks.” Proceedings of the 17th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS),
2015, pp. 201–16, doi:10.1007/978-3-319-21741-3_14.
short: 'A. Koutsopoulos, C. Scheideler, T.F. Strothmann, in: Proceedings of the
17th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS), 2015, pp. 201–216.'
date_created: 2017-10-17T12:41:39Z
date_updated: 2022-01-06T06:56:10Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-21741-3_14
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:59:32Z
date_updated: 2018-03-21T09:59:32Z
file_id: '1496'
file_name: 242-KSS-SSS2015.pdf
file_size: 532792
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:59:32Z
has_accepted_license: '1'
language:
- iso: eng
page: 201-216
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 17th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
series_title: Lecture Notes in Computer Science
status: public
title: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks
type: conference
user_id: '477'
year: '2015'
...
---
_id: '327'
abstract:
- lang: eng
text: We consider the problem of resource discovery in distributed systems. In particular
we give an algorithm, such that each node in a network discovers the address of
any other node in the network. We model the knowledge of the nodes as a virtual
overlay network given by a directed graph such that complete knowledge of all
nodes corresponds to a complete graph in the overlay network. Although there are
several solutions for resource discovery, our solution is the first that achieves
worst-case optimal work for each node, i.e. the number of addresses (O(n)O(n))
or bits (O(nlogn)O(nlogn)) a node receives or sends coincides with the lower
bound, while ensuring only a linear runtime (O(n)O(n)) on the number of rounds.
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Kniesburges S, Koutsopoulos A, Scheideler C. A deterministic worst-case message
complexity optimal solution for resource discovery. Theoretical Computer Science.
2015:67-79. doi:10.1016/j.tcs.2014.11.027
apa: Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2015). A deterministic
worst-case message complexity optimal solution for resource discovery. Theoretical
Computer Science, 67–79. https://doi.org/10.1016/j.tcs.2014.11.027
bibtex: '@article{Kniesburges_Koutsopoulos_Scheideler_2015, title={A deterministic
worst-case message complexity optimal solution for resource discovery}, DOI={10.1016/j.tcs.2014.11.027},
journal={Theoretical Computer Science}, publisher={Elsevier}, author={Kniesburges,
Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2015}, pages={67–79}
}'
chicago: Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler.
“A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.”
Theoretical Computer Science, 2015, 67–79. https://doi.org/10.1016/j.tcs.2014.11.027.
ieee: S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A deterministic worst-case
message complexity optimal solution for resource discovery,” Theoretical Computer
Science, pp. 67–79, 2015.
mla: Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity
Optimal Solution for Resource Discovery.” Theoretical Computer Science,
Elsevier, 2015, pp. 67–79, doi:10.1016/j.tcs.2014.11.027.
short: S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theoretical Computer Science
(2015) 67–79.
date_created: 2017-10-17T12:41:55Z
date_updated: 2022-01-06T06:59:08Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1016/j.tcs.2014.11.027
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:38:02Z
date_updated: 2018-03-20T07:38:02Z
file_id: '1427'
file_name: 327-KKS15-TOCS_01.pdf
file_size: 398044
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:38:02Z
has_accepted_license: '1'
page: 67-79
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Theoretical Computer Science
publisher: Elsevier
status: public
title: A deterministic worst-case message complexity optimal solution for resource
discovery
type: journal_article
user_id: '477'
year: '2015'
...
---
_id: '1850'
author:
- first_name: Zahra
full_name: Derakhshandeh, Zahra
last_name: Derakhshandeh
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
- first_name: Rida
full_name: A. Bazzi, Rida
last_name: A. Bazzi
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Derakhshandeh Z, Gmyr R, Strothmann TF, A. Bazzi R, W. Richa A, Scheideler
C. Leader Election and Shape Formation with Self-organizing Programmable Matter.
In: DNA Computing and Molecular Programming - 21st International Conference,
DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings. Vol
9211. Lecture Notes in Computer Science. ; 2015:117--132. doi:10.1007/978-3-319-21999-8_8'
apa: Derakhshandeh, Z., Gmyr, R., Strothmann, T. F., A. Bazzi, R., W. Richa, A.,
& Scheideler, C. (2015). Leader Election and Shape Formation with Self-organizing
Programmable Matter. In DNA Computing and Molecular Programming - 21st International
Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings
(Vol. 9211, pp. 117--132). https://doi.org/10.1007/978-3-319-21999-8_8
bibtex: '@inproceedings{Derakhshandeh_Gmyr_Strothmann_A. Bazzi_W. Richa_Scheideler_2015,
series={Lecture Notes in Computer Science}, title={Leader Election and Shape Formation
with Self-organizing Programmable Matter}, volume={9211}, DOI={10.1007/978-3-319-21999-8_8},
booktitle={DNA Computing and Molecular Programming - 21st International Conference,
DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings}, author={Derakhshandeh,
Zahra and Gmyr, Robert and Strothmann, Thim Frederik and A. Bazzi, Rida and W.
Richa, Andrea and Scheideler, Christian}, year={2015}, pages={117--132}, collection={Lecture
Notes in Computer Science} }'
chicago: Derakhshandeh, Zahra, Robert Gmyr, Thim Frederik Strothmann, Rida A. Bazzi,
Andrea W. Richa, and Christian Scheideler. “Leader Election and Shape Formation
with Self-Organizing Programmable Matter.” In DNA Computing and Molecular Programming
- 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August
17-21, 2015. Proceedings, 9211:117--132. Lecture Notes in Computer Science,
2015. https://doi.org/10.1007/978-3-319-21999-8_8.
ieee: Z. Derakhshandeh, R. Gmyr, T. F. Strothmann, R. A. Bazzi, A. W. Richa, and
C. Scheideler, “Leader Election and Shape Formation with Self-organizing Programmable
Matter,” in DNA Computing and Molecular Programming - 21st International Conference,
DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings, 2015,
vol. 9211, pp. 117--132.
mla: Derakhshandeh, Zahra, et al. “Leader Election and Shape Formation with Self-Organizing
Programmable Matter.” DNA Computing and Molecular Programming - 21st International
Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings,
vol. 9211, 2015, pp. 117--132, doi:10.1007/978-3-319-21999-8_8.
short: 'Z. Derakhshandeh, R. Gmyr, T.F. Strothmann, R. A. Bazzi, A. W. Richa, C.
Scheideler, in: DNA Computing and Molecular Programming - 21st International Conference,
DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings, 2015,
pp. 117--132.'
date_created: 2018-03-28T05:49:12Z
date_updated: 2022-01-06T06:53:36Z
department:
- _id: '79'
doi: 10.1007/978-3-319-21999-8_8
intvolume: ' 9211'
language:
- iso: eng
page: 117--132
publication: DNA Computing and Molecular Programming - 21st International Conference,
DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings
publication_identifier:
isbn:
- 978-3-319-21998-1
series_title: Lecture Notes in Computer Science
status: public
title: Leader Election and Shape Formation with Self-organizing Programmable Matter
type: conference
user_id: '15504'
volume: 9211
year: '2015'
...
---
_id: '1851'
author:
- first_name: Zahra
full_name: Derakhshandeh, Zahra
last_name: Derakhshandeh
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Derakhshandeh Z, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. An Algorithmic
Framework for Shape Formation Problems in Self-Organizing Particle Systems. In:
Proceedings of the Second Annual International Conference on Nanoscale Computing
and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015. ACM;
2015:21:1--21:2. doi:10.1145/2800795.2800829'
apa: Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., & Strothmann,
T. F. (2015). An Algorithmic Framework for Shape Formation Problems in Self-Organizing
Particle Systems. In Proceedings of the Second Annual International Conference
on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September
21-22, 2015 (pp. 21:1--21:2). ACM. https://doi.org/10.1145/2800795.2800829
bibtex: '@inproceedings{Derakhshandeh_Gmyr_W. Richa_Scheideler_Strothmann_2015,
title={An Algorithmic Framework for Shape Formation Problems in Self-Organizing
Particle Systems}, DOI={10.1145/2800795.2800829},
booktitle={Proceedings of the Second Annual International Conference on Nanoscale
Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015},
publisher={ACM}, author={Derakhshandeh, Zahra and Gmyr, Robert and W. Richa, Andrea
and Scheideler, Christian and Strothmann, Thim Frederik}, year={2015}, pages={21:1--21:2}
}'
chicago: Derakhshandeh, Zahra, Robert Gmyr, Andrea W. Richa, Christian Scheideler,
and Thim Frederik Strothmann. “An Algorithmic Framework for Shape Formation Problems
in Self-Organizing Particle Systems.” In Proceedings of the Second Annual International
Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA,
USA, September 21-22, 2015, 21:1--21:2. ACM, 2015. https://doi.org/10.1145/2800795.2800829.
ieee: Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann,
“An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle
Systems,” in Proceedings of the Second Annual International Conference on Nanoscale
Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015,
2015, pp. 21:1--21:2.
mla: Derakhshandeh, Zahra, et al. “An Algorithmic Framework for Shape Formation
Problems in Self-Organizing Particle Systems.” Proceedings of the Second Annual
International Conference on Nanoscale Computing and Communication, NANOCOM’ 15,
Boston, MA, USA, September 21-22, 2015, ACM, 2015, pp. 21:1--21:2, doi:10.1145/2800795.2800829.
short: 'Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann,
in: Proceedings of the Second Annual International Conference on Nanoscale Computing
and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015, ACM, 2015,
pp. 21:1--21:2.'
date_created: 2018-03-28T05:50:25Z
date_updated: 2022-01-06T06:53:36Z
department:
- _id: '79'
doi: 10.1145/2800795.2800829
language:
- iso: eng
page: 21:1--21:2
publication: Proceedings of the Second Annual International Conference on Nanoscale
Computing and Communication, NANOCOM' 15, Boston, MA, USA, September 21-22, 2015
publication_identifier:
isbn:
- 978-1-4503-3674-1
publisher: ACM
status: public
title: An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle
Systems
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '1852'
author:
- first_name: Zahra
full_name: Derakhshandeh, Zahra
last_name: Derakhshandeh
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
- first_name: Rida
full_name: A. Bazzi, Rida
last_name: A. Bazzi
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Derakhshandeh Z, Gmyr R, Strothmann TF, A. Bazzi R, W. Richa A, Scheideler
C. Brief Announcement: On the Feasibility of Leader Election and Shape Formation
with Self-Organizing Programmable Matter. In: Proceedings of the 2015 ACM Symposium
on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\’{a}}n,
Spain, July 21 - 23, 2015. ACM; 2015:67--69. doi:10.1145/2767386.2767451'
apa: 'Derakhshandeh, Z., Gmyr, R., Strothmann, T. F., A. Bazzi, R., W. Richa, A.,
& Scheideler, C. (2015). Brief Announcement: On the Feasibility of Leader
Election and Shape Formation with Self-Organizing Programmable Matter. In Proceedings
of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San
Sebasti{\’{a}}n, Spain, July 21 - 23, 2015 (pp. 67--69). ACM. https://doi.org/10.1145/2767386.2767451'
bibtex: '@inproceedings{Derakhshandeh_Gmyr_Strothmann_A. Bazzi_W. Richa_Scheideler_2015,
title={Brief Announcement: On the Feasibility of Leader Election and Shape Formation
with Self-Organizing Programmable Matter}, DOI={10.1145/2767386.2767451},
booktitle={Proceedings of the 2015 ACM Symposium on Principles of Distributed
Computing, PODC 2015, Donostia-San Sebasti{\’{a}}n, Spain, July 21 - 23, 2015},
publisher={ACM}, author={Derakhshandeh, Zahra and Gmyr, Robert and Strothmann,
Thim Frederik and A. Bazzi, Rida and W. Richa, Andrea and Scheideler, Christian},
year={2015}, pages={67--69} }'
chicago: 'Derakhshandeh, Zahra, Robert Gmyr, Thim Frederik Strothmann, Rida A. Bazzi,
Andrea W. Richa, and Christian Scheideler. “Brief Announcement: On the Feasibility
of Leader Election and Shape Formation with Self-Organizing Programmable Matter.”
In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing,
PODC 2015, Donostia-San Sebasti{\’{a}}n, Spain, July 21 - 23, 2015, 67--69.
ACM, 2015. https://doi.org/10.1145/2767386.2767451.'
ieee: 'Z. Derakhshandeh, R. Gmyr, T. F. Strothmann, R. A. Bazzi, A. W. Richa, and
C. Scheideler, “Brief Announcement: On the Feasibility of Leader Election and
Shape Formation with Self-Organizing Programmable Matter,” in Proceedings of
the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San
Sebasti{\’{a}}n, Spain, July 21 - 23, 2015, 2015, pp. 67--69.'
mla: 'Derakhshandeh, Zahra, et al. “Brief Announcement: On the Feasibility of Leader
Election and Shape Formation with Self-Organizing Programmable Matter.” Proceedings
of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San
Sebasti{\’{a}}n, Spain, July 21 - 23, 2015, ACM, 2015, pp. 67--69, doi:10.1145/2767386.2767451.'
short: 'Z. Derakhshandeh, R. Gmyr, T.F. Strothmann, R. A. Bazzi, A. W. Richa, C.
Scheideler, in: Proceedings of the 2015 ACM Symposium on Principles of Distributed
Computing, PODC 2015, Donostia-San Sebasti{\’{a}}n, Spain, July 21 - 23, 2015,
ACM, 2015, pp. 67--69.'
date_created: 2018-03-28T05:52:44Z
date_updated: 2022-01-06T06:53:36Z
department:
- _id: '79'
doi: 10.1145/2767386.2767451
language:
- iso: eng
page: 67--69
publication: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing,
PODC 2015, Donostia-San Sebasti{\'{a}}n, Spain, July 21 - 23, 2015
publication_identifier:
isbn:
- 978-1-4503-3617-8
publisher: ACM
status: public
title: 'Brief Announcement: On the Feasibility of Leader Election and Shape Formation
with Self-Organizing Programmable Matter'
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '1853'
author:
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Koutsopoulos A, Scheideler C, Strothmann TF. Brief Announcement: Towards a
Universal Approach for the Finite Departure Problem in Overlay Networks. In: Proceedings
of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA
2015, Portland, OR, USA, June 13-15, 2015. ACM; 2015:77--79. doi:10.1145/2755573.2755614'
apa: 'Koutsopoulos, A., Scheideler, C., & Strothmann, T. F. (2015). Brief Announcement:
Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.
In Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and
Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015 (pp. 77--79).
ACM. https://doi.org/10.1145/2755573.2755614'
bibtex: '@inproceedings{Koutsopoulos_Scheideler_Strothmann_2015, title={Brief Announcement:
Towards a Universal Approach for the Finite Departure Problem in Overlay Networks},
DOI={10.1145/2755573.2755614},
booktitle={Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms
and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015}, publisher={ACM},
author={Koutsopoulos, Andreas and Scheideler, Christian and Strothmann, Thim Frederik},
year={2015}, pages={77--79} }'
chicago: 'Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann.
“Brief Announcement: Towards a Universal Approach for the Finite Departure Problem
in Overlay Networks.” In Proceedings of the 27th ACM on Symposium on Parallelism
in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015,
77--79. ACM, 2015. https://doi.org/10.1145/2755573.2755614.'
ieee: 'A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Brief Announcement:
Towards a Universal Approach for the Finite Departure Problem in Overlay Networks,”
in Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and
Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015, 2015, pp. 77--79.'
mla: 'Koutsopoulos, Andreas, et al. “Brief Announcement: Towards a Universal Approach
for the Finite Departure Problem in Overlay Networks.” Proceedings of the 27th
ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland,
OR, USA, June 13-15, 2015, ACM, 2015, pp. 77--79, doi:10.1145/2755573.2755614.'
short: 'A. Koutsopoulos, C. Scheideler, T.F. Strothmann, in: Proceedings of the
27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015,
Portland, OR, USA, June 13-15, 2015, ACM, 2015, pp. 77--79.'
date_created: 2018-03-28T05:57:20Z
date_updated: 2022-01-06T06:53:36Z
department:
- _id: '79'
doi: 10.1145/2755573.2755614
language:
- iso: eng
page: 77--79
publication: Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms
and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015
publication_identifier:
isbn:
- 978-1-4503-3588-1
publisher: ACM
status: public
title: 'Brief Announcement: Towards a Universal Approach for the Finite Departure
Problem in Overlay Networks'
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '215'
abstract:
- lang: eng
text: 'We present three robust overlay networks: First, we present a network that
organizes the nodes into an expander and is resistant to even massive adversarial
churn. Second, we develop a network based on the hypercube that maintains connectivity
under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log
log n)-late adversary which only has access to topological information that is
at least Omega(log log n) rounds old. Finally, we develop a network that combines
both churn- and DoS-resistance. The networks gain their robustness through constant
network reconfiguration, i.e., the topology of the networks changes constantly.
Our reconguration algorithms are based on node sampling primitives for expanders
and hypercubes that allow each node to sample a logarithmic number of nodes uniformly
at random in O(log log n) communication rounds. These primitives are specific
to overlay networks and their optimal runtime represents an exponential improvement
over known techniques. Our results have a wide range of applications, for example
in the area of scalable and robust peer-to-peer systems.'
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Drees M, Gmyr R, Scheideler C. Churn- and DoS-resistant Overlay Networks Based
on Network Reconfiguration. In: Proceedings of the 28th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA). ; 2016:417--427. doi:10.1145/2935764.2935783'
apa: Drees, M., Gmyr, R., & Scheideler, C. (2016). Churn- and DoS-resistant
Overlay Networks Based on Network Reconfiguration. In Proceedings of the 28th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 417--427).
https://doi.org/10.1145/2935764.2935783
bibtex: '@inproceedings{Drees_Gmyr_Scheideler_2016, title={Churn- and DoS-resistant
Overlay Networks Based on Network Reconfiguration}, DOI={10.1145/2935764.2935783},
booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Drees, Maximilian and Gmyr, Robert and Scheideler,
Christian}, year={2016}, pages={417--427} }'
chicago: Drees, Maximilian, Robert Gmyr, and Christian Scheideler. “Churn- and DoS-Resistant
Overlay Networks Based on Network Reconfiguration.” In Proceedings of the 28th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 417--427,
2016. https://doi.org/10.1145/2935764.2935783.
ieee: M. Drees, R. Gmyr, and C. Scheideler, “Churn- and DoS-resistant Overlay Networks
Based on Network Reconfiguration,” in Proceedings of the 28th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.
mla: Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based
on Network Reconfiguration.” Proceedings of the 28th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 2016, pp. 417--427, doi:10.1145/2935764.2935783.
short: 'M. Drees, R. Gmyr, C. Scheideler, in: Proceedings of the 28th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.'
date_created: 2017-10-17T12:41:33Z
date_updated: 2022-01-06T06:55:02Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1145/2935764.2935783
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:41:40Z
date_updated: 2018-03-21T10:41:40Z
file_id: '1518'
file_name: 215-SPAA16-Drees_Gmyr_Scheideler.pdf
file_size: 352996
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:41:40Z
has_accepted_license: '1'
language:
- iso: eng
page: 417--427
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration
type: conference
user_id: '14955'
year: '2016'
...
---
_id: '1835'
author:
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Chen
full_name: Avin, Chen
last_name: Avin
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Michael
full_name: Borokhovich, Michael
last_name: Borokhovich
- first_name: Bernhard
full_name: Haeupler, Bernhard
last_name: Haeupler
- first_name: Zvi
full_name: Lotker, Zvi
last_name: Lotker
citation:
ama: 'Schmid S, Avin C, Scheideler C, Borokhovich M, Haeupler B, Lotker Z. SplayNet:
Towards Locally Self-Adjusting Networks. IEEE/ACM Trans Netw. 2016;(3):1421--1433.
doi:10.1109/TNET.2015.2410313'
apa: 'Schmid, S., Avin, C., Scheideler, C., Borokhovich, M., Haeupler, B., &
Lotker, Z. (2016). SplayNet: Towards Locally Self-Adjusting Networks. IEEE/ACM
Trans. Netw., (3), 1421--1433. https://doi.org/10.1109/TNET.2015.2410313'
bibtex: '@article{Schmid_Avin_Scheideler_Borokhovich_Haeupler_Lotker_2016, title={SplayNet:
Towards Locally Self-Adjusting Networks}, DOI={10.1109/TNET.2015.2410313},
number={3}, journal={IEEE/ACM Trans. Netw.}, author={Schmid, Stefan and Avin,
Chen and Scheideler, Christian and Borokhovich, Michael and Haeupler, Bernhard
and Lotker, Zvi}, year={2016}, pages={1421--1433} }'
chicago: 'Schmid, Stefan, Chen Avin, Christian Scheideler, Michael Borokhovich,
Bernhard Haeupler, and Zvi Lotker. “SplayNet: Towards Locally Self-Adjusting Networks.”
IEEE/ACM Trans. Netw., no. 3 (2016): 1421--1433. https://doi.org/10.1109/TNET.2015.2410313.'
ieee: 'S. Schmid, C. Avin, C. Scheideler, M. Borokhovich, B. Haeupler, and Z. Lotker,
“SplayNet: Towards Locally Self-Adjusting Networks,” IEEE/ACM Trans. Netw.,
no. 3, pp. 1421--1433, 2016.'
mla: 'Schmid, Stefan, et al. “SplayNet: Towards Locally Self-Adjusting Networks.”
IEEE/ACM Trans. Netw., no. 3, 2016, pp. 1421--1433, doi:10.1109/TNET.2015.2410313.'
short: S. Schmid, C. Avin, C. Scheideler, M. Borokhovich, B. Haeupler, Z. Lotker,
IEEE/ACM Trans. Netw. (2016) 1421--1433.
date_created: 2018-03-27T12:40:24Z
date_updated: 2022-01-06T06:53:29Z
department:
- _id: '79'
doi: 10.1109/TNET.2015.2410313
issue: '3'
page: 1421--1433
publication: IEEE/ACM Trans. Netw.
status: public
title: 'SplayNet: Towards Locally Self-Adjusting Networks'
type: journal_article
user_id: '15504'
year: '2016'
...
---
_id: '1836'
author:
- first_name: Zahra
full_name: Derakhshandeh, Zahra
last_name: Derakhshandeh
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Alexandra
full_name: Porter, Alexandra
last_name: Porter
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Derakhshandeh Z, Gmyr R, Porter A, W. Richa A, Scheideler C, Strothmann TF.
On the Runtime of Universal Coating for Programmable Matter. In: DNA Computing
and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany,
September 4-8, 2016, Proceedings. Vol 9818. Lecture Notes in Computer Science.
; 2016:148--164. doi:10.1007/978-3-319-43994-5_10'
apa: Derakhshandeh, Z., Gmyr, R., Porter, A., W. Richa, A., Scheideler, C., &
Strothmann, T. F. (2016). On the Runtime of Universal Coating for Programmable
Matter. In DNA Computing and Molecular Programming - 22nd International Conference,
DNA 22, Munich, Germany, September 4-8, 2016, Proceedings (Vol. 9818, pp.
148--164). https://doi.org/10.1007/978-3-319-43994-5_10
bibtex: '@inproceedings{Derakhshandeh_Gmyr_Porter_W. Richa_Scheideler_Strothmann_2016,
series={Lecture Notes in Computer Science}, title={On the Runtime of Universal
Coating for Programmable Matter}, volume={9818}, DOI={10.1007/978-3-319-43994-5_10},
booktitle={DNA Computing and Molecular Programming - 22nd International Conference,
DNA 22, Munich, Germany, September 4-8, 2016, Proceedings}, author={Derakhshandeh,
Zahra and Gmyr, Robert and Porter, Alexandra and W. Richa, Andrea and Scheideler,
Christian and Strothmann, Thim Frederik}, year={2016}, pages={148--164}, collection={Lecture
Notes in Computer Science} }'
chicago: Derakhshandeh, Zahra, Robert Gmyr, Alexandra Porter, Andrea W. Richa, Christian
Scheideler, and Thim Frederik Strothmann. “On the Runtime of Universal Coating
for Programmable Matter.” In DNA Computing and Molecular Programming - 22nd
International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings,
9818:148--164. Lecture Notes in Computer Science, 2016. https://doi.org/10.1007/978-3-319-43994-5_10.
ieee: Z. Derakhshandeh, R. Gmyr, A. Porter, A. W. Richa, C. Scheideler, and T. F.
Strothmann, “On the Runtime of Universal Coating for Programmable Matter,” in
DNA Computing and Molecular Programming - 22nd International Conference, DNA
22, Munich, Germany, September 4-8, 2016, Proceedings, 2016, vol. 9818, pp.
148--164.
mla: Derakhshandeh, Zahra, et al. “On the Runtime of Universal Coating for Programmable
Matter.” DNA Computing and Molecular Programming - 22nd International Conference,
DNA 22, Munich, Germany, September 4-8, 2016, Proceedings, vol. 9818, 2016,
pp. 148--164, doi:10.1007/978-3-319-43994-5_10.
short: 'Z. Derakhshandeh, R. Gmyr, A. Porter, A. W. Richa, C. Scheideler, T.F. Strothmann,
in: DNA Computing and Molecular Programming - 22nd International Conference, DNA
22, Munich, Germany, September 4-8, 2016, Proceedings, 2016, pp. 148--164.'
date_created: 2018-03-27T12:41:45Z
date_updated: 2022-01-06T06:53:30Z
department:
- _id: '79'
doi: 10.1007/978-3-319-43994-5_10
intvolume: ' 9818'
language:
- iso: eng
page: 148--164
publication: DNA Computing and Molecular Programming - 22nd International Conference,
DNA 22, Munich, Germany, September 4-8, 2016, Proceedings
publication_identifier:
unknown:
- 978-3-319-43993-8
series_title: Lecture Notes in Computer Science
status: public
title: On the Runtime of Universal Coating for Programmable Matter
type: conference
user_id: '15504'
volume: 9818
year: '2016'
...
---
_id: '1837'
author:
- first_name: Zahra
full_name: Derakhshandeh, Zahra
last_name: Derakhshandeh
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Derakhshandeh Z, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. Universal
Shape Formation for Programmable Matter. In: Proceedings of the 28th ACM Symposium
on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific
Grove, CA, USA, July 11-13, 2016. ACM; 2016:289--299. doi:10.1145/2935764.2935784'
apa: Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., & Strothmann,
T. F. (2016). Universal Shape Formation for Programmable Matter. In Proceedings
of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA
2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016 (pp. 289--299).
ACM. https://doi.org/10.1145/2935764.2935784
bibtex: '@inproceedings{Derakhshandeh_Gmyr_W. Richa_Scheideler_Strothmann_2016,
title={Universal Shape Formation for Programmable Matter}, DOI={10.1145/2935764.2935784},
booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms
and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July
11-13, 2016}, publisher={ACM}, author={Derakhshandeh, Zahra and Gmyr, Robert and
W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2016},
pages={289--299} }'
chicago: Derakhshandeh, Zahra, Robert Gmyr, Andrea W. Richa, Christian Scheideler,
and Thim Frederik Strothmann. “Universal Shape Formation for Programmable Matter.”
In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures,
SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016,
289--299. ACM, 2016. https://doi.org/10.1145/2935764.2935784.
ieee: Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann,
“Universal Shape Formation for Programmable Matter,” in Proceedings of the
28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016,
Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016, 2016, pp. 289--299.
mla: Derakhshandeh, Zahra, et al. “Universal Shape Formation for Programmable Matter.”
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures,
SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016,
ACM, 2016, pp. 289--299, doi:10.1145/2935764.2935784.
short: 'Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann,
in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures,
SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016, ACM,
2016, pp. 289--299.'
date_created: 2018-03-27T12:44:09Z
date_updated: 2022-01-06T06:53:30Z
department:
- _id: '79'
doi: 10.1145/2935764.2935784
language:
- iso: eng
page: 289--299
publication: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and
Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13,
2016
publication_identifier:
unknown:
- 978-1-4503-4210-0
publisher: ACM
status: public
title: Universal Shape Formation for Programmable Matter
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '1845'
author:
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'W. Richa A, Scheideler C. Jamming-Resistant MAC Protocols for Wireless Networks.
In: Encyclopedia of Algorithms. ; 2016:999--1002. doi:10.1007/978-1-4939-2864-4_593'
apa: W. Richa, A., & Scheideler, C. (2016). Jamming-Resistant MAC Protocols
for Wireless Networks. In Encyclopedia of Algorithms (pp. 999--1002). https://doi.org/10.1007/978-1-4939-2864-4_593
bibtex: '@inbook{W. Richa_Scheideler_2016, title={Jamming-Resistant MAC Protocols
for Wireless Networks}, DOI={10.1007/978-1-4939-2864-4_593},
booktitle={Encyclopedia of Algorithms}, author={W. Richa, Andrea and Scheideler,
Christian}, year={2016}, pages={999--1002} }'
chicago: W. Richa, Andrea, and Christian Scheideler. “Jamming-Resistant MAC Protocols
for Wireless Networks.” In Encyclopedia of Algorithms, 999--1002, 2016.
https://doi.org/10.1007/978-1-4939-2864-4_593.
ieee: A. W. Richa and C. Scheideler, “Jamming-Resistant MAC Protocols for Wireless
Networks,” in Encyclopedia of Algorithms, 2016, pp. 999--1002.
mla: W. Richa, Andrea, and Christian Scheideler. “Jamming-Resistant MAC Protocols
for Wireless Networks.” Encyclopedia of Algorithms, 2016, pp. 999--1002,
doi:10.1007/978-1-4939-2864-4_593.
short: 'A. W. Richa, C. Scheideler, in: Encyclopedia of Algorithms, 2016, pp. 999--1002.'
date_created: 2018-03-28T05:45:04Z
date_updated: 2022-01-06T06:53:32Z
department:
- _id: '79'
doi: 10.1007/978-1-4939-2864-4_593
page: 999--1002
publication: Encyclopedia of Algorithms
status: public
title: Jamming-Resistant MAC Protocols for Wireless Networks
type: book_chapter
user_id: '15504'
year: '2016'
...
---
_id: '155'
abstract:
- lang: eng
text: We present a self-stabilizing algorithm for overlay networks that, for an
arbitrary metric given by a distance oracle, constructs the graph representing
that metric. The graph representing a metric is the unique minimal undirected
graph such that for any pair of nodes the length of a shortest path between the
nodes corresponds to the distance between the nodes according to the metric. The
algorithm works under both an asynchronous and a synchronous daemon. In the synchronous
case, the algorithm stablizes in time O(n) and it is almost silent in that after
stabilization a node sends and receives a constant number of messages per round.
author:
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Jonas
full_name: Lefèvre, Jonas
last_name: Lefèvre
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Gmyr R, Lefèvre J, Scheideler C. Self-stabilizing Metric Graphs. In: Proceedings
of the 18th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS). LNCS. ; 2016:248--262. doi:10.1007/978-3-319-49259-9_20'
apa: Gmyr, R., Lefèvre, J., & Scheideler, C. (2016). Self-stabilizing Metric
Graphs. In Proceedings of the 18th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS) (pp. 248--262). https://doi.org/10.1007/978-3-319-49259-9_20
bibtex: '@inproceedings{Gmyr_Lefèvre_Scheideler_2016, series={LNCS}, title={Self-stabilizing
Metric Graphs}, DOI={10.1007/978-3-319-49259-9_20},
booktitle={Proceedings of the 18th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, author={Gmyr, Robert and Lefèvre,
Jonas and Scheideler, Christian}, year={2016}, pages={248--262}, collection={LNCS}
}'
chicago: Gmyr, Robert, Jonas Lefèvre, and Christian Scheideler. “Self-Stabilizing
Metric Graphs.” In Proceedings of the 18th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS), 248--262. LNCS, 2016. https://doi.org/10.1007/978-3-319-49259-9_20.
ieee: R. Gmyr, J. Lefèvre, and C. Scheideler, “Self-stabilizing Metric Graphs,”
in Proceedings of the 18th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS), 2016, pp. 248--262.
mla: Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.” Proceedings of the
18th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS), 2016, pp. 248--262, doi:10.1007/978-3-319-49259-9_20.
short: 'R. Gmyr, J. Lefèvre, C. Scheideler, in: Proceedings of the 18th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS),
2016, pp. 248--262.'
date_created: 2017-10-17T12:41:22Z
date_updated: 2022-01-06T06:52:28Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-49259-9_20
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:51:24Z
date_updated: 2018-03-21T12:51:24Z
file_id: '1550'
file_name: 155-SSS16-GLS.pdf
file_size: 389136
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:51:24Z
has_accepted_license: '1'
page: 248--262
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 18th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
series_title: LNCS
status: public
title: Self-stabilizing Metric Graphs
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '142'
abstract:
- lang: eng
text: For overlay networks, the ability to recover from a variety of problems like
membership changes or faults is a key element to preserve their functionality.
In recent years, various self-stabilizing overlay networks have been proposed
that have the advantage of being able to recover from any illegal state. However,
the vast majority of these networks cannot give any guarantees on its functionality
while the recovery process is going on. We are especially interested in searchability,
i.e., the functionality that search messages for a specific identifier are answered
successfully if a node with that identifier exists in the network. We investigate
overlay networks that are not only self-stabilizing but that also ensure that
monotonic searchability is maintained while the recovery process is going on,
as long as there are no corrupted messages in the system. More precisely, once
a search message from node u to another node v is successfully delivered, all
future search messages from u to v succeed as well. Monotonic searchability was
recently introduced in OPODIS 2015, in which the authors provide a solution for
a simple line topology.We present the first universal approach to maintain monotonic
searchability that is applicable to a wide range of topologies. As the base for
our approach, we introduce a set of primitives for manipulating overlay networks
that allows us to maintain searchability and show how existing protocols can be
transformed to use theses primitives.We complement this result with a generic
search protocol that together with the use of our primitives guarantees monotonic
searchability.As an additional feature, searching existing nodes with the generic
search protocol is as fast as searching a node with any other fixed routing protocol
once the topology has stabilized.
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Scheideler C, Setzer A, Strothmann TF. Towards a Universal Approach for Monotonic
Searchability in Self-stabilizing Overlay Networks. In: Proceedings of the
30th International Symposium on Distributed Computing (DISC). LNCS. ; 2016:71--84.
doi:10.1007/978-3-662-53426-7_6'
apa: Scheideler, C., Setzer, A., & Strothmann, T. F. (2016). Towards a Universal
Approach for Monotonic Searchability in Self-stabilizing Overlay Networks. In
Proceedings of the 30th International Symposium on Distributed Computing (DISC)
(pp. 71--84). https://doi.org/10.1007/978-3-662-53426-7_6
bibtex: '@inproceedings{Scheideler_Setzer_Strothmann_2016, series={LNCS}, title={Towards
a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks},
DOI={10.1007/978-3-662-53426-7_6},
booktitle={Proceedings of the 30th International Symposium on Distributed Computing
(DISC)}, author={Scheideler, Christian and Setzer, Alexander and Strothmann, Thim
Frederik}, year={2016}, pages={71--84}, collection={LNCS} }'
chicago: Scheideler, Christian, Alexander Setzer, and Thim Frederik Strothmann.
“Towards a Universal Approach for Monotonic Searchability in Self-Stabilizing
Overlay Networks.” In Proceedings of the 30th International Symposium on Distributed
Computing (DISC), 71--84. LNCS, 2016. https://doi.org/10.1007/978-3-662-53426-7_6.
ieee: C. Scheideler, A. Setzer, and T. F. Strothmann, “Towards a Universal Approach
for Monotonic Searchability in Self-stabilizing Overlay Networks,” in Proceedings
of the 30th International Symposium on Distributed Computing (DISC), 2016,
pp. 71--84.
mla: Scheideler, Christian, et al. “Towards a Universal Approach for Monotonic Searchability
in Self-Stabilizing Overlay Networks.” Proceedings of the 30th International
Symposium on Distributed Computing (DISC), 2016, pp. 71--84, doi:10.1007/978-3-662-53426-7_6.
short: 'C. Scheideler, A. Setzer, T.F. Strothmann, in: Proceedings of the 30th International
Symposium on Distributed Computing (DISC), 2016, pp. 71--84.'
date_created: 2017-10-17T12:41:19Z
date_updated: 2022-01-06T06:51:56Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-662-53426-7_6
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:59:29Z
date_updated: 2018-03-21T12:59:29Z
file_id: '1558'
file_name: 142-SchSetStrDISC16.pdf
file_size: 209638
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:59:29Z
has_accepted_license: '1'
language:
- iso: eng
page: 71--84
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 30th International Symposium on Distributed Computing
(DISC)
series_title: LNCS
status: public
title: Towards a Universal Approach for Monotonic Searchability in Self-stabilizing
Overlay Networks
type: conference
user_id: '477'
year: '2016'
...
---
_id: '3872'
abstract:
- lang: eng
text: 'This paper considers the problem of how to efficiently share a wireless medium
which is subject to harsh external interference or even jamming. So far, this
problem is understood only in simplistic single-hop or unit disk graph models.
We in this paper initiate the study of MAC protocols for the SINR interference
model (a.k.a. physical model). This paper makes two contributions. First, we introduce
a new adversarial SINR model which captures a wide range of interference phenomena.
Concretely, we consider a powerful, adaptive adversary which can jam nodes at
arbitrary times and which is only limited by some energy budget. Our second contribution
is a distributed MAC protocol called Sade which provably achieves a constant competitive
throughput in this environment: we show that, with high probability, the protocol
ensures that a constant fraction of the non-blocked time periods is used for successful
transmissions.'
author:
- first_name: Adrian
full_name: Ogierman, Adrian
last_name: Ogierman
- first_name: Andrea
full_name: Richa, Andrea
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: 'Ogierman A, Richa A, Scheideler C, Schmid S, Zhang J. Sade: competitive MAC
under adversarial SINR. Distributed Computing. 2017;31(3):241-254. doi:10.1007/s00446-017-0307-1'
apa: 'Ogierman, A., Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2017).
Sade: competitive MAC under adversarial SINR. Distributed Computing, 31(3),
241–254. https://doi.org/10.1007/s00446-017-0307-1'
bibtex: '@article{Ogierman_Richa_Scheideler_Schmid_Zhang_2017, title={Sade: competitive
MAC under adversarial SINR}, volume={31}, DOI={10.1007/s00446-017-0307-1},
number={3}, journal={Distributed Computing}, publisher={Springer Nature}, author={Ogierman,
Adrian and Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang,
Jin}, year={2017}, pages={241–254} }'
chicago: 'Ogierman, Adrian, Andrea Richa, Christian Scheideler, Stefan Schmid, and
Jin Zhang. “Sade: Competitive MAC under Adversarial SINR.” Distributed Computing
31, no. 3 (2017): 241–54. https://doi.org/10.1007/s00446-017-0307-1.'
ieee: 'A. Ogierman, A. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Sade: competitive
MAC under adversarial SINR,” Distributed Computing, vol. 31, no. 3, pp.
241–254, 2017.'
mla: 'Ogierman, Adrian, et al. “Sade: Competitive MAC under Adversarial SINR.” Distributed
Computing, vol. 31, no. 3, Springer Nature, 2017, pp. 241–54, doi:10.1007/s00446-017-0307-1.'
short: A. Ogierman, A. Richa, C. Scheideler, S. Schmid, J. Zhang, Distributed Computing
31 (2017) 241–254.
date_created: 2018-08-10T07:05:12Z
date_updated: 2022-01-06T06:59:47Z
department:
- _id: '79'
doi: 10.1007/s00446-017-0307-1
intvolume: ' 31'
issue: '3'
page: 241-254
publication: Distributed Computing
publication_identifier:
issn:
- 0178-2770
- 1432-0452
publication_status: published
publisher: Springer Nature
status: public
title: 'Sade: competitive MAC under adversarial SINR'
type: journal_article
user_id: '15504'
volume: 31
year: '2017'
...
---
_id: '1812'
author:
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: Koutsopoulos A, Scheideler C, Strothmann TF. Towards a universal approach for
the finite departure problem in overlay networks. Inf Comput. 2017:408--424.
doi:10.1016/j.ic.2016.12.006
apa: Koutsopoulos, A., Scheideler, C., & Strothmann, T. F. (2017). Towards a
universal approach for the finite departure problem in overlay networks. Inf.
Comput., 408--424. https://doi.org/10.1016/j.ic.2016.12.006
bibtex: '@article{Koutsopoulos_Scheideler_Strothmann_2017, title={Towards a universal
approach for the finite departure problem in overlay networks}, DOI={10.1016/j.ic.2016.12.006},
journal={Inf. Comput.}, author={Koutsopoulos, Andreas and Scheideler, Christian
and Strothmann, Thim Frederik}, year={2017}, pages={408--424} }'
chicago: Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann.
“Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.”
Inf. Comput., 2017, 408--424. https://doi.org/10.1016/j.ic.2016.12.006.
ieee: A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Towards a universal
approach for the finite departure problem in overlay networks,” Inf. Comput.,
pp. 408--424, 2017.
mla: Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite
Departure Problem in Overlay Networks.” Inf. Comput., 2017, pp. 408--424,
doi:10.1016/j.ic.2016.12.006.
short: A. Koutsopoulos, C. Scheideler, T.F. Strothmann, Inf. Comput. (2017) 408--424.
date_created: 2018-03-27T11:23:36Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '79'
doi: 10.1016/j.ic.2016.12.006
language:
- iso: eng
page: 408--424
publication: Inf. Comput.
status: public
title: Towards a universal approach for the finite departure problem in overlay networks
type: journal_article
user_id: '15504'
year: '2017'
...
---
_id: '1813'
author:
- first_name: Sandor
full_name: P. Fekete, Sandor
last_name: P. Fekete
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Kay
full_name: Römer, Kay
last_name: Römer
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: P. Fekete S, W. Richa A, Römer K, Scheideler C. Algorithmic Foundations of
Programmable Matter Dagstuhl Seminar 16271. SIGACT News. 2017;(2):87--94.
doi:10.1145/3106700.3106713
apa: P. Fekete, S., W. Richa, A., Römer, K., & Scheideler, C. (2017). Algorithmic
Foundations of Programmable Matter Dagstuhl Seminar 16271. SIGACT News,
(2), 87--94. https://doi.org/10.1145/3106700.3106713
bibtex: '@article{P. Fekete_W. Richa_Römer_Scheideler_2017, title={Algorithmic Foundations
of Programmable Matter Dagstuhl Seminar 16271}, DOI={10.1145/3106700.3106713},
number={2}, journal={SIGACT News}, author={P. Fekete, Sandor and W. Richa, Andrea
and Römer, Kay and Scheideler, Christian}, year={2017}, pages={87--94} }'
chicago: 'P. Fekete, Sandor, Andrea W. Richa, Kay Römer, and Christian Scheideler.
“Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271.” SIGACT
News, no. 2 (2017): 87--94. https://doi.org/10.1145/3106700.3106713.'
ieee: S. P. Fekete, A. W. Richa, K. Römer, and C. Scheideler, “Algorithmic Foundations
of Programmable Matter Dagstuhl Seminar 16271,” SIGACT News, no. 2, pp.
87--94, 2017.
mla: P. Fekete, Sandor, et al. “Algorithmic Foundations of Programmable Matter Dagstuhl
Seminar 16271.” SIGACT News, no. 2, 2017, pp. 87--94, doi:10.1145/3106700.3106713.
short: S. P. Fekete, A. W. Richa, K. Römer, C. Scheideler, SIGACT News (2017) 87--94.
date_created: 2018-03-27T11:24:15Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '79'
doi: 10.1145/3106700.3106713
issue: '2'
page: 87--94
publication: SIGACT News
status: public
title: Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271
type: journal_article
user_id: '15504'
year: '2017'
...