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