---
_id: '16698'
author:
- first_name: Foued
  full_name: Ameur, Foued
  last_name: Ameur
- first_name: Paul
  full_name: Fischer, Paul
  last_name: Fischer
- first_name: Klaus -U.
  full_name: Höffgen, Klaus -U.
  last_name: Höffgen
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: Ameur F, Fischer P, Höffgen K-U, Meyer auf der Heide F. Trial and error. A
    new approach to space-bounded learning. <i>Acta Informatica</i>. 1996:621-630.
    doi:<a href="https://doi.org/10.1007/bf03036467">10.1007/bf03036467</a>
  apa: Ameur, F., Fischer, P., Höffgen, K.-U., &#38; Meyer auf der Heide, F. (1996).
    Trial and error. A new approach to space-bounded learning. <i>Acta Informatica</i>,
    621–630. <a href="https://doi.org/10.1007/bf03036467">https://doi.org/10.1007/bf03036467</a>
  bibtex: '@article{Ameur_Fischer_Höffgen_Meyer auf der Heide_1996, title={Trial and
    error. A new approach to space-bounded learning}, DOI={<a href="https://doi.org/10.1007/bf03036467">10.1007/bf03036467</a>},
    journal={Acta Informatica}, author={Ameur, Foued and Fischer, Paul and Höffgen,
    Klaus -U. and Meyer auf der Heide, Friedhelm}, year={1996}, pages={621–630} }'
  chicago: Ameur, Foued, Paul Fischer, Klaus -U. Höffgen, and Friedhelm Meyer auf
    der Heide. “Trial and Error. A New Approach to Space-Bounded Learning.” <i>Acta
    Informatica</i>, 1996, 621–30. <a href="https://doi.org/10.1007/bf03036467">https://doi.org/10.1007/bf03036467</a>.
  ieee: F. Ameur, P. Fischer, K.-U. Höffgen, and F. Meyer auf der Heide, “Trial and
    error. A new approach to space-bounded learning,” <i>Acta Informatica</i>, pp.
    621–630, 1996.
  mla: Ameur, Foued, et al. “Trial and Error. A New Approach to Space-Bounded Learning.”
    <i>Acta Informatica</i>, 1996, pp. 621–30, doi:<a href="https://doi.org/10.1007/bf03036467">10.1007/bf03036467</a>.
  short: F. Ameur, P. Fischer, K.-U. Höffgen, F. Meyer auf der Heide, Acta Informatica
    (1996) 621–630.
date_created: 2020-04-16T11:40:05Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/bf03036467
language:
- iso: eng
page: 621-630
publication: Acta Informatica
publication_identifier:
  issn:
  - 0001-5903
  - 1432-0525
publication_status: published
status: public
title: Trial and error. A new approach to space-bounded learning
type: journal_article
user_id: '15415'
year: '1996'
...
---
_id: '16806'
author:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: Meyer auf der Heide F. Efficiency of universal parallel computers. <i>Acta
    Informatica</i>. 1983:269-296. doi:<a href="https://doi.org/10.1007/bf00265559">10.1007/bf00265559</a>
  apa: Meyer auf der Heide, F. (1983). Efficiency of universal parallel computers.
    <i>Acta Informatica</i>, 269–296. <a href="https://doi.org/10.1007/bf00265559">https://doi.org/10.1007/bf00265559</a>
  bibtex: '@article{Meyer auf der Heide_1983, title={Efficiency of universal parallel
    computers}, DOI={<a href="https://doi.org/10.1007/bf00265559">10.1007/bf00265559</a>},
    journal={Acta Informatica}, author={Meyer auf der Heide, Friedhelm}, year={1983},
    pages={269–296} }'
  chicago: Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.”
    <i>Acta Informatica</i>, 1983, 269–96. <a href="https://doi.org/10.1007/bf00265559">https://doi.org/10.1007/bf00265559</a>.
  ieee: F. Meyer auf der Heide, “Efficiency of universal parallel computers,” <i>Acta
    Informatica</i>, pp. 269–296, 1983.
  mla: Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.”
    <i>Acta Informatica</i>, 1983, pp. 269–96, doi:<a href="https://doi.org/10.1007/bf00265559">10.1007/bf00265559</a>.
  short: F. Meyer auf der Heide, Acta Informatica (1983) 269–296.
date_created: 2020-04-22T08:48:20Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1007/bf00265559
language:
- iso: eng
page: 269-296
publication: Acta Informatica
publication_identifier:
  issn:
  - 0001-5903
  - 1432-0525
publication_status: published
status: public
title: Efficiency of universal parallel computers
type: journal_article
user_id: '15415'
year: '1983'
...
---
_id: '16807'
author:
- first_name: Peter
  full_name: Klein, Peter
  last_name: Klein
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: Klein P, Meyer auf der Heide F. A lower time bound for the knapsack problem
    on random access machines. <i>Acta Informatica</i>. 1983:385-395. doi:<a href="https://doi.org/10.1007/bf00290735">10.1007/bf00290735</a>
  apa: Klein, P., &#38; Meyer auf der Heide, F. (1983). A lower time bound for the
    knapsack problem on random access machines. <i>Acta Informatica</i>, 385–395.
    <a href="https://doi.org/10.1007/bf00290735">https://doi.org/10.1007/bf00290735</a>
  bibtex: '@article{Klein_Meyer auf der Heide_1983, title={A lower time bound for
    the knapsack problem on random access machines}, DOI={<a href="https://doi.org/10.1007/bf00290735">10.1007/bf00290735</a>},
    journal={Acta Informatica}, author={Klein, Peter and Meyer auf der Heide, Friedhelm},
    year={1983}, pages={385–395} }'
  chicago: Klein, Peter, and Friedhelm Meyer auf der Heide. “A Lower Time Bound for
    the Knapsack Problem on Random Access Machines.” <i>Acta Informatica</i>, 1983,
    385–95. <a href="https://doi.org/10.1007/bf00290735">https://doi.org/10.1007/bf00290735</a>.
  ieee: P. Klein and F. Meyer auf der Heide, “A lower time bound for the knapsack
    problem on random access machines,” <i>Acta Informatica</i>, pp. 385–395, 1983.
  mla: Klein, Peter, and Friedhelm Meyer auf der Heide. “A Lower Time Bound for the
    Knapsack Problem on Random Access Machines.” <i>Acta Informatica</i>, 1983, pp.
    385–95, doi:<a href="https://doi.org/10.1007/bf00290735">10.1007/bf00290735</a>.
  short: P. Klein, F. Meyer auf der Heide, Acta Informatica (1983) 385–395.
date_created: 2020-04-22T08:49:58Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1007/bf00290735
language:
- iso: eng
page: 385-395
publication: Acta Informatica
publication_identifier:
  issn:
  - 0001-5903
  - 1432-0525
publication_status: published
status: public
title: A lower time bound for the knapsack problem on random access machines
type: journal_article
user_id: '15415'
year: '1983'
...