---
_id: '16448'
author:
- 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: 'Kempkes B, Meyer auf der Heide F. Local, Self-organizing Strategies for Robotic
Formation Problems. In: Algorithms for Sensor Systems. Berlin, Heidelberg;
2012. doi:10.1007/978-3-642-28209-6_2'
apa: Kempkes, B., & Meyer auf der Heide, F. (2012). Local, Self-organizing Strategies
for Robotic Formation Problems. In Algorithms for Sensor Systems. Berlin,
Heidelberg. https://doi.org/10.1007/978-3-642-28209-6_2
bibtex: '@inbook{Kempkes_Meyer auf der Heide_2012, place={Berlin, Heidelberg}, title={Local,
Self-organizing Strategies for Robotic Formation Problems}, DOI={10.1007/978-3-642-28209-6_2},
booktitle={Algorithms for Sensor Systems}, author={Kempkes, Barbara and Meyer
auf der Heide, Friedhelm}, year={2012} }'
chicago: Kempkes, Barbara, and Friedhelm Meyer auf der Heide. “Local, Self-Organizing
Strategies for Robotic Formation Problems.” In Algorithms for Sensor Systems.
Berlin, Heidelberg, 2012. https://doi.org/10.1007/978-3-642-28209-6_2.
ieee: B. Kempkes and F. Meyer auf der Heide, “Local, Self-organizing Strategies
for Robotic Formation Problems,” in Algorithms for Sensor Systems, Berlin,
Heidelberg, 2012.
mla: Kempkes, Barbara, and Friedhelm Meyer auf der Heide. “Local, Self-Organizing
Strategies for Robotic Formation Problems.” Algorithms for Sensor Systems,
2012, doi:10.1007/978-3-642-28209-6_2.
short: 'B. Kempkes, F. Meyer auf der Heide, in: Algorithms for Sensor Systems, Berlin,
Heidelberg, 2012.'
date_created: 2020-04-07T06:51:14Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-28209-6_2
language:
- iso: eng
place: Berlin, Heidelberg
publication: Algorithms for Sensor Systems
publication_identifier:
isbn:
- '9783642282089'
- '9783642282096'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Local, Self-organizing Strategies for Robotic Formation Problems
type: book_chapter
user_id: '15415'
year: '2012'
...
---
_id: '16516'
author:
- first_name: Robert
full_name: Baier, Robert
last_name: Baier
- first_name: Mirko Hessel-von
full_name: Molo, Mirko Hessel-von
last_name: Molo
citation:
ama: 'Baier R, Molo MH. Newton’s Method and Secant Method for Set-Valued Mappings.
In: Large-Scale Scientific Computing. Berlin, Heidelberg; 2012. doi:10.1007/978-3-642-29843-1_9'
apa: Baier, R., & Molo, M. H. (2012). Newton’s Method and Secant Method for
Set-Valued Mappings. In Large-Scale Scientific Computing. Berlin, Heidelberg.
https://doi.org/10.1007/978-3-642-29843-1_9
bibtex: '@inbook{Baier_Molo_2012, place={Berlin, Heidelberg}, title={Newton’s Method
and Secant Method for Set-Valued Mappings}, DOI={10.1007/978-3-642-29843-1_9},
booktitle={Large-Scale Scientific Computing}, author={Baier, Robert and Molo,
Mirko Hessel-von}, year={2012} }'
chicago: Baier, Robert, and Mirko Hessel-von Molo. “Newton’s Method and Secant Method
for Set-Valued Mappings.” In Large-Scale Scientific Computing. Berlin,
Heidelberg, 2012. https://doi.org/10.1007/978-3-642-29843-1_9.
ieee: R. Baier and M. H. Molo, “Newton’s Method and Secant Method for Set-Valued
Mappings,” in Large-Scale Scientific Computing, Berlin, Heidelberg, 2012.
mla: Baier, Robert, and Mirko Hessel-von Molo. “Newton’s Method and Secant Method
for Set-Valued Mappings.” Large-Scale Scientific Computing, 2012, doi:10.1007/978-3-642-29843-1_9.
short: 'R. Baier, M.H. Molo, in: Large-Scale Scientific Computing, Berlin, Heidelberg,
2012.'
date_created: 2020-04-15T07:59:49Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '101'
doi: 10.1007/978-3-642-29843-1_9
place: Berlin, Heidelberg
publication: Large-Scale Scientific Computing
publication_identifier:
isbn:
- '9783642298424'
- '9783642298431'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Newton’s Method and Secant Method for Set-Valued Mappings
type: book_chapter
user_id: '15701'
year: '2012'
...
---
_id: '15891'
author:
- first_name: Tibor
full_name: Jager, Tibor
last_name: Jager
- first_name: Sebastian
full_name: Schinzel, Sebastian
last_name: Schinzel
- first_name: Juraj
full_name: Somorovsky, Juraj
id: '83504'
last_name: Somorovsky
orcid: 0000-0002-3593-7720
citation:
ama: 'Jager T, Schinzel S, Somorovsky J. Bleichenbacher’s Attack Strikes again:
Breaking PKCS#1 v1.5 in XML Encryption. In: Computer Security – ESORICS 2012.
Berlin, Heidelberg; 2012. doi:10.1007/978-3-642-33167-1_43'
apa: 'Jager, T., Schinzel, S., & Somorovsky, J. (2012). Bleichenbacher’s Attack
Strikes again: Breaking PKCS#1 v1.5 in XML Encryption. In Computer Security
– ESORICS 2012. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33167-1_43'
bibtex: '@inbook{Jager_Schinzel_Somorovsky_2012, place={Berlin, Heidelberg}, title={Bleichenbacher’s
Attack Strikes again: Breaking PKCS#1 v1.5 in XML Encryption}, DOI={10.1007/978-3-642-33167-1_43},
booktitle={Computer Security – ESORICS 2012}, author={Jager, Tibor and Schinzel,
Sebastian and Somorovsky, Juraj}, year={2012} }'
chicago: 'Jager, Tibor, Sebastian Schinzel, and Juraj Somorovsky. “Bleichenbacher’s
Attack Strikes Again: Breaking PKCS#1 v1.5 in XML Encryption.” In Computer
Security – ESORICS 2012. Berlin, Heidelberg, 2012. https://doi.org/10.1007/978-3-642-33167-1_43.'
ieee: 'T. Jager, S. Schinzel, and J. Somorovsky, “Bleichenbacher’s Attack Strikes
again: Breaking PKCS#1 v1.5 in XML Encryption,” in Computer Security – ESORICS
2012, Berlin, Heidelberg, 2012.'
mla: 'Jager, Tibor, et al. “Bleichenbacher’s Attack Strikes Again: Breaking PKCS#1
v1.5 in XML Encryption.” Computer Security – ESORICS 2012, 2012, doi:10.1007/978-3-642-33167-1_43.'
short: 'T. Jager, S. Schinzel, J. Somorovsky, in: Computer Security – ESORICS 2012,
Berlin, Heidelberg, 2012.'
date_created: 2020-02-15T09:31:47Z
date_updated: 2022-01-06T06:52:39Z
doi: 10.1007/978-3-642-33167-1_43
language:
- iso: eng
place: Berlin, Heidelberg
publication: Computer Security – ESORICS 2012
publication_identifier:
isbn:
- '9783642331664'
- '9783642331671'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'Bleichenbacher’s Attack Strikes again: Breaking PKCS#1 v1.5 in XML Encryption'
type: book_chapter
user_id: '83504'
year: '2012'
...
---
_id: '16408'
abstract:
- lang: eng
text: "We present a parallel rendering system for heterogeneous PC clusters to visualize
massive models. One single, powerful visualization node is supported by a group
of backend nodes with weak graphics performance. While the visualization node
renders the visible objects, the backend nodes asynchronously perform visibility
tests and supply the front end with visible scene objects. The visualization node
stores only currently visible objects in its memory, while the scene is distributed
among the backend nodes’ memory without redundancy. To efficiently compute the
occlusion tests in spite of that each backend node stores only a fraction of the
original geometry, we complete the scene by adding highly simplified versions
of the objects stored on other nodes. We test our system with 15 backend nodes.
It is able to render a ≈ 350,M polygons (≈ 8.5,GiB) large aircraft model with
20, to 30,fps and thus allows a walk-through in real-time.\r\n"
author:
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
- first_name: Clemens
full_name: Koch, Clemens
last_name: Koch
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Suess T, Koch C, Jähn C, Fischer M, Meyer auf der Heide F. Asynchronous Occlusion
Culling on Heterogeneous PC Clusters for Distributed 3D Scenes. In: Advances
in Visual Computing. Vol 7431. Lecture Notes in Computer Science. ; 2012:502-512.
doi:10.1007/978-3-642-33179-4_48'
apa: Suess, T., Koch, C., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2012).
Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D
Scenes. Advances in Visual Computing, 7431, 502–512. https://doi.org/10.1007/978-3-642-33179-4_48
bibtex: '@inproceedings{Suess_Koch_Jähn_Fischer_Meyer auf der Heide_2012, place={Berlin,
Heidelberg}, series={Lecture Notes in Computer Science}, title={Asynchronous Occlusion
Culling on Heterogeneous PC Clusters for Distributed 3D Scenes}, volume={7431},
DOI={10.1007/978-3-642-33179-4_48},
booktitle={Advances in Visual Computing}, author={Suess, Tim and Koch, Clemens
and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm},
year={2012}, pages={502–512}, collection={Lecture Notes in Computer Science} }'
chicago: Suess, Tim, Clemens Koch, Claudius Jähn, Matthias Fischer, and Friedhelm
Meyer auf der Heide. “Asynchronous Occlusion Culling on Heterogeneous PC Clusters
for Distributed 3D Scenes.” In Advances in Visual Computing, 7431:502–12.
Lecture Notes in Computer Science. Berlin, Heidelberg, 2012. https://doi.org/10.1007/978-3-642-33179-4_48.
ieee: 'T. Suess, C. Koch, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Asynchronous
Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes,” in
Advances in Visual Computing, 2012, vol. 7431, pp. 502–512, doi: 10.1007/978-3-642-33179-4_48.'
mla: Suess, Tim, et al. “Asynchronous Occlusion Culling on Heterogeneous PC Clusters
for Distributed 3D Scenes.” Advances in Visual Computing, vol. 7431, 2012,
pp. 502–12, doi:10.1007/978-3-642-33179-4_48.
short: 'T. Suess, C. Koch, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: Advances
in Visual Computing, Berlin, Heidelberg, 2012, pp. 502–512.'
date_created: 2020-04-06T07:40:57Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-33179-4_48
intvolume: ' 7431'
language:
- iso: eng
page: 502-512
place: Berlin, Heidelberg
publication: Advances in Visual Computing
publication_identifier:
isbn:
- '9783642331787'
- '9783642331794'
issn:
- 0302-9743
- 1611-3349
publication_status: published
series_title: Lecture Notes in Computer Science
status: public
title: Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed
3D Scenes
type: conference
user_id: '15415'
volume: 7431
year: '2012'
...
---
_id: '20183'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Karl
full_name: Crailsheim, Karl
last_name: Crailsheim
citation:
ama: 'Hamann H, Schmickl T, Crailsheim K. Evolving for Creativity: Maximizing Complexity
in a Self-organized Multi-particle System. In: 10th European Conference on
Artificial Life (ECAL’09). Vol 5777. ; 2011:442--449. doi:10.1007/978-3-642-21283-3_55'
apa: 'Hamann, H., Schmickl, T., & Crailsheim, K. (2011). Evolving for Creativity:
Maximizing Complexity in a Self-organized Multi-particle System. In 10th European
Conference on Artificial Life (ECAL’09) (Vol. 5777, pp. 442--449). https://doi.org/10.1007/978-3-642-21283-3_55'
bibtex: '@inproceedings{Hamann_Schmickl_Crailsheim_2011, title={Evolving for Creativity:
Maximizing Complexity in a Self-organized Multi-particle System}, volume={5777},
DOI={10.1007/978-3-642-21283-3_55},
booktitle={10th European Conference on Artificial Life (ECAL’09)}, author={Hamann,
Heiko and Schmickl, Thomas and Crailsheim, Karl}, year={2011}, pages={442--449}
}'
chicago: 'Hamann, Heiko, Thomas Schmickl, and Karl Crailsheim. “Evolving for Creativity:
Maximizing Complexity in a Self-Organized Multi-Particle System.” In 10th European
Conference on Artificial Life (ECAL’09), 5777:442--449, 2011. https://doi.org/10.1007/978-3-642-21283-3_55.'
ieee: 'H. Hamann, T. Schmickl, and K. Crailsheim, “Evolving for Creativity: Maximizing
Complexity in a Self-organized Multi-particle System,” in 10th European Conference
on Artificial Life (ECAL’09), 2011, vol. 5777, pp. 442--449.'
mla: 'Hamann, Heiko, et al. “Evolving for Creativity: Maximizing Complexity in a
Self-Organized Multi-Particle System.” 10th European Conference on Artificial
Life (ECAL’09), vol. 5777, 2011, pp. 442--449, doi:10.1007/978-3-642-21283-3_55.'
short: 'H. Hamann, T. Schmickl, K. Crailsheim, in: 10th European Conference on Artificial
Life (ECAL’09), 2011, pp. 442--449.'
date_created: 2020-10-22T12:27:11Z
date_updated: 2022-01-06T06:54:21Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-642-21283-3_55
intvolume: ' 5777'
language:
- iso: eng
page: 442--449
publication: 10th European Conference on Artificial Life (ECAL'09)
publication_identifier:
isbn:
- '9783642212826'
- '9783642212833'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle
System'
type: conference
user_id: '15415'
volume: 5777
year: '2011'
...
---
_id: '3332'
author:
- first_name: Theodor
full_name: Lettmann, Theodor
id: '315'
last_name: Lettmann
orcid: 0000-0001-5859-2457
- first_name: Michael
full_name: Baumann, Michael
last_name: Baumann
- first_name: Markus
full_name: Eberling, Markus
last_name: Eberling
- first_name: Thomas
full_name: Kemmerich, Thomas
last_name: Kemmerich
citation:
ama: Lettmann T, Baumann M, Eberling M, Kemmerich T. Modeling Agents and Agent Systems.
Transactions on Computational Collective Intelligence V. 2011:157-181.
doi:10.1007/978-3-642-24016-4_9
apa: Lettmann, T., Baumann, M., Eberling, M., & Kemmerich, T. (2011). Modeling
Agents and Agent Systems. Transactions on Computational Collective Intelligence
V, 157–181. https://doi.org/10.1007/978-3-642-24016-4_9
bibtex: '@article{Lettmann_Baumann_Eberling_Kemmerich_2011, title={Modeling Agents
and Agent Systems}, DOI={10.1007/978-3-642-24016-4_9},
journal={Transactions on Computational Collective Intelligence V}, publisher={Springer
Berlin Heidelberg}, author={Lettmann, Theodor and Baumann, Michael and Eberling,
Markus and Kemmerich, Thomas}, year={2011}, pages={157–181} }'
chicago: Lettmann, Theodor, Michael Baumann, Markus Eberling, and Thomas Kemmerich.
“Modeling Agents and Agent Systems.” Transactions on Computational Collective
Intelligence V, 2011, 157–81. https://doi.org/10.1007/978-3-642-24016-4_9.
ieee: T. Lettmann, M. Baumann, M. Eberling, and T. Kemmerich, “Modeling Agents and
Agent Systems,” Transactions on Computational Collective Intelligence V,
pp. 157–181, 2011.
mla: Lettmann, Theodor, et al. “Modeling Agents and Agent Systems.” Transactions
on Computational Collective Intelligence V, Springer Berlin Heidelberg, 2011,
pp. 157–81, doi:10.1007/978-3-642-24016-4_9.
short: T. Lettmann, M. Baumann, M. Eberling, T. Kemmerich, Transactions on Computational
Collective Intelligence V (2011) 157–181.
date_created: 2018-06-25T09:22:18Z
date_updated: 2022-01-06T06:59:10Z
doi: 10.1007/978-3-642-24016-4_9
language:
- iso: eng
page: 157-181
publication: Transactions on Computational Collective Intelligence V
publication_identifier:
isbn:
- '9783642240157'
- '9783642240164'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Modeling Agents and Agent Systems
type: journal_article
user_id: '315'
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: '6293'
author:
- first_name: Karsten
full_name: Nebe, Karsten
last_name: Nebe
- first_name: Florian
full_name: Klompmaker, Florian
last_name: Klompmaker
- first_name: Helge
full_name: Jung, Helge
last_name: Jung
- first_name: Holger Gerhard
full_name: Fischer, Holger Gerhard
id: '30457'
last_name: Fischer
citation:
ama: 'Nebe K, Klompmaker F, Jung H, Fischer HG. Exploiting New Interaction Techniques
for Disaster Control Management Using Multitouch-, Tangible- and Pen-Based-Interaction.
In: Jacko JA, ed. Human-Computer Interaction. Interaction Techniques and Environments.
Vol 6762. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin
Heidelberg; 2011:100-109. doi:10.1007/978-3-642-21605-3_11'
apa: 'Nebe, K., Klompmaker, F., Jung, H., & Fischer, H. G. (2011). Exploiting
New Interaction Techniques for Disaster Control Management Using Multitouch-,
Tangible- and Pen-Based-Interaction. In J. A. Jacko (Ed.), Human-Computer Interaction.
Interaction Techniques and Environments. (Vol. 6762, pp. 100–109). Berlin,
Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-21605-3_11'
bibtex: '@inbook{Nebe_Klompmaker_Jung_Fischer_2011, place={Berlin, Heidelberg},
series={Lecture Notes in Computer Science}, title={Exploiting New Interaction
Techniques for Disaster Control Management Using Multitouch-, Tangible- and Pen-Based-Interaction},
volume={6762}, DOI={10.1007/978-3-642-21605-3_11},
booktitle={Human-Computer Interaction. Interaction Techniques and Environments.},
publisher={Springer Berlin Heidelberg}, author={Nebe, Karsten and Klompmaker,
Florian and Jung, Helge and Fischer, Holger Gerhard}, editor={Jacko, Julie AnneEditor},
year={2011}, pages={100–109}, collection={Lecture Notes in Computer Science} }'
chicago: 'Nebe, Karsten, Florian Klompmaker, Helge Jung, and Holger Gerhard Fischer.
“Exploiting New Interaction Techniques for Disaster Control Management Using Multitouch-,
Tangible- and Pen-Based-Interaction.” In Human-Computer Interaction. Interaction
Techniques and Environments., edited by Julie Anne Jacko, 6762:100–109. Lecture
Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011.
https://doi.org/10.1007/978-3-642-21605-3_11.'
ieee: 'K. Nebe, F. Klompmaker, H. Jung, and H. G. Fischer, “Exploiting New Interaction
Techniques for Disaster Control Management Using Multitouch-, Tangible- and Pen-Based-Interaction,”
in Human-Computer Interaction. Interaction Techniques and Environments.,
vol. 6762, J. A. Jacko, Ed. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011,
pp. 100–109.'
mla: Nebe, Karsten, et al. “Exploiting New Interaction Techniques for Disaster Control
Management Using Multitouch-, Tangible- and Pen-Based-Interaction.” Human-Computer
Interaction. Interaction Techniques and Environments., edited by Julie Anne
Jacko, vol. 6762, Springer Berlin Heidelberg, 2011, pp. 100–09, doi:10.1007/978-3-642-21605-3_11.
short: 'K. Nebe, F. Klompmaker, H. Jung, H.G. Fischer, in: J.A. Jacko (Ed.), Human-Computer
Interaction. Interaction Techniques and Environments., Springer Berlin Heidelberg,
Berlin, Heidelberg, 2011, pp. 100–109.'
conference:
end_date: 2011-07-14
location: Orlando, USA
name: International Conference on Interaction Techniques and Environments as part
of HCI International 2011
start_date: 2011-07-09
date_created: 2018-12-18T12:55:26Z
date_updated: 2022-01-06T07:03:00Z
department:
- _id: '66'
- _id: '534'
- _id: '221'
doi: 10.1007/978-3-642-21605-3_11
editor:
- first_name: Julie Anne
full_name: Jacko, Julie Anne
last_name: Jacko
intvolume: ' 6762'
language:
- iso: eng
page: 100-109
place: Berlin, Heidelberg
publication: Human-Computer Interaction. Interaction Techniques and Environments.
publication_identifier:
isbn:
- '9783642216046'
- '9783642216053'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
series_title: Lecture Notes in Computer Science
status: public
title: Exploiting New Interaction Techniques for Disaster Control Management Using
Multitouch-, Tangible- and Pen-Based-Interaction
type: book_chapter
user_id: '30457'
volume: 6762
year: '2011'
...
---
_id: '6300'
author:
- first_name: Holger Gerhard
full_name: Fischer, Holger Gerhard
id: '30457'
last_name: Fischer
- first_name: Karsten
full_name: Nebe, Karsten
last_name: Nebe
- first_name: Florian
full_name: Klompmaker, Florian
last_name: Klompmaker
citation:
ama: 'Fischer HG, Nebe K, Klompmaker F. A Holistic Model for Integrating Usability
Engineering and Software Engineering Enriched with Marketing Activities. In: Kurosu
M, ed. Human Centered Design. Vol 6776. Lecture Notes in Computer Science.
Berlin, Heidelberg: Springer Berlin Heidelberg; 2011:28-37. doi:10.1007/978-3-642-21753-1_4'
apa: 'Fischer, H. G., Nebe, K., & Klompmaker, F. (2011). A Holistic Model for
Integrating Usability Engineering and Software Engineering Enriched with Marketing
Activities. In M. Kurosu (Ed.), Human Centered Design (Vol. 6776, pp. 28–37).
Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-21753-1_4'
bibtex: '@inbook{Fischer_Nebe_Klompmaker_2011, place={Berlin, Heidelberg}, series={Lecture
Notes in Computer Science}, title={A Holistic Model for Integrating Usability
Engineering and Software Engineering Enriched with Marketing Activities}, volume={6776},
DOI={10.1007/978-3-642-21753-1_4},
booktitle={Human Centered Design}, publisher={Springer Berlin Heidelberg}, author={Fischer,
Holger Gerhard and Nebe, Karsten and Klompmaker, Florian}, editor={Kurosu, MasaakiEditor},
year={2011}, pages={28–37}, collection={Lecture Notes in Computer Science} }'
chicago: 'Fischer, Holger Gerhard, Karsten Nebe, and Florian Klompmaker. “A Holistic
Model for Integrating Usability Engineering and Software Engineering Enriched
with Marketing Activities.” In Human Centered Design, edited by Masaaki
Kurosu, 6776:28–37. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer
Berlin Heidelberg, 2011. https://doi.org/10.1007/978-3-642-21753-1_4.'
ieee: 'H. G. Fischer, K. Nebe, and F. Klompmaker, “A Holistic Model for Integrating
Usability Engineering and Software Engineering Enriched with Marketing Activities,”
in Human Centered Design, vol. 6776, M. Kurosu, Ed. Berlin, Heidelberg:
Springer Berlin Heidelberg, 2011, pp. 28–37.'
mla: Fischer, Holger Gerhard, et al. “A Holistic Model for Integrating Usability
Engineering and Software Engineering Enriched with Marketing Activities.” Human
Centered Design, edited by Masaaki Kurosu, vol. 6776, Springer Berlin Heidelberg,
2011, pp. 28–37, doi:10.1007/978-3-642-21753-1_4.
short: 'H.G. Fischer, K. Nebe, F. Klompmaker, in: M. Kurosu (Ed.), Human Centered
Design, Springer Berlin Heidelberg, Berlin, Heidelberg, 2011, pp. 28–37.'
conference:
end_date: 2011-07-14
location: Orlando, USA
name: International Conference on Human Centered Design (HCD) as part of HCI International
2011
start_date: 2011-07-09
date_created: 2018-12-18T13:04:39Z
date_updated: 2022-01-06T07:03:00Z
department:
- _id: '66'
- _id: '534'
- _id: '221'
doi: 10.1007/978-3-642-21753-1_4
editor:
- first_name: Masaaki
full_name: Kurosu, Masaaki
last_name: Kurosu
intvolume: ' 6776'
language:
- iso: eng
page: 28-37
place: Berlin, Heidelberg
publication: Human Centered Design
publication_identifier:
isbn:
- '9783642217524'
- '9783642217531'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
series_title: Lecture Notes in Computer Science
status: public
title: A Holistic Model for Integrating Usability Engineering and Software Engineering
Enriched with Marketing Activities
type: book_chapter
user_id: '30457'
volume: 6776
year: '2011'
...
---
_id: '16410'
abstract:
- lang: eng
text: 'Gathering n mobile robots in one single point in the Euclidean plane is a
widely studied problem from the area of robot formation problems. Classically,
the robots are assumed to have no physical extent, and they are able to share
a position with other robots. We drop these assumptions and investigate a similar
problem for robots with (a spherical) extent: the goal is to gather the robots
as close together as possible. More exactly, we want the robots to form a sphere
with minimum radius around a predefined point. We propose an algorithm for this
problem which synchronously moves the robots towards the center of the sphere
unless they block each other. In this case, if possible, the robots spin around
the center of the sphere. We analyze this algorithm experimentally in the plane.
If R is the distance of the farthest robot to the center of the sphere, the simulations
indicate a runtime which is linear in n and R. Additionally, we prove a theoretic
upper bound for the runtime of O(nR) for a discrete version of the problem. Simulations
also suggest a runtime of O(n + R) for the discrete version.'
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. Collisionless Gathering of Robots
with an Extent. In: 37th International Conference on Current Trends in Theory
and Practice of Computer Science (SOFSEM 2011). Springer; 2011:178-189. 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
37th International Conference on Current Trends in Theory and Practice of Computer
Science (SOFSEM 2011) (pp. 178–189). Springer. https://doi.org/10.1007/978-3-642-18381-2_15
bibtex: '@inproceedings{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_Meyer
auf der Heide_et al._2011, title={Collisionless Gathering of Robots with an Extent},
DOI={10.1007/978-3-642-18381-2_15},
number={6543}, booktitle={37th International Conference on Current Trends in Theory
and Practice of Computer Science (SOFSEM 2011)}, publisher={Springer}, 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}, pages={178–189} }'
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 37th International Conference on Current Trends
in Theory and Practice of Computer Science (SOFSEM 2011), 178–89. Springer,
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 37th International Conference on Current Trends in Theory and Practice
of Computer Science (SOFSEM 2011), 2011, no. 6543, pp. 178–189.
mla: Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an Extent.”
37th International Conference on Current Trends in Theory and Practice of Computer
Science (SOFSEM 2011), no. 6543, Springer, 2011, pp. 178–89, 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. Meyer auf der Heide, C. Raupach, K. Swierkot,
D. Warner, C. Weddemann, D. Wonisch, in: 37th International Conference on Current
Trends in Theory and Practice of Computer Science (SOFSEM 2011), Springer, 2011,
pp. 178–189.'
date_created: 2020-04-06T07:52:42Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-18381-2_15
issue: '6543'
language:
- iso: eng
page: 178-189
publication: 37th International Conference on Current Trends in Theory and Practice
of Computer Science (SOFSEM 2011)
publication_identifier:
isbn:
- '9783642183805'
- '9783642183812'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: Collisionless Gathering of Robots with an Extent
type: conference
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: '15097'
author:
- first_name: Markus
full_name: Benter, Markus
last_name: Benter
- first_name: Stefan
full_name: Böttcher, Stefan
id: '624'
last_name: Böttcher
- first_name: Rita
full_name: Hartel, Rita
id: '14961'
last_name: Hartel
citation:
ama: 'Benter M, Böttcher S, Hartel R. Mixing Bottom-Up and Top-Down XPath Query
Evaluation. In: East European Conference on Advances in Databases and Information
Systems. Springer; 2011:27-41. doi:10.1007/978-3-642-23737-9_3'
apa: Benter, M., Böttcher, S., & Hartel, R. (2011). Mixing Bottom-Up and Top-Down
XPath Query Evaluation. In East European Conference on Advances in Databases
and Information Systems (pp. 27–41). Springer. https://doi.org/10.1007/978-3-642-23737-9_3
bibtex: '@inproceedings{Benter_Böttcher_Hartel_2011, title={Mixing Bottom-Up and
Top-Down XPath Query Evaluation}, DOI={10.1007/978-3-642-23737-9_3},
booktitle={East European Conference on Advances in Databases and Information Systems},
publisher={Springer}, author={Benter, Markus and Böttcher, Stefan and Hartel,
Rita}, year={2011}, pages={27–41} }'
chicago: Benter, Markus, Stefan Böttcher, and Rita Hartel. “Mixing Bottom-Up and
Top-Down XPath Query Evaluation.” In East European Conference on Advances in
Databases and Information Systems, 27–41. Springer, 2011. https://doi.org/10.1007/978-3-642-23737-9_3.
ieee: M. Benter, S. Böttcher, and R. Hartel, “Mixing Bottom-Up and Top-Down XPath
Query Evaluation,” in East European Conference on Advances in Databases and
Information Systems, 2011, pp. 27–41.
mla: Benter, Markus, et al. “Mixing Bottom-Up and Top-Down XPath Query Evaluation.”
East European Conference on Advances in Databases and Information Systems,
Springer, 2011, pp. 27–41, doi:10.1007/978-3-642-23737-9_3.
short: 'M. Benter, S. Böttcher, R. Hartel, in: East European Conference on Advances
in Databases and Information Systems, Springer, 2011, pp. 27–41.'
date_created: 2019-11-21T15:27:31Z
date_updated: 2022-01-06T06:52:15Z
department:
- _id: '69'
doi: 10.1007/978-3-642-23737-9_3
language:
- iso: eng
page: 27-41
publication: East European Conference on Advances in Databases and Information Systems
publication_identifier:
isbn:
- '9783642237362'
- '9783642237379'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: Mixing Bottom-Up and Top-Down XPath Query Evaluation
type: conference
user_id: '14961'
year: '2011'
...
---
_id: '15099'
author:
- first_name: Alexander
full_name: Bätz, Alexander
last_name: Bätz
- first_name: Stefan
full_name: Böttcher, Stefan
id: '624'
last_name: Böttcher
- first_name: Rita
full_name: Hartel, Rita
id: '14961'
last_name: Hartel
citation:
ama: 'Bätz A, Böttcher S, Hartel R. Updates on Grammar-Compressed XML Data. In:
Advances in Databases - 28th British National Conference on Databases, BNCOD
28, Revised Selected Papers. Springer; 2011:154-166. doi:10.1007/978-3-642-24577-0_17'
apa: Bätz, A., Böttcher, S., & Hartel, R. (2011). Updates on Grammar-Compressed
XML Data. In Advances in Databases - 28th British National Conference on Databases,
BNCOD 28, Revised Selected Papers (pp. 154–166). Springer. https://doi.org/10.1007/978-3-642-24577-0_17
bibtex: '@inproceedings{Bätz_Böttcher_Hartel_2011, title={Updates on Grammar-Compressed
XML Data}, DOI={10.1007/978-3-642-24577-0_17},
booktitle={Advances in Databases - 28th British National Conference on Databases,
BNCOD 28, Revised Selected Papers}, publisher={Springer}, author={Bätz, Alexander
and Böttcher, Stefan and Hartel, Rita}, year={2011}, pages={154–166} }'
chicago: Bätz, Alexander, Stefan Böttcher, and Rita Hartel. “Updates on Grammar-Compressed
XML Data.” In Advances in Databases - 28th British National Conference on Databases,
BNCOD 28, Revised Selected Papers, 154–66. Springer, 2011. https://doi.org/10.1007/978-3-642-24577-0_17.
ieee: A. Bätz, S. Böttcher, and R. Hartel, “Updates on Grammar-Compressed XML Data,”
in Advances in Databases - 28th British National Conference on Databases, BNCOD
28, Revised Selected Papers, 2011, pp. 154–166.
mla: Bätz, Alexander, et al. “Updates on Grammar-Compressed XML Data.” Advances
in Databases - 28th British National Conference on Databases, BNCOD 28, Revised
Selected Papers, Springer, 2011, pp. 154–66, doi:10.1007/978-3-642-24577-0_17.
short: 'A. Bätz, S. Böttcher, R. Hartel, in: Advances in Databases - 28th British
National Conference on Databases, BNCOD 28, Revised Selected Papers, Springer,
2011, pp. 154–166.'
date_created: 2019-11-21T15:30:41Z
date_updated: 2022-01-06T06:52:15Z
department:
- _id: '69'
doi: 10.1007/978-3-642-24577-0_17
language:
- iso: eng
page: 154-166
publication: Advances in Databases - 28th British National Conference on Databases,
BNCOD 28, Revised Selected Papers
publication_identifier:
isbn:
- '9783642245763'
- '9783642245770'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: Updates on Grammar-Compressed XML Data
type: conference
user_id: '14961'
year: '2011'
...
---
_id: '15100'
author:
- first_name: Stefan
full_name: Böttcher, Stefan
id: '624'
last_name: Böttcher
- first_name: Rita
full_name: Hartel, Rita
id: '14961'
last_name: Hartel
- first_name: Sebastian
full_name: Stey, Sebastian
last_name: Stey
citation:
ama: 'Böttcher S, Hartel R, Stey S. TraCX: Transformation of Compressed XML. In:
Advances in Databases - 28th British National Conference on Databases, BNCOD
28, Revised Selected Papers. Springer; 2011:182-193. doi:10.1007/978-3-642-24577-0_19'
apa: 'Böttcher, S., Hartel, R., & Stey, S. (2011). TraCX: Transformation of
Compressed XML. In Advances in Databases - 28th British National Conference
on Databases, BNCOD 28, Revised Selected Papers (pp. 182–193). Springer. https://doi.org/10.1007/978-3-642-24577-0_19'
bibtex: '@inproceedings{Böttcher_Hartel_Stey_2011, title={TraCX: Transformation
of Compressed XML}, DOI={10.1007/978-3-642-24577-0_19},
booktitle={Advances in Databases - 28th British National Conference on Databases,
BNCOD 28, Revised Selected Papers}, publisher={Springer}, author={Böttcher, Stefan
and Hartel, Rita and Stey, Sebastian}, year={2011}, pages={182–193} }'
chicago: 'Böttcher, Stefan, Rita Hartel, and Sebastian Stey. “TraCX: Transformation
of Compressed XML.” In Advances in Databases - 28th British National Conference
on Databases, BNCOD 28, Revised Selected Papers, 182–93. Springer, 2011. https://doi.org/10.1007/978-3-642-24577-0_19.'
ieee: 'S. Böttcher, R. Hartel, and S. Stey, “TraCX: Transformation of Compressed
XML,” in Advances in Databases - 28th British National Conference on Databases,
BNCOD 28, Revised Selected Papers, 2011, pp. 182–193.'
mla: 'Böttcher, Stefan, et al. “TraCX: Transformation of Compressed XML.” Advances
in Databases - 28th British National Conference on Databases, BNCOD 28, Revised
Selected Papers, Springer, 2011, pp. 182–93, doi:10.1007/978-3-642-24577-0_19.'
short: 'S. Böttcher, R. Hartel, S. Stey, in: Advances in Databases - 28th British
National Conference on Databases, BNCOD 28, Revised Selected Papers, Springer,
2011, pp. 182–193.'
date_created: 2019-11-21T15:31:36Z
date_updated: 2022-01-06T06:52:15Z
department:
- _id: '69'
doi: 10.1007/978-3-642-24577-0_19
language:
- iso: eng
page: 182-193
publication: Advances in Databases - 28th British National Conference on Databases,
BNCOD 28, Revised Selected Papers
publication_identifier:
isbn:
- '9783642245763'
- '9783642245770'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: 'TraCX: Transformation of Compressed XML'
type: conference
user_id: '14961'
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: '19796'
abstract:
- lang: eng
text: "We introduce the Read-Write-Coding-System (RWC) \x96 a very flexible class
of linear block codes that generate efficient and flexible erasure codes for storage
networks. In particular, given a message x of k symbols and a codeword y of n
symbols, an RW code defines additional parameters k \\leq r,w \\leq n that offer
enhanced possibilities to adjust the fault-tolerance capability of the code. More
precisely, an RWC provides linear $\\left(n,k,d\\right)$-codes that have (a) minimum
distance d=n-r+1 for any two codewords, and (b) for each codeword there exists
a codeword for each other message with distance of at most w. Furthermore, depending
on the values r,w and the code alphabet, different block codes such as parity
codes (e.g. RAID 4/5) or Reed-Solomon (RS) codes (if r=k and thus, w=n) can be
generated. In storage networks in which I/O accesses are very costly and redundancy
is crucial, this flexibility has considerable advantages as r and w can optimally
be adapted to read or write intensive applications; only w symbols must be updated
if the message x changes completely, what is different from other codes which
always need to rewrite y completely as x changes. In this paper, we first state
a tight lower bound and basic conditions for all RW codes. Furthermore, we introduce
special RW codes in which all mentioned parameters are adjustable even online,
that is, those RW codes are adaptive to changing demands. At last, we point out
some useful properties regarding safety and security of the stored data."
author:
- first_name: Mario
full_name: Mense, Mario
last_name: Mense
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Mense M, Schindelhauer C. Read-Write-Codes: An Erasure Resilient Encoding
System for Flexible Reading and Writing in Storage Networks. In: Proceedings
of 11th International Symposium on Stabilization, Safety, and Security of Distributed
Systems. Vol 5873. Lecture Notes in Computer Science. ; 2010:624--639. doi:10.1007/978-3-642-05118-0_43'
apa: 'Mense, M., & Schindelhauer, C. (2010). Read-Write-Codes: An Erasure Resilient
Encoding System for Flexible Reading and Writing in Storage Networks. In Proceedings
of 11th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (Vol. 5873, pp. 624--639). https://doi.org/10.1007/978-3-642-05118-0_43'
bibtex: '@inproceedings{Mense_Schindelhauer_2010, series={Lecture Notes in Computer
Science}, title={Read-Write-Codes: An Erasure Resilient Encoding System for Flexible
Reading and Writing in Storage Networks}, volume={5873}, DOI={10.1007/978-3-642-05118-0_43},
booktitle={Proceedings of 11th International Symposium on Stabilization, Safety,
and Security of Distributed Systems}, author={Mense, Mario and Schindelhauer,
Christian}, year={2010}, pages={624--639}, collection={Lecture Notes in Computer
Science} }'
chicago: 'Mense, Mario, and Christian Schindelhauer. “Read-Write-Codes: An Erasure
Resilient Encoding System for Flexible Reading and Writing in Storage Networks.”
In Proceedings of 11th International Symposium on Stabilization, Safety, and
Security of Distributed Systems, 5873:624--639. Lecture Notes in Computer
Science, 2010. https://doi.org/10.1007/978-3-642-05118-0_43.'
ieee: 'M. Mense and C. Schindelhauer, “Read-Write-Codes: An Erasure Resilient Encoding
System for Flexible Reading and Writing in Storage Networks,” in Proceedings
of 11th International Symposium on Stabilization, Safety, and Security of Distributed
Systems, 2010, vol. 5873, pp. 624--639.'
mla: 'Mense, Mario, and Christian Schindelhauer. “Read-Write-Codes: An Erasure Resilient
Encoding System for Flexible Reading and Writing in Storage Networks.” Proceedings
of 11th International Symposium on Stabilization, Safety, and Security of Distributed
Systems, vol. 5873, 2010, pp. 624--639, doi:10.1007/978-3-642-05118-0_43.'
short: 'M. Mense, C. Schindelhauer, in: Proceedings of 11th International Symposium
on Stabilization, Safety, and Security of Distributed Systems, 2010, pp. 624--639.'
date_created: 2020-09-30T12:12:33Z
date_updated: 2022-01-06T06:54:12Z
department:
- _id: '63'
doi: 10.1007/978-3-642-05118-0_43
intvolume: ' 5873'
language:
- iso: eng
page: 624--639
publication: Proceedings of 11th International Symposium on Stabilization, Safety,
and Security of Distributed Systems
publication_identifier:
isbn:
- '9783642051173'
- '9783642051180'
issn:
- 0302-9743
- 1611-3349
publication_status: published
series_title: Lecture Notes in Computer Science
status: public
title: 'Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading
and Writing in Storage Networks'
type: conference
user_id: '15415'
volume: 5873
year: '2010'
...
---
_id: '20226'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Bernd
full_name: Meyer, Bernd
last_name: Meyer
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Karl
full_name: Crailsheim, Karl
last_name: Crailsheim
citation:
ama: 'Hamann H, Meyer B, Schmickl T, Crailsheim K. A Model of Symmetry Breaking
in Collective Decision-Making. In: From Animals to Animats 11. Vol 6226.
Springer; 2010:639-648. doi:10.1007/978-3-642-15193-4_60'
apa: Hamann, H., Meyer, B., Schmickl, T., & Crailsheim, K. (2010). A Model of
Symmetry Breaking in Collective Decision-Making. In From Animals to Animats
11 (Vol. 6226, pp. 639–648). Springer. https://doi.org/10.1007/978-3-642-15193-4_60
bibtex: '@inproceedings{Hamann_Meyer_Schmickl_Crailsheim_2010, title={A Model of
Symmetry Breaking in Collective Decision-Making}, volume={6226}, DOI={10.1007/978-3-642-15193-4_60},
booktitle={From Animals to Animats 11}, publisher={Springer}, author={Hamann,
Heiko and Meyer, Bernd and Schmickl, Thomas and Crailsheim, Karl}, year={2010},
pages={639–648} }'
chicago: Hamann, Heiko, Bernd Meyer, Thomas Schmickl, and Karl Crailsheim. “A Model
of Symmetry Breaking in Collective Decision-Making.” In From Animals to Animats
11, 6226:639–48. Springer, 2010. https://doi.org/10.1007/978-3-642-15193-4_60.
ieee: H. Hamann, B. Meyer, T. Schmickl, and K. Crailsheim, “A Model of Symmetry
Breaking in Collective Decision-Making,” in From Animals to Animats 11,
2010, vol. 6226, pp. 639–648.
mla: Hamann, Heiko, et al. “A Model of Symmetry Breaking in Collective Decision-Making.”
From Animals to Animats 11, vol. 6226, Springer, 2010, pp. 639–48, doi:10.1007/978-3-642-15193-4_60.
short: 'H. Hamann, B. Meyer, T. Schmickl, K. Crailsheim, in: From Animals to Animats
11, Springer, 2010, pp. 639–648.'
date_created: 2020-10-29T14:22:12Z
date_updated: 2022-01-06T06:54:24Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-642-15193-4_60
intvolume: ' 6226'
language:
- iso: eng
page: 639-648
publication: From Animals to Animats 11
publication_identifier:
isbn:
- '9783642151927'
- '9783642151934'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: A Model of Symmetry Breaking in Collective Decision-Making
type: conference
user_id: '15415'
volume: 6226
year: '2010'
...
---
_id: '24282'
author:
- first_name: Ryszard
full_name: Grza̧ślewicz, Ryszard
last_name: Grza̧ślewicz
- first_name: Jarosław
full_name: Kutyłowski, Jarosław
last_name: Kutyłowski
- first_name: Mirosław
full_name: Kutyłowski, Mirosław
last_name: Kutyłowski
- first_name: Wojciech
full_name: Pietkiewicz, Wojciech
last_name: Pietkiewicz
citation:
ama: 'Grza̧ślewicz R, Kutyłowski J, Kutyłowski M, Pietkiewicz W. Robust Undetectable
Interference Watermarks. ICCSA’05: Proceedings of the 2005 international conference
on Computational Science and Its Applications. Published online 2010. doi:10.1007/11424826_55'
apa: 'Grza̧ślewicz, R., Kutyłowski, J., Kutyłowski, M., & Pietkiewicz, W. (2010).
Robust Undetectable Interference Watermarks. ICCSA’05: Proceedings of the 2005
International Conference on Computational Science and Its Applications. https://doi.org/10.1007/11424826_55'
bibtex: '@article{Grza̧ślewicz_Kutyłowski_Kutyłowski_Pietkiewicz_2010, title={Robust
Undetectable Interference Watermarks}, DOI={10.1007/11424826_55},
journal={ICCSA’05: Proceedings of the 2005 international conference on Computational
Science and Its Applications}, author={Grza̧ślewicz, Ryszard and Kutyłowski, Jarosław
and Kutyłowski, Mirosław and Pietkiewicz, Wojciech}, year={2010} }'
chicago: 'Grza̧ślewicz, Ryszard, Jarosław Kutyłowski, Mirosław Kutyłowski, and Wojciech
Pietkiewicz. “Robust Undetectable Interference Watermarks.” ICCSA’05: Proceedings
of the 2005 International Conference on Computational Science and Its Applications,
2010. https://doi.org/10.1007/11424826_55.'
ieee: 'R. Grza̧ślewicz, J. Kutyłowski, M. Kutyłowski, and W. Pietkiewicz, “Robust
Undetectable Interference Watermarks,” ICCSA’05: Proceedings of the 2005 international
conference on Computational Science and Its Applications, 2010, doi: 10.1007/11424826_55.'
mla: 'Grza̧ślewicz, Ryszard, et al. “Robust Undetectable Interference Watermarks.”
ICCSA’05: Proceedings of the 2005 International Conference on Computational
Science and Its Applications, 2010, doi:10.1007/11424826_55.'
short: 'R. Grza̧ślewicz, J. Kutyłowski, M. Kutyłowski, W. Pietkiewicz, ICCSA’05:
Proceedings of the 2005 International Conference on Computational Science and
Its Applications (2010).'
date_created: 2021-09-13T14:53:37Z
date_updated: 2022-01-06T06:56:17Z
department:
- _id: '63'
doi: 10.1007/11424826_55
language:
- iso: eng
publication: 'ICCSA''05: Proceedings of the 2005 international conference on Computational
Science and Its Applications'
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Robust Undetectable Interference Watermarks
type: journal_article
user_id: '15415'
year: '2010'
...
---
_id: '2988'
author:
- first_name: Marcel R.
full_name: Ackermann, Marcel R.
last_name: Ackermann
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
citation:
ama: 'Ackermann MR, Blömer J. Bregman Clustering for Separable Instances. In: SWAT
2010. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin
Heidelberg; 2010:212-223. doi:10.1007/978-3-642-13731-0_21'
apa: 'Ackermann, M. R., & Blömer, J. (2010). Bregman Clustering for Separable
Instances. In SWAT 2010 (pp. 212–223). Berlin, Heidelberg: Springer Berlin
Heidelberg. https://doi.org/10.1007/978-3-642-13731-0_21'
bibtex: '@inbook{Ackermann_Blömer_2010, place={Berlin, Heidelberg}, series={Lecture
Notes in Computer Science}, title={Bregman Clustering for Separable Instances},
DOI={10.1007/978-3-642-13731-0_21},
booktitle={SWAT 2010}, publisher={Springer Berlin Heidelberg}, author={Ackermann,
Marcel R. and Blömer, Johannes}, year={2010}, pages={212–223}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable
Instances.” In SWAT 2010, 212–23. Lecture Notes in Computer Science. Berlin,
Heidelberg: Springer Berlin Heidelberg, 2010. https://doi.org/10.1007/978-3-642-13731-0_21.'
ieee: 'M. R. Ackermann and J. Blömer, “Bregman Clustering for Separable Instances,”
in SWAT 2010, Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp.
212–223.'
mla: Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable
Instances.” SWAT 2010, Springer Berlin Heidelberg, 2010, pp. 212–23, doi:10.1007/978-3-642-13731-0_21.
short: 'M.R. Ackermann, J. Blömer, in: SWAT 2010, Springer Berlin Heidelberg, Berlin,
Heidelberg, 2010, pp. 212–223.'
date_created: 2018-06-05T07:51:51Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1007/978-3-642-13731-0_21
page: 212-223
place: Berlin, Heidelberg
publication: SWAT 2010
publication_identifier:
isbn:
- '9783642137303'
- '9783642137310'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
series_title: Lecture Notes in Computer Science
status: public
title: Bregman Clustering for Separable Instances
type: book_chapter
user_id: '25078'
year: '2010'
...