--- _id: '16740' author: - first_name: Marek full_name: Karpinski, Marek last_name: Karpinski - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Karpinski M, Meyer auf der Heide F. On the complexity of genuinely polynomial computation. In: Lecture Notes in Computer Science. Berlin/Heidelberg; 1990. doi:10.1007/bfb0029630' apa: Karpinski, M., & Meyer auf der Heide, F. (1990). On the complexity of genuinely polynomial computation. In Lecture Notes in Computer Science. Berlin/Heidelberg. https://doi.org/10.1007/bfb0029630 bibtex: '@inbook{Karpinski_Meyer auf der Heide_1990, place={Berlin/Heidelberg}, title={On the complexity of genuinely polynomial computation}, DOI={10.1007/bfb0029630}, booktitle={Lecture Notes in Computer Science}, author={Karpinski, Marek and Meyer auf der Heide, Friedhelm}, year={1990} }' chicago: Karpinski, Marek, and Friedhelm Meyer auf der Heide. “On the Complexity of Genuinely Polynomial Computation.” In Lecture Notes in Computer Science. Berlin/Heidelberg, 1990. https://doi.org/10.1007/bfb0029630. ieee: M. Karpinski and F. Meyer auf der Heide, “On the complexity of genuinely polynomial computation,” in Lecture Notes in Computer Science, Berlin/Heidelberg, 1990. mla: Karpinski, Marek, and Friedhelm Meyer auf der Heide. “On the Complexity of Genuinely Polynomial Computation.” Lecture Notes in Computer Science, 1990, doi:10.1007/bfb0029630. short: 'M. Karpinski, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.' date_created: 2020-04-20T11:40:17Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1007/bfb0029630 language: - iso: eng place: Berlin/Heidelberg publication: Lecture Notes in Computer Science publication_identifier: isbn: - '3540529535' publication_status: published status: public title: On the complexity of genuinely polynomial computation type: book_chapter user_id: '15415' year: '1990' ... --- _id: '16741' author: - first_name: M. full_name: Dietzfelbinger, M. last_name: Dietzfelbinger - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Dietzfelbinger M, Meyer auf der Heide F. How to distribute a dictionary in a complete network. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90. ; 1990. doi:10.1145/100216.100229' apa: Dietzfelbinger, M., & Meyer auf der Heide, F. (1990). How to distribute a dictionary in a complete network. In Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90. https://doi.org/10.1145/100216.100229 bibtex: '@inproceedings{Dietzfelbinger_Meyer auf der Heide_1990, title={How to distribute a dictionary in a complete network}, DOI={10.1145/100216.100229}, booktitle={Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90}, author={Dietzfelbinger, M. and Meyer auf der Heide, Friedhelm}, year={1990} }' chicago: Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “How to Distribute a Dictionary in a Complete Network.” In Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990. https://doi.org/10.1145/100216.100229. ieee: M. Dietzfelbinger and F. Meyer auf der Heide, “How to distribute a dictionary in a complete network,” in Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90, 1990. mla: Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “How to Distribute a Dictionary in a Complete Network.” Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990, doi:10.1145/100216.100229. short: 'M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990.' date_created: 2020-04-20T11:41:08Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1145/100216.100229 language: - iso: eng publication: Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 publication_identifier: isbn: - '0897913612' publication_status: published status: public title: How to distribute a dictionary in a complete network type: conference user_id: '15415' year: '1990' ... --- _id: '16742' author: - first_name: J. full_name: Gil, J. last_name: Gil - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: A. full_name: Wigderson, A. last_name: Wigderson citation: ama: 'Gil J, Meyer auf der Heide F, Wigderson A. Not all keys can be hashed in constant time. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90. ; 1990. doi:10.1145/100216.100247' apa: Gil, J., Meyer auf der Heide, F., & Wigderson, A. (1990). Not all keys can be hashed in constant time. In Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90. https://doi.org/10.1145/100216.100247 bibtex: '@inproceedings{Gil_Meyer auf der Heide_Wigderson_1990, title={Not all keys can be hashed in constant time}, DOI={10.1145/100216.100247}, booktitle={Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90}, author={Gil, J. and Meyer auf der Heide, Friedhelm and Wigderson, A.}, year={1990} }' chicago: Gil, J., Friedhelm Meyer auf der Heide, and A. Wigderson. “Not All Keys Can Be Hashed in Constant Time.” In Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990. https://doi.org/10.1145/100216.100247. ieee: J. Gil, F. Meyer auf der Heide, and A. Wigderson, “Not all keys can be hashed in constant time,” in Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90, 1990. mla: Gil, J., et al. “Not All Keys Can Be Hashed in Constant Time.” Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990, doi:10.1145/100216.100247. short: 'J. Gil, F. Meyer auf der Heide, A. Wigderson, in: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990.' date_created: 2020-04-20T11:41:55Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1145/100216.100247 language: - iso: eng publication: Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 publication_identifier: isbn: - '0897913612' publication_status: published status: public title: Not all keys can be hashed in constant time type: conference user_id: '15415' year: '1990' ... --- _id: '16824' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Meyer auf der Heide F. Das Heinz Nixdorf-Institut der Universität-GH Paderborn. Informatik Spektrum. 1990;13(4):231-232. apa: Meyer auf der Heide, F. (1990). Das Heinz Nixdorf-Institut der Universität-GH Paderborn. Informatik Spektrum, 13(4), 231–232. bibtex: '@article{Meyer auf der Heide_1990, title={Das Heinz Nixdorf-Institut der Universität-GH Paderborn}, volume={13}, number={4}, journal={Informatik Spektrum}, author={Meyer auf der Heide, Friedhelm}, year={1990}, pages={231–232} }' chicago: 'Meyer auf der Heide, Friedhelm. “Das Heinz Nixdorf-Institut Der Universität-GH Paderborn.” Informatik Spektrum 13, no. 4 (1990): 231–32.' ieee: F. Meyer auf der Heide, “Das Heinz Nixdorf-Institut der Universität-GH Paderborn,” Informatik Spektrum, vol. 13, no. 4, pp. 231–232, 1990. mla: Meyer auf der Heide, Friedhelm. “Das Heinz Nixdorf-Institut Der Universität-GH Paderborn.” Informatik Spektrum, vol. 13, no. 4, 1990, pp. 231–32. short: F. Meyer auf der Heide, Informatik Spektrum 13 (1990) 231–232. date_created: 2020-04-22T10:28:27Z date_updated: 2022-01-06T06:52:56Z department: - _id: '63' intvolume: ' 13' issue: '4' language: - iso: eng page: 231-232 publication: Informatik Spektrum status: public title: Das Heinz Nixdorf-Institut der Universität-GH Paderborn type: journal_article user_id: '15415' volume: 13 year: '1990' ... --- _id: '16743' author: - first_name: Bettina full_name: Just, Bettina last_name: Just - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Avi full_name: Wigderson, Avi last_name: Wigderson citation: ama: Just B, Meyer auf der Heide F, Wigderson A. On computations with integer division. RAIRO - Theoretical Informatics and Applications. 1989:101-111. doi:10.1051/ita/1989230101011 apa: Just, B., Meyer auf der Heide, F., & Wigderson, A. (1989). On computations with integer division. RAIRO - Theoretical Informatics and Applications, 101–111. https://doi.org/10.1051/ita/1989230101011 bibtex: '@article{Just_Meyer auf der Heide_Wigderson_1989, title={On computations with integer division}, DOI={10.1051/ita/1989230101011}, journal={RAIRO - Theoretical Informatics and Applications}, author={Just, Bettina and Meyer auf der Heide, Friedhelm and Wigderson, Avi}, year={1989}, pages={101–111} }' chicago: Just, Bettina, Friedhelm Meyer auf der Heide, and Avi Wigderson. “On Computations with Integer Division.” RAIRO - Theoretical Informatics and Applications, 1989, 101–11. https://doi.org/10.1051/ita/1989230101011. ieee: B. Just, F. Meyer auf der Heide, and A. Wigderson, “On computations with integer division,” RAIRO - Theoretical Informatics and Applications, pp. 101–111, 1989. mla: Just, Bettina, et al. “On Computations with Integer Division.” RAIRO - Theoretical Informatics and Applications, 1989, pp. 101–11, doi:10.1051/ita/1989230101011. short: B. Just, F. Meyer auf der Heide, A. Wigderson, RAIRO - Theoretical Informatics and Applications (1989) 101–111. date_created: 2020-04-20T11:49:38Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1051/ita/1989230101011 language: - iso: eng page: 101-111 publication: RAIRO - Theoretical Informatics and Applications publication_identifier: issn: - 0988-3754 - 1290-385X publication_status: published status: public title: On computations with integer division type: journal_article user_id: '15415' year: '1989' ... --- _id: '16744' author: - first_name: M. full_name: Dietzfelbinger, M. last_name: Dietzfelbinger - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Dietzfelbinger M, Meyer auf der Heide F. An optimal parallel dictionary. In: Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’89. ; 1989. doi:10.1145/72935.72974' apa: Dietzfelbinger, M., & Meyer auf der Heide, F. (1989). An optimal parallel dictionary. In Proceedings of the first annual ACM symposium on Parallel algorithms and architectures  - SPAA ’89. https://doi.org/10.1145/72935.72974 bibtex: '@inproceedings{Dietzfelbinger_Meyer auf der Heide_1989, title={An optimal parallel dictionary}, DOI={10.1145/72935.72974}, 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} }' chicago: Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.” In Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’89, 1989. https://doi.org/10.1145/72935.72974. ieee: M. Dietzfelbinger and F. Meyer auf der Heide, “An optimal parallel dictionary,” in Proceedings of the first annual ACM symposium on Parallel algorithms and architectures  - SPAA ’89, 1989. mla: Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.” Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’89, 1989, doi:10.1145/72935.72974. short: 'M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’89, 1989.' date_created: 2020-04-20T11:51:01Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1145/72935.72974 language: - iso: eng publication: Proceedings of the first annual ACM symposium on Parallel algorithms and architectures - SPAA '89 publication_identifier: isbn: - 089791323X publication_status: published status: public title: An optimal parallel dictionary type: conference user_id: '15415' year: '1989' ... --- _id: '16745' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Meyer auf der Heide F. On genuinely time bounded computations. In: STACS 89. Berlin/Heidelberg; 1989. doi:10.1007/bfb0028969' apa: Meyer auf der Heide, F. (1989). On genuinely time bounded computations. In STACS 89. Berlin/Heidelberg. https://doi.org/10.1007/bfb0028969 bibtex: '@inbook{Meyer auf der Heide_1989, place={Berlin/Heidelberg}, title={On genuinely time bounded computations}, DOI={10.1007/bfb0028969}, booktitle={STACS 89}, author={Meyer auf der Heide, Friedhelm}, year={1989} }' chicago: Meyer auf der Heide, Friedhelm. “On Genuinely Time Bounded Computations.” In STACS 89. Berlin/Heidelberg, 1989. https://doi.org/10.1007/bfb0028969. ieee: F. Meyer auf der Heide, “On genuinely time bounded computations,” in STACS 89, Berlin/Heidelberg, 1989. mla: Meyer auf der Heide, Friedhelm. “On Genuinely Time Bounded Computations.” STACS 89, 1989, doi:10.1007/bfb0028969. short: 'F. Meyer auf der Heide, in: STACS 89, Berlin/Heidelberg, 1989.' date_created: 2020-04-20T11:51:54Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1007/bfb0028969 language: - iso: eng place: Berlin/Heidelberg publication: STACS 89 publication_identifier: isbn: - '3540508406' publication_status: published status: public title: On genuinely time bounded computations type: book_chapter user_id: '15415' year: '1989' ... --- _id: '16746' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Rolf full_name: Wanka, Rolf last_name: Wanka citation: ama: 'Meyer auf der Heide F, Wanka R. Time-optimal simulations of networks by universal parallel computers. In: STACS 89. Berlin/Heidelberg; 1989. doi:10.1007/bfb0028978' apa: Meyer auf der Heide, F., & Wanka, R. (1989). Time-optimal simulations of networks by universal parallel computers. In STACS 89. Berlin/Heidelberg. https://doi.org/10.1007/bfb0028978 bibtex: '@inbook{Meyer auf der Heide_Wanka_1989, place={Berlin/Heidelberg}, title={Time-optimal simulations of networks by universal parallel computers}, DOI={10.1007/bfb0028978}, booktitle={STACS 89}, author={Meyer auf der Heide, Friedhelm and Wanka, Rolf}, year={1989} }' chicago: Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Time-Optimal Simulations of Networks by Universal Parallel Computers.” In STACS 89. Berlin/Heidelberg, 1989. https://doi.org/10.1007/bfb0028978. ieee: F. Meyer auf der Heide and R. Wanka, “Time-optimal simulations of networks by universal parallel computers,” in STACS 89, Berlin/Heidelberg, 1989. mla: Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Time-Optimal Simulations of Networks by Universal Parallel Computers.” STACS 89, 1989, doi:10.1007/bfb0028978. short: 'F. Meyer auf der Heide, R. Wanka, in: STACS 89, Berlin/Heidelberg, 1989.' date_created: 2020-04-20T11:52:46Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1007/bfb0028978 language: - iso: eng place: Berlin/Heidelberg publication: STACS 89 publication_identifier: isbn: - '3540508406' publication_status: published status: public title: Time-optimal simulations of networks by universal parallel computers type: book_chapter user_id: '15415' year: '1989' ... --- _id: '16789' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Meyer auf der Heide F. Computing minimum spanning forests on 1- and 2-dimensional processor arrays. In: STACS 89. Berlin, Heidelberg; 1989. doi:10.1007/bfb0028983' apa: Meyer auf der Heide, F. (1989). Computing minimum spanning forests on 1- and 2-dimensional processor arrays. In STACS 89. Berlin, Heidelberg. https://doi.org/10.1007/bfb0028983 bibtex: '@inbook{Meyer auf der Heide_1989, place={Berlin, Heidelberg}, title={Computing minimum spanning forests on 1- and 2-dimensional processor arrays}, DOI={10.1007/bfb0028983}, booktitle={STACS 89}, author={Meyer auf der Heide, Friedhelm}, year={1989} }' chicago: Meyer auf der Heide, Friedhelm. “Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays.” In STACS 89. Berlin, Heidelberg, 1989. https://doi.org/10.1007/bfb0028983. ieee: F. Meyer auf der Heide, “Computing minimum spanning forests on 1- and 2-dimensional processor arrays,” in STACS 89, Berlin, Heidelberg, 1989. mla: Meyer auf der Heide, Friedhelm. “Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays.” STACS 89, 1989, doi:10.1007/bfb0028983. short: 'F. Meyer auf der Heide, in: STACS 89, Berlin, Heidelberg, 1989.' date_created: 2020-04-21T11:37:58Z date_updated: 2022-01-06T06:52:56Z department: - _id: '63' doi: 10.1007/bfb0028983 language: - iso: eng place: Berlin, Heidelberg publication: STACS 89 publication_identifier: isbn: - '9783540508403' - '9783540460985' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Computing minimum spanning forests on 1- and 2-dimensional processor arrays type: book_chapter user_id: '15415' year: '1989' ... --- _id: '16763' author: - first_name: László full_name: Babai, László last_name: Babai - first_name: Bettina full_name: Just, Bettina last_name: Just - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Babai L, Just B, Meyer auf der Heide F. On the limits of computations with the floor function. Information and Computation. 1988:99-107. doi:10.1016/0890-5401(88)90031-4 apa: Babai, L., Just, B., & Meyer auf der Heide, F. (1988). On the limits of computations with the floor function. Information and Computation, 99–107. https://doi.org/10.1016/0890-5401(88)90031-4 bibtex: '@article{Babai_Just_Meyer auf der Heide_1988, title={On the limits of computations with the floor function}, DOI={10.1016/0890-5401(88)90031-4}, journal={Information and Computation}, author={Babai, László and Just, Bettina and Meyer auf der Heide, Friedhelm}, year={1988}, pages={99–107} }' chicago: Babai, László, Bettina Just, and Friedhelm Meyer auf der Heide. “On the Limits of Computations with the Floor Function.” Information and Computation, 1988, 99–107. https://doi.org/10.1016/0890-5401(88)90031-4. ieee: L. Babai, B. Just, and F. Meyer auf der Heide, “On the limits of computations with the floor function,” Information and Computation, pp. 99–107, 1988. mla: Babai, László, et al. “On the Limits of Computations with the Floor Function.” Information and Computation, 1988, pp. 99–107, doi:10.1016/0890-5401(88)90031-4. short: L. Babai, B. Just, F. Meyer auf der Heide, Information and Computation (1988) 99–107. date_created: 2020-04-21T08:50:17Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1016/0890-5401(88)90031-4 language: - iso: eng page: 99-107 publication: Information and Computation publication_identifier: issn: - 0890-5401 publication_status: published status: public title: On the limits of computations with the floor function type: journal_article user_id: '15415' year: '1988' ...