---
_id: '577'
abstract:
- lang: eng
text: 'SSS is an international forum for researchers and practitioners in the design
and development of distributed systems with self-properties: (classical) self-stabilizing,
self-configuring, self-organizing, self-managing, self-repairing, self-healing,
self-optimizing, self-adaptive, and self-protecting. Research in distributed systems
is now at a crucialpoint in its evolution, marked by the importance of dynamic
systems such as peer-to-peer networks, large-scale wireless sensor networks, mobile
ad hoc networks, cloud computing, robotic networks, etc. Moreover, new applications
such as grid and web services, banking and e-commerce, e-health and robotics,
aerospace and avionics, automotive, industrial process control, etc. have joined
the traditional applications of distributed systems. The theory of self-stabilization
has been enriched in the last 30 years by high quality research contributions
in the areas of algorithmic techniques, formal methodologies, model theoretic
issues, and composition techniques. All these areas are essential to the understanding
and maintenance of self-properties in fault-tolerant distributed systems.'
citation:
ama: Richa AW, Scheideler C, eds. Stabilization, Safety, and Security of Distributed
Systems.; 2012. doi:10.1007/978-3-642-33536-5
apa: Richa, A. W., & Scheideler, C. (Eds.). (2012). Stabilization, Safety,
and Security of Distributed Systems. Presented at the Stabilization, Safety,
and Security of Distributed Systems (SSS), Paderborn, Germany. https://doi.org/10.1007/978-3-642-33536-5
bibtex: '@book{Richa_Scheideler_2012, title={Stabilization, Safety, and Security
of Distributed Systems}, DOI={10.1007/978-3-642-33536-5},
year={2012} }'
chicago: Richa, Andrea W., and Christian Scheideler, eds. Stabilization, Safety,
and Security of Distributed Systems, 2012. https://doi.org/10.1007/978-3-642-33536-5.
ieee: A. W. Richa and C. Scheideler, Eds., Stabilization, Safety, and Security
of Distributed Systems. 2012.
mla: Richa, Andrea W., and Christian Scheideler, editors. Stabilization, Safety,
and Security of Distributed Systems. 2012, doi:10.1007/978-3-642-33536-5.
short: A.W. Richa, C. Scheideler, eds., Stabilization, Safety, and Security of Distributed
Systems, 2012.
conference:
end_date: 2012-10-04
location: Paderborn, Germany
name: Stabilization, Safety, and Security of Distributed Systems (SSS)
start_date: 2012-10-01
date_created: 2017-10-17T12:42:44Z
date_updated: 2022-01-06T07:02:39Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-33536-5
editor:
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:09:19Z
date_updated: 2018-03-21T13:09:19Z
file_id: '1569'
file_name: 577-SSS2012Richa-Scheideler.pdf
file_size: 169564
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:09:19Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
status: public
title: Stabilization, Safety, and Security of Distributed Systems
type: conference_editor
user_id: '15504'
year: '2012'
...
---
_id: '579'
abstract:
- lang: eng
text: A left-to-right maximum in a sequence of n numbers s_1, …, s_n is a number
that is strictly larger than all preceding numbers. In this article we present
a smoothed analysis of the number of left-to-right maxima in the presence of additive
random noise. We show that for every sequence of n numbers s_i ∈ [0,1] that are
perturbed by uniform noise from the interval [-ε,ε], the expected number of left-to-right
maxima is Θ(&sqrt;n/ε + log n) for ε>1/n. For Gaussian noise with standard deviation
σ we obtain a bound of O((log3/2 n)/σ + log n).We apply our results to the analysis
of the smoothed height of binary search trees and the smoothed number of comparisons
in the quicksort algorithm and prove bounds of Θ(&sqrt;n/ε + log n) and Θ(n/ε+1&sqrt;n/ε
+ n log n), respectively, for uniform random noise from the interval [-ε,ε]. Our
results can also be applied to bound the smoothed number of points on a convex
hull of points in the two-dimensional plane and to smoothed motion complexity,
a concept we describe in this article. We bound how often one needs to update
a data structure storing the smallest axis-aligned box enclosing a set of points
moving in d-dimensional space.
author:
- first_name: Valentina
full_name: Damerow, Valentina
last_name: Damerow
- first_name: Bodo
full_name: Manthey, Bodo
last_name: Manthey
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Harald
full_name: Räcke, Harald
last_name: Räcke
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Till
full_name: Tantau, Till
last_name: Tantau
citation:
ama: Damerow V, Manthey B, Meyer auf der Heide F, et al. Smoothed analysis of left-to-right
maxima with applications. Transactions on Algorithms. 2012;(3):30. doi:10.1145/2229163.2229174
apa: Damerow, V., Manthey, B., Meyer auf der Heide, F., Räcke, H., Scheideler, C.,
Sohler, C., & Tantau, T. (2012). Smoothed analysis of left-to-right maxima
with applications. Transactions on Algorithms, (3), 30. https://doi.org/10.1145/2229163.2229174
bibtex: '@article{Damerow_Manthey_Meyer auf der Heide_Räcke_Scheideler_Sohler_Tantau_2012,
title={Smoothed analysis of left-to-right maxima with applications}, DOI={10.1145/2229163.2229174},
number={3}, journal={Transactions on Algorithms}, publisher={ACM}, author={Damerow,
Valentina and Manthey, Bodo and Meyer auf der Heide, Friedhelm and Räcke, Harald
and Scheideler, Christian and Sohler, Christian and Tantau, Till}, year={2012},
pages={30} }'
chicago: 'Damerow, Valentina, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald
Räcke, Christian Scheideler, Christian Sohler, and Till Tantau. “Smoothed Analysis
of Left-to-Right Maxima with Applications.” Transactions on Algorithms,
no. 3 (2012): 30. https://doi.org/10.1145/2229163.2229174.'
ieee: V. Damerow et al., “Smoothed analysis of left-to-right maxima with
applications,” Transactions on Algorithms, no. 3, p. 30, 2012.
mla: Damerow, Valentina, et al. “Smoothed Analysis of Left-to-Right Maxima with
Applications.” Transactions on Algorithms, no. 3, ACM, 2012, p. 30, doi:10.1145/2229163.2229174.
short: V. Damerow, B. Manthey, F. Meyer auf der Heide, H. Räcke, C. Scheideler,
C. Sohler, T. Tantau, Transactions on Algorithms (2012) 30.
date_created: 2017-10-17T12:42:45Z
date_updated: 2022-01-06T07:02:41Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1145/2229163.2229174
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T09:04:58Z
date_updated: 2018-03-15T09:04:58Z
file_id: '1266'
file_name: 579-a30-damerow.pdf
file_size: 329282
relation: main_file
success: 1
file_date_updated: 2018-03-15T09:04:58Z
has_accepted_license: '1'
issue: '3'
page: '30'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Transactions on Algorithms
publisher: ACM
status: public
title: Smoothed analysis of left-to-right maxima with applications
type: journal_article
user_id: '477'
year: '2012'
...
---
_id: '581'
abstract:
- lang: eng
text: 'Nanoparticles are getting more and more in the focus of the scientic community
since the potential for the development of very small particles interacting with
each other and completing medical and other tasks is getting bigger year by year.
In this work we introduce a distributed local algorithm for arranging a set of
nanoparticles on the discrete plane into specic geometric shapes, for instance
a rectangle. The concept of a particle we use can be seen as a simple mobile robot
with the following restrictions: it can only view the state of robots it is physically
connected to, is anonymous, has only a constant size memory, can only move by
using other particles as an anchor point on which it pulls itself alongside, and
it operates in Look-Compute-Move cycles. The main result of this work is the presentation
of a random distributed local algorithm which transforms any given connected set
of particles into a particular geometric shape. As an example we provide a version
of this algorithm for forming a rectangle with an arbitrary predened aspect ratio.
To the best of our knowledge this is the rst work that considers arrangement problems
for these types of robots.'
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Martina
full_name: 'Hüllmann (married name: Eikel), Martina'
last_name: 'Hüllmann (married name: Eikel)'
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Drees M, Hüllmann (married name: Eikel) M, Koutsopoulos A, Scheideler C. Self-Organizing
Particle Systems. In: Proceedings of the 26th IEEE International Parallel and
Distributed Processing Symposium (IPDPS). ; 2012:1272-1283. doi:10.1109/IPDPS.2012.116'
apa: 'Drees, M., Hüllmann (married name: Eikel), M., Koutsopoulos, A., & Scheideler,
C. (2012). Self-Organizing Particle Systems. In Proceedings of the 26th IEEE
International Parallel and Distributed Processing Symposium (IPDPS) (pp. 1272–1283).
https://doi.org/10.1109/IPDPS.2012.116'
bibtex: '@inproceedings{Drees_Hüllmann (married name: Eikel)_Koutsopoulos_Scheideler_2012,
title={Self-Organizing Particle Systems}, DOI={10.1109/IPDPS.2012.116},
booktitle={Proceedings of the 26th IEEE International Parallel and Distributed
Processing Symposium (IPDPS)}, author={Drees, Maximilian and Hüllmann (married
name: Eikel), Martina and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012},
pages={1272–1283} }'
chicago: 'Drees, Maximilian, Martina Hüllmann (married name: Eikel), Andreas Koutsopoulos,
and Christian Scheideler. “Self-Organizing Particle Systems.” In Proceedings
of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS),
1272–83, 2012. https://doi.org/10.1109/IPDPS.2012.116.'
ieee: 'M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, and C. Scheideler,
“Self-Organizing Particle Systems,” in Proceedings of the 26th IEEE International
Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–1283.'
mla: Drees, Maximilian, et al. “Self-Organizing Particle Systems.” Proceedings
of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS),
2012, pp. 1272–83, doi:10.1109/IPDPS.2012.116.
short: 'M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, C. Scheideler,
in: Proceedings of the 26th IEEE International Parallel and Distributed Processing
Symposium (IPDPS), 2012, pp. 1272–1283.'
date_created: 2017-10-17T12:42:45Z
date_updated: 2022-01-06T07:02:42Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1109/IPDPS.2012.116
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:39:33Z
date_updated: 2018-03-15T08:39:33Z
file_id: '1263'
file_name: 581-IPDPS2012-Scheideler_Huellmann.pdf
file_size: 373131
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:39:33Z
has_accepted_license: '1'
language:
- iso: eng
page: 1272-1283
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 26th IEEE International Parallel and Distributed Processing
Symposium (IPDPS)
status: public
title: Self-Organizing Particle Systems
type: conference
user_id: '14955'
year: '2012'
...
---
_id: '582'
author:
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: Strothmann TF. Self-Optimizing Binary Search Trees - A Game Theoretic Approach.
Universität Paderborn; 2012.
apa: Strothmann, T. F. (2012). Self-Optimizing Binary Search Trees - A Game Theoretic
Approach. Universität Paderborn.
bibtex: '@book{Strothmann_2012, title={Self-Optimizing Binary Search Trees - A Game
Theoretic Approach}, publisher={Universität Paderborn}, author={Strothmann, Thim
Frederik}, year={2012} }'
chicago: Strothmann, Thim Frederik. Self-Optimizing Binary Search Trees - A Game
Theoretic Approach. Universität Paderborn, 2012.
ieee: T. F. Strothmann, Self-Optimizing Binary Search Trees - A Game Theoretic
Approach. Universität Paderborn, 2012.
mla: Strothmann, Thim Frederik. Self-Optimizing Binary Search Trees - A Game
Theoretic Approach. Universität Paderborn, 2012.
short: T.F. Strothmann, Self-Optimizing Binary Search Trees - A Game Theoretic Approach,
Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:45Z
date_updated: 2022-01-06T07:02:42Z
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
title: Self-Optimizing Binary Search Trees - A Game Theoretic Approach
type: mastersthesis
user_id: '477'
year: '2012'
...
---
_id: '623'
abstract:
- lang: eng
text: 'This paper initiates the formal study of a fundamental problem: How to efficiently
allocate a shared communication medium among a set of K co-existing networks in
the presence of arbitrary external interference? While most literature on medium
access focuses on how to share a medium among nodes, these approaches are often
either not directly applicable to co-existing networks as they would violate the
independence requirement, or they yield a low throughput if applied to multiple
networks. We present the randomized medium access (MAC) protocol COMAC which guarantees
that a given communication channel is shared fairly among competing and independent
networks, and that the available bandwidth is used efficiently. These performance
guarantees hold in the presence of arbitrary external interference or even under
adversarial jamming. Concretely, we show that the co-existing networks can use
a Ω(ε2 min{ε, 1/poly(K)})-fraction of the non-jammed time steps for successful
message transmissions, where ε is the (arbitrarily distributed) fraction of time
which is not jammed.'
author:
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: 'Jin '
full_name: 'Zhang, Jin '
last_name: Zhang
citation:
ama: 'Richa AW, Scheideler C, Schmid S, Zhang J. Competitive and fair throughput
for co-existing networks under adversarial interference. In: Proceedings of
the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing
(PODC). ; 2012:291-300. doi:10.1145/2332432.2332488'
apa: Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2012). Competitive
and fair throughput for co-existing networks under adversarial interference. In
Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and
Distributed Computing (PODC) (pp. 291–300). https://doi.org/10.1145/2332432.2332488
bibtex: '@inproceedings{Richa_Scheideler_Schmid_Zhang_2012, title={Competitive and
fair throughput for co-existing networks under adversarial interference}, DOI={10.1145/2332432.2332488}, booktitle={Proceedings
of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing
(PODC)}, author={Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan
and Zhang, Jin }, year={2012}, pages={291–300} }'
chicago: Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin Zhang.
“Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.”
In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles
and Distributed Computing (PODC), 291–300, 2012. https://doi.org/10.1145/2332432.2332488.
ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and fair
throughput for co-existing networks under adversarial interference,” in Proceedings
of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing
(PODC), 2012, pp. 291–300.
mla: Richa, Andrea W., et al. “Competitive and Fair Throughput for Co-Existing Networks
under Adversarial Interference.” Proceedings of the 31st Annual ACM SIGACT-SIGOPS
Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300,
doi:10.1145/2332432.2332488.
short: 'A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 31st
Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC),
2012, pp. 291–300.'
date_created: 2017-10-17T12:42:53Z
date_updated: 2022-01-06T07:02:58Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/2332432.2332488
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:45:25Z
date_updated: 2018-03-15T06:45:25Z
file_id: '1241'
file_name: 623-PODC-2012_01.pdf
file_size: 210382
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:45:25Z
has_accepted_license: '1'
page: 291-300
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles
and Distributed Computing (PODC)
status: public
title: Competitive and fair throughput for co-existing networks under adversarial
interference
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '625'
abstract:
- lang: eng
text: 'This paper initiates the study of self-adjusting distributed data structures
for networks. In particular, we present SplayNets: a binary search tree based
network that is self-adjusting to routing request.We derive entropy bounds on
the amortized routing cost and show that our splaying algorithm has some interesting
properties.'
author:
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Chen
full_name: Avin, Chen
last_name: Avin
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Bernhard
full_name: Häupler, Bernhard
last_name: Häupler
- first_name: Zvi
full_name: Lotker, Zvi
last_name: Lotker
citation:
ama: 'Schmid S, Avin C, Scheideler C, Häupler B, Lotker Z. Brief Announcement: SplayNets
- Towards Self-Adjusting Distributed Data Structures. In: Proceedings of the
26th International Symposium on Distributed Computing (DISC). LNCS. ; 2012:439-440.
doi:10.1007/978-3-642-33651-5_47'
apa: 'Schmid, S., Avin, C., Scheideler, C., Häupler, B., & Lotker, Z. (2012).
Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.
In Proceedings of the 26th International Symposium on Distributed Computing
(DISC) (pp. 439–440). https://doi.org/10.1007/978-3-642-33651-5_47'
bibtex: '@inproceedings{Schmid_Avin_Scheideler_Häupler_Lotker_2012, series={LNCS},
title={Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data
Structures}, DOI={10.1007/978-3-642-33651-5_47},
booktitle={Proceedings of the 26th International Symposium on Distributed Computing
(DISC)}, author={Schmid, Stefan and Avin, Chen and Scheideler, Christian and Häupler,
Bernhard and Lotker, Zvi}, year={2012}, pages={439–440}, collection={LNCS} }'
chicago: 'Schmid, Stefan, Chen Avin, Christian Scheideler, Bernhard Häupler, and
Zvi Lotker. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed
Data Structures.” In Proceedings of the 26th International Symposium on Distributed
Computing (DISC), 439–40. LNCS, 2012. https://doi.org/10.1007/978-3-642-33651-5_47.'
ieee: 'S. Schmid, C. Avin, C. Scheideler, B. Häupler, and Z. Lotker, “Brief Announcement:
SplayNets - Towards Self-Adjusting Distributed Data Structures,” in Proceedings
of the 26th International Symposium on Distributed Computing (DISC), 2012,
pp. 439–440.'
mla: 'Schmid, Stefan, et al. “Brief Announcement: SplayNets - Towards Self-Adjusting
Distributed Data Structures.” Proceedings of the 26th International Symposium
on Distributed Computing (DISC), 2012, pp. 439–40, doi:10.1007/978-3-642-33651-5_47.'
short: 'S. Schmid, C. Avin, C. Scheideler, B. Häupler, Z. Lotker, in: Proceedings
of the 26th International Symposium on Distributed Computing (DISC), 2012, pp.
439–440.'
date_created: 2017-10-17T12:42:53Z
date_updated: 2022-01-06T07:02:58Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-33651-5_47
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:44:09Z
date_updated: 2018-03-15T06:44:09Z
file_id: '1240'
file_name: 625-disc12adjBAshort.pdf
file_size: 717284
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:44:09Z
has_accepted_license: '1'
page: 439-440
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 26th International Symposium on Distributed Computing
(DISC)
series_title: LNCS
status: public
title: 'Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures'
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '626'
abstract:
- lang: eng
text: The design of ecient search structures for peer-to-peer systems has attracted
a lot of attention in recent years. In this announcement we address the problem
of nding the predecessor in a key set and present an ecient data structure called
hashed Predecessor Patricia trie. Our hashed Predecessor Patricia trie supports
PredecessorSearch(x) and Insert(x) and Delete(x) in O(log log u) hash table accesses
when u is the size of the universe of the keys. That is the costs only depend
on u and not the size of the data structure. One feature of our approach is that
it only uses the lookup interface of the hash table and therefore hash table accesses
may be realized by any distributed hash table (DHT).
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Scheideler C. Brief Announcement: Hashed Predecessor Patricia
Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.
In: Proceedings of the 26th International Symposium on Distributed Computing
(DISC). LNCS. ; 2012:435-436. doi:10.1007/978-3-642-33651-5_45'
apa: 'Kniesburges, S., & Scheideler, C. (2012). Brief Announcement: Hashed Predecessor
Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer
Systems. In Proceedings of the 26th International Symposium on Distributed
Computing (DISC) (pp. 435–436). https://doi.org/10.1007/978-3-642-33651-5_45'
bibtex: '@inproceedings{Kniesburges_Scheideler_2012, series={LNCS}, title={Brief
Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient
Predecessor Queries in Peer-to-Peer Systems}, DOI={10.1007/978-3-642-33651-5_45},
booktitle={Proceedings of the 26th International Symposium on Distributed Computing
(DISC)}, author={Kniesburges, Sebastian and Scheideler, Christian}, year={2012},
pages={435–436}, collection={LNCS} }'
chicago: 'Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement:
Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor
Queries in Peer-to-Peer Systems.” In Proceedings of the 26th International
Symposium on Distributed Computing (DISC), 435–36. LNCS, 2012. https://doi.org/10.1007/978-3-642-33651-5_45.'
ieee: 'S. Kniesburges and C. Scheideler, “Brief Announcement: Hashed Predecessor
Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer
Systems,” in Proceedings of the 26th International Symposium on Distributed
Computing (DISC), 2012, pp. 435–436.'
mla: 'Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed
Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries
in Peer-to-Peer Systems.” Proceedings of the 26th International Symposium on
Distributed Computing (DISC), 2012, pp. 435–36, doi:10.1007/978-3-642-33651-5_45.'
short: 'S. Kniesburges, C. Scheideler, in: Proceedings of the 26th International
Symposium on Distributed Computing (DISC), 2012, pp. 435–436.'
date_created: 2017-10-17T12:42:54Z
date_updated: 2022-01-06T07:02:59Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-33651-5_45
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:42:40Z
date_updated: 2018-03-15T06:42:40Z
file_id: '1239'
file_name: 626-Predecessor-Kniesburges_Scheideler.pdf
file_size: 184095
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:42:40Z
has_accepted_license: '1'
page: 435-436
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 26th International Symposium on Distributed Computing
(DISC)
series_title: LNCS
status: public
title: 'Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for
Efficient Predecessor Queries in Peer-to-Peer Systems'
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '628'
abstract:
- lang: eng
text: Network creation games model the creation and usage costs of networks formed
by a set of selfish peers.Each peer has the ability to change the network in a
limited way, e.g., by creating or deleting incident links.In doing so, a peer
can reduce its individual communication cost.Typically, these costs are modeled
by the maximum or average distance in the network.We introduce a generalized version
of the basic network creation game (BNCG).In the BNCG (by Alon et al., SPAA 2010),
each peer may replace one of its incident links by a link to an arbitrary peer.This
is done in a selfish way in order to minimize either the maximum or average distance
to all other peers.That is, each peer works towards a network structure that allows
himself to communicate efficiently with all other peers.However, participants
of large networks are seldom interested in all peers.Rather, they want to communicate
efficiently with a small subset only.Our model incorporates these (communication)
interests explicitly.Given peers with interests and a communication network forming
a tree, we prove several results on the structure and quality of equilibria in
our model.We focus on the MAX-version, i.e., each node tries to minimize the maximum
distance to nodes it is interested in, and give an upper bound of O(\sqrt(n))
for the private costs in an equilibrium of n peers.Moreover, we give an equilibrium
for a circular interest graph where a node has private cost Omega(\sqrt(n)), showing
that our bound is tight.This example can be extended such that we get a tight
bound of Theta(\sqrt(n)) for the price of anarchy.For the case of general networks
we show the price of anarchy to be Theta(n).Additionally, we prove an interesting
connection between a maximum independent set in the interest graph and the private
costs of the peers.
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Martina
full_name: 'Huellmann (married name: Eikel), Martina'
last_name: 'Huellmann (married name: Eikel)'
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: 'Cord-Landwehr A, Huellmann (married name: Eikel) M, Kling P, Setzer A. Basic
Network Creation Games with Communication Interests. In: Proceedings of the
5th International Symposium on Algorithmic Game Theory (SAGT). LNCS. ; 2012:72--83.
doi:10.1007/978-3-642-33996-7_7'
apa: 'Cord-Landwehr, A., Huellmann (married name: Eikel), M., Kling, P., & Setzer,
A. (2012). Basic Network Creation Games with Communication Interests. In Proceedings
of the 5th International Symposium on Algorithmic Game Theory (SAGT) (pp.
72--83). https://doi.org/10.1007/978-3-642-33996-7_7'
bibtex: '@inproceedings{Cord-Landwehr_Huellmann (married name: Eikel)_Kling_Setzer_2012,
series={LNCS}, title={Basic Network Creation Games with Communication Interests},
DOI={10.1007/978-3-642-33996-7_7},
booktitle={Proceedings of the 5th International Symposium on Algorithmic Game
Theory (SAGT)}, author={Cord-Landwehr, Andreas and Huellmann (married name: Eikel),
Martina and Kling, Peter and Setzer, Alexander}, year={2012}, pages={72--83},
collection={LNCS} }'
chicago: 'Cord-Landwehr, Andreas, Martina Huellmann (married name: Eikel), Peter
Kling, and Alexander Setzer. “Basic Network Creation Games with Communication
Interests.” In Proceedings of the 5th International Symposium on Algorithmic
Game Theory (SAGT), 72--83. LNCS, 2012. https://doi.org/10.1007/978-3-642-33996-7_7.'
ieee: 'A. Cord-Landwehr, M. Huellmann (married name: Eikel), P. Kling, and A. Setzer,
“Basic Network Creation Games with Communication Interests,” in Proceedings
of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012,
pp. 72--83.'
mla: Cord-Landwehr, Andreas, et al. “Basic Network Creation Games with Communication
Interests.” Proceedings of the 5th International Symposium on Algorithmic Game
Theory (SAGT), 2012, pp. 72--83, doi:10.1007/978-3-642-33996-7_7.
short: 'A. Cord-Landwehr, M. Huellmann (married name: Eikel), P. Kling, A. Setzer,
in: Proceedings of the 5th International Symposium on Algorithmic Game Theory
(SAGT), 2012, pp. 72--83.'
date_created: 2017-10-17T12:42:54Z
date_updated: 2022-01-06T07:02:59Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1007/978-3-642-33996-7_7
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:42:01Z
date_updated: 2018-03-15T06:42:01Z
file_id: '1238'
file_name: 628-FULL_paper_bncs_with_interests.pdf
file_size: 300591
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:42:01Z
has_accepted_license: '1'
language:
- iso: eng
page: 72--83
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 5th International Symposium on Algorithmic Game Theory
(SAGT)
series_title: LNCS
status: public
title: Basic Network Creation Games with Communication Interests
type: conference
user_id: '477'
year: '2012'
...
---
_id: '632'
abstract:
- lang: eng
text: 'Given an integer h, a graph G = (V;E) with arbitrary positive edge capacities
and k pairs of vertices (s1; t1); (s2; t2); : : : ; (sk; tk), called terminals,
an h-route cut is a set F µ E of edges such that after the removal of the edges
in F no pair si ¡ ti is connected by h edge-disjoint paths (i.e., the connectivity
of every si ¡ ti pair is at most h ¡ 1 in (V;E n F)). The h-route cut is a natural
generalization of the classical cut problem for multicommodity °ows (take h =
1). The main result of this paper is an O(h722h log2 k)-approximation algorithm
for the minimum h-route cut problem in the case that s1 = s2 = ¢ ¢ ¢ = sk, called
the single source case. As a corollary of it we obtain an approximate duality
theorem for multiroute multicom-modity °ows and cuts with a single source. This
partially answers an open question posted in several previous papers dealing with
cuts for multicommodity multiroute problems.'
author:
- first_name: Petr
full_name: Kolman, Petr
last_name: Kolman
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kolman P, Scheideler C. Approximate Duality of Multicommodity Multiroute Flows
and Cuts: Single Source Case. In: Proceedings of the 23th ACM SIAM Symposium
on Discrete Algorithms (SODA). ; 2012:800-810. doi:10.1137/1.9781611973099.64'
apa: 'Kolman, P., & Scheideler, C. (2012). Approximate Duality of Multicommodity
Multiroute Flows and Cuts: Single Source Case. In Proceedings of the 23th ACM
SIAM Symposium on Discrete Algorithms (SODA) (pp. 800–810). https://doi.org/10.1137/1.9781611973099.64'
bibtex: '@inproceedings{Kolman_Scheideler_2012, title={Approximate Duality of Multicommodity
Multiroute Flows and Cuts: Single Source Case}, DOI={10.1137/1.9781611973099.64},
booktitle={Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)},
author={Kolman, Petr and Scheideler, Christian}, year={2012}, pages={800–810}
}'
chicago: 'Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity
Multiroute Flows and Cuts: Single Source Case.” In Proceedings of the 23th
ACM SIAM Symposium on Discrete Algorithms (SODA), 800–810, 2012. https://doi.org/10.1137/1.9781611973099.64.'
ieee: 'P. Kolman and C. Scheideler, “Approximate Duality of Multicommodity Multiroute
Flows and Cuts: Single Source Case,” in Proceedings of the 23th ACM SIAM Symposium
on Discrete Algorithms (SODA), 2012, pp. 800–810.'
mla: 'Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity
Multiroute Flows and Cuts: Single Source Case.” Proceedings of the 23th ACM
SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–10, doi:10.1137/1.9781611973099.64.'
short: 'P. Kolman, C. Scheideler, in: Proceedings of the 23th ACM SIAM Symposium
on Discrete Algorithms (SODA), 2012, pp. 800–810.'
date_created: 2017-10-17T12:42:55Z
date_updated: 2022-01-06T07:03:01Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1137/1.9781611973099.64
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:35:58Z
date_updated: 2018-03-15T06:35:58Z
file_id: '1234'
file_name: 632-SODA2012-Scheideler_01.pdf
file_size: 220213
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:35:58Z
has_accepted_license: '1'
page: 800-810
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)
status: public
title: 'Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source
Case'
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '640'
abstract:
- lang: eng
text: Small-world networks have received significant attention because of their
potential as models for the interaction networks of complex systems. Specifically,
neither random networks nor regular lattices seem to be an adequate framework
within which to study real-world complex systems such as chemical-reaction networks,
neural networks, food webs, social networks, scientific-collaboration networks,
and computer networks. Small-world networks provide some desired properties like
an expected polylogarithmic distance between two processes in the network, which
allows routing in polylogarithmic hops by simple greedy routing, and robustness
against attacks or failures. By these properties, small-world networks are possible
solutions for large overlay networks comparable to structured overlay networks
like CAN, Pastry, Chord, which also provide polylogarithmic routing, but due to
their uniform structure, structured overlay networks are more vulnerable to attacks
or failures. In this paper we bring together a randomized process converging to
a small-world network and a self-stabilization process so that a small-world network
is formed out of any weakly connected initial state. To the best of our knowledge
this is the first distributed self-stabilization process for building a small-world
network.
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Koutsopoulos A, Scheideler C. A Self-Stabilization Process
for Small-World Networks. In: Proceedings of the 26th IEEE International Parallel
and Distributed Processing Symposium (IPDPS). ; 2012:1261--1271. doi:10.1109/IPDPS.2012.115'
apa: Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2012). A Self-Stabilization
Process for Small-World Networks. In Proceedings of the 26th IEEE International
Parallel and Distributed Processing Symposium (IPDPS) (pp. 1261--1271). https://doi.org/10.1109/IPDPS.2012.115
bibtex: '@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2012, title={A Self-Stabilization
Process for Small-World Networks}, DOI={10.1109/IPDPS.2012.115},
booktitle={Proceedings of the 26th IEEE International Parallel and Distributed
Processing Symposium (IPDPS)}, author={Kniesburges, Sebastian and Koutsopoulos,
Andreas and Scheideler, Christian}, year={2012}, pages={1261--1271} }'
chicago: Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler.
“A Self-Stabilization Process for Small-World Networks.” In Proceedings of
the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS),
1261--1271, 2012. https://doi.org/10.1109/IPDPS.2012.115.
ieee: S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A Self-Stabilization
Process for Small-World Networks,” in Proceedings of the 26th IEEE International
Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271.
mla: Kniesburges, Sebastian, et al. “A Self-Stabilization Process for Small-World
Networks.” Proceedings of the 26th IEEE International Parallel and Distributed
Processing Symposium (IPDPS), 2012, pp. 1261--1271, doi:10.1109/IPDPS.2012.115.
short: 'S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th
IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012,
pp. 1261--1271.'
date_created: 2017-10-17T12:42:56Z
date_updated: 2022-01-06T07:03:04Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/IPDPS.2012.115
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T14:13:13Z
date_updated: 2018-03-14T14:13:13Z
file_id: '1230'
file_name: 640-IPDPS2012-Kniesb-Kouts-Scheideler.pdf
file_size: 210176
relation: main_file
success: 1
file_date_updated: 2018-03-14T14:13:13Z
has_accepted_license: '1'
page: 1261--1271
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 26th IEEE International Parallel and Distributed Processing
Symposium (IPDPS)
status: public
title: A Self-Stabilization Process for Small-World Networks
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '1891'
author:
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: 'W. Richa A, Scheideler C, Schmid S, Zhang J. Competitive and Fair Medium Access
Despite Reactive Jamming. In: 2011 International Conference on Distributed
Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011.
IEEE Computer Society; 2011:507--516. doi:10.1109/ICDCS.2011.8'
apa: W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2011). Competitive
and Fair Medium Access Despite Reactive Jamming. In 2011 International Conference
on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June
20-24, 2011 (pp. 507--516). IEEE Computer Society. https://doi.org/10.1109/ICDCS.2011.8
bibtex: '@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Competitive
and Fair Medium Access Despite Reactive Jamming}, DOI={10.1109/ICDCS.2011.8},
booktitle={2011 International Conference on Distributed Computing Systems, ICDCS
2011, Minneapolis, Minnesota, USA, June 20-24, 2011}, publisher={IEEE Computer
Society}, author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan
and Zhang, Jin}, year={2011}, pages={507--516} }'
chicago: W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Competitive
and Fair Medium Access Despite Reactive Jamming.” In 2011 International Conference
on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June
20-24, 2011, 507--516. IEEE Computer Society, 2011. https://doi.org/10.1109/ICDCS.2011.8.
ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and Fair
Medium Access Despite Reactive Jamming,” in 2011 International Conference on
Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24,
2011, 2011, pp. 507--516.
mla: W. Richa, Andrea, et al. “Competitive and Fair Medium Access Despite Reactive
Jamming.” 2011 International Conference on Distributed Computing Systems, ICDCS
2011, Minneapolis, Minnesota, USA, June 20-24, 2011, IEEE Computer Society,
2011, pp. 507--516, doi:10.1109/ICDCS.2011.8.
short: 'A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: 2011 International
Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota,
USA, June 20-24, 2011, IEEE Computer Society, 2011, pp. 507--516.'
date_created: 2018-03-28T07:08:13Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '79'
doi: 10.1109/ICDCS.2011.8
page: 507--516
publication: 2011 International Conference on Distributed Computing Systems, ICDCS
2011, Minneapolis, Minnesota, USA, June 20-24, 2011
publication_identifier:
isbn:
- 978-0-7695-4364-2
publisher: IEEE Computer Society
status: public
title: Competitive and Fair Medium Access Despite Reactive Jamming
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '1892'
author:
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: 'W. Richa A, Scheideler C, Schmid S, Zhang J. Towards jamming-resistant and
competitive medium access in the SINR model. In: Proceedings of the 3rd ACM
Workshop on Wireless of the Students, by the Students, for the Students, S3@MOBICOM
2011, Las Vegas, NV, USA, September 19 - 23, 2011. ACM; 2011:33--36. doi:10.1145/2030686.2030697'
apa: W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2011). Towards jamming-resistant
and competitive medium access in the SINR model. In Proceedings of the 3rd
ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM
2011, Las Vegas, NV, USA, September 19 - 23, 2011 (pp. 33--36). ACM. https://doi.org/10.1145/2030686.2030697
bibtex: '@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Towards jamming-resistant
and competitive medium access in the SINR model}, DOI={10.1145/2030686.2030697},
booktitle={Proceedings of the 3rd ACM workshop on Wireless of the students, by
the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September
19 - 23, 2011}, publisher={ACM}, author={W. Richa, Andrea and Scheideler, Christian
and Schmid, Stefan and Zhang, Jin}, year={2011}, pages={33--36} }'
chicago: W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Towards
Jamming-Resistant and Competitive Medium Access in the SINR Model.” In Proceedings
of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the
Students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011, 33--36.
ACM, 2011. https://doi.org/10.1145/2030686.2030697.
ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Towards jamming-resistant
and competitive medium access in the SINR model,” in Proceedings of the 3rd
ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM
2011, Las Vegas, NV, USA, September 19 - 23, 2011, 2011, pp. 33--36.
mla: W. Richa, Andrea, et al. “Towards Jamming-Resistant and Competitive Medium
Access in the SINR Model.” Proceedings of the 3rd ACM Workshop on Wireless
of the Students, by the Students, for the Students, S3@MOBICOM 2011, Las Vegas,
NV, USA, September 19 - 23, 2011, ACM, 2011, pp. 33--36, doi:10.1145/2030686.2030697.
short: 'A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the
3rd ACM Workshop on Wireless of the Students, by the Students, for the Students,
S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011, ACM, 2011, pp. 33--36.'
date_created: 2018-03-28T07:09:07Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '79'
doi: 10.1145/2030686.2030697
page: 33--36
publication: Proceedings of the 3rd ACM workshop on Wireless of the students, by the
students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 -
23, 2011
publication_identifier:
isbn:
- 978-1-4503-0868-7
publisher: ACM
status: public
title: Towards jamming-resistant and competitive medium access in the SINR model
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '1893'
author:
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: 'W. Richa A, Scheideler C, Schmid S, Zhang J. Self-stabilizing leader election
for single-hop wireless networks despite jamming. In: Proceedings of the 12th
ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc
2011, Paris, France, May 16-20, 2011. ACM; 2011:15. doi:10.1145/2107502.2107522'
apa: W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2011). Self-stabilizing
leader election for single-hop wireless networks despite jamming. In Proceedings
of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing,
MobiHoc 2011, Paris, France, May 16-20, 2011 (p. 15). ACM. https://doi.org/10.1145/2107502.2107522
bibtex: '@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Self-stabilizing
leader election for single-hop wireless networks despite jamming}, DOI={10.1145/2107502.2107522},
booktitle={Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc
Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011}, publisher={ACM},
author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang,
Jin}, year={2011}, pages={15} }'
chicago: W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Self-Stabilizing
Leader Election for Single-Hop Wireless Networks despite Jamming.” In Proceedings
of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing,
MobiHoc 2011, Paris, France, May 16-20, 2011, 15. ACM, 2011. https://doi.org/10.1145/2107502.2107522.
ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Self-stabilizing leader
election for single-hop wireless networks despite jamming,” in Proceedings
of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing,
MobiHoc 2011, Paris, France, May 16-20, 2011, 2011, p. 15.
mla: W. Richa, Andrea, et al. “Self-Stabilizing Leader Election for Single-Hop Wireless
Networks despite Jamming.” Proceedings of the 12th ACM Interational Symposium
on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20,
2011, ACM, 2011, p. 15, doi:10.1145/2107502.2107522.
short: 'A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the
12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc
2011, Paris, France, May 16-20, 2011, ACM, 2011, p. 15.'
date_created: 2018-03-28T07:09:54Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '79'
doi: 10.1145/2107502.2107522
page: '15'
publication: Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking
and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011
publication_identifier:
isbn:
- 978-1-4503-0722-2
publisher: ACM
status: public
title: Self-stabilizing leader election for single-hop wireless networks despite jamming
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '1895'
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Koutsopoulos A, Scheideler C. Re-Chord: a self-stabilizing
chord overlay network. In: SPAA 2011: Proceedings of the 23rd Annual ACM Symposium
on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011
(Co-Located with FCRC 2011). ; 2011:235--244. doi:10.1145/1989493.1989527'
apa: 'Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2011). Re-Chord:
a self-stabilizing chord overlay network. In SPAA 2011: Proceedings of the
23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San
Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011) (pp. 235--244).
https://doi.org/10.1145/1989493.1989527'
bibtex: '@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2011, title={Re-Chord:
a self-stabilizing chord overlay network}, DOI={10.1145/1989493.1989527},
booktitle={SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism
in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located
with FCRC 2011)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and
Scheideler, Christian}, year={2011}, pages={235--244} }'
chicago: 'Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler.
“Re-Chord: A Self-Stabilizing Chord Overlay Network.” In SPAA 2011: Proceedings
of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures,
San Jose, CA, USA, June 4-6, 2011 (Co-Located with FCRC 2011), 235--244, 2011.
https://doi.org/10.1145/1989493.1989527.'
ieee: 'S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “Re-Chord: a self-stabilizing
chord overlay network,” in SPAA 2011: Proceedings of the 23rd Annual ACM Symposium
on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011
(Co-located with FCRC 2011), 2011, pp. 235--244.'
mla: 'Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay
Network.” SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism
in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-Located
with FCRC 2011), 2011, pp. 235--244, doi:10.1145/1989493.1989527.'
short: 'S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: SPAA 2011: Proceedings
of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures,
San Jose, CA, USA, June 4-6, 2011 (Co-Located with FCRC 2011), 2011, pp. 235--244.'
date_created: 2018-03-28T07:12:49Z
date_updated: 2022-01-06T06:53:55Z
department:
- _id: '79'
doi: 10.1145/1989493.1989527
page: 235--244
publication: 'SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism
in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with
FCRC 2011)'
publication_identifier:
isbn:
- 978-1-4503-0743-7
status: public
title: 'Re-Chord: a self-stabilizing chord overlay network'
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '1899'
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Scheideler C. Hashed Patricia Trie: Efficient Longest Prefix
Matching in Peer-to-Peer Systems. In: WALCOM: Algorithms and Computation -
5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011.
Proceedings. Vol 6552. Lecture Notes in Computer Science. Springer; 2011:170--181.
doi:10.1007/978-3-642-19094-0_18'
apa: 'Kniesburges, S., & Scheideler, C. (2011). Hashed Patricia Trie: Efficient
Longest Prefix Matching in Peer-to-Peer Systems. In WALCOM: Algorithms and
Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February
18-20, 2011. Proceedings (Vol. 6552, pp. 170--181). Springer. https://doi.org/10.1007/978-3-642-19094-0_18'
bibtex: '@inproceedings{Kniesburges_Scheideler_2011, series={Lecture Notes in Computer
Science}, title={Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer
Systems}, volume={6552}, DOI={10.1007/978-3-642-19094-0_18},
booktitle={WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM
2011, New Delhi, India, February 18-20, 2011. Proceedings}, publisher={Springer},
author={Kniesburges, Sebastian and Scheideler, Christian}, year={2011}, pages={170--181},
collection={Lecture Notes in Computer Science} }'
chicago: 'Kniesburges, Sebastian, and Christian Scheideler. “Hashed Patricia Trie:
Efficient Longest Prefix Matching in Peer-to-Peer Systems.” In WALCOM: Algorithms
and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February
18-20, 2011. Proceedings, 6552:170--181. Lecture Notes in Computer Science.
Springer, 2011. https://doi.org/10.1007/978-3-642-19094-0_18.'
ieee: 'S. Kniesburges and C. Scheideler, “Hashed Patricia Trie: Efficient Longest
Prefix Matching in Peer-to-Peer Systems,” in WALCOM: Algorithms and Computation
- 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011.
Proceedings, 2011, vol. 6552, pp. 170--181.'
mla: 'Kniesburges, Sebastian, and Christian Scheideler. “Hashed Patricia Trie: Efficient
Longest Prefix Matching in Peer-to-Peer Systems.” WALCOM: Algorithms and Computation
- 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011.
Proceedings, vol. 6552, Springer, 2011, pp. 170--181, doi:10.1007/978-3-642-19094-0_18.'
short: 'S. Kniesburges, C. Scheideler, in: WALCOM: Algorithms and Computation -
5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011.
Proceedings, Springer, 2011, pp. 170--181.'
date_created: 2018-03-28T07:17:05Z
date_updated: 2022-01-06T06:53:56Z
department:
- _id: '79'
doi: 10.1007/978-3-642-19094-0_18
intvolume: ' 6552'
page: 170--181
publication: 'WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM
2011, New Delhi, India, February 18-20, 2011. Proceedings'
publication_identifier:
isbn:
- 978-3-642-19093-3
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems'
type: conference
user_id: '15504'
volume: 6552
year: '2011'
...
---
_id: '1900'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
citation:
ama: 'Scheideler C, Graffi K. Programming for Distributed Computing: From Physical
to Logical Networks. In: Computer Science, The Hardware, Software and Heart
of It. Springer; 2011:155--168. doi:10.1007/978-1-4614-1168-0_9'
apa: 'Scheideler, C., & Graffi, K. (2011). Programming for Distributed Computing:
From Physical to Logical Networks. In Computer Science, The Hardware, Software
and Heart of It (pp. 155--168). Springer. https://doi.org/10.1007/978-1-4614-1168-0_9'
bibtex: '@inbook{Scheideler_Graffi_2011, title={Programming for Distributed Computing:
From Physical to Logical Networks}, DOI={10.1007/978-1-4614-1168-0_9},
booktitle={Computer Science, The Hardware, Software and Heart of It}, publisher={Springer},
author={Scheideler, Christian and Graffi, Kalman}, year={2011}, pages={155--168}
}'
chicago: 'Scheideler, Christian, and Kalman Graffi. “Programming for Distributed
Computing: From Physical to Logical Networks.” In Computer Science, The Hardware,
Software and Heart of It, 155--168. Springer, 2011. https://doi.org/10.1007/978-1-4614-1168-0_9.'
ieee: 'C. Scheideler and K. Graffi, “Programming for Distributed Computing: From
Physical to Logical Networks,” in Computer Science, The Hardware, Software
and Heart of It, Springer, 2011, pp. 155--168.'
mla: 'Scheideler, Christian, and Kalman Graffi. “Programming for Distributed Computing:
From Physical to Logical Networks.” Computer Science, The Hardware, Software
and Heart of It, Springer, 2011, pp. 155--168, doi:10.1007/978-1-4614-1168-0_9.'
short: 'C. Scheideler, K. Graffi, in: Computer Science, The Hardware, Software and
Heart of It, Springer, 2011, pp. 155--168.'
date_created: 2018-03-28T07:17:53Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '79'
doi: 10.1007/978-1-4614-1168-0_9
page: 155--168
publication: Computer Science, The Hardware, Software and Heart of It
publication_identifier:
isbn:
- 978-1-4614-1167-3
publisher: Springer
status: public
title: 'Programming for Distributed Computing: From Physical to Logical Networks'
type: book_chapter
user_id: '15504'
year: '2011'
...
---
_id: '1901'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Scheideler C. Broadcasting - How Can I Quickly Disseminate Information? In:
Algorithms Unplugged. Springer; 2011:223--229. doi:10.1007/978-3-642-15328-0_22'
apa: Scheideler, C. (2011). Broadcasting - How Can I Quickly Disseminate Information?
In Algorithms Unplugged (pp. 223--229). Springer. https://doi.org/10.1007/978-3-642-15328-0_22
bibtex: '@inbook{Scheideler_2011, title={Broadcasting - How Can I Quickly Disseminate
Information?}, DOI={10.1007/978-3-642-15328-0_22},
booktitle={Algorithms Unplugged}, publisher={Springer}, author={Scheideler, Christian},
year={2011}, pages={223--229} }'
chicago: Scheideler, Christian. “Broadcasting - How Can I Quickly Disseminate Information?”
In Algorithms Unplugged, 223--229. Springer, 2011. https://doi.org/10.1007/978-3-642-15328-0_22.
ieee: C. Scheideler, “Broadcasting - How Can I Quickly Disseminate Information?,”
in Algorithms Unplugged, Springer, 2011, pp. 223--229.
mla: Scheideler, Christian. “Broadcasting - How Can I Quickly Disseminate Information?”
Algorithms Unplugged, Springer, 2011, pp. 223--229, doi:10.1007/978-3-642-15328-0_22.
short: 'C. Scheideler, in: Algorithms Unplugged, Springer, 2011, pp. 223--229.'
date_created: 2018-03-28T07:18:43Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '79'
doi: 10.1007/978-3-642-15328-0_22
page: 223--229
publication: Algorithms Unplugged
publication_identifier:
isbn:
- 978-3-642-15327-3
publisher: Springer
status: public
title: Broadcasting - How Can I Quickly Disseminate Information?
type: book_chapter
user_id: '15504'
year: '2011'
...
---
_id: '1902'
author:
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
- first_name: Helmut
full_name: Alt, Helmut
last_name: Alt
- first_name: Martin
full_name: Dietzfelbinger, Martin
last_name: Dietzfelbinger
- first_name: Rüdiger
full_name: Reischuk, Rüdiger
last_name: Reischuk
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Heribert
full_name: Vollmer, Heribert
last_name: Vollmer
- first_name: Dorothea
full_name: Wagner, Dorothea
last_name: Wagner
citation:
ama: Vöcking B, Alt H, Dietzfelbinger M, et al. Algorithms Unplugged.; 2011.
doi:10.1007/978-3-642-15328-0
apa: Vöcking, B., Alt, H., Dietzfelbinger, M., Reischuk, R., Scheideler, C., Vollmer,
H., & Wagner, D. (2011). Algorithms Unplugged. https://doi.org/10.1007/978-3-642-15328-0
bibtex: '@book{Vöcking_Alt_Dietzfelbinger_Reischuk_Scheideler_Vollmer_Wagner_2011,
title={Algorithms Unplugged}, DOI={10.1007/978-3-642-15328-0},
author={Vöcking, Berthold and Alt, Helmut and Dietzfelbinger, Martin and Reischuk,
Rüdiger and Scheideler, Christian and Vollmer, Heribert and Wagner, Dorothea},
year={2011} }'
chicago: Vöcking, Berthold, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk,
Christian Scheideler, Heribert Vollmer, and Dorothea Wagner. Algorithms Unplugged,
2011. https://doi.org/10.1007/978-3-642-15328-0.
ieee: B. Vöcking et al., Algorithms Unplugged. 2011.
mla: Vöcking, Berthold, et al. Algorithms Unplugged. 2011, doi:10.1007/978-3-642-15328-0.
short: B. Vöcking, H. Alt, M. Dietzfelbinger, R. Reischuk, C. Scheideler, H. Vollmer,
D. Wagner, Algorithms Unplugged, 2011.
date_created: 2018-03-28T07:19:31Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '79'
doi: 10.1007/978-3-642-15328-0
publication_identifier:
isbn:
- 978-3-642-15327-3
status: public
title: Algorithms Unplugged
type: book
user_id: '15504'
year: '2011'
...
---
_id: '1924'
author:
- first_name: Petr
full_name: Kolman, Petr
last_name: Kolman
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kolman P, Scheideler C. Towards Duality of Multicommodity Multiroute Cuts
and Flows: Multilevel Ball-Growing. In: 28th International Symposium on Theoretical
Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany.
; 2011:129--140. doi:10.4230/LIPIcs.STACS.2011.129'
apa: 'Kolman, P., & Scheideler, C. (2011). Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing. In 28th International Symposium
on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund,
Germany (pp. 129--140). https://doi.org/10.4230/LIPIcs.STACS.2011.129'
bibtex: '@inproceedings{Kolman_Scheideler_2011, title={Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing}, DOI={10.4230/LIPIcs.STACS.2011.129},
booktitle={28th International Symposium on Theoretical Aspects of Computer Science,
STACS 2011, March 10-12, 2011, Dortmund, Germany}, author={Kolman, Petr and Scheideler,
Christian}, year={2011}, pages={129--140} }'
chicago: 'Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing.” In 28th International
Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12,
2011, Dortmund, Germany, 129--140, 2011. https://doi.org/10.4230/LIPIcs.STACS.2011.129.'
ieee: 'P. Kolman and C. Scheideler, “Towards Duality of Multicommodity Multiroute
Cuts and Flows: Multilevel Ball-Growing,” in 28th International Symposium on
Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund,
Germany, 2011, pp. 129--140.'
mla: 'Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing.” 28th International Symposium
on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund,
Germany, 2011, pp. 129--140, doi:10.4230/LIPIcs.STACS.2011.129.'
short: 'P. Kolman, C. Scheideler, in: 28th International Symposium on Theoretical
Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany,
2011, pp. 129--140.'
date_created: 2018-03-29T08:44:00Z
date_updated: 2022-01-06T06:54:00Z
department:
- _id: '79'
doi: 10.4230/LIPIcs.STACS.2011.129
page: 129--140
publication: 28th International Symposium on Theoretical Aspects of Computer Science,
STACS 2011, March 10-12, 2011, Dortmund, Germany
status: public
title: 'Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing'
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '17997'
author:
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: Setzer A. Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern
in Einem Peer-to-Peer Netzwerk. Universität Paderborn; 2011.
apa: Setzer, A. (2011). Lokale Online-Strategien zur linearen Anordnung von Teilnehmern
in einem Peer-to-Peer Netzwerk. Universität Paderborn.
bibtex: '@book{Setzer_2011, title={Lokale Online-Strategien zur linearen Anordnung
von Teilnehmern in einem Peer-to-Peer Netzwerk}, publisher={Universität Paderborn},
author={Setzer, Alexander}, year={2011} }'
chicago: Setzer, Alexander. Lokale Online-Strategien Zur Linearen Anordnung von
Teilnehmern in Einem Peer-to-Peer Netzwerk. Universität Paderborn, 2011.
ieee: A. Setzer, Lokale Online-Strategien zur linearen Anordnung von Teilnehmern
in einem Peer-to-Peer Netzwerk. Universität Paderborn, 2011.
mla: Setzer, Alexander. Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern
in Einem Peer-to-Peer Netzwerk. Universität Paderborn, 2011.
short: A. Setzer, Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern
in Einem Peer-to-Peer Netzwerk, Universität Paderborn, 2011.
date_created: 2020-08-17T08:08:13Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer
Netzwerk
type: bachelorsthesis
user_id: '477'
year: '2011'
...