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