---
_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: '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: '594'
author:
- first_name: Timo
full_name: Klerx, Timo
last_name: Klerx
citation:
ama: Klerx T. Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen
Netzen. Universität Paderborn; 2012.
apa: Klerx, T. (2012). Online Parameteroptimierung in P2P-Netzwerken mit Hilfe
von Neuronalen Netzen. Universität Paderborn.
bibtex: '@book{Klerx_2012, title={Online Parameteroptimierung in P2P-Netzwerken
mit Hilfe von Neuronalen Netzen}, publisher={Universität Paderborn}, author={Klerx,
Timo}, year={2012} }'
chicago: Klerx, Timo. Online Parameteroptimierung in P2P-Netzwerken mit Hilfe
von Neuronalen Netzen. Universität Paderborn, 2012.
ieee: T. Klerx, Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen
Netzen. Universität Paderborn, 2012.
mla: Klerx, Timo. Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von
Neuronalen Netzen. Universität Paderborn, 2012.
short: T. Klerx, Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen
Netzen, Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:47Z
date_updated: 2022-01-06T07:02:48Z
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
title: Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen
type: mastersthesis
user_id: '477'
year: '2012'
...
---
_id: '600'
author:
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
citation:
ama: Feldkord B. Lokale Swaps und überholte Informationen in Basic Network Creation
Games. Universität Paderborn; 2012.
apa: Feldkord, B. (2012). Lokale Swaps und überholte Informationen in Basic Network
Creation Games. Universität Paderborn.
bibtex: '@book{Feldkord_2012, title={Lokale Swaps und überholte Informationen in
Basic Network Creation Games}, publisher={Universität Paderborn}, author={Feldkord,
Björn}, year={2012} }'
chicago: Feldkord, Björn. Lokale Swaps und überholte Informationen in Basic Network
Creation Games. Universität Paderborn, 2012.
ieee: B. Feldkord, Lokale Swaps und überholte Informationen in Basic Network
Creation Games. Universität Paderborn, 2012.
mla: Feldkord, Björn. Lokale Swaps und überholte Informationen in Basic Network
Creation Games. Universität Paderborn, 2012.
short: B. Feldkord, Lokale Swaps und überholte Informationen in Basic Network Creation
Games, Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:49Z
date_updated: 2022-01-06T07:02:49Z
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
title: Lokale Swaps und überholte Informationen in Basic Network Creation Games
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '601'
abstract:
- lang: eng
text: Wir betrachten eine Gruppe von mobilen, autonomen Robotern in einem ebenen
Gel{\"a}nde. Es gibt keine zentrale Steuerung und die Roboter m{\"u}ssen sich
selbst koordinieren. Zentrale Herausforderung dabei ist, dass jeder Roboter nur
seine unmittelbare Nachbarschaft sieht und auch nur mit Robotern in seiner unmittelbaren
Nachbarschaft kommunizieren kann. Daraus ergeben sich viele algorithmische Fragestellungen.
In dieser Arbeit wird untersucht, unter welchen Voraussetzungen die Roboter sich
auf einem Punkt versammeln bzw. eine Linie zwischen zwei festen Stationen bilden
k{\"o}nnen. Daf{\"u}r werden mehrere Roboter-Strategien in verschiedenen Bewegungsmodellen
vorgestellt. Diese Strategien werden auf ihre Effizienz hin untersucht. Es werden
obere und untere Schranken f{\"u}r die ben{\"o}tigte Anzahl Runden und die Bewegungsdistanz
gezeigt. In einigen F{\"a}llen wird außerdem die ben{\"o}tigte Bewegungsdistanz
mit derjenigen Bewegungsdistanz verglichen, die eine optimale globale Strategie
auf der gleichen Instanz ben{\"o}tigen w{\"u}rde. So werden kompetititve Faktoren
hergeleitet.
author:
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
citation:
ama: Kempkes B. Local Strategies for Robot Formation Problems. Vol 302. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 2012.
apa: Kempkes, B. (2012). Local strategies for robot formation problems (Vol.
302). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Kempkes_2012, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Local strategies for robot formation problems}, volume={302},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Kempkes,
Barbara}, year={2012}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn} }'
chicago: Kempkes, Barbara. Local Strategies for Robot Formation Problems.
Vol. 302. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2012.
ieee: B. Kempkes, Local strategies for robot formation problems, vol. 302.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.
mla: Kempkes, Barbara. Local Strategies for Robot Formation Problems. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2012.
short: B. Kempkes, Local Strategies for Robot Formation Problems, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2012.
date_created: 2017-10-17T12:42:49Z
date_updated: 2022-01-06T07:02:50Z
ddc:
- '040'
department:
- _id: '63'
- _id: '26'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:16:44Z
date_updated: 2018-03-15T08:16:44Z
file_id: '1252'
file_name: 601-Kempkes-PhD.pdf
file_size: 3805310
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:16:44Z
has_accepted_license: '1'
intvolume: ' 302'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication_identifier:
isbn:
- 978-3-942647-21-2
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Local strategies for robot formation problems
type: dissertation
user_id: '5786'
volume: 302
year: '2012'
...
---
_id: '6055'
author:
- first_name: Alexander
full_name: Mehler, Alexander
last_name: Mehler
- first_name: Andy
full_name: Lücking, Andy
last_name: Lücking
- first_name: Peter
full_name: Menke, Peter
id: '59649'
last_name: Menke
citation:
ama: Mehler A, Lücking A, Menke P. Assessing cognitive alignment in different types
of dialog by means of a network model. Neural Networks. 2012;32:159-164.
doi:10.1016/j.neunet.2012.02.013
apa: Mehler, A., Lücking, A., & Menke, P. (2012). Assessing cognitive alignment
in different types of dialog by means of a network model. Neural Networks,
32, 159–164. https://doi.org/10.1016/j.neunet.2012.02.013
bibtex: '@article{Mehler_Lücking_Menke_2012, title={Assessing cognitive alignment
in different types of dialog by means of a network model}, volume={32}, DOI={10.1016/j.neunet.2012.02.013},
journal={Neural Networks}, publisher={Elsevier BV}, author={Mehler, Alexander
and Lücking, Andy and Menke, Peter}, year={2012}, pages={159–164} }'
chicago: 'Mehler, Alexander, Andy Lücking, and Peter Menke. “Assessing Cognitive
Alignment in Different Types of Dialog by Means of a Network Model.” Neural
Networks 32 (2012): 159–64. https://doi.org/10.1016/j.neunet.2012.02.013.'
ieee: A. Mehler, A. Lücking, and P. Menke, “Assessing cognitive alignment in different
types of dialog by means of a network model,” Neural Networks, vol. 32,
pp. 159–164, 2012.
mla: Mehler, Alexander, et al. “Assessing Cognitive Alignment in Different Types
of Dialog by Means of a Network Model.” Neural Networks, vol. 32, Elsevier
BV, 2012, pp. 159–64, doi:10.1016/j.neunet.2012.02.013.
short: A. Mehler, A. Lücking, P. Menke, Neural Networks 32 (2012) 159–164.
date_created: 2018-12-07T15:17:39Z
date_updated: 2022-01-06T07:02:51Z
department:
- _id: '115'
doi: 10.1016/j.neunet.2012.02.013
extern: '1'
intvolume: ' 32'
language:
- iso: eng
page: 159-164
publication: Neural Networks
publication_identifier:
issn:
- 0893-6080
publication_status: published
publisher: Elsevier BV
status: public
title: Assessing cognitive alignment in different types of dialog by means of a network
model
type: journal_article
user_id: '59649'
volume: 32
year: '2012'
...
---
_id: '6057'
author:
- first_name: Peter
full_name: Menke, Peter
id: '59649'
last_name: Menke
citation:
ama: 'Menke P. Evaluation of Technical Communication. In: Handbook of Technical
Communication. Vol 8. Handbooks of Applied Linguistics. de Gruyter; 2012:285–314.'
apa: Menke, P. (2012). Evaluation of Technical Communication. In Handbook of
Technical Communication (Vol. 8, pp. 285–314). de Gruyter.
bibtex: '@inbook{Menke_2012, series={Handbooks of Applied Linguistics}, title={Evaluation
of Technical Communication}, volume={8}, booktitle={Handbook of Technical Communication},
publisher={de Gruyter}, author={Menke, Peter}, year={2012}, pages={285–314}, collection={Handbooks
of Applied Linguistics} }'
chicago: Menke, Peter. “Evaluation of Technical Communication.” In Handbook of
Technical Communication, 8:285–314. Handbooks of Applied Linguistics. de Gruyter,
2012.
ieee: P. Menke, “Evaluation of Technical Communication,” in Handbook of Technical
Communication, vol. 8, de Gruyter, 2012, pp. 285–314.
mla: Menke, Peter. “Evaluation of Technical Communication.” Handbook of Technical
Communication, vol. 8, de Gruyter, 2012, pp. 285–314.
short: 'P. Menke, in: Handbook of Technical Communication, de Gruyter, 2012, pp.
285–314.'
date_created: 2018-12-07T15:22:25Z
date_updated: 2022-01-06T07:02:51Z
department:
- _id: '115'
extern: '1'
intvolume: ' 8'
language:
- iso: eng
page: 285–314
publication: Handbook of Technical Communication
publication_identifier:
isbn:
- 978-3-11-018834-9
publication_status: published
publisher: de Gruyter
series_title: Handbooks of Applied Linguistics
status: public
title: Evaluation of Technical Communication
type: book_chapter
user_id: '59649'
volume: 8
year: '2012'
...
---
_id: '618'
author:
- first_name: Sven
full_name: Kurras, Sven
last_name: Kurras
citation:
ama: Kurras S. Distributed Sampling of Regular Graphs. Universität Paderborn;
2012.
apa: Kurras, S. (2012). Distributed Sampling of Regular Graphs. Universität
Paderborn.
bibtex: '@book{Kurras_2012, title={Distributed Sampling of Regular Graphs}, publisher={Universität
Paderborn}, author={Kurras, Sven}, year={2012} }'
chicago: Kurras, Sven. Distributed Sampling of Regular Graphs. Universität
Paderborn, 2012.
ieee: S. Kurras, Distributed Sampling of Regular Graphs. Universität Paderborn,
2012.
mla: Kurras, Sven. Distributed Sampling of Regular Graphs. Universität Paderborn,
2012.
short: S. Kurras, Distributed Sampling of Regular Graphs, Universität Paderborn,
2012.
date_created: 2017-10-17T12:42:52Z
date_updated: 2022-01-06T07:02:55Z
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: Distributed Sampling of Regular Graphs
type: mastersthesis
user_id: '15504'
year: '2012'
...
---
_id: '619'
abstract:
- lang: eng
text: 'Dynamics in networks is caused by a variety of reasons, like nodes moving
in 2D (or 3D) in multihop cellphone networks, joins and leaves in peer-to-peer
networks, evolution in social networks, and many others. In order to understand
such kinds of dynamics, and to design distributed algorithms that behave well
under dynamics, many ways to model dynamics are introduced and analyzed w.r.t.
correctness and eciency of distributed algorithms. In [16], Kuhn, Lynch, and Oshman
have introduced a very general, worst case type model of dynamics: The edge set
of the network may change arbitrarily from step to step, the only restriction
is that it is connected at all times and the set of nodes does not change. An
extended model demands that a xed connected subnetwork is maintained over each
time interval of length T (T-interval dynamics). They have presented, among others,
algorithms for counting the number of nodes under such general models of dynamics.In
this paper, we generalize their models and algorithms by adding random edge faults,
i.e., we consider fault-prone dynamic networks: We assume that an edge currently
existing may fail to transmit data with some probability p. We rst observe that
strong counting, i.e., each node knows the correct count and stops, is not possible
in a model with random edge faults. Our main two positive results are feasibility
and runtime bounds for weak counting, i.e., stopping is no longer required (but
still a correct count in each node), and for strong counting with an upper bound,
i.e., an upper bound N on n is known to all nodes.'
author:
- first_name: Philipp
full_name: Brandes, Philipp
last_name: Brandes
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Brandes P, Meyer auf der Heide F. Distributed Computing in Fault-Prone Dynamic
Networks. In: Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic
Distributed Systems (TADDS). ICPS. ; 2012:9-14. doi:10.1145/2414815.2414818'
apa: Brandes, P., & Meyer auf der Heide, F. (2012). Distributed Computing in
Fault-Prone Dynamic Networks. In Proceedings of the 4th Workshop on Theoretical
Aspects of Dynamic Distributed Systems (TADDS) (pp. 9–14). https://doi.org/10.1145/2414815.2414818
bibtex: '@inproceedings{Brandes_Meyer auf der Heide_2012, series={ICPS}, title={Distributed
Computing in Fault-Prone Dynamic Networks}, DOI={10.1145/2414815.2414818},
booktitle={Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed
Systems (TADDS)}, author={Brandes, Philipp and Meyer auf der Heide, Friedhelm},
year={2012}, pages={9–14}, collection={ICPS} }'
chicago: Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing
in Fault-Prone Dynamic Networks.” In Proceedings of the 4th Workshop on Theoretical
Aspects of Dynamic Distributed Systems (TADDS), 9–14. ICPS, 2012. https://doi.org/10.1145/2414815.2414818.
ieee: P. Brandes and F. Meyer auf der Heide, “Distributed Computing in Fault-Prone
Dynamic Networks,” in Proceedings of the 4th Workshop on Theoretical Aspects
of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14.
mla: Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing
in Fault-Prone Dynamic Networks.” Proceedings of the 4th Workshop on Theoretical
Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14, doi:10.1145/2414815.2414818.
short: 'P. Brandes, F. Meyer auf der Heide, in: Proceedings of the 4th Workshop
on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14.'
date_created: 2017-10-17T12:42:52Z
date_updated: 2022-01-06T07:02:56Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1145/2414815.2414818
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:47:15Z
date_updated: 2018-03-15T06:47:15Z
file_id: '1244'
file_name: 619-Brandes_MadHTADDS12_01.pdf
file_size: 346044
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:47:15Z
has_accepted_license: '1'
page: 9-14
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 4th Workshop on Theoretical Aspects of Dynamic Distributed
Systems (TADDS)
series_title: ICPS
status: public
title: Distributed Computing in Fault-Prone Dynamic Networks
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: '636'
abstract:
- lang: eng
text: We consider an online facility location problem where clients arrive over
time and their demands have to be served by opening facilities and assigning the
clients to opened facilities. When opening a facility we must choose one of K
different lease types to use. A lease type k has a certain lease length lk. Opening
a facility i using lease type k causes a cost of f k i and ensures that i is open
for the next lk time steps. In addition to costs for opening facilities, we have
to take connection costs ci j into account when assigning a client j to facility
i. We develop and analyze the first online algorithm for this problem that has
a time-independent competitive factor.This variant of the online facility location
problem was introduced by Nagarajan and Williamson [7] and is strongly related
to both the online facility problem by Meyerson [5] and the parking permit problem
by Meyerson [6]. Nagarajan and Williamson gave a 3-approximation algorithm for
the offline problem and an O(Klogn)-competitive algorithm for the online variant.
Here, n denotes the total number of clients arriving over time. We extend their
result by removing the dependency on n (and thereby on the time). In general,
our algorithm is O(lmax log(lmax))-competitive. Here lmax denotes the maximum
lease length. Moreover, we prove that it is O(log2(lmax))-competitive for many
“natural” cases. Such cases include, for example, situations where the number
of clients arriving in each time step does not vary too much, or is non-increasing,
or is polynomially bounded in lmax.
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Peter
full_name: Pietrzyk, Peter
last_name: Pietrzyk
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
citation:
ama: 'Meyer auf der Heide F, Pietrzyk P, Kling P. An Algorithm for Facility Leasing.
In: Proceedings of the 19th International Colloquium on Structural Information
& Communication Complexity (SIROCCO). LNCS. ; 2012:61-72. doi:10.1007/978-3-642-31104-8_6'
apa: Meyer auf der Heide, F., Pietrzyk, P., & Kling, P. (2012). An Algorithm
for Facility Leasing. In Proceedings of the 19th International Colloquium on
Structural Information & Communication Complexity (SIROCCO) (pp. 61–72).
https://doi.org/10.1007/978-3-642-31104-8_6
bibtex: '@inproceedings{Meyer auf der Heide_Pietrzyk_Kling_2012, series={LNCS},
title={An Algorithm for Facility Leasing}, DOI={10.1007/978-3-642-31104-8_6},
booktitle={Proceedings of the 19th International Colloquium on Structural Information
& Communication Complexity (SIROCCO)}, author={Meyer auf der Heide, Friedhelm
and Pietrzyk, Peter and Kling, Peter}, year={2012}, pages={61–72}, collection={LNCS}
}'
chicago: Meyer auf der Heide, Friedhelm, Peter Pietrzyk, and Peter Kling. “An Algorithm
for Facility Leasing.” In Proceedings of the 19th International Colloquium
on Structural Information & Communication Complexity (SIROCCO), 61–72.
LNCS, 2012. https://doi.org/10.1007/978-3-642-31104-8_6.
ieee: F. Meyer auf der Heide, P. Pietrzyk, and P. Kling, “An Algorithm for Facility
Leasing,” in Proceedings of the 19th International Colloquium on Structural
Information & Communication Complexity (SIROCCO), 2012, pp. 61–72.
mla: Meyer auf der Heide, Friedhelm, et al. “An Algorithm for Facility Leasing.”
Proceedings of the 19th International Colloquium on Structural Information
& Communication Complexity (SIROCCO), 2012, pp. 61–72, doi:10.1007/978-3-642-31104-8_6.
short: 'F. Meyer auf der Heide, P. Pietrzyk, P. Kling, in: Proceedings of the 19th
International Colloquium on Structural Information & Communication Complexity
(SIROCCO), 2012, pp. 61–72.'
date_created: 2017-10-17T12:42:56Z
date_updated: 2022-01-06T07:03:02Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-642-31104-8_6
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T14:14:21Z
date_updated: 2018-03-14T14:14:21Z
file_id: '1232'
file_name: 636-Online_Facility_Location.pdf
file_size: 173049
relation: main_file
success: 1
file_date_updated: 2018-03-14T14:14:21Z
has_accepted_license: '1'
page: 61-72
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 19th International Colloquium on Structural Information
& Communication Complexity (SIROCCO)
series_title: LNCS
status: public
title: An Algorithm for Facility Leasing
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '638'
author:
- first_name: Fabian
full_name: Eidens, Fabian
id: '25078'
last_name: Eidens
citation:
ama: Eidens F. Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken.
Universität Paderborn; 2012.
apa: Eidens, F. (2012). Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken.
Universität Paderborn.
bibtex: '@book{Eidens_2012, title={Adaptive Verbindungsstrategien in dynamischen
Suchnetzwerken}, publisher={Universität Paderborn}, author={Eidens, Fabian}, year={2012}
}'
chicago: Eidens, Fabian. Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken.
Universität Paderborn, 2012.
ieee: F. Eidens, Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken.
Universität Paderborn, 2012.
mla: Eidens, Fabian. Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken.
Universität Paderborn, 2012.
short: F. Eidens, Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken,
Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:56Z
date_updated: 2022-01-06T07:03:03Z
department:
- _id: '63'
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
title: Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken
type: bachelorsthesis
user_id: '477'
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: '641'
author:
- first_name: Jonathan
full_name: Schluessler, Jonathan
last_name: Schluessler
citation:
ama: Schluessler J. A Forensic Framework for Automatic Information Retrieval
in Distributed Systems. Universität Paderborn; 2012.
apa: Schluessler, J. (2012). A Forensic Framework for Automatic Information Retrieval
in Distributed Systems. Universität Paderborn.
bibtex: '@book{Schluessler_2012, title={A Forensic Framework for Automatic Information
Retrieval in Distributed Systems}, publisher={Universität Paderborn}, author={Schluessler,
Jonathan}, year={2012} }'
chicago: Schluessler, Jonathan. A Forensic Framework for Automatic Information
Retrieval in Distributed Systems. Universität Paderborn, 2012.
ieee: J. Schluessler, A Forensic Framework for Automatic Information Retrieval
in Distributed Systems. Universität Paderborn, 2012.
mla: Schluessler, Jonathan. A Forensic Framework for Automatic Information Retrieval
in Distributed Systems. Universität Paderborn, 2012.
short: J. Schluessler, A Forensic Framework for Automatic Information Retrieval
in Distributed Systems, Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:57Z
date_updated: 2022-01-06T07:03:04Z
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: A Forensic Framework for Automatic Information Retrieval in Distributed Systems
type: mastersthesis
user_id: '15504'
year: '2012'
...
---
_id: '16242'
author:
- first_name: Brigitta
full_name: Elsässer, Brigitta
last_name: Elsässer
- first_name: Silvia
full_name: Dohmeier-Fischer, Silvia
id: '16203'
last_name: Dohmeier-Fischer
- first_name: Gregor
full_name: Fels, Gregor
last_name: Fels
citation:
ama: 'Elsässer B, Dohmeier-Fischer S, Fels G. Theoretical investigation of the enzymatic
phosphoryl transfer of β-phosphoglucomutase: revisiting both steps of the catalytic
cycle. Journal of Molecular Modeling. 2012:3169-3179. doi:10.1007/s00894-011-1344-5'
apa: 'Elsässer, B., Dohmeier-Fischer, S., & Fels, G. (2012). Theoretical investigation
of the enzymatic phosphoryl transfer of β-phosphoglucomutase: revisiting both
steps of the catalytic cycle. Journal of Molecular Modeling, 3169–3179.
https://doi.org/10.1007/s00894-011-1344-5'
bibtex: '@article{Elsässer_Dohmeier-Fischer_Fels_2012, title={Theoretical investigation
of the enzymatic phosphoryl transfer of β-phosphoglucomutase: revisiting both
steps of the catalytic cycle}, DOI={10.1007/s00894-011-1344-5},
journal={Journal of Molecular Modeling}, author={Elsässer, Brigitta and Dohmeier-Fischer,
Silvia and Fels, Gregor}, year={2012}, pages={3169–3179} }'
chicago: 'Elsässer, Brigitta, Silvia Dohmeier-Fischer, and Gregor Fels. “Theoretical
Investigation of the Enzymatic Phosphoryl Transfer of β-Phosphoglucomutase: Revisiting
Both Steps of the Catalytic Cycle.” Journal of Molecular Modeling, 2012,
3169–79. https://doi.org/10.1007/s00894-011-1344-5.'
ieee: 'B. Elsässer, S. Dohmeier-Fischer, and G. Fels, “Theoretical investigation
of the enzymatic phosphoryl transfer of β-phosphoglucomutase: revisiting both
steps of the catalytic cycle,” Journal of Molecular Modeling, pp. 3169–3179,
2012.'
mla: 'Elsässer, Brigitta, et al. “Theoretical Investigation of the Enzymatic Phosphoryl
Transfer of β-Phosphoglucomutase: Revisiting Both Steps of the Catalytic Cycle.”
Journal of Molecular Modeling, 2012, pp. 3169–79, doi:10.1007/s00894-011-1344-5.'
short: B. Elsässer, S. Dohmeier-Fischer, G. Fels, Journal of Molecular Modeling
(2012) 3169–3179.
date_created: 2020-03-04T10:02:52Z
date_updated: 2022-01-06T06:52:46Z
department:
- _id: '35'
- _id: '390'
doi: 10.1007/s00894-011-1344-5
language:
- iso: eng
page: 3169-3179
publication: Journal of Molecular Modeling
publication_identifier:
issn:
- 1610-2940
- 0948-5023
publication_status: published
status: public
title: 'Theoretical investigation of the enzymatic phosphoryl transfer of β-phosphoglucomutase:
revisiting both steps of the catalytic cycle'
type: journal_article
user_id: '16203'
year: '2012'
...
---
_id: '31795'
author:
- first_name: Ines
full_name: Böker, Ines
id: '880'
last_name: Böker
citation:
ama: 'Böker I. „Wenn dich die Freude frisst oder freust du dich – dann fress ich
dich. Zur Lesbarkeit einer Spaßanthropophagie in der Kritik der Spaßgesellschaft“.
In: Heinlein M, Seßler K, eds. Die vergnügte Gesellschaft? Ernsthafte Perspektiven
auf modernes Amüsement. transcript ; 2012:265-274.'
apa: Böker, I. (2012). „Wenn dich die Freude frisst oder freust du dich – dann fress
ich dich. Zur Lesbarkeit einer Spaßanthropophagie in der Kritik der Spaßgesellschaft“.
In M. Heinlein & K. Seßler (Eds.), Die vergnügte Gesellschaft? Ernsthafte
Perspektiven auf modernes Amüsement (pp. 265–274). transcript .
bibtex: '@inbook{Böker_2012, place={Bielefeld }, title={„Wenn dich die Freude frisst
oder freust du dich – dann fress ich dich. Zur Lesbarkeit einer Spaßanthropophagie
in der Kritik der Spaßgesellschaft“}, booktitle={Die vergnügte Gesellschaft? Ernsthafte
Perspektiven auf modernes Amüsement}, publisher={transcript }, author={Böker,
Ines}, editor={Heinlein, Michael and Seßler, Katharina }, year={2012}, pages={265–274}
}'
chicago: 'Böker, Ines. “„Wenn dich die Freude frisst oder freust du dich – dann
fress ich dich. Zur Lesbarkeit einer Spaßanthropophagie in der Kritik der Spaßgesellschaft“.”
In Die vergnügte Gesellschaft? Ernsthafte Perspektiven auf modernes Amüsement,
edited by Michael Heinlein and Katharina Seßler, 265–74. Bielefeld : transcript
, 2012.'
ieee: 'I. Böker, “„Wenn dich die Freude frisst oder freust du dich – dann fress
ich dich. Zur Lesbarkeit einer Spaßanthropophagie in der Kritik der Spaßgesellschaft“,”
in Die vergnügte Gesellschaft? Ernsthafte Perspektiven auf modernes Amüsement,
M. Heinlein and K. Seßler, Eds. Bielefeld : transcript , 2012, pp. 265–274.'
mla: Böker, Ines. “„Wenn dich die Freude frisst oder freust du dich – dann fress
ich dich. Zur Lesbarkeit einer Spaßanthropophagie in der Kritik der Spaßgesellschaft“.”
Die vergnügte Gesellschaft? Ernsthafte Perspektiven auf modernes Amüsement,
edited by Michael Heinlein and Katharina Seßler, transcript , 2012, pp. 265–74.
short: 'I. Böker, in: M. Heinlein, K. Seßler (Eds.), Die vergnügte Gesellschaft?
Ernsthafte Perspektiven auf modernes Amüsement, transcript , Bielefeld , 2012,
pp. 265–274.'
date_created: 2022-06-07T11:17:15Z
date_updated: 2022-06-07T11:17:25Z
department:
- _id: '5'
- _id: '465'
- _id: '464'
editor:
- first_name: 'Michael '
full_name: 'Heinlein, Michael '
last_name: Heinlein
- first_name: 'Katharina '
full_name: 'Seßler, Katharina '
last_name: Seßler
language:
- iso: ger
page: 265-274
place: 'Bielefeld '
publication: Die vergnügte Gesellschaft? Ernsthafte Perspektiven auf modernes Amüsement
publisher: 'transcript '
status: public
title: „Wenn dich die Freude frisst oder freust du dich – dann fress ich dich. Zur
Lesbarkeit einer Spaßanthropophagie in der Kritik der Spaßgesellschaft“
type: book_chapter
user_id: '49063'
year: '2012'
...
---
_id: '31832'
author:
- first_name: Sandra
full_name: Ballweg, Sandra
id: '94512'
last_name: Ballweg
citation:
ama: 'Ballweg S. Portfolioarbeit im fremdsprachlichen Schreibunterricht. Annäherung
an das Forschungsfeld. In: Cerri C, Jentges S, Stork A, eds. Methoden empirischer
Fremdsprachenforschung im Prozess – ein Blick hinter die Kulissen aktueller Forschungsprojekte
(MatDaF 88). Universitätsverlag; 2012:21-35.'
apa: Ballweg, S. (2012). Portfolioarbeit im fremdsprachlichen Schreibunterricht.
Annäherung an das Forschungsfeld. In C. Cerri, S. Jentges, & A. Stork (Eds.),
Methoden empirischer Fremdsprachenforschung im Prozess – ein Blick hinter die
Kulissen aktueller Forschungsprojekte (MatDaF 88) (pp. 21–35). Universitätsverlag.
bibtex: '@inbook{Ballweg_2012, place={Göttingen}, title={Portfolioarbeit im fremdsprachlichen
Schreibunterricht. Annäherung an das Forschungsfeld}, booktitle={Methoden empirischer
Fremdsprachenforschung im Prozess – ein Blick hinter die Kulissen aktueller Forschungsprojekte
(MatDaF 88)}, publisher={Universitätsverlag}, author={Ballweg, Sandra}, editor={Cerri,
Chiara and Jentges, Sabine and Stork, Antje}, year={2012}, pages={21–35} }'
chicago: 'Ballweg, Sandra. “Portfolioarbeit im fremdsprachlichen Schreibunterricht.
Annäherung an das Forschungsfeld.” In Methoden empirischer Fremdsprachenforschung
im Prozess – ein Blick hinter die Kulissen aktueller Forschungsprojekte (MatDaF
88), edited by Chiara Cerri, Sabine Jentges, and Antje Stork, 21–35. Göttingen:
Universitätsverlag, 2012.'
ieee: 'S. Ballweg, “Portfolioarbeit im fremdsprachlichen Schreibunterricht. Annäherung
an das Forschungsfeld,” in Methoden empirischer Fremdsprachenforschung im Prozess
– ein Blick hinter die Kulissen aktueller Forschungsprojekte (MatDaF 88),
C. Cerri, S. Jentges, and A. Stork, Eds. Göttingen: Universitätsverlag, 2012,
pp. 21–35.'
mla: Ballweg, Sandra. “Portfolioarbeit im fremdsprachlichen Schreibunterricht. Annäherung
an das Forschungsfeld.” Methoden empirischer Fremdsprachenforschung im Prozess
– ein Blick hinter die Kulissen aktueller Forschungsprojekte (MatDaF 88),
edited by Chiara Cerri et al., Universitätsverlag, 2012, pp. 21–35.
short: 'S. Ballweg, in: C. Cerri, S. Jentges, A. Stork (Eds.), Methoden empirischer
Fremdsprachenforschung im Prozess – ein Blick hinter die Kulissen aktueller Forschungsprojekte
(MatDaF 88), Universitätsverlag, Göttingen, 2012, pp. 21–35.'
date_created: 2022-06-09T07:40:46Z
date_updated: 2022-06-09T07:40:52Z
department:
- _id: '468'
editor:
- first_name: Chiara
full_name: Cerri, Chiara
last_name: Cerri
- first_name: Sabine
full_name: Jentges, Sabine
last_name: Jentges
- first_name: Antje
full_name: Stork, Antje
last_name: Stork
language:
- iso: ger
page: 21-35
place: Göttingen
publication: Methoden empirischer Fremdsprachenforschung im Prozess – ein Blick hinter
die Kulissen aktueller Forschungsprojekte (MatDaF 88)
publisher: Universitätsverlag
status: public
title: Portfolioarbeit im fremdsprachlichen Schreibunterricht. Annäherung an das Forschungsfeld
type: book_chapter
user_id: '21240'
year: '2012'
...