---
_id: '16776'
author:
- first_name: A.
full_name: Borodin, A.
last_name: Borodin
- first_name: F.
full_name: Fich, F.
last_name: Fich
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: E.
full_name: Upfal, E.
last_name: Upfal
- first_name: A.
full_name: Wigderson, A.
last_name: Wigderson
citation:
ama: 'Borodin A, Fich F, Meyer auf der Heide F, Upfal E, Wigderson A. A time-space
tradeoff for element distinctness. In: STACS 86. Berlin, Heidelberg; 1986.
doi:10.1007/3-540-16078-7_89'
apa: Borodin, A., Fich, F., Meyer auf der Heide, F., Upfal, E., & Wigderson,
A. (1986). A time-space tradeoff for element distinctness. In STACS 86.
Berlin, Heidelberg. https://doi.org/10.1007/3-540-16078-7_89
bibtex: '@inbook{Borodin_Fich_Meyer auf der Heide_Upfal_Wigderson_1986, place={Berlin,
Heidelberg}, title={A time-space tradeoff for element distinctness}, DOI={10.1007/3-540-16078-7_89},
booktitle={STACS 86}, author={Borodin, A. and Fich, F. and Meyer auf der Heide,
Friedhelm and Upfal, E. and Wigderson, A.}, year={1986} }'
chicago: Borodin, A., F. Fich, Friedhelm Meyer auf der Heide, E. Upfal, and A. Wigderson.
“A Time-Space Tradeoff for Element Distinctness.” In STACS 86. Berlin,
Heidelberg, 1986. https://doi.org/10.1007/3-540-16078-7_89.
ieee: A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A
time-space tradeoff for element distinctness,” in STACS 86, Berlin, Heidelberg,
1986.
mla: Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.” STACS
86, 1986, doi:10.1007/3-540-16078-7_89.
short: 'A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in:
STACS 86, Berlin, Heidelberg, 1986.'
date_created: 2020-04-21T10:08:23Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-16078-7_89
language:
- iso: eng
place: Berlin, Heidelberg
publication: STACS 86
publication_identifier:
isbn:
- '9783540160786'
- '9783540397588'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: A time-space tradeoff for element distinctness
type: book_chapter
user_id: '15415'
year: '1986'
...
---
_id: '16779'
author:
- first_name: Clemens
full_name: Lautemann, Clemens
last_name: Lautemann
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Lautemann C, Meyer auf der Heide F. Lower time bounds for integer programming
with two variables. Information Processing Letters. 1985:101-105. doi:10.1016/0020-0190(85)90042-0
apa: Lautemann, C., & Meyer auf der Heide, F. (1985). Lower time bounds for
integer programming with two variables. Information Processing Letters,
101–105. https://doi.org/10.1016/0020-0190(85)90042-0
bibtex: '@article{Lautemann_Meyer auf der Heide_1985, title={Lower time bounds for
integer programming with two variables}, DOI={10.1016/0020-0190(85)90042-0},
journal={Information Processing Letters}, author={Lautemann, Clemens and Meyer
auf der Heide, Friedhelm}, year={1985}, pages={101–105} }'
chicago: Lautemann, Clemens, and Friedhelm Meyer auf der Heide. “Lower Time Bounds
for Integer Programming with Two Variables.” Information Processing Letters,
1985, 101–5. https://doi.org/10.1016/0020-0190(85)90042-0.
ieee: C. Lautemann and F. Meyer auf der Heide, “Lower time bounds for integer programming
with two variables,” Information Processing Letters, pp. 101–105, 1985.
mla: Lautemann, Clemens, and Friedhelm Meyer auf der Heide. “Lower Time Bounds for
Integer Programming with Two Variables.” Information Processing Letters,
1985, pp. 101–05, doi:10.1016/0020-0190(85)90042-0.
short: C. Lautemann, F. Meyer auf der Heide, Information Processing Letters (1985)
101–105.
date_created: 2020-04-21T10:15:46Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1016/0020-0190(85)90042-0
language:
- iso: eng
page: 101-105
publication: Information Processing Letters
publication_identifier:
issn:
- 0020-0190
publication_status: published
status: public
title: Lower time bounds for integer programming with two variables
type: journal_article
user_id: '15415'
year: '1985'
...
---
_id: '16780'
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. Lower bounds for solving linear diophantine equations
on random access machines. Journal of the ACM (JACM). 1985:929-937. doi:10.1145/4221.4250
apa: Meyer auf der Heide, F. (1985). Lower bounds for solving linear diophantine
equations on random access machines. Journal of the ACM (JACM), 929–937.
https://doi.org/10.1145/4221.4250
bibtex: '@article{Meyer auf der Heide_1985, title={Lower bounds for solving linear
diophantine equations on random access machines}, DOI={10.1145/4221.4250},
journal={Journal of the ACM (JACM)}, author={Meyer auf der Heide, Friedhelm},
year={1985}, pages={929–937} }'
chicago: Meyer auf der Heide, Friedhelm. “Lower Bounds for Solving Linear Diophantine
Equations on Random Access Machines.” Journal of the ACM (JACM), 1985,
929–37. https://doi.org/10.1145/4221.4250.
ieee: F. Meyer auf der Heide, “Lower bounds for solving linear diophantine equations
on random access machines,” Journal of the ACM (JACM), pp. 929–937, 1985.
mla: Meyer auf der Heide, Friedhelm. “Lower Bounds for Solving Linear Diophantine
Equations on Random Access Machines.” Journal of the ACM (JACM), 1985,
pp. 929–37, doi:10.1145/4221.4250.
short: F. Meyer auf der Heide, Journal of the ACM (JACM) (1985) 929–937.
date_created: 2020-04-21T10:16:50Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1145/4221.4250
language:
- iso: eng
page: 929-937
publication: Journal of the ACM (JACM)
publication_identifier:
issn:
- 0004-5411
- 1557-735X
publication_status: published
status: public
title: Lower bounds for solving linear diophantine equations on random access machines
type: journal_article
user_id: '15415'
year: '1985'
...
---
_id: '16781'
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. Simulating probabilistic by deterministic algebraic
computation trees. Theoretical Computer Science. 1985:325-330. doi:10.1016/0304-3975(85)90079-9
apa: Meyer auf der Heide, F. (1985). Simulating probabilistic by deterministic algebraic
computation trees. Theoretical Computer Science, 325–330. https://doi.org/10.1016/0304-3975(85)90079-9
bibtex: '@article{Meyer auf der Heide_1985, title={Simulating probabilistic by deterministic
algebraic computation trees}, DOI={10.1016/0304-3975(85)90079-9},
journal={Theoretical Computer Science}, author={Meyer auf der Heide, Friedhelm},
year={1985}, pages={325–330} }'
chicago: Meyer auf der Heide, Friedhelm. “Simulating Probabilistic by Deterministic
Algebraic Computation Trees.” Theoretical Computer Science, 1985, 325–30.
https://doi.org/10.1016/0304-3975(85)90079-9.
ieee: F. Meyer auf der Heide, “Simulating probabilistic by deterministic algebraic
computation trees,” Theoretical Computer Science, pp. 325–330, 1985.
mla: Meyer auf der Heide, Friedhelm. “Simulating Probabilistic by Deterministic
Algebraic Computation Trees.” Theoretical Computer Science, 1985, pp. 325–30,
doi:10.1016/0304-3975(85)90079-9.
short: F. Meyer auf der Heide, Theoretical Computer Science (1985) 325–330.
date_created: 2020-04-21T11:18:44Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1016/0304-3975(85)90079-9
language:
- iso: eng
page: 325-330
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
status: public
title: Simulating probabilistic by deterministic algebraic computation trees
type: journal_article
user_id: '15415'
year: '1985'
...
---
_id: '16782'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Avi
full_name: Wigderson, Avi
last_name: Wigderson
citation:
ama: 'Meyer auf der Heide F, Wigderson A. The complexity of parallel sorting. In:
26th Annual Symposium on Foundations of Computer Science (Sfcs 1985). ;
1985. doi:10.1109/sfcs.1985.58'
apa: Meyer auf der Heide, F., & Wigderson, A. (1985). The complexity of parallel
sorting. In 26th Annual Symposium on Foundations of Computer Science (sfcs
1985). https://doi.org/10.1109/sfcs.1985.58
bibtex: '@inproceedings{Meyer auf der Heide_Wigderson_1985, title={The complexity
of parallel sorting}, DOI={10.1109/sfcs.1985.58},
booktitle={26th Annual Symposium on Foundations of Computer Science (sfcs 1985)},
author={Meyer auf der Heide, Friedhelm and Wigderson, Avi}, year={1985} }'
chicago: Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel
Sorting.” In 26th Annual Symposium on Foundations of Computer Science (Sfcs
1985), 1985. https://doi.org/10.1109/sfcs.1985.58.
ieee: F. Meyer auf der Heide and A. Wigderson, “The complexity of parallel sorting,”
in 26th Annual Symposium on Foundations of Computer Science (sfcs 1985),
1985.
mla: Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel
Sorting.” 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985),
1985, doi:10.1109/sfcs.1985.58.
short: 'F. Meyer auf der Heide, A. Wigderson, in: 26th Annual Symposium on Foundations
of Computer Science (Sfcs 1985), 1985.'
date_created: 2020-04-21T11:19:34Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1109/sfcs.1985.58
language:
- iso: eng
publication: 26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
publication_identifier:
isbn:
- '0818606444'
publication_status: published
status: public
title: The complexity of parallel sorting
type: conference
user_id: '15415'
year: '1985'
...
---
_id: '16783'
author:
- first_name: F E
full_name: Fich, F E
last_name: Fich
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: P
full_name: Ragde, P
last_name: Ragde
- first_name: A
full_name: Wigderson, A
last_name: Wigderson
citation:
ama: 'Fich FE, Meyer auf der Heide F, Ragde P, Wigderson A. One, two, three . .
. infinity: lower bounds for parallel computation. In: Proceedings of the Seventeenth
Annual ACM Symposium on Theory of Computing - STOC ’85. ; 1985. doi:10.1145/22145.22151'
apa: 'Fich, F. E., Meyer auf der Heide, F., Ragde, P., & Wigderson, A. (1985).
One, two, three . . . infinity: lower bounds for parallel computation. In Proceedings
of the seventeenth annual ACM symposium on Theory of computing - STOC ’85.
https://doi.org/10.1145/22145.22151'
bibtex: '@inproceedings{Fich_Meyer auf der Heide_Ragde_Wigderson_1985, title={One,
two, three . . . infinity: lower bounds for parallel computation}, DOI={10.1145/22145.22151},
booktitle={Proceedings of the seventeenth annual ACM symposium on Theory of computing
- STOC ’85}, author={Fich, F E and Meyer auf der Heide, Friedhelm and Ragde, P
and Wigderson, A}, year={1985} }'
chicago: 'Fich, F E, Friedhelm Meyer auf der Heide, P Ragde, and A Wigderson. “One,
Two, Three . . . Infinity: Lower Bounds for Parallel Computation.” In Proceedings
of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85,
1985. https://doi.org/10.1145/22145.22151.'
ieee: 'F. E. Fich, F. Meyer auf der Heide, P. Ragde, and A. Wigderson, “One, two,
three . . . infinity: lower bounds for parallel computation,” in Proceedings
of the seventeenth annual ACM symposium on Theory of computing - STOC ’85,
1985.'
mla: 'Fich, F. E., et al. “One, Two, Three . . . Infinity: Lower Bounds for Parallel
Computation.” Proceedings of the Seventeenth Annual ACM Symposium on Theory
of Computing - STOC ’85, 1985, doi:10.1145/22145.22151.'
short: 'F.E. Fich, F. Meyer auf der Heide, P. Ragde, A. Wigderson, in: Proceedings
of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85, 1985.'
date_created: 2020-04-21T11:20:53Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1145/22145.22151
language:
- iso: eng
publication: Proceedings of the seventeenth annual ACM symposium on Theory of computing -
STOC '85
publication_identifier:
isbn:
- '0897911512'
publication_status: published
status: public
title: 'One, two, three . . . infinity: lower bounds for parallel computation'
type: conference
user_id: '15415'
year: '1985'
...
---
_id: '16784'
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. Fast algorithms for n-dimensional restrictions of hard
problems. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory
of Computing - STOC ’85. ; 1985. doi:10.1145/22145.22191'
apa: Meyer auf der Heide, F. (1985). Fast algorithms for n-dimensional restrictions
of hard problems. In Proceedings of the seventeenth annual ACM symposium on
Theory of computing - STOC ’85. https://doi.org/10.1145/22145.22191
bibtex: '@inproceedings{Meyer auf der Heide_1985, title={Fast algorithms for n-dimensional
restrictions of hard problems}, DOI={10.1145/22145.22191},
booktitle={Proceedings of the seventeenth annual ACM symposium on Theory of computing
- STOC ’85}, author={Meyer auf der Heide, Friedhelm}, year={1985} }'
chicago: Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions
of Hard Problems.” In Proceedings of the Seventeenth Annual ACM Symposium on
Theory of Computing - STOC ’85, 1985. https://doi.org/10.1145/22145.22191.
ieee: F. Meyer auf der Heide, “Fast algorithms for n-dimensional restrictions of
hard problems,” in Proceedings of the seventeenth annual ACM symposium on Theory
of computing - STOC ’85, 1985.
mla: Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions
of Hard Problems.” Proceedings of the Seventeenth Annual ACM Symposium on Theory
of Computing - STOC ’85, 1985, doi:10.1145/22145.22191.
short: 'F. Meyer auf der Heide, in: Proceedings of the Seventeenth Annual ACM Symposium
on Theory of Computing - STOC ’85, 1985.'
date_created: 2020-04-21T11:24:17Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1145/22145.22191
language:
- iso: eng
publication: Proceedings of the seventeenth annual ACM symposium on Theory of computing -
STOC '85
publication_identifier:
isbn:
- '0897911512'
publication_status: published
status: public
title: Fast algorithms for n-dimensional restrictions of hard problems
type: conference
user_id: '15415'
year: '1985'
...
---
_id: '16788'
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. Nondeterministic versus probabilistic linear search
algorithms. In: 26th Annual Symposium on Foundations of Computer Science (Sfcs
1985). ; 1985. doi:10.1109/sfcs.1985.38'
apa: Meyer auf der Heide, F. (1985). Nondeterministic versus probabilistic linear
search algorithms. In 26th Annual Symposium on Foundations of Computer Science
(sfcs 1985). https://doi.org/10.1109/sfcs.1985.38
bibtex: '@inproceedings{Meyer auf der Heide_1985, title={Nondeterministic versus
probabilistic linear search algorithms}, DOI={10.1109/sfcs.1985.38},
booktitle={26th Annual Symposium on Foundations of Computer Science (sfcs 1985)},
author={Meyer auf der Heide, Friedhelm}, year={1985} }'
chicago: Meyer auf der Heide, Friedhelm. “Nondeterministic versus Probabilistic
Linear Search Algorithms.” In 26th Annual Symposium on Foundations of Computer
Science (Sfcs 1985), 1985. https://doi.org/10.1109/sfcs.1985.38.
ieee: F. Meyer auf der Heide, “Nondeterministic versus probabilistic linear search
algorithms,” in 26th Annual Symposium on Foundations of Computer Science (sfcs
1985), 1985.
mla: Meyer auf der Heide, Friedhelm. “Nondeterministic versus Probabilistic Linear
Search Algorithms.” 26th Annual Symposium on Foundations of Computer Science
(Sfcs 1985), 1985, doi:10.1109/sfcs.1985.38.
short: 'F. Meyer auf der Heide, in: 26th Annual Symposium on Foundations of Computer
Science (Sfcs 1985), 1985.'
date_created: 2020-04-21T11:30:30Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1109/sfcs.1985.38
language:
- iso: eng
publication: 26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
publication_identifier:
isbn:
- '0818606444'
publication_status: published
status: public
title: Nondeterministic versus probabilistic linear search algorithms
type: conference
user_id: '15415'
year: '1985'
...
---
_id: '16823'
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. Lower time bounds for solving linear diophantine equations
on several parallel computational models. Information and Control. 1985;67(1-3):195-211.
doi:10.1016/S0019-9958(85)80035-8
apa: Meyer auf der Heide, F. (1985). Lower time bounds for solving linear diophantine
equations on several parallel computational models. Information and Control,
67(1–3), 195–211. https://doi.org/10.1016/S0019-9958(85)80035-8
bibtex: '@article{Meyer auf der Heide_1985, title={Lower time bounds for solving
linear diophantine equations on several parallel computational models}, volume={67},
DOI={10.1016/S0019-9958(85)80035-8},
number={1–3}, journal={Information and Control}, author={Meyer auf der Heide,
Friedhelm}, year={1985}, pages={195–211} }'
chicago: 'Meyer auf der Heide, Friedhelm. “Lower Time Bounds for Solving Linear
Diophantine Equations on Several Parallel Computational Models.” Information
and Control 67, no. 1–3 (1985): 195–211. https://doi.org/10.1016/S0019-9958(85)80035-8.'
ieee: F. Meyer auf der Heide, “Lower time bounds for solving linear diophantine
equations on several parallel computational models,” Information and Control,
vol. 67, no. 1–3, pp. 195–211, 1985.
mla: Meyer auf der Heide, Friedhelm. “Lower Time Bounds for Solving Linear Diophantine
Equations on Several Parallel Computational Models.” Information and Control,
vol. 67, no. 1–3, 1985, pp. 195–211, doi:10.1016/S0019-9958(85)80035-8.
short: F. Meyer auf der Heide, Information and Control 67 (1985) 195–211.
date_created: 2020-04-22T09:58:17Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1016/S0019-9958(85)80035-8
intvolume: ' 67'
issue: 1-3
language:
- iso: eng
page: 195-211
publication: Information and Control
status: public
title: Lower time bounds for solving linear diophantine equations on several parallel
computational models
type: journal_article
user_id: '15415'
volume: 67
year: '1985'
...
---
_id: '16785'
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. A Polynomial Linear Search Algorithm forr the n-Dimensional
Knapsack Problem. Journal of the ACM (JACM). 1984:668-676. doi:10.1145/828.322450
apa: Meyer auf der Heide, F. (1984). A Polynomial Linear Search Algorithm forr the
n-Dimensional Knapsack Problem. Journal of the ACM (JACM), 668–676. https://doi.org/10.1145/828.322450
bibtex: '@article{Meyer auf der Heide_1984, title={A Polynomial Linear Search Algorithm
forr the n-Dimensional Knapsack Problem}, DOI={10.1145/828.322450},
journal={Journal of the ACM (JACM)}, author={Meyer auf der Heide, Friedhelm},
year={1984}, pages={668–676} }'
chicago: Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm Forr
the N-Dimensional Knapsack Problem.” Journal of the ACM (JACM), 1984, 668–76.
https://doi.org/10.1145/828.322450.
ieee: F. Meyer auf der Heide, “A Polynomial Linear Search Algorithm forr the n-Dimensional
Knapsack Problem,” Journal of the ACM (JACM), pp. 668–676, 1984.
mla: Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm Forr
the N-Dimensional Knapsack Problem.” Journal of the ACM (JACM), 1984, pp.
668–76, doi:10.1145/828.322450.
short: F. Meyer auf der Heide, Journal of the ACM (JACM) (1984) 668–676.
date_created: 2020-04-21T11:25:52Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1145/828.322450
language:
- iso: eng
page: 668-676
publication: Journal of the ACM (JACM)
publication_identifier:
issn:
- 0004-5411
- 1557-735X
publication_status: published
status: public
title: A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem
type: journal_article
user_id: '15415'
year: '1984'
...
---
_id: '16786'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: R.
full_name: Reischuk, R.
last_name: Reischuk
citation:
ama: 'Meyer auf der Heide F, Reischuk R. On The Limits To Speed Up Parallel Machines
By Large Hardware And Unbounded Communication. In: 25th Annual Symposium OnFoundations
of Computer Science, 1984. ; 1984. doi:10.1109/sfcs.1984.715901'
apa: Meyer auf der Heide, F., & Reischuk, R. (1984). On The Limits To Speed
Up Parallel Machines By Large Hardware And Unbounded Communication. In 25th
Annual Symposium onFoundations of Computer Science, 1984. https://doi.org/10.1109/sfcs.1984.715901
bibtex: '@inproceedings{Meyer auf der Heide_Reischuk_1984, title={On The Limits
To Speed Up Parallel Machines By Large Hardware And Unbounded Communication},
DOI={10.1109/sfcs.1984.715901},
booktitle={25th Annual Symposium onFoundations of Computer Science, 1984.}, author={Meyer
auf der Heide, Friedhelm and Reischuk, R.}, year={1984} }'
chicago: Meyer auf der Heide, Friedhelm, and R. Reischuk. “On The Limits To Speed
Up Parallel Machines By Large Hardware And Unbounded Communication.” In 25th
Annual Symposium OnFoundations of Computer Science, 1984., 1984. https://doi.org/10.1109/sfcs.1984.715901.
ieee: F. Meyer auf der Heide and R. Reischuk, “On The Limits To Speed Up Parallel
Machines By Large Hardware And Unbounded Communication,” in 25th Annual Symposium
onFoundations of Computer Science, 1984., 1984.
mla: Meyer auf der Heide, Friedhelm, and R. Reischuk. “On The Limits To Speed Up
Parallel Machines By Large Hardware And Unbounded Communication.” 25th Annual
Symposium OnFoundations of Computer Science, 1984., 1984, doi:10.1109/sfcs.1984.715901.
short: 'F. Meyer auf der Heide, R. Reischuk, in: 25th Annual Symposium OnFoundations
of Computer Science, 1984., 1984.'
date_created: 2020-04-21T11:27:07Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1109/sfcs.1984.715901
language:
- iso: eng
publication: 25th Annual Symposium onFoundations of Computer Science, 1984.
publication_identifier:
isbn:
- 081860591X
publication_status: published
status: public
title: On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded
Communication
type: conference
user_id: '15415'
year: '1984'
...
---
_id: '16787'
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. Efficient simulations among several models of parallel
computers (extended abstract). In: STACS 84. Berlin, Heidelberg; 1984.
doi:10.1007/3-540-12920-0_20'
apa: Meyer auf der Heide, F. (1984). Efficient simulations among several models
of parallel computers (extended abstract). In STACS 84. Berlin, Heidelberg.
https://doi.org/10.1007/3-540-12920-0_20
bibtex: '@inbook{Meyer auf der Heide_1984, place={Berlin, Heidelberg}, title={Efficient
simulations among several models of parallel computers (extended abstract)}, DOI={10.1007/3-540-12920-0_20},
booktitle={STACS 84}, author={Meyer auf der Heide, Friedhelm}, year={1984} }'
chicago: Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models
of Parallel Computers (Extended Abstract).” In STACS 84. Berlin, Heidelberg,
1984. https://doi.org/10.1007/3-540-12920-0_20.
ieee: F. Meyer auf der Heide, “Efficient simulations among several models of parallel
computers (extended abstract),” in STACS 84, Berlin, Heidelberg, 1984.
mla: Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models
of Parallel Computers (Extended Abstract).” STACS 84, 1984, doi:10.1007/3-540-12920-0_20.
short: 'F. Meyer auf der Heide, in: STACS 84, Berlin, Heidelberg, 1984.'
date_created: 2020-04-21T11:28:40Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1007/3-540-12920-0_20
language:
- iso: eng
place: Berlin, Heidelberg
publication: STACS 84
publication_identifier:
isbn:
- '9783540129202'
- '9783540388050'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Efficient simulations among several models of parallel computers (extended
abstract)
type: book_chapter
user_id: '15415'
year: '1984'
...
---
_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. Acta
Informatica. 1983:269-296. doi:10.1007/bf00265559
apa: Meyer auf der Heide, F. (1983). Efficiency of universal parallel computers.
Acta Informatica, 269–296. https://doi.org/10.1007/bf00265559
bibtex: '@article{Meyer auf der Heide_1983, title={Efficiency of universal parallel
computers}, DOI={10.1007/bf00265559},
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.”
Acta Informatica, 1983, 269–96. https://doi.org/10.1007/bf00265559.
ieee: F. Meyer auf der Heide, “Efficiency of universal parallel computers,” Acta
Informatica, pp. 269–296, 1983.
mla: Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.”
Acta Informatica, 1983, pp. 269–96, doi:10.1007/bf00265559.
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. Acta Informatica. 1983:385-395. doi:10.1007/bf00290735
apa: Klein, P., & Meyer auf der Heide, F. (1983). A lower time bound for the
knapsack problem on random access machines. Acta Informatica, 385–395.
https://doi.org/10.1007/bf00290735
bibtex: '@article{Klein_Meyer auf der Heide_1983, title={A lower time bound for
the knapsack problem on random access machines}, DOI={10.1007/bf00290735},
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.” Acta Informatica, 1983,
385–95. https://doi.org/10.1007/bf00290735.
ieee: P. Klein and F. Meyer auf der Heide, “A lower time bound for the knapsack
problem on random access machines,” Acta Informatica, 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.” Acta Informatica, 1983, pp.
385–95, doi:10.1007/bf00290735.
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'
...
---
_id: '16808'
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. Infinite cube-connected cycles. Information Processing
Letters. 1983:1-2. doi:10.1016/0020-0190(83)90001-7
apa: Meyer auf der Heide, F. (1983). Infinite cube-connected cycles. Information
Processing Letters, 1–2. https://doi.org/10.1016/0020-0190(83)90001-7
bibtex: '@article{Meyer auf der Heide_1983, title={Infinite cube-connected cycles},
DOI={10.1016/0020-0190(83)90001-7},
journal={Information Processing Letters}, author={Meyer auf der Heide, Friedhelm},
year={1983}, pages={1–2} }'
chicago: Meyer auf der Heide, Friedhelm. “Infinite Cube-Connected Cycles.” Information
Processing Letters, 1983, 1–2. https://doi.org/10.1016/0020-0190(83)90001-7.
ieee: F. Meyer auf der Heide, “Infinite cube-connected cycles,” Information Processing
Letters, pp. 1–2, 1983.
mla: Meyer auf der Heide, Friedhelm. “Infinite Cube-Connected Cycles.” Information
Processing Letters, 1983, pp. 1–2, doi:10.1016/0020-0190(83)90001-7.
short: F. Meyer auf der Heide, Information Processing Letters (1983) 1–2.
date_created: 2020-04-22T08:51:01Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1016/0020-0190(83)90001-7
language:
- iso: eng
page: 1-2
publication: Information Processing Letters
publication_identifier:
issn:
- 0020-0190
publication_status: published
status: public
title: Infinite cube-connected cycles
type: journal_article
user_id: '15415'
year: '1983'
...
---
_id: '16809'
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. A polynomial linear search algorithm for the n-dimensional
knapsack problem. In: Proceedings of the Fifteenth Annual ACM Symposium on
Theory of Computing - STOC ’83. ; 1983. doi:10.1145/800061.808734'
apa: Meyer auf der Heide, F. (1983). A polynomial linear search algorithm for the
n-dimensional knapsack problem. In Proceedings of the fifteenth annual ACM
symposium on Theory of computing - STOC ’83. https://doi.org/10.1145/800061.808734
bibtex: '@inproceedings{Meyer auf der Heide_1983, title={A polynomial linear search
algorithm for the n-dimensional knapsack problem}, DOI={10.1145/800061.808734},
booktitle={Proceedings of the fifteenth annual ACM symposium on Theory of computing
- STOC ’83}, author={Meyer auf der Heide, Friedhelm}, year={1983} }'
chicago: Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm for
the N-Dimensional Knapsack Problem.” In Proceedings of the Fifteenth Annual
ACM Symposium on Theory of Computing - STOC ’83, 1983. https://doi.org/10.1145/800061.808734.
ieee: F. Meyer auf der Heide, “A polynomial linear search algorithm for the n-dimensional
knapsack problem,” in Proceedings of the fifteenth annual ACM symposium on
Theory of computing - STOC ’83, 1983.
mla: Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm for the
N-Dimensional Knapsack Problem.” Proceedings of the Fifteenth Annual ACM Symposium
on Theory of Computing - STOC ’83, 1983, doi:10.1145/800061.808734.
short: 'F. Meyer auf der Heide, in: Proceedings of the Fifteenth Annual ACM Symposium
on Theory of Computing - STOC ’83, 1983.'
date_created: 2020-04-22T08:52:15Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1145/800061.808734
language:
- iso: eng
publication: Proceedings of the fifteenth annual ACM symposium on Theory of computing -
STOC '83
publication_identifier:
isbn:
- '0897910990'
publication_status: published
status: public
title: A polynomial linear search algorithm for the n-dimensional knapsack problem
type: conference
user_id: '15415'
year: '1983'
...
---
_id: '16810'
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. In: Lecture
Notes in Computer Science. Berlin/Heidelberg; 1983. doi:10.1007/bfb0036483'
apa: Meyer auf der Heide, F. (1983). Efficiency of universal parallel computers.
In Lecture Notes in Computer Science. Berlin/Heidelberg. https://doi.org/10.1007/bfb0036483
bibtex: '@inbook{Meyer auf der Heide_1983, place={Berlin/Heidelberg}, title={Efficiency
of universal parallel computers}, DOI={10.1007/bfb0036483},
booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm},
year={1983} }'
chicago: Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.”
In Lecture Notes in Computer Science. Berlin/Heidelberg, 1983. https://doi.org/10.1007/bfb0036483.
ieee: F. Meyer auf der Heide, “Efficiency of universal parallel computers,” in Lecture
Notes in Computer Science, Berlin/Heidelberg, 1983.
mla: Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.”
Lecture Notes in Computer Science, 1983, doi:10.1007/bfb0036483.
short: 'F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg,
1983.'
date_created: 2020-04-22T08:53:33Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1007/bfb0036483
language:
- iso: eng
place: Berlin/Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '3540119736'
publication_status: published
status: public
title: Efficiency of universal parallel computers
type: book_chapter
user_id: '15415'
year: '1983'
...
---
_id: '16813'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Anton
full_name: Rollik, Anton
last_name: Rollik
citation:
ama: 'Meyer auf der Heide F, Rollik A. Random access machines and straight-line
programs. In: Fundamentals of Computation Theory. Berlin, Heidelberg; 1981.
doi:10.1007/3-540-10854-8_29'
apa: Meyer auf der Heide, F., & Rollik, A. (1981). Random access machines and
straight-line programs. In Fundamentals of Computation Theory. Berlin,
Heidelberg. https://doi.org/10.1007/3-540-10854-8_29
bibtex: '@inbook{Meyer auf der Heide_Rollik_1981, place={Berlin, Heidelberg}, title={Random
access machines and straight-line programs}, DOI={10.1007/3-540-10854-8_29},
booktitle={Fundamentals of Computation Theory}, author={Meyer auf der Heide, Friedhelm
and Rollik, Anton}, year={1981} }'
chicago: Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines
and Straight-Line Programs.” In Fundamentals of Computation Theory. Berlin,
Heidelberg, 1981. https://doi.org/10.1007/3-540-10854-8_29.
ieee: F. Meyer auf der Heide and A. Rollik, “Random access machines and straight-line
programs,” in Fundamentals of Computation Theory, Berlin, Heidelberg, 1981.
mla: Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines and
Straight-Line Programs.” Fundamentals of Computation Theory, 1981, doi:10.1007/3-540-10854-8_29.
short: 'F. Meyer auf der Heide, A. Rollik, in: Fundamentals of Computation Theory,
Berlin, Heidelberg, 1981.'
date_created: 2020-04-22T09:03:21Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1007/3-540-10854-8_29
language:
- iso: eng
place: Berlin, Heidelberg
publication: Fundamentals of Computation Theory
publication_identifier:
isbn:
- '9783540108542'
- '9783540387657'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Random access machines and straight-line programs
type: book_chapter
user_id: '15415'
year: '1981'
...
---
_id: '16814'
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. Time-processor trade-offs for universal parallel computers.
In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1981. doi:10.1007/3-540-10856-4_111'
apa: Meyer auf der Heide, F. (1981). Time-processor trade-offs for universal parallel
computers. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_111
bibtex: '@inbook{Meyer auf der Heide_1981, place={Berlin, Heidelberg}, title={Time-processor
trade-offs for universal parallel computers}, DOI={10.1007/3-540-10856-4_111},
booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm},
year={1981} }'
chicago: Meyer auf der Heide, Friedhelm. “Time-Processor Trade-Offs for Universal
Parallel Computers.” In Lecture Notes in Computer Science. Berlin, Heidelberg,
1981. https://doi.org/10.1007/3-540-10856-4_111.
ieee: F. Meyer auf der Heide, “Time-processor trade-offs for universal parallel
computers,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1981.
mla: Meyer auf der Heide, Friedhelm. “Time-Processor Trade-Offs for Universal Parallel
Computers.” Lecture Notes in Computer Science, 1981, doi:10.1007/3-540-10856-4_111.
short: 'F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg,
1981.'
date_created: 2020-04-22T09:05:15Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1007/3-540-10856-4_111
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540108566'
- '9783540387695'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Time-processor trade-offs for universal parallel computers
type: book_chapter
user_id: '15415'
year: '1981'
...
---
_id: '16820'
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. A comparison of two variations of a pebble game on graphs.
Theoretical Computer Science. 1981:315-322. doi:10.1016/s0304-3975(81)80004-7
apa: Meyer auf der Heide, F. (1981). A comparison of two variations of a pebble
game on graphs. Theoretical Computer Science, 315–322. https://doi.org/10.1016/s0304-3975(81)80004-7
bibtex: '@article{Meyer auf der Heide_1981, title={A comparison of two variations
of a pebble game on graphs}, DOI={10.1016/s0304-3975(81)80004-7},
journal={Theoretical Computer Science}, author={Meyer auf der Heide, Friedhelm},
year={1981}, pages={315–322} }'
chicago: Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble
Game on Graphs.” Theoretical Computer Science, 1981, 315–22. https://doi.org/10.1016/s0304-3975(81)80004-7.
ieee: F. Meyer auf der Heide, “A comparison of two variations of a pebble game on
graphs,” Theoretical Computer Science, pp. 315–322, 1981.
mla: Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble
Game on Graphs.” Theoretical Computer Science, 1981, pp. 315–22, doi:10.1016/s0304-3975(81)80004-7.
short: F. Meyer auf der Heide, Theoretical Computer Science (1981) 315–322.
date_created: 2020-04-22T09:33:31Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1016/s0304-3975(81)80004-7
language:
- iso: eng
page: 315-322
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
status: public
title: A comparison of two variations of a pebble game on graphs
type: journal_article
user_id: '15415'
year: '1981'
...
---
_id: '16815'
author:
- first_name: P.
full_name: Klein, P.
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. Untere Zeitschranken für das Rucksack-Problem.
In: GI - 10. Jahrestagung. Berlin, Heidelberg; 1980. doi:10.1007/978-3-642-67838-7_34'
apa: Klein, P., & Meyer auf der Heide, F. (1980). Untere Zeitschranken für das
Rucksack-Problem. In GI - 10. Jahrestagung. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-67838-7_34
bibtex: '@inbook{Klein_Meyer auf der Heide_1980, place={Berlin, Heidelberg}, title={Untere
Zeitschranken für das Rucksack-Problem}, DOI={10.1007/978-3-642-67838-7_34},
booktitle={GI - 10. Jahrestagung}, author={Klein, P. and Meyer auf der Heide,
Friedhelm}, year={1980} }'
chicago: Klein, P., and Friedhelm Meyer auf der Heide. “Untere Zeitschranken Für
Das Rucksack-Problem.” In GI - 10. Jahrestagung. Berlin, Heidelberg, 1980.
https://doi.org/10.1007/978-3-642-67838-7_34.
ieee: P. Klein and F. Meyer auf der Heide, “Untere Zeitschranken für das Rucksack-Problem,”
in GI - 10. Jahrestagung, Berlin, Heidelberg, 1980.
mla: Klein, P., and Friedhelm Meyer auf der Heide. “Untere Zeitschranken Für Das
Rucksack-Problem.” GI - 10. Jahrestagung, 1980, doi:10.1007/978-3-642-67838-7_34.
short: 'P. Klein, F. Meyer auf der Heide, in: GI - 10. Jahrestagung, Berlin, Heidelberg,
1980.'
date_created: 2020-04-22T09:06:48Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1007/978-3-642-67838-7_34
language:
- iso: eng
place: Berlin, Heidelberg
publication: GI - 10. Jahrestagung
publication_identifier:
isbn:
- '9783540103882'
- '9783642678387'
issn:
- 0343-3005
publication_status: published
status: public
title: Untere Zeitschranken für das Rucksack-Problem
type: book_chapter
user_id: '15415'
year: '1980'
...
---
_id: '16812'
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. A comparison of two variations of a pebble game on graphs.
Automata, Languages and Programming ICALP 1979. 1979:411-421. doi:10.1007/3-540-09510-1_32
apa: Meyer auf der Heide, F. (1979). A comparison of two variations of a pebble
game on graphs. Automata, Languages and Programming. ICALP 1979, 411–421.
https://doi.org/10.1007/3-540-09510-1_32
bibtex: '@article{Meyer auf der Heide_1979, title={A comparison of two variations
of a pebble game on graphs}, DOI={10.1007/3-540-09510-1_32 }, journal={Automata, Languages and Programming.
ICALP 1979}, author={Meyer auf der Heide, Friedhelm}, year={1979}, pages={411–421}
}'
chicago: Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble
Game on Graphs.” Automata, Languages and Programming. ICALP 1979, 1979,
411–21. https://doi.org/10.1007/3-540-09510-1_32
.
ieee: F. Meyer auf der Heide, “A comparison of two variations of a pebble game on
graphs,” Automata, Languages and Programming. ICALP 1979, pp. 411–421,
1979.
mla: Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble
Game on Graphs.” Automata, Languages and Programming. ICALP 1979, 1979,
pp. 411–21, doi:10.1007/3-540-09510-1_32
.
short: F. Meyer auf der Heide, Automata, Languages and Programming. ICALP 1979 (1979)
411–421.
date_created: 2020-04-22T09:02:08Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: '10.1007/3-540-09510-1_32 '
language:
- iso: eng
page: 411-421
publication: Automata, Languages and Programming. ICALP 1979
publication_status: published
status: public
title: A comparison of two variations of a pebble game on graphs
type: journal_article
user_id: '15415'
year: '1979'
...