[{"citation":{"short":"F. Meyer auf der Heide, Journal of the ACM (JACM) (1988) 740–747.","bibtex":"@article{Meyer auf der Heide_1988, title={Fast algorithms for N-dimensional restrictions of hard problems}, DOI={<a href=\"https://doi.org/10.1145/44483.44490\">10.1145/44483.44490</a>}, journal={Journal of the ACM (JACM)}, author={Meyer auf der Heide, Friedhelm}, year={1988}, pages={740–747} }","mla":"Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions of Hard Problems.” <i>Journal of the ACM (JACM)</i>, 1988, pp. 740–47, doi:<a href=\"https://doi.org/10.1145/44483.44490\">10.1145/44483.44490</a>.","apa":"Meyer auf der Heide, F. (1988). Fast algorithms for N-dimensional restrictions of hard problems. <i>Journal of the ACM (JACM)</i>, 740–747. <a href=\"https://doi.org/10.1145/44483.44490\">https://doi.org/10.1145/44483.44490</a>","ieee":"F. Meyer auf der Heide, “Fast algorithms for N-dimensional restrictions of hard problems,” <i>Journal of the ACM (JACM)</i>, pp. 740–747, 1988.","chicago":"Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions of Hard Problems.” <i>Journal of the ACM (JACM)</i>, 1988, 740–47. <a href=\"https://doi.org/10.1145/44483.44490\">https://doi.org/10.1145/44483.44490</a>.","ama":"Meyer auf der Heide F. Fast algorithms for N-dimensional restrictions of hard problems. <i>Journal of the ACM (JACM)</i>. 1988:740-747. doi:<a href=\"https://doi.org/10.1145/44483.44490\">10.1145/44483.44490</a>"},"page":"740-747","year":"1988","publication_status":"published","publication_identifier":{"issn":["0004-5411","1557-735X"]},"doi":"10.1145/44483.44490","title":"Fast algorithms for N-dimensional restrictions of hard problems","author":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"date_created":"2020-04-21T08:51:54Z","date_updated":"2022-01-06T06:52:55Z","status":"public","type":"journal_article","publication":"Journal of the ACM (JACM)","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16764"},{"language":[{"iso":"eng"}],"_id":"16765","department":[{"_id":"63"}],"user_id":"15415","status":"public","publication":"Theoretical Computer Science","type":"journal_article","title":"A tradeoff between search and update time for the implicit dictionary problem","doi":"10.1016/0304-3975(88)90018-7","date_updated":"2022-01-06T06:52:55Z","author":[{"last_name":"Borodin","full_name":"Borodin, Allan","first_name":"Allan"},{"full_name":"Fich, Faith E.","last_name":"Fich","first_name":"Faith E."},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Eli","full_name":"Upfal, Eli","last_name":"Upfal"},{"first_name":"Avi","full_name":"Wigderson, Avi","last_name":"Wigderson"}],"date_created":"2020-04-21T08:53:13Z","year":"1988","page":"57-68","citation":{"chicago":"Borodin, Allan, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, and Avi Wigderson. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.” <i>Theoretical Computer Science</i>, 1988, 57–68. <a href=\"https://doi.org/10.1016/0304-3975(88)90018-7\">https://doi.org/10.1016/0304-3975(88)90018-7</a>.","ieee":"A. Borodin, F. E. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A tradeoff between search and update time for the implicit dictionary problem,” <i>Theoretical Computer Science</i>, pp. 57–68, 1988.","ama":"Borodin A, Fich FE, Meyer auf der Heide F, Upfal E, Wigderson A. A tradeoff between search and update time for the implicit dictionary problem. <i>Theoretical Computer Science</i>. 1988:57-68. doi:<a href=\"https://doi.org/10.1016/0304-3975(88)90018-7\">10.1016/0304-3975(88)90018-7</a>","short":"A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, Theoretical Computer Science (1988) 57–68.","bibtex":"@article{Borodin_Fich_Meyer auf der Heide_Upfal_Wigderson_1988, title={A tradeoff between search and update time for the implicit dictionary problem}, DOI={<a href=\"https://doi.org/10.1016/0304-3975(88)90018-7\">10.1016/0304-3975(88)90018-7</a>}, journal={Theoretical Computer Science}, author={Borodin, Allan and Fich, Faith E. and Meyer auf der Heide, Friedhelm and Upfal, Eli and Wigderson, Avi}, year={1988}, pages={57–68} }","mla":"Borodin, Allan, et al. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.” <i>Theoretical Computer Science</i>, 1988, pp. 57–68, doi:<a href=\"https://doi.org/10.1016/0304-3975(88)90018-7\">10.1016/0304-3975(88)90018-7</a>.","apa":"Borodin, A., Fich, F. E., Meyer auf der Heide, F., Upfal, E., &#38; Wigderson, A. (1988). A tradeoff between search and update time for the implicit dictionary problem. <i>Theoretical Computer Science</i>, 57–68. <a href=\"https://doi.org/10.1016/0304-3975(88)90018-7\">https://doi.org/10.1016/0304-3975(88)90018-7</a>"},"publication_identifier":{"issn":["0304-3975"]},"publication_status":"published"},{"publication":"[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science","type":"conference","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"16766","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["0818608773"]},"publication_status":"published","citation":{"apa":"Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., &#38; Tarjan, R. E. (1988). Dynamic perfect hashing: upper and lower bounds. In <i>[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science</i>. <a href=\"https://doi.org/10.1109/sfcs.1988.21968\">https://doi.org/10.1109/sfcs.1988.21968</a>","bibtex":"@inproceedings{Dietzfelbinger_Karlin_Mehlhorn_Meyer auf der Heide_Rohnert_Tarjan_1988, title={Dynamic perfect hashing: upper and lower bounds}, DOI={<a href=\"https://doi.org/10.1109/sfcs.1988.21968\">10.1109/sfcs.1988.21968</a>}, booktitle={[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science}, author={Dietzfelbinger, M. and Karlin, A. and Mehlhorn, K. and Meyer auf der Heide, Friedhelm and Rohnert, H. and Tarjan, R.E.}, year={1988} }","short":"M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, R.E. Tarjan, in: [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, 1988.","mla":"Dietzfelbinger, M., et al. “Dynamic Perfect Hashing: Upper and Lower Bounds.” <i>[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science</i>, 1988, doi:<a href=\"https://doi.org/10.1109/sfcs.1988.21968\">10.1109/sfcs.1988.21968</a>.","chicago":"Dietzfelbinger, M., A. Karlin, K. Mehlhorn, Friedhelm Meyer auf der Heide, H. Rohnert, and R.E. Tarjan. “Dynamic Perfect Hashing: Upper and Lower Bounds.” In <i>[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science</i>, 1988. <a href=\"https://doi.org/10.1109/sfcs.1988.21968\">https://doi.org/10.1109/sfcs.1988.21968</a>.","ieee":"M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan, “Dynamic perfect hashing: upper and lower bounds,” in <i>[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science</i>, 1988.","ama":"Dietzfelbinger M, Karlin A, Mehlhorn K, Meyer auf der Heide F, Rohnert H, Tarjan RE. Dynamic perfect hashing: upper and lower bounds. In: <i>[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science</i>. ; 1988. doi:<a href=\"https://doi.org/10.1109/sfcs.1988.21968\">10.1109/sfcs.1988.21968</a>"},"year":"1988","author":[{"full_name":"Dietzfelbinger, M.","last_name":"Dietzfelbinger","first_name":"M."},{"last_name":"Karlin","full_name":"Karlin, A.","first_name":"A."},{"first_name":"K.","full_name":"Mehlhorn, K.","last_name":"Mehlhorn"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"first_name":"H.","last_name":"Rohnert","full_name":"Rohnert, H."},{"full_name":"Tarjan, R.E.","last_name":"Tarjan","first_name":"R.E."}],"date_created":"2020-04-21T08:59:26Z","date_updated":"2022-01-06T06:52:55Z","doi":"10.1109/sfcs.1988.21968","title":"Dynamic perfect hashing: upper and lower bounds"},{"year":"1988","place":"Berlin, Heidelberg","citation":{"ama":"Just B, Mathematik F, Meyer auf der Heide F, Informatik F, Wigderson A. On computations with integer division. In: <i>STACS 88</i>. Berlin, Heidelberg; 1988. doi:<a href=\"https://doi.org/10.1007/bfb0035829\">10.1007/bfb0035829</a>","ieee":"B. Just, F. Mathematik, F. Meyer auf der Heide, F. Informatik, and A. Wigderson, “On computations with integer division,” in <i>STACS 88</i>, Berlin, Heidelberg, 1988.","chicago":"Just, Bettina, Fb Mathematik, Friedhelm Meyer auf der Heide, Fb Informatik, and Avi Wigderson. “On Computations with Integer Division.” In <i>STACS 88</i>. Berlin, Heidelberg, 1988. <a href=\"https://doi.org/10.1007/bfb0035829\">https://doi.org/10.1007/bfb0035829</a>.","short":"B. Just, F. Mathematik, F. Meyer auf der Heide, F. Informatik, A. Wigderson, in: STACS 88, Berlin, Heidelberg, 1988.","mla":"Just, Bettina, et al. “On Computations with Integer Division.” <i>STACS 88</i>, 1988, doi:<a href=\"https://doi.org/10.1007/bfb0035829\">10.1007/bfb0035829</a>.","bibtex":"@inbook{Just_Mathematik_Meyer auf der Heide_Informatik_Wigderson_1988, place={Berlin, Heidelberg}, title={On computations with integer division}, DOI={<a href=\"https://doi.org/10.1007/bfb0035829\">10.1007/bfb0035829</a>}, booktitle={STACS 88}, author={Just, Bettina and Mathematik, Fb and Meyer auf der Heide, Friedhelm and Informatik, Fb and Wigderson, Avi}, year={1988} }","apa":"Just, B., Mathematik, F., Meyer auf der Heide, F., Informatik, F., &#38; Wigderson, A. (1988). On computations with integer division. In <i>STACS 88</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/bfb0035829\">https://doi.org/10.1007/bfb0035829</a>"},"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540188346","9783540481904"]},"title":"On computations with integer division","doi":"10.1007/bfb0035829","date_updated":"2022-01-06T06:52:55Z","date_created":"2020-04-21T09:00:37Z","author":[{"first_name":"Bettina","full_name":"Just, Bettina","last_name":"Just"},{"first_name":"Fb","full_name":"Mathematik, Fb","last_name":"Mathematik"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"last_name":"Informatik","full_name":"Informatik, Fb","first_name":"Fb"},{"first_name":"Avi","last_name":"Wigderson","full_name":"Wigderson, Avi"}],"status":"public","type":"book_chapter","publication":"STACS 88","language":[{"iso":"eng"}],"_id":"16767","user_id":"15415","department":[{"_id":"63"}]},{"status":"public","publication":"SWAT 88","type":"book_chapter","language":[{"iso":"eng"}],"_id":"16768","department":[{"_id":"63"}],"user_id":"15415","year":"1988","place":"Berlin, Heidelberg","citation":{"mla":"Dietzfelbinger, M., et al. “Upper and Lower Bounds for the Dictionary Problem.” <i>SWAT 88</i>, 1988, doi:<a href=\"https://doi.org/10.1007/3-540-19487-8_24\">10.1007/3-540-19487-8_24</a>.","bibtex":"@inbook{Dietzfelbinger_Mehlhorn_Meyer auf der Heide_Rohnert_1988, place={Berlin, Heidelberg}, title={Upper and lower bounds for the dictionary problem}, DOI={<a href=\"https://doi.org/10.1007/3-540-19487-8_24\">10.1007/3-540-19487-8_24</a>}, booktitle={SWAT 88}, author={Dietzfelbinger, M. and Mehlhorn, K. and Meyer auf der Heide, Friedhelm and Rohnert, H.}, year={1988} }","short":"M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, in: SWAT 88, Berlin, Heidelberg, 1988.","apa":"Dietzfelbinger, M., Mehlhorn, K., Meyer auf der Heide, F., &#38; Rohnert, H. (1988). Upper and lower bounds for the dictionary problem. In <i>SWAT 88</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-19487-8_24\">https://doi.org/10.1007/3-540-19487-8_24</a>","ama":"Dietzfelbinger M, Mehlhorn K, Meyer auf der Heide F, Rohnert H. Upper and lower bounds for the dictionary problem. In: <i>SWAT 88</i>. Berlin, Heidelberg; 1988. doi:<a href=\"https://doi.org/10.1007/3-540-19487-8_24\">10.1007/3-540-19487-8_24</a>","ieee":"M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, and H. Rohnert, “Upper and lower bounds for the dictionary problem,” in <i>SWAT 88</i>, Berlin, Heidelberg, 1988.","chicago":"Dietzfelbinger, M., K. Mehlhorn, Friedhelm Meyer auf der Heide, and H. Rohnert. “Upper and Lower Bounds for the Dictionary Problem.” In <i>SWAT 88</i>. Berlin, Heidelberg, 1988. <a href=\"https://doi.org/10.1007/3-540-19487-8_24\">https://doi.org/10.1007/3-540-19487-8_24</a>."},"publication_identifier":{"isbn":["9783540194873","9783540392880"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","title":"Upper and lower bounds for the dictionary problem","doi":"10.1007/3-540-19487-8_24","date_updated":"2022-01-06T06:52:55Z","date_created":"2020-04-21T09:01:36Z","author":[{"first_name":"M.","last_name":"Dietzfelbinger","full_name":"Dietzfelbinger, M."},{"last_name":"Mehlhorn","full_name":"Mehlhorn, K.","first_name":"K."},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Rohnert, H.","last_name":"Rohnert","first_name":"H."}]},{"author":[{"first_name":"A.","last_name":"Borodin","full_name":"Borodin, A."},{"first_name":"F.","last_name":"Fich","full_name":"Fich, F."},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Upfal","full_name":"Upfal, E.","first_name":"E."},{"full_name":"Wigderson, A.","last_name":"Wigderson","first_name":"A."}],"date_created":"2020-04-21T10:00:29Z","date_updated":"2022-01-06T06:52:55Z","doi":"10.1137/0216007","title":"A Time-Space Tradeoff for Element Distinctness","publication_status":"published","publication_identifier":{"issn":["0097-5397","1095-7111"]},"citation":{"chicago":"Borodin, A., F. Fich, Friedhelm Meyer auf der Heide, E. Upfal, and A. Wigderson. “A Time-Space Tradeoff for Element Distinctness.” <i>SIAM Journal on Computing</i>, 1987, 97–99. <a href=\"https://doi.org/10.1137/0216007\">https://doi.org/10.1137/0216007</a>.","ieee":"A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A Time-Space Tradeoff for Element Distinctness,” <i>SIAM Journal on Computing</i>, pp. 97–99, 1987.","ama":"Borodin A, Fich F, Meyer auf der Heide F, Upfal E, Wigderson A. A Time-Space Tradeoff for Element Distinctness. <i>SIAM Journal on Computing</i>. 1987:97-99. doi:<a href=\"https://doi.org/10.1137/0216007\">10.1137/0216007</a>","short":"A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, SIAM Journal on Computing (1987) 97–99.","bibtex":"@article{Borodin_Fich_Meyer auf der Heide_Upfal_Wigderson_1987, title={A Time-Space Tradeoff for Element Distinctness}, DOI={<a href=\"https://doi.org/10.1137/0216007\">10.1137/0216007</a>}, journal={SIAM Journal on Computing}, author={Borodin, A. and Fich, F. and Meyer auf der Heide, Friedhelm and Upfal, E. and Wigderson, A.}, year={1987}, pages={97–99} }","mla":"Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.” <i>SIAM Journal on Computing</i>, 1987, pp. 97–99, doi:<a href=\"https://doi.org/10.1137/0216007\">10.1137/0216007</a>.","apa":"Borodin, A., Fich, F., Meyer auf der Heide, F., Upfal, E., &#38; Wigderson, A. (1987). A Time-Space Tradeoff for Element Distinctness. <i>SIAM Journal on Computing</i>, 97–99. <a href=\"https://doi.org/10.1137/0216007\">https://doi.org/10.1137/0216007</a>"},"page":"97-99","year":"1987","user_id":"15415","department":[{"_id":"63"}],"_id":"16772","language":[{"iso":"eng"}],"type":"journal_article","publication":"SIAM Journal on Computing","status":"public"},{"publication":"SIAM Journal on Computing","type":"journal_article","status":"public","_id":"16773","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0097-5397","1095-7111"]},"publication_status":"published","year":"1987","page":"100-107","citation":{"ama":"Meyer auf der Heide F, Wigderson A. The Complexity of Parallel Sorting. <i>SIAM Journal on Computing</i>. 1987:100-107. doi:<a href=\"https://doi.org/10.1137/0216008\">10.1137/0216008</a>","chicago":"Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.” <i>SIAM Journal on Computing</i>, 1987, 100–107. <a href=\"https://doi.org/10.1137/0216008\">https://doi.org/10.1137/0216008</a>.","ieee":"F. Meyer auf der Heide and A. Wigderson, “The Complexity of Parallel Sorting,” <i>SIAM Journal on Computing</i>, pp. 100–107, 1987.","short":"F. Meyer auf der Heide, A. Wigderson, SIAM Journal on Computing (1987) 100–107.","bibtex":"@article{Meyer auf der Heide_Wigderson_1987, title={The Complexity of Parallel Sorting}, DOI={<a href=\"https://doi.org/10.1137/0216008\">10.1137/0216008</a>}, journal={SIAM Journal on Computing}, author={Meyer auf der Heide, Friedhelm and Wigderson, Avi}, year={1987}, pages={100–107} }","mla":"Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.” <i>SIAM Journal on Computing</i>, 1987, pp. 100–07, doi:<a href=\"https://doi.org/10.1137/0216008\">10.1137/0216008</a>.","apa":"Meyer auf der Heide, F., &#38; Wigderson, A. (1987). The Complexity of Parallel Sorting. <i>SIAM Journal on Computing</i>, 100–107. <a href=\"https://doi.org/10.1137/0216008\">https://doi.org/10.1137/0216008</a>"},"date_updated":"2022-01-06T06:52:55Z","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_created":"2020-04-21T10:01:37Z","title":"The Complexity of Parallel Sorting","doi":"10.1137/0216008"},{"page":"106-119","citation":{"ieee":"F. Meyer auf der Heide, “Efficient Simulations among Several Models of Parallel Computers,” <i>SIAM Journal on Computing</i>, pp. 106–119, 1986.","chicago":"Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers.” <i>SIAM Journal on Computing</i>, 1986, 106–19. <a href=\"https://doi.org/10.1137/0215008\">https://doi.org/10.1137/0215008</a>.","ama":"Meyer auf der Heide F. Efficient Simulations among Several Models of Parallel Computers. <i>SIAM Journal on Computing</i>. 1986:106-119. doi:<a href=\"https://doi.org/10.1137/0215008\">10.1137/0215008</a>","apa":"Meyer auf der Heide, F. (1986). Efficient Simulations among Several Models of Parallel Computers. <i>SIAM Journal on Computing</i>, 106–119. <a href=\"https://doi.org/10.1137/0215008\">https://doi.org/10.1137/0215008</a>","bibtex":"@article{Meyer auf der Heide_1986, title={Efficient Simulations among Several Models of Parallel Computers}, DOI={<a href=\"https://doi.org/10.1137/0215008\">10.1137/0215008</a>}, journal={SIAM Journal on Computing}, author={Meyer auf der Heide, Friedhelm}, year={1986}, pages={106–119} }","mla":"Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers.” <i>SIAM Journal on Computing</i>, 1986, pp. 106–19, doi:<a href=\"https://doi.org/10.1137/0215008\">10.1137/0215008</a>.","short":"F. Meyer auf der Heide, SIAM Journal on Computing (1986) 106–119."},"year":"1986","publication_identifier":{"issn":["0097-5397","1095-7111"]},"publication_status":"published","doi":"10.1137/0215008","title":"Efficient Simulations among Several Models of Parallel Computers","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_created":"2020-04-21T09:59:29Z","date_updated":"2022-01-06T06:52:55Z","status":"public","publication":"SIAM Journal on Computing","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16771"},{"user_id":"15415","department":[{"_id":"63"}],"_id":"16774","language":[{"iso":"eng"}],"type":"book_chapter","publication":"Automata, Languages and Programming","status":"public","date_created":"2020-04-21T10:05:54Z","author":[{"first_name":"Allan","last_name":"Borodin","full_name":"Borodin, Allan"},{"last_name":"Fich","full_name":"Fich, Faith E.","first_name":"Faith E."},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Eli","full_name":"Upfal, Eli","last_name":"Upfal"},{"full_name":"Wigderson, Avi","last_name":"Wigderson","first_name":"Avi"}],"date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/3-540-16761-7_54","title":"A tradeoff between search and update time for the implicit dictionary problem","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540167617","9783540398592"]},"citation":{"ama":"Borodin A, Fich FE, Meyer auf der Heide F, Upfal E, Wigderson A. A tradeoff between search and update time for the implicit dictionary problem. In: <i>Automata, Languages and Programming</i>. Berlin, Heidelberg; 1986. doi:<a href=\"https://doi.org/10.1007/3-540-16761-7_54\">10.1007/3-540-16761-7_54</a>","ieee":"A. Borodin, F. E. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A tradeoff between search and update time for the implicit dictionary problem,” in <i>Automata, Languages and Programming</i>, Berlin, Heidelberg, 1986.","chicago":"Borodin, Allan, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, and Avi Wigderson. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.” In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg, 1986. <a href=\"https://doi.org/10.1007/3-540-16761-7_54\">https://doi.org/10.1007/3-540-16761-7_54</a>.","apa":"Borodin, A., Fich, F. E., Meyer auf der Heide, F., Upfal, E., &#38; Wigderson, A. (1986). A tradeoff between search and update time for the implicit dictionary problem. In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-16761-7_54\">https://doi.org/10.1007/3-540-16761-7_54</a>","bibtex":"@inbook{Borodin_Fich_Meyer auf der Heide_Upfal_Wigderson_1986, place={Berlin, Heidelberg}, title={A tradeoff between search and update time for the implicit dictionary problem}, DOI={<a href=\"https://doi.org/10.1007/3-540-16761-7_54\">10.1007/3-540-16761-7_54</a>}, booktitle={Automata, Languages and Programming}, author={Borodin, Allan and Fich, Faith E. and Meyer auf der Heide, Friedhelm and Upfal, Eli and Wigderson, Avi}, year={1986} }","short":"A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in: Automata, Languages and Programming, Berlin, Heidelberg, 1986.","mla":"Borodin, Allan, et al. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.” <i>Automata, Languages and Programming</i>, 1986, doi:<a href=\"https://doi.org/10.1007/3-540-16761-7_54\">10.1007/3-540-16761-7_54</a>."},"year":"1986","place":"Berlin, Heidelberg"},{"_id":"16775","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"book_chapter","publication":"STACS 86","status":"public","date_updated":"2022-01-06T06:52:55Z","author":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"date_created":"2020-04-21T10:07:06Z","title":"Speeding up random access machines by few processors","doi":"10.1007/3-540-16078-7_72","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540160786","9783540397588"]},"year":"1986","place":"Berlin, Heidelberg","citation":{"ama":"Meyer auf der Heide F. Speeding up random access machines by few processors. In: <i>STACS 86</i>. Berlin, Heidelberg; 1986. doi:<a href=\"https://doi.org/10.1007/3-540-16078-7_72\">10.1007/3-540-16078-7_72</a>","chicago":"Meyer auf der Heide, Friedhelm. “Speeding up Random Access Machines by Few Processors.” In <i>STACS 86</i>. Berlin, Heidelberg, 1986. <a href=\"https://doi.org/10.1007/3-540-16078-7_72\">https://doi.org/10.1007/3-540-16078-7_72</a>.","ieee":"F. Meyer auf der Heide, “Speeding up random access machines by few processors,” in <i>STACS 86</i>, Berlin, Heidelberg, 1986.","bibtex":"@inbook{Meyer auf der Heide_1986, place={Berlin, Heidelberg}, title={Speeding up random access machines by few processors}, DOI={<a href=\"https://doi.org/10.1007/3-540-16078-7_72\">10.1007/3-540-16078-7_72</a>}, booktitle={STACS 86}, author={Meyer auf der Heide, Friedhelm}, year={1986} }","short":"F. Meyer auf der Heide, in: STACS 86, Berlin, Heidelberg, 1986.","mla":"Meyer auf der Heide, Friedhelm. “Speeding up Random Access Machines by Few Processors.” <i>STACS 86</i>, 1986, doi:<a href=\"https://doi.org/10.1007/3-540-16078-7_72\">10.1007/3-540-16078-7_72</a>.","apa":"Meyer auf der Heide, F. (1986). Speeding up random access machines by few processors. In <i>STACS 86</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-16078-7_72\">https://doi.org/10.1007/3-540-16078-7_72</a>"}},{"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540160786","9783540397588"]},"publication_status":"published","place":"Berlin, Heidelberg","year":"1986","citation":{"ama":"Borodin A, Fich F, Meyer auf der Heide F, Upfal E, Wigderson A. A time-space tradeoff for element distinctness. In: <i>STACS 86</i>. Berlin, Heidelberg; 1986. doi:<a href=\"https://doi.org/10.1007/3-540-16078-7_89\">10.1007/3-540-16078-7_89</a>","ieee":"A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A time-space tradeoff for element distinctness,” in <i>STACS 86</i>, Berlin, Heidelberg, 1986.","chicago":"Borodin, A., F. Fich, Friedhelm Meyer auf der Heide, E. Upfal, and A. Wigderson. “A Time-Space Tradeoff for Element Distinctness.” In <i>STACS 86</i>. Berlin, Heidelberg, 1986. <a href=\"https://doi.org/10.1007/3-540-16078-7_89\">https://doi.org/10.1007/3-540-16078-7_89</a>.","mla":"Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.” <i>STACS 86</i>, 1986, doi:<a href=\"https://doi.org/10.1007/3-540-16078-7_89\">10.1007/3-540-16078-7_89</a>.","short":"A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in: STACS 86, Berlin, Heidelberg, 1986.","bibtex":"@inbook{Borodin_Fich_Meyer auf der Heide_Upfal_Wigderson_1986, place={Berlin, Heidelberg}, title={A time-space tradeoff for element distinctness}, DOI={<a href=\"https://doi.org/10.1007/3-540-16078-7_89\">10.1007/3-540-16078-7_89</a>}, booktitle={STACS 86}, author={Borodin, A. and Fich, F. and Meyer auf der Heide, Friedhelm and Upfal, E. and Wigderson, A.}, year={1986} }","apa":"Borodin, A., Fich, F., Meyer auf der Heide, F., Upfal, E., &#38; Wigderson, A. (1986). A time-space tradeoff for element distinctness. In <i>STACS 86</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-16078-7_89\">https://doi.org/10.1007/3-540-16078-7_89</a>"},"date_updated":"2022-01-06T06:52:55Z","author":[{"last_name":"Borodin","full_name":"Borodin, A.","first_name":"A."},{"first_name":"F.","full_name":"Fich, F.","last_name":"Fich"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"last_name":"Upfal","full_name":"Upfal, E.","first_name":"E."},{"last_name":"Wigderson","full_name":"Wigderson, A.","first_name":"A."}],"date_created":"2020-04-21T10:08:23Z","title":"A time-space tradeoff for element distinctness","doi":"10.1007/3-540-16078-7_89","publication":"STACS 86","type":"book_chapter","status":"public","_id":"16776","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}]},{"publication_identifier":{"issn":["0020-0190"]},"publication_status":"published","year":"1985","page":"101-105","citation":{"apa":"Lautemann, C., &#38; Meyer auf der Heide, F. (1985). Lower time bounds for integer programming with two variables. <i>Information Processing Letters</i>, 101–105. <a href=\"https://doi.org/10.1016/0020-0190(85)90042-0\">https://doi.org/10.1016/0020-0190(85)90042-0</a>","mla":"Lautemann, Clemens, and Friedhelm Meyer auf der Heide. “Lower Time Bounds for Integer Programming with Two Variables.” <i>Information Processing Letters</i>, 1985, pp. 101–05, doi:<a href=\"https://doi.org/10.1016/0020-0190(85)90042-0\">10.1016/0020-0190(85)90042-0</a>.","bibtex":"@article{Lautemann_Meyer auf der Heide_1985, title={Lower time bounds for integer programming with two variables}, DOI={<a href=\"https://doi.org/10.1016/0020-0190(85)90042-0\">10.1016/0020-0190(85)90042-0</a>}, journal={Information Processing Letters}, author={Lautemann, Clemens and Meyer auf der Heide, Friedhelm}, year={1985}, pages={101–105} }","short":"C. Lautemann, F. Meyer auf der Heide, Information Processing Letters (1985) 101–105.","ieee":"C. Lautemann and F. Meyer auf der Heide, “Lower time bounds for integer programming with two variables,” <i>Information Processing Letters</i>, pp. 101–105, 1985.","chicago":"Lautemann, Clemens, and Friedhelm Meyer auf der Heide. “Lower Time Bounds for Integer Programming with Two Variables.” <i>Information Processing Letters</i>, 1985, 101–5. <a href=\"https://doi.org/10.1016/0020-0190(85)90042-0\">https://doi.org/10.1016/0020-0190(85)90042-0</a>.","ama":"Lautemann C, Meyer auf der Heide F. Lower time bounds for integer programming with two variables. <i>Information Processing Letters</i>. 1985:101-105. doi:<a href=\"https://doi.org/10.1016/0020-0190(85)90042-0\">10.1016/0020-0190(85)90042-0</a>"},"date_updated":"2022-01-06T06:52:55Z","date_created":"2020-04-21T10:15:46Z","author":[{"last_name":"Lautemann","full_name":"Lautemann, Clemens","first_name":"Clemens"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"title":"Lower time bounds for integer programming with two variables","doi":"10.1016/0020-0190(85)90042-0","publication":"Information Processing Letters","type":"journal_article","status":"public","_id":"16779","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}]},{"doi":"10.1145/4221.4250","title":"Lower bounds for solving linear diophantine equations on random access machines","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_created":"2020-04-21T10:16:50Z","date_updated":"2022-01-06T06:52:55Z","page":"929-937","citation":{"apa":"Meyer auf der Heide, F. (1985). Lower bounds for solving linear diophantine equations on random access machines. <i>Journal of the ACM (JACM)</i>, 929–937. <a href=\"https://doi.org/10.1145/4221.4250\">https://doi.org/10.1145/4221.4250</a>","bibtex":"@article{Meyer auf der Heide_1985, title={Lower bounds for solving linear diophantine equations on random access machines}, DOI={<a href=\"https://doi.org/10.1145/4221.4250\">10.1145/4221.4250</a>}, journal={Journal of the ACM (JACM)}, author={Meyer auf der Heide, Friedhelm}, year={1985}, pages={929–937} }","short":"F. Meyer auf der Heide, Journal of the ACM (JACM) (1985) 929–937.","mla":"Meyer auf der Heide, Friedhelm. “Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines.” <i>Journal of the ACM (JACM)</i>, 1985, pp. 929–37, doi:<a href=\"https://doi.org/10.1145/4221.4250\">10.1145/4221.4250</a>.","ieee":"F. Meyer auf der Heide, “Lower bounds for solving linear diophantine equations on random access machines,” <i>Journal of the ACM (JACM)</i>, pp. 929–937, 1985.","chicago":"Meyer auf der Heide, Friedhelm. “Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines.” <i>Journal of the ACM (JACM)</i>, 1985, 929–37. <a href=\"https://doi.org/10.1145/4221.4250\">https://doi.org/10.1145/4221.4250</a>.","ama":"Meyer auf der Heide F. Lower bounds for solving linear diophantine equations on random access machines. <i>Journal of the ACM (JACM)</i>. 1985:929-937. doi:<a href=\"https://doi.org/10.1145/4221.4250\">10.1145/4221.4250</a>"},"year":"1985","publication_identifier":{"issn":["0004-5411","1557-735X"]},"publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16780","status":"public","publication":"Journal of the ACM (JACM)","type":"journal_article"},{"date_created":"2020-04-21T11:18:44Z","author":[{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_updated":"2022-01-06T06:52:55Z","doi":"10.1016/0304-3975(85)90079-9","title":"Simulating probabilistic by deterministic algebraic computation trees","publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","page":"325-330","citation":{"apa":"Meyer auf der Heide, F. (1985). Simulating probabilistic by deterministic algebraic computation trees. <i>Theoretical Computer Science</i>, 325–330. <a href=\"https://doi.org/10.1016/0304-3975(85)90079-9\">https://doi.org/10.1016/0304-3975(85)90079-9</a>","mla":"Meyer auf der Heide, Friedhelm. “Simulating Probabilistic by Deterministic Algebraic Computation Trees.” <i>Theoretical Computer Science</i>, 1985, pp. 325–30, doi:<a href=\"https://doi.org/10.1016/0304-3975(85)90079-9\">10.1016/0304-3975(85)90079-9</a>.","bibtex":"@article{Meyer auf der Heide_1985, title={Simulating probabilistic by deterministic algebraic computation trees}, DOI={<a href=\"https://doi.org/10.1016/0304-3975(85)90079-9\">10.1016/0304-3975(85)90079-9</a>}, journal={Theoretical Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1985}, pages={325–330} }","short":"F. Meyer auf der Heide, Theoretical Computer Science (1985) 325–330.","ama":"Meyer auf der Heide F. Simulating probabilistic by deterministic algebraic computation trees. <i>Theoretical Computer Science</i>. 1985:325-330. doi:<a href=\"https://doi.org/10.1016/0304-3975(85)90079-9\">10.1016/0304-3975(85)90079-9</a>","chicago":"Meyer auf der Heide, Friedhelm. “Simulating Probabilistic by Deterministic Algebraic Computation Trees.” <i>Theoretical Computer Science</i>, 1985, 325–30. <a href=\"https://doi.org/10.1016/0304-3975(85)90079-9\">https://doi.org/10.1016/0304-3975(85)90079-9</a>.","ieee":"F. Meyer auf der Heide, “Simulating probabilistic by deterministic algebraic computation trees,” <i>Theoretical Computer Science</i>, pp. 325–330, 1985."},"year":"1985","department":[{"_id":"63"}],"user_id":"15415","_id":"16781","language":[{"iso":"eng"}],"publication":"Theoretical Computer Science","type":"journal_article","status":"public"},{"publication":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","type":"conference","status":"public","_id":"16782","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["0818606444"]},"publication_status":"published","year":"1985","citation":{"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>.","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.","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>","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.","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>."},"date_updated":"2022-01-06T06:52:55Z","date_created":"2020-04-21T11:19:34Z","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Avi","full_name":"Wigderson, Avi","last_name":"Wigderson"}],"title":"The complexity of parallel sorting","doi":"10.1109/sfcs.1985.58"},{"publication_identifier":{"isbn":["0897911512"]},"publication_status":"published","citation":{"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.","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} }","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>.","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.","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>"},"year":"1985","date_created":"2020-04-21T11:20:53Z","author":[{"full_name":"Fich, F E","last_name":"Fich","first_name":"F E"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"P","full_name":"Ragde, P","last_name":"Ragde"},{"first_name":"A","full_name":"Wigderson, A","last_name":"Wigderson"}],"date_updated":"2022-01-06T06:52:55Z","doi":"10.1145/22145.22151","title":"One, two, three . . . infinity: lower bounds for parallel computation","publication":"Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC '85","type":"conference","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"16783","language":[{"iso":"eng"}]},{"title":"Fast algorithms for n-dimensional restrictions of hard problems","doi":"10.1145/22145.22191","date_updated":"2022-01-06T06:52:56Z","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_created":"2020-04-21T11:24:17Z","year":"1985","citation":{"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.","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>.","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>","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} }","short":"F. Meyer auf der Heide, in: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing  - STOC ’85, 1985.","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_status":"published","publication_identifier":{"isbn":["0897911512"]},"language":[{"iso":"eng"}],"_id":"16784","user_id":"15415","department":[{"_id":"63"}],"status":"public","type":"conference","publication":"Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC '85"},{"type":"conference","publication":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","status":"public","_id":"16788","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["0818606444"]},"year":"1985","citation":{"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.","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>","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.","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>."},"date_updated":"2022-01-06T06:52:56Z","author":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"date_created":"2020-04-21T11:30:30Z","title":"Nondeterministic versus probabilistic linear search algorithms","doi":"10.1109/sfcs.1985.38"},{"doi":"10.1016/S0019-9958(85)80035-8","title":"Lower time bounds for solving linear diophantine equations on several parallel computational models","volume":67,"date_created":"2020-04-22T09:58:17Z","author":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_updated":"2022-01-06T06:52:56Z","page":"195-211","intvolume":"        67","citation":{"ieee":"F. Meyer auf der Heide, “Lower time bounds for solving linear diophantine equations on several parallel computational models,” <i>Information and Control</i>, vol. 67, no. 1–3, pp. 195–211, 1985.","chicago":"Meyer auf der Heide, Friedhelm. “Lower Time Bounds for Solving Linear Diophantine Equations on Several Parallel Computational Models.” <i>Information and Control</i> 67, no. 1–3 (1985): 195–211. <a href=\"https://doi.org/10.1016/S0019-9958(85)80035-8\">https://doi.org/10.1016/S0019-9958(85)80035-8</a>.","ama":"Meyer auf der Heide F. Lower time bounds for solving linear diophantine equations on several parallel computational models. <i>Information and Control</i>. 1985;67(1-3):195-211. doi:<a href=\"https://doi.org/10.1016/S0019-9958(85)80035-8\">10.1016/S0019-9958(85)80035-8</a>","apa":"Meyer auf der Heide, F. (1985). Lower time bounds for solving linear diophantine equations on several parallel computational models. <i>Information and Control</i>, <i>67</i>(1–3), 195–211. <a href=\"https://doi.org/10.1016/S0019-9958(85)80035-8\">https://doi.org/10.1016/S0019-9958(85)80035-8</a>","mla":"Meyer auf der Heide, Friedhelm. “Lower Time Bounds for Solving Linear Diophantine Equations on Several Parallel Computational Models.” <i>Information and Control</i>, vol. 67, no. 1–3, 1985, pp. 195–211, doi:<a href=\"https://doi.org/10.1016/S0019-9958(85)80035-8\">10.1016/S0019-9958(85)80035-8</a>.","short":"F. Meyer auf der Heide, Information and Control 67 (1985) 195–211.","bibtex":"@article{Meyer auf der Heide_1985, title={Lower time bounds for solving linear diophantine equations on several parallel computational models}, volume={67}, DOI={<a href=\"https://doi.org/10.1016/S0019-9958(85)80035-8\">10.1016/S0019-9958(85)80035-8</a>}, number={1–3}, journal={Information and Control}, author={Meyer auf der Heide, Friedhelm}, year={1985}, pages={195–211} }"},"year":"1985","issue":"1-3","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16823","status":"public","publication":"Information and Control","type":"journal_article"},{"date_updated":"2022-01-06T06:52:56Z","author":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"date_created":"2020-04-21T11:25:52Z","title":"A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem","doi":"10.1145/828.322450","publication_status":"published","publication_identifier":{"issn":["0004-5411","1557-735X"]},"year":"1984","citation":{"short":"F. Meyer auf der Heide, Journal of the ACM (JACM) (1984) 668–676.","bibtex":"@article{Meyer auf der Heide_1984, title={A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem}, DOI={<a href=\"https://doi.org/10.1145/828.322450\">10.1145/828.322450</a>}, journal={Journal of the ACM (JACM)}, author={Meyer auf der Heide, Friedhelm}, year={1984}, pages={668–676} }","mla":"Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm Forr the N-Dimensional Knapsack Problem.” <i>Journal of the ACM (JACM)</i>, 1984, pp. 668–76, doi:<a href=\"https://doi.org/10.1145/828.322450\">10.1145/828.322450</a>.","apa":"Meyer auf der Heide, F. (1984). A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem. <i>Journal of the ACM (JACM)</i>, 668–676. <a href=\"https://doi.org/10.1145/828.322450\">https://doi.org/10.1145/828.322450</a>","ama":"Meyer auf der Heide F. A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem. <i>Journal of the ACM (JACM)</i>. 1984:668-676. doi:<a href=\"https://doi.org/10.1145/828.322450\">10.1145/828.322450</a>","ieee":"F. Meyer auf der Heide, “A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem,” <i>Journal of the ACM (JACM)</i>, pp. 668–676, 1984.","chicago":"Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm Forr the N-Dimensional Knapsack Problem.” <i>Journal of the ACM (JACM)</i>, 1984, 668–76. <a href=\"https://doi.org/10.1145/828.322450\">https://doi.org/10.1145/828.322450</a>."},"page":"668-676","_id":"16785","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Journal of the ACM (JACM)","status":"public"}]