---
_id: '19026'
author:
- first_name: Patrick
  full_name: Briest, Patrick
  last_name: Briest
- first_name: Christoph
  full_name: Raupach, Christoph
  last_name: Raupach
citation:
  ama: 'Briest P, Raupach C. The car sharing problem. In: <i>Proceedings of the 23rd
    ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11</i>. ;
    2011. doi:<a href="https://doi.org/10.1145/1989493.1989518">10.1145/1989493.1989518</a>'
  apa: Briest, P., &#38; Raupach, C. (2011). The car sharing problem. In <i>Proceedings
    of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA
    ’11</i>. <a href="https://doi.org/10.1145/1989493.1989518">https://doi.org/10.1145/1989493.1989518</a>
  bibtex: '@inproceedings{Briest_Raupach_2011, title={The car sharing problem}, DOI={<a
    href="https://doi.org/10.1145/1989493.1989518">10.1145/1989493.1989518</a>}, booktitle={Proceedings
    of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA
    ’11}, author={Briest, Patrick and Raupach, Christoph}, year={2011} }'
  chicago: Briest, Patrick, and Christoph Raupach. “The Car Sharing Problem.” In <i>Proceedings
    of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA
    ’11</i>, 2011. <a href="https://doi.org/10.1145/1989493.1989518">https://doi.org/10.1145/1989493.1989518</a>.
  ieee: P. Briest and C. Raupach, “The car sharing problem,” in <i>Proceedings of
    the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11</i>,
    2011.
  mla: Briest, Patrick, and Christoph Raupach. “The Car Sharing Problem.” <i>Proceedings
    of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA
    ’11</i>, 2011, doi:<a href="https://doi.org/10.1145/1989493.1989518">10.1145/1989493.1989518</a>.
  short: 'P. Briest, C. Raupach, in: Proceedings of the 23rd ACM Symposium on Parallelism
    in Algorithms and Architectures - SPAA ’11, 2011.'
date_created: 2020-09-04T11:58:54Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1145/1989493.1989518
language:
- iso: eng
publication: Proceedings of the 23rd ACM symposium on Parallelism in algorithms and
  architectures - SPAA '11
publication_identifier:
  isbn:
  - '9781450307437'
publication_status: published
status: public
title: The car sharing problem
type: conference
user_id: '15415'
year: '2011'
...
---
_id: '16428'
author:
- first_name: Rajmohan
  full_name: Rajaraman, Rajmohan
  last_name: Rajaraman
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Rajaraman R, Meyer auf der Heide F. Proceedings of the 23rd ACM symposium
    on Parallelism in algorithms and architectures - SPAA ’11. In: ; 2011. doi:<a
    href="https://doi.org/10.1145/1989493">10.1145/1989493</a>'
  apa: Rajaraman, R., &#38; Meyer auf der Heide, F. (2011). Proceedings of the 23rd
    ACM symposium on Parallelism in algorithms and architectures - SPAA ’11. <a href="https://doi.org/10.1145/1989493">https://doi.org/10.1145/1989493</a>
  bibtex: '@inproceedings{Rajaraman_Meyer auf der Heide_2011, title={Proceedings of
    the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11},
    DOI={<a href="https://doi.org/10.1145/1989493">10.1145/1989493</a>}, author={Rajaraman,
    Rajmohan and Meyer auf der Heide, Friedhelm}, year={2011} }'
  chicago: Rajaraman, Rajmohan, and Friedhelm Meyer auf der Heide. “Proceedings of
    the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11,”
    2011. <a href="https://doi.org/10.1145/1989493">https://doi.org/10.1145/1989493</a>.
  ieee: R. Rajaraman and F. Meyer auf der Heide, “Proceedings of the 23rd ACM symposium
    on Parallelism in algorithms and architectures - SPAA ’11,” 2011.
  mla: Rajaraman, Rajmohan, and Friedhelm Meyer auf der Heide. <i>Proceedings of the
    23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11</i>.
    2011, doi:<a href="https://doi.org/10.1145/1989493">10.1145/1989493</a>.
  short: 'R. Rajaraman, F. Meyer auf der Heide, in: 2011.'
date_created: 2020-04-06T13:48:10Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/1989493
language:
- iso: eng
publication_identifier:
  isbn:
  - '9781450307437'
publication_status: published
status: public
title: Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures
  - SPAA '11
type: conference
user_id: '15415'
year: '2011'
...
---
_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: <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms
    and Architectures - SPAA ’11</i>. ; 2011. doi:<a href="https://doi.org/10.1145/1989493.1989515">10.1145/1989493.1989515</a>'
  apa: Degener, B., Kempkes, B., Langner, T., Meyer auf der Heide, F., Pietrzyk, P.,
    &#38; Wattenhofer, R. (2011). A tight runtime bound for synchronous gathering
    of autonomous robots with limited visibility. In <i>Proceedings of the 23rd ACM
    symposium on Parallelism in algorithms and architectures - SPAA ’11</i>. <a href="https://doi.org/10.1145/1989493.1989515">https://doi.org/10.1145/1989493.1989515</a>
  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={<a href="https://doi.org/10.1145/1989493.1989515">10.1145/1989493.1989515</a>},
    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 <i>Proceedings of
    the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11</i>,
    2011. <a href="https://doi.org/10.1145/1989493.1989515">https://doi.org/10.1145/1989493.1989515</a>.
  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 <i>Proceedings of the 23rd ACM symposium on
    Parallelism in algorithms and architectures - SPAA ’11</i>, 2011.
  mla: Degener, Bastian, et al. “A Tight Runtime Bound for Synchronous Gathering of
    Autonomous Robots with Limited Visibility.” <i>Proceedings of the 23rd ACM Symposium
    on Parallelism in Algorithms and Architectures - SPAA ’11</i>, 2011, doi:<a href="https://doi.org/10.1145/1989493.1989515">10.1145/1989493.1989515</a>.
  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: <i>Proceedings of the 23rd ACM Symposium on Parallelism
    in Algorithms and Architectures - SPAA ’11</i>. ; 2011. doi:<a href="https://doi.org/10.1145/1989493.1989517">10.1145/1989493.1989517</a>'
  apa: Kling, P., &#38; Meyer auf der Heide, F. (2011). Convergence of local communication
    chain strategies via linear transformations. In <i>Proceedings of the 23rd ACM
    symposium on Parallelism in algorithms and architectures - SPAA ’11</i>. <a href="https://doi.org/10.1145/1989493.1989517">https://doi.org/10.1145/1989493.1989517</a>
  bibtex: '@inproceedings{Kling_Meyer auf der Heide_2011, title={Convergence of local
    communication chain strategies via linear transformations}, DOI={<a href="https://doi.org/10.1145/1989493.1989517">10.1145/1989493.1989517</a>},
    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 <i>Proceedings
    of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA
    ’11</i>, 2011. <a href="https://doi.org/10.1145/1989493.1989517">https://doi.org/10.1145/1989493.1989517</a>.
  ieee: P. Kling and F. Meyer auf der Heide, “Convergence of local communication chain
    strategies via linear transformations,” in <i>Proceedings of the 23rd ACM symposium
    on Parallelism in algorithms and architectures - SPAA ’11</i>, 2011.
  mla: Kling, Peter, and Friedhelm Meyer auf der Heide. “Convergence of Local Communication
    Chain Strategies via Linear Transformations.” <i>Proceedings of the 23rd ACM Symposium
    on Parallelism in Algorithms and Architectures - SPAA ’11</i>, 2011, doi:<a href="https://doi.org/10.1145/1989493.1989517">10.1145/1989493.1989517</a>.
  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'
...