---
_id: '16406'
abstract:
- lang: eng
  text: "In order to evaluate the efficiency of algorithms for real-time 3D rendering,
    different properties like rendering time, occluded triangles, or image quality,
    need to be investigated. Since these properties depend on the position of the
    camera, usually some camera path is chosen, along which the measurements are performed.
    As those measurements cover only a small part of the scene, this approach hardly
    allows drawing conclusions regarding the algorithm's properties at arbitrary positions
    in the scene. The presented method allows the systematic and position-independent
    evaluation of rendering algorithms. It uses an adaptive sampling approach to approximate
    the distribution of a property (like rendering time) for all positions in the
    scene. This approximation can be visualized to produce an intuitive impression
    of the algorithm's behavior or be statistically analyzed for objectively rating
    and comparing algorithms. We demonstrate our method by evaluating performance
    aspects of a known occlusion culling algorithm.\r\n"
author:
- first_name: Claudius
  full_name: Jähn, Claudius
  last_name: Jähn
- first_name: Benjamin
  full_name: Eikel, Benjamin
  last_name: Eikel
- first_name: Matthias
  full_name: Fischer, Matthias
  id: '146'
  last_name: Fischer
- first_name: Ralf
  full_name: Petring, Ralf
  last_name: Petring
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Jähn C, Eikel B, Fischer M, Petring R, Meyer auf der Heide F. Evaluation of
    Rendering Algorithms Using Position-Dependent Scene Properties. In: <i>Advances
    in Visual Computing</i>. Berlin, Heidelberg; 2013. doi:<a href="https://doi.org/10.1007/978-3-642-41914-0_12">10.1007/978-3-642-41914-0_12</a>'
  apa: Jähn, C., Eikel, B., Fischer, M., Petring, R., &#38; Meyer auf der Heide, F.
    (2013). Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties.
    In <i>Advances in Visual Computing</i>. Berlin, Heidelberg. <a href="https://doi.org/10.1007/978-3-642-41914-0_12">https://doi.org/10.1007/978-3-642-41914-0_12</a>
  bibtex: '@inbook{Jähn_Eikel_Fischer_Petring_Meyer auf der Heide_2013, place={Berlin,
    Heidelberg}, title={Evaluation of Rendering Algorithms Using Position-Dependent
    Scene Properties}, DOI={<a href="https://doi.org/10.1007/978-3-642-41914-0_12">10.1007/978-3-642-41914-0_12</a>},
    booktitle={Advances in Visual Computing}, author={Jähn, Claudius and Eikel, Benjamin
    and Fischer, Matthias and Petring, Ralf and Meyer auf der Heide, Friedhelm}, year={2013}
    }'
  chicago: Jähn, Claudius, Benjamin Eikel, Matthias Fischer, Ralf Petring, and Friedhelm
    Meyer auf der Heide. “Evaluation of Rendering Algorithms Using Position-Dependent
    Scene Properties.” In <i>Advances in Visual Computing</i>. Berlin, Heidelberg,
    2013. <a href="https://doi.org/10.1007/978-3-642-41914-0_12">https://doi.org/10.1007/978-3-642-41914-0_12</a>.
  ieee: C. Jähn, B. Eikel, M. Fischer, R. Petring, and F. Meyer auf der Heide, “Evaluation
    of Rendering Algorithms Using Position-Dependent Scene Properties,” in <i>Advances
    in Visual Computing</i>, Berlin, Heidelberg, 2013.
  mla: Jähn, Claudius, et al. “Evaluation of Rendering Algorithms Using Position-Dependent
    Scene Properties.” <i>Advances in Visual Computing</i>, 2013, doi:<a href="https://doi.org/10.1007/978-3-642-41914-0_12">10.1007/978-3-642-41914-0_12</a>.
  short: 'C. Jähn, B. Eikel, M. Fischer, R. Petring, F. Meyer auf der Heide, in: Advances
    in Visual Computing, Berlin, Heidelberg, 2013.'
date_created: 2020-04-06T07:21:55Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-41914-0_12
language:
- iso: eng
place: Berlin, Heidelberg
publication: Advances in Visual Computing
publication_identifier:
  isbn:
  - '9783642419133'
  - '9783642419140'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties
type: book_chapter
user_id: '15415'
year: '2013'
...
---
_id: '16407'
abstract:
- lang: eng
  text: "Many virtual 3D scenes, especially those that are large, are not structured
    evenly. For such heterogeneous data, there is no single algorithm that is able
    to render every scene type at each position fast and with the same high image
    quality. For a small set of scenes, this situation can be improved if different
    rendering algorithms are manually assigned to particular parts of the scene by
    an experienced user. We introduce the Multi-Algorithm-Rendering method. It automatically
    deploys different rendering algorithms simultaneously for a broad range of scene
    types. The method divides the scene into subregions and measures the behavior
    of different algorithms for each region in a preprocessing step. During runtime,
    this data is utilized to compute an estimate for the quality and running time
    of the available rendering algorithms from the observer's point of view. By solving
    an optimizing problem, the image quality can be optimized by an assignment of
    algorithms to regions while keeping the frame rate almost constant.\r\n"
author:
- first_name: Ralf
  full_name: Petring, Ralf
  last_name: Petring
- first_name: Benjamin
  full_name: Eikel, Benjamin
  last_name: Eikel
- 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: 'Petring R, Eikel B, Jähn C, Fischer M, Meyer auf der Heide F. Real-Time 3D
    Rendering of Heterogeneous Scenes. In: <i>Advances in Visual Computing</i>. Berlin,
    Heidelberg; 2013. doi:<a href="https://doi.org/10.1007/978-3-642-41914-0_44">10.1007/978-3-642-41914-0_44</a>'
  apa: Petring, R., Eikel, B., Jähn, C., Fischer, M., &#38; Meyer auf der Heide, F.
    (2013). Real-Time 3D Rendering of Heterogeneous Scenes. In <i>Advances in Visual
    Computing</i>. Berlin, Heidelberg. <a href="https://doi.org/10.1007/978-3-642-41914-0_44">https://doi.org/10.1007/978-3-642-41914-0_44</a>
  bibtex: '@inbook{Petring_Eikel_Jähn_Fischer_Meyer auf der Heide_2013, place={Berlin,
    Heidelberg}, title={Real-Time 3D Rendering of Heterogeneous Scenes}, DOI={<a href="https://doi.org/10.1007/978-3-642-41914-0_44">10.1007/978-3-642-41914-0_44</a>},
    booktitle={Advances in Visual Computing}, author={Petring, Ralf and Eikel, Benjamin
    and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm},
    year={2013} }'
  chicago: Petring, Ralf, Benjamin Eikel, Claudius Jähn, Matthias Fischer, and Friedhelm
    Meyer auf der Heide. “Real-Time 3D Rendering of Heterogeneous Scenes.” In <i>Advances
    in Visual Computing</i>. Berlin, Heidelberg, 2013. <a href="https://doi.org/10.1007/978-3-642-41914-0_44">https://doi.org/10.1007/978-3-642-41914-0_44</a>.
  ieee: R. Petring, B. Eikel, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Real-Time
    3D Rendering of Heterogeneous Scenes,” in <i>Advances in Visual Computing</i>,
    Berlin, Heidelberg, 2013.
  mla: Petring, Ralf, et al. “Real-Time 3D Rendering of Heterogeneous Scenes.” <i>Advances
    in Visual Computing</i>, 2013, doi:<a href="https://doi.org/10.1007/978-3-642-41914-0_44">10.1007/978-3-642-41914-0_44</a>.
  short: 'R. Petring, B. Eikel, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: Advances
    in Visual Computing, Berlin, Heidelberg, 2013.'
date_created: 2020-04-06T07:38:52Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-41914-0_44
language:
- iso: eng
place: Berlin, Heidelberg
publication: Advances in Visual Computing
publication_identifier:
  isbn:
  - '9783642419133'
  - '9783642419140'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Real-Time 3D Rendering of Heterogeneous Scenes
type: book_chapter
user_id: '15415'
year: '2013'
...
---
_id: '505'
abstract:
- lang: eng
  text: In this paper we introduce “On-The-Fly Computing”, our vision of future IT
    services that will be provided by assembling modular software components available
    on world-wide markets. After suitable components have been found, they are automatically
    integrated, configured and brought to execution in an On-The-Fly Compute Center.
    We envision that these future compute centers will continue to leverage three
    current trends in large scale computing which are an increasing amount of parallel
    processing, a trend to use heterogeneous computing resources, and—in the light
    of rising energy cost—energy-efficiency as a primary goal in the design and operation
    of computing systems. In this paper, we point out three research challenges and
    our current work in these areas.
author:
- first_name: Markus
  full_name: Happe, Markus
  last_name: Happe
- first_name: Peter
  full_name: Kling, Peter
  last_name: Kling
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Happe M, Kling P, Plessl C, Platzner M, Meyer auf der Heide F. On-The-Fly
    Computing: A Novel Paradigm for Individualized IT Services. In: <i>Proceedings
    of the 9th IEEE Workshop on Software Technology for Future Embedded and Ubiquitous
    Systems (SEUS)</i>. IEEE; 2013. doi:<a href="https://doi.org/10.1109/ISORC.2013.6913232">10.1109/ISORC.2013.6913232</a>'
  apa: 'Happe, M., Kling, P., Plessl, C., Platzner, M., &#38; Meyer auf der Heide,
    F. (2013). On-The-Fly Computing: A Novel Paradigm for Individualized IT Services.
    <i>Proceedings of the 9th IEEE Workshop on Software Technology for Future Embedded
    and Ubiquitous Systems (SEUS)</i>. <a href="https://doi.org/10.1109/ISORC.2013.6913232">https://doi.org/10.1109/ISORC.2013.6913232</a>'
  bibtex: '@inproceedings{Happe_Kling_Plessl_Platzner_Meyer auf der Heide_2013, title={On-The-Fly
    Computing: A Novel Paradigm for Individualized IT Services}, DOI={<a href="https://doi.org/10.1109/ISORC.2013.6913232">10.1109/ISORC.2013.6913232</a>},
    booktitle={Proceedings of the 9th IEEE Workshop on Software Technology for Future
    embedded and Ubiquitous Systems (SEUS)}, publisher={IEEE}, author={Happe, Markus
    and Kling, Peter and Plessl, Christian and Platzner, Marco and Meyer auf der Heide,
    Friedhelm}, year={2013} }'
  chicago: 'Happe, Markus, Peter Kling, Christian Plessl, Marco Platzner, and Friedhelm
    Meyer auf der Heide. “On-The-Fly Computing: A Novel Paradigm for Individualized
    IT Services.” In <i>Proceedings of the 9th IEEE Workshop on Software Technology
    for Future Embedded and Ubiquitous Systems (SEUS)</i>. IEEE, 2013. <a href="https://doi.org/10.1109/ISORC.2013.6913232">https://doi.org/10.1109/ISORC.2013.6913232</a>.'
  ieee: 'M. Happe, P. Kling, C. Plessl, M. Platzner, and F. Meyer auf der Heide, “On-The-Fly
    Computing: A Novel Paradigm for Individualized IT Services,” 2013, doi: <a href="https://doi.org/10.1109/ISORC.2013.6913232">10.1109/ISORC.2013.6913232</a>.'
  mla: 'Happe, Markus, et al. “On-The-Fly Computing: A Novel Paradigm for Individualized
    IT Services.” <i>Proceedings of the 9th IEEE Workshop on Software Technology for
    Future Embedded and Ubiquitous Systems (SEUS)</i>, IEEE, 2013, doi:<a href="https://doi.org/10.1109/ISORC.2013.6913232">10.1109/ISORC.2013.6913232</a>.'
  short: 'M. Happe, P. Kling, C. Plessl, M. Platzner, F. Meyer auf der Heide, in:
    Proceedings of the 9th IEEE Workshop on Software Technology for Future Embedded
    and Ubiquitous Systems (SEUS), IEEE, 2013.'
date_created: 2017-10-17T12:42:30Z
date_updated: 2023-09-26T13:38:20Z
ddc:
- '040'
department:
- _id: '63'
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1109/ISORC.2013.6913232
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T13:38:56Z
  date_updated: 2018-03-15T13:38:56Z
  file_id: '1308'
  file_name: 505-Plessl13_seus.pdf
  file_size: 1040834
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T13:38:56Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  grant_number: '160364472'
  name: SFB 901
- _id: '14'
  grant_number: '160364472'
  name: SFB 901 - Subprojekt C2
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 9th IEEE Workshop on Software Technology for Future
  embedded and Ubiquitous Systems (SEUS)
publisher: IEEE
quality_controlled: '1'
status: public
title: 'On-The-Fly Computing: A Novel Paradigm for Individualized IT Services'
type: conference
user_id: '15278'
year: '2013'
...
---
_id: '579'
abstract:
- lang: eng
  text: A left-to-right maximum in a sequence of n numbers s_1, …, s_n is a number
    that is strictly larger than all preceding numbers. In this article we present
    a smoothed analysis of the number of left-to-right maxima in the presence of additive
    random noise. We show that for every sequence of n numbers s_i ∈ [0,1] that are
    perturbed by uniform noise from the interval [-ε,ε], the expected number of left-to-right
    maxima is Θ(&sqrt;n/ε + log n) for ε>1/n. For Gaussian noise with standard deviation
    σ we obtain a bound of O((log3/2 n)/σ + log n).We apply our results to the analysis
    of the smoothed height of binary search trees and the smoothed number of comparisons
    in the quicksort algorithm and prove bounds of Θ(&sqrt;n/ε + log n) and Θ(n/ε+1&sqrt;n/ε
    + n log n), respectively, for uniform random noise from the interval [-ε,ε]. Our
    results can also be applied to bound the smoothed number of points on a convex
    hull of points in the two-dimensional plane and to smoothed motion complexity,
    a concept we describe in this article. We bound how often one needs to update
    a data structure storing the smallest axis-aligned box enclosing a set of points
    moving in d-dimensional space.
author:
- first_name: Valentina
  full_name: Damerow, Valentina
  last_name: Damerow
- first_name: Bodo
  full_name: Manthey, Bodo
  last_name: Manthey
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Harald
  full_name: Räcke, Harald
  last_name: Räcke
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
- first_name: Till
  full_name: Tantau, Till
  last_name: Tantau
citation:
  ama: Damerow V, Manthey B, Meyer auf der Heide F, et al. Smoothed analysis of left-to-right
    maxima with applications. <i>Transactions on Algorithms</i>. 2012;(3):30. doi:<a
    href="https://doi.org/10.1145/2229163.2229174">10.1145/2229163.2229174</a>
  apa: Damerow, V., Manthey, B., Meyer auf der Heide, F., Räcke, H., Scheideler, C.,
    Sohler, C., &#38; Tantau, T. (2012). Smoothed analysis of left-to-right maxima
    with applications. <i>Transactions on Algorithms</i>, (3), 30. <a href="https://doi.org/10.1145/2229163.2229174">https://doi.org/10.1145/2229163.2229174</a>
  bibtex: '@article{Damerow_Manthey_Meyer auf der Heide_Räcke_Scheideler_Sohler_Tantau_2012,
    title={Smoothed analysis of left-to-right maxima with applications}, DOI={<a href="https://doi.org/10.1145/2229163.2229174">10.1145/2229163.2229174</a>},
    number={3}, journal={Transactions on Algorithms}, publisher={ACM}, author={Damerow,
    Valentina and Manthey, Bodo and Meyer auf der Heide, Friedhelm and Räcke, Harald
    and Scheideler, Christian and Sohler, Christian and Tantau, Till}, year={2012},
    pages={30} }'
  chicago: 'Damerow, Valentina, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald
    Räcke, Christian Scheideler, Christian Sohler, and Till Tantau. “Smoothed Analysis
    of Left-to-Right Maxima with Applications.” <i>Transactions on Algorithms</i>,
    no. 3 (2012): 30. <a href="https://doi.org/10.1145/2229163.2229174">https://doi.org/10.1145/2229163.2229174</a>.'
  ieee: V. Damerow <i>et al.</i>, “Smoothed analysis of left-to-right maxima with
    applications,” <i>Transactions on Algorithms</i>, no. 3, p. 30, 2012.
  mla: Damerow, Valentina, et al. “Smoothed Analysis of Left-to-Right Maxima with
    Applications.” <i>Transactions on Algorithms</i>, no. 3, ACM, 2012, p. 30, doi:<a
    href="https://doi.org/10.1145/2229163.2229174">10.1145/2229163.2229174</a>.
  short: V. Damerow, B. Manthey, F. Meyer auf der Heide, H. Räcke, C. Scheideler,
    C. Sohler, T. Tantau, Transactions on Algorithms (2012) 30.
date_created: 2017-10-17T12:42:45Z
date_updated: 2022-01-06T07:02:41Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1145/2229163.2229174
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T09:04:58Z
  date_updated: 2018-03-15T09:04:58Z
  file_id: '1266'
  file_name: 579-a30-damerow.pdf
  file_size: 329282
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T09:04:58Z
has_accepted_license: '1'
issue: '3'
page: '30'
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Transactions on Algorithms
publisher: ACM
status: public
title: Smoothed analysis of left-to-right maxima with applications
type: journal_article
user_id: '477'
year: '2012'
...
---
_id: '619'
abstract:
- lang: eng
  text: 'Dynamics in networks is caused by a variety of reasons, like nodes moving
    in 2D (or 3D) in multihop cellphone networks, joins and leaves in peer-to-peer
    networks, evolution in social networks, and many others. In order to understand
    such kinds of dynamics, and to design distributed algorithms that behave well
    under dynamics, many ways to model dynamics are introduced and analyzed w.r.t.
    correctness and eciency of distributed algorithms. In [16], Kuhn, Lynch, and Oshman
    have introduced a very general, worst case type model of dynamics: The edge set
    of the network may change arbitrarily from step to step, the only restriction
    is that it is connected at all times and the set of nodes does not change. An
    extended model demands that a xed connected subnetwork is maintained over each
    time interval of length T (T-interval dynamics). They have presented, among others,
    algorithms for counting the number of nodes under such general models of dynamics.In
    this paper, we generalize their models and algorithms by adding random edge faults,
    i.e., we consider fault-prone dynamic networks: We assume that an edge currently
    existing may fail to transmit data with some probability p. We rst observe that
    strong counting, i.e., each node knows the correct count and stops, is not possible
    in a model with random edge faults. Our main two positive results are feasibility
    and runtime bounds for weak counting, i.e., stopping is no longer required (but
    still a correct count in each node), and for strong counting with an upper bound,
    i.e., an upper bound N on n is known to all nodes.'
author:
- first_name: Philipp
  full_name: Brandes, Philipp
  last_name: Brandes
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Brandes P, Meyer auf der Heide F. Distributed Computing in Fault-Prone Dynamic
    Networks. In: <i>Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic
    Distributed Systems (TADDS)</i>. ICPS. ; 2012:9-14. doi:<a href="https://doi.org/10.1145/2414815.2414818">10.1145/2414815.2414818</a>'
  apa: Brandes, P., &#38; Meyer auf der Heide, F. (2012). Distributed Computing in
    Fault-Prone Dynamic Networks. In <i>Proceedings of the 4th Workshop on Theoretical
    Aspects of Dynamic Distributed Systems (TADDS)</i> (pp. 9–14). <a href="https://doi.org/10.1145/2414815.2414818">https://doi.org/10.1145/2414815.2414818</a>
  bibtex: '@inproceedings{Brandes_Meyer auf der Heide_2012, series={ICPS}, title={Distributed
    Computing in Fault-Prone Dynamic Networks}, DOI={<a href="https://doi.org/10.1145/2414815.2414818">10.1145/2414815.2414818</a>},
    booktitle={Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed
    Systems (TADDS)}, author={Brandes, Philipp and Meyer auf der Heide, Friedhelm},
    year={2012}, pages={9–14}, collection={ICPS} }'
  chicago: Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing
    in Fault-Prone Dynamic Networks.” In <i>Proceedings of the 4th Workshop on Theoretical
    Aspects of Dynamic Distributed Systems (TADDS)</i>, 9–14. ICPS, 2012. <a href="https://doi.org/10.1145/2414815.2414818">https://doi.org/10.1145/2414815.2414818</a>.
  ieee: P. Brandes and F. Meyer auf der Heide, “Distributed Computing in Fault-Prone
    Dynamic Networks,” in <i>Proceedings of the 4th Workshop on Theoretical Aspects
    of Dynamic Distributed Systems (TADDS)</i>, 2012, pp. 9–14.
  mla: Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing
    in Fault-Prone Dynamic Networks.” <i>Proceedings of the 4th Workshop on Theoretical
    Aspects of Dynamic Distributed Systems (TADDS)</i>, 2012, pp. 9–14, doi:<a href="https://doi.org/10.1145/2414815.2414818">10.1145/2414815.2414818</a>.
  short: 'P. Brandes, F. Meyer auf der Heide, in: Proceedings of the 4th Workshop
    on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14.'
date_created: 2017-10-17T12:42:52Z
date_updated: 2022-01-06T07:02:56Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1145/2414815.2414818
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T06:47:15Z
  date_updated: 2018-03-15T06:47:15Z
  file_id: '1244'
  file_name: 619-Brandes_MadHTADDS12_01.pdf
  file_size: 346044
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T06:47:15Z
has_accepted_license: '1'
page: 9-14
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed
  Systems (TADDS)
series_title: ICPS
status: public
title: Distributed Computing in Fault-Prone Dynamic Networks
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '636'
abstract:
- lang: eng
  text: We consider an online facility location problem where clients arrive over
    time and their demands have to be served by opening facilities and assigning the
    clients to opened facilities. When opening a facility we must choose one of K
    different lease types to use. A lease type k has a certain lease length lk. Opening
    a facility i using lease type k causes a cost of f k i and ensures that i is open
    for the next lk time steps. In addition to costs for opening facilities, we have
    to take connection costs ci j into account when assigning a client j to facility
    i. We develop and analyze the first online algorithm for this problem that has
    a time-independent competitive factor.This variant of the online facility location
    problem was introduced by Nagarajan and Williamson [7] and is strongly related
    to both the online facility problem by Meyerson [5] and the parking permit problem
    by Meyerson [6]. Nagarajan and Williamson gave a 3-approximation algorithm for
    the offline problem and an O(Klogn)-competitive algorithm for the online variant.
    Here, n denotes the total number of clients arriving over time. We extend their
    result by removing the dependency on n (and thereby on the time). In general,
    our algorithm is O(lmax log(lmax))-competitive. Here lmax denotes the maximum
    lease length. Moreover, we prove that it is O(log2(lmax))-competitive for many
    “natural” cases. Such cases include, for example, situations where the number
    of clients arriving in each time step does not vary too much, or is non-increasing,
    or is polynomially bounded in lmax.
author:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Peter
  full_name: Pietrzyk, Peter
  last_name: Pietrzyk
- first_name: Peter
  full_name: Kling, Peter
  last_name: Kling
citation:
  ama: 'Meyer auf der Heide F, Pietrzyk P, Kling P. An Algorithm for Facility Leasing.
    In: <i>Proceedings of the 19th International Colloquium on Structural Information
    &#38; Communication Complexity (SIROCCO)</i>. LNCS. ; 2012:61-72. doi:<a href="https://doi.org/10.1007/978-3-642-31104-8_6">10.1007/978-3-642-31104-8_6</a>'
  apa: Meyer auf der Heide, F., Pietrzyk, P., &#38; Kling, P. (2012). An Algorithm
    for Facility Leasing. In <i>Proceedings of the 19th International Colloquium on
    Structural Information &#38; Communication Complexity (SIROCCO)</i> (pp. 61–72).
    <a href="https://doi.org/10.1007/978-3-642-31104-8_6">https://doi.org/10.1007/978-3-642-31104-8_6</a>
  bibtex: '@inproceedings{Meyer auf der Heide_Pietrzyk_Kling_2012, series={LNCS},
    title={An Algorithm for Facility Leasing}, DOI={<a href="https://doi.org/10.1007/978-3-642-31104-8_6">10.1007/978-3-642-31104-8_6</a>},
    booktitle={Proceedings of the 19th International Colloquium on Structural Information
    &#38; Communication Complexity (SIROCCO)}, author={Meyer auf der Heide, Friedhelm
    and Pietrzyk, Peter and Kling, Peter}, year={2012}, pages={61–72}, collection={LNCS}
    }'
  chicago: Meyer auf der Heide, Friedhelm, Peter Pietrzyk, and Peter Kling. “An Algorithm
    for Facility Leasing.” In <i>Proceedings of the 19th International Colloquium
    on Structural Information &#38; Communication Complexity (SIROCCO)</i>, 61–72.
    LNCS, 2012. <a href="https://doi.org/10.1007/978-3-642-31104-8_6">https://doi.org/10.1007/978-3-642-31104-8_6</a>.
  ieee: F. Meyer auf der Heide, P. Pietrzyk, and P. Kling, “An Algorithm for Facility
    Leasing,” in <i>Proceedings of the 19th International Colloquium on Structural
    Information &#38; Communication Complexity (SIROCCO)</i>, 2012, pp. 61–72.
  mla: Meyer auf der Heide, Friedhelm, et al. “An Algorithm for Facility Leasing.”
    <i>Proceedings of the 19th International Colloquium on Structural Information
    &#38; Communication Complexity (SIROCCO)</i>, 2012, pp. 61–72, doi:<a href="https://doi.org/10.1007/978-3-642-31104-8_6">10.1007/978-3-642-31104-8_6</a>.
  short: 'F. Meyer auf der Heide, P. Pietrzyk, P. Kling, in: Proceedings of the 19th
    International Colloquium on Structural Information &#38; Communication Complexity
    (SIROCCO), 2012, pp. 61–72.'
date_created: 2017-10-17T12:42:56Z
date_updated: 2022-01-06T07:03:02Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-642-31104-8_6
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-14T14:14:21Z
  date_updated: 2018-03-14T14:14:21Z
  file_id: '1232'
  file_name: 636-Online_Facility_Location.pdf
  file_size: 173049
  relation: main_file
  success: 1
file_date_updated: 2018-03-14T14:14:21Z
has_accepted_license: '1'
page: 61-72
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 19th International Colloquium on Structural Information
  & Communication Complexity (SIROCCO)
series_title: LNCS
status: public
title: An Algorithm for Facility Leasing
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '16445'
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. Continuous Local Strategies for Robotic
    Formation Problems. In: <i>Experimental Algorithms</i>. Berlin, Heidelberg; 2012.
    doi:<a href="https://doi.org/10.1007/978-3-642-30850-5_2">10.1007/978-3-642-30850-5_2</a>'
  apa: Kempkes, B., &#38; Meyer auf der Heide, F. (2012). Continuous Local Strategies
    for Robotic Formation Problems. In <i>Experimental Algorithms</i>. Berlin, Heidelberg.
    <a href="https://doi.org/10.1007/978-3-642-30850-5_2">https://doi.org/10.1007/978-3-642-30850-5_2</a>
  bibtex: '@inbook{Kempkes_Meyer auf der Heide_2012, place={Berlin, Heidelberg}, title={Continuous
    Local Strategies for Robotic Formation Problems}, DOI={<a href="https://doi.org/10.1007/978-3-642-30850-5_2">10.1007/978-3-642-30850-5_2</a>},
    booktitle={Experimental Algorithms}, author={Kempkes, Barbara and Meyer auf der
    Heide, Friedhelm}, year={2012} }'
  chicago: Kempkes, Barbara, and Friedhelm Meyer auf der Heide. “Continuous Local
    Strategies for Robotic Formation Problems.” In <i>Experimental Algorithms</i>.
    Berlin, Heidelberg, 2012. <a href="https://doi.org/10.1007/978-3-642-30850-5_2">https://doi.org/10.1007/978-3-642-30850-5_2</a>.
  ieee: B. Kempkes and F. Meyer auf der Heide, “Continuous Local Strategies for Robotic
    Formation Problems,” in <i>Experimental Algorithms</i>, Berlin, Heidelberg, 2012.
  mla: Kempkes, Barbara, and Friedhelm Meyer auf der Heide. “Continuous Local Strategies
    for Robotic Formation Problems.” <i>Experimental Algorithms</i>, 2012, doi:<a
    href="https://doi.org/10.1007/978-3-642-30850-5_2">10.1007/978-3-642-30850-5_2</a>.
  short: 'B. Kempkes, F. Meyer auf der Heide, in: Experimental Algorithms, Berlin,
    Heidelberg, 2012.'
date_created: 2020-04-07T06:41:18Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-30850-5_2
language:
- iso: eng
place: Berlin, Heidelberg
publication: Experimental Algorithms
publication_identifier:
  isbn:
  - '9783642308499'
  - '9783642308505'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Continuous Local Strategies for Robotic Formation Problems
type: book_chapter
user_id: '15415'
year: '2012'
...
---
_id: '16446'
author:
- 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: 'Kempkes B, Kling P, Meyer auf der Heide F. Optimal and competitive runtime
    bounds for continuous, local gathering of mobile robots. In: <i>Proceedinbgs of
    the 24th ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’12</i>.
    ; 2012. doi:<a href="https://doi.org/10.1145/2312005.2312009">10.1145/2312005.2312009</a>'
  apa: Kempkes, B., Kling, P., &#38; Meyer auf der Heide, F. (2012). Optimal and competitive
    runtime bounds for continuous, local gathering of mobile robots. In <i>Proceedinbgs
    of the 24th ACM symposium on Parallelism in algorithms and architectures - SPAA
    ’12</i>. <a href="https://doi.org/10.1145/2312005.2312009">https://doi.org/10.1145/2312005.2312009</a>
  bibtex: '@inproceedings{Kempkes_Kling_Meyer auf der Heide_2012, title={Optimal and
    competitive runtime bounds for continuous, local gathering of mobile robots},
    DOI={<a href="https://doi.org/10.1145/2312005.2312009">10.1145/2312005.2312009</a>},
    booktitle={Proceedinbgs of the 24th ACM symposium on Parallelism in algorithms
    and architectures - SPAA ’12}, author={Kempkes, Barbara and Kling, Peter and Meyer
    auf der Heide, Friedhelm}, year={2012} }'
  chicago: Kempkes, Barbara, Peter Kling, and Friedhelm Meyer auf der Heide. “Optimal
    and Competitive Runtime Bounds for Continuous, Local Gathering of Mobile Robots.”
    In <i>Proceedinbgs of the 24th ACM Symposium on Parallelism in Algorithms and
    Architectures - SPAA ’12</i>, 2012. <a href="https://doi.org/10.1145/2312005.2312009">https://doi.org/10.1145/2312005.2312009</a>.
  ieee: B. Kempkes, P. Kling, and F. Meyer auf der Heide, “Optimal and competitive
    runtime bounds for continuous, local gathering of mobile robots,” in <i>Proceedinbgs
    of the 24th ACM symposium on Parallelism in algorithms and architectures - SPAA
    ’12</i>, 2012.
  mla: Kempkes, Barbara, et al. “Optimal and Competitive Runtime Bounds for Continuous,
    Local Gathering of Mobile Robots.” <i>Proceedinbgs of the 24th ACM Symposium on
    Parallelism in Algorithms and Architectures - SPAA ’12</i>, 2012, doi:<a href="https://doi.org/10.1145/2312005.2312009">10.1145/2312005.2312009</a>.
  short: 'B. Kempkes, P. Kling, F. Meyer auf der Heide, in: Proceedinbgs of the 24th
    ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’12, 2012.'
date_created: 2020-04-07T06:43:11Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/2312005.2312009
language:
- iso: eng
publication: Proceedinbgs of the 24th ACM symposium on Parallelism in algorithms and
  architectures - SPAA '12
publication_identifier:
  isbn:
  - '9781450312134'
publication_status: published
status: public
title: Optimal and competitive runtime bounds for continuous, local gathering of mobile
  robots
type: conference
user_id: '15415'
year: '2012'
...
---
_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: <i>Algorithms for Sensor Systems</i>. Berlin, Heidelberg;
    2012. doi:<a href="https://doi.org/10.1007/978-3-642-28209-6_2">10.1007/978-3-642-28209-6_2</a>'
  apa: Kempkes, B., &#38; Meyer auf der Heide, F. (2012). Local, Self-organizing Strategies
    for Robotic Formation Problems. In <i>Algorithms for Sensor Systems</i>. Berlin,
    Heidelberg. <a href="https://doi.org/10.1007/978-3-642-28209-6_2">https://doi.org/10.1007/978-3-642-28209-6_2</a>
  bibtex: '@inbook{Kempkes_Meyer auf der Heide_2012, place={Berlin, Heidelberg}, title={Local,
    Self-organizing Strategies for Robotic Formation Problems}, DOI={<a href="https://doi.org/10.1007/978-3-642-28209-6_2">10.1007/978-3-642-28209-6_2</a>},
    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 <i>Algorithms for Sensor Systems</i>.
    Berlin, Heidelberg, 2012. <a href="https://doi.org/10.1007/978-3-642-28209-6_2">https://doi.org/10.1007/978-3-642-28209-6_2</a>.
  ieee: B. Kempkes and F. Meyer auf der Heide, “Local, Self-organizing Strategies
    for Robotic Formation Problems,” in <i>Algorithms for Sensor Systems</i>, Berlin,
    Heidelberg, 2012.
  mla: Kempkes, Barbara, and Friedhelm Meyer auf der Heide. “Local, Self-Organizing
    Strategies for Robotic Formation Problems.” <i>Algorithms for Sensor Systems</i>,
    2012, doi:<a href="https://doi.org/10.1007/978-3-642-28209-6_2">10.1007/978-3-642-28209-6_2</a>.
  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: '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: <i>Advances
    in Visual Computing</i>. Vol 7431. Lecture Notes in Computer Science. ; 2012:502-512.
    doi:<a href="https://doi.org/10.1007/978-3-642-33179-4_48">10.1007/978-3-642-33179-4_48</a>'
  apa: Suess, T., Koch, C., Jähn, C., Fischer, M., &#38; Meyer auf der Heide, F. (2012).
    Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D
    Scenes. <i>Advances in Visual Computing</i>, <i>7431</i>, 502–512. <a href="https://doi.org/10.1007/978-3-642-33179-4_48">https://doi.org/10.1007/978-3-642-33179-4_48</a>
  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={<a href="https://doi.org/10.1007/978-3-642-33179-4_48">10.1007/978-3-642-33179-4_48</a>},
    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 <i>Advances in Visual Computing</i>, 7431:502–12.
    Lecture Notes in Computer Science. Berlin, Heidelberg, 2012. <a href="https://doi.org/10.1007/978-3-642-33179-4_48">https://doi.org/10.1007/978-3-642-33179-4_48</a>.
  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
    <i>Advances in Visual Computing</i>, 2012, vol. 7431, pp. 502–512, doi: <a href="https://doi.org/10.1007/978-3-642-33179-4_48">10.1007/978-3-642-33179-4_48</a>.'
  mla: Suess, Tim, et al. “Asynchronous Occlusion Culling on Heterogeneous PC Clusters
    for Distributed 3D Scenes.” <i>Advances in Visual Computing</i>, vol. 7431, 2012,
    pp. 502–12, doi:<a href="https://doi.org/10.1007/978-3-642-33179-4_48">10.1007/978-3-642-33179-4_48</a>.
  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: '26196'
citation:
  ama: Gausemeier J, Grafe M, Meyer auf der Heide F, eds. <i>10. Paderborner Workshop
    Augmented &#38; Virtual Reality in der Produktentstehung</i>. Vol 295. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn; 2011.
  apa: Gausemeier, J., Grafe, M., &#38; Meyer auf der Heide, F. (Eds.). (2011). <i>10.
    Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i>
    (Vol. 295). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
  bibtex: '@book{Gausemeier_Grafe_Meyer auf der Heide_2011, series={Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn}, title={10. Paderborner Workshop Augmented
    &#38; Virtual Reality in der Produktentstehung}, volume={295}, publisher={Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn}, year={2011}, collection={Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn} }'
  chicago: Gausemeier, Jürgen, Michael Grafe, and Friedhelm Meyer auf der Heide, eds.
    <i>10. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i>.
    Vol. 295. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 2011.
  ieee: J. Gausemeier, M. Grafe, and F. Meyer auf der Heide, Eds., <i>10. Paderborner
    Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i>, vol. 295.
    Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.
  mla: Gausemeier, Jürgen, et al., editors. <i>10. Paderborner Workshop Augmented
    &#38; Virtual Reality in der Produktentstehung</i>. Verlagsschriftenreihe des
    Heinz Nixdorf Instituts, Paderborn, 2011.
  short: J. Gausemeier, M. Grafe, F. Meyer auf der Heide, eds., 10. Paderborner Workshop
    Augmented &#38; Virtual Reality in der Produktentstehung, Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 2011.
date_created: 2021-10-15T08:28:23Z
date_updated: 2022-01-06T06:57:17Z
department:
- _id: '26'
editor:
- first_name: Jürgen
  full_name: Gausemeier, Jürgen
  id: '163'
  last_name: Gausemeier
- first_name: Michael
  full_name: Grafe, Michael
  last_name: Grafe
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
intvolume: '       295'
language:
- iso: ger
publication_status: published
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: 10. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
type: conference_editor
user_id: '60046'
volume: 295
year: '2011'
...
---
_id: '17450'
author:
- first_name: Tim
  full_name: Suess, Tim
  last_name: Suess
- 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
- first_name: Clemens
  full_name: Koch, Clemens
  last_name: Koch
citation:
  ama: 'Suess T, Jähn C, Fischer M, Meyer auf der Heide F, Koch C. Ein paralleles
    Out-of-Core Renderingsystem für Standard-Rechnernetze. In: <i>Augmented &#38;
    Virtual Reality in Der Produktentstehung</i>. Vol 295. Verlagsschriftenreihe des
    Heinz Nixdorf Instituts; 2011:185--197.'
  apa: Suess, T., Jähn, C., Fischer, M., Meyer auf der Heide, F., &#38; Koch, C. (2011).
    Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze. <i>Augmented
    &#38; Virtual Reality in Der Produktentstehung</i>, <i>295</i>, 185--197.
  bibtex: '@inproceedings{Suess_Jähn_Fischer_Meyer auf der Heide_Koch_2011, place={Paderborn},
    title={Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze},
    volume={295}, booktitle={Augmented &#38; Virtual Reality in der Produktentstehung},
    publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, author={Suess,
    Tim and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm
    and Koch, Clemens}, year={2011}, pages={185--197} }'
  chicago: 'Suess, Tim, Claudius Jähn, Matthias Fischer, Friedhelm Meyer auf der Heide,
    and Clemens Koch. “Ein Paralleles Out-of-Core Renderingsystem Für Standard-Rechnernetze.”
    In <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 295:185--197.
    Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2011.'
  ieee: T. Suess, C. Jähn, M. Fischer, F. Meyer auf der Heide, and C. Koch, “Ein paralleles
    Out-of-Core Renderingsystem für Standard-Rechnernetze,” in <i>Augmented &#38;
    Virtual Reality in der Produktentstehung</i>, 2011, vol. 295, pp. 185--197.
  mla: Suess, Tim, et al. “Ein Paralleles Out-of-Core Renderingsystem Für Standard-Rechnernetze.”
    <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, vol. 295, Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, 2011, pp. 185--197.
  short: 'T. Suess, C. Jähn, M. Fischer, F. Meyer auf der Heide, C. Koch, in: Augmented
    &#38; Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz
    Nixdorf Instituts, Paderborn, 2011, pp. 185--197.'
date_created: 2020-07-29T12:19:22Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
- _id: '26'
intvolume: '       295'
language:
- iso: eng
page: 185--197
place: Paderborn
publication: Augmented & Virtual Reality in der Produktentstehung
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze
type: conference
user_id: '15415'
volume: 295
year: '2011'
...
---
_id: '18194'
abstract:
- lang: eng
  text: 'We present a parallel rendering system for PC-Clusters to visualize large
    3D scenes. One single visualization node, equipped with a high-end graphics adapter,
    is supported by a group of backend nodes with weak graphics performance. The objects
    of the scene are distributed among these backend nodes, they serve two purposes:
    First, they provide an out-of-core memory system for the visualization node. Second,
    they assist the visualization node''s rendering by performing visibility calculations
    and only sending visible objects to the visualization node. In order to obtain
    fast rendering with our system, we have to distribute the objects among the backend
    nodes in a way that does not only guarantee an even distribution of the objects,
    but also an even distribution of the visibility calculations and the amount of
    data send to the visualization node. We identify necessary properties of the distribution
    and argue that a random distribution is a good candidate. Further, in order to
    reduce the number of objects sent to the visualization node per frame, we employ
    an approximate hierarchical occlusion culling in each backend node. For this,
    they are equipped, in addition to the objects assigned to them, with simplified
    versions of the other objects of the 3D scene. The visualization node is equipped
    with 512 MiB video memory and supported by 15 backend nodes. This system is able
    to render a approx. 350 million polygons (approx. 8.5 GiB) large aircraft model
    between 20 - 30 fps and thus allows a walkthrough in real-time.'
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. Parallel Out-of-Core
    Occlusion Culling. Published online 2011.
  apa: Suess, T., Koch, C., Jähn, C., Fischer, M., &#38; Meyer auf der Heide, F. (2011).
    <i>Parallel Out-of-Core Occlusion Culling</i>.
  bibtex: '@article{Suess_Koch_Jähn_Fischer_Meyer auf der Heide_2011, title={Parallel
    Out-of-Core Occlusion Culling}, author={Suess, Tim and Koch, Clemens and Jähn,
    Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2011}
    }'
  chicago: Suess, Tim, Clemens Koch, Claudius Jähn, Matthias Fischer, and Friedhelm
    Meyer auf der Heide. “Parallel Out-of-Core Occlusion Culling,” 2011.
  ieee: T. Suess, C. Koch, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Parallel
    Out-of-Core Occlusion Culling.” 2011.
  mla: Suess, Tim, et al. <i>Parallel Out-of-Core Occlusion Culling</i>. 2011.
  short: T. Suess, C. Koch, C. Jähn, M. Fischer, F. Meyer auf der Heide, (2011).
date_created: 2020-08-24T14:14:10Z
date_updated: 2022-01-06T06:53:27Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
  content_type: application/pdf
  creator: koala
  date_created: 2020-08-24T14:13:46Z
  date_updated: 2020-08-24T14:13:46Z
  file_id: '18195'
  file_name: pre-03-2011-5220.pdf
  file_size: 3091853
  relation: main_file
  success: 1
file_date_updated: 2020-08-24T14:13:46Z
has_accepted_license: '1'
language:
- iso: eng
status: public
title: Parallel Out-of-Core Occlusion Culling
type: preprint
user_id: '15415'
year: '2011'
...
---
_id: '664'
abstract:
- lang: eng
  text: 'Web Computing is a variant of parallel computing where the idle times of
    PCs donated by worldwide distributed users are employed to execute parallel programs.
    The PUB-Web library developed by us supports this kind of usage of computing resources.
    A major problem for the efficient execution of such parallel programs is load
    balancing. In the Web Computing context, this problem becomes more difficult because
    of the dynamic behavior of the underlying "parallel computer": the set of available
    processors (donated PCs) as well as their availability (idle times) change over
    time in an unpredictable fashion.In this paper, we experimentally evaluate and
    compare load balancing algorithms in this scenario, namely a variant of the well-established
    Work Stealing algorithm and strategies based on a heterogeneous version of distributed
    hash-tables (DHHTs) introduced recently. In order to run a meaningful experimental
    evaluation, we employ, in addition to our Web Computing library PUB-Web, realistic
    data sets for the job input streams and for the dynamics of the availability of
    the resources.Our experimental evaluations suggest that Work Stealing is the better
    strategy if the number of processes ready to run matches the number of available
    processors. But a suitable variant of DHHTs outperforms Work Stealing if there
    are significantly more processes ready to run than available processors.'
author:
- first_name: Joachim
  full_name: Gehweiler, Joachim
  last_name: Gehweiler
- 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: 'Gehweiler J, Kling P, Meyer auf der Heide F. An Experimental Comparison of
    Load Balancing Strategies in a Web Computing Environment. In: <i>Proceedings of
    the 9th International Conference on Parallel Processing and Applied Mathematics
    (PPAM)</i>. LNCS. ; 2011:31--40. doi:<a href="https://doi.org/10.1007/978-3-642-31500-8_4">10.1007/978-3-642-31500-8_4</a>'
  apa: Gehweiler, J., Kling, P., &#38; Meyer auf der Heide, F. (2011). An Experimental
    Comparison of Load Balancing Strategies in a Web Computing Environment. In <i>Proceedings
    of the 9th International Conference on Parallel Processing and Applied Mathematics
    (PPAM)</i> (pp. 31--40). <a href="https://doi.org/10.1007/978-3-642-31500-8_4">https://doi.org/10.1007/978-3-642-31500-8_4</a>
  bibtex: '@inproceedings{Gehweiler_Kling_Meyer auf der Heide_2011, series={LNCS},
    title={An Experimental Comparison of Load Balancing Strategies in a Web Computing
    Environment}, DOI={<a href="https://doi.org/10.1007/978-3-642-31500-8_4">10.1007/978-3-642-31500-8_4</a>},
    booktitle={Proceedings of the 9th International Conference on Parallel Processing
    and Applied Mathematics (PPAM)}, author={Gehweiler, Joachim and Kling, Peter and
    Meyer auf der Heide, Friedhelm}, year={2011}, pages={31--40}, collection={LNCS}
    }'
  chicago: Gehweiler, Joachim, Peter Kling, and Friedhelm Meyer auf der Heide. “An
    Experimental Comparison of Load Balancing Strategies in a Web Computing Environment.”
    In <i>Proceedings of the 9th International Conference on Parallel Processing and
    Applied Mathematics (PPAM)</i>, 31--40. LNCS, 2011. <a href="https://doi.org/10.1007/978-3-642-31500-8_4">https://doi.org/10.1007/978-3-642-31500-8_4</a>.
  ieee: J. Gehweiler, P. Kling, and F. Meyer auf der Heide, “An Experimental Comparison
    of Load Balancing Strategies in a Web Computing Environment,” in <i>Proceedings
    of the 9th International Conference on Parallel Processing and Applied Mathematics
    (PPAM)</i>, 2011, pp. 31--40.
  mla: Gehweiler, Joachim, et al. “An Experimental Comparison of Load Balancing Strategies
    in a Web Computing Environment.” <i>Proceedings of the 9th International Conference
    on Parallel Processing and Applied Mathematics (PPAM)</i>, 2011, pp. 31--40, doi:<a
    href="https://doi.org/10.1007/978-3-642-31500-8_4">10.1007/978-3-642-31500-8_4</a>.
  short: 'J. Gehweiler, P. Kling, F. Meyer auf der Heide, in: Proceedings of the 9th
    International Conference on Parallel Processing and Applied Mathematics (PPAM),
    2011, pp. 31--40.'
date_created: 2017-10-17T12:43:01Z
date_updated: 2022-01-06T07:03:14Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-642-31500-8_4
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-14T13:45:57Z
  date_updated: 2018-03-14T13:45:57Z
  file_id: '1216'
  file_name: 664-PPAM11GKM_01.pdf
  file_size: 333335
  relation: main_file
  success: 1
file_date_updated: 2018-03-14T13:45:57Z
has_accepted_license: '1'
page: 31--40
project:
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '14'
  name: SFB 901 - Subproject C2
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 9th International Conference on Parallel Processing
  and Applied Mathematics (PPAM)
series_title: LNCS
status: public
title: An Experimental Comparison of Load Balancing Strategies in a Web Computing
  Environment
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '667'
citation:
  ama: Meyer auf der Heide F, Rajaraman R, eds. <i>23rd Annual ACM Symposium on Parallelism
    in Algorithms and Architectures</i>.; 2011. doi:<a href="https://doi.org/10.1145/1989493">10.1145/1989493</a>
  apa: Meyer auf der Heide, F., &#38; Rajaraman, R. (Eds.). (2011). <i>23rd Annual
    ACM Symposium on Parallelism in Algorithms and Architectures</i>. <a href="https://doi.org/10.1145/1989493">https://doi.org/10.1145/1989493</a>
  bibtex: '@book{Meyer auf der Heide_Rajaraman_2011, title={23rd Annual ACM Symposium
    on Parallelism in Algorithms and Architectures}, DOI={<a href="https://doi.org/10.1145/1989493">10.1145/1989493</a>},
    year={2011} }'
  chicago: Meyer auf der Heide, Friedhelm, and Rajmohan  Rajaraman, eds. <i>23rd Annual
    ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2011. <a href="https://doi.org/10.1145/1989493">https://doi.org/10.1145/1989493</a>.
  ieee: F. Meyer auf der Heide and R. Rajaraman, Eds., <i>23rd Annual ACM Symposium
    on Parallelism in Algorithms and Architectures</i>. 2011.
  mla: Meyer auf der Heide, Friedhelm, and Rajmohan Rajaraman, editors. <i>23rd Annual
    ACM Symposium on Parallelism in Algorithms and Architectures</i>. 2011, doi:<a
    href="https://doi.org/10.1145/1989493">10.1145/1989493</a>.
  short: F. Meyer auf der Heide, R. Rajaraman, eds., 23rd Annual ACM Symposium on
    Parallelism in Algorithms and Architectures, 2011.
date_created: 2017-10-17T12:43:02Z
date_updated: 2022-01-06T07:03:14Z
department:
- _id: '63'
doi: 10.1145/1989493
editor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: 'Rajmohan '
  full_name: 'Rajaraman, Rajmohan '
  last_name: Rajaraman
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
status: public
title: 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures
type: conference_editor
user_id: '477'
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: <i>37th International Conference on Current Trends in Theory
    and Practice of Computer Science (SOFSEM 2011)</i>. Springer; 2011:178-189. doi:<a
    href="https://doi.org/10.1007/978-3-642-18381-2_15">10.1007/978-3-642-18381-2_15</a>'
  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
    <i>37th International Conference on Current Trends in Theory and Practice of Computer
    Science (SOFSEM 2011)</i> (pp. 178–189). Springer. <a href="https://doi.org/10.1007/978-3-642-18381-2_15">https://doi.org/10.1007/978-3-642-18381-2_15</a>
  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={<a href="https://doi.org/10.1007/978-3-642-18381-2_15">10.1007/978-3-642-18381-2_15</a>},
    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 <i>37th International Conference on Current Trends
    in Theory and Practice of Computer Science (SOFSEM 2011)</i>, 178–89. Springer,
    2011. <a href="https://doi.org/10.1007/978-3-642-18381-2_15">https://doi.org/10.1007/978-3-642-18381-2_15</a>.
  ieee: A. Cord-Landwehr <i>et al.</i>, “Collisionless Gathering of Robots with an
    Extent,” in <i>37th International Conference on Current Trends in Theory and Practice
    of Computer Science (SOFSEM 2011)</i>, 2011, no. 6543, pp. 178–189.
  mla: Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an Extent.”
    <i>37th International Conference on Current Trends in Theory and Practice of Computer
    Science (SOFSEM 2011)</i>, no. 6543, Springer, 2011, pp. 178–89, doi:<a href="https://doi.org/10.1007/978-3-642-18381-2_15">10.1007/978-3-642-18381-2_15</a>.
  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: '16412'
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
citation:
  ama: 'Gehweiler J, Meyer auf der Heide F. Bin Packing - How Do I Get My Stuff into
    the Boxes. In: <i>Algorithms Unplugged</i>. Berlin, Heidelberg; 2011:367-374.
    doi:<a href="https://doi.org/10.1007/978-3-642-15328-0_38">10.1007/978-3-642-15328-0_38</a>'
  apa: Gehweiler, J., &#38; Meyer auf der Heide, F. (2011). Bin Packing - How Do I
    Get My Stuff into the Boxes. In <i>Algorithms Unplugged</i> (pp. 367–374). Berlin,
    Heidelberg. <a href="https://doi.org/10.1007/978-3-642-15328-0_38">https://doi.org/10.1007/978-3-642-15328-0_38</a>
  bibtex: '@inbook{Gehweiler_Meyer auf der Heide_2011, place={Berlin, Heidelberg},
    title={Bin Packing - How Do I Get My Stuff into the Boxes}, DOI={<a href="https://doi.org/10.1007/978-3-642-15328-0_38">10.1007/978-3-642-15328-0_38</a>},
    booktitle={Algorithms Unplugged}, author={Gehweiler, Joachim and Meyer auf der
    Heide, Friedhelm}, year={2011}, pages={367–374} }'
  chicago: Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing - How
    Do I Get My Stuff into the Boxes.” In <i>Algorithms Unplugged</i>, 367–74. Berlin,
    Heidelberg, 2011. <a href="https://doi.org/10.1007/978-3-642-15328-0_38">https://doi.org/10.1007/978-3-642-15328-0_38</a>.
  ieee: J. Gehweiler and F. Meyer auf der Heide, “Bin Packing - How Do I Get My Stuff
    into the Boxes,” in <i>Algorithms Unplugged</i>, Berlin, Heidelberg, 2011, pp.
    367–374.
  mla: Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing - How Do
    I Get My Stuff into the Boxes.” <i>Algorithms Unplugged</i>, 2011, pp. 367–74,
    doi:<a href="https://doi.org/10.1007/978-3-642-15328-0_38">10.1007/978-3-642-15328-0_38</a>.
  short: 'J. Gehweiler, F. Meyer auf der Heide, in: Algorithms Unplugged, Berlin,
    Heidelberg, 2011, pp. 367–374.'
date_created: 2020-04-06T10:10:39Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-15328-0_38
language:
- iso: eng
page: 367-374
place: Berlin, Heidelberg
publication: Algorithms Unplugged
publication_identifier:
  isbn:
  - '9783642153273'
  - '9783642153280'
publication_status: published
status: public
title: Bin Packing - How Do I Get My Stuff into the Boxes
type: book_chapter
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: '16447'
author:
- first_name: Bastian
  full_name: Degener, Bastian
  last_name: Degener
- first_name: Sándor P.
  full_name: Fekete, Sándor P.
  last_name: Fekete
- 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, Fekete SP, Kempkes B, Meyer auf der Heide F. A survey on relay placement
    with runtime and approximation guarantees. <i>Computer Science Review</i>. 2011:57-68.
    doi:<a href="https://doi.org/10.1016/j.cosrev.2010.09.005">10.1016/j.cosrev.2010.09.005</a>
  apa: Degener, B., Fekete, S. P., Kempkes, B., &#38; Meyer auf der Heide, F. (2011).
    A survey on relay placement with runtime and approximation guarantees. <i>Computer
    Science Review</i>, 57–68. <a href="https://doi.org/10.1016/j.cosrev.2010.09.005">https://doi.org/10.1016/j.cosrev.2010.09.005</a>
  bibtex: '@article{Degener_Fekete_Kempkes_Meyer auf der Heide_2011, title={A survey
    on relay placement with runtime and approximation guarantees}, DOI={<a href="https://doi.org/10.1016/j.cosrev.2010.09.005">10.1016/j.cosrev.2010.09.005</a>},
    journal={Computer Science Review}, author={Degener, Bastian and Fekete, Sándor
    P. and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2011}, pages={57–68}
    }'
  chicago: Degener, Bastian, Sándor P. Fekete, Barbara Kempkes, and Friedhelm Meyer
    auf der Heide. “A Survey on Relay Placement with Runtime and Approximation Guarantees.”
    <i>Computer Science Review</i>, 2011, 57–68. <a href="https://doi.org/10.1016/j.cosrev.2010.09.005">https://doi.org/10.1016/j.cosrev.2010.09.005</a>.
  ieee: B. Degener, S. P. Fekete, B. Kempkes, and F. Meyer auf der Heide, “A survey
    on relay placement with runtime and approximation guarantees,” <i>Computer Science
    Review</i>, pp. 57–68, 2011.
  mla: Degener, Bastian, et al. “A Survey on Relay Placement with Runtime and Approximation
    Guarantees.” <i>Computer Science Review</i>, 2011, pp. 57–68, doi:<a href="https://doi.org/10.1016/j.cosrev.2010.09.005">10.1016/j.cosrev.2010.09.005</a>.
  short: B. Degener, S.P. Fekete, B. Kempkes, F. Meyer auf der Heide, Computer Science
    Review (2011) 57–68.
date_created: 2020-04-07T06:46:06Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1016/j.cosrev.2010.09.005
language:
- iso: eng
page: 57-68
publication: Computer Science Review
publication_identifier:
  issn:
  - 1574-0137
publication_status: published
status: public
title: A survey on relay placement with runtime and approximation guarantees
type: journal_article
user_id: '15415'
year: '2011'
...
---
_id: '16451'
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: <i>SIROCCO ’11: Proc.
    of the 18th International Colloquium on Structural Information and Communication
    Complexity</i>. ; 2011:138-149. doi:<a href="https://doi.org/10.1016/j.tcs.2012.10.056">10.1016/j.tcs.2012.10.056</a>'
  apa: 'Brandes, P., Degener, B., Kempkes, B., &#38; Meyer auf der Heide, F. (2011).
    Energy-efficient strategies for building short chains of mobile robots locally.
    In <i>SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information
    and Communication Complexity</i> (pp. 138–149). <a href="https://doi.org/10.1016/j.tcs.2012.10.056">https://doi.org/10.1016/j.tcs.2012.10.056</a>'
  bibtex: '@inproceedings{Brandes_Degener_Kempkes_Meyer auf der Heide_2011, title={Energy-efficient
    strategies for building short chains of mobile robots locally}, DOI={<a href="https://doi.org/10.1016/j.tcs.2012.10.056">10.1016/j.tcs.2012.10.056</a>},
    booktitle={SIROCCO ’11: Proc. of the 18th International Colloquium on Structural
    Information and Communication Complexity}, author={Brandes, Philipp and Degener,
    Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2011},
    pages={138–149} }'
  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 <i>SIROCCO ’11: Proc. of the 18th International Colloquium
    on Structural Information and Communication Complexity</i>, 138–49, 2011. <a href="https://doi.org/10.1016/j.tcs.2012.10.056">https://doi.org/10.1016/j.tcs.2012.10.056</a>.'
  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 <i>SIROCCO
    ’11: Proc. of the 18th International Colloquium on Structural Information and
    Communication Complexity</i>, 2011, pp. 138–149.'
  mla: 'Brandes, Philipp, et al. “Energy-Efficient Strategies for Building Short Chains
    of Mobile Robots Locally.” <i>SIROCCO ’11: Proc. of the 18th International Colloquium
    on Structural Information and Communication Complexity</i>, 2011, pp. 138–49,
    doi:<a href="https://doi.org/10.1016/j.tcs.2012.10.056">10.1016/j.tcs.2012.10.056</a>.'
  short: 'P. Brandes, B. Degener, B. Kempkes, F. Meyer auf der Heide, in: SIROCCO
    ’11: Proc. of the 18th International Colloquium on Structural Information and
    Communication Complexity, 2011, pp. 138–149.'
date_created: 2020-04-07T12:12:23Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2012.10.056
language:
- iso: eng
page: 138-149
publication: 'SIROCCO ''11: Proc. of the 18th International Colloquium on Structural
  Information and Communication Complexity'
publication_status: published
status: public
title: Energy-efficient strategies for building short chains of mobile robots locally
type: conference
user_id: '15415'
year: '2011'
...