---
_id: '18006'
author:
- first_name: Jannik
full_name: Sundermeier, Jannik
id: '38705'
last_name: Sundermeier
citation:
ama: Sundermeier J. Implementierung Eines Selbststabilisierenden Verteilten Stacks.
Universität Paderborn; 2015.
apa: Sundermeier, J. (2015). Implementierung eines selbststabilisierenden verteilten
Stacks. Universität Paderborn.
bibtex: '@book{Sundermeier_2015, title={Implementierung eines selbststabilisierenden
verteilten Stacks}, publisher={Universität Paderborn}, author={Sundermeier, Jannik},
year={2015} }'
chicago: Sundermeier, Jannik. Implementierung Eines Selbststabilisierenden Verteilten
Stacks. Universität Paderborn, 2015.
ieee: J. Sundermeier, Implementierung eines selbststabilisierenden verteilten
Stacks. Universität Paderborn, 2015.
mla: Sundermeier, Jannik. Implementierung Eines Selbststabilisierenden Verteilten
Stacks. Universität Paderborn, 2015.
short: J. Sundermeier, Implementierung Eines Selbststabilisierenden Verteilten Stacks,
Universität Paderborn, 2015.
date_created: 2020-08-17T08:20:59Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Implementierung eines selbststabilisierenden verteilten Stacks
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '18024'
author:
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
citation:
ama: Knollmann T. Implementierung Einer Selbststabilisierenden Datenstruktur
Für Das Längste Gemeinsame Präfix. Universität Paderborn; 2015.
apa: Knollmann, T. (2015). Implementierung einer selbststabilisierenden Datenstruktur
für das längste gemeinsame Präfix. Universität Paderborn.
bibtex: '@book{Knollmann_2015, title={Implementierung einer selbststabilisierenden
Datenstruktur für das längste gemeinsame Präfix}, publisher={Universität Paderborn},
author={Knollmann, Till}, year={2015} }'
chicago: Knollmann, Till. Implementierung Einer Selbststabilisierenden Datenstruktur
Für Das Längste Gemeinsame Präfix. Universität Paderborn, 2015.
ieee: T. Knollmann, Implementierung einer selbststabilisierenden Datenstruktur
für das längste gemeinsame Präfix. Universität Paderborn, 2015.
mla: Knollmann, Till. Implementierung Einer Selbststabilisierenden Datenstruktur
Für Das Längste Gemeinsame Präfix. Universität Paderborn, 2015.
short: T. Knollmann, Implementierung Einer Selbststabilisierenden Datenstruktur
Für Das Längste Gemeinsame Präfix, Universität Paderborn, 2015.
date_created: 2020-08-18T08:37:33Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Implementierung einer selbststabilisierenden Datenstruktur für das längste
gemeinsame Präfix
type: bachelorsthesis
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: '1854'
citation:
ama: Scheideler C, ed. Structural Information and Communication Complexity -
22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015,
Post-Proceedings.; 2015. doi:10.1007/978-3-319-25258-2
apa: Scheideler, C. (Ed.). (2015). Structural Information and Communication Complexity
- 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16,
2015, Post-Proceedings. https://doi.org/10.1007/978-3-319-25258-2
bibtex: '@book{Scheideler_2015, series={Lecture Notes in Computer Science}, title={Structural
Information and Communication Complexity - 22nd International Colloquium, SIROCCO
2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings}, DOI={10.1007/978-3-319-25258-2},
year={2015}, collection={Lecture Notes in Computer Science} }'
chicago: Scheideler, Christian, ed. Structural Information and Communication
Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July
14-16, 2015, Post-Proceedings. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-25258-2.
ieee: C. Scheideler, Ed., Structural Information and Communication Complexity
- 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16,
2015, Post-Proceedings. 2015.
mla: Scheideler, Christian, editor. Structural Information and Communication
Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July
14-16, 2015, Post-Proceedings. 2015, doi:10.1007/978-3-319-25258-2.
short: C. Scheideler, ed., Structural Information and Communication Complexity -
22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015,
Post-Proceedings, 2015.
date_created: 2018-03-28T06:09:00Z
date_updated: 2022-01-06T06:53:36Z
department:
- _id: '79'
doi: 10.1007/978-3-319-25258-2
editor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
publication_identifier:
isbn:
- 978-3-319-25257-5
series_title: Lecture Notes in Computer Science
status: public
title: Structural Information and Communication Complexity - 22nd International Colloquium,
SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings
type: conference_editor
user_id: '15504'
year: '2015'
...
---
_id: '367'
abstract:
- lang: eng
text: Online social networks are attracting billions of nowadays, both on a global
scale as well as in social enterprise networks. Using distributed hash tables
and peer-to-peer technology allows online social networks to be operated securely
and efficiently only by using the resources of the user devices, thus alleviating
censorship or data misuse by a single network operator. In this paper, we address
the challenges that arise in implementing reliably and conveniently to use distributed
data structures, such as lists or sets, in such a distributed hash-tablebased
online social network. We present a secure, distributed list data structure that
manages the list entries in several buckets in the distributed hash table. The
list entries are authenticated, integrity is maintained and access control for
single users and also groups is integrated. The approach for secure distributed
lists is also applied for prefix trees and sets, and implemented and evaluated
in a peer-to-peer framework for social networks. Evaluation shows that the distributed
data structure is convenient and efficient to use and that the requirements on
security hold.
author:
- first_name: Jens
full_name: Janiuk, Jens
last_name: Janiuk
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
citation:
ama: 'Janiuk J, Mäcker A, Graffi K. Secure Distributed Data Structures for Peer-to-Peer-based
Social Networks. In: Proceedings of the International Conference on Collaboration
Technologies and Systems (CTS). ; 2014:396-405. doi:10.1109/CTS.2014.6867595'
apa: Janiuk, J., Mäcker, A., & Graffi, K. (2014). Secure Distributed Data Structures
for Peer-to-Peer-based Social Networks. In Proceedings of the International
Conference on Collaboration Technologies and Systems (CTS) (pp. 396–405).
https://doi.org/10.1109/CTS.2014.6867595
bibtex: '@inproceedings{Janiuk_Mäcker_Graffi_2014, title={Secure Distributed Data
Structures for Peer-to-Peer-based Social Networks}, DOI={10.1109/CTS.2014.6867595},
booktitle={Proceedings of the International Conference on Collaboration Technologies
and Systems (CTS)}, author={Janiuk, Jens and Mäcker, Alexander and Graffi, Kalman},
year={2014}, pages={396–405} }'
chicago: Janiuk, Jens, Alexander Mäcker, and Kalman Graffi. “Secure Distributed
Data Structures for Peer-to-Peer-Based Social Networks.” In Proceedings of
the International Conference on Collaboration Technologies and Systems (CTS),
396–405, 2014. https://doi.org/10.1109/CTS.2014.6867595.
ieee: J. Janiuk, A. Mäcker, and K. Graffi, “Secure Distributed Data Structures for
Peer-to-Peer-based Social Networks,” in Proceedings of the International Conference
on Collaboration Technologies and Systems (CTS), 2014, pp. 396–405.
mla: Janiuk, Jens, et al. “Secure Distributed Data Structures for Peer-to-Peer-Based
Social Networks.” Proceedings of the International Conference on Collaboration
Technologies and Systems (CTS), 2014, pp. 396–405, doi:10.1109/CTS.2014.6867595.
short: 'J. Janiuk, A. Mäcker, K. Graffi, in: Proceedings of the International Conference
on Collaboration Technologies and Systems (CTS), 2014, pp. 396–405.'
date_created: 2017-10-17T12:42:03Z
date_updated: 2022-01-06T06:59:29Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/CTS.2014.6867595
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:18:12Z
date_updated: 2018-03-20T07:18:12Z
file_id: '1404'
file_name: 367-cts_conf.pdf
file_size: 647997
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:18:12Z
has_accepted_license: '1'
language:
- iso: eng
page: 396-405
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 International Conference on Collaboration Technologies
and Systems (CTS)
status: public
title: Secure Distributed Data Structures for Peer-to-Peer-based Social Networks
type: conference
user_id: '477'
year: '2014'
...
---
_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: '18001'
author:
- first_name: Linghui
full_name: Luo, Linghui
last_name: Luo
citation:
ama: Luo L. Ein Selbst-Stabilisierender Algorithmus Für Das Finite Sleep Problem
in Skip+ Graphen. Universität Paderborn; 2014.
apa: Luo, L. (2014). Ein selbst-stabilisierender Algorithmus für das Finite Sleep
Problem in Skip+ Graphen. Universität Paderborn.
bibtex: '@book{Luo_2014, title={Ein selbst-stabilisierender Algorithmus für das
Finite Sleep Problem in Skip+ Graphen}, publisher={Universität Paderborn}, author={Luo,
Linghui}, year={2014} }'
chicago: Luo, Linghui. Ein Selbst-Stabilisierender Algorithmus Für Das Finite
Sleep Problem in Skip+ Graphen. Universität Paderborn, 2014.
ieee: L. Luo, Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem
in Skip+ Graphen. Universität Paderborn, 2014.
mla: Luo, Linghui. Ein Selbst-Stabilisierender Algorithmus Für Das Finite Sleep
Problem in Skip+ Graphen. Universität Paderborn, 2014.
short: L. Luo, Ein Selbst-Stabilisierender Algorithmus Für Das Finite Sleep Problem
in Skip+ Graphen, Universität Paderborn, 2014.
date_created: 2020-08-17T08:16:07Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+
Graphen
type: bachelorsthesis
user_id: '477'
year: '2014'
...
---
_id: '18002'
author:
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
citation:
ama: Hinnenthal K. Formbildung Selbstorganisierender Partikelsysteme.; 2014.
apa: Hinnenthal, K. (2014). Formbildung selbstorganisierender Partikelsysteme.
bibtex: '@book{Hinnenthal_2014, title={Formbildung selbstorganisierender Partikelsysteme},
author={Hinnenthal, Kristian}, year={2014} }'
chicago: Hinnenthal, Kristian. Formbildung Selbstorganisierender Partikelsysteme,
2014.
ieee: K. Hinnenthal, Formbildung selbstorganisierender Partikelsysteme. 2014.
mla: Hinnenthal, Kristian. Formbildung Selbstorganisierender Partikelsysteme.
2014.
short: K. Hinnenthal, Formbildung Selbstorganisierender Partikelsysteme, 2014.
date_created: 2020-08-17T08:17:00Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Formbildung selbstorganisierender Partikelsysteme
type: bachelorsthesis
user_id: '15504'
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'
...