[{"intvolume":"        66","date_updated":"2022-01-06T06:56:19Z","author":[{"id":"15273","full_name":"Simon, Jens","first_name":"Jens","last_name":"Simon"},{"first_name":"Jens-Michael","last_name":"Wierum","full_name":"Wierum, Jens-Michael"}],"publication_identifier":{"issn":["0020-0190"]},"title":"The Latency-of-Data-Access model for Analyzing Parallel Computation","year":"1998","status":"public","volume":66,"doi":"10.1016/S0020-0190(98)00062-3","user_id":"24135","_id":"2437","publisher":"Elsevier","page":"255-261","citation":{"ieee":"J. Simon and J.-M. Wierum, “The Latency-of-Data-Access model for Analyzing Parallel Computation,” <i>Information Processing Letters - Special Issue on Models of Computation</i>, vol. 66, no. 5, pp. 255–261, 1998.","apa":"Simon, J., &#38; Wierum, J.-M. (1998). The Latency-of-Data-Access model for Analyzing Parallel Computation. <i>Information Processing Letters - Special Issue on Models of Computation</i>, <i>66</i>(5), 255–261. <a href=\"https://doi.org/10.1016/S0020-0190(98)00062-3\">https://doi.org/10.1016/S0020-0190(98)00062-3</a>","chicago":"Simon, Jens, and Jens-Michael Wierum. “The Latency-of-Data-Access Model for Analyzing Parallel Computation.” <i>Information Processing Letters - Special Issue on Models of Computation</i> 66, no. 5 (1998): 255–61. <a href=\"https://doi.org/10.1016/S0020-0190(98)00062-3\">https://doi.org/10.1016/S0020-0190(98)00062-3</a>.","short":"J. Simon, J.-M. Wierum, Information Processing Letters - Special Issue on Models of Computation 66 (1998) 255–261.","mla":"Simon, Jens, and Jens-Michael Wierum. “The Latency-of-Data-Access Model for Analyzing Parallel Computation.” <i>Information Processing Letters - Special Issue on Models of Computation</i>, vol. 66, no. 5, Elsevier, 1998, pp. 255–61, doi:<a href=\"https://doi.org/10.1016/S0020-0190(98)00062-3\">10.1016/S0020-0190(98)00062-3</a>.","bibtex":"@article{Simon_Wierum_1998, title={The Latency-of-Data-Access model for Analyzing Parallel Computation}, volume={66}, DOI={<a href=\"https://doi.org/10.1016/S0020-0190(98)00062-3\">10.1016/S0020-0190(98)00062-3</a>}, number={5}, journal={Information Processing Letters - Special Issue on Models of Computation}, publisher={Elsevier}, author={Simon, Jens and Wierum, Jens-Michael}, year={1998}, pages={255–261} }","ama":"Simon J, Wierum J-M. The Latency-of-Data-Access model for Analyzing Parallel Computation. <i>Information Processing Letters - Special Issue on Models of Computation</i>. 1998;66(5):255-261. doi:<a href=\"https://doi.org/10.1016/S0020-0190(98)00062-3\">10.1016/S0020-0190(98)00062-3</a>"},"issue":"5","publication":"Information Processing Letters - Special Issue on Models of Computation","department":[{"_id":"27"}],"type":"journal_article","date_created":"2018-04-17T16:09:51Z"},{"publication_identifier":{"issn":["0020-0190"]},"author":[{"full_name":"Breslauer, Dany","last_name":"Breslauer","first_name":"Dany"},{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"first_name":"Devdatt P.","last_name":"Dubhashi","full_name":"Dubhashi, Devdatt P."},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"title":"Transforming comparison model lower bounds to the parallel-random-access-machine","status":"public","year":"1995","publication_status":"published","date_updated":"2022-01-06T06:52:52Z","_id":"16566","language":[{"iso":"eng"}],"page":"103-110","user_id":"15415","doi":"10.1016/s0020-0190(97)00032-x","citation":{"ieee":"D. Breslauer, A. Czumaj, D. P. Dubhashi, and F. Meyer auf der Heide, “Transforming comparison model lower bounds to the parallel-random-access-machine,” <i>Information Processing Letters</i>, pp. 103–110, 1995.","mla":"Breslauer, Dany, et al. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.” <i>Information Processing Letters</i>, 1995, pp. 103–10, doi:<a href=\"https://doi.org/10.1016/s0020-0190(97)00032-x\">10.1016/s0020-0190(97)00032-x</a>.","apa":"Breslauer, D., Czumaj, A., Dubhashi, D. P., &#38; Meyer auf der Heide, F. (1995). Transforming comparison model lower bounds to the parallel-random-access-machine. <i>Information Processing Letters</i>, 103–110. <a href=\"https://doi.org/10.1016/s0020-0190(97)00032-x\">https://doi.org/10.1016/s0020-0190(97)00032-x</a>","bibtex":"@article{Breslauer_Czumaj_Dubhashi_Meyer auf der Heide_1995, title={Transforming comparison model lower bounds to the parallel-random-access-machine}, DOI={<a href=\"https://doi.org/10.1016/s0020-0190(97)00032-x\">10.1016/s0020-0190(97)00032-x</a>}, journal={Information Processing Letters}, author={Breslauer, Dany and Czumaj, Artur and Dubhashi, Devdatt P. and Meyer auf der Heide, Friedhelm}, year={1995}, pages={103–110} }","chicago":"Breslauer, Dany, Artur Czumaj, Devdatt P. Dubhashi, and Friedhelm Meyer auf der Heide. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.” <i>Information Processing Letters</i>, 1995, 103–10. <a href=\"https://doi.org/10.1016/s0020-0190(97)00032-x\">https://doi.org/10.1016/s0020-0190(97)00032-x</a>.","ama":"Breslauer D, Czumaj A, Dubhashi DP, Meyer auf der Heide F. Transforming comparison model lower bounds to the parallel-random-access-machine. <i>Information Processing Letters</i>. 1995:103-110. doi:<a href=\"https://doi.org/10.1016/s0020-0190(97)00032-x\">10.1016/s0020-0190(97)00032-x</a>","short":"D. Breslauer, A. Czumaj, D.P. Dubhashi, F. Meyer auf der Heide, Information Processing Letters (1995) 103–110."},"publication":"Information Processing Letters","date_created":"2020-04-15T11:28:35Z","department":[{"_id":"63"}],"type":"journal_article"},{"department":[{"_id":"63"}],"type":"journal_article","date_created":"2020-04-21T10:15:46Z","citation":{"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} }","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>","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.","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.","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>"},"publication":"Information Processing Letters","doi":"10.1016/0020-0190(85)90042-0","user_id":"15415","language":[{"iso":"eng"}],"_id":"16779","page":"101-105","date_updated":"2022-01-06T06:52:55Z","publication_status":"published","publication_identifier":{"issn":["0020-0190"]},"author":[{"first_name":"Clemens","last_name":"Lautemann","full_name":"Lautemann, Clemens"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"status":"public","year":"1985","title":"Lower time bounds for integer programming with two variables"},{"type":"journal_article","department":[{"_id":"63"}],"date_created":"2020-04-22T08:51:01Z","publication":"Information Processing Letters","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>"},"doi":"10.1016/0020-0190(83)90001-7","user_id":"15415","page":"1-2","_id":"16808","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:56Z","publication_status":"published","year":"1983","status":"public","title":"Infinite cube-connected cycles","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"publication_identifier":{"issn":["0020-0190"]}}]