[{"citation":{"short":"F. Meyer auf der Heide, Acta Informatica (1983) 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.","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} }","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>","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>."},"publication":"Acta Informatica","date_created":"2020-04-22T08:48:20Z","department":[{"_id":"63"}],"type":"journal_article","publication_identifier":{"issn":["0001-5903","1432-0525"]},"author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"title":"Efficiency of universal parallel computers","status":"public","year":"1983","publication_status":"published","date_updated":"2022-01-06T06:52:56Z","language":[{"iso":"eng"}],"_id":"16806","page":"269-296","user_id":"15415","doi":"10.1007/bf00265559"},{"department":[{"_id":"63"}],"type":"journal_article","date_created":"2020-04-22T08:49:58Z","citation":{"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} }","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>","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.","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.","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>"},"publication":"Acta Informatica","doi":"10.1007/bf00290735","user_id":"15415","_id":"16807","language":[{"iso":"eng"}],"page":"385-395","date_updated":"2022-01-06T06:52:56Z","publication_status":"published","publication_identifier":{"issn":["0001-5903","1432-0525"]},"author":[{"first_name":"Peter","last_name":"Klein","full_name":"Klein, Peter"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"year":"1983","title":"A lower time bound for the knapsack problem on random access machines","status":"public"},{"publication_status":"published","date_updated":"2022-01-06T06:52:56Z","author":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"publication_identifier":{"issn":["0020-0190"]},"year":"1983","status":"public","title":"Infinite cube-connected cycles","user_id":"15415","doi":"10.1016/0020-0190(83)90001-7","language":[{"iso":"eng"}],"_id":"16808","page":"1-2","citation":{"apa":"Meyer auf der Heide, F. (1983). Infinite cube-connected cycles. <i>Information Processing Letters</i>, 1–2. <a href=\"https://doi.org/10.1016/0020-0190(83)90001-7\">https://doi.org/10.1016/0020-0190(83)90001-7</a>","ieee":"F. Meyer auf der Heide, “Infinite cube-connected cycles,” <i>Information Processing Letters</i>, pp. 1–2, 1983.","short":"F. Meyer auf der Heide, Information Processing Letters (1983) 1–2.","chicago":"Meyer auf der Heide, Friedhelm. “Infinite Cube-Connected Cycles.” <i>Information Processing Letters</i>, 1983, 1–2. <a href=\"https://doi.org/10.1016/0020-0190(83)90001-7\">https://doi.org/10.1016/0020-0190(83)90001-7</a>.","mla":"Meyer auf der Heide, Friedhelm. “Infinite Cube-Connected Cycles.” <i>Information Processing Letters</i>, 1983, pp. 1–2, doi:<a href=\"https://doi.org/10.1016/0020-0190(83)90001-7\">10.1016/0020-0190(83)90001-7</a>.","ama":"Meyer auf der Heide F. Infinite cube-connected cycles. <i>Information Processing Letters</i>. 1983:1-2. doi:<a href=\"https://doi.org/10.1016/0020-0190(83)90001-7\">10.1016/0020-0190(83)90001-7</a>","bibtex":"@article{Meyer auf der Heide_1983, title={Infinite cube-connected cycles}, DOI={<a href=\"https://doi.org/10.1016/0020-0190(83)90001-7\">10.1016/0020-0190(83)90001-7</a>}, journal={Information Processing Letters}, author={Meyer auf der Heide, Friedhelm}, year={1983}, pages={1–2} }"},"publication":"Information Processing Letters","department":[{"_id":"63"}],"type":"journal_article","date_created":"2020-04-22T08:51:01Z"},{"_id":"16809","language":[{"iso":"eng"}],"doi":"10.1145/800061.808734","user_id":"15415","status":"public","title":"A polynomial linear search algorithm for the n-dimensional knapsack problem","year":"1983","author":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"publication_identifier":{"isbn":["0897910990"]},"date_updated":"2022-01-06T06:52:56Z","publication_status":"published","date_created":"2020-04-22T08:52:15Z","type":"conference","department":[{"_id":"63"}],"publication":"Proceedings of the fifteenth annual ACM symposium on Theory of computing  - STOC '83","citation":{"ama":"Meyer auf der Heide F. A polynomial linear search algorithm for the n-dimensional knapsack problem. In: <i>Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing  - STOC ’83</i>. ; 1983. doi:<a href=\"https://doi.org/10.1145/800061.808734\">10.1145/800061.808734</a>","bibtex":"@inproceedings{Meyer auf der Heide_1983, title={A polynomial linear search algorithm for the n-dimensional knapsack problem}, DOI={<a href=\"https://doi.org/10.1145/800061.808734\">10.1145/800061.808734</a>}, booktitle={Proceedings of the fifteenth annual ACM symposium on Theory of computing  - STOC ’83}, author={Meyer auf der Heide, Friedhelm}, year={1983} }","mla":"Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack Problem.” <i>Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing  - STOC ’83</i>, 1983, doi:<a href=\"https://doi.org/10.1145/800061.808734\">10.1145/800061.808734</a>.","chicago":"Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack Problem.” In <i>Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing  - STOC ’83</i>, 1983. <a href=\"https://doi.org/10.1145/800061.808734\">https://doi.org/10.1145/800061.808734</a>.","short":"F. Meyer auf der Heide, in: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing  - STOC ’83, 1983.","apa":"Meyer auf der Heide, F. (1983). A polynomial linear search algorithm for the n-dimensional knapsack problem. In <i>Proceedings of the fifteenth annual ACM symposium on Theory of computing  - STOC ’83</i>. <a href=\"https://doi.org/10.1145/800061.808734\">https://doi.org/10.1145/800061.808734</a>","ieee":"F. Meyer auf der Heide, “A polynomial linear search algorithm for the n-dimensional knapsack problem,” in <i>Proceedings of the fifteenth annual ACM symposium on Theory of computing  - STOC ’83</i>, 1983."}},{"user_id":"15415","doi":"10.1007/bfb0036483","_id":"16810","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:52:56Z","publication_identifier":{"isbn":["3540119736"]},"author":[{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"year":"1983","title":"Efficiency of universal parallel computers","status":"public","department":[{"_id":"63"}],"type":"book_chapter","date_created":"2020-04-22T08:53:33Z","place":"Berlin/Heidelberg","citation":{"bibtex":"@inbook{Meyer auf der Heide_1983, place={Berlin/Heidelberg}, title={Efficiency of universal parallel computers}, DOI={<a href=\"https://doi.org/10.1007/bfb0036483\">10.1007/bfb0036483</a>}, booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1983} }","ama":"Meyer auf der Heide F. Efficiency of universal parallel computers. In: <i>Lecture Notes in Computer Science</i>. Berlin/Heidelberg; 1983. doi:<a href=\"https://doi.org/10.1007/bfb0036483\">10.1007/bfb0036483</a>","mla":"Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.” <i>Lecture Notes in Computer Science</i>, 1983, doi:<a href=\"https://doi.org/10.1007/bfb0036483\">10.1007/bfb0036483</a>.","short":"F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1983.","chicago":"Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.” In <i>Lecture Notes in Computer Science</i>. Berlin/Heidelberg, 1983. <a href=\"https://doi.org/10.1007/bfb0036483\">https://doi.org/10.1007/bfb0036483</a>.","ieee":"F. Meyer auf der Heide, “Efficiency of universal parallel computers,” in <i>Lecture Notes in Computer Science</i>, Berlin/Heidelberg, 1983.","apa":"Meyer auf der Heide, F. (1983). Efficiency of universal parallel computers. In <i>Lecture Notes in Computer Science</i>. Berlin/Heidelberg. <a href=\"https://doi.org/10.1007/bfb0036483\">https://doi.org/10.1007/bfb0036483</a>"},"publication":"Lecture Notes in Computer Science"},{"date_updated":"2022-01-06T07:03:46Z","author":[{"full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor","id":"107"},{"first_name":"Wilhelm","last_name":"Schäfer","full_name":"Schäfer, Wilhelm"}],"year":"1982","status":"public","title":"Specification of a Programming Support Environment by Graph Grammars","user_id":"52534","_id":"7811","publisher":"Hanser","language":[{"iso":"eng"}],"page":"47-62","citation":{"chicago":"Engels, Gregor, and Wilhelm Schäfer. “Specification of a Programming Support Environment by Graph Grammars.” In <i>Proceedings of the Conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany)</i>, 47–62. München/Leipzig: Hanser, 1982.","short":"G. Engels, W. Schäfer, in: Proceedings of the Conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany), Hanser, München/Leipzig, 1982, pp. 47–62.","ieee":"G. Engels and W. Schäfer, “Specification of a Programming Support Environment by Graph Grammars,” in <i>Proceedings of the conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany)</i>, 1982, pp. 47–62.","apa":"Engels, G., &#38; Schäfer, W. (1982). Specification of a Programming Support Environment by Graph Grammars. In <i>Proceedings of the conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany)</i> (pp. 47–62). München/Leipzig: Hanser.","bibtex":"@inproceedings{Engels_Schäfer_1982, place={München/Leipzig}, title={Specification of a Programming Support Environment by Graph Grammars}, booktitle={Proceedings of the conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany)}, publisher={Hanser}, author={Engels, Gregor and Schäfer, Wilhelm}, year={1982}, pages={47–62} }","ama":"Engels G, Schäfer W. Specification of a Programming Support Environment by Graph Grammars. In: <i>Proceedings of the Conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany)</i>. München/Leipzig: Hanser; 1982:47-62.","mla":"Engels, Gregor, and Wilhelm Schäfer. “Specification of a Programming Support Environment by Graph Grammars.” <i>Proceedings of the Conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany)</i>, Hanser, 1982, pp. 47–62."},"publication":"Proceedings of the conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany)","department":[{"_id":"66"}],"type":"conference","place":"München/Leipzig","date_created":"2019-02-20T13:37:37Z"},{"language":[{"iso":"eng"}],"_id":"7812","page":"254-270","volume":82,"user_id":"52534","author":[{"full_name":"Pletat, Udo","first_name":"Udo","last_name":"Pletat"},{"id":"107","full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"},{"full_name":"Ehrich, Hans-Dietrich","first_name":"Hans-Dietrich","last_name":"Ehrich"}],"year":"1982","status":"public","title":"An Operational Approach to Conditional Algebraic Specifications","intvolume":"        82","date_updated":"2022-01-06T07:03:46Z","date_created":"2019-02-20T13:39:05Z","department":[{"_id":"66"}],"type":"conference","citation":{"mla":"Pletat, Udo, et al. “An Operational Approach to Conditional Algebraic Specifications.” <i>Proceedings of the 7eme Colloque Sur Les Arbres En Algebre et En Programmation, Lille (France)</i>, vol. 82, 1982, pp. 254–70.","ama":"Pletat U, Engels G, Ehrich H-D. An Operational Approach to Conditional Algebraic Specifications. In: <i>Proceedings of the 7eme Colloque Sur Les Arbres En Algebre et En Programmation, Lille (France)</i>. Vol 82. ; 1982:254-270.","bibtex":"@inproceedings{Pletat_Engels_Ehrich_1982, title={An Operational Approach to Conditional Algebraic Specifications}, volume={82}, booktitle={Proceedings of the 7eme Colloque sur les Arbres en Algebre et en Programmation, Lille (France)}, author={Pletat, Udo and Engels, Gregor and Ehrich, Hans-Dietrich}, year={1982}, pages={254–270} }","apa":"Pletat, U., Engels, G., &#38; Ehrich, H.-D. (1982). An Operational Approach to Conditional Algebraic Specifications. In <i>Proceedings of the 7eme Colloque sur les Arbres en Algebre et en Programmation, Lille (France)</i> (Vol. 82, pp. 254–270).","ieee":"U. Pletat, G. Engels, and H.-D. Ehrich, “An Operational Approach to Conditional Algebraic Specifications,” in <i>Proceedings of the 7eme Colloque sur les Arbres en Algebre et en Programmation, Lille (France)</i>, 1982, vol. 82, pp. 254–270.","short":"U. Pletat, G. Engels, H.-D. Ehrich, in: Proceedings of the 7eme Colloque Sur Les Arbres En Algebre et En Programmation, Lille (France), 1982, pp. 254–270.","chicago":"Pletat, Udo, Gregor Engels, and Hans-Dietrich Ehrich. “An Operational Approach to Conditional Algebraic Specifications.” In <i>Proceedings of the 7eme Colloque Sur Les Arbres En Algebre et En Programmation, Lille (France)</i>, 82:254–70, 1982."},"publication":"Proceedings of the 7eme Colloque sur les Arbres en Algebre et en Programmation, Lille (France)","abstract":[{"lang":"eng","text":"We suppose to give conditional specifications of abstract data types hierarchically. Considering algebraic specifications from an operational point of view this approach enables us to present simple syntactic criteria for the Church-Rosser property, which implies the welldefinedness of the operational semantics of a conditional specification. Furthermore, these criteria are su?cient for the termination of the full substitution reduction strategy."}]},{"date_updated":"2022-01-06T07:03:51Z","title":"Handling Errors and Exceptions in the Algebraic Specifications of Data Types","status":"public","year":"1981","author":[{"id":"107","full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"},{"full_name":"Pletat, Udo","first_name":"Udo","last_name":"Pletat"},{"full_name":"Ehrich, Hans-Dietrich","first_name":"Hans-Dietrich","last_name":"Ehrich"}],"user_id":"52534","_id":"8184","publisher":"University of Osnabrück","language":[{"iso":"eng"}],"report_number":"OSM-I-3","citation":{"mla":"Engels, Gregor, et al. <i>Handling Errors and Exceptions in the Algebraic Specifications of Data Types</i>. University of Osnabrück, 1981.","bibtex":"@book{Engels_Pletat_Ehrich_1981, title={Handling Errors and Exceptions in the Algebraic Specifications of Data Types}, publisher={University of Osnabrück}, author={Engels, Gregor and Pletat, Udo and Ehrich, Hans-Dietrich}, year={1981} }","ama":"Engels G, Pletat U, Ehrich H-D. <i>Handling Errors and Exceptions in the Algebraic Specifications of Data Types</i>. University of Osnabrück; 1981.","ieee":"G. Engels, U. Pletat, and H.-D. Ehrich, <i>Handling Errors and Exceptions in the Algebraic Specifications of Data Types</i>. University of Osnabrück, 1981.","apa":"Engels, G., Pletat, U., &#38; Ehrich, H.-D. (1981). <i>Handling Errors and Exceptions in the Algebraic Specifications of Data Types</i>. University of Osnabrück.","short":"G. Engels, U. Pletat, H.-D. Ehrich, Handling Errors and Exceptions in the Algebraic Specifications of Data Types, University of Osnabrück, 1981.","chicago":"Engels, Gregor, Udo Pletat, and Hans-Dietrich Ehrich. <i>Handling Errors and Exceptions in the Algebraic Specifications of Data Types</i>. University of Osnabrück, 1981."},"type":"report","department":[{"_id":"66"}],"date_created":"2019-03-03T16:12:37Z"},{"date_created":"2019-03-03T16:12:38Z","department":[{"_id":"66"}],"type":"report","citation":{"chicago":"Pletat, Udo, Gregor Engels, and Hans-Dietrich Ehrich. <i>Operational Semantics of Algebraic Specifications with Conditional Equations</i>. University of Dortmund, Department of Computer Science, 1981.","short":"U. Pletat, G. Engels, H.-D. Ehrich, Operational Semantics of Algebraic Specifications with Conditional Equations, University of Dortmund, Department of Computer Science, 1981.","apa":"Pletat, U., Engels, G., &#38; Ehrich, H.-D. (1981). <i>Operational Semantics of Algebraic Specifications with Conditional Equations</i>. University of Dortmund, Department of Computer Science.","ieee":"U. Pletat, G. Engels, and H.-D. Ehrich, <i>Operational Semantics of Algebraic Specifications with Conditional Equations</i>. University of Dortmund, Department of Computer Science, 1981.","ama":"Pletat U, Engels G, Ehrich H-D. <i>Operational Semantics of Algebraic Specifications with Conditional Equations</i>. University of Dortmund, Department of Computer Science; 1981.","bibtex":"@book{Pletat_Engels_Ehrich_1981, title={Operational Semantics of Algebraic Specifications with Conditional Equations}, publisher={University of Dortmund, Department of Computer Science}, author={Pletat, Udo and Engels, Gregor and Ehrich, Hans-Dietrich}, year={1981} }","mla":"Pletat, Udo, et al. <i>Operational Semantics of Algebraic Specifications with Conditional Equations</i>. University of Dortmund, Department of Computer Science, 1981."},"report_number":"118","publisher":"University of Dortmund, Department of Computer Science","_id":"8185","language":[{"iso":"eng"}],"user_id":"52534","author":[{"first_name":"Udo","last_name":"Pletat","full_name":"Pletat, Udo"},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"},{"full_name":"Ehrich, Hans-Dietrich","first_name":"Hans-Dietrich","last_name":"Ehrich"}],"year":"1981","title":"Operational Semantics of Algebraic Specifications with Conditional Equations","status":"public","date_updated":"2022-01-06T07:03:51Z"},{"type":"book_chapter","department":[{"_id":"63"}],"place":"Berlin, Heidelberg","date_created":"2020-04-22T09:03:21Z","publication":"Fundamentals of Computation Theory","citation":{"mla":"Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines and Straight-Line Programs.” <i>Fundamentals of Computation Theory</i>, 1981, doi:<a href=\"https://doi.org/10.1007/3-540-10854-8_29\">10.1007/3-540-10854-8_29</a>.","ama":"Meyer auf der Heide F, Rollik A. Random access machines and straight-line programs. In: <i>Fundamentals of Computation Theory</i>. Berlin, Heidelberg; 1981. doi:<a href=\"https://doi.org/10.1007/3-540-10854-8_29\">10.1007/3-540-10854-8_29</a>","bibtex":"@inbook{Meyer auf der Heide_Rollik_1981, place={Berlin, Heidelberg}, title={Random access machines and straight-line programs}, DOI={<a href=\"https://doi.org/10.1007/3-540-10854-8_29\">10.1007/3-540-10854-8_29</a>}, booktitle={Fundamentals of Computation Theory}, author={Meyer auf der Heide, Friedhelm and Rollik, Anton}, year={1981} }","apa":"Meyer auf der Heide, F., &#38; Rollik, A. (1981). Random access machines and straight-line programs. In <i>Fundamentals of Computation Theory</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-10854-8_29\">https://doi.org/10.1007/3-540-10854-8_29</a>","ieee":"F. Meyer auf der Heide and A. Rollik, “Random access machines and straight-line programs,” in <i>Fundamentals of Computation Theory</i>, Berlin, Heidelberg, 1981.","chicago":"Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines and Straight-Line Programs.” In <i>Fundamentals of Computation Theory</i>. Berlin, Heidelberg, 1981. <a href=\"https://doi.org/10.1007/3-540-10854-8_29\">https://doi.org/10.1007/3-540-10854-8_29</a>.","short":"F. Meyer auf der Heide, A. Rollik, in: Fundamentals of Computation Theory, Berlin, Heidelberg, 1981."},"doi":"10.1007/3-540-10854-8_29","user_id":"15415","language":[{"iso":"eng"}],"_id":"16813","date_updated":"2022-01-06T06:52:56Z","publication_status":"published","status":"public","title":"Random access machines and straight-line programs","year":"1981","publication_identifier":{"isbn":["9783540108542","9783540387657"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"full_name":"Rollik, Anton","first_name":"Anton","last_name":"Rollik"}]},{"publication":"Lecture Notes in Computer Science","citation":{"apa":"Meyer auf der Heide, F. (1981). Time-processor trade-offs for universal parallel computers. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-10856-4_111\">https://doi.org/10.1007/3-540-10856-4_111</a>","ieee":"F. Meyer auf der Heide, “Time-processor trade-offs for universal parallel computers,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1981.","short":"F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1981.","chicago":"Meyer auf der Heide, Friedhelm. “Time-Processor Trade-Offs for Universal Parallel Computers.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 1981. <a href=\"https://doi.org/10.1007/3-540-10856-4_111\">https://doi.org/10.1007/3-540-10856-4_111</a>.","mla":"Meyer auf der Heide, Friedhelm. “Time-Processor Trade-Offs for Universal Parallel Computers.” <i>Lecture Notes in Computer Science</i>, 1981, doi:<a href=\"https://doi.org/10.1007/3-540-10856-4_111\">10.1007/3-540-10856-4_111</a>.","ama":"Meyer auf der Heide F. Time-processor trade-offs for universal parallel computers. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1981. doi:<a href=\"https://doi.org/10.1007/3-540-10856-4_111\">10.1007/3-540-10856-4_111</a>","bibtex":"@inbook{Meyer auf der Heide_1981, place={Berlin, Heidelberg}, title={Time-processor trade-offs for universal parallel computers}, DOI={<a href=\"https://doi.org/10.1007/3-540-10856-4_111\">10.1007/3-540-10856-4_111</a>}, booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1981} }"},"type":"book_chapter","department":[{"_id":"63"}],"place":"Berlin, Heidelberg","date_created":"2020-04-22T09:05:15Z","date_updated":"2022-01-06T06:52:56Z","publication_status":"published","status":"public","year":"1981","title":"Time-processor trade-offs for universal parallel computers","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540108566","9783540387695"]},"doi":"10.1007/3-540-10856-4_111","user_id":"15415","_id":"16814","language":[{"iso":"eng"}]},{"publication_identifier":{"issn":["0304-3975"]},"author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"title":"A comparison of two variations of a pebble game on graphs","status":"public","year":"1981","date_updated":"2022-01-06T06:52:56Z","publication_status":"published","_id":"16820","language":[{"iso":"eng"}],"page":"315-322","doi":"10.1016/s0304-3975(81)80004-7","user_id":"15415","citation":{"apa":"Meyer auf der Heide, F. (1981). A comparison of two variations of a pebble game on graphs. <i>Theoretical Computer Science</i>, 315–322. <a href=\"https://doi.org/10.1016/s0304-3975(81)80004-7\">https://doi.org/10.1016/s0304-3975(81)80004-7</a>","ieee":"F. Meyer auf der Heide, “A comparison of two variations of a pebble game on graphs,” <i>Theoretical Computer Science</i>, pp. 315–322, 1981.","short":"F. Meyer auf der Heide, Theoretical Computer Science (1981) 315–322.","chicago":"Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.” <i>Theoretical Computer Science</i>, 1981, 315–22. <a href=\"https://doi.org/10.1016/s0304-3975(81)80004-7\">https://doi.org/10.1016/s0304-3975(81)80004-7</a>.","mla":"Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.” <i>Theoretical Computer Science</i>, 1981, pp. 315–22, doi:<a href=\"https://doi.org/10.1016/s0304-3975(81)80004-7\">10.1016/s0304-3975(81)80004-7</a>.","ama":"Meyer auf der Heide F. A comparison of two variations of a pebble game on graphs. <i>Theoretical Computer Science</i>. 1981:315-322. doi:<a href=\"https://doi.org/10.1016/s0304-3975(81)80004-7\">10.1016/s0304-3975(81)80004-7</a>","bibtex":"@article{Meyer auf der Heide_1981, title={A comparison of two variations of a pebble game on graphs}, DOI={<a href=\"https://doi.org/10.1016/s0304-3975(81)80004-7\">10.1016/s0304-3975(81)80004-7</a>}, journal={Theoretical Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1981}, pages={315–322} }"},"publication":"Theoretical Computer Science","date_created":"2020-04-22T09:33:31Z","department":[{"_id":"63"}],"type":"journal_article"},{"author":[{"first_name":"P.","last_name":"Klein","full_name":"Klein, P."},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"publication_identifier":{"isbn":["9783540103882","9783642678387"],"issn":["0343-3005"]},"status":"public","title":"Untere Zeitschranken für das Rucksack-Problem","year":"1980","date_updated":"2022-01-06T06:52:56Z","publication_status":"published","_id":"16815","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-67838-7_34","user_id":"15415","citation":{"apa":"Klein, P., &#38; Meyer auf der Heide, F. (1980). Untere Zeitschranken für das Rucksack-Problem. In <i>GI - 10. Jahrestagung</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-67838-7_34\">https://doi.org/10.1007/978-3-642-67838-7_34</a>","ieee":"P. Klein and F. Meyer auf der Heide, “Untere Zeitschranken für das Rucksack-Problem,” in <i>GI - 10. Jahrestagung</i>, Berlin, Heidelberg, 1980.","chicago":"Klein, P., and Friedhelm Meyer auf der Heide. “Untere Zeitschranken Für Das Rucksack-Problem.” In <i>GI - 10. Jahrestagung</i>. Berlin, Heidelberg, 1980. <a href=\"https://doi.org/10.1007/978-3-642-67838-7_34\">https://doi.org/10.1007/978-3-642-67838-7_34</a>.","short":"P. Klein, F. Meyer auf der Heide, in: GI - 10. Jahrestagung, Berlin, Heidelberg, 1980.","mla":"Klein, P., and Friedhelm Meyer auf der Heide. “Untere Zeitschranken Für Das Rucksack-Problem.” <i>GI - 10. Jahrestagung</i>, 1980, doi:<a href=\"https://doi.org/10.1007/978-3-642-67838-7_34\">10.1007/978-3-642-67838-7_34</a>.","ama":"Klein P, Meyer auf der Heide F. Untere Zeitschranken für das Rucksack-Problem. In: <i>GI - 10. Jahrestagung</i>. Berlin, Heidelberg; 1980. doi:<a href=\"https://doi.org/10.1007/978-3-642-67838-7_34\">10.1007/978-3-642-67838-7_34</a>","bibtex":"@inbook{Klein_Meyer auf der Heide_1980, place={Berlin, Heidelberg}, title={Untere Zeitschranken für das Rucksack-Problem}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-67838-7_34\">10.1007/978-3-642-67838-7_34</a>}, booktitle={GI - 10. Jahrestagung}, author={Klein, P. and Meyer auf der Heide, Friedhelm}, year={1980} }"},"publication":"GI - 10. Jahrestagung","place":"Berlin, Heidelberg","date_created":"2020-04-22T09:06:48Z","department":[{"_id":"63"}],"type":"book_chapter"},{"publication":"Automata, Languages and Programming. ICALP 1979","citation":{"mla":"Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.” <i>Automata, Languages and Programming. ICALP 1979</i>, 1979, pp. 411–21, doi:<a href=\"https://doi.org/10.1007/3-540-09510-1_32 \">10.1007/3-540-09510-1_32 </a>.","ama":"Meyer auf der Heide F. A comparison of two variations of a pebble game on graphs. <i>Automata, Languages and Programming ICALP 1979</i>. 1979:411-421. doi:<a href=\"https://doi.org/10.1007/3-540-09510-1_32 \">10.1007/3-540-09510-1_32 </a>","bibtex":"@article{Meyer auf der Heide_1979, title={A comparison of two variations of a pebble game on graphs}, DOI={<a href=\"https://doi.org/10.1007/3-540-09510-1_32 \">10.1007/3-540-09510-1_32 </a>}, journal={Automata, Languages and Programming. ICALP 1979}, author={Meyer auf der Heide, Friedhelm}, year={1979}, pages={411–421} }","apa":"Meyer auf der Heide, F. (1979). A comparison of two variations of a pebble game on graphs. <i>Automata, Languages and Programming. ICALP 1979</i>, 411–421. <a href=\"https://doi.org/10.1007/3-540-09510-1_32 \">https://doi.org/10.1007/3-540-09510-1_32 </a>","ieee":"F. Meyer auf der Heide, “A comparison of two variations of a pebble game on graphs,” <i>Automata, Languages and Programming. ICALP 1979</i>, pp. 411–421, 1979.","chicago":"Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.” <i>Automata, Languages and Programming. ICALP 1979</i>, 1979, 411–21. <a href=\"https://doi.org/10.1007/3-540-09510-1_32 \">https://doi.org/10.1007/3-540-09510-1_32 </a>.","short":"F. Meyer auf der Heide, Automata, Languages and Programming. ICALP 1979 (1979) 411–421."},"date_created":"2020-04-22T09:02:08Z","type":"journal_article","department":[{"_id":"63"}],"year":"1979","status":"public","title":"A comparison of two variations of a pebble game on graphs","author":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"publication_status":"published","date_updated":"2022-01-06T06:52:56Z","page":"411-421","language":[{"iso":"eng"}],"_id":"16812","user_id":"15415","doi":"10.1007/3-540-09510-1_32 "}]