---
_id: '2238'
author:
- first_name: Tobias
  full_name: Schumacher, Tobias
  last_name: Schumacher
- first_name: Tim
  full_name: Süß, Tim
  last_name: Süß
- 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
citation:
  ama: 'Schumacher T, Süß T, Plessl C, Platzner M. Communication Performance Characterization
    for Reconfigurable Accelerator Design on the XD1000. In: <i>Proc. Int. Conf. on
    ReConFigurable Computing and FPGAs (ReConFig)</i>. IEEE Computer Society; 2009:119-124.
    doi:<a href="https://doi.org/10.1109/ReConFig.2009.32">10.1109/ReConFig.2009.32</a>'
  apa: Schumacher, T., Süß, T., Plessl, C., &#38; Platzner, M. (2009). Communication
    Performance Characterization for Reconfigurable Accelerator Design on the XD1000.
    <i>Proc. Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig)</i>, 119–124.
    <a href="https://doi.org/10.1109/ReConFig.2009.32">https://doi.org/10.1109/ReConFig.2009.32</a>
  bibtex: '@inproceedings{Schumacher_Süß_Plessl_Platzner_2009, place={Los Alamitos,
    CA, USA}, title={Communication Performance Characterization for Reconfigurable
    Accelerator Design on the XD1000}, DOI={<a href="https://doi.org/10.1109/ReConFig.2009.32">10.1109/ReConFig.2009.32</a>},
    booktitle={Proc. Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig)},
    publisher={IEEE Computer Society}, author={Schumacher, Tobias and Süß, Tim and
    Plessl, Christian and Platzner, Marco}, year={2009}, pages={119–124} }'
  chicago: 'Schumacher, Tobias, Tim Süß, Christian Plessl, and Marco Platzner. “Communication
    Performance Characterization for Reconfigurable Accelerator Design on the XD1000.”
    In <i>Proc. Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig)</i>, 119–24.
    Los Alamitos, CA, USA: IEEE Computer Society, 2009. <a href="https://doi.org/10.1109/ReConFig.2009.32">https://doi.org/10.1109/ReConFig.2009.32</a>.'
  ieee: 'T. Schumacher, T. Süß, C. Plessl, and M. Platzner, “Communication Performance
    Characterization for Reconfigurable Accelerator Design on the XD1000,” in <i>Proc.
    Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig)</i>, 2009, pp. 119–124,
    doi: <a href="https://doi.org/10.1109/ReConFig.2009.32">10.1109/ReConFig.2009.32</a>.'
  mla: Schumacher, Tobias, et al. “Communication Performance Characterization for
    Reconfigurable Accelerator Design on the XD1000.” <i>Proc. Int. Conf. on ReConFigurable
    Computing and FPGAs (ReConFig)</i>, IEEE Computer Society, 2009, pp. 119–24, doi:<a
    href="https://doi.org/10.1109/ReConFig.2009.32">10.1109/ReConFig.2009.32</a>.
  short: 'T. Schumacher, T. Süß, C. Plessl, M. Platzner, in: Proc. Int. Conf. on ReConFigurable
    Computing and FPGAs (ReConFig), IEEE Computer Society, Los Alamitos, CA, USA,
    2009, pp. 119–124.'
date_created: 2018-04-05T17:11:28Z
date_updated: 2023-09-26T13:52:32Z
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1109/ReConFig.2009.32
keyword:
- IMORC
- graphics
language:
- iso: eng
page: 119-124
place: Los Alamitos, CA, USA
publication: Proc. Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig)
publication_identifier:
  isbn:
  - 978-0-7695-3917-1
publisher: IEEE Computer Society
quality_controlled: '1'
status: public
title: Communication Performance Characterization for Reconfigurable Accelerator Design
  on the XD1000
type: conference
user_id: '15278'
year: '2009'
...
---
_id: '2261'
author:
- first_name: Tobias
  full_name: Schumacher, Tobias
  last_name: Schumacher
- 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
citation:
  ama: 'Schumacher T, Plessl C, Platzner M. An Accelerator for k-th Nearest Neighbor
    Thinning Based on the IMORC Infrastructure. In: <i>Proc. Int. Conf. on Field Programmable
    Logic and Applications (FPL)</i>. IEEE; 2009:338-344.'
  apa: Schumacher, T., Plessl, C., &#38; Platzner, M. (2009). An Accelerator for k-th
    Nearest Neighbor Thinning Based on the IMORC Infrastructure. <i>Proc. Int. Conf.
    on Field Programmable Logic and Applications (FPL)</i>, 338–344.
  bibtex: '@inproceedings{Schumacher_Plessl_Platzner_2009, title={An Accelerator for
    k-th Nearest Neighbor Thinning Based on the IMORC Infrastructure}, booktitle={Proc.
    Int. Conf. on Field Programmable Logic and Applications (FPL)}, publisher={IEEE},
    author={Schumacher, Tobias and Plessl, Christian and Platzner, Marco}, year={2009},
    pages={338–344} }'
  chicago: Schumacher, Tobias, Christian Plessl, and Marco Platzner. “An Accelerator
    for K-Th Nearest Neighbor Thinning Based on the IMORC Infrastructure.” In <i>Proc.
    Int. Conf. on Field Programmable Logic and Applications (FPL)</i>, 338–44. IEEE,
    2009.
  ieee: T. Schumacher, C. Plessl, and M. Platzner, “An Accelerator for k-th Nearest
    Neighbor Thinning Based on the IMORC Infrastructure,” in <i>Proc. Int. Conf. on
    Field Programmable Logic and Applications (FPL)</i>, 2009, pp. 338–344.
  mla: Schumacher, Tobias, et al. “An Accelerator for K-Th Nearest Neighbor Thinning
    Based on the IMORC Infrastructure.” <i>Proc. Int. Conf. on Field Programmable
    Logic and Applications (FPL)</i>, IEEE, 2009, pp. 338–44.
  short: 'T. Schumacher, C. Plessl, M. Platzner, in: Proc. Int. Conf. on Field Programmable
    Logic and Applications (FPL), IEEE, 2009, pp. 338–344.'
date_created: 2018-04-06T15:15:47Z
date_updated: 2023-09-26T13:52:52Z
department:
- _id: '27'
- _id: '518'
- _id: '78'
keyword:
- IMORC
- NOC
- KNN
- accelerator
language:
- iso: eng
page: 338-344
publication: Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)
publication_identifier:
  isbn:
  - 978-1-4244-3892-1
  issn:
  - 1946-1488
publisher: IEEE
quality_controlled: '1'
status: public
title: An Accelerator for k-th Nearest Neighbor Thinning Based on the IMORC Infrastructure
type: conference
user_id: '15278'
year: '2009'
...
---
_id: '2263'
abstract:
- lang: eng
  text: 'In this paper, we introduce the Woolcano reconfigurable processor architecture.
    The architecture is based on the Xilinx Virtex-4 FX FPGA and leverages the Auxiliary
    Processing Unit (APU) as well as the partial reconfiguration capabilities to provide
    dynamically reconfigurable custom instructions. We also present a hardware tool
    flow that automatically translates software functions into custom instructions
    and a software tool flow that creates binaries using these instructions. While
    previous research on processors with reconfigurable functional units has been
    performed predominantly with simulation, the Woolcano architecture allows for
    exploring dynamic instruction set extension with commercially available hardware.
    Finally, we present a case study demonstrating a custom floating-point instruction
    generated with our approach, which achieves a 40x speedup over software-emulated
    floating-point operations and a 21% speedup over the Xilinx hardware floating-point
    unit. '
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. Woolcano: An Architecture and Tool Flow for Dynamic Instruction
    Set Extension on Xilinx Virtex-4 FX. In: <i>Proc. Int. Conf. on Engineering of
    Reconfigurable Systems and Algorithms (ERSA)</i>. CSREA Press; 2009:319-322.'
  apa: 'Grad, M., &#38; Plessl, C. (2009). Woolcano: An Architecture and Tool Flow
    for Dynamic Instruction Set Extension on Xilinx Virtex-4 FX. <i>Proc. Int. Conf.
    on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>, 319–322.'
  bibtex: '@inproceedings{Grad_Plessl_2009, place={USA}, title={Woolcano: An Architecture
    and Tool Flow for Dynamic Instruction Set Extension on Xilinx Virtex-4 FX}, booktitle={Proc.
    Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)}, publisher={CSREA
    Press}, author={Grad, Mariusz and Plessl, Christian}, year={2009}, pages={319–322}
    }'
  chicago: 'Grad, Mariusz, and Christian Plessl. “Woolcano: An Architecture and Tool
    Flow for Dynamic Instruction Set Extension on Xilinx Virtex-4 FX.” In <i>Proc.
    Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>,
    319–22. USA: CSREA Press, 2009.'
  ieee: 'M. Grad and C. Plessl, “Woolcano: An Architecture and Tool Flow for Dynamic
    Instruction Set Extension on Xilinx Virtex-4 FX,” in <i>Proc. Int. Conf. on Engineering
    of Reconfigurable Systems and Algorithms (ERSA)</i>, 2009, pp. 319–322.'
  mla: 'Grad, Mariusz, and Christian Plessl. “Woolcano: An Architecture and Tool Flow
    for Dynamic Instruction Set Extension on Xilinx Virtex-4 FX.” <i>Proc. Int. Conf.
    on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>, CSREA Press,
    2009, pp. 319–22.'
  short: 'M. Grad, C. Plessl, in: Proc. Int. Conf. on Engineering of Reconfigurable
    Systems and Algorithms (ERSA), CSREA Press, USA, 2009, pp. 319–322.'
date_created: 2018-04-06T15:19:51Z
date_updated: 2023-09-26T13:53:30Z
department:
- _id: '27'
- _id: '518'
- _id: '78'
language:
- iso: eng
page: 319-322
place: USA
publication: Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms
  (ERSA)
publication_identifier:
  isbn:
  - 1-60132-101-5
publisher: CSREA Press
quality_controlled: '1'
status: public
title: 'Woolcano: An Architecture and Tool Flow for Dynamic Instruction Set Extension
  on Xilinx Virtex-4 FX'
type: conference
user_id: '15278'
year: '2009'
...
---
_id: '60468'
author:
- first_name: Marcel
  full_name: Campen, Marcel
  id: '114904'
  last_name: Campen
  orcid: 0000-0003-2340-3462
citation:
  ama: 'Campen M. A Framework for Geometry Processing based on Hybrid Surface Representations.
    In: Porada L, ed. <i>Informatiktage 2009 - Fachwissenschaftlicher Informatik-Kongress
    27. Und 28. März 2009, B-IT Bonn-Aachen International Center for Information Technology
    in Bonn</i>. Vol S-8. LNI. GI; 2009:219–222.'
  apa: 'Campen, M. (2009). A Framework for Geometry Processing based on Hybrid Surface
    Representations. In L. Porada (Ed.), <i>Informatiktage 2009 - Fachwissenschaftlicher
    Informatik-Kongress 27. und 28. März 2009, B-IT Bonn-Aachen International Center
    for Information Technology in Bonn: Vol. S-8</i> (pp. 219–222). GI.'
  bibtex: '@inproceedings{Campen_2009, series={LNI}, title={A Framework for Geometry
    Processing based on Hybrid Surface Representations}, volume={S-8}, booktitle={Informatiktage
    2009 - Fachwissenschaftlicher Informatik-Kongress 27. und 28. März 2009, B-IT
    Bonn-Aachen International Center for Information Technology in Bonn}, publisher={GI},
    author={Campen, Marcel}, editor={Porada, Ludger}, year={2009}, pages={219–222},
    collection={LNI} }'
  chicago: Campen, Marcel. “A Framework for Geometry Processing Based on Hybrid Surface
    Representations.” In <i>Informatiktage 2009 - Fachwissenschaftlicher Informatik-Kongress
    27. Und 28. März 2009, B-IT Bonn-Aachen International Center for Information Technology
    in Bonn</i>, edited by Ludger Porada, S-8:219–222. LNI. GI, 2009.
  ieee: M. Campen, “A Framework for Geometry Processing based on Hybrid Surface Representations,”
    in <i>Informatiktage 2009 - Fachwissenschaftlicher Informatik-Kongress 27. und
    28. März 2009, B-IT Bonn-Aachen International Center for Information Technology
    in Bonn</i>, 2009, vol. S-8, pp. 219–222.
  mla: Campen, Marcel. “A Framework for Geometry Processing Based on Hybrid Surface
    Representations.” <i>Informatiktage 2009 - Fachwissenschaftlicher Informatik-Kongress
    27. Und 28. März 2009, B-IT Bonn-Aachen International Center for Information Technology
    in Bonn</i>, edited by Ludger Porada, vol. S-8, GI, 2009, pp. 219–222.
  short: 'M. Campen, in: L. Porada (Ed.), Informatiktage 2009 - Fachwissenschaftlicher
    Informatik-Kongress 27. Und 28. März 2009, B-IT Bonn-Aachen International Center
    for Information Technology in Bonn, GI, 2009, pp. 219–222.'
date_created: 2025-06-30T09:01:44Z
date_updated: 2025-07-14T12:35:02Z
department:
- _id: '969'
editor:
- first_name: Ludger
  full_name: Porada, Ludger
  last_name: Porada
extern: '1'
language:
- iso: eng
page: 219–222
publication: Informatiktage 2009 - Fachwissenschaftlicher Informatik-Kongress 27.
  und 28. März 2009, B-IT Bonn-Aachen International Center for Information Technology
  in Bonn
publisher: GI
series_title: LNI
status: public
title: A Framework for Geometry Processing based on Hybrid Surface Representations
type: conference
user_id: '114904'
volume: S-8
year: '2009'
...
---
_id: '60467'
author:
- first_name: Marcel
  full_name: Campen, Marcel
  id: '114904'
  last_name: Campen
  orcid: 0000-0003-2340-3462
citation:
  ama: Campen M. Ein Framework für Geometrieverarbeitung basierend auf hybriden Oberflächendarstellungen.
    <i>Informatik-Spektrum</i>. 2009;33(1):66-69. doi:<a href="https://doi.org/10.1007/s00287-009-0371-4">10.1007/s00287-009-0371-4</a>
  apa: Campen, M. (2009). Ein Framework für Geometrieverarbeitung basierend auf hybriden
    Oberflächendarstellungen. <i>Informatik-Spektrum</i>, <i>33</i>(1), 66–69. <a
    href="https://doi.org/10.1007/s00287-009-0371-4">https://doi.org/10.1007/s00287-009-0371-4</a>
  bibtex: '@article{Campen_2009, title={Ein Framework für Geometrieverarbeitung basierend
    auf hybriden Oberflächendarstellungen}, volume={33}, DOI={<a href="https://doi.org/10.1007/s00287-009-0371-4">10.1007/s00287-009-0371-4</a>},
    number={1}, journal={Informatik-Spektrum}, publisher={Springer Science and Business
    Media LLC}, author={Campen, Marcel}, year={2009}, pages={66–69} }'
  chicago: 'Campen, Marcel. “Ein Framework für Geometrieverarbeitung basierend auf
    hybriden Oberflächendarstellungen.” <i>Informatik-Spektrum</i> 33, no. 1 (2009):
    66–69. <a href="https://doi.org/10.1007/s00287-009-0371-4">https://doi.org/10.1007/s00287-009-0371-4</a>.'
  ieee: 'M. Campen, “Ein Framework für Geometrieverarbeitung basierend auf hybriden
    Oberflächendarstellungen,” <i>Informatik-Spektrum</i>, vol. 33, no. 1, pp. 66–69,
    2009, doi: <a href="https://doi.org/10.1007/s00287-009-0371-4">10.1007/s00287-009-0371-4</a>.'
  mla: Campen, Marcel. “Ein Framework für Geometrieverarbeitung basierend auf hybriden
    Oberflächendarstellungen.” <i>Informatik-Spektrum</i>, vol. 33, no. 1, Springer
    Science and Business Media LLC, 2009, pp. 66–69, doi:<a href="https://doi.org/10.1007/s00287-009-0371-4">10.1007/s00287-009-0371-4</a>.
  short: M. Campen, Informatik-Spektrum 33 (2009) 66–69.
date_created: 2025-06-30T08:59:02Z
date_updated: 2025-07-14T12:35:26Z
department:
- _id: '969'
doi: 10.1007/s00287-009-0371-4
extern: '1'
intvolume: '        33'
issue: '1'
language:
- iso: ger
page: 66-69
publication: Informatik-Spektrum
publication_identifier:
  issn:
  - 0170-6012
  - 1432-122X
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Ein Framework für Geometrieverarbeitung basierend auf hybriden Oberflächendarstellungen
type: journal_article
user_id: '117512'
volume: 33
year: '2009'
...
---
_id: '2513'
author:
- first_name: Thorsten
  full_name: Biermann, Thorsten
  last_name: Biermann
- first_name: Christian
  full_name: Dannewitz, Christian
  last_name: Dannewitz
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: Biermann T, Dannewitz C, Karl H. <i>Extended Results on an Adaptive Resource/Performance
    Trade-Off for Resolving Complex Queries in P2P Networks</i>.; 2008.
  apa: Biermann, T., Dannewitz, C., &#38; Karl, H. (2008). <i>Extended Results on
    an Adaptive Resource/Performance Trade-Off for Resolving Complex Queries in P2P
    Networks</i>.
  bibtex: '@book{Biermann_Dannewitz_Karl_2008, title={Extended Results on an Adaptive
    Resource/Performance Trade-Off for Resolving Complex Queries in P2P Networks},
    author={Biermann, Thorsten and Dannewitz, Christian and Karl, Holger}, year={2008}
    }'
  chicago: Biermann, Thorsten, Christian Dannewitz, and Holger Karl. <i>Extended Results
    on an Adaptive Resource/Performance Trade-Off for Resolving Complex Queries in
    P2P Networks</i>, 2008.
  ieee: T. Biermann, C. Dannewitz, and H. Karl, <i>Extended Results on an Adaptive
    Resource/Performance Trade-Off for Resolving Complex Queries in P2P Networks</i>.
    2008.
  mla: Biermann, Thorsten, et al. <i>Extended Results on an Adaptive Resource/Performance
    Trade-Off for Resolving Complex Queries in P2P Networks</i>. 2008.
  short: T. Biermann, C. Dannewitz, H. Karl, Extended Results on an Adaptive Resource/Performance
    Trade-Off for Resolving Complex Queries in P2P Networks, 2008.
date_created: 2018-04-26T10:46:08Z
date_updated: 2022-01-06T06:56:53Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: closed
  content_type: application/pdf
  creator: tabu
  date_created: 2018-04-26T10:45:25Z
  date_updated: 2018-04-26T10:45:25Z
  file_id: '2514'
  file_name: Optimizing.pdf
  file_size: 230623
  relation: main_file
  success: 1
file_date_updated: 2018-04-26T10:45:25Z
has_accepted_license: '1'
status: public
title: Extended Results on an Adaptive Resource/Performance Trade-Off for Resolving
  Complex Queries in P2P Networks
type: report
user_id: '15572'
year: '2008'
...
---
_id: '19615'
author:
- first_name: Gunnar
  full_name: Schomaker, Gunnar
  last_name: Schomaker
citation:
  ama: Schomaker G. <i>Distributed Resource Allocation and Management in Heterogeneous
    Networks</i>. Vol 259. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn;
    2008.
  apa: Schomaker, G. (2008). <i>Distributed Resource Allocation and Management in
    Heterogeneous Networks</i> (Vol. 259). Verlagsschriftenreihe des Heinz Nixdorf
    Instituts, Paderborn.
  bibtex: '@book{Schomaker_2008, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
    Paderborn}, title={Distributed Resource Allocation and Management in Heterogeneous
    Networks}, volume={259}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
    Paderborn}, author={Schomaker, Gunnar}, year={2008}, collection={Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn} }'
  chicago: Schomaker, Gunnar. <i>Distributed Resource Allocation and Management in
    Heterogeneous Networks</i>. Vol. 259. Verlagsschriftenreihe Des Heinz Nixdorf
    Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
    2008.
  ieee: G. Schomaker, <i>Distributed Resource Allocation and Management in Heterogeneous
    Networks</i>, vol. 259. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
    2008.
  mla: Schomaker, Gunnar. <i>Distributed Resource Allocation and Management in Heterogeneous
    Networks</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.
  short: G. Schomaker, Distributed Resource Allocation and Management in Heterogeneous
    Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.
date_created: 2020-09-22T08:10:41Z
date_updated: 2022-01-06T06:54:08Z
department:
- _id: '63'
- _id: '26'
intvolume: '       259'
language:
- iso: eng
publication_identifier:
  isbn:
  - 978-3-939350-78-1
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-20090114013
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: Distributed Resource Allocation and Management in Heterogeneous Networks
type: dissertation
user_id: '5786'
volume: 259
year: '2008'
...
---
_id: '19686'
author:
- first_name: Patrick
  full_name: Briest, Patrick
  last_name: Briest
citation:
  ama: 'Briest P. Uniform Budgets and the Envy-Free Pricing Problem. In: <i>Proceedings
    of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)</i>.
    ; 2008. doi:<a href="https://doi.org/10.1007/978-3-540-70575-8_66">10.1007/978-3-540-70575-8_66</a>'
  apa: Briest, P. (2008). Uniform Budgets and the Envy-Free Pricing Problem. In <i>Proceedings
    of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)</i>.
    <a href="https://doi.org/10.1007/978-3-540-70575-8_66">https://doi.org/10.1007/978-3-540-70575-8_66</a>
  bibtex: '@inproceedings{Briest_2008, title={Uniform Budgets and the Envy-Free Pricing
    Problem}, DOI={<a href="https://doi.org/10.1007/978-3-540-70575-8_66">10.1007/978-3-540-70575-8_66</a>},
    booktitle={Proceedings of the 35th InternationalColloquium on Automata, Languages
    and Programming (ICALP)}, author={Briest, Patrick}, year={2008} }'
  chicago: Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.” In
    <i>Proceedings of the 35th InternationalColloquium on Automata, Languages and
    Programming (ICALP)</i>, 2008. <a href="https://doi.org/10.1007/978-3-540-70575-8_66">https://doi.org/10.1007/978-3-540-70575-8_66</a>.
  ieee: P. Briest, “Uniform Budgets and the Envy-Free Pricing Problem,” in <i>Proceedings
    of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)</i>,
    2008.
  mla: Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.” <i>Proceedings
    of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)</i>,
    2008, doi:<a href="https://doi.org/10.1007/978-3-540-70575-8_66">10.1007/978-3-540-70575-8_66</a>.
  short: 'P. Briest, in: Proceedings of the 35th InternationalColloquium on Automata,
    Languages and Programming (ICALP), 2008.'
date_created: 2020-09-25T09:45:40Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: 10.1007/978-3-540-70575-8_66
language:
- iso: eng
publication: Proceedings of the 35th InternationalColloquium on Automata, Languages
  and Programming (ICALP)
publication_identifier:
  isbn:
  - '9783540705741'
  - '9783540705758'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Uniform Budgets and the Envy-Free Pricing Problem
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19687'
author:
- first_name: Patrick
  full_name: Briest, Patrick
  last_name: Briest
- first_name: Piotr
  full_name: Krysta, Piotr
  last_name: Krysta
- first_name: Moshe
  full_name: Babaioff, Moshe
  last_name: Babaioff
citation:
  ama: 'Briest P, Krysta P, Babaioff M. On the Approximability of Combinatorial Exchange
    Problems. In: <i>Proceedings of the 1st International Symposium on Algorithmic
    Game Theory (SAGT)</i>. Cham; 2008. doi:<a href="https://doi.org/10.1007/978-3-540-79309-0_9">https://doi.org/10.1007/978-3-540-79309-0_9</a>'
  apa: Briest, P., Krysta, P., &#38; Babaioff, M. (2008). On the Approximability of
    Combinatorial Exchange Problems. In <i>Proceedings of the 1st International Symposium
    on Algorithmic Game Theory (SAGT)</i>. Cham. <a href="https://doi.org/10.1007/978-3-540-79309-0_9">https://doi.org/10.1007/978-3-540-79309-0_9</a>
  bibtex: '@inproceedings{Briest_Krysta_Babaioff_2008, place={Cham}, title={On the
    Approximability of Combinatorial Exchange Problems}, DOI={<a href="https://doi.org/10.1007/978-3-540-79309-0_9">https://doi.org/10.1007/978-3-540-79309-0_9</a>},
    booktitle={Proceedings of the 1st International Symposium on Algorithmic Game
    Theory (SAGT)}, author={Briest, Patrick and Krysta, Piotr and Babaioff, Moshe},
    year={2008} }'
  chicago: Briest, Patrick, Piotr Krysta, and Moshe Babaioff. “On the Approximability
    of Combinatorial Exchange Problems.” In <i>Proceedings of the 1st International
    Symposium on Algorithmic Game Theory (SAGT)</i>. Cham, 2008. <a href="https://doi.org/10.1007/978-3-540-79309-0_9">https://doi.org/10.1007/978-3-540-79309-0_9</a>.
  ieee: P. Briest, P. Krysta, and M. Babaioff, “On the Approximability of Combinatorial
    Exchange Problems,” in <i>Proceedings of the 1st International Symposium on Algorithmic
    Game Theory (SAGT)</i>, 2008.
  mla: Briest, Patrick, et al. “On the Approximability of Combinatorial Exchange Problems.”
    <i>Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT)</i>,
    2008, doi:<a href="https://doi.org/10.1007/978-3-540-79309-0_9">https://doi.org/10.1007/978-3-540-79309-0_9</a>.
  short: 'P. Briest, P. Krysta, M. Babaioff, in: Proceedings of the 1st International
    Symposium on Algorithmic Game Theory (SAGT), Cham, 2008.'
date_created: 2020-09-25T09:49:43Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: https://doi.org/10.1007/978-3-540-79309-0_9
language:
- iso: eng
place: Cham
publication: Proceedings of the 1st International Symposium on Algorithmic Game Theory
  (SAGT)
publication_status: published
status: public
title: On the Approximability of Combinatorial Exchange Problems
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19688'
abstract:
- lang: eng
  text: "We study the problem of computing approximate Nash equilibria (epsilon-Nash\r\nequilibria)
    in normal form games, where the number of players is a small\r\nconstant. We consider
    the approach of looking for solutions with constant\r\nsupport size. It is known
    from recent work that in the 2-player case, a\r\n1/2-Nash equilibrium can be easily
    found, but in general one cannot achieve a\r\nsmaller value of epsilon than 1/2.
    In this paper we extend those results to the\r\nk-player case, and find that epsilon
    = 1-1/k is feasible, but cannot be\r\nimproved upon. We show how stronger results
    for the 2-player case may be used\r\nin order to slightly improve upon the epsilon
    = 1-1/k obtained in the k-player\r\ncase."
author:
- first_name: Patrick
  full_name: Briest, Patrick
  last_name: Briest
- first_name: Paul W.
  full_name: Goldberg, Paul W.
  last_name: Goldberg
- first_name: Heiko
  full_name: Roeglin, Heiko
  last_name: Roeglin
citation:
  ama: Briest P, Goldberg PW, Roeglin H. <i>Approximate Equilibria in Games with Few
    Players</i>.; 2008.
  apa: Briest, P., Goldberg, P. W., &#38; Roeglin, H. (2008). <i>Approximate Equilibria
    in Games with Few Players</i>.
  bibtex: '@book{Briest_Goldberg_Roeglin_2008, title={Approximate Equilibria in Games
    with Few Players}, author={Briest, Patrick and Goldberg, Paul W. and Roeglin,
    Heiko}, year={2008} }'
  chicago: Briest, Patrick, Paul W. Goldberg, and Heiko Roeglin. <i>Approximate Equilibria
    in Games with Few Players</i>, 2008.
  ieee: P. Briest, P. W. Goldberg, and H. Roeglin, <i>Approximate Equilibria in Games
    with Few Players</i>. 2008.
  mla: Briest, Patrick, et al. <i>Approximate Equilibria in Games with Few Players</i>.
    2008.
  short: P. Briest, P.W. Goldberg, H. Roeglin, Approximate Equilibria in Games with
    Few Players, 2008.
date_created: 2020-09-25T09:52:57Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
external_id:
  arxiv:
  - '0804.4524 '
language:
- iso: eng
status: public
title: Approximate Equilibria in Games with Few Players
type: report
user_id: '15415'
year: '2008'
...
---
_id: '19812'
abstract:
- lang: eng
  text: 'Modern peer-to-peer networks consist of several network layers and distributed
    algorithms providing features like indexing, resource balancing, entry protocols,
    security, anonymity, and cryptography. Since peer-to-peer networks are highly
    dynamic, a fundamental task in the design of these networks is to provide high
    connectivity. We propose a solution by distributed random link exchange algorithms
    such that the overlay network can be a connected random graph or use a random
    graph as backbone. Random graphs are expander graphs have logarithmic diameter,
    high node connectivity, excellent communication properties, and are expander graphs
    with high probability. In summary: they are an excellent choice to improve the
    stability and robustness of a dynamic network.'
author:
- first_name: Christian
  full_name: Schindelhauer, Christian
  last_name: Schindelhauer
- first_name: Peter
  full_name: Mahlmann, Peter
  last_name: Mahlmann
citation:
  ama: 'Schindelhauer C, Mahlmann P. Random Graphs for Peer-to-Peer Overlays. In:
    <i>The European Integrated Project "Dynamically Evolving, Large Scale Information
    Systems (DELIS), Proceedings of the Final Workshop</i>. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn; 2008:1-22.'
  apa: Schindelhauer, C., &#38; Mahlmann, P. (2008). Random Graphs for Peer-to-Peer
    Overlays. <i>The European Integrated Project "Dynamically Evolving, Large Scale
    Information Systems (DELIS), Proceedings of the Final Workshop</i>, <i>222</i>,
    1–22.
  bibtex: '@inproceedings{Schindelhauer_Mahlmann_2008, title={Random Graphs for Peer-to-Peer
    Overlays}, number={222}, booktitle={The European Integrated Project "Dynamically
    Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop},
    publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Schindelhauer,
    Christian and Mahlmann, Peter}, year={2008}, pages={1–22} }'
  chicago: Schindelhauer, Christian, and Peter Mahlmann. “Random Graphs for Peer-to-Peer
    Overlays.” In <i>The European Integrated Project "Dynamically Evolving, Large
    Scale Information Systems (DELIS), Proceedings of the Final Workshop</i>, 1–22.
    Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.
  ieee: C. Schindelhauer and P. Mahlmann, “Random Graphs for Peer-to-Peer Overlays,”
    in <i>The European Integrated Project "Dynamically Evolving, Large Scale Information
    Systems (DELIS), Proceedings of the Final Workshop</i>, 2008, no. 222, pp. 1–22.
  mla: Schindelhauer, Christian, and Peter Mahlmann. “Random Graphs for Peer-to-Peer
    Overlays.” <i>The European Integrated Project "Dynamically Evolving, Large Scale
    Information Systems (DELIS), Proceedings of the Final Workshop</i>, no. 222, Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 2008, pp. 1–22.
  short: 'C. Schindelhauer, P. Mahlmann, in: The European Integrated Project "Dynamically
    Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop,
    Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008, pp. 1–22.'
date_created: 2020-09-30T13:24:15Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
- _id: '26'
issue: '222'
language:
- iso: eng
page: 1-22
publication: The European Integrated Project "Dynamically Evolving, Large Scale Information
  Systems (DELIS), Proceedings of the Final Workshop
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Random Graphs for Peer-to-Peer Overlays
type: conference
user_id: '5786'
year: '2008'
...
---
_id: '19813'
abstract:
- lang: eng
  text: 'Autonomous robotic systems have been gaining the attention of research community
    in mobile ad hoc network since the past few years. While motion cost and communications
    cost constitute the primary energy consumers, each of them is investigated independently.
    By taking into account the power consumption of both entities, the overall energy
    efficiency of a system can be further improved. In this paper, the energy optimization
    problem of radio communication and motion is examined. We consider a hybrid wireless  network
    that consists of a single autonomous mobile node and multiple relay nodes. The
    mobile node interacts with the relays within its vicinity by continuously communicating
    high-bandwidth data, e.g. triggered by a multimedia application like video surveillance.
    The goal is to find the best path such that the energy consumption for both mobility
    and communications is minimized. We introduce the Radio-Energy-Aware (REA) path
    computation strategy by utilizing node mobility. Given the starting point, the
    target point and the position of the relays, our simulation results show that
    the proposed strategy improves the energy efficiency of mobile node compared to
    the Motion-Energy-Aware (MEA) path constructed based only on the mobility cost. '
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. Detours Save Energy in Mobile Wireless Networks.
    In: <i>MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications
    Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008)</i>. Springer;
    2008. doi:<a href="https://doi.org/10.1007/978-0-387-84839-6_6">10.1007/978-0-387-84839-6_6</a>'
  apa: 'Ooi, C. C., &#38; Schindelhauer, C. (2008). Detours Save Energy in Mobile
    Wireless Networks. In <i>MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless
    Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC
    2008)</i>. Springer. <a href="https://doi.org/10.1007/978-0-387-84839-6_6">https://doi.org/10.1007/978-0-387-84839-6_6</a>'
  bibtex: '@inproceedings{Ooi_Schindelhauer_2008, title={Detours Save Energy in Mobile
    Wireless Networks}, DOI={<a href="https://doi.org/10.1007/978-0-387-84839-6_6">10.1007/978-0-387-84839-6_6</a>},
    booktitle={MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications
    Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008)}, publisher={Springer},
    author={Ooi, Chia Ching and Schindelhauer, Christian}, year={2008} }'
  chicago: 'Ooi, Chia Ching, and Christian Schindelhauer. “Detours Save Energy in
    Mobile Wireless Networks.” In <i>MWCN’08: Proc. of IFIP Joint Conference on Mobile
    Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications
    (PWC 2008)</i>. Springer, 2008. <a href="https://doi.org/10.1007/978-0-387-84839-6_6">https://doi.org/10.1007/978-0-387-84839-6_6</a>.'
  ieee: 'C. C. Ooi and C. Schindelhauer, “Detours Save Energy in Mobile Wireless Networks,”
    in <i>MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications
    Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008)</i>, 2008.'
  mla: 'Ooi, Chia Ching, and Christian Schindelhauer. “Detours Save Energy in Mobile
    Wireless Networks.” <i>MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless
    Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC
    2008)</i>, Springer, 2008, doi:<a href="https://doi.org/10.1007/978-0-387-84839-6_6">10.1007/978-0-387-84839-6_6</a>.'
  short: 'C.C. Ooi, C. Schindelhauer, in: MWCN’08: Proc. of IFIP Joint Conference
    on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications
    (PWC 2008), Springer, 2008.'
date_created: 2020-09-30T13:27:54Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/978-0-387-84839-6_6
language:
- iso: eng
publication: 'MWCN''08: Proc. of IFIP Joint Conference on Mobile Wireless Communications
  Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008)'
publication_identifier:
  isbn:
  - '9780387848389'
  - '9780387848396'
  issn:
  - 1571-5736
publication_status: published
publisher: Springer
status: public
title: Detours Save Energy in Mobile Wireless Networks
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19832'
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. Energy-Efficient Distributed Target Tracking Using
    Wireless Relay Robots. In: <i>ARS’08: Proc. of the 9th International Symposium
    on Distributed Autonomous Robotic Systems (DARS 2008)</i>. ; 2008. doi:<a href="https://doi.org/10.1007/978-3-642-00644-9_4">10.1007/978-3-642-00644-9_4</a>'
  apa: 'Ooi, C. C., &#38; Schindelhauer, C. (2008). Energy-Efficient Distributed Target
    Tracking Using Wireless Relay Robots. In <i>ARS’08: Proc. of the 9th International
    Symposium on Distributed Autonomous Robotic Systems (DARS 2008)</i>. <a href="https://doi.org/10.1007/978-3-642-00644-9_4">https://doi.org/10.1007/978-3-642-00644-9_4</a>'
  bibtex: '@inproceedings{Ooi_Schindelhauer_2008, title={Energy-Efficient Distributed
    Target Tracking Using Wireless Relay Robots}, DOI={<a href="https://doi.org/10.1007/978-3-642-00644-9_4">10.1007/978-3-642-00644-9_4</a>},
    booktitle={ARS’08: Proc. of the 9th International Symposium on Distributed Autonomous
    Robotic Systems (DARS 2008)}, author={Ooi, Chia Ching and Schindelhauer, Christian},
    year={2008} }'
  chicago: 'Ooi, Chia Ching, and Christian Schindelhauer. “Energy-Efficient Distributed
    Target Tracking Using Wireless Relay Robots.” In <i>ARS’08: Proc. of the 9th International
    Symposium on Distributed Autonomous Robotic Systems (DARS 2008)</i>, 2008. <a
    href="https://doi.org/10.1007/978-3-642-00644-9_4">https://doi.org/10.1007/978-3-642-00644-9_4</a>.'
  ieee: 'C. C. Ooi and C. Schindelhauer, “Energy-Efficient Distributed Target Tracking
    Using Wireless Relay Robots,” in <i>ARS’08: Proc. of the 9th International Symposium
    on Distributed Autonomous Robotic Systems (DARS 2008)</i>, 2008.'
  mla: 'Ooi, Chia Ching, and Christian Schindelhauer. “Energy-Efficient Distributed
    Target Tracking Using Wireless Relay Robots.” <i>ARS’08: Proc. of the 9th International
    Symposium on Distributed Autonomous Robotic Systems (DARS 2008)</i>, 2008, doi:<a
    href="https://doi.org/10.1007/978-3-642-00644-9_4">10.1007/978-3-642-00644-9_4</a>.'
  short: 'C.C. Ooi, C. Schindelhauer, in: ARS’08: Proc. of the 9th International Symposium
    on Distributed Autonomous Robotic Systems (DARS 2008), 2008.'
date_created: 2020-10-01T10:14:06Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/978-3-642-00644-9_4
language:
- iso: eng
publication: 'ARS''08: Proc. of the 9th International Symposium on Distributed Autonomous
  Robotic Systems (DARS 2008)'
publication_identifier:
  isbn:
  - '9783642006432'
  - '9783642006449'
publication_status: published
status: public
title: Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19950'
author:
- first_name: Peter
  full_name: Pietrzyk, Peter
  last_name: Pietrzyk
citation:
  ama: Pietrzyk P. <i>Lokale Strategien Zur Optimierung von Kommunikationsketten</i>.;
    2008.
  apa: Pietrzyk, P. (2008). <i>Lokale Strategien zur Optimierung von Kommunikationsketten</i>.
  bibtex: '@book{Pietrzyk_2008, title={Lokale Strategien zur Optimierung von Kommunikationsketten},
    author={Pietrzyk, Peter}, year={2008} }'
  chicago: Pietrzyk, Peter. <i>Lokale Strategien Zur Optimierung von Kommunikationsketten</i>,
    2008.
  ieee: P. Pietrzyk, <i>Lokale Strategien zur Optimierung von Kommunikationsketten</i>.
    2008.
  mla: Pietrzyk, Peter. <i>Lokale Strategien Zur Optimierung von Kommunikationsketten</i>.
    2008.
  short: P. Pietrzyk, Lokale Strategien Zur Optimierung von Kommunikationsketten,
    2008.
date_created: 2020-10-07T14:23:26Z
date_updated: 2022-01-06T06:54:16Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
  content_type: application/pdf
  creator: koala
  date_created: 2020-10-07T14:22:49Z
  date_updated: 2020-10-07T14:22:49Z
  file_id: '19951'
  file_name: pub-hni-3364.pdf
  file_size: 638802
  relation: main_file
  success: 1
file_date_updated: 2020-10-07T14:22:49Z
has_accepted_license: '1'
language:
- iso: eng
status: public
title: Lokale Strategien zur Optimierung von Kommunikationsketten
type: mastersthesis
user_id: '15415'
year: '2008'
...
---
_id: '20262'
author:
- first_name: Heiko
  full_name: Hamann, Heiko
  last_name: Hamann
citation:
  ama: Hamann H. <i>Space-Time Continuous Models of Swarm Robotic Systems</i>.; 2008.
    doi:<a href="https://doi.org/10.1007/978-3-642-13377-0">10.1007/978-3-642-13377-0</a>
  apa: Hamann, H. (2008). <i>Space-Time Continuous Models of Swarm Robotic Systems</i>.
    <a href="https://doi.org/10.1007/978-3-642-13377-0">https://doi.org/10.1007/978-3-642-13377-0</a>
  bibtex: '@book{Hamann_2008, title={Space-Time Continuous Models of Swarm Robotic
    Systems}, DOI={<a href="https://doi.org/10.1007/978-3-642-13377-0">10.1007/978-3-642-13377-0</a>},
    author={Hamann, Heiko}, year={2008} }'
  chicago: Hamann, Heiko. <i>Space-Time Continuous Models of Swarm Robotic Systems</i>,
    2008. <a href="https://doi.org/10.1007/978-3-642-13377-0">https://doi.org/10.1007/978-3-642-13377-0</a>.
  ieee: H. Hamann, <i>Space-Time Continuous Models of Swarm Robotic Systems</i>. 2008.
  mla: Hamann, Heiko. <i>Space-Time Continuous Models of Swarm Robotic Systems</i>.
    2008, doi:<a href="https://doi.org/10.1007/978-3-642-13377-0">10.1007/978-3-642-13377-0</a>.
  short: H. Hamann, Space-Time Continuous Models of Swarm Robotic Systems, 2008.
date_created: 2020-11-02T14:23:36Z
date_updated: 2022-01-06T06:54:25Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-642-13377-0
language:
- iso: eng
publication_identifier:
  isbn:
  - '9783642133763'
  - '9783642133770'
  issn:
  - 1867-4925
  - 1867-4933
publication_status: published
status: public
title: Space-Time Continuous Models of Swarm Robotic Systems
type: dissertation
user_id: '15415'
year: '2008'
...
---
_id: '26235'
abstract:
- lang: eng
  text: "Kolmogorov Complexity constitutes an integral part of computability theory,\r\ninformation
    theory, and computational complexity theory -- in the discrete\r\nsetting of bits
    and Turing machines. Over real numbers, on the other hand, the\r\nBSS-machine
    (aka real-RAM) has been established as a major model of\r\ncomputation. This real
    realm has turned out to exhibit natural counterparts to\r\nmany notions and results
    in classical complexity and recursion theory; although\r\nusually with considerably
    different proofs. The present work investigates\r\nsimilarities and differences
    between discrete and real Kolmogorov Complexity as\r\nintroduced by Montana and
    Pardo (1998)."
author:
- first_name: Martin
  full_name: Ziegler, Martin
  last_name: Ziegler
- first_name: Wouter M.
  full_name: Koolen, Wouter M.
  last_name: Koolen
citation:
  ama: Ziegler M, Koolen WM. Kolmogorov Complexity Theory over the Reals. <i>arXiv:08022027</i>.
    Published online 2008.
  apa: Ziegler, M., &#38; Koolen, W. M. (2008). Kolmogorov Complexity Theory over
    the Reals. In <i>arXiv:0802.2027</i>.
  bibtex: '@article{Ziegler_Koolen_2008, title={Kolmogorov Complexity Theory over
    the Reals}, journal={arXiv:0802.2027}, author={Ziegler, Martin and Koolen, Wouter
    M.}, year={2008} }'
  chicago: Ziegler, Martin, and Wouter M. Koolen. “Kolmogorov Complexity Theory over
    the Reals.” <i>ArXiv:0802.2027</i>, 2008.
  ieee: M. Ziegler and W. M. Koolen, “Kolmogorov Complexity Theory over the Reals,”
    <i>arXiv:0802.2027</i>. 2008.
  mla: Ziegler, Martin, and Wouter M. Koolen. “Kolmogorov Complexity Theory over the
    Reals.” <i>ArXiv:0802.2027</i>, 2008.
  short: M. Ziegler, W.M. Koolen, ArXiv:0802.2027 (2008).
date_created: 2021-10-15T09:34:19Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '63'
language:
- iso: eng
publication: arXiv:0802.2027
status: public
title: Kolmogorov Complexity Theory over the Reals
type: preprint
user_id: '15415'
year: '2008'
...
---
_id: '26243'
abstract:
- lang: eng
  text: "Operations on univariate dense polynomials—multiplication, division with
    remainder, multipoint\r\nevaluation—constitute central primitives entering as
    build-up blocks into many higher applications and\r\nalgorithms. Fast Fourier
    Transform permits to accelerate them from naive quadratic to running time\r\nO(n·polylogn),
    that is softly linear in the degree n of the input. This is routinely employed
    in complexity\r\ntheoretic considerations and, over integers and finite fields,
    in practical number theoretic calculations.\r\nThe present work explores the benefit
    of fast polynomial arithmetic over the field of real numbers\r\nwhere the precision
    of approximation becomes crucial. To this end, we study the computability of the\r\nabove
    operations in the sense of Recursive Analysis as an effective refinement of continuity.
    This theo-\r\nretical worst-case stability analysis is then complemented by an
    empirical evaluation: We use GMP and\r\nthe iRRAM to find the precision required
    for the intermediate calculations in order to achieve a desired\r\noutput accuracy."
author:
- first_name: Sven
  full_name: Köhler, Sven
  last_name: Köhler
- first_name: Martin
  full_name: Ziegler, Martin
  last_name: Ziegler
citation:
  ama: 'Köhler S, Ziegler M. On the Stability of Fast Polynomial Arithmetic. In: <i>Proc.
    8th Conference on Real Numbers and Computers</i>. ; 2008:147-156.'
  apa: Köhler, S., &#38; Ziegler, M. (2008). On the Stability of Fast Polynomial Arithmetic.
    <i>Proc. 8th Conference on Real Numbers and Computers</i>, 147–156.
  bibtex: '@inproceedings{Köhler_Ziegler_2008, title={On the Stability of Fast Polynomial
    Arithmetic}, booktitle={Proc. 8th Conference on Real Numbers and Computers}, author={Köhler,
    Sven and Ziegler, Martin}, year={2008}, pages={147–156} }'
  chicago: Köhler, Sven, and Martin Ziegler. “On the Stability of Fast Polynomial
    Arithmetic.” In <i>Proc. 8th Conference on Real Numbers and Computers</i>, 147–56,
    2008.
  ieee: S. Köhler and M. Ziegler, “On the Stability of Fast Polynomial Arithmetic,”
    in <i>Proc. 8th Conference on Real Numbers and Computers</i>, 2008, pp. 147–156.
  mla: Köhler, Sven, and Martin Ziegler. “On the Stability of Fast Polynomial Arithmetic.”
    <i>Proc. 8th Conference on Real Numbers and Computers</i>, 2008, pp. 147–56.
  short: 'S. Köhler, M. Ziegler, in: Proc. 8th Conference on Real Numbers and Computers,
    2008, pp. 147–156.'
date_created: 2021-10-15T09:57:36Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '63'
language:
- iso: eng
page: 147-156
publication: Proc. 8th Conference on Real Numbers and Computers
status: public
title: On the Stability of Fast Polynomial Arithmetic
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '26255'
abstract:
- lang: eng
  text: "We turn the physical Church-Turing Hypothesis from an ambiguous source of
    sensational\r\nspeculations into a (collection of) sound and well-defined scientific
    problem(s):\r\nExamining recent controversies and causes for misunderstanding
    concerning the state of the Church-\r\nTuring Hypothesis (CTH), it is suggested
    to study the CTH ‘sharpened’ relative to an arbitrary but\r\nspecific physical
    theory—rather than vaguely referring to “nature” in general. For this purpose
    we\r\ncombine physical structuralism with computational complexity theory. The
    benefits of this approach\r\nare illustrated by some exemplary results on computability
    and complexity in computational physics."
author:
- first_name: Martin
  full_name: Ziegler, Martin
  last_name: Ziegler
citation:
  ama: Ziegler M. Physically-Relativized Church-Turing Hypotheses. <i>Applied Mathematics
    and Computation</i>. Published online 2008.
  apa: Ziegler, M. (2008). Physically-Relativized Church-Turing Hypotheses. <i>Applied
    Mathematics and Computation</i>.
  bibtex: '@article{Ziegler_2008, title={Physically-Relativized Church-Turing Hypotheses},
    journal={Applied Mathematics and Computation}, author={Ziegler, Martin}, year={2008}
    }'
  chicago: Ziegler, Martin. “Physically-Relativized Church-Turing Hypotheses.” <i>Applied
    Mathematics and Computation</i>, 2008.
  ieee: M. Ziegler, “Physically-Relativized Church-Turing Hypotheses,” <i>Applied
    Mathematics and Computation</i>, 2008.
  mla: Ziegler, Martin. “Physically-Relativized Church-Turing Hypotheses.” <i>Applied
    Mathematics and Computation</i>, 2008.
  short: M. Ziegler, Applied Mathematics and Computation (2008).
date_created: 2021-10-15T10:10:04Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '63'
- _id: '26'
external_id:
  arxiv:
  - '0805.1292'
language:
- iso: eng
publication: Applied Mathematics and Computation
status: public
title: Physically-Relativized Church-Turing Hypotheses
type: journal_article
user_id: '15415'
year: '2008'
...
---
_id: '26262'
author:
- first_name: Martin
  full_name: Ziegler, Martin
  last_name: Ziegler
citation:
  ama: 'Ziegler M. A Meta-Theory of Physics and Computation. In: <i>Verhandlungen
    Der Deutschen Physikalischen Gesellschaft</i>. Deutsche Physikalische Gesellschaft
    (DPG); 2008:145.'
  apa: Ziegler, M. (2008). A Meta-Theory of Physics and Computation. In <i>Verhandlungen
    der Deutschen Physikalischen Gesellschaft</i> (p. 145). Deutsche Physikalische
    Gesellschaft (DPG).
  bibtex: '@inbook{Ziegler_2008, title={A Meta-Theory of Physics and Computation},
    booktitle={Verhandlungen der Deutschen Physikalischen Gesellschaft}, publisher={Deutsche
    Physikalische Gesellschaft (DPG)}, author={Ziegler, Martin}, year={2008}, pages={145}
    }'
  chicago: Ziegler, Martin. “A Meta-Theory of Physics and Computation.” In <i>Verhandlungen
    Der Deutschen Physikalischen Gesellschaft</i>, 145. Deutsche Physikalische Gesellschaft
    (DPG), 2008.
  ieee: M. Ziegler, “A Meta-Theory of Physics and Computation,” in <i>Verhandlungen
    der Deutschen Physikalischen Gesellschaft</i>, Deutsche Physikalische Gesellschaft
    (DPG), 2008, p. 145.
  mla: Ziegler, Martin. “A Meta-Theory of Physics and Computation.” <i>Verhandlungen
    Der Deutschen Physikalischen Gesellschaft</i>, Deutsche Physikalische Gesellschaft
    (DPG), 2008, p. 145.
  short: 'M. Ziegler, in: Verhandlungen Der Deutschen Physikalischen Gesellschaft,
    Deutsche Physikalische Gesellschaft (DPG), 2008, p. 145.'
date_created: 2021-10-15T10:35:55Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '63'
- _id: '26'
language:
- iso: eng
page: '145'
publication: Verhandlungen der Deutschen Physikalischen Gesellschaft
publisher: Deutsche Physikalische Gesellschaft (DPG)
status: public
title: A Meta-Theory of Physics and Computation
type: book_chapter
user_id: '15415'
year: '2008'
...
---
_id: '26280'
author:
- first_name: Klaus
  full_name: Meer, Klaus
  last_name: Meer
- first_name: Martin
  full_name: Ziegler, Martin
  last_name: Ziegler
citation:
  ama: Meer K, Ziegler M. An explicit solution to Post’s Problem over the reals. <i>Journal
    of Complexity</i>. Published online 2008:3-15. doi:<a href="https://doi.org/10.1016/j.jco.2006.09.004">10.1016/j.jco.2006.09.004</a>
  apa: Meer, K., &#38; Ziegler, M. (2008). An explicit solution to Post’s Problem
    over the reals. <i>Journal of Complexity</i>, 3–15. <a href="https://doi.org/10.1016/j.jco.2006.09.004">https://doi.org/10.1016/j.jco.2006.09.004</a>
  bibtex: '@article{Meer_Ziegler_2008, title={An explicit solution to Post’s Problem
    over the reals}, DOI={<a href="https://doi.org/10.1016/j.jco.2006.09.004">10.1016/j.jco.2006.09.004</a>},
    journal={Journal of Complexity}, author={Meer, Klaus and Ziegler, Martin}, year={2008},
    pages={3–15} }'
  chicago: Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem
    over the Reals.” <i>Journal of Complexity</i>, 2008, 3–15. <a href="https://doi.org/10.1016/j.jco.2006.09.004">https://doi.org/10.1016/j.jco.2006.09.004</a>.
  ieee: 'K. Meer and M. Ziegler, “An explicit solution to Post’s Problem over the
    reals,” <i>Journal of Complexity</i>, pp. 3–15, 2008, doi: <a href="https://doi.org/10.1016/j.jco.2006.09.004">10.1016/j.jco.2006.09.004</a>.'
  mla: Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem over
    the Reals.” <i>Journal of Complexity</i>, 2008, pp. 3–15, doi:<a href="https://doi.org/10.1016/j.jco.2006.09.004">10.1016/j.jco.2006.09.004</a>.
  short: K. Meer, M. Ziegler, Journal of Complexity (2008) 3–15.
date_created: 2021-10-15T12:42:15Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '63'
- _id: '26'
doi: 10.1016/j.jco.2006.09.004
language:
- iso: eng
page: 3-15
publication: Journal of Complexity
publication_identifier:
  issn:
  - 0885-064X
publication_status: published
status: public
title: An explicit solution to Post's Problem over the reals
type: journal_article
user_id: '15415'
year: '2008'
...