{"department":[{"_id":"63"}],"citation":{"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.","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>","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} }","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>.","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>.","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>","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."},"user_id":"15415","doi":"10.1145/22145.22151","publication_status":"published","date_updated":"2022-01-06T06:52:55Z","status":"public","author":[{"last_name":"Fich","full_name":"Fich, F E","first_name":"F E"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"full_name":"Ragde, P","last_name":"Ragde","first_name":"P"},{"full_name":"Wigderson, A","last_name":"Wigderson","first_name":"A"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["0897911512"]},"_id":"16783","year":"1985","type":"conference","publication":"Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC '85","date_created":"2020-04-21T11:20:53Z","title":"One, two, three . . . infinity: lower bounds for parallel computation"}