---
_id: '7636'
abstract:
- lang: eng
text: "Self-stabilizing overlay networks have the advantage of being able to recover
from illegal states and faults. \r\nHowever, the majority of these networks cannot
give any guarantees on their functionality while the recovery process is going
on. \r\nWe are especially interested in searchability, i.e., the functionality
that search messages for a specific node are answered successfully if a node exists
in the network. \r\nIn this paper we investigate overlay networks that ensure
the maintenance of monotonic searchability while the self-stabilization is going
on. \r\nMore 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.\r\nWe
extend the existing research by focusing on skip graphs and present a solution
for two scenarios: (i) the goal topology is a super graph of the perfect skip
graph and (ii) the goal topology is exactly the perfect skip graph.\r\n"
author:
- first_name: Linghui
full_name: Luo, Linghui
last_name: Luo
- 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: 'Luo L, Scheideler C, Strothmann TF. MultiSkipGraph: A Self-stabilizing Overlay
Network that Maintains Monotonic Searchability. In: Proceedings of the 2019
IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19).
; 2019.'
apa: 'Luo, L., Scheideler, C., & Strothmann, T. F. (2019). MultiSkipGraph: A
Self-stabilizing Overlay Network that Maintains Monotonic Searchability. In Proceedings
of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS ’19). Rio de Janeiro, Brazil.'
bibtex: '@inproceedings{Luo_Scheideler_Strothmann_2019, title={MultiSkipGraph: A
Self-stabilizing Overlay Network that Maintains Monotonic Searchability}, booktitle={Proceedings
of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS ’19)}, author={Luo, Linghui and Scheideler, Christian and Strothmann, Thim
Frederik}, year={2019} }'
chicago: 'Luo, Linghui, Christian Scheideler, and Thim Frederik Strothmann. “MultiSkipGraph:
A Self-Stabilizing Overlay Network That Maintains Monotonic Searchability.” In
Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing
Symposium (IPDPS ’19), 2019.'
ieee: 'L. Luo, C. Scheideler, and T. F. Strothmann, “MultiSkipGraph: A Self-stabilizing
Overlay Network that Maintains Monotonic Searchability,” in Proceedings of
the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS ’19), Rio de Janeiro, Brazil, 2019.'
mla: 'Luo, Linghui, et al. “MultiSkipGraph: A Self-Stabilizing Overlay Network That
Maintains Monotonic Searchability.” Proceedings of the 2019 IEEE 33rd International
Parallel and Distributed Processing Symposium (IPDPS ’19), 2019.'
short: 'L. Luo, C. Scheideler, T.F. Strothmann, in: Proceedings of the 2019 IEEE
33rd International Parallel and Distributed Processing Symposium (IPDPS ’19),
2019.'
conference:
end_date: 2019-05-25
location: Rio de Janeiro, Brazil
name: 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS '19)
start_date: 2019-05-20
date_created: 2019-02-12T13:39:20Z
date_updated: 2022-01-06T07:03:42Z
ddc:
- '006'
department:
- _id: '66'
file:
- access_level: closed
content_type: application/pdf
creator: thim
date_created: 2019-02-12T13:37:35Z
date_updated: 2019-02-12T13:37:35Z
file_id: '7637'
file_name: IPDPS_main.pdf
file_size: 372026
relation: main_file
file_date_updated: 2019-02-12T13:37:35Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '1'
name: SFB 901
publication: Proceedings of the 2019 IEEE 33rd International Parallel and Distributed
Processing Symposium (IPDPS '19)
status: public
title: 'MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic
Searchability'
type: conference
user_id: '477'
year: '2019'
...
---
_id: '8543'
abstract:
- lang: eng
text: 'Dieser Artikel erörtert, ob in studentischen Kleingruppenprojekten in der
Informatik Kreativität und die Erarbeitung kreativer Ideen explizit gefördert
werden kann. Dazu wird ein Seminarkonzept detailliert vorgestellt, welches auf
zwei Grundkonzepten der Informatikpraxis beruht: agiles Projektvorgehen und Prototyping.
Die Teilnehmenden des Seminars wurden gezielt in einen Kreativitätsprozess geleitet,
indem sie für gegebene moderne Technologien (Virtual Reality, Augmented Reality,
Drohnen, etc.) neuartige Nutzungsszenarien entwickeln sollten. Um zu evaluieren,
ob das Lehrkonzept erfolgreich ist, wird sowohl die produktbezogene als auch die
prozessbezogene Kreativität betrachtet. Für die produktbezogene Kreativität werden
die von den Teilnehmenden erstellten Projektideen inklusive der benutzten Prototypingtechnik
vorgestellt und bewertet. Die Teilnehmenden haben nicht nur eine enorme Breite
an Ideen entwickelt (in der Summe ca. 40 bei 16 Teilnehmenden), sondern insbesondere
auch acht Ideen im Verlaufe des Seminars sehr konkret weiterentwickelt. Hinsichtlich
der prozessbezogenen Kreativität wird das Lehrkonzept durch mehrere Fragebögen
eruiert. Die Studierenden sind mit dem Seminar, der Herangehensweise und den Ergebnissen
sehr zufrieden, was unter anderem durch die äußerst positive studentische Veranstaltungskritik
(u.a. 1,0 für den Gesamteindruck sowie Atmosphäre in der Veranstaltung) und die
Auswertung der Evaluationsfragebögen unterstrichen wird. Auch von externen Beobachtern
werden die erarbeiteten Ergebnisse und der Einsatz von Prototyping als sehr positiv
bewertet.'
author:
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: Strothmann TF. Förderung von Kreativität in studentischen Kleingruppenprojekten
in der Informatik – Ein Prototyping-basierter Ansatz. die hochschullehre.
2019.
apa: Strothmann, T. F. (2019). Förderung von Kreativität in studentischen Kleingruppenprojekten
in der Informatik – Ein Prototyping-basierter Ansatz. Die Hochschullehre.
bibtex: '@article{Strothmann_2019, title={Förderung von Kreativität in studentischen
Kleingruppenprojekten in der Informatik – Ein Prototyping-basierter Ansatz}, journal={die
hochschullehre}, author={Strothmann, Thim Frederik}, year={2019} }'
chicago: Strothmann, Thim Frederik. “Förderung von Kreativität in Studentischen
Kleingruppenprojekten in Der Informatik – Ein Prototyping-Basierter Ansatz.” Die
Hochschullehre, 2019.
ieee: T. F. Strothmann, “Förderung von Kreativität in studentischen Kleingruppenprojekten
in der Informatik – Ein Prototyping-basierter Ansatz,” die hochschullehre,
2019.
mla: Strothmann, Thim Frederik. “Förderung von Kreativität in Studentischen Kleingruppenprojekten
in Der Informatik – Ein Prototyping-Basierter Ansatz.” Die Hochschullehre,
2019.
short: T.F. Strothmann, Die Hochschullehre (2019).
date_created: 2019-03-25T13:05:47Z
date_updated: 2022-01-06T07:03:56Z
department:
- _id: '66'
language:
- iso: eng
main_file_link:
- url: http://www.hochschullehre.org/wp-content/files/die_hochschullehre_2019_Strothmann.pdf
publication: die hochschullehre
status: public
title: Förderung von Kreativität in studentischen Kleingruppenprojekten in der Informatik
– Ein Prototyping-basierter Ansatz
type: journal_article
user_id: '11319'
year: '2019'
...
---
_id: '16361'
abstract:
- lang: ger
text: Sinnvolle und gebrauchstaugliche digitale Assistenzsysteme, die Beschäftigte
bei ihren alltäglichen Aufgaben unterstützen, stellen eine Herausforderung für
viele Organisationen hinsichtlich der individuellen und organisationalen Akzeptanz
einschließlich der Gebrauchstauglichkeit (Usability), dem Benutzererlebnis (User
Experience, UX) und „Arbeit 4.0“-Aspekten dar. Vorhandene Methoden des Software
Engineering sind nicht geeignet, Beschäftigte angemessen in die Gestaltung und
Entwicklung zu integrieren und Lösungskonzepte solcher Systeme auf Augenhöhe zu
betrachten. In diesem Beitrag wird eine leichtgewichtige Canvas-Methode vorgestellt,
die sich mit diesen Herausforderungen befasst. Sie umfasst die menschliche, die
geschäftliche sowie die technologische Perspektive in einem gemeinsamen Kommunikationsinstrument,
dem „Digital Assistance System Canvas“. Erste Evaluationen zeigen, dass die Teilnehmenden
das Canvas-Konzept schätzen und die Methode vielseitig in verschiedenen Szenarien
einsetzbar ist. Vielfältige Fragen in den Canvas-Bausteinen bereichern die gemeinsame
Diskussion über neue Systeme und die Verbesserung bzw. Sicherstellung der Akzeptanz
sowie die Denkweise in frühen Phasen des Design- und Entwicklungsprozesses.
author:
- first_name: Holger Gerhard
full_name: Fischer, Holger Gerhard
id: '30457'
last_name: Fischer
- first_name: Florian
full_name: Rittmeier, Florian
id: '5281'
last_name: Rittmeier
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
- first_name: Nina
full_name: Schwenniger, Nina
last_name: Schwenniger
citation:
ama: 'Fischer HG, Rittmeier F, Strothmann TF, Schwenniger N. Partizipation von Beschäftigten
in der Gestaltung einer digitalisierten Arbeitswelt 4.0 mittels einer Canvas-Methode.
In: Bosse CK, Zink KJ, eds. Arbeit 4.0 im Mittelstand. Berlin, Heidelberg:
Springer Gabler; 2019. doi:10.1007/978-3-662-59474-2_11'
apa: 'Fischer, H. G., Rittmeier, F., Strothmann, T. F., & Schwenniger, N. (2019).
Partizipation von Beschäftigten in der Gestaltung einer digitalisierten Arbeitswelt
4.0 mittels einer Canvas-Methode. In C. K. Bosse & K. J. Zink (Eds.), Arbeit
4.0 im Mittelstand. Berlin, Heidelberg: Springer Gabler. https://doi.org/10.1007/978-3-662-59474-2_11'
bibtex: '@inbook{Fischer_Rittmeier_Strothmann_Schwenniger_2019, place={Berlin, Heidelberg},
title={Partizipation von Beschäftigten in der Gestaltung einer digitalisierten
Arbeitswelt 4.0 mittels einer Canvas-Methode}, DOI={10.1007/978-3-662-59474-2_11},
booktitle={Arbeit 4.0 im Mittelstand}, publisher={Springer Gabler}, author={Fischer,
Holger Gerhard and Rittmeier, Florian and Strothmann, Thim Frederik and Schwenniger,
Nina}, editor={Bosse, Christian K. and Zink, Klaus J.Editors}, year={2019} }'
chicago: 'Fischer, Holger Gerhard, Florian Rittmeier, Thim Frederik Strothmann,
and Nina Schwenniger. “Partizipation von Beschäftigten in der Gestaltung einer
digitalisierten Arbeitswelt 4.0 mittels einer Canvas-Methode.” In Arbeit 4.0
im Mittelstand, edited by Christian K. Bosse and Klaus J. Zink. Berlin, Heidelberg:
Springer Gabler, 2019. https://doi.org/10.1007/978-3-662-59474-2_11.'
ieee: 'H. G. Fischer, F. Rittmeier, T. F. Strothmann, and N. Schwenniger, “Partizipation
von Beschäftigten in der Gestaltung einer digitalisierten Arbeitswelt 4.0 mittels
einer Canvas-Methode,” in Arbeit 4.0 im Mittelstand, C. K. Bosse and K.
J. Zink, Eds. Berlin, Heidelberg: Springer Gabler, 2019.'
mla: Fischer, Holger Gerhard, et al. “Partizipation von Beschäftigten in der Gestaltung
einer digitalisierten Arbeitswelt 4.0 mittels einer Canvas-Methode.” Arbeit
4.0 im Mittelstand, edited by Christian K. Bosse and Klaus J. Zink, Springer
Gabler, 2019, doi:10.1007/978-3-662-59474-2_11.
short: 'H.G. Fischer, F. Rittmeier, T.F. Strothmann, N. Schwenniger, in: C.K. Bosse,
K.J. Zink (Eds.), Arbeit 4.0 im Mittelstand, Springer Gabler, Berlin, Heidelberg,
2019.'
date_created: 2020-04-01T15:34:53Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '66'
- _id: '534'
doi: 10.1007/978-3-662-59474-2_11
editor:
- first_name: Christian K.
full_name: Bosse, Christian K.
last_name: Bosse
- first_name: Klaus J.
full_name: Zink, Klaus J.
last_name: Zink
language:
- iso: ger
place: Berlin, Heidelberg
publication: Arbeit 4.0 im Mittelstand
publication_identifier:
isbn:
- '9783662594735'
- '9783662594742'
publication_status: published
publisher: Springer Gabler
status: public
title: Partizipation von Beschäftigten in der Gestaltung einer digitalisierten Arbeitswelt
4.0 mittels einer Canvas-Methode
type: book_chapter
user_id: '5281'
year: '2019'
...
---
_id: '1163'
abstract:
- lang: eng
text: "In this paper we present two major results:\r\nFirst, we introduce the first
self-stabilizing version of a supervised overlay network (as introduced in~\\cite{DBLP:conf/ispan/KothapalliS05})
by presenting a self-stabilizing supervised skip ring.\r\nSecondly, we show how
to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing
publish-subscribe system.\r\nThat is, in addition to stabilizing the overlay network,
every subscriber of a topic will eventually know all of the publications that
have been issued so far for that topic. The communication work needed to processes
a subscribe or unsubscribe operation is just a constant in a legitimate state,
and the communication work of checking whether the system is still in a legitimate
state is just a constant on expectation for the supervisor as well as any process
in the system.\r\n"
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
- 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: 'Feldmann M, Kolb C, Scheideler C, Strothmann TF. Self-Stabilizing Supervised
Publish-Subscribe Systems. In: Proceedings of the 32nd IEEE International Parallel
& Distributed Processing Symposium (IPDPS). IEEE; 2018. doi:10.1109/IPDPS.2018.00114'
apa: 'Feldmann, M., Kolb, C., Scheideler, C., & Strothmann, T. F. (2018). Self-Stabilizing
Supervised Publish-Subscribe Systems. In Proceedings of the 32nd IEEE International
Parallel & Distributed Processing Symposium (IPDPS). Vancouver: IEEE.
https://doi.org/10.1109/IPDPS.2018.00114'
bibtex: '@inproceedings{Feldmann_Kolb_Scheideler_Strothmann_2018, title={Self-Stabilizing
Supervised Publish-Subscribe Systems}, DOI={10.1109/IPDPS.2018.00114},
booktitle={Proceedings of the 32nd IEEE International Parallel & Distributed
Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and
Kolb, Christina and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018}
}'
chicago: Feldmann, Michael, Christina Kolb, Christian Scheideler, and Thim Frederik
Strothmann. “Self-Stabilizing Supervised Publish-Subscribe Systems.” In Proceedings
of the 32nd IEEE International Parallel & Distributed Processing Symposium
(IPDPS). IEEE, 2018. https://doi.org/10.1109/IPDPS.2018.00114.
ieee: M. Feldmann, C. Kolb, C. Scheideler, and T. F. Strothmann, “Self-Stabilizing
Supervised Publish-Subscribe Systems,” in Proceedings of the 32nd IEEE International
Parallel & Distributed Processing Symposium (IPDPS), Vancouver, 2018.
mla: Feldmann, Michael, et al. “Self-Stabilizing Supervised Publish-Subscribe Systems.”
Proceedings of the 32nd IEEE International Parallel & Distributed Processing
Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00114.
short: 'M. Feldmann, C. Kolb, C. Scheideler, T.F. Strothmann, in: Proceedings of
the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS),
IEEE, 2018.'
conference:
end_date: 2018-5-24
location: Vancouver
name: 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)
start_date: 2018-5-22
date_created: 2018-02-01T13:56:01Z
date_updated: 2022-01-06T06:51:05Z
ddc:
- '040'
department:
- _id: '79'
- _id: '66'
doi: 10.1109/IPDPS.2018.00114
external_id:
arxiv:
- '1710.08128'
file:
- access_level: closed
content_type: application/pdf
creator: mfeldma2
date_created: 2018-10-31T13:25:37Z
date_updated: 2018-10-31T13:25:37Z
file_id: '5211'
file_name: 08425258.pdf
file_size: 239559
relation: main_file
success: 1
file_date_updated: 2018-10-31T13:25:37Z
has_accepted_license: '1'
keyword:
- Topological Self-stabilization
- Supervised Overlay
- Publish-Subscribe System
language:
- iso: eng
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 32nd IEEE International Parallel & Distributed Processing
Symposium (IPDPS)
publisher: IEEE
status: public
title: Self-Stabilizing Supervised Publish-Subscribe Systems
type: conference
user_id: '11319'
year: '2018'
...
---
_id: '1796'
author:
- first_name: Joshua
full_name: J. Daymude, Joshua
last_name: J. Daymude
- 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: J. Daymude J, Derakhshandeh Z, Gmyr R, et al. On the runtime of universal coating
for programmable matter. Natural Computing. 2018;(1):81--96. doi:10.1007/s11047-017-9658-6
apa: J. Daymude, J., Derakhshandeh, Z., Gmyr, R., Porter, A., W. Richa, A., Scheideler,
C., & Strothmann, T. F. (2018). On the runtime of universal coating for programmable
matter. Natural Computing, (1), 81--96. https://doi.org/10.1007/s11047-017-9658-6
bibtex: '@article{J. Daymude_Derakhshandeh_Gmyr_Porter_W. Richa_Scheideler_Strothmann_2018,
title={On the runtime of universal coating for programmable matter}, DOI={10.1007/s11047-017-9658-6},
number={1}, journal={Natural Computing}, author={J. Daymude, Joshua and Derakhshandeh,
Zahra and Gmyr, Robert and Porter, Alexandra and W. Richa, Andrea and Scheideler,
Christian and Strothmann, Thim Frederik}, year={2018}, pages={81--96} }'
chicago: 'J. Daymude, Joshua, Zahra Derakhshandeh, Robert Gmyr, Alexandra Porter,
Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “On the Runtime
of Universal Coating for Programmable Matter.” Natural Computing, no. 1
(2018): 81--96. https://doi.org/10.1007/s11047-017-9658-6.'
ieee: J. J. Daymude et al., “On the runtime of universal coating for programmable
matter,” Natural Computing, no. 1, pp. 81--96, 2018.
mla: J. Daymude, Joshua, et al. “On the Runtime of Universal Coating for Programmable
Matter.” Natural Computing, no. 1, 2018, pp. 81--96, doi:10.1007/s11047-017-9658-6.
short: J. J. Daymude, Z. Derakhshandeh, R. Gmyr, A. Porter, A. W. Richa, C. Scheideler,
T.F. Strothmann, Natural Computing (2018) 81--96.
date_created: 2018-03-27T06:23:58Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '79'
- _id: '66'
doi: 10.1007/s11047-017-9658-6
issue: '1'
language:
- iso: eng
page: 81--96
publication: Natural Computing
status: public
title: On the runtime of universal coating for programmable matter
type: journal_article
user_id: '11319'
year: '2018'
...
---
_id: '5764'
author:
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
- first_name: Irina
full_name: Kostitsyna, Irina
last_name: Kostitsyna
- first_name: Fabian
full_name: Kuhn, Fabian
last_name: Kuhn
- first_name: Dorian
full_name: Rudolph, Dorian
last_name: Rudolph
- 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: 'Gmyr R, Hinnenthal K, Kostitsyna I, et al. Forming Tile Shapes with Simple
Robots. In: Proceedings of the 24th International Conference on DNA Computing
and Molecular Programming. Springer International Publishing; 2018:122-138.
doi:10.1007/978-3-030-00030-1_8'
apa: Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., Scheideler,
C., & Strothmann, T. F. (2018). Forming Tile Shapes with Simple Robots. In
Proceedings of the 24th International Conference on DNA Computing and Molecular
Programming (pp. 122–138). Springer International Publishing. https://doi.org/10.1007/978-3-030-00030-1_8
bibtex: '@inproceedings{Gmyr_Hinnenthal_Kostitsyna_Kuhn_Rudolph_Scheideler_Strothmann_2018,
title={Forming Tile Shapes with Simple Robots}, DOI={10.1007/978-3-030-00030-1_8},
booktitle={Proceedings of the 24th International Conference on DNA Computing and
Molecular Programming}, publisher={Springer International Publishing}, author={Gmyr,
Robert and Hinnenthal, Kristian and Kostitsyna, Irina and Kuhn, Fabian and Rudolph,
Dorian and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018},
pages={122–138} }'
chicago: Gmyr, Robert, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian
Rudolph, Christian Scheideler, and Thim Frederik Strothmann. “Forming Tile Shapes
with Simple Robots.” In Proceedings of the 24th International Conference on
DNA Computing and Molecular Programming, 122–38. Springer International Publishing,
2018. https://doi.org/10.1007/978-3-030-00030-1_8.
ieee: R. Gmyr et al., “Forming Tile Shapes with Simple Robots,” in Proceedings
of the 24th International Conference on DNA Computing and Molecular Programming,
2018, pp. 122–138.
mla: Gmyr, Robert, et al. “Forming Tile Shapes with Simple Robots.” Proceedings
of the 24th International Conference on DNA Computing and Molecular Programming,
Springer International Publishing, 2018, pp. 122–38, doi:10.1007/978-3-030-00030-1_8.
short: 'R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, C. Scheideler,
T.F. Strothmann, in: Proceedings of the 24th International Conference on DNA Computing
and Molecular Programming, Springer International Publishing, 2018, pp. 122–138.'
date_created: 2018-11-19T15:35:45Z
date_updated: 2022-01-06T07:02:38Z
department:
- _id: '79'
- _id: '66'
doi: 10.1007/978-3-030-00030-1_8
language:
- iso: eng
page: 122-138
publication: Proceedings of the 24th International Conference on DNA Computing and
Molecular Programming
publication_status: published
publisher: Springer International Publishing
status: public
title: Forming Tile Shapes with Simple Robots
type: conference
user_id: '11319'
year: '2018'
...
---
_id: '5796'
author:
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
- first_name: Alexander
full_name: Teetz, Alexander
last_name: Teetz
citation:
ama: 'Engels G, Strothmann TF, Teetz A. Adapt Cases 4 BPM - A Modeling Framework
for Process Flexibility in IIoT. In: 2018 IEEE 22nd International Enterprise
Distributed Object Computing Workshop (EDOCW). IEEE; 2018. doi:10.1109/edocw.2018.00020'
apa: Engels, G., Strothmann, T. F., & Teetz, A. (2018). Adapt Cases 4 BPM -
A Modeling Framework for Process Flexibility in IIoT. In 2018 IEEE 22nd International
Enterprise Distributed Object Computing Workshop (EDOCW). IEEE. https://doi.org/10.1109/edocw.2018.00020
bibtex: '@inproceedings{Engels_Strothmann_Teetz_2018, title={Adapt Cases 4 BPM -
A Modeling Framework for Process Flexibility in IIoT}, DOI={10.1109/edocw.2018.00020},
booktitle={2018 IEEE 22nd International Enterprise Distributed Object Computing
Workshop (EDOCW)}, publisher={IEEE}, author={Engels, Gregor and Strothmann, Thim
Frederik and Teetz, Alexander}, year={2018} }'
chicago: Engels, Gregor, Thim Frederik Strothmann, and Alexander Teetz. “Adapt Cases
4 BPM - A Modeling Framework for Process Flexibility in IIoT.” In 2018 IEEE
22nd International Enterprise Distributed Object Computing Workshop (EDOCW).
IEEE, 2018. https://doi.org/10.1109/edocw.2018.00020.
ieee: G. Engels, T. F. Strothmann, and A. Teetz, “Adapt Cases 4 BPM - A Modeling
Framework for Process Flexibility in IIoT,” in 2018 IEEE 22nd International
Enterprise Distributed Object Computing Workshop (EDOCW), 2018.
mla: Engels, Gregor, et al. “Adapt Cases 4 BPM - A Modeling Framework for Process
Flexibility in IIoT.” 2018 IEEE 22nd International Enterprise Distributed Object
Computing Workshop (EDOCW), IEEE, 2018, doi:10.1109/edocw.2018.00020.
short: 'G. Engels, T.F. Strothmann, A. Teetz, in: 2018 IEEE 22nd International Enterprise
Distributed Object Computing Workshop (EDOCW), IEEE, 2018.'
date_created: 2018-11-21T12:45:53Z
date_updated: 2022-01-06T07:02:41Z
department:
- _id: '66'
doi: 10.1109/edocw.2018.00020
language:
- iso: eng
publication: 2018 IEEE 22nd International Enterprise Distributed Object Computing
Workshop (EDOCW)
publication_identifier:
isbn:
- '9781538641415'
publication_status: published
publisher: IEEE
status: public
title: Adapt Cases 4 BPM - A Modeling Framework for Process Flexibility in IIoT
type: conference
user_id: '11319'
year: '2018'
...
---
_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: '1814'
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
coating for programmable matter. Theor Comput Sci. 2017:56--68. doi:10.1016/j.tcs.2016.02.039
apa: Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., & Strothmann,
T. F. (2017). Universal coating for programmable matter. Theor. Comput. Sci.,
56--68. https://doi.org/10.1016/j.tcs.2016.02.039
bibtex: '@article{Derakhshandeh_Gmyr_W. Richa_Scheideler_Strothmann_2017, title={Universal
coating for programmable matter}, DOI={10.1016/j.tcs.2016.02.039},
journal={Theor. Comput. Sci.}, author={Derakhshandeh, Zahra and Gmyr, Robert and
W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2017},
pages={56--68} }'
chicago: Derakhshandeh, Zahra, Robert Gmyr, Andrea W. Richa, Christian Scheideler,
and Thim Frederik Strothmann. “Universal Coating for Programmable Matter.” Theor.
Comput. Sci., 2017, 56--68. https://doi.org/10.1016/j.tcs.2016.02.039.
ieee: Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann,
“Universal coating for programmable matter,” Theor. Comput. Sci., pp. 56--68,
2017.
mla: Derakhshandeh, Zahra, et al. “Universal Coating for Programmable Matter.” Theor.
Comput. Sci., 2017, pp. 56--68, doi:10.1016/j.tcs.2016.02.039.
short: Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, Theor.
Comput. Sci. (2017) 56--68.
date_created: 2018-03-27T11:24:57Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '79'
doi: 10.1016/j.tcs.2016.02.039
language:
- iso: eng
page: 56--68
publication: Theor. Comput. Sci.
status: public
title: Universal coating for programmable matter
type: journal_article
user_id: '15504'
year: '2017'
...
---
_id: '1815'
author:
- first_name: Joshua
full_name: J. Daymude, Joshua
last_name: J. Daymude
- 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: 'J. Daymude J, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. Improved Leader
Election for Self-organizing Programmable Matter. In: Algorithms for Sensor
Systems - 13th International Symposium on Algorithms and Experiments for Wireless
Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised
Selected Papers. ; 2017:127--140. doi:10.1007/978-3-319-72751-6_10'
apa: J. Daymude, J., Gmyr, R., W. Richa, A., Scheideler, C., & Strothmann, T.
F. (2017). Improved Leader Election for Self-organizing Programmable Matter. In
Algorithms for Sensor Systems - 13th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria,
September 7-8, 2017, Revised Selected Papers (pp. 127--140). https://doi.org/10.1007/978-3-319-72751-6_10
bibtex: '@inproceedings{J. Daymude_Gmyr_W. Richa_Scheideler_Strothmann_2017, title={Improved
Leader Election for Self-organizing Programmable Matter}, DOI={10.1007/978-3-319-72751-6_10},
booktitle={Algorithms for Sensor Systems - 13th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria,
September 7-8, 2017, Revised Selected Papers}, author={J. Daymude, Joshua and
Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim
Frederik}, year={2017}, pages={127--140} }'
chicago: J. Daymude, Joshua, Robert Gmyr, Andrea W. Richa, Christian Scheideler,
and Thim Frederik Strothmann. “Improved Leader Election for Self-Organizing Programmable
Matter.” In Algorithms for Sensor Systems - 13th International Symposium on
Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna,
Austria, September 7-8, 2017, Revised Selected Papers, 127--140, 2017. https://doi.org/10.1007/978-3-319-72751-6_10.
ieee: J. J. Daymude, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann,
“Improved Leader Election for Self-organizing Programmable Matter,” in Algorithms
for Sensor Systems - 13th International Symposium on Algorithms and Experiments
for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8,
2017, Revised Selected Papers, 2017, pp. 127--140.
mla: J. Daymude, Joshua, et al. “Improved Leader Election for Self-Organizing Programmable
Matter.” Algorithms for Sensor Systems - 13th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria,
September 7-8, 2017, Revised Selected Papers, 2017, pp. 127--140, doi:10.1007/978-3-319-72751-6_10.
short: 'J. J. Daymude, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, in:
Algorithms for Sensor Systems - 13th International Symposium on Algorithms and
Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September
7-8, 2017, Revised Selected Papers, 2017, pp. 127--140.'
date_created: 2018-03-27T11:25:58Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '79'
doi: 10.1007/978-3-319-72751-6_10
language:
- iso: eng
page: 127--140
publication: Algorithms for Sensor Systems - 13th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria,
September 7-8, 2017, Revised Selected Papers
status: public
title: Improved Leader Election for Self-organizing Programmable Matter
type: conference
user_id: '15504'
year: '2017'
...
---
_id: '61'
author:
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: Strothmann TF. Self-* Algorithms for Distributed Systems. Universität
Paderborn; 2017. doi:10.17619/UNIPB/1-150
apa: Strothmann, T. F. (2017). Self-* Algorithms for Distributed Systems.
Universität Paderborn. https://doi.org/10.17619/UNIPB/1-150
bibtex: '@book{Strothmann_2017, title={Self-* Algorithms for Distributed Systems},
DOI={10.17619/UNIPB/1-150},
publisher={Universität Paderborn}, author={Strothmann, Thim Frederik}, year={2017}
}'
chicago: Strothmann, Thim Frederik. Self-* Algorithms for Distributed Systems.
Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-150.
ieee: T. F. Strothmann, Self-* Algorithms for Distributed Systems. Universität
Paderborn, 2017.
mla: Strothmann, Thim Frederik. Self-* Algorithms for Distributed Systems.
Universität Paderborn, 2017, doi:10.17619/UNIPB/1-150.
short: T.F. Strothmann, Self-* Algorithms for Distributed Systems, Universität Paderborn,
2017.
date_created: 2017-10-17T12:41:03Z
date_updated: 2022-01-06T07:02:52Z
department:
- _id: '79'
doi: 10.17619/UNIPB/1-150
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Self-* Algorithms for Distributed Systems
type: dissertation
user_id: '477'
year: '2017'
...
---
_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: '5762'
abstract:
- lang: eng
text: "This paper introduces the problem of communication pattern adaption for a
distributed self-adjusting binary search tree. We propose a simple local algorithm
that is closely related to the over thirty-year-old idea of splay trees and evaluate
its adaption performance in the distributed scenario if different communication
patterns are provided. \r\nTo do so, the process of self-adjustment is modeled
similarly to a basic network creation game in which the nodes want to communicate
with only a certain subset of all nodes. \r\nWe show that, in general, the game
(i.e., the process of local adjustments) does not converge, and that convergence
is related to certain structures of the communication interests, which we call
conflicts. \r\nWe classify conflicts and show that for two communication scenarios
in which convergence is guaranteed, the self-adjusting tree performs well. \r\nFurthermore,
we investigate the different classes of conflicts separately and show that, for
a certain class of conflicts, the performance of the tree network is asymptotically
as good as the performance for converging instances.\r\nHowever, for the other
conflict classes, a distributed self-adjusting binary search tree adapts poorly."
author:
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: Strothmann TF. The Impact of Communication Patterns on Distributed Self-Adjusting
Binary Search Tree. Journal of Graph Algorithms and Applications. 2016;20(1):79-100.
doi:10.7155/jgaa.00385
apa: Strothmann, T. F. (2016). The Impact of Communication Patterns on Distributed
Self-Adjusting Binary Search Tree. Journal of Graph Algorithms and Applications,
20(1), 79–100. https://doi.org/10.7155/jgaa.00385
bibtex: '@article{Strothmann_2016, title={The Impact of Communication Patterns on
Distributed Self-Adjusting Binary Search Tree}, volume={20}, DOI={10.7155/jgaa.00385},
number={1}, journal={Journal of Graph Algorithms and Applications}, publisher={Journal
of Graph Algorithms and Applications}, author={Strothmann, Thim Frederik}, year={2016},
pages={79–100} }'
chicago: 'Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed
Self-Adjusting Binary Search Tree.” Journal of Graph Algorithms and Applications
20, no. 1 (2016): 79–100. https://doi.org/10.7155/jgaa.00385.'
ieee: T. F. Strothmann, “The Impact of Communication Patterns on Distributed Self-Adjusting
Binary Search Tree,” Journal of Graph Algorithms and Applications, vol.
20, no. 1, pp. 79–100, 2016.
mla: Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed
Self-Adjusting Binary Search Tree.” Journal of Graph Algorithms and Applications,
vol. 20, no. 1, Journal of Graph Algorithms and Applications, 2016, pp. 79–100,
doi:10.7155/jgaa.00385.
short: T.F. Strothmann, Journal of Graph Algorithms and Applications 20 (2016) 79–100.
date_created: 2018-11-19T15:33:50Z
date_updated: 2022-01-06T07:02:38Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.7155/jgaa.00385
file:
- access_level: closed
content_type: application/pdf
creator: thim
date_created: 2018-11-27T11:58:08Z
date_updated: 2018-11-27T11:58:08Z
file_id: '5912'
file_name: Strothmann2016.20.1.pdf
file_size: 2324066
relation: main_file
success: 1
file_date_updated: 2018-11-27T11:58:08Z
has_accepted_license: '1'
intvolume: ' 20'
issue: '1'
language:
- iso: eng
page: 79-100
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Journal of Graph Algorithms and Applications
publication_identifier:
issn:
- 1526-1719
publication_status: published
publisher: Journal of Graph Algorithms and Applications
quality_controlled: '1'
status: public
title: The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search
Tree
type: journal_article
user_id: '477'
volume: 20
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: '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: '243'
abstract:
- lang: eng
text: This paper introduces the problem of communication pattern adaption for a
distributed self-adjusting binary search tree. We propose a simple local algorithm,
which is closely related to the nearly thirty-year-old idea of splay trees and
evaluate its adaption performance in the distributed scenario if different communication
patterns are provided.To do so, the process of self-adjustment is modeled similarly
to a basic network creation game, in which the nodes want to communicate with
only a certain subset of all nodes. We show that, in general, the game (i.e.,
the process of local adjustments) does not converge, and convergence is related
to certain structures of the communication interests, which we call conflicts.We
classify conflicts and show that for two communication scenarios in which convergence
is guaranteed, the self-adjusting tree performs well.Furthermore, we investigate
the different classes of conflicts separately and show that, for a certain class
of conflicts, the performance of the tree network is asymptotically as good as
the performance for converging instances. However, for the other conflict classes,
a distributed self-adjusting binary search tree adapts poorly.
author:
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Strothmann TF. The impact of communication patterns on distributed locally
self-adjusting binary search trees. In: Proceedings of the 9th International
Workshop on Algorithms and Computation (WALCOM). LNCS. ; 2015:175--186. doi:10.1007/978-3-319-15612-5_16'
apa: Strothmann, T. F. (2015). The impact of communication patterns on distributed
locally self-adjusting binary search trees. In Proceedings of the 9th International
Workshop on Algorithms and Computation (WALCOM) (pp. 175--186). https://doi.org/10.1007/978-3-319-15612-5_16
bibtex: '@inproceedings{Strothmann_2015, series={LNCS}, title={The impact of communication
patterns on distributed locally self-adjusting binary search trees}, DOI={10.1007/978-3-319-15612-5_16},
booktitle={Proceedings of the 9th International Workshop on Algorithms and Computation
(WALCOM)}, author={Strothmann, Thim Frederik}, year={2015}, pages={175--186},
collection={LNCS} }'
chicago: Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed
Locally Self-Adjusting Binary Search Trees.” In Proceedings of the 9th International
Workshop on Algorithms and Computation (WALCOM), 175--186. LNCS, 2015. https://doi.org/10.1007/978-3-319-15612-5_16.
ieee: T. F. Strothmann, “The impact of communication patterns on distributed locally
self-adjusting binary search trees,” in Proceedings of the 9th International
Workshop on Algorithms and Computation (WALCOM), 2015, pp. 175--186.
mla: Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed
Locally Self-Adjusting Binary Search Trees.” Proceedings of the 9th International
Workshop on Algorithms and Computation (WALCOM), 2015, pp. 175--186, doi:10.1007/978-3-319-15612-5_16.
short: 'T.F. Strothmann, in: Proceedings of the 9th International Workshop on Algorithms
and Computation (WALCOM), 2015, pp. 175--186.'
date_created: 2017-10-17T12:41:39Z
date_updated: 2022-01-06T06:56:17Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-15612-5_16
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:59:00Z
date_updated: 2018-03-21T09:59:00Z
file_id: '1495'
file_name: 243-Strothmann-Walcom2015.pdf
file_size: 1003113
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:59:00Z
has_accepted_license: '1'
language:
- iso: eng
page: 175--186
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 9th International Workshop on Algorithms and Computation
(WALCOM)
series_title: LNCS
status: public
title: The impact of communication patterns on distributed locally self-adjusting
binary search trees
type: conference
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'
...