[{"citation":{"apa":"Meyer auf der Heide, F., &#38; Wigderson, A. (1985). The complexity of parallel sorting. In <i>26th Annual Symposium on Foundations of Computer Science (sfcs 1985)</i>. <a href=\"https://doi.org/10.1109/sfcs.1985.58\">https://doi.org/10.1109/sfcs.1985.58</a>","bibtex":"@inproceedings{Meyer auf der Heide_Wigderson_1985, title={The complexity of parallel sorting}, DOI={<a href=\"https://doi.org/10.1109/sfcs.1985.58\">10.1109/sfcs.1985.58</a>}, booktitle={26th Annual Symposium on Foundations of Computer Science (sfcs 1985)}, author={Meyer auf der Heide, Friedhelm and Wigderson, Avi}, year={1985} }","mla":"Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.” <i>26th Annual Symposium on Foundations of Computer Science (Sfcs 1985)</i>, 1985, doi:<a href=\"https://doi.org/10.1109/sfcs.1985.58\">10.1109/sfcs.1985.58</a>.","short":"F. Meyer auf der Heide, A. Wigderson, in: 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985.","ama":"Meyer auf der Heide F, Wigderson A. The complexity of parallel sorting. In: <i>26th Annual Symposium on Foundations of Computer Science (Sfcs 1985)</i>. ; 1985. doi:<a href=\"https://doi.org/10.1109/sfcs.1985.58\">10.1109/sfcs.1985.58</a>","ieee":"F. Meyer auf der Heide and A. Wigderson, “The complexity of parallel sorting,” in <i>26th Annual Symposium on Foundations of Computer Science (sfcs 1985)</i>, 1985.","chicago":"Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.” In <i>26th Annual Symposium on Foundations of Computer Science (Sfcs 1985)</i>, 1985. <a href=\"https://doi.org/10.1109/sfcs.1985.58\">https://doi.org/10.1109/sfcs.1985.58</a>."},"year":"1985","publication_identifier":{"isbn":["0818606444"]},"publication_status":"published","doi":"10.1109/sfcs.1985.58","title":"The complexity of parallel sorting","date_created":"2020-04-21T11:19:34Z","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Avi","full_name":"Wigderson, Avi","last_name":"Wigderson"}],"date_updated":"2022-01-06T06:52:55Z","status":"public","publication":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16782"},{"year":"1985","citation":{"chicago":"Meyer auf der Heide, Friedhelm. “Nondeterministic versus Probabilistic Linear Search Algorithms.” In <i>26th Annual Symposium on Foundations of Computer Science (Sfcs 1985)</i>, 1985. <a href=\"https://doi.org/10.1109/sfcs.1985.38\">https://doi.org/10.1109/sfcs.1985.38</a>.","ieee":"F. Meyer auf der Heide, “Nondeterministic versus probabilistic linear search algorithms,” in <i>26th Annual Symposium on Foundations of Computer Science (sfcs 1985)</i>, 1985.","ama":"Meyer auf der Heide F. Nondeterministic versus probabilistic linear search algorithms. In: <i>26th Annual Symposium on Foundations of Computer Science (Sfcs 1985)</i>. ; 1985. doi:<a href=\"https://doi.org/10.1109/sfcs.1985.38\">10.1109/sfcs.1985.38</a>","apa":"Meyer auf der Heide, F. (1985). Nondeterministic versus probabilistic linear search algorithms. In <i>26th Annual Symposium on Foundations of Computer Science (sfcs 1985)</i>. <a href=\"https://doi.org/10.1109/sfcs.1985.38\">https://doi.org/10.1109/sfcs.1985.38</a>","mla":"Meyer auf der Heide, Friedhelm. “Nondeterministic versus Probabilistic Linear Search Algorithms.” <i>26th Annual Symposium on Foundations of Computer Science (Sfcs 1985)</i>, 1985, doi:<a href=\"https://doi.org/10.1109/sfcs.1985.38\">10.1109/sfcs.1985.38</a>.","bibtex":"@inproceedings{Meyer auf der Heide_1985, title={Nondeterministic versus probabilistic linear search algorithms}, DOI={<a href=\"https://doi.org/10.1109/sfcs.1985.38\">10.1109/sfcs.1985.38</a>}, booktitle={26th Annual Symposium on Foundations of Computer Science (sfcs 1985)}, author={Meyer auf der Heide, Friedhelm}, year={1985} }","short":"F. Meyer auf der Heide, in: 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985."},"publication_status":"published","publication_identifier":{"isbn":["0818606444"]},"title":"Nondeterministic versus probabilistic linear search algorithms","doi":"10.1109/sfcs.1985.38","date_updated":"2022-01-06T06:52:56Z","date_created":"2020-04-21T11:30:30Z","author":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"status":"public","type":"conference","publication":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","language":[{"iso":"eng"}],"_id":"16788","user_id":"15415","department":[{"_id":"63"}]}]