[{"publication":"25th Annual Symposium onFoundations of Computer Science, 1984.","citation":{"mla":"Meyer auf der Heide, Friedhelm, and R. Reischuk. “On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication.” <i>25th Annual Symposium OnFoundations of Computer Science, 1984.</i>, 1984, doi:<a href=\"https://doi.org/10.1109/sfcs.1984.715901\">10.1109/sfcs.1984.715901</a>.","bibtex":"@inproceedings{Meyer auf der Heide_Reischuk_1984, title={On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication}, DOI={<a href=\"https://doi.org/10.1109/sfcs.1984.715901\">10.1109/sfcs.1984.715901</a>}, booktitle={25th Annual Symposium onFoundations of Computer Science, 1984.}, author={Meyer auf der Heide, Friedhelm and Reischuk, R.}, year={1984} }","ama":"Meyer auf der Heide F, Reischuk R. On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication. In: <i>25th Annual Symposium OnFoundations of Computer Science, 1984.</i> ; 1984. doi:<a href=\"https://doi.org/10.1109/sfcs.1984.715901\">10.1109/sfcs.1984.715901</a>","ieee":"F. Meyer auf der Heide and R. Reischuk, “On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication,” in <i>25th Annual Symposium onFoundations of Computer Science, 1984.</i>, 1984.","apa":"Meyer auf der Heide, F., &#38; Reischuk, R. (1984). On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication. In <i>25th Annual Symposium onFoundations of Computer Science, 1984.</i> <a href=\"https://doi.org/10.1109/sfcs.1984.715901\">https://doi.org/10.1109/sfcs.1984.715901</a>","short":"F. Meyer auf der Heide, R. Reischuk, in: 25th Annual Symposium OnFoundations of Computer Science, 1984., 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 <i>25th Annual Symposium OnFoundations of Computer Science, 1984.</i>, 1984. <a href=\"https://doi.org/10.1109/sfcs.1984.715901\">https://doi.org/10.1109/sfcs.1984.715901</a>."},"date_created":"2020-04-21T11:27:07Z","type":"conference","department":[{"_id":"63"}],"title":"On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication","year":"1984","status":"public","publication_identifier":{"isbn":["081860591X"]},"author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Reischuk","first_name":"R.","full_name":"Reischuk, R."}],"publication_status":"published","date_updated":"2022-01-06T06:52:56Z","language":[{"iso":"eng"}],"_id":"16786","user_id":"15415","doi":"10.1109/sfcs.1984.715901"},{"_id":"16787","language":[{"iso":"eng"}],"doi":"10.1007/3-540-12920-0_20","user_id":"15415","title":"Efficient simulations among several models of parallel computers (extended abstract)","status":"public","year":"1984","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540129202","9783540388050"]},"author":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"date_updated":"2022-01-06T06:52:56Z","publication_status":"published","place":"Berlin, Heidelberg","date_created":"2020-04-21T11:28:40Z","type":"book_chapter","department":[{"_id":"63"}],"publication":"STACS 84","citation":{"ama":"Meyer auf der Heide F. Efficient simulations among several models of parallel computers (extended abstract). In: <i>STACS 84</i>. Berlin, Heidelberg; 1984. doi:<a href=\"https://doi.org/10.1007/3-540-12920-0_20\">10.1007/3-540-12920-0_20</a>","bibtex":"@inbook{Meyer auf der Heide_1984, place={Berlin, Heidelberg}, title={Efficient simulations among several models of parallel computers (extended abstract)}, DOI={<a href=\"https://doi.org/10.1007/3-540-12920-0_20\">10.1007/3-540-12920-0_20</a>}, booktitle={STACS 84}, author={Meyer auf der Heide, Friedhelm}, year={1984} }","mla":"Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers (Extended Abstract).” <i>STACS 84</i>, 1984, doi:<a href=\"https://doi.org/10.1007/3-540-12920-0_20\">10.1007/3-540-12920-0_20</a>.","short":"F. Meyer auf der Heide, in: STACS 84, Berlin, Heidelberg, 1984.","chicago":"Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers (Extended Abstract).” In <i>STACS 84</i>. Berlin, Heidelberg, 1984. <a href=\"https://doi.org/10.1007/3-540-12920-0_20\">https://doi.org/10.1007/3-540-12920-0_20</a>.","apa":"Meyer auf der Heide, F. (1984). Efficient simulations among several models of parallel computers (extended abstract). In <i>STACS 84</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-12920-0_20\">https://doi.org/10.1007/3-540-12920-0_20</a>","ieee":"F. Meyer auf der Heide, “Efficient simulations among several models of parallel computers (extended abstract),” in <i>STACS 84</i>, Berlin, Heidelberg, 1984."}},{"date_created":"2020-04-22T08:48:20Z","department":[{"_id":"63"}],"type":"journal_article","citation":{"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>.","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>","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} }","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>","ieee":"F. Meyer auf der Heide, “Efficiency of universal parallel computers,” <i>Acta Informatica</i>, pp. 269–296, 1983.","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>.","short":"F. Meyer auf der Heide, Acta Informatica (1983) 269–296."},"publication":"Acta Informatica","language":[{"iso":"eng"}],"_id":"16806","page":"269-296","doi":"10.1007/bf00265559","user_id":"15415","publication_identifier":{"issn":["0001-5903","1432-0525"]},"author":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"title":"Efficiency of universal parallel computers","status":"public","year":"1983","date_updated":"2022-01-06T06:52:56Z","publication_status":"published"},{"publication_identifier":{"issn":["0001-5903","1432-0525"]},"author":[{"full_name":"Klein, Peter","last_name":"Klein","first_name":"Peter"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"title":"A lower time bound for the knapsack problem on random access machines","year":"1983","status":"public","date_updated":"2022-01-06T06:52:56Z","publication_status":"published","_id":"16807","language":[{"iso":"eng"}],"page":"385-395","doi":"10.1007/bf00290735","user_id":"15415","citation":{"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>","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>."},"publication":"Acta Informatica","date_created":"2020-04-22T08:49:58Z","department":[{"_id":"63"}],"type":"journal_article"},{"language":[{"iso":"eng"}],"_id":"16808","page":"1-2","user_id":"15415","doi":"10.1016/0020-0190(83)90001-7","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"publication_identifier":{"issn":["0020-0190"]},"status":"public","year":"1983","title":"Infinite cube-connected cycles","publication_status":"published","date_updated":"2022-01-06T06:52:56Z","date_created":"2020-04-22T08:51:01Z","department":[{"_id":"63"}],"type":"journal_article","citation":{"ieee":"F. Meyer auf der Heide, “Infinite cube-connected cycles,” <i>Information Processing Letters</i>, pp. 1–2, 1983.","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>","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>.","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} }","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>"},"publication":"Information Processing Letters"},{"title":"A polynomial linear search algorithm for the n-dimensional knapsack problem","year":"1983","status":"public","author":[{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"publication_identifier":{"isbn":["0897910990"]},"date_updated":"2022-01-06T06:52:56Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"16809","doi":"10.1145/800061.808734","user_id":"15415","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."},"date_created":"2020-04-22T08:52:15Z","type":"conference","department":[{"_id":"63"}]},{"date_updated":"2022-01-06T06:52:56Z","publication_status":"published","title":"Efficiency of universal parallel computers","status":"public","year":"1983","author":[{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"publication_identifier":{"isbn":["3540119736"]},"doi":"10.1007/bfb0036483","user_id":"15415","language":[{"iso":"eng"}],"_id":"16810","publication":"Lecture Notes in Computer Science","citation":{"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>","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>.","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>.","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>"},"type":"book_chapter","department":[{"_id":"63"}],"place":"Berlin/Heidelberg","date_created":"2020-04-22T08:53:33Z"},{"doi":"10.1007/3-540-10854-8_29","user_id":"15415","_id":"16813","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:56Z","publication_status":"published","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Rollik, Anton","last_name":"Rollik","first_name":"Anton"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540108542","9783540387657"]},"status":"public","year":"1981","title":"Random access machines and straight-line programs","department":[{"_id":"63"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_created":"2020-04-22T09:03:21Z","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."},"publication":"Fundamentals of Computation Theory"},{"citation":{"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.","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>","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>.","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} }","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>"},"publication":"Lecture Notes in Computer Science","department":[{"_id":"63"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_created":"2020-04-22T09:05:15Z","date_updated":"2022-01-06T06:52:56Z","publication_status":"published","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"publication_identifier":{"isbn":["9783540108566","9783540387695"],"issn":["0302-9743","1611-3349"]},"year":"1981","title":"Time-processor trade-offs for universal parallel computers","status":"public","doi":"10.1007/3-540-10856-4_111","user_id":"15415","language":[{"iso":"eng"}],"_id":"16814"},{"doi":"10.1016/s0304-3975(81)80004-7","user_id":"15415","_id":"16820","language":[{"iso":"eng"}],"page":"315-322","date_updated":"2022-01-06T06:52:56Z","publication_status":"published","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","department":[{"_id":"63"}],"type":"journal_article","date_created":"2020-04-22T09:33:31Z","citation":{"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} }","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>.","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>.","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."},"publication":"Theoretical Computer Science"},{"department":[{"_id":"63"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_created":"2020-04-22T09:06:48Z","citation":{"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.","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>","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>.","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} }","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>"},"publication":"GI - 10. Jahrestagung","doi":"10.1007/978-3-642-67838-7_34","user_id":"15415","_id":"16815","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:56Z","publication_status":"published","publication_identifier":{"issn":["0343-3005"],"isbn":["9783540103882","9783642678387"]},"author":[{"full_name":"Klein, P.","first_name":"P.","last_name":"Klein"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"status":"public","year":"1980","title":"Untere Zeitschranken für das Rucksack-Problem"},{"citation":{"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.","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.","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} }","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>."},"publication":"Automata, Languages and Programming. ICALP 1979","date_created":"2020-04-22T09:02:08Z","department":[{"_id":"63"}],"type":"journal_article","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"title":"A comparison of two variations of a pebble game on graphs","year":"1979","status":"public","publication_status":"published","date_updated":"2022-01-06T06:52:56Z","_id":"16812","language":[{"iso":"eng"}],"page":"411-421","user_id":"15415","doi":"10.1007/3-540-09510-1_32 "}]