---
_id: '16453'
author:
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Tobias
full_name: Langner, Tobias
last_name: Langner
- 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: Roger
full_name: Wattenhofer, Roger
last_name: Wattenhofer
citation:
ama: 'Degener B, Kempkes B, Langner T, Meyer auf der Heide F, Pietrzyk P, Wattenhofer
R. A tight runtime bound for synchronous gathering of autonomous robots with limited
visibility. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms
and Architectures - SPAA ’11. ; 2011. doi:10.1145/1989493.1989515'
apa: Degener, B., Kempkes, B., Langner, T., Meyer auf der Heide, F., Pietrzyk, P.,
& Wattenhofer, R. (2011). A tight runtime bound for synchronous gathering
of autonomous robots with limited visibility. In Proceedings of the 23rd ACM
symposium on Parallelism in algorithms and architectures - SPAA ’11. https://doi.org/10.1145/1989493.1989515
bibtex: '@inproceedings{Degener_Kempkes_Langner_Meyer auf der Heide_Pietrzyk_Wattenhofer_2011,
title={A tight runtime bound for synchronous gathering of autonomous robots with
limited visibility}, DOI={10.1145/1989493.1989515},
booktitle={Proceedings of the 23rd ACM symposium on Parallelism in algorithms
and architectures - SPAA ’11}, author={Degener, Bastian and Kempkes, Barbara and
Langner, Tobias and Meyer auf der Heide, Friedhelm and Pietrzyk, Peter and Wattenhofer,
Roger}, year={2011} }'
chicago: Degener, Bastian, Barbara Kempkes, Tobias Langner, Friedhelm Meyer auf
der Heide, Peter Pietrzyk, and Roger Wattenhofer. “A Tight Runtime Bound for Synchronous
Gathering of Autonomous Robots with Limited Visibility.” In Proceedings of
the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11,
2011. https://doi.org/10.1145/1989493.1989515.
ieee: B. Degener, B. Kempkes, T. Langner, F. Meyer auf der Heide, P. Pietrzyk, and
R. Wattenhofer, “A tight runtime bound for synchronous gathering of autonomous
robots with limited visibility,” in Proceedings of the 23rd ACM symposium on
Parallelism in algorithms and architectures - SPAA ’11, 2011.
mla: Degener, Bastian, et al. “A Tight Runtime Bound for Synchronous Gathering of
Autonomous Robots with Limited Visibility.” Proceedings of the 23rd ACM Symposium
on Parallelism in Algorithms and Architectures - SPAA ’11, 2011, doi:10.1145/1989493.1989515.
short: 'B. Degener, B. Kempkes, T. Langner, F. Meyer auf der Heide, P. Pietrzyk,
R. Wattenhofer, in: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms
and Architectures - SPAA ’11, 2011.'
date_created: 2020-04-07T12:31:24Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/1989493.1989515
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: A tight runtime bound for synchronous gathering of autonomous robots with limited
visibility
type: conference
user_id: '15415'
year: '2011'
...
---
_id: '16454'
author:
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Kling P, Meyer auf der Heide F. Convergence of local communication chain strategies
via linear transformations. In: Proceedings of the 23rd ACM Symposium on Parallelism
in Algorithms and Architectures - SPAA ’11. ; 2011. doi:10.1145/1989493.1989517'
apa: Kling, P., & Meyer auf der Heide, F. (2011). Convergence of local communication
chain strategies via linear transformations. In Proceedings of the 23rd ACM
symposium on Parallelism in algorithms and architectures - SPAA ’11. https://doi.org/10.1145/1989493.1989517
bibtex: '@inproceedings{Kling_Meyer auf der Heide_2011, title={Convergence of local
communication chain strategies via linear transformations}, DOI={10.1145/1989493.1989517},
booktitle={Proceedings of the 23rd ACM symposium on Parallelism in algorithms
and architectures - SPAA ’11}, author={Kling, Peter and Meyer auf der Heide, Friedhelm},
year={2011} }'
chicago: Kling, Peter, and Friedhelm Meyer auf der Heide. “Convergence of Local
Communication Chain Strategies via Linear Transformations.” In Proceedings
of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA
’11, 2011. https://doi.org/10.1145/1989493.1989517.
ieee: P. Kling and F. Meyer auf der Heide, “Convergence of local communication chain
strategies via linear transformations,” in Proceedings of the 23rd ACM symposium
on Parallelism in algorithms and architectures - SPAA ’11, 2011.
mla: Kling, Peter, and Friedhelm Meyer auf der Heide. “Convergence of Local Communication
Chain Strategies via Linear Transformations.” Proceedings of the 23rd ACM Symposium
on Parallelism in Algorithms and Architectures - SPAA ’11, 2011, doi:10.1145/1989493.1989517.
short: 'P. Kling, F. Meyer auf der Heide, in: Proceedings of the 23rd ACM Symposium
on Parallelism in Algorithms and Architectures - SPAA ’11, 2011.'
date_created: 2020-04-07T12:33:00Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/1989493.1989517
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: Convergence of local communication chain strategies via linear transformations
type: conference
user_id: '15415'
year: '2011'
...
---
_id: '16455'
author:
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Degener B, Kempkes B, Meyer auf der Heide F. Building Simple Formations in
Large Societies of Tiny Mobile Robots. Procedia Computer Science. 2011:153-155.
doi:10.1016/j.procs.2011.09.049
apa: Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2011). Building Simple
Formations in Large Societies of Tiny Mobile Robots. Procedia Computer Science,
153–155. https://doi.org/10.1016/j.procs.2011.09.049
bibtex: '@article{Degener_Kempkes_Meyer auf der Heide_2011, title={Building Simple
Formations in Large Societies of Tiny Mobile Robots}, DOI={10.1016/j.procs.2011.09.049},
journal={Procedia Computer Science}, author={Degener, Bastian and Kempkes, Barbara
and Meyer auf der Heide, Friedhelm}, year={2011}, pages={153–155} }'
chicago: Degener, Bastian, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “Building
Simple Formations in Large Societies of Tiny Mobile Robots.” Procedia Computer
Science, 2011, 153–55. https://doi.org/10.1016/j.procs.2011.09.049.
ieee: B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Building Simple Formations
in Large Societies of Tiny Mobile Robots,” Procedia Computer Science, pp.
153–155, 2011.
mla: Degener, Bastian, et al. “Building Simple Formations in Large Societies of
Tiny Mobile Robots.” Procedia Computer Science, 2011, pp. 153–55, doi:10.1016/j.procs.2011.09.049.
short: B. Degener, B. Kempkes, F. Meyer auf der Heide, Procedia Computer Science
(2011) 153–155.
date_created: 2020-04-07T12:35:11Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1016/j.procs.2011.09.049
language:
- iso: eng
page: 153-155
publication: Procedia Computer Science
publication_identifier:
issn:
- 1877-0509
publication_status: published
status: public
title: Building Simple Formations in Large Societies of Tiny Mobile Robots
type: journal_article
user_id: '15415'
year: '2011'
...
---
_id: '16456'
author:
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Degener B, Kempkes B, Meyer auf der Heide F. Energy-Awareness in Self-organising
Robotic Exploration Teams. In: Organic Computing — A Paradigm Shift for Complex
Systems. Basel; 2011. doi:10.1007/978-3-0348-0130-0_35'
apa: Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2011). Energy-Awareness
in Self-organising Robotic Exploration Teams. In Organic Computing — A Paradigm
Shift for Complex Systems. Basel. https://doi.org/10.1007/978-3-0348-0130-0_35
bibtex: '@inbook{Degener_Kempkes_Meyer auf der Heide_2011, place={Basel}, title={Energy-Awareness
in Self-organising Robotic Exploration Teams}, DOI={10.1007/978-3-0348-0130-0_35},
booktitle={Organic Computing — A Paradigm Shift for Complex Systems}, author={Degener,
Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2011}
}'
chicago: Degener, Bastian, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “Energy-Awareness
in Self-Organising Robotic Exploration Teams.” In Organic Computing — A Paradigm
Shift for Complex Systems. Basel, 2011. https://doi.org/10.1007/978-3-0348-0130-0_35.
ieee: B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-Awareness in Self-organising
Robotic Exploration Teams,” in Organic Computing — A Paradigm Shift for Complex
Systems, Basel, 2011.
mla: Degener, Bastian, et al. “Energy-Awareness in Self-Organising Robotic Exploration
Teams.” Organic Computing — A Paradigm Shift for Complex Systems, 2011,
doi:10.1007/978-3-0348-0130-0_35.
short: 'B. Degener, B. Kempkes, F. Meyer auf der Heide, in: Organic Computing —
A Paradigm Shift for Complex Systems, Basel, 2011.'
date_created: 2020-04-07T12:36:17Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-0348-0130-0_35
language:
- iso: eng
place: Basel
publication: Organic Computing — A Paradigm Shift for Complex Systems
publication_identifier:
isbn:
- '9783034801294'
- '9783034801300'
publication_status: published
status: public
title: Energy-Awareness in Self-organising Robotic Exploration Teams
type: book_chapter
user_id: '15415'
year: '2011'
...
---
_id: '16459'
author:
- first_name: Philipp
full_name: Brandes, Philipp
last_name: Brandes
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Brandes P, Degener B, Kempkes B, Meyer auf der Heide F. Energy-Efficient Strategies
for Building Short Chains of Mobile Robots Locally. In: Structural Information
and Communication Complexity. Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-22212-2_13'
apa: Brandes, P., Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2011).
Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally.
In Structural Information and Communication Complexity. Berlin, Heidelberg.
https://doi.org/10.1007/978-3-642-22212-2_13
bibtex: '@inbook{Brandes_Degener_Kempkes_Meyer auf der Heide_2011, place={Berlin,
Heidelberg}, title={Energy-Efficient Strategies for Building Short Chains of Mobile
Robots Locally}, DOI={10.1007/978-3-642-22212-2_13},
booktitle={Structural Information and Communication Complexity}, author={Brandes,
Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm},
year={2011} }'
chicago: Brandes, Philipp, Bastian Degener, Barbara Kempkes, and Friedhelm Meyer
auf der Heide. “Energy-Efficient Strategies for Building Short Chains of Mobile
Robots Locally.” In Structural Information and Communication Complexity.
Berlin, Heidelberg, 2011. https://doi.org/10.1007/978-3-642-22212-2_13.
ieee: P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-Efficient
Strategies for Building Short Chains of Mobile Robots Locally,” in Structural
Information and Communication Complexity, Berlin, Heidelberg, 2011.
mla: Brandes, Philipp, et al. “Energy-Efficient Strategies for Building Short Chains
of Mobile Robots Locally.” Structural Information and Communication Complexity,
2011, doi:10.1007/978-3-642-22212-2_13.
short: 'P. Brandes, B. Degener, B. Kempkes, F. Meyer auf der Heide, in: Structural
Information and Communication Complexity, Berlin, Heidelberg, 2011.'
date_created: 2020-04-08T06:52:53Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-22212-2_13
language:
- iso: eng
place: Berlin, Heidelberg
publication: Structural Information and Communication Complexity
publication_identifier:
isbn:
- '9783642222115'
- '9783642222122'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally
type: book_chapter
user_id: '15415'
year: '2011'
...
---
_id: '17009'
author:
- first_name: D. Frank
full_name: Hsu, D. Frank
last_name: Hsu
- first_name: Bruce M.
full_name: Magga, Bruce M.
last_name: Magga
- first_name: Howard C. T.
full_name: Ho, Howard C. T.
last_name: Ho
- first_name: Juraj
full_name: Hromkovic, Juraj
last_name: Hromkovic
- first_name: Francis C. M.
full_name: Lau, Francis C. M.
last_name: Lau
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Hsu DF, Magga BM, Ho HCT, Hromkovic J, Lau FCM, Meyer auf der Heide F. EDITORIAL.
Journal of Interconnection Networks. 2011:vii-viii. doi:10.1142/s0219265911002885
apa: Hsu, D. F., Magga, B. M., Ho, H. C. T., Hromkovic, J., Lau, F. C. M., &
Meyer auf der Heide, F. (2011). EDITORIAL. Journal of Interconnection Networks,
vii–viii. https://doi.org/10.1142/s0219265911002885
bibtex: '@article{Hsu_Magga_Ho_Hromkovic_Lau_Meyer auf der Heide_2011, title={EDITORIAL},
DOI={10.1142/s0219265911002885},
journal={Journal of Interconnection Networks}, author={Hsu, D. Frank and Magga,
Bruce M. and Ho, Howard C. T. and Hromkovic, Juraj and Lau, Francis C. M. and
Meyer auf der Heide, Friedhelm}, year={2011}, pages={vii–viii} }'
chicago: Hsu, D. Frank, Bruce M. Magga, Howard C. T. Ho, Juraj Hromkovic, Francis
C. M. Lau, and Friedhelm Meyer auf der Heide. “EDITORIAL.” Journal of Interconnection
Networks, 2011, vii–viii. https://doi.org/10.1142/s0219265911002885.
ieee: D. F. Hsu, B. M. Magga, H. C. T. Ho, J. Hromkovic, F. C. M. Lau, and F. Meyer
auf der Heide, “EDITORIAL,” Journal of Interconnection Networks, pp. vii–viii,
2011.
mla: Hsu, D. Frank, et al. “EDITORIAL.” Journal of Interconnection Networks,
2011, pp. vii–viii, doi:10.1142/s0219265911002885.
short: D.F. Hsu, B.M. Magga, H.C.T. Ho, J. Hromkovic, F.C.M. Lau, F. Meyer auf der
Heide, Journal of Interconnection Networks (2011) vii–viii.
date_created: 2020-05-18T13:35:10Z
date_updated: 2022-01-06T06:53:01Z
department:
- _id: '63'
doi: 10.1142/s0219265911002885
language:
- iso: eng
page: vii-viii
publication: Journal of Interconnection Networks
publication_identifier:
issn:
- 0219-2659
- 1793-6713
publication_status: published
status: public
title: EDITORIAL
type: journal_article
user_id: '15415'
year: '2011'
...
---
_id: '16409'
abstract:
- lang: eng
text: "Given a set of n mobile robots in the d-dimensional Euclidean space, the
goal is to let them converge to a single not predefined point. The challenge is
that the robots are limited in their capabilities. Robots can, upon activation,
compute the positions of all other robots using an individual affine coordinate
system. The robots are indistinguishable, oblivious and may have different affine
coordinate systems. A very general discrete time model assumes that robots are
activated in arbitrary order. Further, the computation of a new target point may
happen much earlier than the movement, so that the movement is based on outdated
information about other robot's positions. Time is measured as the number of rounds,
where a round ends as soon as each robot has moved at least once. In [Cohen, Peleg:
Convergence properties of gravitational algorithms in asynchronous robot systems],
the Center of Gravity is considered as target function, convergence was proven,
and the number of rounds needed for halving the diameter of the convex hull of
the robot's positions was shown to be O(n^2) and Omega(n). We present an easy-to-check
property of target functions that guarantee convergence and yields upper time
bounds. This property intuitively says that when a robot computes a new target
point, this point is significantly within the current axes aligned minimal box
containing all robots. This property holds, e.g., for the above-mentioned target
function, and improves the above O(n^2) to an asymptotically optimal O(n) upper
bound. Our technique also yields a constant time bound for a target function that
requires all robots having identical coordinate axes.\r\n"
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
id: '146'
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
id: '15523'
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
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-04-06T07:47:55Z
date_updated: 2022-01-06T06:52:50Z
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: '15415'
year: '2011'
...
---
_id: '17462'
author:
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Ulf-Peter
full_name: Schroeder, Ulf-Peter
id: '477'
last_name: Schroeder
citation:
ama: 'Gehweiler J, Meyer auf der Heide F, Schroeder U-P. A Large-Scale Distributed
Environment for Peer-to-Peer Services. Paderborn: Heinz Nixdorf Institut;
2010.'
apa: 'Gehweiler, J., Meyer auf der Heide, F., & Schroeder, U.-P. (2010). A
Large-Scale Distributed Environment for Peer-to-Peer Services. Paderborn:
Heinz Nixdorf Institut.'
bibtex: '@book{Gehweiler_Meyer auf der Heide_Schroeder_2010, place={Paderborn},
title={A Large-Scale Distributed Environment for Peer-to-Peer Services}, publisher={Heinz
Nixdorf Institut}, author={Gehweiler, Joachim and Meyer auf der Heide, Friedhelm
and Schroeder, Ulf-Peter}, year={2010} }'
chicago: 'Gehweiler, Joachim, Friedhelm Meyer auf der Heide, and Ulf-Peter Schroeder.
A Large-Scale Distributed Environment for Peer-to-Peer Services. Paderborn:
Heinz Nixdorf Institut, 2010.'
ieee: 'J. Gehweiler, F. Meyer auf der Heide, and U.-P. Schroeder, A Large-Scale
Distributed Environment for Peer-to-Peer Services. Paderborn: Heinz Nixdorf
Institut, 2010.'
mla: Gehweiler, Joachim, et al. A Large-Scale Distributed Environment for Peer-to-Peer
Services. Heinz Nixdorf Institut, 2010.
short: J. Gehweiler, F. Meyer auf der Heide, U.-P. Schroeder, A Large-Scale Distributed
Environment for Peer-to-Peer Services, Heinz Nixdorf Institut, Paderborn, 2010.
date_created: 2020-07-30T07:25:59Z
date_updated: 2022-01-06T06:53:12Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-07-30T07:24:17Z
date_updated: 2020-07-30T07:24:17Z
file_id: '17463'
file_name: tr-ri-10-317.pdf
file_size: 468844
relation: main_file
success: 1
file_date_updated: 2020-07-30T07:24:17Z
has_accepted_license: '1'
language:
- iso: eng
place: Paderborn
publisher: Heinz Nixdorf Institut
report_number: tr-ri-10-317
status: public
title: A Large-Scale Distributed Environment for Peer-to-Peer Services
type: report
user_id: '15415'
year: '2010'
...
---
_id: '17464'
author:
- first_name: Maria J.
full_name: Blesa, Maria J.
last_name: Blesa
- first_name: Christian
full_name: Blum, Christian
last_name: Blum
- first_name: Angelo
full_name: de Caro, Angelo
last_name: de Caro
- first_name: 'Bastian '
full_name: 'Degener, Bastian '
last_name: Degener
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Piere
full_name: Leone, Piere
last_name: Leone
- first_name: Giuseppe
full_name: Persiano, Giuseppe
last_name: Persiano
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Georgios
full_name: Mylonas, Georgios
last_name: Mylonas
citation:
ama: Blesa MJ, Blum C, de Caro A, et al. Adapting a Sensor Net to the Dynamic
Environment in a Wildlife Scenario - a Case Study.; 2010.
apa: Blesa, M. J., Blum, C., de Caro, A., Degener, B., Kempkes, B., Leone, P., …
Mylonas, G. (2010). Adapting a sensor net to the dynamic environment in a wildlife
scenario - a case study.
bibtex: '@book{Blesa_Blum_de Caro_Degener_Kempkes_Leone_Persiano_Meyer auf der Heide_Mylonas_2010,
title={Adapting a sensor net to the dynamic environment in a wildlife scenario
- a case study}, author={Blesa, Maria J. and Blum, Christian and de Caro, Angelo
and Degener, Bastian and Kempkes, Barbara and Leone, Piere and Persiano, Giuseppe
and Meyer auf der Heide, Friedhelm and Mylonas, Georgios}, year={2010} }'
chicago: Blesa, Maria J., Christian Blum, Angelo de Caro, Bastian Degener, Barbara
Kempkes, Piere Leone, Giuseppe Persiano, Friedhelm Meyer auf der Heide, and Georgios
Mylonas. Adapting a Sensor Net to the Dynamic Environment in a Wildlife Scenario
- a Case Study, 2010.
ieee: M. J. Blesa et al., Adapting a sensor net to the dynamic environment
in a wildlife scenario - a case study. 2010.
mla: Blesa, Maria J., et al. Adapting a Sensor Net to the Dynamic Environment
in a Wildlife Scenario - a Case Study. 2010.
short: M.J. Blesa, C. Blum, A. de Caro, B. Degener, B. Kempkes, P. Leone, G. Persiano,
F. Meyer auf der Heide, G. Mylonas, Adapting a Sensor Net to the Dynamic Environment
in a Wildlife Scenario - a Case Study, 2010.
date_created: 2020-07-30T07:48:53Z
date_updated: 2022-01-06T06:53:12Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-07-30T07:48:24Z
date_updated: 2020-07-30T07:48:24Z
file_id: '17466'
file_name: FRONTS-TR-2010-11.pdf
file_size: 242286
relation: main_file
success: 1
file_date_updated: 2020-07-30T07:48:24Z
has_accepted_license: '1'
language:
- iso: eng
report_number: FRONTS-TR-2010-11
status: public
title: Adapting a sensor net to the dynamic environment in a wildlife scenario - a
case study
type: report
user_id: '15415'
year: '2010'
...
---
_id: '17586'
abstract:
- lang: eng
text: 'We are given a winding chain of $n$ mobile robots between two stations in
the plane, each of them having a limited viewing range. It is only guaranteed
that each robot can see its two neighbors in the chain. We analyze a simple and
natural parallel strategy to shorten the chain in a time model where each relay
is allowed to move up to a distance of $\delta$ in each time step. This model
fills the gap between the previously used discrete time model and the continuous
time model which was introduced recently in \cite{sirocco}. We analyze the strategy
with respect to two quality measures: the number of time steps and the maximum
distance to be traveled by the robots, which are the major energy consumers in
this scenario. We provide asymptotically tight or almost tight bounds in this
time model for both quality measures and it turns out that the best choice for
$\delta$ is $\delta \in \Theta(\frac{1}{n})$, since this minimizes the number
of time steps as well as the maximum traveled distance.'
author:
- first_name: Philipp
full_name: Brandes, Philipp
last_name: Brandes
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Brandes P, Degener B, Kempkes B, Meyer auf der Heide F. Building short chains
of mobile robots locally with a bounded stepwidth. 2010.
apa: Brandes, P., Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2010).
Building short chains of mobile robots locally with a bounded stepwidth.
bibtex: '@article{Brandes_Degener_Kempkes_Meyer auf der Heide_2010, title={Building
short chains of mobile robots locally with a bounded stepwidth}, author={Brandes,
Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm},
year={2010} }'
chicago: Brandes, Philipp, Bastian Degener, Barbara Kempkes, and Friedhelm Meyer
auf der Heide. “Building Short Chains of Mobile Robots Locally with a Bounded
Stepwidth,” 2010.
ieee: P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Building
short chains of mobile robots locally with a bounded stepwidth.” 2010.
mla: Brandes, Philipp, et al. Building Short Chains of Mobile Robots Locally
with a Bounded Stepwidth. 2010.
short: P. Brandes, B. Degener, B. Kempkes, F. Meyer auf der Heide, (2010).
date_created: 2020-08-04T12:28:05Z
date_updated: 2022-01-06T06:53:15Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-04T12:26:55Z
date_updated: 2020-08-04T12:26:55Z
file_id: '17587'
file_name: BoundedStepwidth.pdf
file_size: 476532
relation: main_file
success: 1
file_date_updated: 2020-08-04T12:26:55Z
has_accepted_license: '1'
language:
- iso: eng
status: public
title: Building short chains of mobile robots locally with a bounded stepwidth
type: preprint
user_id: '15415'
year: '2010'
...
---
_id: '1903'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Meyer auf der Heide F, Scheideler C. Algorithmische Grundlagen verteilter Speichersysteme.
Informatik Spektrum. 2010;(5):468--474. doi:10.1007/s00287-010-0470-2
apa: Meyer auf der Heide, F., & Scheideler, C. (2010). Algorithmische Grundlagen
verteilter Speichersysteme. Informatik Spektrum, (5), 468--474. https://doi.org/10.1007/s00287-010-0470-2
bibtex: '@article{Meyer auf der Heide_Scheideler_2010, title={Algorithmische Grundlagen
verteilter Speichersysteme}, DOI={10.1007/s00287-010-0470-2},
number={5}, journal={Informatik Spektrum}, author={Meyer auf der Heide, Friedhelm
and Scheideler, Christian}, year={2010}, pages={468--474} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische
Grundlagen Verteilter Speichersysteme.” Informatik Spektrum, no. 5 (2010):
468--474. https://doi.org/10.1007/s00287-010-0470-2.'
ieee: F. Meyer auf der Heide and C. Scheideler, “Algorithmische Grundlagen verteilter
Speichersysteme,” Informatik Spektrum, no. 5, pp. 468--474, 2010.
mla: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen
Verteilter Speichersysteme.” Informatik Spektrum, no. 5, 2010, pp. 468--474,
doi:10.1007/s00287-010-0470-2.
short: F. Meyer auf der Heide, C. Scheideler, Informatik Spektrum (2010) 468--474.
date_created: 2018-03-28T07:21:50Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/s00287-010-0470-2
issue: '5'
language:
- iso: eng
page: 468--474
publication: Informatik Spektrum
status: public
title: Algorithmische Grundlagen verteilter Speichersysteme
type: journal_article
user_id: '14955'
year: '2010'
...
---
_id: '16414'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Cynthia A.
full_name: Phillips, Cynthia A.
last_name: Phillips
citation:
ama: 'Meyer auf der Heide F, Phillips CA. Proceedings of the 22nd ACM symposium
on Parallelism in algorithms and architectures - SPAA ’10. In: ; 2010. doi:10.1145/1810479'
apa: Meyer auf der Heide, F., & Phillips, C. A. (2010). Proceedings of the 22nd
ACM symposium on Parallelism in algorithms and architectures - SPAA ’10. https://doi.org/10.1145/1810479
bibtex: '@inproceedings{Meyer auf der Heide_Phillips_2010, title={Proceedings of
the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10},
DOI={10.1145/1810479}, author={Meyer
auf der Heide, Friedhelm and Phillips, Cynthia A.}, year={2010} }'
chicago: Meyer auf der Heide, Friedhelm, and Cynthia A. Phillips. “Proceedings of
the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10,”
2010. https://doi.org/10.1145/1810479.
ieee: F. Meyer auf der Heide and C. A. Phillips, “Proceedings of the 22nd ACM symposium
on Parallelism in algorithms and architectures - SPAA ’10,” 2010.
mla: Meyer auf der Heide, Friedhelm, and Cynthia A. Phillips. Proceedings of
the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10.
2010, doi:10.1145/1810479.
short: 'F. Meyer auf der Heide, C.A. Phillips, in: 2010.'
date_created: 2020-04-06T10:42:26Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/1810479
language:
- iso: eng
publication_identifier:
isbn:
- '9781450300797'
publication_status: published
status: public
title: Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures
- SPAA '10
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '16365'
author:
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Degener B, Kempkes B, Kling P, Meyer auf der Heide F. A Continuous, Local
Strategy for Constructing a Short Chain of Mobile Robots. In: Structural Information
and Communication Complexity. SIROCCO 2010. Berlin, Heidelberg; 2010:168-182.
doi:10.1007/978-3-642-13284-1_14'
apa: Degener, B., Kempkes, B., Kling, P., & Meyer auf der Heide, F. (2010).
A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.
In Structural Information and Communication Complexity (pp. 168–182). Berlin,
Heidelberg. https://doi.org/10.1007/978-3-642-13284-1_14
bibtex: '@inbook{Degener_Kempkes_Kling_Meyer auf der Heide_2010, place={Berlin,
Heidelberg}, series={SIROCCO 2010}, title={A Continuous, Local Strategy for Constructing
a Short Chain of Mobile Robots}, DOI={10.1007/978-3-642-13284-1_14},
booktitle={Structural Information and Communication Complexity}, author={Degener,
Bastian and Kempkes, Barbara and Kling, Peter and Meyer auf der Heide, Friedhelm},
year={2010}, pages={168–182}, collection={SIROCCO 2010} }'
chicago: Degener, Bastian, Barbara Kempkes, Peter Kling, and Friedhelm Meyer auf
der Heide. “A Continuous, Local Strategy for Constructing a Short Chain of Mobile
Robots.” In Structural Information and Communication Complexity, 168–82.
SIROCCO 2010. Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-642-13284-1_14.
ieee: B. Degener, B. Kempkes, P. Kling, and F. Meyer auf der Heide, “A Continuous,
Local Strategy for Constructing a Short Chain of Mobile Robots,” in Structural
Information and Communication Complexity, Berlin, Heidelberg, 2010, pp. 168–182.
mla: Degener, Bastian, et al. “A Continuous, Local Strategy for Constructing a Short
Chain of Mobile Robots.” Structural Information and Communication Complexity,
2010, pp. 168–82, doi:10.1007/978-3-642-13284-1_14.
short: 'B. Degener, B. Kempkes, P. Kling, F. Meyer auf der Heide, in: Structural
Information and Communication Complexity, Berlin, Heidelberg, 2010, pp. 168–182.'
date_created: 2020-04-02T13:56:17Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '63'
doi: 10.1007/978-3-642-13284-1_14
language:
- iso: eng
page: 168-182
place: Berlin, Heidelberg
publication: Structural Information and Communication Complexity
publication_identifier:
isbn:
- '9783642132834'
- '9783642132841'
issn:
- 0302-9743
- 1611-3349
publication_status: published
series_title: SIROCCO 2010
status: public
title: A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots
type: book_chapter
user_id: '15415'
year: '2010'
...
---
_id: '16401'
author:
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Degener B, Kempkes B, Meyer auf der Heide F. A local O(n2) gathering algorithm.
In: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and
Architectures - SPAA ’10. ; 2010. doi:10.1145/1810479.1810523'
apa: Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2010). A local O(n2)
gathering algorithm. In Proceedings of the 22nd ACM symposium on Parallelism
in algorithms and architectures - SPAA ’10. https://doi.org/10.1145/1810479.1810523
bibtex: '@inproceedings{Degener_Kempkes_Meyer auf der Heide_2010, title={A local
O(n2) gathering algorithm}, DOI={10.1145/1810479.1810523},
booktitle={Proceedings of the 22nd ACM symposium on Parallelism in algorithms
and architectures - SPAA ’10}, author={Degener, Bastian and Kempkes, Barbara and
Meyer auf der Heide, Friedhelm}, year={2010} }'
chicago: Degener, Bastian, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “A
Local O(N2) Gathering Algorithm.” In Proceedings of the 22nd ACM Symposium
on Parallelism in Algorithms and Architectures - SPAA ’10, 2010. https://doi.org/10.1145/1810479.1810523.
ieee: B. Degener, B. Kempkes, and F. Meyer auf der Heide, “A local O(n2) gathering
algorithm,” in Proceedings of the 22nd ACM symposium on Parallelism in algorithms
and architectures - SPAA ’10, 2010.
mla: Degener, Bastian, et al. “A Local O(N2) Gathering Algorithm.” Proceedings
of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA
’10, 2010, doi:10.1145/1810479.1810523.
short: 'B. Degener, B. Kempkes, F. Meyer auf der Heide, in: Proceedings of the 22nd
ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10, 2010.'
date_created: 2020-04-03T12:48:11Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/1810479.1810523
language:
- iso: eng
publication: Proceedings of the 22nd ACM symposium on Parallelism in algorithms and
architectures - SPAA '10
publication_identifier:
isbn:
- '9781450300797'
publication_status: published
status: public
title: A local O(n2) gathering algorithm
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '16403'
citation:
ama: Abramsky S, Gavoille C, Kirchner C, Meyer auf der Heide F, Spirakis PG, eds.
Automata, Languages and Programming, 37th International Colloquium, ICALP 2010,
Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Berlin, Heidelberg;
2010. doi:10.1007/978-3-642-14162-1
apa: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., & Spirakis,
P. G. (Eds.). (2010). Automata, Languages and Programming, 37th International
Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.
Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14162-1
bibtex: '@book{Abramsky_Gavoille_Kirchner_Meyer auf der Heide_Spirakis_2010, place={Berlin,
Heidelberg}, title={Automata, Languages and Programming, 37th International Colloquium,
ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.}, DOI={10.1007/978-3-642-14162-1},
year={2010} }'
chicago: Abramsky, Samson, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf
der Heide, and Paul G. Spirakis, eds. Automata, Languages and Programming,
37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010,
Proceedings, Part II. Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-642-14162-1.
ieee: S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis,
Eds., Automata, Languages and Programming, 37th International Colloquium, ICALP
2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Berlin, Heidelberg,
2010.
mla: Abramsky, Samson, et al., editors. Automata, Languages and Programming,
37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010,
Proceedings, Part II. 2010, doi:10.1007/978-3-642-14162-1.
short: S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis,
eds., Automata, Languages and Programming, 37th International Colloquium, ICALP
2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II., Berlin, Heidelberg,
2010.
date_created: 2020-04-03T12:56:30Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-14162-1
editor:
- first_name: Samson
full_name: Abramsky, Samson
last_name: Abramsky
- first_name: Cyril
full_name: Gavoille, Cyril
last_name: Gavoille
- first_name: Claude
full_name: Kirchner, Claude
last_name: Kirchner
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Paul G.
full_name: Spirakis, Paul G.
last_name: Spirakis
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
isbn:
- '9783642141614'
- '9783642141621'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Automata, Languages and Programming, 37th International Colloquium, ICALP 2010,
Bordeaux, France, July 6-10, 2010, Proceedings, Part II.
type: book_editor
user_id: '15415'
year: '2010'
...
---
_id: '16404'
citation:
ama: Abramsky S, Gavoille C, Kirchner C, Meyer auf der Heide F, Spirakis PG, eds.
Automata, Languages and Programming, 37th International Colloquium, ICALP 2010,
Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Berlin, Heidelberg;
2010. doi:10.1007/978-3-642-14165-2
apa: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., & Spirakis,
P. G. (Eds.). (2010). Automata, Languages and Programming, 37th International
Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.
Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14165-2
bibtex: '@book{Abramsky_Gavoille_Kirchner_Meyer auf der Heide_Spirakis_2010, place={Berlin,
Heidelberg}, title={Automata, Languages and Programming, 37th International Colloquium,
ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.}, DOI={10.1007/978-3-642-14165-2},
year={2010} }'
chicago: Abramsky, Samson, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf
der Heide, and Paul G. Spirakis, eds. Automata, Languages and Programming,
37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010,
Proceedings, Part I. Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-642-14165-2.
ieee: S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis,
Eds., Automata, Languages and Programming, 37th International Colloquium, ICALP
2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Berlin, Heidelberg,
2010.
mla: Abramsky, Samson, et al., editors. Automata, Languages and Programming,
37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010,
Proceedings, Part I. 2010, doi:10.1007/978-3-642-14165-2.
short: S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis,
eds., Automata, Languages and Programming, 37th International Colloquium, ICALP
2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I., Berlin, Heidelberg,
2010.
date_created: 2020-04-03T12:58:05Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-14165-2
editor:
- first_name: Samson
full_name: Abramsky, Samson
last_name: Abramsky
- first_name: Cyril
full_name: Gavoille, Cyril
last_name: Gavoille
- first_name: Claude
full_name: Kirchner, Claude
last_name: Kirchner
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Paul G.
full_name: Spirakis, Paul G.
last_name: Spirakis
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
isbn:
- '9783642141614'
- '9783642141621'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Automata, Languages and Programming, 37th International Colloquium, ICALP 2010,
Bordeaux, France, July 6-10, 2010, Proceedings, Part I.
type: book_editor
user_id: '15415'
year: '2010'
...
---
_id: '17453'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Franz-Josef
full_name: Rammig, Franz-Josef
last_name: Rammig
citation:
ama: 'Meyer auf der Heide F, Rammig F-J. Self-Organisation and Self-Optimization.
Public Service Review: Science and Technology. 2009;04.'
apa: 'Meyer auf der Heide, F., & Rammig, F.-J. (2009). Self-Organisation and
Self-Optimization. Public Service Review: Science and Technology, 04.'
bibtex: '@article{Meyer auf der Heide_Rammig_2009, title={Self-Organisation and
Self-Optimization}, volume={04}, journal={Public Service Review: Science and Technology},
author={Meyer auf der Heide, Friedhelm and Rammig, Franz-Josef}, year={2009} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Franz-Josef Rammig. “Self-Organisation
and Self-Optimization.” Public Service Review: Science and Technology 04
(2009).'
ieee: 'F. Meyer auf der Heide and F.-J. Rammig, “Self-Organisation and Self-Optimization,”
Public Service Review: Science and Technology, vol. 04, 2009.'
mla: 'Meyer auf der Heide, Friedhelm, and Franz-Josef Rammig. “Self-Organisation
and Self-Optimization.” Public Service Review: Science and Technology,
vol. 04, 2009.'
short: 'F. Meyer auf der Heide, F.-J. Rammig, Public Service Review: Science and
Technology 04 (2009).'
date_created: 2020-07-29T13:51:54Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
intvolume: ' 4'
language:
- iso: eng
publication: 'Public Service Review: Science and Technology'
status: public
title: Self-Organisation and Self-Optimization
type: journal_article
user_id: '15415'
volume: '04'
year: '2009'
...
---
_id: '18346'
abstract:
- lang: eng
text: "For a fixed virtual scene (=collection of simplices) S and given observer\r\nposition
p, how many elements of S are weakly visible (i.e. not fully occluded\r\nby others)
from p? The present work explores the trade-off between query time\r\nand preprocessing
space for these quantities in 2D: exactly, in the approximate\r\ndeterministic,
and in the probabilistic sense. We deduce the EXISTENCE of an\r\nO(m^2/n^2) space
data structure for S that, given p and time O(log n), allows\r\nto approximate
the ratio of occluded segments up to arbitrary constant absolute\r\nerror; here
m denotes the size of the Visibility Graph--which may be quadratic,\r\nbut typically
is just linear in the size n of the scene S. On the other hand,\r\nwe present
a data structure CONSTRUCTIBLE in O(n*log(n)+m^2*polylog(n)/k)\r\npreprocessing
time and space with similar approximation properties and query\r\ntime O(k*polylog
n), where kProc. 25th European Workshop on Computational Geometry. ;
2009:203-206.'
apa: Fischer, M., Hilbig, M., Jähn, C., Meyer auf der Heide, F., & Ziegler,
M. (2009). Planar Visibility Counting. In Proc. 25th European Workshop on Computational
Geometry (pp. 203–206).
bibtex: '@inproceedings{Fischer_Hilbig_Jähn_Meyer auf der Heide_Ziegler_2009, title={Planar
Visibility Counting}, booktitle={Proc. 25th European Workshop on Computational
Geometry}, author={Fischer, Matthias and Hilbig, Matthias and Jähn, Claudius and
Meyer auf der Heide, Friedhelm and Ziegler, Martin}, year={2009}, pages={203–206}
}'
chicago: Fischer, Matthias, Matthias Hilbig, Claudius Jähn, Friedhelm Meyer auf
der Heide, and Martin Ziegler. “Planar Visibility Counting.” In Proc. 25th
European Workshop on Computational Geometry, 203–6, 2009.
ieee: M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, and M. Ziegler, “Planar
Visibility Counting,” in Proc. 25th European Workshop on Computational Geometry,
2009, pp. 203–206.
mla: Fischer, Matthias, et al. “Planar Visibility Counting.” Proc. 25th European
Workshop on Computational Geometry, 2009, pp. 203–06.
short: 'M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, M. Ziegler, in:
Proc. 25th European Workshop on Computational Geometry, 2009, pp. 203–206.'
date_created: 2020-08-26T08:49:50Z
date_updated: 2022-01-06T06:53:29Z
department:
- _id: '63'
language:
- iso: eng
page: 203-206
publication: Proc. 25th European Workshop on Computational Geometry
status: public
title: Planar Visibility Counting
type: conference
user_id: '15415'
year: '2009'
...
---
_id: '16429'
author:
- first_name: Jarosław
full_name: Kutyłowski, Jarosław
last_name: Kutyłowski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Kutyłowski J, Meyer auf der Heide F. Optimal strategies for maintaining a chain
of relays between an explorer and a base camp. Theoretical Computer Science.
2009:3391-3405. doi:10.1016/j.tcs.2008.04.010
apa: Kutyłowski, J., & Meyer auf der Heide, F. (2009). Optimal strategies for
maintaining a chain of relays between an explorer and a base camp. Theoretical
Computer Science, 3391–3405. https://doi.org/10.1016/j.tcs.2008.04.010
bibtex: '@article{Kutyłowski_Meyer auf der Heide_2009, title={Optimal strategies
for maintaining a chain of relays between an explorer and a base camp}, DOI={10.1016/j.tcs.2008.04.010},
journal={Theoretical Computer Science}, author={Kutyłowski, Jarosław and Meyer
auf der Heide, Friedhelm}, year={2009}, pages={3391–3405} }'
chicago: Kutyłowski, Jarosław, and Friedhelm Meyer auf der Heide. “Optimal Strategies
for Maintaining a Chain of Relays between an Explorer and a Base Camp.” Theoretical
Computer Science, 2009, 3391–3405. https://doi.org/10.1016/j.tcs.2008.04.010.
ieee: J. Kutyłowski and F. Meyer auf der Heide, “Optimal strategies for maintaining
a chain of relays between an explorer and a base camp,” Theoretical Computer
Science, pp. 3391–3405, 2009.
mla: Kutyłowski, Jarosław, and Friedhelm Meyer auf der Heide. “Optimal Strategies
for Maintaining a Chain of Relays between an Explorer and a Base Camp.” Theoretical
Computer Science, 2009, pp. 3391–405, doi:10.1016/j.tcs.2008.04.010.
short: J. Kutyłowski, F. Meyer auf der Heide, Theoretical Computer Science (2009)
3391–3405.
date_created: 2020-04-06T13:52:18Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2008.04.010
language:
- iso: eng
page: 3391-3405
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
status: public
title: Optimal strategies for maintaining a chain of relays between an explorer and
a base camp
type: journal_article
user_id: '15415'
year: '2009'
...
---
_id: '16430'
author:
- first_name: Jan
full_name: Mehler, Jan
last_name: Mehler
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Mehler J, Meyer auf der Heide F. Power-aware online file allocation in mobile
ad hoc networks. In: Proceedings of the Twenty-First Annual Symposium on Parallelism
in Algorithms and Architectures - SPAA ’09. ; 2009. doi:10.1145/1583991.1584072'
apa: Mehler, J., & Meyer auf der Heide, F. (2009). Power-aware online file allocation
in mobile ad hoc networks. In Proceedings of the twenty-first annual symposium
on Parallelism in algorithms and architectures - SPAA ’09. https://doi.org/10.1145/1583991.1584072
bibtex: '@inproceedings{Mehler_Meyer auf der Heide_2009, title={Power-aware online
file allocation in mobile ad hoc networks}, DOI={10.1145/1583991.1584072},
booktitle={Proceedings of the twenty-first annual symposium on Parallelism in
algorithms and architectures - SPAA ’09}, author={Mehler, Jan and Meyer auf der
Heide, Friedhelm}, year={2009} }'
chicago: Mehler, Jan, and Friedhelm Meyer auf der Heide. “Power-Aware Online File
Allocation in Mobile Ad Hoc Networks.” In Proceedings of the Twenty-First Annual
Symposium on Parallelism in Algorithms and Architectures - SPAA ’09, 2009.
https://doi.org/10.1145/1583991.1584072.
ieee: J. Mehler and F. Meyer auf der Heide, “Power-aware online file allocation
in mobile ad hoc networks,” in Proceedings of the twenty-first annual symposium
on Parallelism in algorithms and architectures - SPAA ’09, 2009.
mla: Mehler, Jan, and Friedhelm Meyer auf der Heide. “Power-Aware Online File Allocation
in Mobile Ad Hoc Networks.” Proceedings of the Twenty-First Annual Symposium
on Parallelism in Algorithms and Architectures - SPAA ’09, 2009, doi:10.1145/1583991.1584072.
short: 'J. Mehler, F. Meyer auf der Heide, in: Proceedings of the Twenty-First Annual
Symposium on Parallelism in Algorithms and Architectures - SPAA ’09, 2009.'
date_created: 2020-04-06T13:53:57Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/1583991.1584072
language:
- iso: eng
publication: Proceedings of the twenty-first annual symposium on Parallelism in algorithms
and architectures - SPAA '09
publication_identifier:
isbn:
- '9781605586069'
publication_status: published
status: public
title: Power-aware online file allocation in mobile ad hoc networks
type: conference
user_id: '15415'
year: '2009'
...