Transforming comparison model lower bounds to the parallel-random-access-machine

D. Breslauer, A. Czumaj, D.P. Dubhashi, F. Meyer auf der Heide, Information Processing Letters (1997) 103–110.

Download
No fulltext has been uploaded.
Journal Article | Published | English
Author
; ; ;
Publishing Year
Journal Title
Information Processing Letters
Page
103-110
ISSN
LibreCat-ID

Cite this

Breslauer D, Czumaj A, Dubhashi DP, Meyer auf der Heide F. Transforming comparison model lower bounds to the parallel-random-access-machine. Information Processing Letters. 1997:103-110. doi:10.1016/s0020-0190(97)00032-x
Breslauer, D., Czumaj, A., Dubhashi, D. P., & Meyer auf der Heide, F. (1997). Transforming comparison model lower bounds to the parallel-random-access-machine. Information Processing Letters, 103–110. https://doi.org/10.1016/s0020-0190(97)00032-x
@article{Breslauer_Czumaj_Dubhashi_Meyer auf der Heide_1997, title={Transforming comparison model lower bounds to the parallel-random-access-machine}, DOI={10.1016/s0020-0190(97)00032-x}, journal={Information Processing Letters}, author={Breslauer, Dany and Czumaj, Artur and Dubhashi, Devdatt P. and Meyer auf der Heide, Friedhelm}, year={1997}, pages={103–110} }
Breslauer, Dany, Artur Czumaj, Devdatt P. Dubhashi, and Friedhelm Meyer auf der Heide. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.” Information Processing Letters, 1997, 103–10. https://doi.org/10.1016/s0020-0190(97)00032-x.
D. Breslauer, A. Czumaj, D. P. Dubhashi, and F. Meyer auf der Heide, “Transforming comparison model lower bounds to the parallel-random-access-machine,” Information Processing Letters, pp. 103–110, 1997.
Breslauer, Dany, et al. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.” Information Processing Letters, 1997, pp. 103–10, doi:10.1016/s0020-0190(97)00032-x.

Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar