[{"type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-21T11:19:34Z","publication":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","citation":{"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.","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>","short":"F. Meyer auf der Heide, A. Wigderson, in: 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 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>.","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>.","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} }","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>"},"user_id":"15415","doi":"10.1109/sfcs.1985.58","_id":"16782","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:52:55Z","year":"1985","title":"The complexity of parallel sorting","status":"public","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Wigderson, Avi","last_name":"Wigderson","first_name":"Avi"}],"publication_identifier":{"isbn":["0818606444"]}},{"citation":{"short":"F. Meyer auf der Heide, in: 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985.","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.","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>","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} }","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>","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>."},"publication":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","department":[{"_id":"63"}],"type":"conference","date_created":"2020-04-21T11:30:30Z","date_updated":"2022-01-06T06:52:56Z","publication_status":"published","publication_identifier":{"isbn":["0818606444"]},"author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"title":"Nondeterministic versus probabilistic linear search algorithms","year":"1985","status":"public","doi":"10.1109/sfcs.1985.38","user_id":"15415","_id":"16788","language":[{"iso":"eng"}]}]