---
_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: '105'
abstract:
- lang: eng
text: We initiate the study of network monitoring algorithms in a class of hybrid
networks in which the nodes are connected by an external network and an internal
network (as a short form for externally and internally controlled network). While
the external network lies outside of the control of the nodes (or in our case,
the monitoring protocol running in them) and might be exposed to continuous changes,
the internal network is fully under the control of the nodes. As an example, consider
a group of users with mobile devices having access to the cell phone infrastructure.
While the network formed by the WiFi connections of the devices is an external
network (as its structure is not necessarily under the control of the monitoring
protocol), the connections between the devices via the cell phone infrastructure
represent an internal network (as it can be controlled by the monitoring protocol).
Our goal is to continuously monitor properties of the external network with the
help of the internal network. We present scalable distributed algorithms that
efficiently monitor the number of edges, the average node degree, the clustering
coefficient, the bipartiteness, and the weight of a minimum spanning tree. Their
performance bounds demonstrate that monitoring the external network state with
the help of an internal network can be done much more efficiently than just using
the external network, as is usually done in the literature.
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: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: 'Gmyr R, Hinnenthal K, Scheideler C, Sohler C. Distributed Monitoring of Network
Properties: The Power of Hybrid Networks. In: Proceedings of the 44th International
Colloquium on Automata, Languages, and Programming (ICALP). Leibniz International
Proceedings in Informatics (LIPIcs). ; 2017:137:1--137:15. doi:10.4230/LIPIcs.ICALP.2017.137'
apa: 'Gmyr, R., Hinnenthal, K., Scheideler, C., & Sohler, C. (2017). Distributed
Monitoring of Network Properties: The Power of Hybrid Networks. In Proceedings
of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)
(pp. 137:1--137:15). https://doi.org/10.4230/LIPIcs.ICALP.2017.137'
bibtex: '@inproceedings{Gmyr_Hinnenthal_Scheideler_Sohler_2017, series={Leibniz
International Proceedings in Informatics (LIPIcs)}, title={Distributed Monitoring
of Network Properties: The Power of Hybrid Networks}, DOI={10.4230/LIPIcs.ICALP.2017.137},
booktitle={Proceedings of the 44th International Colloquium on Automata, Languages,
and Programming (ICALP)}, author={Gmyr, Robert and Hinnenthal, Kristian and Scheideler,
Christian and Sohler, Christian}, year={2017}, pages={137:1--137:15}, collection={Leibniz
International Proceedings in Informatics (LIPIcs)} }'
chicago: 'Gmyr, Robert, Kristian Hinnenthal, Christian Scheideler, and Christian
Sohler. “Distributed Monitoring of Network Properties: The Power of Hybrid Networks.”
In Proceedings of the 44th International Colloquium on Automata, Languages,
and Programming (ICALP), 137:1--137:15. Leibniz International Proceedings
in Informatics (LIPIcs), 2017. https://doi.org/10.4230/LIPIcs.ICALP.2017.137.'
ieee: 'R. Gmyr, K. Hinnenthal, C. Scheideler, and C. Sohler, “Distributed Monitoring
of Network Properties: The Power of Hybrid Networks,” in Proceedings of the
44th International Colloquium on Automata, Languages, and Programming (ICALP),
2017, pp. 137:1--137:15.'
mla: 'Gmyr, Robert, et al. “Distributed Monitoring of Network Properties: The Power
of Hybrid Networks.” Proceedings of the 44th International Colloquium on Automata,
Languages, and Programming (ICALP), 2017, pp. 137:1--137:15, doi:10.4230/LIPIcs.ICALP.2017.137.'
short: 'R. Gmyr, K. Hinnenthal, C. Scheideler, C. Sohler, in: Proceedings of the
44th International Colloquium on Automata, Languages, and Programming (ICALP),
2017, pp. 137:1--137:15.'
date_created: 2017-10-17T12:41:12Z
date_updated: 2022-01-06T06:50:42Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.4230/LIPIcs.ICALP.2017.137
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-13T09:23:11Z
date_updated: 2018-03-13T09:23:11Z
file_id: '1207'
file_name: 105-ICALP17-GHSS.pdf
file_size: 504161
relation: main_file
success: 1
file_date_updated: 2018-03-13T09:23:11Z
has_accepted_license: '1'
language:
- iso: eng
page: 137:1--137:15
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 44th International Colloquium on Automata, Languages,
and Programming (ICALP)
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: 'Distributed Monitoring of Network Properties: The Power of Hybrid Networks'
type: conference
user_id: '20792'
year: '2017'
...
---
_id: '125'
abstract:
- lang: eng
text: 'Searching for other participants is one of the most important operations
in a distributed system.We are interested in topologies in which it is possible
to route a packet in a fixed number of hops until it arrives at its destination.Given
a constant $d$, this paper introduces a new self-stabilizing protocol for the
$q$-ary $d$-dimensional de Bruijn graph ($q = \sqrt[d]{n}$) that is able to route
any search request in at most $d$ hops w.h.p., while significantly lowering the
node degree compared to the clique: We require nodes to have a degree of $\mathcal
O(\sqrt[d]{n})$, which is asymptotically optimal for a fixed diameter $d$.The
protocol keeps the expected amount of edge redirections per node in $\mathcal
O(\sqrt[d]{n})$, when the number of nodes in the system increases by factor $2^d$.The
number of messages that are periodically sent out by nodes is constant.'
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Feldmann M, Scheideler C. A Self-Stabilizing General De Bruijn Graph. In:
Proceedings of the 19th International Symposium on Stabilization, Safety, and
Security of Distributed Systems (SSS). Vol 10616. Lecture Notes in Computer
Science. Springer, Cham; 2017:250-264. doi:10.1007/978-3-319-69084-1_17'
apa: Feldmann, M., & Scheideler, C. (2017). A Self-Stabilizing General De Bruijn
Graph. In Proceedings of the 19th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS) (Vol. 10616, pp. 250–264).
Springer, Cham. https://doi.org/10.1007/978-3-319-69084-1_17
bibtex: '@inproceedings{Feldmann_Scheideler_2017, series={Lecture Notes in Computer
Science}, title={A Self-Stabilizing General De Bruijn Graph}, volume={10616},
DOI={10.1007/978-3-319-69084-1_17},
booktitle={Proceedings of the 19th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann,
Michael and Scheideler, Christian}, year={2017}, pages={250–264}, collection={Lecture
Notes in Computer Science} }'
chicago: Feldmann, Michael, and Christian Scheideler. “A Self-Stabilizing General
De Bruijn Graph.” In Proceedings of the 19th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS), 10616:250–64. Lecture Notes
in Computer Science. Springer, Cham, 2017. https://doi.org/10.1007/978-3-319-69084-1_17.
ieee: M. Feldmann and C. Scheideler, “A Self-Stabilizing General De Bruijn Graph,”
in Proceedings of the 19th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS), 2017, vol. 10616, pp. 250–264.
mla: Feldmann, Michael, and Christian Scheideler. “A Self-Stabilizing General De
Bruijn Graph.” Proceedings of the 19th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS), vol. 10616, Springer, Cham,
2017, pp. 250–64, doi:10.1007/978-3-319-69084-1_17.
short: 'M. Feldmann, C. Scheideler, in: Proceedings of the 19th International Symposium
on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer,
Cham, 2017, pp. 250–264.'
date_created: 2017-10-17T12:41:16Z
date_updated: 2022-01-06T06:51:19Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-69084-1_17
external_id:
arxiv:
- '1708.06542'
file:
- access_level: closed
content_type: application/pdf
creator: mfeldma2
date_created: 2018-10-31T13:30:13Z
date_updated: 2018-10-31T13:30:13Z
file_id: '5214'
file_name: Feldmann-Scheideler2017_Chapter_ASelf-stabilizingGeneralDeBrui.pdf
file_size: 311204
relation: main_file
success: 1
file_date_updated: 2018-10-31T13:30:13Z
has_accepted_license: '1'
intvolume: ' 10616'
language:
- iso: eng
page: '250-264 '
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 Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
publication_identifier:
isbn:
- 978-3-319-69083-4
publication_status: published
publisher: Springer, Cham
series_title: Lecture Notes in Computer Science
status: public
title: A Self-Stabilizing General De Bruijn Graph
type: conference
user_id: '23538'
volume: 10616
year: '2017'
...
---
_id: '3422'
abstract:
- lang: eng
text: "We study the consensus problem in a synchronous distributed system of n nodes
under an adaptive adversary that has a slightly outdated view of the system and
can block all incoming and outgoing communication of a constant fraction of the
nodes in each round. Motivated by a result of Ben-Or and Bar-Joseph (1998), showing
that any consensus algorithm that is resilient against a linear number of crash
faults requires $\\tilde \\Omega(\\sqrt n)$ rounds in an n-node network against
an adaptive adversary, we consider a late adaptive adversary, who has full knowledge
of the network state at the beginning of the previous round and unlimited computational
power, but is oblivious to the current state of the nodes. \r\n\r\nOur main contributions
are randomized distributed algorithms that achieve consensus with high probability
among all except a small constant fraction of the nodes (i.e., \"almost-everywhere'')
against a late adaptive adversary who can block up to ε n$ nodes in each round,
for a small constant ε >0$. Our first protocol achieves binary almost-everywhere
consensus and also guarantees a decision on the majority input value, thus ensuring
plurality consensus. We also present an algorithm that achieves the same time
complexity for multi-value consensus. Both of our algorithms succeed in $O(log
n)$ rounds with high probability, thus showing an exponential gap to the $\\tilde\\Omega(\\sqrt
n)$ lower bound of Ben-Or and Bar-Joseph for strongly adaptive crash-failure adversaries,
which can be strengthened to $\\Omega(n)$ when allowing the adversary to block
nodes instead of permanently crashing them. Our algorithms are scalable to large
systems as each node contacts only an (amortized) constant number of peers in
each communication round. We show that our algorithms are optimal up to constant
(resp.\\ sub-logarithmic) factors by proving that every almost-everywhere consensus
protocol takes $\\Omega(log_d n)$ rounds in the worst case, where d is an upper
bound on the number of communication requests initiated per node in each round.
We complement our theoretical results with an experimental evaluation of the binary
almost-everywhere consensus protocol revealing a short convergence time even against
an adversary blocking a large fraction of nodes."
author:
- first_name: Peter
full_name: Robinson, Peter
last_name: Robinson
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: 'Robinson P, Scheideler C, Setzer A. Breaking the $\tilde\Omega(\sqrt{n})$
Barrier: Fast Consensus under a Late Adversary. In: Proceedings of the 30th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). doi:10.1145/3210377.3210399'
apa: 'Robinson, P., Scheideler, C., & Setzer, A. (n.d.). Breaking the $\tilde\Omega(\sqrt{n})$
Barrier: Fast Consensus under a Late Adversary. In Proceedings of the 30th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien.
https://doi.org/10.1145/3210377.3210399'
bibtex: '@inproceedings{Robinson_Scheideler_Setzer, title={Breaking the $\tilde\Omega(\sqrt{n})$
Barrier: Fast Consensus under a Late Adversary}, DOI={10.1145/3210377.3210399},
booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Robinson, Peter and Scheideler, Christian and
Setzer, Alexander} }'
chicago: 'Robinson, Peter, Christian Scheideler, and Alexander Setzer. “Breaking
the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.”
In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), n.d. https://doi.org/10.1145/3210377.3210399.'
ieee: 'P. Robinson, C. Scheideler, and A. Setzer, “Breaking the $\tilde\Omega(\sqrt{n})$
Barrier: Fast Consensus under a Late Adversary,” in Proceedings of the 30th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien.'
mla: 'Robinson, Peter, et al. “Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast
Consensus under a Late Adversary.” Proceedings of the 30th ACM Symposium on
Parallelism in Algorithms and Architectures (SPAA), doi:10.1145/3210377.3210399.'
short: 'P. Robinson, C. Scheideler, A. Setzer, in: Proceedings of the 30th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), n.d.'
conference:
end_date: 2018-07-18
location: Wien
name: 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
start_date: 2018-07-16
date_created: 2018-07-04T08:55:45Z
date_updated: 2022-01-06T06:59:16Z
ddc:
- '040'
department:
- _id: '79'
- _id: '34'
- _id: '7'
doi: 10.1145/3210377.3210399
file:
- access_level: closed
content_type: application/pdf
creator: asetzer
date_created: 2018-10-31T13:30:40Z
date_updated: 2018-10-31T13:30:40Z
file_id: '5215'
file_name: p173-robinson.pdf
file_size: 1675407
relation: main_file
success: 1
file_date_updated: 2018-10-31T13:30:40Z
has_accepted_license: '1'
keyword:
- distributed consensus
- randomized algorithm
- adaptive adversary
- complexity lower bound
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
publication_identifier:
isbn:
- 978-1-4503-5799-9/18/07
publication_status: accepted
status: public
title: 'Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late
Adversary'
type: conference
user_id: '11108'
year: '2018'
...
---
_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: '1164'
abstract:
- lang: eng
text: "We propose a distributed protocol for a queue, called Skueue, which spreads
its data fairly onto multiple processes, avoiding bottlenecks in high throughput
scenarios.\r\nSkueuecan be used in highly dynamic environments, through the addition
of join and leave requests to the standard queue operations enqueue and dequeue.\r\nFurthermore
Skueue satisfies sequential consistency in the asynchronous message passing model.\r\nScalability
is achieved by aggregating multiple requests to a batch, which can then be processed
in a distributed fashion without hurting the queue semantics.\r\nOperations in
Skueue need a logarithmic number of rounds w.h.p. until they are processed, even
under a high rate of incoming requests."
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: 'Feldmann M, Scheideler C, Setzer A. Skueue: A Scalable and Sequentially Consistent
Distributed Queue. In: Proceedings of the 32nd IEEE International Parallel
& Distributed Processing Symposium (IPDPS). IEEE; 2018. doi:10.1109/IPDPS.2018.00113'
apa: 'Feldmann, M., Scheideler, C., & Setzer, A. (2018). Skueue: A Scalable
and Sequentially Consistent Distributed Queue. In Proceedings of the 32nd IEEE
International Parallel & Distributed Processing Symposium (IPDPS). Vancouver:
IEEE. https://doi.org/10.1109/IPDPS.2018.00113'
bibtex: '@inproceedings{Feldmann_Scheideler_Setzer_2018, title={Skueue: A Scalable
and Sequentially Consistent Distributed Queue}, DOI={10.1109/IPDPS.2018.00113},
booktitle={Proceedings of the 32nd IEEE International Parallel & Distributed
Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and
Scheideler, Christian and Setzer, Alexander}, year={2018} }'
chicago: 'Feldmann, Michael, Christian Scheideler, and Alexander Setzer. “Skueue:
A Scalable and Sequentially Consistent Distributed Queue.” In Proceedings of
the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS).
IEEE, 2018. https://doi.org/10.1109/IPDPS.2018.00113.'
ieee: 'M. Feldmann, C. Scheideler, and A. Setzer, “Skueue: A Scalable and Sequentially
Consistent Distributed Queue,” in Proceedings of the 32nd IEEE International
Parallel & Distributed Processing Symposium (IPDPS), Vancouver, 2018.'
mla: 'Feldmann, Michael, et al. “Skueue: A Scalable and Sequentially Consistent
Distributed Queue.” Proceedings of the 32nd IEEE International Parallel &
Distributed Processing Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00113.'
short: 'M. Feldmann, C. Scheideler, A. Setzer, 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-01T14:00:36Z
date_updated: 2022-01-06T06:51:05Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/IPDPS.2018.00113
external_id:
arxiv:
- '1802.07504'
file:
- access_level: closed
content_type: application/pdf
creator: mfeldma2
date_created: 2018-10-31T13:29:26Z
date_updated: 2018-10-31T13:29:26Z
file_id: '5212'
file_name: 08425257.pdf
file_size: 218420
relation: main_file
success: 1
file_date_updated: 2018-10-31T13:29:26Z
has_accepted_license: '1'
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: 'Skueue: A Scalable and Sequentially Consistent Distributed Queue'
type: conference
user_id: '23538'
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: '5820'
abstract:
- lang: eng
text: "In this paper, we investigate the use of trusted execution environments (TEEs,
such as Intel's SGX) for an anonymous communication infrastructure over untrusted
networks.\r\nFor this, we present the general idea of exploiting trusted execution
environments for the purpose of anonymous communication, including a continuous-time
security framework that models strong anonymity guarantees in the presence of
an adversary that observes all network traffic and can adaptively corrupt a constant
fraction of participating nodes.\r\nIn our framework, a participating node can
generate a number of unlinkable pseudonyms. Messages are sent from and to pseudonyms,
allowing both senders and receivers of messages to remain anonymous. We introduce
a concrete construction, which shows viability of our TEE-based approach to anonymous
communication. The construction draws from techniques from cryptography and overlay
networks. \r\nOur techniques are very general and can be used as a basis for future
constructions with similar goals."
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Jan
full_name: Bobolz, Jan
id: '27207'
last_name: Bobolz
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: Blömer J, Bobolz J, Scheideler C, Setzer A. Provably Anonymous Communication
Based on Trusted Execution Environments.
apa: Blömer, J., Bobolz, J., Scheideler, C., & Setzer, A. (n.d.). Provably
Anonymous Communication Based on Trusted Execution Environments.
bibtex: '@book{Blömer_Bobolz_Scheideler_Setzer, title={Provably Anonymous Communication
Based on Trusted Execution Environments}, author={Blömer, Johannes and Bobolz,
Jan and Scheideler, Christian and Setzer, Alexander} }'
chicago: Blömer, Johannes, Jan Bobolz, Christian Scheideler, and Alexander Setzer.
Provably Anonymous Communication Based on Trusted Execution Environments,
n.d.
ieee: J. Blömer, J. Bobolz, C. Scheideler, and A. Setzer, Provably Anonymous
Communication Based on Trusted Execution Environments. .
mla: Blömer, Johannes, et al. Provably Anonymous Communication Based on Trusted
Execution Environments.
short: J. Blömer, J. Bobolz, C. Scheideler, A. Setzer, Provably Anonymous Communication
Based on Trusted Execution Environments, n.d.
date_created: 2018-11-25T08:08:40Z
date_updated: 2022-01-06T07:02:43Z
ddc:
- '000'
department:
- _id: '7'
- _id: '64'
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: jbobolz
date_created: 2018-12-31T09:55:30Z
date_updated: 2018-12-31T09:55:30Z
file_id: '6435'
file_name: draft-2018.pdf
file_size: 470968
relation: main_file
success: 1
file_date_updated: 2018-12-31T09:55:30Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication_status: draft
status: public
title: Provably Anonymous Communication Based on Trusted Execution Environments
type: working_paper
user_id: '27207'
year: '2018'
...