---
_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: '18973'
author:
- first_name: Gereon
full_name: Frahling, Gereon
last_name: Frahling
citation:
ama: Frahling G. Algorithms for Dynamic Geometric Data Streams. Vol 290.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2011.
apa: Frahling, G. (2011). Algorithms for Dynamic Geometric Data Streams (Vol.
290). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Frahling_2011, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Algorithms for Dynamic Geometric Data Streams}, volume={290},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Frahling,
Gereon}, year={2011}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn} }'
chicago: Frahling, Gereon. Algorithms for Dynamic Geometric Data Streams.
Vol. 290. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2011.
ieee: G. Frahling, Algorithms for Dynamic Geometric Data Streams, vol. 290.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.
mla: Frahling, Gereon. Algorithms for Dynamic Geometric Data Streams. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2011.
short: G. Frahling, Algorithms for Dynamic Geometric Data Streams, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2011.
date_created: 2020-09-04T06:52:56Z
date_updated: 2022-01-06T06:53:56Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 290'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-942647-09-0
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20070301123
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Algorithms for Dynamic Geometric Data Streams
type: dissertation
user_id: '5786'
volume: 290
year: '2011'
...
---
_id: '18974'
author:
- first_name: Jan
full_name: Mehler, Jan
last_name: Mehler
citation:
ama: Mehler J. Power-Aware Online File Allocation in Dynamic Networks. Vol
287. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2011.
apa: Mehler, J. (2011). Power-Aware Online File Allocation in Dynamic Networks
(Vol. 287). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Mehler_2011, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Power-Aware Online File Allocation in Dynamic Networks}, volume={287},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Mehler,
Jan}, year={2011}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn} }'
chicago: Mehler, Jan. Power-Aware Online File Allocation in Dynamic Networks.
Vol. 287. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2011.
ieee: J. Mehler, Power-Aware Online File Allocation in Dynamic Networks,
vol. 287. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.
mla: Mehler, Jan. Power-Aware Online File Allocation in Dynamic Networks.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.
short: J. Mehler, Power-Aware Online File Allocation in Dynamic Networks, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2011.
date_created: 2020-09-04T06:58:58Z
date_updated: 2022-01-06T06:53:56Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 287'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-942647-06-9
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20101020011
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: Power-Aware Online File Allocation in Dynamic Networks
type: dissertation
user_id: '5786'
volume: 287
year: '2011'
...
---
_id: '18976'
abstract:
- lang: eng
text: "Web computing is a variant of parallel computing where the idle times of
PCs\r\ndonated by worldwide distributed users are employed to execute parallel\r\nprograms.
In this thesis we consider a web computing variant with two\r\nimportant properties:
First, we support the execution of coupled, massively\r\nparallel algorithms (rather
than distributed data processing). And second,\r\nwe organize the system in peer-to-peer
fashion.\r\n\r\nWe present the Paderborn University BSP-based Web Computing (PUB-Web)
library,\r\nwhich supports the execution of parallel programs in the bulk-synchronous
style\r\n(BSP) in such a web computing setting. In this thesis, we focus on important\r\ntechnical
and algorithmic aspects, in particular: In order to schedule\r\nprocesses with
respect to the currently available computing power, which\r\ncontinually changes
in an unpredictable fashion, we need intelligent load\r\nbalancing algorithms
and -- as a basic precondition -- the technical ability\r\nto migrate threads
at runtime.\r\n\r\nTo achieve the latter in a way suitable for production use,
compatible with\r\nrecent Java versions, available for all important platforms,
and easy-to-use\r\nfor developers, we develop the PadMig thread migration and
checkpointing\r\nlibrary.\r\n\r\nIn order to tackle the distributed load balancing
problem, we present an\r\nalgorithm based on Distributed Heterogeneous Hash-Tables.
In order to judge\r\nthe quality of the schedules produced, we perform extensive
experiments to\r\ncompare several variants of the DHHT-based load balancer with
the well-\r\nestablished Work Stealing algorithm, using realistic input data obtained
by\r\nprofiling the utilization of several hundred PCs for a period of several\r\nmonths.\r\n\r\nBeside
the available computing power, we finally also consider the network\r\nbandwidth
as a secondary criterion for load balancing. For this purpose, we\r\ncluster the
PUB-Web network according to bandwidth, employing a novel,\r\nfault-tolerant,
adaptive, and scaling distributed clustering algorithm called\r\nDiDiC. In order
to judge the quality of the clusterings produces by DiDiC,\r\nwe experimentally
compare it to the well-established MCL algorithm using a\r\nsimulator."
author:
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
citation:
ama: Gehweiler J. Peer-to-Peer Based Parallel Web Computing. Vol 298. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 2011.
apa: Gehweiler, J. (2011). Peer-to-Peer Based Parallel Web Computing (Vol.
298). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Gehweiler_2011, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Peer-to-Peer Based Parallel Web Computing}, volume={298}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, author={Gehweiler, Joachim}, year={2011},
collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Gehweiler, Joachim. Peer-to-Peer Based Parallel Web Computing. Vol.
298. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2011.
ieee: J. Gehweiler, Peer-to-Peer Based Parallel Web Computing, vol. 298.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.
mla: Gehweiler, Joachim. Peer-to-Peer Based Parallel Web Computing. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2011.
short: J. Gehweiler, Peer-to-Peer Based Parallel Web Computing, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2011.
date_created: 2020-09-04T07:46:32Z
date_updated: 2022-01-06T06:53:56Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 298'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-942647-17-5
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466:2-186
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Peer-to-Peer Based Parallel Web Computing
type: dissertation
user_id: '5786'
volume: 298
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: '19026'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Christoph
full_name: Raupach, Christoph
last_name: Raupach
citation:
ama: 'Briest P, Raupach C. The car sharing problem. In: Proceedings of the 23rd
ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11. ;
2011. doi:10.1145/1989493.1989518'
apa: Briest, P., & Raupach, C. (2011). The car sharing problem. In Proceedings
of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA
’11. https://doi.org/10.1145/1989493.1989518
bibtex: '@inproceedings{Briest_Raupach_2011, title={The car sharing problem}, DOI={10.1145/1989493.1989518}, booktitle={Proceedings
of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA
’11}, author={Briest, Patrick and Raupach, Christoph}, year={2011} }'
chicago: Briest, Patrick, and Christoph Raupach. “The Car Sharing Problem.” In Proceedings
of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA
’11, 2011. https://doi.org/10.1145/1989493.1989518.
ieee: P. Briest and C. Raupach, “The car sharing problem,” in Proceedings of
the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11,
2011.
mla: Briest, Patrick, and Christoph Raupach. “The Car Sharing Problem.” Proceedings
of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA
’11, 2011, doi:10.1145/1989493.1989518.
short: 'P. Briest, C. Raupach, in: Proceedings of the 23rd ACM Symposium on Parallelism
in Algorithms and Architectures - SPAA ’11, 2011.'
date_created: 2020-09-04T11:58:54Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1145/1989493.1989518
language:
- iso: eng
publication: Proceedings of the 23rd ACM symposium on Parallelism in algorithms and
architectures - SPAA '11
publication_identifier:
isbn:
- '9781450307437'
publication_status: published
status: public
title: The car sharing problem
type: conference
user_id: '15415'
year: '2011'
...
---
_id: '19040'
author:
- first_name: Sascha
full_name: Effert, Sascha
last_name: Effert
citation:
ama: Effert S. Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen.
Universität Paderborn; 2011.
apa: Effert, S. (2011). Verfahren zur redundanten Datenplatzierung in skalierbaren
Speichersystemen. Universität Paderborn.
bibtex: '@book{Effert_2011, place={Universität Paderborn}, title={Verfahren zur
redundanten Datenplatzierung in skalierbaren Speichersystemen}, author={Effert,
Sascha}, year={2011} }'
chicago: Effert, Sascha. Verfahren Zur Redundanten Datenplatzierung in Skalierbaren
Speichersystemen. Universität Paderborn, 2011.
ieee: S. Effert, Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen.
Universität Paderborn, 2011.
mla: Effert, Sascha. Verfahren Zur Redundanten Datenplatzierung in Skalierbaren
Speichersystemen. 2011.
short: S. Effert, Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen,
Universität Paderborn, 2011.
date_created: 2020-09-04T13:31:29Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
language:
- iso: eng
place: Universität Paderborn
related_material:
link:
- relation: confirmation
url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-385
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen
type: dissertation
user_id: '15415'
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: '23739'
abstract:
- lang: eng
text: "This paper deals with the design of efficiently computable incentive-compatible
mechanisms for combinatorial optimization problems with single-minded agents each
possibly having multiple private parameters. We focus on approximation algorithms
for NP-hard mechanism design problems. These algorithms need to satisfy certain
monotonicity properties to ensure truthfulness. Since most of the known approximation
techniques do not fulfill these properties, we study alternative techniques. Our
first contribution is a quite general method to transform a pseudopolynomial algorithm
into a monotone fully polynomial time approximation scheme (FPTAS). This can be
applied to various problems like, e.g., knapsack, constrained shortest path, or
job scheduling with deadlines. For example, the monotone FPTAS for the knapsack
problem gives a very efficient, truthful mechanism for single-minded multiunit
auctions. The best previous result for such auctions was a 2-appro-xi-ma-tion.
In addition, we present a monotone PTAS for the generalized assignment problem
with any constant number of private parameters per agent. The most efficient way
to solve packing integer programs (PIPs) is linear programming–based randomized
rounding, which also is in general not monotone. We show that primal-dual greedy
algorithms achieve almost the same approximation ratios for PIPs as randomized
rounding. The advantage is that these algorithms are inherently monotone. This
way, we can significantly improve the approximation ratios of truthful mechanisms
for various fundamental mechanism design problems like single-minded combinatorial
auctions (CAs), unsplittable flow routing, and multicast routing. Our primal-dual
approximation algorithms can also be used for the winner determination in CAs
with general bidders specifying their bids through an oracle.\r\n"
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Piotr
full_name: Krysta, Piotr
last_name: Krysta
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: Briest P, Krysta P, Vöcking B. Approximation Techniques for Utilitarian Mechanism
Design. SIAM Journal on Computing. 2011:1587-1622. doi:10.1137/090772988
apa: Briest, P., Krysta, P., & Vöcking, B. (2011). Approximation Techniques
for Utilitarian Mechanism Design. SIAM Journal on Computing, 1587–1622.
https://doi.org/10.1137/090772988
bibtex: '@article{Briest_Krysta_Vöcking_2011, title={Approximation Techniques for
Utilitarian Mechanism Design}, DOI={10.1137/090772988},
journal={SIAM Journal on Computing}, author={Briest, Patrick and Krysta, Piotr
and Vöcking, Berthold}, year={2011}, pages={1587–1622} }'
chicago: Briest, Patrick, Piotr Krysta, and Berthold Vöcking. “Approximation Techniques
for Utilitarian Mechanism Design.” SIAM Journal on Computing, 2011, 1587–1622.
https://doi.org/10.1137/090772988.
ieee: P. Briest, P. Krysta, and B. Vöcking, “Approximation Techniques for Utilitarian
Mechanism Design,” SIAM Journal on Computing, pp. 1587–1622, 2011.
mla: Briest, Patrick, et al. “Approximation Techniques for Utilitarian Mechanism
Design.” SIAM Journal on Computing, 2011, pp. 1587–622, doi:10.1137/090772988.
short: P. Briest, P. Krysta, B. Vöcking, SIAM Journal on Computing (2011) 1587–1622.
date_created: 2021-09-03T10:41:04Z
date_updated: 2022-01-06T06:55:59Z
department:
- _id: '63'
doi: 10.1137/090772988
language:
- iso: eng
page: 1587-1622
publication: SIAM Journal on Computing
publication_identifier:
issn:
- 0097-5397
- 1095-7111
publication_status: published
status: public
title: Approximation Techniques for Utilitarian Mechanism Design
type: journal_article
user_id: '15415'
year: '2011'
...
---
_id: '23740'
abstract:
- lang: eng
text: "We investigate nonparametric multiproduct pricing problems, in which we want
to find revenue maximizing prices for products $\\mathcal{P}$ based on a set of
customer samples $\\mathcal{C}$. We mostly focus on the unit-demand case, in which
products constitute strict substitutes and each customer aims to purchase a single
product. In this setting a customer sample consists of a number of nonzero values
for different products and possibly an additional product ranking. Once prices
are fixed, each customer chooses to buy one of the products she can afford based
on some predefined selection rule. We distinguish between the min-buying, max-buying,
and rank-buying models. Some of our results also extend to single-minded pricing,
in which case products are strict complements and every customer seeks to buy
a single set of products, which she purchases if the sum of prices is below her
valuation for that set. For the min-buying model we show that the revenue maximization
problem is not approximable within factor $\\mathcal{O}(\\log^{\\varepsilon}|\\mathcal{C}|)$
for some constant $\\varepsilon>0$, unless $\\mathrm{NP}\\subseteq\\mathrm{DTIME}(n^{\\mathcal{O}(\\log\\log
n)})$, thereby almost closing the gap between the known algorithmic results and
previous lower bounds. We also prove inapproximability within $\\mathcal{O}(\\ell^{\\varepsilon})$,
$\\ell$ being an upper bound on the number of nonzero values per customer, and
$\\mathcal{O}(|\\mathcal{P}|^{\\varepsilon})$ under slightly stronger assumptions
and provide matching upper bounds. Surprisingly, these hardness results hold even
if a price ladder constraint, i.e., a predefined order on the prices of all products,
is given. Without the price ladder constraint we obtain similar hardness results
for the special case of uniform valuations, i.e., the case that every customer
has identical values for all the products she is interested in, assuming specific
hardness of the balanced bipartite independent set problem in constant degree
graphs or hardness of refuting random 3CNF formulas. Introducing a slightly more
general problem definition in which customers are given as an explicit probability
distribution, we obtain inapproximability within $\\mathcal{O}(|\\mathcal{P}|^{\\varepsilon})$
assuming $\\mathrm{NP}\\nsubseteq\\bigcap_{\\delta>0}\\mathrm{BPTIME}(2^{\\mathcal{O}(n^{\\delta})})$.
These results apply to single-minded pricing as well. For the max-buying model
a polynomial-time approximation scheme exists if a price ladder is given. We give
a matching lower bound by proving strong NP-hardness. Assuming limited product
supply, we analyze a generic local search algorithm and prove that it is 2-approximate.
Finally, we discuss implications for the rank-buying model.\r\n"
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Piotr
full_name: Krysta, Piotr
last_name: Krysta
citation:
ama: 'Briest P, Krysta P. Buying Cheap Is Expensive: Approximability of Combinatorial
Pricing Problems. SIAM Journal on Computing. 2011:1554-1586. doi:10.1137/090752353'
apa: 'Briest, P., & Krysta, P. (2011). Buying Cheap Is Expensive: Approximability
of Combinatorial Pricing Problems. SIAM Journal on Computing, 1554–1586.
https://doi.org/10.1137/090752353'
bibtex: '@article{Briest_Krysta_2011, title={Buying Cheap Is Expensive: Approximability
of Combinatorial Pricing Problems}, DOI={10.1137/090752353},
journal={SIAM Journal on Computing}, author={Briest, Patrick and Krysta, Piotr},
year={2011}, pages={1554–1586} }'
chicago: 'Briest, Patrick, and Piotr Krysta. “Buying Cheap Is Expensive: Approximability
of Combinatorial Pricing Problems.” SIAM Journal on Computing, 2011, 1554–86.
https://doi.org/10.1137/090752353.'
ieee: 'P. Briest and P. Krysta, “Buying Cheap Is Expensive: Approximability of Combinatorial
Pricing Problems,” SIAM Journal on Computing, pp. 1554–1586, 2011.'
mla: 'Briest, Patrick, and Piotr Krysta. “Buying Cheap Is Expensive: Approximability
of Combinatorial Pricing Problems.” SIAM Journal on Computing, 2011, pp.
1554–86, doi:10.1137/090752353.'
short: P. Briest, P. Krysta, SIAM Journal on Computing (2011) 1554–1586.
date_created: 2021-09-03T10:48:52Z
date_updated: 2022-01-06T06:55:59Z
department:
- _id: '63'
doi: 10.1137/090752353
language:
- iso: eng
page: 1554-1586
publication: SIAM Journal on Computing
publication_identifier:
issn:
- 0097-5397
- 1095-7111
publication_status: published
status: public
title: 'Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems'
type: journal_article
user_id: '15415'
year: '2011'
...
---
_id: '20709'
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Matthias
full_name: Fischer, Matthias
last_name: Fischer
- first_name: Martina
full_name: Hüllmann, Martina
last_name: Hüllmann
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Alexander
full_name: Klaas, Alexander
last_name: Klaas
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Sven
full_name: Kurras, Sven
last_name: Kurras
- first_name: Marcus
full_name: Märtens, Marcus
last_name: Märtens
- first_name: Friedhelm Meyer
full_name: auf der Heide, Friedhelm Meyer
last_name: auf der Heide
- first_name: Christoph
full_name: Raupach, Christoph
last_name: Raupach
- first_name: Kamil
full_name: Swierkot, Kamil
last_name: Swierkot
- first_name: Daniel
full_name: Warner, Daniel
id: '3902'
last_name: Warner
- first_name: Christoph
full_name: Weddemann, Christoph
last_name: Weddemann
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
citation:
ama: 'Cord-Landwehr A, Degener B, Fischer M, et al. Collisionless Gathering of Robots
with an Extent. In: SOFSEM 2011: Theory and Practice of Computer Science.
Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-18381-2_15'
apa: 'Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas,
A., … Wonisch, D. (2011). Collisionless Gathering of Robots with an Extent. In
SOFSEM 2011: Theory and Practice of Computer Science. Berlin, Heidelberg.
https://doi.org/10.1007/978-3-642-18381-2_15'
bibtex: '@inbook{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_auf
der Heide_et al._2011, place={Berlin, Heidelberg}, title={Collisionless Gathering
of Robots with an Extent}, DOI={10.1007/978-3-642-18381-2_15},
booktitle={SOFSEM 2011: Theory and Practice of Computer Science}, author={Cord-Landwehr,
Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes,
Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus
and auf der Heide, Friedhelm Meyer and et al.}, year={2011} }'
chicago: 'Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann,
Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “Collisionless Gathering
of Robots with an Extent.” In SOFSEM 2011: Theory and Practice of Computer
Science. Berlin, Heidelberg, 2011. https://doi.org/10.1007/978-3-642-18381-2_15.'
ieee: 'A. Cord-Landwehr et al., “Collisionless Gathering of Robots with an
Extent,” in SOFSEM 2011: Theory and Practice of Computer Science, Berlin,
Heidelberg, 2011.'
mla: 'Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an
Extent.” SOFSEM 2011: Theory and Practice of Computer Science, 2011, doi:10.1007/978-3-642-18381-2_15.'
short: 'A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas,
P. Kling, S. Kurras, M. Märtens, F.M. auf der Heide, C. Raupach, K. Swierkot,
D. Warner, C. Weddemann, D. Wonisch, in: SOFSEM 2011: Theory and Practice of Computer
Science, Berlin, Heidelberg, 2011.'
date_created: 2020-12-12T11:15:30Z
date_updated: 2022-01-06T06:54:33Z
department:
- _id: '63'
doi: 10.1007/978-3-642-18381-2_15
language:
- iso: eng
place: Berlin, Heidelberg
publication: 'SOFSEM 2011: Theory and Practice of Computer Science'
publication_identifier:
isbn:
- '9783642183805'
- '9783642183812'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Collisionless Gathering of Robots with an Extent
type: book_chapter
user_id: '3902'
year: '2011'
...
---
_id: '20710'
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Matthias
full_name: Fischer, Matthias
last_name: Fischer
- first_name: Martina
full_name: Hüllmann, Martina
last_name: Hüllmann
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Alexander
full_name: Klaas, Alexander
last_name: Klaas
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Sven
full_name: Kurras, Sven
last_name: Kurras
- first_name: Marcus
full_name: Märtens, Marcus
last_name: Märtens
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
last_name: Meyer auf der Heide
- first_name: Christoph
full_name: Raupach, Christoph
last_name: Raupach
- first_name: Kamil
full_name: Swierkot, Kamil
last_name: Swierkot
- first_name: Daniel
full_name: Warner, Daniel
id: '3902'
last_name: Warner
- first_name: Christoph
full_name: Weddemann, Christoph
last_name: Weddemann
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
citation:
ama: 'Cord-Landwehr A, Degener B, Fischer M, et al. A New Approach for Analyzing
Convergence Algorithms for Mobile Robots. In: Automata, Languages and Programming.
Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-22012-8_52'
apa: Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas,
A., … Wonisch, D. (2011). A New Approach for Analyzing Convergence Algorithms
for Mobile Robots. In Automata, Languages and Programming. Berlin, Heidelberg.
https://doi.org/10.1007/978-3-642-22012-8_52
bibtex: '@inbook{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_Meyer
auf der Heide_et al._2011, place={Berlin, Heidelberg}, title={A New Approach for
Analyzing Convergence Algorithms for Mobile Robots}, DOI={10.1007/978-3-642-22012-8_52},
booktitle={Automata, Languages and Programming}, author={Cord-Landwehr, Andreas
and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes,
Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus
and Meyer auf der Heide, Friedhelm and et al.}, year={2011} }'
chicago: Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann,
Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “A New Approach for Analyzing
Convergence Algorithms for Mobile Robots.” In Automata, Languages and Programming.
Berlin, Heidelberg, 2011. https://doi.org/10.1007/978-3-642-22012-8_52.
ieee: A. Cord-Landwehr et al., “A New Approach for Analyzing Convergence
Algorithms for Mobile Robots,” in Automata, Languages and Programming,
Berlin, Heidelberg, 2011.
mla: Cord-Landwehr, Andreas, et al. “A New Approach for Analyzing Convergence Algorithms
for Mobile Robots.” Automata, Languages and Programming, 2011, doi:10.1007/978-3-642-22012-8_52.
short: 'A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas,
P. Kling, S. Kurras, M. Märtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot,
D. Warner, C. Weddemann, D. Wonisch, in: Automata, Languages and Programming,
Berlin, Heidelberg, 2011.'
date_created: 2020-12-12T12:22:41Z
date_updated: 2022-01-06T06:54:33Z
department:
- _id: '63'
doi: 10.1007/978-3-642-22012-8_52
language:
- iso: eng
place: Berlin, Heidelberg
publication: Automata, Languages and Programming
publication_identifier:
isbn:
- '9783642220111'
- '9783642220128'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: A New Approach for Analyzing Convergence Algorithms for Mobile Robots
type: book_chapter
user_id: '3902'
year: '2011'
...
---
_id: '20915'
abstract:
- lang: ger
text: "Durch die immer kuerzer werdenden Entwicklungszyklen und den groeßer werdenden
Druck bzgl. Time-to-Market fuer eingebettete Systeme im Automobilsektor steigt
der Bedarf, die Systeme bereits zu fruehen Entwicklungszeitpunkten gegenueber
den Qualitaetsanforderungen (z. B. Zeitanforderungen und Ressourcenauslastung)
zu verifizieren. Wir stellen einen Ansatz vor, der eine formale Spezifikation
von Zeitanforderungen und Wirkketten sowie deren fruehzeitige Analyse durch Simulation
erlaubt. Verletzungen von Zeitanforderungen werden in den Simulationsergebnissen
automatisch erkannt.\r\n"
author:
- first_name: Jan
full_name: Meyer, Jan
last_name: Meyer
- first_name: Jörg
full_name: Holtmann, Jörg
id: '3875'
last_name: Holtmann
orcid: 0000-0001-6141-4571
- first_name: Matthias
full_name: Meyer, Matthias
id: '683'
last_name: Meyer
citation:
ama: 'Meyer J, Holtmann J, Meyer M. Formalisierung von Anforderungen und Betriebssystemeigenschaften
zur fruehzeitigen Simulation von eingebetteten, automobilen Systemen. In: 8.
Paderborner Workshop Entwurf Mechatronischer Systeme. Vol 294. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn. Heinz Nixdorf Institut; 2011:203-215.'
apa: Meyer, J., Holtmann, J., & Meyer, M. (2011). Formalisierung von Anforderungen
und Betriebssystemeigenschaften zur fruehzeitigen Simulation von eingebetteten,
automobilen Systemen. 8. Paderborner Workshop Entwurf Mechatronischer Systeme,
294, 203–215.
bibtex: '@inproceedings{Meyer_Holtmann_Meyer_2011, series={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, title={Formalisierung von Anforderungen
und Betriebssystemeigenschaften zur fruehzeitigen Simulation von eingebetteten,
automobilen Systemen}, volume={294}, booktitle={8. Paderborner Workshop Entwurf
mechatronischer Systeme}, publisher={Heinz Nixdorf Institut}, author={Meyer, Jan
and Holtmann, Jörg and Meyer, Matthias}, year={2011}, pages={203–215}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Meyer, Jan, Jörg Holtmann, and Matthias Meyer. “Formalisierung von Anforderungen
Und Betriebssystemeigenschaften Zur Fruehzeitigen Simulation von Eingebetteten,
Automobilen Systemen.” In 8. Paderborner Workshop Entwurf Mechatronischer Systeme,
294:203–15. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Heinz
Nixdorf Institut, 2011.
ieee: J. Meyer, J. Holtmann, and M. Meyer, “Formalisierung von Anforderungen und
Betriebssystemeigenschaften zur fruehzeitigen Simulation von eingebetteten, automobilen
Systemen,” in 8. Paderborner Workshop Entwurf mechatronischer Systeme,
2011, vol. 294, pp. 203–215.
mla: Meyer, Jan, et al. “Formalisierung von Anforderungen Und Betriebssystemeigenschaften
Zur Fruehzeitigen Simulation von Eingebetteten, Automobilen Systemen.” 8. Paderborner
Workshop Entwurf Mechatronischer Systeme, vol. 294, Heinz Nixdorf Institut,
2011, pp. 203–15.
short: 'J. Meyer, J. Holtmann, M. Meyer, in: 8. Paderborner Workshop Entwurf Mechatronischer
Systeme, Heinz Nixdorf Institut, 2011, pp. 203–215.'
date_created: 2021-01-12T14:25:00Z
date_updated: 2022-01-06T06:54:41Z
department:
- _id: '76'
- _id: '241'
intvolume: ' 294'
language:
- iso: eng
page: 203-215
publication: 8. Paderborner Workshop Entwurf mechatronischer Systeme
publisher: Heinz Nixdorf Institut
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Formalisierung von Anforderungen und Betriebssystemeigenschaften zur fruehzeitigen
Simulation von eingebetteten, automobilen Systemen
type: conference
user_id: '5786'
volume: 294
year: '2011'
...
---
_id: '20916'
abstract:
- lang: eng
text: Safety critical functions for embedded systems are increasingly realized with
software. Current and future standards and maturity models impose high accuracy
and quality for the development process of such software-intensive, embedded systems.
But nowadays, there are process and tooling gaps between different modeling aspects
for the system under development (SUD). Furthermore, the SUD is usually verified
and validated not until it is completely implemented, which leads to expensive
corrections. In this paper we present a seamless, model-based development process,
which is intended for the automotive supplier domain and conforms to the process
reference model of Automotive SPICE. The development process addresses the issues
mentioned above by using systematic transitions between different modeling aspects
and simulations in early development stages.
author:
- first_name: Jörg
full_name: Holtmann, Jörg
id: '3875'
last_name: Holtmann
orcid: 0000-0001-6141-4571
- first_name: Jan
full_name: Meyer, Jan
last_name: Meyer
- first_name: Matthias
full_name: Meyer, Matthias
id: '683'
last_name: Meyer
citation:
ama: 'Holtmann J, Meyer J, Meyer M. A Seamless Model-Based Development Process for
Automotive Systems. In: Software Engineering 2011 – Workshopband (Inkl. Doktorandensymposium).
Vol P-184. GI-Edition Lecture Notes in Informatics (LNI). Bonner Koellen Verlag;
2011:79-88.'
apa: Holtmann, J., Meyer, J., & Meyer, M. (2011). A Seamless Model-Based Development
Process for Automotive Systems. Software Engineering 2011 – Workshopband (Inkl.
Doktorandensymposium), P-184, 79–88.
bibtex: '@inproceedings{Holtmann_Meyer_Meyer_2011, series={GI-Edition Lecture Notes
in Informatics (LNI)}, title={A Seamless Model-Based Development Process for Automotive
Systems}, volume={P-184}, booktitle={Software Engineering 2011 – Workshopband
(inkl. Doktorandensymposium)}, publisher={Bonner Koellen Verlag}, author={Holtmann,
Jörg and Meyer, Jan and Meyer, Matthias}, year={2011}, pages={79–88}, collection={GI-Edition
Lecture Notes in Informatics (LNI)} }'
chicago: Holtmann, Jörg, Jan Meyer, and Matthias Meyer. “A Seamless Model-Based
Development Process for Automotive Systems.” In Software Engineering 2011 –
Workshopband (Inkl. Doktorandensymposium), P-184:79–88. GI-Edition Lecture
Notes in Informatics (LNI). Bonner Koellen Verlag, 2011.
ieee: J. Holtmann, J. Meyer, and M. Meyer, “A Seamless Model-Based Development Process
for Automotive Systems,” in Software Engineering 2011 – Workshopband (inkl.
Doktorandensymposium), 2011, vol. P-184, pp. 79–88.
mla: Holtmann, Jörg, et al. “A Seamless Model-Based Development Process for Automotive
Systems.” Software Engineering 2011 – Workshopband (Inkl. Doktorandensymposium),
vol. P-184, Bonner Koellen Verlag, 2011, pp. 79–88.
short: 'J. Holtmann, J. Meyer, M. Meyer, in: Software Engineering 2011 – Workshopband
(Inkl. Doktorandensymposium), Bonner Koellen Verlag, 2011, pp. 79–88.'
date_created: 2021-01-12T14:26:06Z
date_updated: 2022-01-06T06:54:41Z
department:
- _id: '76'
- _id: '241'
language:
- iso: eng
page: 79-88
publication: Software Engineering 2011 – Workshopband (inkl. Doktorandensymposium)
publisher: Bonner Koellen Verlag
series_title: GI-Edition Lecture Notes in Informatics (LNI)
status: public
title: A Seamless Model-Based Development Process for Automotive Systems
type: conference
user_id: '5786'
volume: P-184
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'
...