[{"citation":{"ieee":"B. Just, F. Meyer auf der Heide, and A. Wigderson, “On computations with integer division,” <i>RAIRO - Theoretical Informatics and Applications</i>, pp. 101–111, 1989.","chicago":"Just, Bettina, Friedhelm Meyer auf der Heide, and Avi Wigderson. “On Computations with Integer Division.” <i>RAIRO - Theoretical Informatics and Applications</i>, 1989, 101–11. <a href=\"https://doi.org/10.1051/ita/1989230101011\">https://doi.org/10.1051/ita/1989230101011</a>.","ama":"Just B, Meyer auf der Heide F, Wigderson A. On computations with integer division. <i>RAIRO - Theoretical Informatics and Applications</i>. 1989:101-111. doi:<a href=\"https://doi.org/10.1051/ita/1989230101011\">10.1051/ita/1989230101011</a>","apa":"Just, B., Meyer auf der Heide, F., &#38; Wigderson, A. (1989). On computations with integer division. <i>RAIRO - Theoretical Informatics and Applications</i>, 101–111. <a href=\"https://doi.org/10.1051/ita/1989230101011\">https://doi.org/10.1051/ita/1989230101011</a>","short":"B. Just, F. Meyer auf der Heide, A. Wigderson, RAIRO - Theoretical Informatics and Applications (1989) 101–111.","bibtex":"@article{Just_Meyer auf der Heide_Wigderson_1989, title={On computations with integer division}, DOI={<a href=\"https://doi.org/10.1051/ita/1989230101011\">10.1051/ita/1989230101011</a>}, journal={RAIRO - Theoretical Informatics and Applications}, author={Just, Bettina and Meyer auf der Heide, Friedhelm and Wigderson, Avi}, year={1989}, pages={101–111} }","mla":"Just, Bettina, et al. “On Computations with Integer Division.” <i>RAIRO - Theoretical Informatics and Applications</i>, 1989, pp. 101–11, doi:<a href=\"https://doi.org/10.1051/ita/1989230101011\">10.1051/ita/1989230101011</a>."},"page":"101-111","year":"1989","publication_status":"published","publication_identifier":{"issn":["0988-3754","1290-385X"]},"doi":"10.1051/ita/1989230101011","title":"On computations with integer division","author":[{"first_name":"Bettina","last_name":"Just","full_name":"Just, Bettina"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Wigderson","full_name":"Wigderson, Avi","first_name":"Avi"}],"date_created":"2020-04-20T11:49:38Z","date_updated":"2022-01-06T06:52:55Z","status":"public","type":"journal_article","publication":"RAIRO - Theoretical Informatics and Applications","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16743"},{"status":"public","publication":"Proceedings of the first annual ACM symposium on Parallel algorithms and architectures  - SPAA '89","type":"conference","language":[{"iso":"eng"}],"_id":"16744","department":[{"_id":"63"}],"user_id":"15415","year":"1989","citation":{"chicago":"Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.” In <i>Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’89</i>, 1989. <a href=\"https://doi.org/10.1145/72935.72974\">https://doi.org/10.1145/72935.72974</a>.","ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “An optimal parallel dictionary,” in <i>Proceedings of the first annual ACM symposium on Parallel algorithms and architectures  - SPAA ’89</i>, 1989.","ama":"Dietzfelbinger M, Meyer auf der Heide F. An optimal parallel dictionary. In: <i>Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’89</i>. ; 1989. doi:<a href=\"https://doi.org/10.1145/72935.72974\">10.1145/72935.72974</a>","apa":"Dietzfelbinger, M., &#38; Meyer auf der Heide, F. (1989). An optimal parallel dictionary. In <i>Proceedings of the first annual ACM symposium on Parallel algorithms and architectures  - SPAA ’89</i>. <a href=\"https://doi.org/10.1145/72935.72974\">https://doi.org/10.1145/72935.72974</a>","bibtex":"@inproceedings{Dietzfelbinger_Meyer auf der Heide_1989, title={An optimal parallel dictionary}, DOI={<a href=\"https://doi.org/10.1145/72935.72974\">10.1145/72935.72974</a>}, booktitle={Proceedings of the first annual ACM symposium on Parallel algorithms and architectures  - SPAA ’89}, author={Dietzfelbinger, M. and Meyer auf der Heide, Friedhelm}, year={1989} }","mla":"Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.” <i>Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’89</i>, 1989, doi:<a href=\"https://doi.org/10.1145/72935.72974\">10.1145/72935.72974</a>.","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’89, 1989."},"publication_identifier":{"isbn":["089791323X"]},"publication_status":"published","title":"An optimal parallel dictionary","doi":"10.1145/72935.72974","date_updated":"2022-01-06T06:52:55Z","author":[{"first_name":"M.","full_name":"Dietzfelbinger, M.","last_name":"Dietzfelbinger"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"date_created":"2020-04-20T11:51:01Z"},{"publication":"STACS 89","type":"book_chapter","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"16745","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["3540508406"]},"publication_status":"published","citation":{"bibtex":"@inbook{Meyer auf der Heide_1989, place={Berlin/Heidelberg}, title={On genuinely time bounded computations}, DOI={<a href=\"https://doi.org/10.1007/bfb0028969\">10.1007/bfb0028969</a>}, booktitle={STACS 89}, author={Meyer auf der Heide, Friedhelm}, year={1989} }","short":"F. Meyer auf der Heide, in: STACS 89, Berlin/Heidelberg, 1989.","mla":"Meyer auf der Heide, Friedhelm. “On Genuinely Time Bounded Computations.” <i>STACS 89</i>, 1989, doi:<a href=\"https://doi.org/10.1007/bfb0028969\">10.1007/bfb0028969</a>.","apa":"Meyer auf der Heide, F. (1989). On genuinely time bounded computations. In <i>STACS 89</i>. Berlin/Heidelberg. <a href=\"https://doi.org/10.1007/bfb0028969\">https://doi.org/10.1007/bfb0028969</a>","ama":"Meyer auf der Heide F. On genuinely time bounded computations. In: <i>STACS 89</i>. Berlin/Heidelberg; 1989. doi:<a href=\"https://doi.org/10.1007/bfb0028969\">10.1007/bfb0028969</a>","chicago":"Meyer auf der Heide, Friedhelm. “On Genuinely Time Bounded Computations.” In <i>STACS 89</i>. Berlin/Heidelberg, 1989. <a href=\"https://doi.org/10.1007/bfb0028969\">https://doi.org/10.1007/bfb0028969</a>.","ieee":"F. Meyer auf der Heide, “On genuinely time bounded computations,” in <i>STACS 89</i>, Berlin/Heidelberg, 1989."},"place":"Berlin/Heidelberg","year":"1989","date_created":"2020-04-20T11:51:54Z","author":[{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/bfb0028969","title":"On genuinely time bounded computations"},{"title":"Time-optimal simulations of networks by universal parallel computers","doi":"10.1007/bfb0028978","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":"Rolf","last_name":"Wanka","full_name":"Wanka, Rolf"}],"date_created":"2020-04-20T11:52:46Z","year":"1989","place":"Berlin/Heidelberg","citation":{"chicago":"Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Time-Optimal Simulations of Networks by Universal Parallel Computers.” In <i>STACS 89</i>. Berlin/Heidelberg, 1989. <a href=\"https://doi.org/10.1007/bfb0028978\">https://doi.org/10.1007/bfb0028978</a>.","ieee":"F. Meyer auf der Heide and R. Wanka, “Time-optimal simulations of networks by universal parallel computers,” in <i>STACS 89</i>, Berlin/Heidelberg, 1989.","ama":"Meyer auf der Heide F, Wanka R. Time-optimal simulations of networks by universal parallel computers. In: <i>STACS 89</i>. Berlin/Heidelberg; 1989. doi:<a href=\"https://doi.org/10.1007/bfb0028978\">10.1007/bfb0028978</a>","apa":"Meyer auf der Heide, F., &#38; Wanka, R. (1989). Time-optimal simulations of networks by universal parallel computers. In <i>STACS 89</i>. Berlin/Heidelberg. <a href=\"https://doi.org/10.1007/bfb0028978\">https://doi.org/10.1007/bfb0028978</a>","bibtex":"@inbook{Meyer auf der Heide_Wanka_1989, place={Berlin/Heidelberg}, title={Time-optimal simulations of networks by universal parallel computers}, DOI={<a href=\"https://doi.org/10.1007/bfb0028978\">10.1007/bfb0028978</a>}, booktitle={STACS 89}, author={Meyer auf der Heide, Friedhelm and Wanka, Rolf}, year={1989} }","mla":"Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Time-Optimal Simulations of Networks by Universal Parallel Computers.” <i>STACS 89</i>, 1989, doi:<a href=\"https://doi.org/10.1007/bfb0028978\">10.1007/bfb0028978</a>.","short":"F. Meyer auf der Heide, R. Wanka, in: STACS 89, Berlin/Heidelberg, 1989."},"publication_identifier":{"isbn":["3540508406"]},"publication_status":"published","language":[{"iso":"eng"}],"_id":"16746","department":[{"_id":"63"}],"user_id":"15415","status":"public","publication":"STACS 89","type":"book_chapter"},{"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540508403","9783540460985"]},"citation":{"short":"F. Meyer auf der Heide, in: STACS 89, Berlin, Heidelberg, 1989.","bibtex":"@inbook{Meyer auf der Heide_1989, place={Berlin, Heidelberg}, title={Computing minimum spanning forests on 1- and 2-dimensional processor arrays}, DOI={<a href=\"https://doi.org/10.1007/bfb0028983\">10.1007/bfb0028983</a>}, booktitle={STACS 89}, author={Meyer auf der Heide, Friedhelm}, year={1989} }","mla":"Meyer auf der Heide, Friedhelm. “Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays.” <i>STACS 89</i>, 1989, doi:<a href=\"https://doi.org/10.1007/bfb0028983\">10.1007/bfb0028983</a>.","apa":"Meyer auf der Heide, F. (1989). Computing minimum spanning forests on 1- and 2-dimensional processor arrays. In <i>STACS 89</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/bfb0028983\">https://doi.org/10.1007/bfb0028983</a>","chicago":"Meyer auf der Heide, Friedhelm. “Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays.” In <i>STACS 89</i>. Berlin, Heidelberg, 1989. <a href=\"https://doi.org/10.1007/bfb0028983\">https://doi.org/10.1007/bfb0028983</a>.","ieee":"F. Meyer auf der Heide, “Computing minimum spanning forests on 1- and 2-dimensional processor arrays,” in <i>STACS 89</i>, Berlin, Heidelberg, 1989.","ama":"Meyer auf der Heide F. Computing minimum spanning forests on 1- and 2-dimensional processor arrays. In: <i>STACS 89</i>. Berlin, Heidelberg; 1989. doi:<a href=\"https://doi.org/10.1007/bfb0028983\">10.1007/bfb0028983</a>"},"place":"Berlin, Heidelberg","year":"1989","date_created":"2020-04-21T11:37:58Z","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","doi":"10.1007/bfb0028983","title":"Computing minimum spanning forests on 1- and 2-dimensional processor arrays","type":"book_chapter","publication":"STACS 89","status":"public","user_id":"15415","department":[{"_id":"63"}],"_id":"16789","language":[{"iso":"eng"}]},{"status":"public","type":"journal_article","publication":"Information and Computation","language":[{"iso":"eng"}],"_id":"16763","user_id":"15415","department":[{"_id":"63"}],"year":"1988","citation":{"ama":"Babai L, Just B, Meyer auf der Heide F. On the limits of computations with the floor function. <i>Information and Computation</i>. 1988:99-107. doi:<a href=\"https://doi.org/10.1016/0890-5401(88)90031-4\">10.1016/0890-5401(88)90031-4</a>","ieee":"L. Babai, B. Just, and F. Meyer auf der Heide, “On the limits of computations with the floor function,” <i>Information and Computation</i>, pp. 99–107, 1988.","chicago":"Babai, László, Bettina Just, and Friedhelm Meyer auf der Heide. “On the Limits of Computations with the Floor Function.” <i>Information and Computation</i>, 1988, 99–107. <a href=\"https://doi.org/10.1016/0890-5401(88)90031-4\">https://doi.org/10.1016/0890-5401(88)90031-4</a>.","mla":"Babai, László, et al. “On the Limits of Computations with the Floor Function.” <i>Information and Computation</i>, 1988, pp. 99–107, doi:<a href=\"https://doi.org/10.1016/0890-5401(88)90031-4\">10.1016/0890-5401(88)90031-4</a>.","bibtex":"@article{Babai_Just_Meyer auf der Heide_1988, title={On the limits of computations with the floor function}, DOI={<a href=\"https://doi.org/10.1016/0890-5401(88)90031-4\">10.1016/0890-5401(88)90031-4</a>}, journal={Information and Computation}, author={Babai, László and Just, Bettina and Meyer auf der Heide, Friedhelm}, year={1988}, pages={99–107} }","short":"L. Babai, B. Just, F. Meyer auf der Heide, Information and Computation (1988) 99–107.","apa":"Babai, L., Just, B., &#38; Meyer auf der Heide, F. (1988). On the limits of computations with the floor function. <i>Information and Computation</i>, 99–107. <a href=\"https://doi.org/10.1016/0890-5401(88)90031-4\">https://doi.org/10.1016/0890-5401(88)90031-4</a>"},"page":"99-107","publication_status":"published","publication_identifier":{"issn":["0890-5401"]},"title":"On the limits of computations with the floor function","doi":"10.1016/0890-5401(88)90031-4","date_updated":"2022-01-06T06:52:55Z","date_created":"2020-04-21T08:50:17Z","author":[{"first_name":"László","last_name":"Babai","full_name":"Babai, László"},{"last_name":"Just","full_name":"Just, Bettina","first_name":"Bettina"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}]},{"publication_identifier":{"issn":["0004-5411","1557-735X"]},"publication_status":"published","page":"740-747","citation":{"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>","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>.","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>","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} }","short":"F. Meyer auf der Heide, Journal of the ACM (JACM) (1988) 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>."},"year":"1988","date_created":"2020-04-21T08:51:54Z","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:55Z","doi":"10.1145/44483.44490","title":"Fast algorithms for N-dimensional restrictions of hard problems","publication":"Journal of the ACM (JACM)","type":"journal_article","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"16764","language":[{"iso":"eng"}]},{"publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","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>"},"year":"1988","date_created":"2020-04-21T08:53:13Z","author":[{"first_name":"Allan","last_name":"Borodin","full_name":"Borodin, Allan"},{"full_name":"Fich, Faith E.","last_name":"Fich","first_name":"Faith E."},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Eli","last_name":"Upfal","full_name":"Upfal, Eli"},{"last_name":"Wigderson","full_name":"Wigderson, Avi","first_name":"Avi"}],"date_updated":"2022-01-06T06:52:55Z","doi":"10.1016/0304-3975(88)90018-7","title":"A tradeoff between search and update time for the implicit dictionary problem","publication":"Theoretical Computer Science","type":"journal_article","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"16765","language":[{"iso":"eng"}]},{"title":"Dynamic perfect hashing: upper and lower bounds","doi":"10.1109/sfcs.1988.21968","date_updated":"2022-01-06T06:52:55Z","date_created":"2020-04-21T08:59:26Z","author":[{"first_name":"M.","full_name":"Dietzfelbinger, M.","last_name":"Dietzfelbinger"},{"first_name":"A.","last_name":"Karlin","full_name":"Karlin, A."},{"last_name":"Mehlhorn","full_name":"Mehlhorn, K.","first_name":"K."},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Rohnert","full_name":"Rohnert, H.","first_name":"H."},{"full_name":"Tarjan, R.E.","last_name":"Tarjan","first_name":"R.E."}],"year":"1988","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} }","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>.","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.","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.","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>.","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>"},"publication_status":"published","publication_identifier":{"isbn":["0818608773"]},"language":[{"iso":"eng"}],"_id":"16766","user_id":"15415","department":[{"_id":"63"}],"status":"public","type":"conference","publication":"[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science"},{"doi":"10.1007/bfb0035829","title":"On computations with integer division","date_created":"2020-04-21T09:00:37Z","author":[{"last_name":"Just","full_name":"Just, Bettina","first_name":"Bettina"},{"first_name":"Fb","full_name":"Mathematik, Fb","last_name":"Mathematik"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Fb","last_name":"Informatik","full_name":"Informatik, Fb"},{"first_name":"Avi","last_name":"Wigderson","full_name":"Wigderson, Avi"}],"date_updated":"2022-01-06T06:52:55Z","citation":{"short":"B. Just, F. Mathematik, F. Meyer auf der Heide, F. Informatik, A. Wigderson, in: STACS 88, Berlin, Heidelberg, 1988.","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} }","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>.","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>","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>.","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>"},"place":"Berlin, Heidelberg","year":"1988","publication_status":"published","publication_identifier":{"isbn":["9783540188346","9783540481904"],"issn":["0302-9743","1611-3349"]},"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16767","status":"public","type":"book_chapter","publication":"STACS 88"},{"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":{"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>.","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} }","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>.","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>"},"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","author":[{"first_name":"M.","last_name":"Dietzfelbinger","full_name":"Dietzfelbinger, M."},{"first_name":"K.","full_name":"Mehlhorn, K.","last_name":"Mehlhorn"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"H.","full_name":"Rohnert, H.","last_name":"Rohnert"}],"date_created":"2020-04-21T09:01:36Z"},{"publication":"SIAM Journal on Computing","type":"journal_article","status":"public","_id":"16772","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0097-5397","1095-7111"]},"publication_status":"published","year":"1987","page":"97-99","citation":{"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>","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.","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>.","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} }","short":"A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, SIAM Journal on Computing (1987) 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>"},"date_updated":"2022-01-06T06:52:55Z","date_created":"2020-04-21T10:00:29Z","author":[{"first_name":"A.","last_name":"Borodin","full_name":"Borodin, A."},{"first_name":"F.","last_name":"Fich","full_name":"Fich, F."},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Upfal","full_name":"Upfal, E.","first_name":"E."},{"full_name":"Wigderson, A.","last_name":"Wigderson","first_name":"A."}],"title":"A Time-Space Tradeoff for Element Distinctness","doi":"10.1137/0216007"},{"language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16773","status":"public","publication":"SIAM Journal on Computing","type":"journal_article","doi":"10.1137/0216008","title":"The Complexity of Parallel Sorting","date_created":"2020-04-21T10:01:37Z","author":[{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Avi","full_name":"Wigderson, Avi","last_name":"Wigderson"}],"date_updated":"2022-01-06T06:52:55Z","page":"100-107","citation":{"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>","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>.","short":"F. Meyer auf der Heide, A. Wigderson, SIAM Journal on Computing (1987) 100–107.","ieee":"F. Meyer auf der Heide and A. Wigderson, “The Complexity of Parallel Sorting,” <i>SIAM Journal on Computing</i>, pp. 100–107, 1987.","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>.","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>"},"year":"1987","publication_identifier":{"issn":["0097-5397","1095-7111"]},"publication_status":"published"},{"publication_status":"published","publication_identifier":{"issn":["0097-5397","1095-7111"]},"year":"1986","citation":{"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.","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>","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>"},"page":"106-119","date_updated":"2022-01-06T06:52:55Z","author":[{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"date_created":"2020-04-21T09:59:29Z","title":"Efficient Simulations among Several Models of Parallel Computers","doi":"10.1137/0215008","type":"journal_article","publication":"SIAM Journal on Computing","status":"public","_id":"16771","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}]},{"_id":"16774","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication":"Automata, Languages and Programming","type":"book_chapter","status":"public","date_updated":"2022-01-06T06:52:55Z","date_created":"2020-04-21T10:05:54Z","author":[{"first_name":"Allan","last_name":"Borodin","full_name":"Borodin, Allan"},{"first_name":"Faith E.","last_name":"Fich","full_name":"Fich, Faith E."},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Upfal, Eli","last_name":"Upfal","first_name":"Eli"},{"first_name":"Avi","full_name":"Wigderson, Avi","last_name":"Wigderson"}],"title":"A tradeoff between search and update time for the implicit dictionary problem","doi":"10.1007/3-540-16761-7_54","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540167617","9783540398592"]},"publication_status":"published","place":"Berlin, Heidelberg","year":"1986","citation":{"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>","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>.","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} }","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>.","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.","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>"}},{"user_id":"15415","department":[{"_id":"63"}],"_id":"16775","language":[{"iso":"eng"}],"type":"book_chapter","publication":"STACS 86","status":"public","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_created":"2020-04-21T10:07:06Z","date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/3-540-16078-7_72","title":"Speeding up random access machines by few processors","publication_status":"published","publication_identifier":{"isbn":["9783540160786","9783540397588"],"issn":["0302-9743","1611-3349"]},"citation":{"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>","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} }","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>.","short":"F. Meyer auf der Heide, in: STACS 86, Berlin, Heidelberg, 1986.","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."},"place":"Berlin, Heidelberg","year":"1986"},{"date_created":"2020-04-21T10:08:23Z","author":[{"full_name":"Borodin, A.","last_name":"Borodin","first_name":"A."},{"first_name":"F.","last_name":"Fich","full_name":"Fich, F."},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"E.","last_name":"Upfal","full_name":"Upfal, E."},{"first_name":"A.","full_name":"Wigderson, A.","last_name":"Wigderson"}],"date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/3-540-16078-7_89","title":"A time-space tradeoff for element distinctness","publication_status":"published","publication_identifier":{"isbn":["9783540160786","9783540397588"],"issn":["0302-9743","1611-3349"]},"citation":{"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>.","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>","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>","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>.","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} }","short":"A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in: STACS 86, Berlin, Heidelberg, 1986."},"place":"Berlin, Heidelberg","year":"1986","user_id":"15415","department":[{"_id":"63"}],"_id":"16776","language":[{"iso":"eng"}],"type":"book_chapter","publication":"STACS 86","status":"public"},{"_id":"16779","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Information Processing Letters","status":"public","date_updated":"2022-01-06T06:52:55Z","date_created":"2020-04-21T10:15:46Z","author":[{"first_name":"Clemens","full_name":"Lautemann, Clemens","last_name":"Lautemann"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"title":"Lower time bounds for integer programming with two variables","doi":"10.1016/0020-0190(85)90042-0","publication_status":"published","publication_identifier":{"issn":["0020-0190"]},"year":"1985","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>.","short":"C. Lautemann, F. Meyer auf der Heide, Information Processing Letters (1985) 101–105.","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} }","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>","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>.","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."},"page":"101-105"},{"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16780","status":"public","type":"journal_article","publication":"Journal of the ACM (JACM)","doi":"10.1145/4221.4250","title":"Lower bounds for solving linear diophantine equations on random access machines","author":[{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"date_created":"2020-04-21T10:16:50Z","date_updated":"2022-01-06T06:52:55Z","citation":{"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>","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>.","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>"},"page":"929-937","year":"1985","publication_status":"published","publication_identifier":{"issn":["0004-5411","1557-735X"]}},{"type":"journal_article","publication":"Theoretical Computer Science","status":"public","_id":"16781","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0304-3975"]},"year":"1985","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>","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.","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>.","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>","ieee":"F. Meyer auf der Heide, “Simulating probabilistic by deterministic algebraic computation trees,” <i>Theoretical Computer Science</i>, pp. 325–330, 1985.","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>."},"page":"325-330","date_updated":"2022-01-06T06:52:55Z","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_created":"2020-04-21T11:18:44Z","title":"Simulating probabilistic by deterministic algebraic computation trees","doi":"10.1016/0304-3975(85)90079-9"}]