---
_id: '2216'
author:
- first_name: Mariusz
  full_name: Grad, Mariusz
  last_name: Grad
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
citation:
  ama: 'Grad M, Plessl C. Pruning the Design Space for Just-In-Time Processor Customization.
    In: <i>Proc. Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig)</i>.
    IEEE Computer Society; 2010:67-72. doi:<a href="https://doi.org/10.1109/ReConFig.2010.19">10.1109/ReConFig.2010.19</a>'
  apa: Grad, M., &#38; Plessl, C. (2010). Pruning the Design Space for Just-In-Time
    Processor Customization. <i>Proc. Int. Conf. on ReConFigurable Computing and FPGAs
    (ReConFig)</i>, 67–72. <a href="https://doi.org/10.1109/ReConFig.2010.19">https://doi.org/10.1109/ReConFig.2010.19</a>
  bibtex: '@inproceedings{Grad_Plessl_2010, place={Los Alamitos, CA, USA}, title={Pruning
    the Design Space for Just-In-Time Processor Customization}, DOI={<a href="https://doi.org/10.1109/ReConFig.2010.19">10.1109/ReConFig.2010.19</a>},
    booktitle={Proc. Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig)},
    publisher={IEEE Computer Society}, author={Grad, Mariusz and Plessl, Christian},
    year={2010}, pages={67–72} }'
  chicago: 'Grad, Mariusz, and Christian Plessl. “Pruning the Design Space for Just-In-Time
    Processor Customization.” In <i>Proc. Int. Conf. on ReConFigurable Computing and
    FPGAs (ReConFig)</i>, 67–72. Los Alamitos, CA, USA: IEEE Computer Society, 2010.
    <a href="https://doi.org/10.1109/ReConFig.2010.19">https://doi.org/10.1109/ReConFig.2010.19</a>.'
  ieee: 'M. Grad and C. Plessl, “Pruning the Design Space for Just-In-Time Processor
    Customization,” in <i>Proc. Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig)</i>,
    2010, pp. 67–72, doi: <a href="https://doi.org/10.1109/ReConFig.2010.19">10.1109/ReConFig.2010.19</a>.'
  mla: Grad, Mariusz, and Christian Plessl. “Pruning the Design Space for Just-In-Time
    Processor Customization.” <i>Proc. Int. Conf. on ReConFigurable Computing and
    FPGAs (ReConFig)</i>, IEEE Computer Society, 2010, pp. 67–72, doi:<a href="https://doi.org/10.1109/ReConFig.2010.19">10.1109/ReConFig.2010.19</a>.
  short: 'M. Grad, C. Plessl, in: Proc. Int. Conf. on ReConFigurable Computing and
    FPGAs (ReConFig), IEEE Computer Society, Los Alamitos, CA, USA, 2010, pp. 67–72.'
date_created: 2018-04-05T14:48:51Z
date_updated: 2023-09-26T13:47:11Z
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1109/ReConFig.2010.19
language:
- iso: eng
page: 67-72
place: Los Alamitos, CA, USA
publication: Proc. Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig)
publisher: IEEE Computer Society
quality_controlled: '1'
status: public
title: Pruning the Design Space for Just-In-Time Processor Customization
type: conference
user_id: '15278'
year: '2010'
...
---
_id: '2224'
author:
- first_name: Mariusz
  full_name: Grad, Mariusz
  last_name: Grad
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
citation:
  ama: 'Grad M, Plessl C. An Open Source Circuit Library with Benchmarking Facilities.
    In: <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms
    (ERSA)</i>. CSREA Press; 2010:144-150.'
  apa: Grad, M., &#38; Plessl, C. (2010). An Open Source Circuit Library with Benchmarking
    Facilities. <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms
    (ERSA)</i>, 144–150.
  bibtex: '@inproceedings{Grad_Plessl_2010, title={An Open Source Circuit Library
    with Benchmarking Facilities}, booktitle={Proc. Int. Conf. on Engineering of Reconfigurable
    Systems and Algorithms (ERSA)}, publisher={CSREA Press}, author={Grad, Mariusz
    and Plessl, Christian}, year={2010}, pages={144–150} }'
  chicago: Grad, Mariusz, and Christian Plessl. “An Open Source Circuit Library with
    Benchmarking Facilities.” In <i>Proc. Int. Conf. on Engineering of Reconfigurable
    Systems and Algorithms (ERSA)</i>, 144–50. CSREA Press, 2010.
  ieee: M. Grad and C. Plessl, “An Open Source Circuit Library with Benchmarking Facilities,”
    in <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms
    (ERSA)</i>, 2010, pp. 144–150.
  mla: Grad, Mariusz, and Christian Plessl. “An Open Source Circuit Library with Benchmarking
    Facilities.” <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and
    Algorithms (ERSA)</i>, CSREA Press, 2010, pp. 144–50.
  short: 'M. Grad, C. Plessl, in: Proc. Int. Conf. on Engineering of Reconfigurable
    Systems and Algorithms (ERSA), CSREA Press, 2010, pp. 144–150.'
date_created: 2018-04-05T16:28:38Z
date_updated: 2023-09-26T13:48:59Z
department:
- _id: '27'
- _id: '518'
- _id: '78'
language:
- iso: eng
page: 144-150
publication: Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms
  (ERSA)
publication_identifier:
  isbn:
  - 1-60132-140-6
publisher: CSREA Press
quality_controlled: '1'
status: public
title: An Open Source Circuit Library with Benchmarking Facilities
type: conference
user_id: '15278'
year: '2010'
...
---
_id: '2220'
author:
- first_name: David
  full_name: Andrews, David
  last_name: Andrews
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
citation:
  ama: 'Andrews D, Plessl C. Configurable Processor Architectures: History and Trends.
    In: <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms
    (ERSA)</i>. CSREA Press; 2010:165.'
  apa: 'Andrews, D., &#38; Plessl, C. (2010). Configurable Processor Architectures:
    History and Trends. <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems
    and Algorithms (ERSA)</i>, 165.'
  bibtex: '@inproceedings{Andrews_Plessl_2010, title={Configurable Processor Architectures:
    History and Trends}, booktitle={Proc. Int. Conf. on Engineering of Reconfigurable
    Systems and Algorithms (ERSA)}, publisher={CSREA Press}, author={Andrews, David
    and Plessl, Christian}, year={2010}, pages={165} }'
  chicago: 'Andrews, David, and Christian Plessl. “Configurable Processor Architectures:
    History and Trends.” In <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems
    and Algorithms (ERSA)</i>, 165. CSREA Press, 2010.'
  ieee: 'D. Andrews and C. Plessl, “Configurable Processor Architectures: History
    and Trends,” in <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and
    Algorithms (ERSA)</i>, 2010, p. 165.'
  mla: 'Andrews, David, and Christian Plessl. “Configurable Processor Architectures:
    History and Trends.” <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems
    and Algorithms (ERSA)</i>, CSREA Press, 2010, p. 165.'
  short: 'D. Andrews, C. Plessl, in: Proc. Int. Conf. on Engineering of Reconfigurable
    Systems and Algorithms (ERSA), CSREA Press, 2010, p. 165.'
date_created: 2018-04-05T14:57:07Z
date_updated: 2023-09-26T13:47:33Z
department:
- _id: '27'
- _id: '518'
- _id: '78'
language:
- iso: eng
page: '165'
publication: Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms
  (ERSA)
publication_identifier:
  isbn:
  - 1-60132-140-6
publisher: CSREA Press
quality_controlled: '1'
status: public
title: 'Configurable Processor Architectures: History and Trends'
type: conference
user_id: '15278'
year: '2010'
...
---
_id: '2222'
citation:
  ama: Plaks TP, Andrews D, DeMara R, et al., eds. <i>Proc. Int. Conf. on Engineering
    of Reconfigurable Systems and Algorithms (ERSA)</i>. CSREA Press; 2010.
  apa: Plaks, T. P., Andrews, D., DeMara, R., Lam, H., Lee, J., Plessl, C., &#38;
    Stitt, G. (Eds.). (2010). <i>Proc. Int. Conf. on Engineering of Reconfigurable
    Systems and Algorithms (ERSA)</i>. CSREA Press.
  bibtex: '@book{Plaks_Andrews_DeMara_Lam_Lee_Plessl_Stitt_2010, title={Proc. Int.
    Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)}, publisher={CSREA
    Press}, year={2010} }'
  chicago: Plaks, Toomas P., David Andrews, Ronald DeMara, Herman Lam, Jooheung Lee,
    Christian Plessl, and Greg Stitt, eds. <i>Proc. Int. Conf. on Engineering of Reconfigurable
    Systems and Algorithms (ERSA)</i>. CSREA Press, 2010.
  ieee: T. P. Plaks <i>et al.</i>, Eds., <i>Proc. Int. Conf. on Engineering of Reconfigurable
    Systems and Algorithms (ERSA)</i>. CSREA Press, 2010.
  mla: Plaks, Toomas P., et al., editors. <i>Proc. Int. Conf. on Engineering of Reconfigurable
    Systems and Algorithms (ERSA)</i>. CSREA Press, 2010.
  short: T.P. Plaks, D. Andrews, R. DeMara, H. Lam, J. Lee, C. Plessl, G. Stitt, eds.,
    Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA),
    CSREA Press, 2010.
date_created: 2018-04-05T15:00:49Z
date_updated: 2023-09-26T13:48:00Z
department:
- _id: '27'
- _id: '518'
- _id: '78'
editor:
- first_name: Toomas P.
  full_name: Plaks, Toomas P.
  last_name: Plaks
- first_name: David
  full_name: Andrews, David
  last_name: Andrews
- first_name: Ronald
  full_name: DeMara, Ronald
  last_name: DeMara
- first_name: Herman
  full_name: Lam, Herman
  last_name: Lam
- first_name: Jooheung
  full_name: Lee, Jooheung
  last_name: Lee
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
- first_name: Greg
  full_name: Stitt, Greg
  last_name: Stitt
language:
- iso: eng
publication_identifier:
  isbn:
  - 1-60132-140-6
publisher: CSREA Press
quality_controlled: '1'
status: public
title: Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)
type: conference_editor
user_id: '15278'
year: '2010'
...
---
_id: '2226'
author:
- first_name: Tobias
  full_name: Beisel, Tobias
  last_name: Beisel
- first_name: Manuel
  full_name: Niekamp, Manuel
  last_name: Niekamp
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
citation:
  ama: 'Beisel T, Niekamp M, Plessl C. Using Shared Library Interposing for Transparent
    Acceleration in Systems with Heterogeneous Hardware Accelerators. In: <i>Proc.
    Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)</i>.
    IEEE Computer Society; 2010:65-72. doi:<a href="https://doi.org/10.1109/ASAP.2010.5540798">10.1109/ASAP.2010.5540798</a>'
  apa: Beisel, T., Niekamp, M., &#38; Plessl, C. (2010). Using Shared Library Interposing
    for Transparent Acceleration in Systems with Heterogeneous Hardware Accelerators.
    <i>Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors
    (ASAP)</i>, 65–72. <a href="https://doi.org/10.1109/ASAP.2010.5540798">https://doi.org/10.1109/ASAP.2010.5540798</a>
  bibtex: '@inproceedings{Beisel_Niekamp_Plessl_2010, title={Using Shared Library
    Interposing for Transparent Acceleration in Systems with Heterogeneous Hardware
    Accelerators}, DOI={<a href="https://doi.org/10.1109/ASAP.2010.5540798">10.1109/ASAP.2010.5540798</a>},
    booktitle={Proc. Int. Conf. on Application-Specific Systems, Architectures, and
    Processors (ASAP)}, publisher={IEEE Computer Society}, author={Beisel, Tobias
    and Niekamp, Manuel and Plessl, Christian}, year={2010}, pages={65–72} }'
  chicago: Beisel, Tobias, Manuel Niekamp, and Christian Plessl. “Using Shared Library
    Interposing for Transparent Acceleration in Systems with Heterogeneous Hardware
    Accelerators.” In <i>Proc. Int. Conf. on Application-Specific Systems, Architectures,
    and Processors (ASAP)</i>, 65–72. IEEE Computer Society, 2010. <a href="https://doi.org/10.1109/ASAP.2010.5540798">https://doi.org/10.1109/ASAP.2010.5540798</a>.
  ieee: 'T. Beisel, M. Niekamp, and C. Plessl, “Using Shared Library Interposing for
    Transparent Acceleration in Systems with Heterogeneous Hardware Accelerators,”
    in <i>Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors
    (ASAP)</i>, 2010, pp. 65–72, doi: <a href="https://doi.org/10.1109/ASAP.2010.5540798">10.1109/ASAP.2010.5540798</a>.'
  mla: Beisel, Tobias, et al. “Using Shared Library Interposing for Transparent Acceleration
    in Systems with Heterogeneous Hardware Accelerators.” <i>Proc. Int. Conf. on Application-Specific
    Systems, Architectures, and Processors (ASAP)</i>, IEEE Computer Society, 2010,
    pp. 65–72, doi:<a href="https://doi.org/10.1109/ASAP.2010.5540798">10.1109/ASAP.2010.5540798</a>.
  short: 'T. Beisel, M. Niekamp, C. Plessl, in: Proc. Int. Conf. on Application-Specific
    Systems, Architectures, and Processors (ASAP), IEEE Computer Society, 2010, pp.
    65–72.'
date_created: 2018-04-05T16:39:34Z
date_updated: 2023-09-26T13:49:21Z
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1109/ASAP.2010.5540798
language:
- iso: eng
page: 65-72
publication: Proc. Int. Conf. on Application-Specific Systems, Architectures, and
  Processors (ASAP)
publication_identifier:
  isbn:
  - 978-1-4244-6965-9
publisher: IEEE Computer Society
quality_controlled: '1'
status: public
title: Using Shared Library Interposing for Transparent Acceleration in Systems with
  Heterogeneous Hardware Accelerators
type: conference
user_id: '15278'
year: '2010'
...
---
_id: '2206'
author:
- first_name: Ariane
  full_name: Keller, Ariane
  last_name: Keller
- first_name: Bernhard
  full_name: Plattner, Bernhard
  last_name: Plattner
- first_name: Enno
  full_name: Lübbers, Enno
  last_name: Lübbers
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
citation:
  ama: 'Keller A, Plattner B, Lübbers E, Platzner M, Plessl C. Reconfigurable Nodes
    for Future Networks. In: <i>Proc. IEEE Globecom Workshop on Network of the Future
    (FutureNet)</i>. IEEE; 2010:372-376. doi:<a href="https://doi.org/10.1109/GLOCOMW.2010.5700341">10.1109/GLOCOMW.2010.5700341</a>'
  apa: Keller, A., Plattner, B., Lübbers, E., Platzner, M., &#38; Plessl, C. (2010).
    Reconfigurable Nodes for Future Networks. <i>Proc. IEEE Globecom Workshop on Network
    of the Future (FutureNet)</i>, 372–376. <a href="https://doi.org/10.1109/GLOCOMW.2010.5700341">https://doi.org/10.1109/GLOCOMW.2010.5700341</a>
  bibtex: '@inproceedings{Keller_Plattner_Lübbers_Platzner_Plessl_2010, title={Reconfigurable
    Nodes for Future Networks}, DOI={<a href="https://doi.org/10.1109/GLOCOMW.2010.5700341">10.1109/GLOCOMW.2010.5700341</a>},
    booktitle={Proc. IEEE Globecom Workshop on Network of the Future (FutureNet)},
    publisher={IEEE}, author={Keller, Ariane and Plattner, Bernhard and Lübbers, Enno
    and Platzner, Marco and Plessl, Christian}, year={2010}, pages={372–376} }'
  chicago: Keller, Ariane, Bernhard Plattner, Enno Lübbers, Marco Platzner, and Christian
    Plessl. “Reconfigurable Nodes for Future Networks.” In <i>Proc. IEEE Globecom
    Workshop on Network of the Future (FutureNet)</i>, 372–76. IEEE, 2010. <a href="https://doi.org/10.1109/GLOCOMW.2010.5700341">https://doi.org/10.1109/GLOCOMW.2010.5700341</a>.
  ieee: 'A. Keller, B. Plattner, E. Lübbers, M. Platzner, and C. Plessl, “Reconfigurable
    Nodes for Future Networks,” in <i>Proc. IEEE Globecom Workshop on Network of the
    Future (FutureNet)</i>, 2010, pp. 372–376, doi: <a href="https://doi.org/10.1109/GLOCOMW.2010.5700341">10.1109/GLOCOMW.2010.5700341</a>.'
  mla: Keller, Ariane, et al. “Reconfigurable Nodes for Future Networks.” <i>Proc.
    IEEE Globecom Workshop on Network of the Future (FutureNet)</i>, IEEE, 2010, pp.
    372–76, doi:<a href="https://doi.org/10.1109/GLOCOMW.2010.5700341">10.1109/GLOCOMW.2010.5700341</a>.
  short: 'A. Keller, B. Plattner, E. Lübbers, M. Platzner, C. Plessl, in: Proc. IEEE
    Globecom Workshop on Network of the Future (FutureNet), IEEE, 2010, pp. 372–376.'
date_created: 2018-04-04T09:36:16Z
date_updated: 2023-09-26T13:51:00Z
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1109/GLOCOMW.2010.5700341
language:
- iso: eng
page: 372-376
publication: Proc. IEEE Globecom Workshop on Network of the Future (FutureNet)
publication_identifier:
  isbn:
  - 978-1-4244-8864-3
publisher: IEEE
quality_controlled: '1'
status: public
title: Reconfigurable Nodes for Future Networks
type: conference
user_id: '15278'
year: '2010'
...
---
_id: '2227'
author:
- first_name: Matthias
  full_name: Woehrle, Matthias
  last_name: Woehrle
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
- first_name: Lothar
  full_name: Thiele, Lothar
  last_name: Thiele
citation:
  ama: 'Woehrle M, Plessl C, Thiele L. Rupeas: Ruby Powered Event Analysis DSL. In:
    <i>Proc. Int. Conf. Networked Sensing Systems (INSS)</i>. IEEE; 2010:245-248.
    doi:<a href="https://doi.org/10.1109/INSS.2010.5572211">10.1109/INSS.2010.5572211</a>'
  apa: 'Woehrle, M., Plessl, C., &#38; Thiele, L. (2010). Rupeas: Ruby Powered Event
    Analysis DSL. <i>Proc. Int. Conf. Networked Sensing Systems (INSS)</i>, 245–248.
    <a href="https://doi.org/10.1109/INSS.2010.5572211">https://doi.org/10.1109/INSS.2010.5572211</a>'
  bibtex: '@inproceedings{Woehrle_Plessl_Thiele_2010, title={Rupeas: Ruby Powered
    Event Analysis DSL}, DOI={<a href="https://doi.org/10.1109/INSS.2010.5572211">10.1109/INSS.2010.5572211</a>},
    booktitle={Proc. Int. Conf. Networked Sensing Systems (INSS)}, publisher={IEEE},
    author={Woehrle, Matthias and Plessl, Christian and Thiele, Lothar}, year={2010},
    pages={245–248} }'
  chicago: 'Woehrle, Matthias, Christian Plessl, and Lothar Thiele. “Rupeas: Ruby
    Powered Event Analysis DSL.” In <i>Proc. Int. Conf. Networked Sensing Systems
    (INSS)</i>, 245–48. IEEE, 2010. <a href="https://doi.org/10.1109/INSS.2010.5572211">https://doi.org/10.1109/INSS.2010.5572211</a>.'
  ieee: 'M. Woehrle, C. Plessl, and L. Thiele, “Rupeas: Ruby Powered Event Analysis
    DSL,” in <i>Proc. Int. Conf. Networked Sensing Systems (INSS)</i>, 2010, pp. 245–248,
    doi: <a href="https://doi.org/10.1109/INSS.2010.5572211">10.1109/INSS.2010.5572211</a>.'
  mla: 'Woehrle, Matthias, et al. “Rupeas: Ruby Powered Event Analysis DSL.” <i>Proc.
    Int. Conf. Networked Sensing Systems (INSS)</i>, IEEE, 2010, pp. 245–48, doi:<a
    href="https://doi.org/10.1109/INSS.2010.5572211">10.1109/INSS.2010.5572211</a>.'
  short: 'M. Woehrle, C. Plessl, L. Thiele, in: Proc. Int. Conf. Networked Sensing
    Systems (INSS), IEEE, 2010, pp. 245–248.'
date_created: 2018-04-05T16:41:02Z
date_updated: 2023-09-26T13:49:38Z
department:
- _id: '27'
- _id: '518'
doi: 10.1109/INSS.2010.5572211
extern: '1'
language:
- iso: eng
page: 245-248
publication: Proc. Int. Conf. Networked Sensing Systems (INSS)
publication_identifier:
  isbn:
  - 978-1-4244-7911-5
publisher: IEEE
quality_controlled: '1'
status: public
title: 'Rupeas: Ruby Powered Event Analysis DSL'
type: conference
user_id: '15278'
year: '2010'
...
---
_id: '2228'
author:
- first_name: Tobias
  full_name: Kenter, Tobias
  id: '3145'
  last_name: Kenter
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
- first_name: Michael
  full_name: Kauschke, Michael
  last_name: Kauschke
citation:
  ama: 'Kenter T, Platzner M, Plessl C, Kauschke M. Performance Estimation for the
    Exploration of CPU-Accelerator Architectures. In: Hammami O, Larrabee S, eds.
    <i>Proc. Workshop on Architectural Research Prototyping (WARP), International
    Symposium on Computer Architecture (ISCA)</i>. ; 2010.'
  apa: Kenter, T., Platzner, M., Plessl, C., &#38; Kauschke, M. (2010). Performance
    Estimation for the Exploration of CPU-Accelerator Architectures. In O. Hammami
    &#38; S. Larrabee (Eds.), <i>Proc. Workshop on Architectural Research Prototyping
    (WARP), International Symposium on Computer Architecture (ISCA)</i>.
  bibtex: '@inproceedings{Kenter_Platzner_Plessl_Kauschke_2010, title={Performance
    Estimation for the Exploration of CPU-Accelerator Architectures}, booktitle={Proc.
    Workshop on Architectural Research Prototyping (WARP), International Symposium
    on Computer Architecture (ISCA)}, author={Kenter, Tobias and Platzner, Marco and
    Plessl, Christian and Kauschke, Michael}, editor={Hammami, Omar and Larrabee,
    Sandra}, year={2010} }'
  chicago: Kenter, Tobias, Marco Platzner, Christian Plessl, and Michael Kauschke.
    “Performance Estimation for the Exploration of CPU-Accelerator Architectures.”
    In <i>Proc. Workshop on Architectural Research Prototyping (WARP), International
    Symposium on Computer Architecture (ISCA)</i>, edited by Omar Hammami and Sandra
    Larrabee, 2010.
  ieee: T. Kenter, M. Platzner, C. Plessl, and M. Kauschke, “Performance Estimation
    for the Exploration of CPU-Accelerator Architectures,” in <i>Proc. Workshop on
    Architectural Research Prototyping (WARP), International Symposium on Computer
    Architecture (ISCA)</i>, 2010.
  mla: Kenter, Tobias, et al. “Performance Estimation for the Exploration of CPU-Accelerator
    Architectures.” <i>Proc. Workshop on Architectural Research Prototyping (WARP),
    International Symposium on Computer Architecture (ISCA)</i>, edited by Omar Hammami
    and Sandra Larrabee, 2010.
  short: 'T. Kenter, M. Platzner, C. Plessl, M. Kauschke, in: O. Hammami, S. Larrabee
    (Eds.), Proc. Workshop on Architectural Research Prototyping (WARP), International
    Symposium on Computer Architecture (ISCA), 2010.'
date_created: 2018-04-05T16:43:04Z
date_updated: 2023-09-26T13:50:04Z
department:
- _id: '27'
- _id: '518'
- _id: '78'
editor:
- first_name: Omar
  full_name: Hammami, Omar
  last_name: Hammami
- first_name: Sandra
  full_name: Larrabee, Sandra
  last_name: Larrabee
language:
- iso: eng
publication: Proc. Workshop on Architectural Research Prototyping (WARP), International
  Symposium on Computer Architecture (ISCA)
quality_controlled: '1'
status: public
title: Performance Estimation for the Exploration of CPU-Accelerator Architectures
type: conference
user_id: '15278'
year: '2010'
...
---
_id: '60463'
abstract:
- lang: eng
  text: <jats:title>Abstract</jats:title><jats:p>We present a new technique to implement
    operators that modify the topology of polygonal meshes at intersections and self‐intersections.
    Depending on the modification strategy, this effectively results in operators
    for Boolean combinations or for the construction of outer hulls that are suited
    for mesh repair tasks and accurate mesh‐based front tracking of deformable materials
    that split and merge. By combining an adaptive octree with nested binary space
    partitions (BSP), we can guarantee exactness (= correctness) and robustness (=
    completeness) of the algorithm while still achieving higher performance and less
    memory consumption than previous approaches. The efficiency and scalability in
    terms of runtime and memory is obtained by an operation localization scheme. We
    restrict the essential computations to those cells in the adaptive octree where
    intersections actually occur. Within those critical cells, we convert the input
    geometry into a plane‐based BSP‐representation which allows us to perform all
    computations exactly even with fixed precision arithmetics. We carefully analyze
    the precision requirements of the involved geometric data and predicates in order
    to guarantee correctness and show how minimal input mesh quantization can be used
    to safely rely on computations with standard floating point numbers. We properly
    evaluate our method with respect to precision, robustness, and efficiency.</jats:p>
author:
- first_name: Marcel
  full_name: Campen, Marcel
  id: '114904'
  last_name: Campen
  orcid: 0000-0003-2340-3462
- first_name: Leif
  full_name: Kobbelt, Leif
  last_name: Kobbelt
citation:
  ama: Campen M, Kobbelt L. Exact and Robust (Self‐)Intersections for Polygonal Meshes.
    <i>Computer Graphics Forum</i>. 2010;29(2):397-406. doi:<a href="https://doi.org/10.1111/j.1467-8659.2009.01609.x">10.1111/j.1467-8659.2009.01609.x</a>
  apa: Campen, M., &#38; Kobbelt, L. (2010). Exact and Robust (Self‐)Intersections
    for Polygonal Meshes. <i>Computer Graphics Forum</i>, <i>29</i>(2), 397–406. <a
    href="https://doi.org/10.1111/j.1467-8659.2009.01609.x">https://doi.org/10.1111/j.1467-8659.2009.01609.x</a>
  bibtex: '@article{Campen_Kobbelt_2010, title={Exact and Robust (Self‐)Intersections
    for Polygonal Meshes}, volume={29}, DOI={<a href="https://doi.org/10.1111/j.1467-8659.2009.01609.x">10.1111/j.1467-8659.2009.01609.x</a>},
    number={2}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Campen,
    Marcel and Kobbelt, Leif}, year={2010}, pages={397–406} }'
  chicago: 'Campen, Marcel, and Leif Kobbelt. “Exact and Robust (Self‐)Intersections
    for Polygonal Meshes.” <i>Computer Graphics Forum</i> 29, no. 2 (2010): 397–406.
    <a href="https://doi.org/10.1111/j.1467-8659.2009.01609.x">https://doi.org/10.1111/j.1467-8659.2009.01609.x</a>.'
  ieee: 'M. Campen and L. Kobbelt, “Exact and Robust (Self‐)Intersections for Polygonal
    Meshes,” <i>Computer Graphics Forum</i>, vol. 29, no. 2, pp. 397–406, 2010, doi:
    <a href="https://doi.org/10.1111/j.1467-8659.2009.01609.x">10.1111/j.1467-8659.2009.01609.x</a>.'
  mla: Campen, Marcel, and Leif Kobbelt. “Exact and Robust (Self‐)Intersections for
    Polygonal Meshes.” <i>Computer Graphics Forum</i>, vol. 29, no. 2, Wiley, 2010,
    pp. 397–406, doi:<a href="https://doi.org/10.1111/j.1467-8659.2009.01609.x">10.1111/j.1467-8659.2009.01609.x</a>.
  short: M. Campen, L. Kobbelt, Computer Graphics Forum 29 (2010) 397–406.
date_created: 2025-06-30T08:24:08Z
date_updated: 2025-07-14T12:35:44Z
department:
- _id: '969'
doi: 10.1111/j.1467-8659.2009.01609.x
extern: '1'
intvolume: '        29'
issue: '2'
language:
- iso: eng
page: 397-406
publication: Computer Graphics Forum
publication_identifier:
  issn:
  - 0167-7055
  - 1467-8659
publication_status: published
publisher: Wiley
status: public
title: Exact and Robust (Self‐)Intersections for Polygonal Meshes
type: journal_article
user_id: '117512'
volume: 29
year: '2010'
...
---
_id: '60464'
abstract:
- lang: eng
  text: <jats:title>Abstract</jats:title><jats:p>We present a novel technique for
    the efficient boundary evaluation of sweep operations applied to objects in polygonal
    boundary representation. These sweep operations include Minkowski addition, offsetting,
    and sweeping along a discrete rigid motion trajectory. Many previous methods focus
    on the construction of a polygonal superset (containing self‐intersections and
    spurious internal geometry) of the boundary of the volumes which are swept. Only
    few are able to determine a clean representation of the actual boundary, most
    of them in a discrete volumetric setting. We unify such superset constructions
    into a succinct common formulation and present a technique for the robust extraction
    of a polygonal mesh representing the outer boundary, i.e. it makes no general
    position assumptions and always yields a manifold, watertight mesh. It is exact
    for Minkowski sums and approximates swept volumes polygonally. By using plane‐based
    geometry in conjunction with hierarchical arrangement computations we avoid the
    necessity of arbitrary precision arithmetics and extensive special case handling.
    By restricting operations to regions containing pieces of the boundary, we significantly
    enhance the performance of the algorithm.</jats:p>
author:
- first_name: Marcel
  full_name: Campen, Marcel
  id: '114904'
  last_name: Campen
  orcid: 0000-0003-2340-3462
- first_name: Leif
  full_name: Kobbelt, Leif
  last_name: Kobbelt
citation:
  ama: Campen M, Kobbelt L. Polygonal Boundary Evaluation of Minkowski Sums and Swept
    Volumes. <i>Computer Graphics Forum</i>. 2010;29(5):1613-1622. doi:<a href="https://doi.org/10.1111/j.1467-8659.2010.01770.x">10.1111/j.1467-8659.2010.01770.x</a>
  apa: Campen, M., &#38; Kobbelt, L. (2010). Polygonal Boundary Evaluation of Minkowski
    Sums and Swept Volumes. <i>Computer Graphics Forum</i>, <i>29</i>(5), 1613–1622.
    <a href="https://doi.org/10.1111/j.1467-8659.2010.01770.x">https://doi.org/10.1111/j.1467-8659.2010.01770.x</a>
  bibtex: '@article{Campen_Kobbelt_2010, title={Polygonal Boundary Evaluation of Minkowski
    Sums and Swept Volumes}, volume={29}, DOI={<a href="https://doi.org/10.1111/j.1467-8659.2010.01770.x">10.1111/j.1467-8659.2010.01770.x</a>},
    number={5}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Campen,
    Marcel and Kobbelt, Leif}, year={2010}, pages={1613–1622} }'
  chicago: 'Campen, Marcel, and Leif Kobbelt. “Polygonal Boundary Evaluation of Minkowski
    Sums and Swept Volumes.” <i>Computer Graphics Forum</i> 29, no. 5 (2010): 1613–22.
    <a href="https://doi.org/10.1111/j.1467-8659.2010.01770.x">https://doi.org/10.1111/j.1467-8659.2010.01770.x</a>.'
  ieee: 'M. Campen and L. Kobbelt, “Polygonal Boundary Evaluation of Minkowski Sums
    and Swept Volumes,” <i>Computer Graphics Forum</i>, vol. 29, no. 5, pp. 1613–1622,
    2010, doi: <a href="https://doi.org/10.1111/j.1467-8659.2010.01770.x">10.1111/j.1467-8659.2010.01770.x</a>.'
  mla: Campen, Marcel, and Leif Kobbelt. “Polygonal Boundary Evaluation of Minkowski
    Sums and Swept Volumes.” <i>Computer Graphics Forum</i>, vol. 29, no. 5, Wiley,
    2010, pp. 1613–22, doi:<a href="https://doi.org/10.1111/j.1467-8659.2010.01770.x">10.1111/j.1467-8659.2010.01770.x</a>.
  short: M. Campen, L. Kobbelt, Computer Graphics Forum 29 (2010) 1613–1622.
date_created: 2025-06-30T08:34:20Z
date_updated: 2025-07-14T12:35:40Z
department:
- _id: '969'
doi: 10.1111/j.1467-8659.2010.01770.x
extern: '1'
intvolume: '        29'
issue: '5'
language:
- iso: eng
page: 1613-1622
publication: Computer Graphics Forum
publication_identifier:
  issn:
  - 0167-7055
  - 1467-8659
publication_status: published
publisher: Wiley
status: public
title: Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes
type: journal_article
user_id: '117512'
volume: 29
year: '2010'
...
---
_id: '60462'
abstract:
- lang: eng
  text: '<jats:title>Abstract</jats:title><jats:p> <jats:italic>In this paper, we
    present a novel method to compute Boolean operations on polygonal meshes. Given
    a Boolean expression over an arbitrary number of input meshes we reliably and
    efficiently compute an output mesh which faithfully preserves the existing sharp
    features and precisely reconstructs the new features appearing along the intersections
    of the input meshes. The term “hybrid” applies to our method in two ways: First,
    our algorithm operates on a hybrid data structure which stores the original input
    polygons (surface data) in an adaptively refined octree (volume data). By this
    we combine the robustness of volumetric techniques with the accuracy of surface‐oriented
    techniques. Second, we generate a new triangulation only in a close vicinity around
    the intersections of the input meshes and thus preserve as much of the original
    mesh structure as possible (hybrid mesh). Since the actual processing of the Boolean
    operation is confined to a very small region around the intersections of the input
    meshes, we can achieve very high adaptive refinement resolutions and hence very
    high precision. We demonstrate our method on a number of challenging examples.</jats:italic>
    </jats:p>'
author:
- first_name: Darko
  full_name: Pavić, Darko
  last_name: Pavić
- first_name: Marcel
  full_name: Campen, Marcel
  id: '114904'
  last_name: Campen
  orcid: 0000-0003-2340-3462
- first_name: Leif
  full_name: Kobbelt, Leif
  last_name: Kobbelt
citation:
  ama: Pavić D, Campen M, Kobbelt L. Hybrid Booleans. <i>Computer Graphics Forum</i>.
    2010;29(1):75-87. doi:<a href="https://doi.org/10.1111/j.1467-8659.2009.01545.x">10.1111/j.1467-8659.2009.01545.x</a>
  apa: Pavić, D., Campen, M., &#38; Kobbelt, L. (2010). Hybrid Booleans. <i>Computer
    Graphics Forum</i>, <i>29</i>(1), 75–87. <a href="https://doi.org/10.1111/j.1467-8659.2009.01545.x">https://doi.org/10.1111/j.1467-8659.2009.01545.x</a>
  bibtex: '@article{Pavić_Campen_Kobbelt_2010, title={Hybrid Booleans}, volume={29},
    DOI={<a href="https://doi.org/10.1111/j.1467-8659.2009.01545.x">10.1111/j.1467-8659.2009.01545.x</a>},
    number={1}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Pavić,
    Darko and Campen, Marcel and Kobbelt, Leif}, year={2010}, pages={75–87} }'
  chicago: 'Pavić, Darko, Marcel Campen, and Leif Kobbelt. “Hybrid Booleans.” <i>Computer
    Graphics Forum</i> 29, no. 1 (2010): 75–87. <a href="https://doi.org/10.1111/j.1467-8659.2009.01545.x">https://doi.org/10.1111/j.1467-8659.2009.01545.x</a>.'
  ieee: 'D. Pavić, M. Campen, and L. Kobbelt, “Hybrid Booleans,” <i>Computer Graphics
    Forum</i>, vol. 29, no. 1, pp. 75–87, 2010, doi: <a href="https://doi.org/10.1111/j.1467-8659.2009.01545.x">10.1111/j.1467-8659.2009.01545.x</a>.'
  mla: Pavić, Darko, et al. “Hybrid Booleans.” <i>Computer Graphics Forum</i>, vol.
    29, no. 1, Wiley, 2010, pp. 75–87, doi:<a href="https://doi.org/10.1111/j.1467-8659.2009.01545.x">10.1111/j.1467-8659.2009.01545.x</a>.
  short: D. Pavić, M. Campen, L. Kobbelt, Computer Graphics Forum 29 (2010) 75–87.
date_created: 2025-06-30T08:22:33Z
date_updated: 2025-07-14T12:35:48Z
department:
- _id: '969'
doi: 10.1111/j.1467-8659.2009.01545.x
extern: '1'
intvolume: '        29'
issue: '1'
language:
- iso: eng
page: 75-87
publication: Computer Graphics Forum
publication_identifier:
  issn:
  - 0167-7055
  - 1467-8659
publication_status: published
publisher: Wiley
status: public
title: Hybrid Booleans
type: journal_article
user_id: '117512'
volume: 29
year: '2010'
...
---
_id: '19605'
author:
- first_name: Katharina
  full_name: Lürwer-Brüggemeier, Katharina
  last_name: Lürwer-Brüggemeier
citation:
  ama: Lürwer-Brüggemeier K. <i>Mächtigkeit Und Komplexität von Berechnungen Mit Der
    Ganzzahligen Division</i>. Vol 261. Verlagsschriftenreihe des Heinz Nixdorf Instituts,
    Paderborn; 2009.
  apa: Lürwer-Brüggemeier, K. (2009). <i>Mächtigkeit und Komplexität von Berechnungen
    mit der ganzzahligen Division</i> (Vol. 261). Verlagsschriftenreihe des Heinz
    Nixdorf Instituts, Paderborn.
  bibtex: '@book{Lürwer-Brüggemeier_2009, series={Verlagsschriftenreihe des Heinz
    Nixdorf Instituts, Paderborn}, title={Mächtigkeit und Komplexität von Berechnungen
    mit der ganzzahligen Division}, volume={261}, publisher={Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn}, author={Lürwer-Brüggemeier, Katharina},
    year={2009}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}
    }'
  chicago: Lürwer-Brüggemeier, Katharina. <i>Mächtigkeit Und Komplexität von Berechnungen
    Mit Der Ganzzahligen Division</i>. Vol. 261. Verlagsschriftenreihe Des Heinz Nixdorf
    Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
    2009.
  ieee: K. Lürwer-Brüggemeier, <i>Mächtigkeit und Komplexität von Berechnungen mit
    der ganzzahligen Division</i>, vol. 261. Verlagsschriftenreihe des Heinz Nixdorf
    Instituts, Paderborn, 2009.
  mla: Lürwer-Brüggemeier, Katharina. <i>Mächtigkeit Und Komplexität von Berechnungen
    Mit Der Ganzzahligen Division</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts,
    Paderborn, 2009.
  short: K. Lürwer-Brüggemeier, Mächtigkeit Und Komplexität von Berechnungen Mit Der
    Ganzzahligen Division, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
    2009.
date_created: 2020-09-21T14:07:23Z
date_updated: 2022-01-06T06:54:07Z
department:
- _id: '63'
- _id: '26'
intvolume: '       261'
language:
- iso: eng
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
  link:
  - relation: confirmation
    url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20090212010
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division
type: dissertation
user_id: '5786'
volume: 261
year: '2009'
...
---
_id: '19614'
author:
- first_name: Mario
  full_name: Mense, Mario
  last_name: Mense
citation:
  ama: Mense M. <i>On Fault-Tolerant Data Placement in Storage Networks</i>. Vol 260.
    Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2009.
  apa: Mense, M. (2009). <i>On Fault-Tolerant Data Placement in Storage Networks</i>
    (Vol. 260). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
  bibtex: '@book{Mense_2009, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
    Paderborn}, title={On Fault-Tolerant Data Placement in Storage Networks}, volume={260},
    publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Mense,
    Mario}, year={2009}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
    Paderborn} }'
  chicago: Mense, Mario. <i>On Fault-Tolerant Data Placement in Storage Networks</i>.
    Vol. 260. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 2009.
  ieee: M. Mense, <i>On Fault-Tolerant Data Placement in Storage Networks</i>, vol.
    260. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.
  mla: Mense, Mario. <i>On Fault-Tolerant Data Placement in Storage Networks</i>.
    Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.
  short: M. Mense, On Fault-Tolerant Data Placement in Storage Networks, Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 2009.
date_created: 2020-09-22T08:05:15Z
date_updated: 2022-01-06T06:54:08Z
department:
- _id: '63'
- _id: '26'
intvolume: '       260'
language:
- iso: eng
publication_identifier:
  isbn:
  - 978-3-939350-79-8
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
  link:
  - relation: confirmation
    url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20090206016
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: On Fault-Tolerant Data Placement in Storage Networks
type: dissertation
user_id: '5786'
volume: 260
year: '2009'
...
---
_id: '19617'
author:
- first_name: Michael
  full_name: Kortenjan, Michael
  last_name: Kortenjan
citation:
  ama: Kortenjan M. <i>Size Equivalent Cluster Trees - Rendering CAD Models in Industrial
    Scenes</i>. Vol 258. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn;
    2009.
  apa: Kortenjan, M. (2009). <i>Size Equivalent Cluster Trees - Rendering CAD Models
    in Industrial Scenes</i> (Vol. 258). Verlagsschriftenreihe des Heinz Nixdorf Instituts,
    Paderborn.
  bibtex: '@book{Kortenjan_2009, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
    Paderborn}, title={Size Equivalent Cluster Trees - Rendering CAD Models in Industrial
    Scenes}, volume={258}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
    Paderborn}, author={Kortenjan, Michael}, year={2009}, collection={Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn} }'
  chicago: Kortenjan, Michael. <i>Size Equivalent Cluster Trees - Rendering CAD Models
    in Industrial Scenes</i>. Vol. 258. Verlagsschriftenreihe Des Heinz Nixdorf Instituts,
    Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.
  ieee: M. Kortenjan, <i>Size Equivalent Cluster Trees - Rendering CAD Models in Industrial
    Scenes</i>, vol. 258. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
    2009.
  mla: Kortenjan, Michael. <i>Size Equivalent Cluster Trees - Rendering CAD Models
    in Industrial Scenes</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
    2009.
  short: M. Kortenjan, Size Equivalent Cluster Trees - Rendering CAD Models in Industrial
    Scenes, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.
date_created: 2020-09-22T08:42:22Z
date_updated: 2022-01-06T06:54:08Z
department:
- _id: '63'
- _id: '26'
intvolume: '       258'
language:
- iso: eng
publication_identifier:
  isbn:
  - 978-3-939350-77-4
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
  link:
  - relation: confirmation
    url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20081218010
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes
type: dissertation
user_id: '5786'
volume: 258
year: '2009'
...
---
_id: '19618'
author:
- first_name: Olaf
  full_name: Bonorden, Olaf
  last_name: Bonorden
citation:
  ama: 'Bonorden O. <i>Versatility of Bulk Synchronous Parallel Computing: From the
    Heterogeneous Cluster to the System on Chip</i>. Vol 257. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn; 2009.'
  apa: 'Bonorden, O. (2009). <i>Versatility of Bulk Synchronous Parallel Computing:
    From the Heterogeneous Cluster to the System on Chip</i> (Vol. 257). Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn.'
  bibtex: '@book{Bonorden_2009, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
    Paderborn}, title={Versatility of Bulk Synchronous Parallel Computing: From the
    Heterogeneous Cluster to the System on Chip}, volume={257}, publisher={Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn}, author={Bonorden, Olaf}, year={2009},
    collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }'
  chicago: 'Bonorden, Olaf. <i>Versatility of Bulk Synchronous Parallel Computing:
    From the Heterogeneous Cluster to the System on Chip</i>. Vol. 257. Verlagsschriftenreihe
    Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf
    Instituts, Paderborn, 2009.'
  ieee: 'O. Bonorden, <i>Versatility of Bulk Synchronous Parallel Computing: From
    the Heterogeneous Cluster to the System on Chip</i>, vol. 257. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 2009.'
  mla: 'Bonorden, Olaf. <i>Versatility of Bulk Synchronous Parallel Computing: From
    the Heterogeneous Cluster to the System on Chip</i>. Verlagsschriftenreihe des
    Heinz Nixdorf Instituts, Paderborn, 2009.'
  short: 'O. Bonorden, Versatility of Bulk Synchronous Parallel Computing: From the
    Heterogeneous Cluster to the System on Chip, Verlagsschriftenreihe des Heinz Nixdorf
    Instituts, Paderborn, 2009.'
date_created: 2020-09-22T08:44:45Z
date_updated: 2022-01-06T06:54:08Z
department:
- _id: '63'
- _id: '26'
intvolume: '       257'
language:
- iso: eng
publication_identifier:
  isbn:
  - 978-3-939350-76-7
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
  link:
  - relation: confirmation
    url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20080623016
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: 'Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous
  Cluster to the System on Chip'
type: dissertation
user_id: '5786'
volume: 257
year: '2009'
...
---
_id: '19722'
author:
- first_name: Olaf
  full_name: Bonorden, Olaf
  last_name: Bonorden
- first_name: Bastian
  full_name: Degener, Bastian
  last_name: Degener
- first_name: Peter
  full_name: Pietrzyk, Peter
  last_name: Pietrzyk
- first_name: Barbara
  full_name: Kempkes, Barbara
  last_name: Kempkes
citation:
  ama: Bonorden O, Degener B, Pietrzyk P, Kempkes B. <i>Complexity and Approximation
    of a Geometric Local Robot Assignment Problem</i>.; 2009.
  apa: Bonorden, O., Degener, B., Pietrzyk, P., &#38; Kempkes, B. (2009). <i>Complexity
    and approximation of a geometric local robot assignment problem</i>.
  bibtex: '@book{Bonorden_Degener_Pietrzyk_Kempkes_2009, title={Complexity and approximation
    of a geometric local robot assignment problem}, author={Bonorden, Olaf and Degener,
    Bastian and Pietrzyk, Peter and Kempkes, Barbara}, year={2009} }'
  chicago: Bonorden, Olaf, Bastian Degener, Peter Pietrzyk, and Barbara Kempkes. <i>Complexity
    and Approximation of a Geometric Local Robot Assignment Problem</i>, 2009.
  ieee: O. Bonorden, B. Degener, P. Pietrzyk, and B. Kempkes, <i>Complexity and approximation
    of a geometric local robot assignment problem</i>. 2009.
  mla: Bonorden, Olaf, et al. <i>Complexity and Approximation of a Geometric Local
    Robot Assignment Problem</i>. 2009.
  short: O. Bonorden, B. Degener, P. Pietrzyk, B. Kempkes, Complexity and Approximation
    of a Geometric Local Robot Assignment Problem, 2009.
date_created: 2020-09-28T10:19:43Z
date_updated: 2022-01-06T06:54:10Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
  content_type: application/pdf
  creator: koala
  date_created: 2020-09-28T10:19:26Z
  date_updated: 2020-09-28T10:19:26Z
  file_id: '19723'
  file_name: pub-hni-3956.pdf
  file_size: 258114
  relation: main_file
  success: 1
file_date_updated: 2020-09-28T10:19:26Z
has_accepted_license: '1'
language:
- iso: eng
status: public
title: Complexity and approximation of a geometric local robot assignment problem
type: report
user_id: '15415'
year: '2009'
...
---
_id: '19724'
abstract:
- lang: eng
  text: We introduce a geometric multi-robot assignment problem. Robots positioned
    in a Euclidean space have to be assigned to treasures in such a way that their
    joint strength is sufficient to unearth a treasure with a given weight. The robots
    have a limited range and thus can only be assigned to treasures in their proximity.
    The objective is to unearth as many treasures as possible. We investigate the
    complexity of several variants of this problem and show whether they are in $\classP$
    or are $\classNP$-complete. Furthermore, we provide a distributed and local constant-factor
    approximation algorithm using constant-factor resource augmentation for the two-dimensional
    setting with $\bigO(\log^*n)$ communication rounds.
author:
- first_name: Olaf
  full_name: Bonorden, Olaf
  last_name: Bonorden
- first_name: Bastian
  full_name: Degener, Bastian
  last_name: Degener
- first_name: Barbara
  full_name: Kempkes, Barbara
  last_name: Kempkes
- first_name: Peter
  full_name: Pietrzyk, Peter
  last_name: Pietrzyk
citation:
  ama: 'Bonorden O, Degener B, Kempkes B, Pietrzyk P. Complexity and Approximation
    of a Geometric Local Robot Assignment Problem. In: <i>Algorithmic Aspects of Wireless
    Sensor Networks</i>. Berlin, Heidelberg: Springer; 2009:252-262. doi:<a href="https://doi.org/10.1007/978-3-642-05434-1_25">10.1007/978-3-642-05434-1_25</a>'
  apa: 'Bonorden, O., Degener, B., Kempkes, B., &#38; Pietrzyk, P. (2009). Complexity
    and Approximation of a Geometric Local Robot Assignment Problem. In <i>Algorithmic
    Aspects of Wireless Sensor Networks</i> (pp. 252–262). Berlin, Heidelberg: Springer.
    <a href="https://doi.org/10.1007/978-3-642-05434-1_25">https://doi.org/10.1007/978-3-642-05434-1_25</a>'
  bibtex: '@inbook{Bonorden_Degener_Kempkes_Pietrzyk_2009, place={Berlin, Heidelberg},
    title={Complexity and Approximation of a Geometric Local Robot Assignment Problem},
    DOI={<a href="https://doi.org/10.1007/978-3-642-05434-1_25">10.1007/978-3-642-05434-1_25</a>},
    booktitle={Algorithmic Aspects of Wireless Sensor Networks}, publisher={Springer},
    author={Bonorden, Olaf and Degener, Bastian and Kempkes, Barbara and Pietrzyk,
    Peter}, year={2009}, pages={252–262} }'
  chicago: 'Bonorden, Olaf, Bastian Degener, Barbara Kempkes, and Peter Pietrzyk.
    “Complexity and Approximation of a Geometric Local Robot Assignment Problem.”
    In <i>Algorithmic Aspects of Wireless Sensor Networks</i>, 252–62. Berlin, Heidelberg:
    Springer, 2009. <a href="https://doi.org/10.1007/978-3-642-05434-1_25">https://doi.org/10.1007/978-3-642-05434-1_25</a>.'
  ieee: 'O. Bonorden, B. Degener, B. Kempkes, and P. Pietrzyk, “Complexity and Approximation
    of a Geometric Local Robot Assignment Problem,” in <i>Algorithmic Aspects of Wireless
    Sensor Networks</i>, Berlin, Heidelberg: Springer, 2009, pp. 252–262.'
  mla: Bonorden, Olaf, et al. “Complexity and Approximation of a Geometric Local Robot
    Assignment Problem.” <i>Algorithmic Aspects of Wireless Sensor Networks</i>, Springer,
    2009, pp. 252–62, doi:<a href="https://doi.org/10.1007/978-3-642-05434-1_25">10.1007/978-3-642-05434-1_25</a>.
  short: 'O. Bonorden, B. Degener, B. Kempkes, P. Pietrzyk, in: Algorithmic Aspects
    of Wireless Sensor Networks, Springer, Berlin, Heidelberg, 2009, pp. 252–262.'
date_created: 2020-09-28T10:25:34Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: 10.1007/978-3-642-05434-1_25
language:
- iso: eng
page: 252-262
place: Berlin, Heidelberg
publication: Algorithmic Aspects of Wireless Sensor Networks
publication_identifier:
  isbn:
  - '9783642054334'
  - '9783642054341'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer
status: public
title: Complexity and Approximation of a Geometric Local Robot Assignment Problem
type: book_chapter
user_id: '15415'
year: '2009'
...
---
_id: '19825'
abstract:
- lang: eng
  text: Categorizing peer-to-peer networks from an algorithmic point of view the two
    extremes of the spectrum are unstructured networks and networks based on plain
    distributed hash tables (DHT). Unstructured networks stand out with their simplicity,
    robustness, and support for complex queries. Though, they lack efficient query
    algorithms providing guarantees. On the other hand, DHT based networks feature
    efficient lookup algorithms with typically logarithmic hop distance and provide
    simple and efficient load balancing. Yet, they are limited to exact match queries
    and in many cases hard to maintain under churn.
author:
- first_name: Christian
  full_name: Schindelhauer, Christian
  last_name: Schindelhauer
- first_name: Peter
  full_name: Mahlmann, Peter
  last_name: Mahlmann
- first_name: Thomas
  full_name: Janson, Thomas
  last_name: Janson
citation:
  ama: 'Schindelhauer C, Mahlmann P, Janson T. <i>3nuts: A Locality-Aware Peer-to-Peer
    Network Combining Random Networks, Search Trees, and DHTs</i>. Paderborn, Germany;
    2009.'
  apa: 'Schindelhauer, C., Mahlmann, P., &#38; Janson, T. (2009). <i>3nuts: A Locality-Aware
    Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs</i>. Paderborn,
    Germany.'
  bibtex: '@book{Schindelhauer_Mahlmann_Janson_2009, title={3nuts: A Locality-Aware
    Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs}, publisher={Paderborn,
    Germany}, author={Schindelhauer, Christian and Mahlmann, Peter and Janson, Thomas},
    year={2009} }'
  chicago: 'Schindelhauer, Christian, Peter Mahlmann, and Thomas Janson. <i>3nuts:
    A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees,
    and DHTs</i>. Paderborn, Germany, 2009.'
  ieee: 'C. Schindelhauer, P. Mahlmann, and T. Janson, <i>3nuts: A Locality-Aware
    Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs</i>. Paderborn,
    Germany, 2009.'
  mla: 'Schindelhauer, Christian, et al. <i>3nuts: A Locality-Aware Peer-to-Peer Network
    Combining Random Networks, Search Trees, and DHTs</i>. Paderborn, Germany, 2009.'
  short: 'C. Schindelhauer, P. Mahlmann, T. Janson, 3nuts: A Locality-Aware Peer-to-Peer
    Network Combining Random Networks, Search Trees, and DHTs, Paderborn, Germany,
    2009.'
date_created: 2020-10-01T09:47:54Z
date_updated: 2022-01-06T06:54:13Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
  content_type: application/pdf
  creator: koala
  date_created: 2020-10-01T09:47:33Z
  date_updated: 2020-10-01T09:47:33Z
  file_id: '19826'
  file_name: pub-hni-4130.pdf
  file_size: 753215
  relation: main_file
  success: 1
file_date_updated: 2020-10-01T09:47:33Z
has_accepted_license: '1'
language:
- iso: eng
publisher: Paderborn, Germany
status: public
title: '3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search
  Trees, and DHTs'
type: report
user_id: '15415'
year: '2009'
...
---
_id: '19830'
author:
- first_name: Chia Ching
  full_name: Ooi, Chia Ching
  last_name: Ooi
- first_name: Christian
  full_name: Schindelhauer, Christian
  last_name: Schindelhauer
citation:
  ama: Ooi CC, Schindelhauer C. Minimal Energy Path Planning for Wireless Robots.
    <i>Mobile Networks and Applications (MONET)</i>. 2009:309-321. doi:<a href="https://doi.org/10.1007/s11036-008-0150-5">10.1007/s11036-008-0150-5</a>
  apa: Ooi, C. C., &#38; Schindelhauer, C. (2009). Minimal Energy Path Planning for
    Wireless Robots. <i>Mobile Networks and Applications (MONET)</i>, 309–321. <a
    href="https://doi.org/10.1007/s11036-008-0150-5">https://doi.org/10.1007/s11036-008-0150-5</a>
  bibtex: '@article{Ooi_Schindelhauer_2009, title={Minimal Energy Path Planning for
    Wireless Robots}, DOI={<a href="https://doi.org/10.1007/s11036-008-0150-5">10.1007/s11036-008-0150-5</a>},
    journal={Mobile Networks and Applications (MONET)}, author={Ooi, Chia Ching and
    Schindelhauer, Christian}, year={2009}, pages={309–321} }'
  chicago: Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning
    for Wireless Robots.” <i>Mobile Networks and Applications (MONET)</i>, 2009, 309–21.
    <a href="https://doi.org/10.1007/s11036-008-0150-5">https://doi.org/10.1007/s11036-008-0150-5</a>.
  ieee: C. C. Ooi and C. Schindelhauer, “Minimal Energy Path Planning for Wireless
    Robots,” <i>Mobile Networks and Applications (MONET)</i>, pp. 309–321, 2009.
  mla: Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning
    for Wireless Robots.” <i>Mobile Networks and Applications (MONET)</i>, 2009, pp.
    309–21, doi:<a href="https://doi.org/10.1007/s11036-008-0150-5">10.1007/s11036-008-0150-5</a>.
  short: C.C. Ooi, C. Schindelhauer, Mobile Networks and Applications (MONET) (2009)
    309–321.
date_created: 2020-10-01T10:05:47Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/s11036-008-0150-5
language:
- iso: eng
page: 309-321
publication: Mobile Networks and Applications (MONET)
publication_identifier:
  issn:
  - 1383-469X
  - 1572-8153
publication_status: published
status: public
title: Minimal Energy Path Planning for Wireless Robots
type: journal_article
user_id: '15415'
year: '2009'
...
---
_id: '19831'
author:
- first_name: Chia Ching
  full_name: Ooi, Chia Ching
  last_name: Ooi
- first_name: Christian
  full_name: Schindelhauer, Christian
  last_name: Schindelhauer
citation:
  ama: Ooi CC, Schindelhauer C. Utilizing detours for energy conservation in mobile
    wireless networks. <i>Telecommunication Systems</i>. 2009;43:25-37. doi:<a href="https://doi.org/10.1007/s11235-009-9188-3">10.1007/s11235-009-9188-3</a>
  apa: Ooi, C. C., &#38; Schindelhauer, C. (2009). Utilizing detours for energy conservation
    in mobile wireless networks. <i>Telecommunication Systems</i>, <i>43</i>, 25–37.
    <a href="https://doi.org/10.1007/s11235-009-9188-3">https://doi.org/10.1007/s11235-009-9188-3</a>
  bibtex: '@article{Ooi_Schindelhauer_2009, title={Utilizing detours for energy conservation
    in mobile wireless networks}, volume={43}, DOI={<a href="https://doi.org/10.1007/s11235-009-9188-3">10.1007/s11235-009-9188-3</a>},
    journal={Telecommunication Systems}, author={Ooi, Chia Ching and Schindelhauer,
    Christian}, year={2009}, pages={25–37} }'
  chicago: 'Ooi, Chia Ching, and Christian Schindelhauer. “Utilizing Detours for Energy
    Conservation in Mobile Wireless Networks.” <i>Telecommunication Systems</i> 43
    (2009): 25–37. <a href="https://doi.org/10.1007/s11235-009-9188-3">https://doi.org/10.1007/s11235-009-9188-3</a>.'
  ieee: C. C. Ooi and C. Schindelhauer, “Utilizing detours for energy conservation
    in mobile wireless networks,” <i>Telecommunication Systems</i>, vol. 43, pp. 25–37,
    2009.
  mla: Ooi, Chia Ching, and Christian Schindelhauer. “Utilizing Detours for Energy
    Conservation in Mobile Wireless Networks.” <i>Telecommunication Systems</i>, vol.
    43, 2009, pp. 25–37, doi:<a href="https://doi.org/10.1007/s11235-009-9188-3">10.1007/s11235-009-9188-3</a>.
  short: C.C. Ooi, C. Schindelhauer, Telecommunication Systems 43 (2009) 25–37.
date_created: 2020-10-01T10:10:10Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/s11235-009-9188-3
intvolume: '        43'
language:
- iso: eng
page: 25-37
publication: Telecommunication Systems
publication_identifier:
  issn:
  - 1018-4864
  - 1572-9451
publication_status: published
status: public
title: Utilizing detours for energy conservation in mobile wireless networks
type: journal_article
user_id: '15415'
volume: 43
year: '2009'
...