--- _id: '16764' 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. Fast algorithms for N-dimensional restrictions of hard problems. Journal of the ACM (JACM). 1988:740-747. doi:10.1145/44483.44490 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 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} }' 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. ieee: F. Meyer auf der Heide, “Fast algorithms for N-dimensional restrictions of hard problems,” Journal of the ACM (JACM), pp. 740–747, 1988. 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. short: F. Meyer auf der Heide, Journal of the ACM (JACM) (1988) 740–747. date_created: 2020-04-21T08:51:54Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1145/44483.44490 language: - iso: eng page: 740-747 publication: Journal of the ACM (JACM) publication_identifier: issn: - 0004-5411 - 1557-735X publication_status: published status: public title: Fast algorithms for N-dimensional restrictions of hard problems type: journal_article user_id: '15415' year: '1988' ... --- _id: '16765' author: - first_name: Allan full_name: Borodin, Allan last_name: Borodin - first_name: Faith E. full_name: Fich, Faith E. last_name: Fich - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Eli full_name: Upfal, Eli last_name: Upfal - first_name: Avi full_name: Wigderson, Avi last_name: Wigderson citation: ama: Borodin A, Fich FE, Meyer auf der Heide F, Upfal E, Wigderson A. A tradeoff between search and update time for the implicit dictionary problem. Theoretical Computer Science. 1988:57-68. doi:10.1016/0304-3975(88)90018-7 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 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} }' 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. 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. 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. short: A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, Theoretical Computer Science (1988) 57–68. date_created: 2020-04-21T08:53:13Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1016/0304-3975(88)90018-7 language: - iso: eng page: 57-68 publication: Theoretical Computer Science publication_identifier: issn: - 0304-3975 publication_status: published status: public title: A tradeoff between search and update time for the implicit dictionary problem type: journal_article user_id: '15415' year: '1988' ... --- _id: '16766' author: - first_name: M. full_name: Dietzfelbinger, M. last_name: Dietzfelbinger - first_name: A. full_name: Karlin, A. last_name: Karlin - first_name: K. full_name: Mehlhorn, K. last_name: Mehlhorn - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: H. full_name: Rohnert, H. last_name: Rohnert - first_name: R.E. full_name: Tarjan, R.E. last_name: Tarjan citation: 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} }' 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.' 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.' 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.' 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.' date_created: 2020-04-21T08:59:26Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1109/sfcs.1988.21968 language: - iso: eng publication: '[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science' publication_identifier: isbn: - '0818608773' publication_status: published status: public title: 'Dynamic perfect hashing: upper and lower bounds' type: conference user_id: '15415' year: '1988' ... --- _id: '16767' author: - first_name: Bettina full_name: Just, Bettina last_name: Just - first_name: Fb full_name: Mathematik, Fb last_name: Mathematik - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Fb full_name: Informatik, Fb last_name: Informatik - first_name: Avi full_name: Wigderson, Avi last_name: Wigderson 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 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} }' 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. 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. 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.' date_created: 2020-04-21T09:00:37Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1007/bfb0035829 language: - iso: eng place: Berlin, Heidelberg publication: STACS 88 publication_identifier: isbn: - '9783540188346' - '9783540481904' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: On computations with integer division type: book_chapter user_id: '15415' year: '1988' ... --- _id: '16768' author: - first_name: M. full_name: Dietzfelbinger, M. last_name: Dietzfelbinger - first_name: K. full_name: Mehlhorn, K. last_name: Mehlhorn - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: H. full_name: Rohnert, H. last_name: Rohnert citation: 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' 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 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} }' 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. 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. 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.' date_created: 2020-04-21T09:01:36Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1007/3-540-19487-8_24 language: - iso: eng place: Berlin, Heidelberg publication: SWAT 88 publication_identifier: isbn: - '9783540194873' - '9783540392880' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Upper and lower bounds for the dictionary problem type: book_chapter user_id: '15415' year: '1988' ... --- _id: '16772' author: - first_name: A. full_name: Borodin, A. last_name: Borodin - first_name: F. full_name: Fich, F. last_name: Fich - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: E. full_name: Upfal, E. last_name: Upfal - first_name: A. full_name: Wigderson, A. last_name: Wigderson citation: 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 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} }' 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. 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. mla: Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.” SIAM Journal on Computing, 1987, pp. 97–99, doi:10.1137/0216007. short: A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, SIAM Journal on Computing (1987) 97–99. date_created: 2020-04-21T10:00:29Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1137/0216007 language: - iso: eng page: 97-99 publication: SIAM Journal on Computing publication_identifier: issn: - 0097-5397 - 1095-7111 publication_status: published status: public title: A Time-Space Tradeoff for Element Distinctness type: journal_article user_id: '15415' year: '1987' ... --- _id: '16773' author: - 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: Meyer auf der Heide F, Wigderson A. The Complexity of Parallel Sorting. SIAM Journal on Computing. 1987:100-107. doi: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 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} }' 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. ieee: F. Meyer auf der Heide and A. Wigderson, “The Complexity of Parallel Sorting,” SIAM Journal on Computing, pp. 100–107, 1987. 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. short: F. Meyer auf der Heide, A. Wigderson, SIAM Journal on Computing (1987) 100–107. date_created: 2020-04-21T10:01:37Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1137/0216008 language: - iso: eng page: 100-107 publication: SIAM Journal on Computing publication_identifier: issn: - 0097-5397 - 1095-7111 publication_status: published status: public title: The Complexity of Parallel Sorting type: journal_article user_id: '15415' year: '1987' ... --- _id: '16771' 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. 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 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} }' 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. 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. short: F. Meyer auf der Heide, SIAM Journal on Computing (1986) 106–119. date_created: 2020-04-21T09:59:29Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1137/0215008 language: - iso: eng page: 106-119 publication: SIAM Journal on Computing publication_identifier: issn: - 0097-5397 - 1095-7111 publication_status: published status: public title: Efficient Simulations among Several Models of Parallel Computers type: journal_article user_id: '15415' year: '1986' ... --- _id: '16774' author: - first_name: Allan full_name: Borodin, Allan last_name: Borodin - first_name: Faith E. full_name: Fich, Faith E. last_name: Fich - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Eli full_name: Upfal, Eli last_name: Upfal - first_name: Avi full_name: Wigderson, Avi last_name: Wigderson citation: ama: 'Borodin A, Fich FE, Meyer auf der Heide F, Upfal E, Wigderson A. A tradeoff between search and update time for the implicit dictionary problem. In: 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 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} }' 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. 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. 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. short: 'A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in: Automata, Languages and Programming, Berlin, Heidelberg, 1986.' date_created: 2020-04-21T10:05:54Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1007/3-540-16761-7_54 language: - iso: eng place: Berlin, Heidelberg publication: Automata, Languages and Programming publication_identifier: isbn: - '9783540167617' - '9783540398592' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: A tradeoff between search and update time for the implicit dictionary problem type: book_chapter user_id: '15415' year: '1986' ... --- _id: '16775' 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. 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 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} }' 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. ieee: F. Meyer auf der Heide, “Speeding up random access machines by few processors,” in STACS 86, Berlin, Heidelberg, 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. short: 'F. Meyer auf der Heide, in: STACS 86, Berlin, Heidelberg, 1986.' date_created: 2020-04-21T10:07:06Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1007/3-540-16078-7_72 language: - iso: eng place: Berlin, Heidelberg publication: STACS 86 publication_identifier: isbn: - '9783540160786' - '9783540397588' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Speeding up random access machines by few processors type: book_chapter user_id: '15415' year: '1986' ...