{"year":"1995","status":"public","title":"Transforming comparison model lower bounds to the parallel-random-access-machine","publication_identifier":{"issn":["0020-0190"]},"author":[{"full_name":"Breslauer, Dany","last_name":"Breslauer","first_name":"Dany"},{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"},{"last_name":"Dubhashi","first_name":"Devdatt P.","full_name":"Dubhashi, Devdatt P."},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"publication_status":"published","date_updated":"2022-01-06T06:52:52Z","page":"103-110","language":[{"iso":"eng"}],"_id":"16566","user_id":"15415","doi":"10.1016/s0020-0190(97)00032-x","publication":"Information Processing Letters","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.","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>","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>.","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} }","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.","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>."},"date_created":"2020-04-15T11:28:35Z","type":"journal_article","department":[{"_id":"63"}]}