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