---
_id: '17998'
author:
- first_name: Brauer
full_name: Sascha, Brauer
last_name: Sascha
citation:
ama: Sascha B. Implementierung Eines Verfahrens Zur Lösung Des 3-Mincut-Problems.;
2011.
apa: Sascha, B. (2011). Implementierung eines Verfahrens zur Lösung des 3-Mincut-Problems.
bibtex: '@book{Sascha_2011, title={Implementierung eines Verfahrens zur Lösung des
3-Mincut-Problems}, author={Sascha, Brauer}, year={2011} }'
chicago: Sascha, Brauer. Implementierung Eines Verfahrens Zur Lösung Des 3-Mincut-Problems,
2011.
ieee: B. Sascha, Implementierung eines Verfahrens zur Lösung des 3-Mincut-Problems.
2011.
mla: Sascha, Brauer. Implementierung Eines Verfahrens Zur Lösung Des 3-Mincut-Problems.
2011.
short: B. Sascha, Implementierung Eines Verfahrens Zur Lösung Des 3-Mincut-Problems,
2011.
date_created: 2020-08-17T08:11:05Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Implementierung eines Verfahrens zur Lösung des 3-Mincut-Problems
type: bachelorsthesis
user_id: '15504'
year: '2011'
...
---
_id: '645'
abstract:
- lang: eng
text: In the standard consensus problem there are n processes with possibly di®erent
input values and the goal is to eventually reach a point at which all processes
commit to exactly one of these values. We are studying a slight variant of the
consensus problem called the stabilizing consensus problem [2]. In this problem,
we do not require that each process commits to a ¯nal value at some point, but
that eventually they arrive at a common, stable value without necessarily being
aware of that. This should work irrespective of the states in which the processes
are starting. Our main result is a simple randomized algorithm called median rule
that, with high probability, just needs O(logmlog log n + log n) time and work
per process to arrive at an almost stable consensus for any set of m legal values
as long as an adversary can corrupt the states of at most p n processes at any
time. Without adversarial involvement, just O(log n) time and work is needed for
a stable consensus, with high probability. As a by-product, we obtain a simple
distributed algorithm for approximating the median of n numbers in time O(logmlog
log n + log n) under adversarial presence.
author:
- first_name: Benjamin
full_name: Doerr, Benjamin
last_name: Doerr
- first_name: Leslie Ann
full_name: Goldberg, Leslie Ann
last_name: Goldberg
- first_name: Lorenz
full_name: Minder, Lorenz
last_name: Minder
- first_name: Thomas
full_name: Sauerwald, Thomas
last_name: Sauerwald
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Doerr B, Goldberg LA, Minder L, Sauerwald T, Scheideler C. Stabilizing consensus
with the power of two choices. In: Proceedings of the 23rd ACM Symposium on
Parallelism in Algorithms and Architectures (SPAA). ; 2011:149-158. doi:10.1145/1989493.1989516'
apa: Doerr, B., Goldberg, L. A., Minder, L., Sauerwald, T., & Scheideler, C.
(2011). Stabilizing consensus with the power of two choices. In Proceedings
of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
(pp. 149–158). https://doi.org/10.1145/1989493.1989516
bibtex: '@inproceedings{Doerr_Goldberg_Minder_Sauerwald_Scheideler_2011, title={Stabilizing
consensus with the power of two choices}, DOI={10.1145/1989493.1989516},
booktitle={Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Doerr, Benjamin and Goldberg, Leslie Ann and
Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian}, year={2011},
pages={149–158} }'
chicago: Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald,
and Christian Scheideler. “Stabilizing Consensus with the Power of Two Choices.”
In Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 149–58, 2011. https://doi.org/10.1145/1989493.1989516.
ieee: B. Doerr, L. A. Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Stabilizing
consensus with the power of two choices,” in Proceedings of the 23rd ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2011, pp. 149–158.
mla: Doerr, Benjamin, et al. “Stabilizing Consensus with the Power of Two Choices.”
Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 2011, pp. 149–58, doi:10.1145/1989493.1989516.
short: 'B. Doerr, L.A. Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Proceedings
of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
2011, pp. 149–158.'
date_created: 2017-10-17T12:42:57Z
date_updated: 2022-01-06T07:03:05Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/1989493.1989516
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:58:11Z
date_updated: 2018-03-14T13:58:11Z
file_id: '1228'
file_name: 645-spaa70-scheideler.pdf
file_size: 268500
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:58:11Z
has_accepted_license: '1'
page: 149-158
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: Stabilizing consensus with the power of two choices
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '646'
abstract:
- lang: eng
text: This paper presents a dynamic overlay network based on the De Bruijn graph
which we call Linearized De Bruijn (LDB) network. The LDB network has the advantage
that it has a guaranteed constant node degree and that the routing between any
two nodes takes at most O(log n) hops with high probability. Also, we show that
there is a simple local-control algorithm that can recover the LDB network from
any network topology that is weakly connected.
author:
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Richa AW, Scheideler C. Self-Stabilizing DeBruijn Networks. In: Proceedings
of the 13th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS). LNCS. ; 2011:416-430. doi:10.1007/978-3-642-24550-3_31'
apa: Richa, A. W., & Scheideler, C. (2011). Self-Stabilizing DeBruijn Networks.
In Proceedings of the 13th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS) (pp. 416–430). https://doi.org/10.1007/978-3-642-24550-3_31
bibtex: '@inproceedings{Richa_Scheideler_2011, series={LNCS}, title={Self-Stabilizing
DeBruijn Networks}, DOI={10.1007/978-3-642-24550-3_31},
booktitle={Proceedings of the 13th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, author={Richa, Andrea W. and Scheideler,
Christian}, year={2011}, pages={416–430}, collection={LNCS} }'
chicago: Richa, Andrea W., and Christian Scheideler. “Self-Stabilizing DeBruijn
Networks.” In Proceedings of the 13th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS), 416–30. LNCS, 2011. https://doi.org/10.1007/978-3-642-24550-3_31.
ieee: A. W. Richa and C. Scheideler, “Self-Stabilizing DeBruijn Networks,” in Proceedings
of the 13th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS), 2011, pp. 416–430.
mla: Richa, Andrea W., and Christian Scheideler. “Self-Stabilizing DeBruijn Networks.”
Proceedings of the 13th International Symposium on Stabilization, Safety, and
Security of Distributed Systems (SSS), 2011, pp. 416–30, doi:10.1007/978-3-642-24550-3_31.
short: 'A.W. Richa, C. Scheideler, in: Proceedings of the 13th International Symposium
on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp.
416–430.'
date_created: 2017-10-17T12:42:58Z
date_updated: 2022-01-06T07:03:06Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-24550-3_31
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:57:26Z
date_updated: 2018-03-14T13:57:26Z
file_id: '1227'
file_name: 646-SSS2011-Scheideler_02.pdf
file_size: 339664
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:57:26Z
has_accepted_license: '1'
page: 416-430
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 13th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
series_title: LNCS
status: public
title: Self-Stabilizing DeBruijn Networks
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '648'
author:
- first_name: Philipp
full_name: Brandes, Philipp
last_name: Brandes
citation:
ama: Brandes P. Robust Distributed Computation in Dynamic Networks. Universität
Paderborn; 2011.
apa: Brandes, P. (2011). Robust Distributed Computation in Dynamic Networks.
Universität Paderborn.
bibtex: '@book{Brandes_2011, title={Robust Distributed Computation in Dynamic Networks},
publisher={Universität Paderborn}, author={Brandes, Philipp}, year={2011} }'
chicago: Brandes, Philipp. Robust Distributed Computation in Dynamic Networks.
Universität Paderborn, 2011.
ieee: P. Brandes, Robust Distributed Computation in Dynamic Networks. Universität
Paderborn, 2011.
mla: Brandes, Philipp. Robust Distributed Computation in Dynamic Networks.
Universität Paderborn, 2011.
short: P. Brandes, Robust Distributed Computation in Dynamic Networks, Universität
Paderborn, 2011.
date_created: 2017-10-17T12:42:58Z
date_updated: 2022-01-06T07:03:06Z
department:
- _id: '79'
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: Robust Distributed Computation in Dynamic Networks
type: mastersthesis
user_id: '477'
year: '2011'
...
---
_id: '654'
abstract:
- lang: eng
text: Research on peer-to-peer (p2p) and distributed systems needs evaluation tools
to predict and observe the behavior of protocols and mechanisms in large scale
networks. PeerfactSim.KOM is a simulator for large scale distributed/p2p systems
aiming at the evaluation of interdependencies in multi-layered p2p systems. The
simulator is written in Java, is event-based and mainly used in p2p research projects.
The main development of PeerfactSim.KOM started in 2005 and is driven since 2006
by the project “QuaP2P”,which aims at the systematic improvement and benchmarking
of p2p systems. Further users of the simulator are working in the project “On-the-fly
Computing” aiming at researching p2p-based service oriented architectures. Both
projects state severe requirements on the evaluation of multi-layered and large-scale
distributed systems. We describe the architecture of PeerfactSim.KOM supporting
these requirements in Section II, present the workflow, selected experiences and
lessons learned in Section III and conclude the overview in Section IV.
author:
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
citation:
ama: 'Graffi K. PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons
Learned. In: Proceedings of the IEEE International Conference on Peer-to-Peer
Computing (IEEE PsP). ; 2011:154-155. doi:10.1109/P2P.2011.6038673'
apa: 'Graffi, K. (2011). PeerfactSim.KOM: A PSP System Simulator - Experiences and
Lessons Learned. In Proceedings of the IEEE International Conference on Peer-to-Peer
Computing (IEEE PsP) (pp. 154–155). https://doi.org/10.1109/P2P.2011.6038673'
bibtex: '@inproceedings{Graffi_2011, title={PeerfactSim.KOM: A PSP System Simulator
- Experiences and Lessons Learned}, DOI={10.1109/P2P.2011.6038673},
booktitle={Proceedings of the IEEE International Conference on Peer-to-Peer Computing
(IEEE PsP)}, author={Graffi, Kalman}, year={2011}, pages={154–155} }'
chicago: 'Graffi, Kalman. “PeerfactSim.KOM: A PSP System Simulator - Experiences
and Lessons Learned.” In Proceedings of the IEEE International Conference on
Peer-to-Peer Computing (IEEE PsP), 154–55, 2011. https://doi.org/10.1109/P2P.2011.6038673.'
ieee: 'K. Graffi, “PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons
Learned,” in Proceedings of the IEEE International Conference on Peer-to-Peer
Computing (IEEE PsP), 2011, pp. 154–155.'
mla: 'Graffi, Kalman. “PeerfactSim.KOM: A PSP System Simulator - Experiences and
Lessons Learned.” Proceedings of the IEEE International Conference on Peer-to-Peer
Computing (IEEE PsP), 2011, pp. 154–55, doi:10.1109/P2P.2011.6038673.'
short: 'K. Graffi, in: Proceedings of the IEEE International Conference on Peer-to-Peer
Computing (IEEE PsP), 2011, pp. 154–155.'
date_created: 2017-10-17T12:42:59Z
date_updated: 2022-01-06T07:03:11Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/P2P.2011.6038673
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:50:18Z
date_updated: 2018-03-14T13:50:18Z
file_id: '1221'
file_name: 654-IEEE.P2P.11._Kalman.Graffi_PeerfactSim-A.P2P.System.Simulator_01.pdf
file_size: 327680
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:50:18Z
has_accepted_license: '1'
language:
- iso: eng
page: 154-155
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 IEEE International Conference on Peer-to-Peer Computing
(IEEE PsP)
status: public
title: 'PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned'
type: conference
user_id: '477'
year: '2011'
...
---
_id: '662'
abstract:
- lang: eng
text: We present Corona, a deterministic self-stabilizing algorithm for skip list
construction in structured overlay networks. Corona operates in the low-atomicity
message-passing asynchronous system model. Corona requires constant process memory
space for its operation and, therefore, scales well. We prove the general necessary
conditions limiting the initial states from which a self-stabilizing structured
overlay network in message-passing system can be constructed. The conditions require
that initial state information has to form a weakly connected graph and it should
only contain identiers that are present in the system. We formally describe Corona
and rigorously prove that it stabilizes from an arbitrary initial state subject
to the necessary conditions. We extend Corona to construct a skip graph.
author:
- first_name: Mikhail
full_name: Nesterenko, Mikhail
last_name: Nesterenko
- first_name: Rizal
full_name: Mohd, Rizal
last_name: Mohd
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Nesterenko M, Mohd R, Scheideler C. Corona: A Stabilizing Deterministic Message-Passing
Skip List. In: Proceedings of the 13th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS). LNCS. ; 2011:356--370.
doi:10.1007/978-3-642-24550-3_27'
apa: 'Nesterenko, M., Mohd, R., & Scheideler, C. (2011). Corona: A Stabilizing
Deterministic Message-Passing Skip List. In Proceedings of the 13th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)
(pp. 356--370). https://doi.org/10.1007/978-3-642-24550-3_27'
bibtex: '@inproceedings{Nesterenko_Mohd_Scheideler_2011, series={LNCS}, title={Corona:
A Stabilizing Deterministic Message-Passing Skip List}, DOI={10.1007/978-3-642-24550-3_27},
booktitle={Proceedings of the 13th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, author={Nesterenko, Mikhail and Mohd,
Rizal and Scheideler, Christian}, year={2011}, pages={356--370}, collection={LNCS}
}'
chicago: 'Nesterenko, Mikhail, Rizal Mohd, and Christian Scheideler. “Corona: A
Stabilizing Deterministic Message-Passing Skip List.” In Proceedings of the
13th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS), 356--370. LNCS, 2011. https://doi.org/10.1007/978-3-642-24550-3_27.'
ieee: 'M. Nesterenko, R. Mohd, and C. Scheideler, “Corona: A Stabilizing Deterministic
Message-Passing Skip List,” in Proceedings of the 13th International Symposium
on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011,
pp. 356--370.'
mla: 'Nesterenko, Mikhail, et al. “Corona: A Stabilizing Deterministic Message-Passing
Skip List.” Proceedings of the 13th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS), 2011, pp. 356--370, doi:10.1007/978-3-642-24550-3_27.'
short: 'M. Nesterenko, R. Mohd, C. Scheideler, in: Proceedings of the 13th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS),
2011, pp. 356--370.'
date_created: 2017-10-17T12:43:01Z
date_updated: 2022-01-06T07:03:13Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-24550-3_27
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:46:48Z
date_updated: 2018-03-14T13:46:48Z
file_id: '1217'
file_name: 662-SSS2011-Corona-Scheideler.pdf
file_size: 305543
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:46:48Z
has_accepted_license: '1'
page: 356--370
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 13th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
series_title: LNCS
status: public
title: 'Corona: A Stabilizing Deterministic Message-Passing Skip List'
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '665'
author:
- first_name: Philip
full_name: Wette, Philip
last_name: Wette
citation:
ama: Wette P. Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke
am Beispiel von Chord. Universität Paderborn; 2011.
apa: Wette, P. (2011). Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke
am Beispiel von Chord. Universität Paderborn.
bibtex: '@book{Wette_2011, title={Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke
am Beispiel von Chord}, publisher={Universität Paderborn}, author={Wette, Philip},
year={2011} }'
chicago: Wette, Philip. Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke
am Beispiel von Chord. Universität Paderborn, 2011.
ieee: P. Wette, Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke
am Beispiel von Chord. Universität Paderborn, 2011.
mla: Wette, Philip. Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke
am Beispiel von Chord. Universität Paderborn, 2011.
short: P. Wette, Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke
am Beispiel von Chord, Universität Paderborn, 2011.
date_created: 2017-10-17T12:43:01Z
date_updated: 2022-01-06T07:03:14Z
department:
- _id: '79'
language:
- iso: ger
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: Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel
von Chord
type: mastersthesis
user_id: '477'
year: '2011'
...
---
_id: '1903'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Meyer auf der Heide F, Scheideler C. Algorithmische Grundlagen verteilter Speichersysteme.
Informatik Spektrum. 2010;(5):468--474. doi:10.1007/s00287-010-0470-2
apa: Meyer auf der Heide, F., & Scheideler, C. (2010). Algorithmische Grundlagen
verteilter Speichersysteme. Informatik Spektrum, (5), 468--474. https://doi.org/10.1007/s00287-010-0470-2
bibtex: '@article{Meyer auf der Heide_Scheideler_2010, title={Algorithmische Grundlagen
verteilter Speichersysteme}, DOI={10.1007/s00287-010-0470-2},
number={5}, journal={Informatik Spektrum}, author={Meyer auf der Heide, Friedhelm
and Scheideler, Christian}, year={2010}, pages={468--474} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische
Grundlagen Verteilter Speichersysteme.” Informatik Spektrum, no. 5 (2010):
468--474. https://doi.org/10.1007/s00287-010-0470-2.'
ieee: F. Meyer auf der Heide and C. Scheideler, “Algorithmische Grundlagen verteilter
Speichersysteme,” Informatik Spektrum, no. 5, pp. 468--474, 2010.
mla: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen
Verteilter Speichersysteme.” Informatik Spektrum, no. 5, 2010, pp. 468--474,
doi:10.1007/s00287-010-0470-2.
short: F. Meyer auf der Heide, C. Scheideler, Informatik Spektrum (2010) 468--474.
date_created: 2018-03-28T07:21:50Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/s00287-010-0470-2
issue: '5'
language:
- iso: eng
page: 468--474
publication: Informatik Spektrum
status: public
title: Algorithmische Grundlagen verteilter Speichersysteme
type: journal_article
user_id: '14955'
year: '2010'
...
---
_id: '1904'
author:
- first_name: Cyril
full_name: Gavoille, Cyril
last_name: Gavoille
- first_name: Boaz
full_name: Patt-Shamir, Boaz
last_name: Patt-Shamir
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Gavoille C, Patt-Shamir B, Scheideler C. Foreword. Theory of Computing Systems.
2010;(4):809--810. doi:10.1007/s00224-010-9284-5
apa: Gavoille, C., Patt-Shamir, B., & Scheideler, C. (2010). Foreword. Theory
of Computing Systems, (4), 809--810. https://doi.org/10.1007/s00224-010-9284-5
bibtex: '@article{Gavoille_Patt-Shamir_Scheideler_2010, title={Foreword}, DOI={10.1007/s00224-010-9284-5},
number={4}, journal={Theory of Computing Systems}, author={Gavoille, Cyril and
Patt-Shamir, Boaz and Scheideler, Christian}, year={2010}, pages={809--810} }'
chicago: 'Gavoille, Cyril, Boaz Patt-Shamir, and Christian Scheideler. “Foreword.”
Theory of Computing Systems, no. 4 (2010): 809--810. https://doi.org/10.1007/s00224-010-9284-5.'
ieee: C. Gavoille, B. Patt-Shamir, and C. Scheideler, “Foreword,” Theory of Computing
Systems, no. 4, pp. 809--810, 2010.
mla: Gavoille, Cyril, et al. “Foreword.” Theory of Computing Systems, no.
4, 2010, pp. 809--810, doi:10.1007/s00224-010-9284-5.
short: C. Gavoille, B. Patt-Shamir, C. Scheideler, Theory of Computing Systems (2010)
809--810.
date_created: 2018-03-28T07:22:21Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '79'
doi: 10.1007/s00224-010-9284-5
issue: '4'
page: 809--810
publication: Theory of Computing Systems
status: public
title: Foreword
type: journal_article
user_id: '15504'
year: '2010'
...
---
_id: '1905'
author:
- first_name: Dominik
full_name: Gall, Dominik
last_name: Gall
- first_name: Riko
full_name: Jacob, Riko
last_name: Jacob
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Hanjo
full_name: Täubig, Hanjo
last_name: Täubig
citation:
ama: 'Gall D, Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. Time Complexity
of Distributed Topological Self-stabilization: The Case of Graph Linearization.
In: LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca,
Mexico, April 19-23, 2010. Proceedings. Vol 6034. Lecture Notes in Computer
Science. Springer; 2010:294--305. doi:10.1007/978-3-642-12200-2_27'
apa: 'Gall, D., Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., & Täubig,
H. (2010). Time Complexity of Distributed Topological Self-stabilization: The
Case of Graph Linearization. In LATIN 2010: Theoretical Informatics, 9th Latin
American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings (Vol. 6034,
pp. 294--305). Springer. https://doi.org/10.1007/978-3-642-12200-2_27'
bibtex: '@inproceedings{Gall_Jacob_W. Richa_Scheideler_Schmid_Täubig_2010, series={Lecture
Notes in Computer Science}, title={Time Complexity of Distributed Topological
Self-stabilization: The Case of Graph Linearization}, volume={6034}, DOI={10.1007/978-3-642-12200-2_27},
booktitle={LATIN 2010: Theoretical Informatics, 9th Latin American Symposium,
Oaxaca, Mexico, April 19-23, 2010. Proceedings}, publisher={Springer}, author={Gall,
Dominik and Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid,
Stefan and Täubig, Hanjo}, year={2010}, pages={294--305}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan
Schmid, and Hanjo Täubig. “Time Complexity of Distributed Topological Self-Stabilization:
The Case of Graph Linearization.” In LATIN 2010: Theoretical Informatics, 9th
Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings,
6034:294--305. Lecture Notes in Computer Science. Springer, 2010. https://doi.org/10.1007/978-3-642-12200-2_27.'
ieee: 'D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig,
“Time Complexity of Distributed Topological Self-stabilization: The Case of Graph
Linearization,” in LATIN 2010: Theoretical Informatics, 9th Latin American
Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings, 2010, vol. 6034,
pp. 294--305.'
mla: 'Gall, Dominik, et al. “Time Complexity of Distributed Topological Self-Stabilization:
The Case of Graph Linearization.” LATIN 2010: Theoretical Informatics, 9th
Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings,
vol. 6034, Springer, 2010, pp. 294--305, doi:10.1007/978-3-642-12200-2_27.'
short: 'D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in:
LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico,
April 19-23, 2010. Proceedings, Springer, 2010, pp. 294--305.'
date_created: 2018-03-28T07:22:42Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '79'
doi: 10.1007/978-3-642-12200-2_27
intvolume: ' 6034'
page: 294--305
publication: 'LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca,
Mexico, April 19-23, 2010. Proceedings'
publication_identifier:
isbn:
- 978-3-642-12199-9
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Time Complexity of Distributed Topological Self-stabilization: The Case of
Graph Linearization'
type: conference
user_id: '15504'
volume: 6034
year: '2010'
...
---
_id: '1906'
author:
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Richa AW, Zhang J, Scheideler C, Schmid S. Brief announcement: towards robust
medium access in multi-hop networks. In: Proceedings of the 29th Annual ACM
Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland,
July 25-28, 2010. ACM; 2010:114--115. doi:10.1145/1835698.1835726'
apa: 'Richa, A. W., Zhang, J., Scheideler, C., & Schmid, S. (2010). Brief announcement:
towards robust medium access in multi-hop networks. In Proceedings of the 29th
Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich,
Switzerland, July 25-28, 2010 (pp. 114--115). ACM. https://doi.org/10.1145/1835698.1835726'
bibtex: '@inproceedings{Richa_Zhang_Scheideler_Schmid_2010, title={Brief announcement:
towards robust medium access in multi-hop networks}, DOI={10.1145/1835698.1835726},
booktitle={Proceedings of the 29th Annual ACM Symposium on Principles of Distributed
Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010}, publisher={ACM},
author={Richa, Andrea W. and Zhang, Jin and Scheideler, Christian and Schmid,
Stefan}, year={2010}, pages={114--115} }'
chicago: 'Richa, Andrea W., Jin Zhang, Christian Scheideler, and Stefan Schmid.
“Brief Announcement: Towards Robust Medium Access in Multi-Hop Networks.” In Proceedings
of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC
2010, Zurich, Switzerland, July 25-28, 2010, 114--115. ACM, 2010. https://doi.org/10.1145/1835698.1835726.'
ieee: 'A. W. Richa, J. Zhang, C. Scheideler, and S. Schmid, “Brief announcement:
towards robust medium access in multi-hop networks,” in Proceedings of the
29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich,
Switzerland, July 25-28, 2010, 2010, pp. 114--115.'
mla: 'Richa, Andrea W., et al. “Brief Announcement: Towards Robust Medium Access
in Multi-Hop Networks.” Proceedings of the 29th Annual ACM Symposium on Principles
of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010,
ACM, 2010, pp. 114--115, doi:10.1145/1835698.1835726.'
short: 'A.W. Richa, J. Zhang, C. Scheideler, S. Schmid, in: Proceedings of the 29th
Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich,
Switzerland, July 25-28, 2010, ACM, 2010, pp. 114--115.'
date_created: 2018-03-28T07:23:32Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '79'
doi: 10.1145/1835698.1835726
page: 114--115
publication: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed
Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010
publication_identifier:
isbn:
- 978-1-60558-888-9
publisher: ACM
status: public
title: 'Brief announcement: towards robust medium access in multi-hop networks'
type: conference
user_id: '15504'
year: '2010'
...
---
_id: '1907'
author:
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: 'Richa AW, Scheideler C, Schmid S, Zhang J. A Jamming-Resistant MAC Protocol
for Multi-Hop Wireless Networks. In: Distributed Computing, 24th International
Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings.
Vol 6343. Lecture Notes in Computer Science. Springer; 2010:179--193. doi:10.1007/978-3-642-15763-9_17'
apa: Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2010). A Jamming-Resistant
MAC Protocol for Multi-Hop Wireless Networks. In Distributed Computing, 24th
International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010.
Proceedings (Vol. 6343, pp. 179--193). Springer. https://doi.org/10.1007/978-3-642-15763-9_17
bibtex: '@inproceedings{Richa_Scheideler_Schmid_Zhang_2010, series={Lecture Notes
in Computer Science}, title={A Jamming-Resistant MAC Protocol for Multi-Hop Wireless
Networks}, volume={6343}, DOI={10.1007/978-3-642-15763-9_17},
booktitle={Distributed Computing, 24th International Symposium, DISC 2010, Cambridge,
MA, USA, September 13-15, 2010. Proceedings}, publisher={Springer}, author={Richa,
Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2010},
pages={179--193}, collection={Lecture Notes in Computer Science} }'
chicago: Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin Zhang. “A
Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks.” In Distributed
Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September
13-15, 2010. Proceedings, 6343:179--193. Lecture Notes in Computer Science.
Springer, 2010. https://doi.org/10.1007/978-3-642-15763-9_17.
ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “A Jamming-Resistant
MAC Protocol for Multi-Hop Wireless Networks,” in Distributed Computing, 24th
International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010.
Proceedings, 2010, vol. 6343, pp. 179--193.
mla: Richa, Andrea W., et al. “A Jamming-Resistant MAC Protocol for Multi-Hop Wireless
Networks.” Distributed Computing, 24th International Symposium, DISC 2010,
Cambridge, MA, USA, September 13-15, 2010. Proceedings, vol. 6343, Springer,
2010, pp. 179--193, doi:10.1007/978-3-642-15763-9_17.
short: 'A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Distributed Computing,
24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15,
2010. Proceedings, Springer, 2010, pp. 179--193.'
date_created: 2018-03-28T07:24:22Z
date_updated: 2022-01-06T06:53:58Z
department:
- _id: '79'
doi: 10.1007/978-3-642-15763-9_17
intvolume: ' 6343'
page: 179--193
publication: Distributed Computing, 24th International Symposium, DISC 2010, Cambridge,
MA, USA, September 13-15, 2010. Proceedings
publication_identifier:
isbn:
- 978-3-642-15762-2
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks
type: conference
user_id: '15504'
volume: 6343
year: '2010'
...
---
_id: '1908'
author:
- first_name: Benjamin
full_name: Doerr, Benjamin
last_name: Doerr
- first_name: Leslie
full_name: Ann Goldberg, Leslie
last_name: Ann Goldberg
- first_name: Lorenz
full_name: Minder, Lorenz
last_name: Minder
- first_name: Thomas
full_name: Sauerwald, Thomas
last_name: Sauerwald
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Doerr B, Ann Goldberg L, Minder L, Sauerwald T, Scheideler C. Brief Announcement:
Stabilizing Consensus with the Power of Two Choices. In: Distributed Computing,
24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15,
2010. Proceedings. Vol 6343. Lecture Notes in Computer Science. Springer;
2010:528--530. doi:10.1007/978-3-642-15763-9_50'
apa: 'Doerr, B., Ann Goldberg, L., Minder, L., Sauerwald, T., & Scheideler,
C. (2010). Brief Announcement: Stabilizing Consensus with the Power of Two Choices.
In Distributed Computing, 24th International Symposium, DISC 2010, Cambridge,
MA, USA, September 13-15, 2010. Proceedings (Vol. 6343, pp. 528--530). Springer.
https://doi.org/10.1007/978-3-642-15763-9_50'
bibtex: '@inproceedings{Doerr_Ann Goldberg_Minder_Sauerwald_Scheideler_2010, series={Lecture
Notes in Computer Science}, title={Brief Announcement: Stabilizing Consensus with
the Power of Two Choices}, volume={6343}, DOI={10.1007/978-3-642-15763-9_50},
booktitle={Distributed Computing, 24th International Symposium, DISC 2010, Cambridge,
MA, USA, September 13-15, 2010. Proceedings}, publisher={Springer}, author={Doerr,
Benjamin and Ann Goldberg, Leslie and Minder, Lorenz and Sauerwald, Thomas and
Scheideler, Christian}, year={2010}, pages={528--530}, collection={Lecture Notes
in Computer Science} }'
chicago: 'Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald,
and Christian Scheideler. “Brief Announcement: Stabilizing Consensus with the
Power of Two Choices.” In Distributed Computing, 24th International Symposium,
DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, 6343:528--530.
Lecture Notes in Computer Science. Springer, 2010. https://doi.org/10.1007/978-3-642-15763-9_50.'
ieee: 'B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Brief
Announcement: Stabilizing Consensus with the Power of Two Choices,” in Distributed
Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September
13-15, 2010. Proceedings, 2010, vol. 6343, pp. 528--530.'
mla: 'Doerr, Benjamin, et al. “Brief Announcement: Stabilizing Consensus with the
Power of Two Choices.” Distributed Computing, 24th International Symposium,
DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, vol. 6343,
Springer, 2010, pp. 528--530, doi:10.1007/978-3-642-15763-9_50.'
short: 'B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Distributed
Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September
13-15, 2010. Proceedings, Springer, 2010, pp. 528--530.'
date_created: 2018-03-28T07:25:45Z
date_updated: 2022-01-06T06:53:58Z
department:
- _id: '79'
doi: 10.1007/978-3-642-15763-9_50
intvolume: ' 6343'
page: 528--530
publication: Distributed Computing, 24th International Symposium, DISC 2010, Cambridge,
MA, USA, September 13-15, 2010. Proceedings
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Brief Announcement: Stabilizing Consensus with the Power of Two Choices'
type: conference
user_id: '15504'
volume: 6343
year: '2010'
...
---
_id: '1909'
citation:
ama: Scheideler C, ed. Algorithms for Sensor Systems - 6th International Workshop
on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile
Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010, Revised Selected Papers.;
2010. doi:10.1007/978-3-642-16988-5
apa: Scheideler, C. (Ed.). (2010). Algorithms for Sensor Systems - 6th International
Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous
Mobile Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010, Revised Selected
Papers. https://doi.org/10.1007/978-3-642-16988-5
bibtex: '@book{Scheideler_2010, series={Lecture Notes in Computer Science}, title={Algorithms
for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems,
Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Bordeaux,
France, July 5, 2010, Revised Selected Papers}, DOI={10.1007/978-3-642-16988-5},
year={2010}, collection={Lecture Notes in Computer Science} }'
chicago: Scheideler, Christian, ed. Algorithms for Sensor Systems - 6th International
Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous
Mobile Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010, Revised Selected
Papers. Lecture Notes in Computer Science, 2010. https://doi.org/10.1007/978-3-642-16988-5.
ieee: C. Scheideler, Ed., Algorithms for Sensor Systems - 6th International Workshop
on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile
Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010, Revised Selected Papers.
2010.
mla: Scheideler, Christian, editor. Algorithms for Sensor Systems - 6th International
Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous
Mobile Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010, Revised Selected
Papers. 2010, doi:10.1007/978-3-642-16988-5.
short: C. Scheideler, ed., Algorithms for Sensor Systems - 6th International Workshop
on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile
Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010, Revised Selected Papers,
2010.
date_created: 2018-03-28T07:27:12Z
date_updated: 2022-01-06T06:53:58Z
department:
- _id: '79'
doi: 10.1007/978-3-642-16988-5
editor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
publication_identifier:
isbn:
- 978-3-642-16987-8
series_title: Lecture Notes in Computer Science
status: public
title: Algorithms for Sensor Systems - 6th International Workshop on Algorithms for
Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS
2010, Bordeaux, France, July 5, 2010, Revised Selected Papers
type: conference_editor
user_id: '15504'
year: '2010'
...
---
_id: '1925'
author:
- first_name: Robert
full_name: D. Kleinberg, Robert
last_name: D. Kleinberg
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: D. Kleinberg R, Scheideler C. Foreword. Theory Comput Syst. 2009;(2):187.
doi:10.1007/s00224-009-9202-x
apa: D. Kleinberg, R., & Scheideler, C. (2009). Foreword. Theory Comput.
Syst., (2), 187. https://doi.org/10.1007/s00224-009-9202-x
bibtex: '@article{D. Kleinberg_Scheideler_2009, title={Foreword}, DOI={10.1007/s00224-009-9202-x},
number={2}, journal={Theory Comput. Syst.}, author={D. Kleinberg, Robert and Scheideler,
Christian}, year={2009}, pages={187} }'
chicago: 'D. Kleinberg, Robert, and Christian Scheideler. “Foreword.” Theory
Comput. Syst., no. 2 (2009): 187. https://doi.org/10.1007/s00224-009-9202-x.'
ieee: R. D. Kleinberg and C. Scheideler, “Foreword,” Theory Comput. Syst.,
no. 2, p. 187, 2009.
mla: D. Kleinberg, Robert, and Christian Scheideler. “Foreword.” Theory Comput.
Syst., no. 2, 2009, p. 187, doi:10.1007/s00224-009-9202-x.
short: R. D. Kleinberg, C. Scheideler, Theory Comput. Syst. (2009) 187.
date_created: 2018-03-29T09:01:30Z
date_updated: 2022-01-06T06:54:00Z
department:
- _id: '79'
doi: 10.1007/s00224-009-9202-x
issue: '2'
page: '187'
publication: Theory Comput. Syst.
status: public
title: Foreword
type: journal_article
user_id: '15504'
year: '2009'
...
---
_id: '1927'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Awerbuch B, Scheideler C. Towards a Scalable and Robust DHT. Theory Comput
Syst. 2009;(2):234--260. doi:10.1007/s00224-008-9099-9
apa: Awerbuch, B., & Scheideler, C. (2009). Towards a Scalable and Robust DHT.
Theory Comput. Syst., (2), 234--260. https://doi.org/10.1007/s00224-008-9099-9
bibtex: '@article{Awerbuch_Scheideler_2009, title={Towards a Scalable and Robust
DHT}, DOI={10.1007/s00224-008-9099-9},
number={2}, journal={Theory Comput. Syst.}, author={Awerbuch, Baruch and Scheideler,
Christian}, year={2009}, pages={234--260} }'
chicago: 'Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust
DHT.” Theory Comput. Syst., no. 2 (2009): 234--260. https://doi.org/10.1007/s00224-008-9099-9.'
ieee: B. Awerbuch and C. Scheideler, “Towards a Scalable and Robust DHT,” Theory
Comput. Syst., no. 2, pp. 234--260, 2009.
mla: Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust
DHT.” Theory Comput. Syst., no. 2, 2009, pp. 234--260, doi:10.1007/s00224-008-9099-9.
short: B. Awerbuch, C. Scheideler, Theory Comput. Syst. (2009) 234--260.
date_created: 2018-03-29T09:08:11Z
date_updated: 2022-01-06T06:54:00Z
department:
- _id: '79'
doi: 10.1007/s00224-008-9099-9
issue: '2'
page: 234--260
publication: Theory Comput. Syst.
status: public
title: Towards a Scalable and Robust DHT
type: journal_article
user_id: '15504'
year: '2009'
...
---
_id: '1928'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Awerbuch B, Scheideler C. Robust random number generation for peer-to-peer
systems. Theor Comput Sci. 2009;(6-7):453--466. doi:10.1016/j.tcs.2008.10.003
apa: Awerbuch, B., & Scheideler, C. (2009). Robust random number generation
for peer-to-peer systems. Theor. Comput. Sci., (6–7), 453--466. https://doi.org/10.1016/j.tcs.2008.10.003
bibtex: '@article{Awerbuch_Scheideler_2009, title={Robust random number generation
for peer-to-peer systems}, DOI={10.1016/j.tcs.2008.10.003},
number={6–7}, journal={Theor. Comput. Sci.}, author={Awerbuch, Baruch and Scheideler,
Christian}, year={2009}, pages={453--466} }'
chicago: 'Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation
for Peer-to-Peer Systems.” Theor. Comput. Sci., no. 6–7 (2009): 453--466.
https://doi.org/10.1016/j.tcs.2008.10.003.'
ieee: B. Awerbuch and C. Scheideler, “Robust random number generation for peer-to-peer
systems,” Theor. Comput. Sci., no. 6–7, pp. 453--466, 2009.
mla: Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation
for Peer-to-Peer Systems.” Theor. Comput. Sci., no. 6–7, 2009, pp. 453--466,
doi:10.1016/j.tcs.2008.10.003.
short: B. Awerbuch, C. Scheideler, Theor. Comput. Sci. (2009) 453--466.
date_created: 2018-03-29T09:08:12Z
date_updated: 2022-01-06T06:54:01Z
department:
- _id: '79'
doi: 10.1016/j.tcs.2008.10.003
issue: 6-7
page: 453--466
publication: Theor. Comput. Sci.
status: public
title: Robust random number generation for peer-to-peer systems
type: journal_article
user_id: '15504'
year: '2009'
...
---
_id: '1929'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Scheideler C, Schmid S. A Distributed and Oblivious Heap. In: Automata,
Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes,
Greece, July 5-12, 2009, Proceedings, Part II. Vol 5556. Lecture Notes in
Computer Science. Springer; 2009:571--582. doi:10.1007/978-3-642-02930-1_47'
apa: Scheideler, C., & Schmid, S. (2009). A Distributed and Oblivious Heap.
In Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP
2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II (Vol. 5556, pp.
571--582). Springer. https://doi.org/10.1007/978-3-642-02930-1_47
bibtex: '@inproceedings{Scheideler_Schmid_2009, series={Lecture Notes in Computer
Science}, title={A Distributed and Oblivious Heap}, volume={5556}, DOI={10.1007/978-3-642-02930-1_47},
booktitle={Automata, Languages and Programming, 36th Internatilonal Colloquium,
ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II}, publisher={Springer},
author={Scheideler, Christian and Schmid, Stefan}, year={2009}, pages={571--582},
collection={Lecture Notes in Computer Science} }'
chicago: Scheideler, Christian, and Stefan Schmid. “A Distributed and Oblivious
Heap.” In Automata, Languages and Programming, 36th Internatilonal Colloquium,
ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, 5556:571--582.
Lecture Notes in Computer Science. Springer, 2009. https://doi.org/10.1007/978-3-642-02930-1_47.
ieee: C. Scheideler and S. Schmid, “A Distributed and Oblivious Heap,” in Automata,
Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes,
Greece, July 5-12, 2009, Proceedings, Part II, 2009, vol. 5556, pp. 571--582.
mla: Scheideler, Christian, and Stefan Schmid. “A Distributed and Oblivious Heap.”
Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP
2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, vol. 5556, Springer,
2009, pp. 571--582, doi:10.1007/978-3-642-02930-1_47.
short: 'C. Scheideler, S. Schmid, in: Automata, Languages and Programming, 36th
Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings,
Part II, Springer, 2009, pp. 571--582.'
date_created: 2018-03-29T09:08:14Z
date_updated: 2022-01-06T06:54:01Z
department:
- _id: '79'
doi: 10.1007/978-3-642-02930-1_47
intvolume: ' 5556'
page: 571--582
publication: Automata, Languages and Programming, 36th Internatilonal Colloquium,
ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II
publication_identifier:
isbn:
- 978-3-642-02929-5
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: A Distributed and Oblivious Heap
type: conference
user_id: '15504'
volume: 5556
year: '2009'
...
---
_id: '1930'
author:
- first_name: Riko
full_name: Jacob, Riko
last_name: Jacob
- first_name: Stephan
full_name: Ritscher, Stephan
last_name: Ritscher
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Jacob R, Ritscher S, Scheideler C, Schmid S. A Self-stabilizing and Local
Delaunay Graph Construction. In: Algorithms and Computation, 20th International
Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings.
Vol 5878. Lecture Notes in Computer Science. Springer; 2009:771--780. doi:10.1007/978-3-642-10631-6_78'
apa: Jacob, R., Ritscher, S., Scheideler, C., & Schmid, S. (2009). A Self-stabilizing
and Local Delaunay Graph Construction. In Algorithms and Computation, 20th
International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009.
Proceedings (Vol. 5878, pp. 771--780). Springer. https://doi.org/10.1007/978-3-642-10631-6_78
bibtex: '@inproceedings{Jacob_Ritscher_Scheideler_Schmid_2009, series={Lecture Notes
in Computer Science}, title={A Self-stabilizing and Local Delaunay Graph Construction},
volume={5878}, DOI={10.1007/978-3-642-10631-6_78},
booktitle={Algorithms and Computation, 20th International Symposium, ISAAC 2009,
Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, publisher={Springer},
author={Jacob, Riko and Ritscher, Stephan and Scheideler, Christian and Schmid,
Stefan}, year={2009}, pages={771--780}, collection={Lecture Notes in Computer
Science} }'
chicago: Jacob, Riko, Stephan Ritscher, Christian Scheideler, and Stefan Schmid.
“A Self-Stabilizing and Local Delaunay Graph Construction.” In Algorithms and
Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA,
December 16-18, 2009. Proceedings, 5878:771--780. Lecture Notes in Computer
Science. Springer, 2009. https://doi.org/10.1007/978-3-642-10631-6_78.
ieee: R. Jacob, S. Ritscher, C. Scheideler, and S. Schmid, “A Self-stabilizing and
Local Delaunay Graph Construction,” in Algorithms and Computation, 20th International
Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings,
2009, vol. 5878, pp. 771--780.
mla: Jacob, Riko, et al. “A Self-Stabilizing and Local Delaunay Graph Construction.”
Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu,
Hawaii, USA, December 16-18, 2009. Proceedings, vol. 5878, Springer, 2009,
pp. 771--780, doi:10.1007/978-3-642-10631-6_78.
short: 'R. Jacob, S. Ritscher, C. Scheideler, S. Schmid, in: Algorithms and Computation,
20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18,
2009. Proceedings, Springer, 2009, pp. 771--780.'
date_created: 2018-03-29T09:12:59Z
date_updated: 2022-01-06T06:54:02Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-10631-6_78
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T10:05:53Z
date_updated: 2018-04-13T10:05:53Z
file_id: '2342'
file_name: isaac09.pdf
file_size: 139275
relation: main_file
file_date_updated: 2018-04-13T10:05:53Z
has_accepted_license: '1'
intvolume: ' 5878'
oa: '1'
page: 771--780
publication: Algorithms and Computation, 20th International Symposium, ISAAC 2009,
Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: A Self-stabilizing and Local Delaunay Graph Construction
type: conference
urn: '19304'
user_id: '15504'
volume: 5878
year: '2009'
...
---
_id: '1932'
author:
- first_name: Riko
full_name: Jacob, Riko
last_name: Jacob
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Hanjo
full_name: Täubig, Hanjo
last_name: Täubig
citation:
ama: 'Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. A distributed polylogarithmic
time algorithm for self-stabilizing skip graphs. In: Proceedings of the 28th
Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary,
Alberta, Canada, August 10-12, 2009. ; 2009:131--140. doi:10.1145/1582716.1582741'
apa: Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., & Täubig, H. (2009).
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs.
In Proceedings of the 28th Annual ACM Symposium on Principles of Distributed
Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009 (pp. 131--140).
https://doi.org/10.1145/1582716.1582741
bibtex: '@inproceedings{Jacob_W. Richa_Scheideler_Schmid_Täubig_2009, title={A distributed
polylogarithmic time algorithm for self-stabilizing skip graphs}, DOI={10.1145/1582716.1582741},
booktitle={Proceedings of the 28th Annual ACM Symposium on Principles of Distributed
Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009}, author={Jacob,
Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig,
Hanjo}, year={2009}, pages={131--140} }'
chicago: Jacob, Riko, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and
Hanjo Täubig. “A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing
Skip Graphs.” In Proceedings of the 28th Annual ACM Symposium on Principles
of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009,
131--140, 2009. https://doi.org/10.1145/1582716.1582741.
ieee: R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “A distributed
polylogarithmic time algorithm for self-stabilizing skip graphs,” in Proceedings
of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC
2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140.
mla: Jacob, Riko, et al. “A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing
Skip Graphs.” Proceedings of the 28th Annual ACM Symposium on Principles of
Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009,
2009, pp. 131--140, doi:10.1145/1582716.1582741.
short: 'R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: Proceedings
of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC
2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140.'
date_created: 2018-03-29T09:16:22Z
date_updated: 2022-01-06T06:54:02Z
department:
- _id: '79'
doi: 10.1145/1582716.1582741
page: 131--140
publication: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed
Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009
publication_identifier:
isbn:
- 978-1-60558-396-9
status: public
title: A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
type: conference
user_id: '15504'
year: '2009'
...