--- _id: '16732' author: - first_name: Katharina full_name: Lürwer-Brüggemeier, Katharina last_name: Lürwer-Brüggemeier - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Lürwer-Brüggemeier K, Meyer auf der Heide F. Capabilities and complexity of computations with integer division. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1993. doi:10.1007/3-540-56503-5_46' apa: Lürwer-Brüggemeier, K., & Meyer auf der Heide, F. (1993). Capabilities and complexity of computations with integer division. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_46 bibtex: '@inbook{Lürwer-Brüggemeier_Meyer auf der Heide_1993, place={Berlin, Heidelberg}, title={Capabilities and complexity of computations with integer division}, DOI={10.1007/3-540-56503-5_46}, booktitle={Lecture Notes in Computer Science}, author={Lürwer-Brüggemeier, Katharina and Meyer auf der Heide, Friedhelm}, year={1993} }' chicago: Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities and Complexity of Computations with Integer Division.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 1993. https://doi.org/10.1007/3-540-56503-5_46. ieee: K. Lürwer-Brüggemeier and F. Meyer auf der Heide, “Capabilities and complexity of computations with integer division,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1993. mla: Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities and Complexity of Computations with Integer Division.” Lecture Notes in Computer Science, 1993, doi:10.1007/3-540-56503-5_46. short: 'K. Lürwer-Brüggemeier, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1993.' date_created: 2020-04-20T11:25:51Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1007/3-540-56503-5_46 language: - iso: eng place: Berlin, Heidelberg publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783540565031' - '9783540475743' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Capabilities and complexity of computations with integer division type: book_chapter user_id: '15415' year: '1993' ... --- _id: '18936' abstract: - lang: eng text: 'We consider the following periodic sorting procedure on two-dimensional meshes of processors: Initially, each node contains one number. We proceed in rounds each round consisting of sorting the columns of the grid, and, in the second phase, of sorting the rows according to the snake-like ordering. We exactly characterize the number of rounds necessary to sort on an l × m-grid in the worst case, where l is the number of the rows and m the number of the columns. An upper bound of ⌈ log l⌉ + 1was known before. This bound is tight for the case that m is not a power of 2. Surprisingly, it turns out that far fewer rounds are necessary if m is a power of 2 (and m ≪ l) in this case, exactly min { log m + 1, ⌈ log l⌉ + 1} rounds are needed in the worst case.' author: - first_name: Miroslaw full_name: Kutylowski, Miroslaw last_name: Kutylowski - first_name: Rolf full_name: Wanka, Rolf last_name: Wanka citation: ama: Kutylowski M, Wanka R. Periodic Sorting on Two-Dimensional Meshes. Parallel Processing Letters 2. Published online 1992:213-220. doi:10.1142/s0129626492000349 apa: Kutylowski, M., & Wanka, R. (1992). Periodic Sorting on Two-Dimensional Meshes. Parallel Processing Letters 2, 213–220. https://doi.org/10.1142/s0129626492000349 bibtex: '@article{Kutylowski_Wanka_1992, title={Periodic Sorting on Two-Dimensional Meshes}, DOI={10.1142/s0129626492000349}, journal={Parallel Processing Letters 2}, author={Kutylowski, Miroslaw and Wanka, Rolf}, year={1992}, pages={213–220} }' chicago: Kutylowski, Miroslaw, and Rolf Wanka. “Periodic Sorting on Two-Dimensional Meshes.” Parallel Processing Letters 2, 1992, 213–20. https://doi.org/10.1142/s0129626492000349. ieee: 'M. Kutylowski and R. Wanka, “Periodic Sorting on Two-Dimensional Meshes,” Parallel Processing Letters 2, pp. 213–220, 1992, doi: 10.1142/s0129626492000349.' mla: Kutylowski, Miroslaw, and Rolf Wanka. “Periodic Sorting on Two-Dimensional Meshes.” Parallel Processing Letters 2, 1992, pp. 213–20, doi:10.1142/s0129626492000349. short: M. Kutylowski, R. Wanka, Parallel Processing Letters 2 (1992) 213–220. date_created: 2020-09-03T11:05:14Z date_updated: 2022-01-06T06:53:55Z department: - _id: '63' doi: 10.1142/s0129626492000349 language: - iso: eng page: 213-220 publication: Parallel Processing Letters 2 publication_identifier: issn: - 0129-6264 - 1793-642X publication_status: published status: public title: Periodic Sorting on Two-Dimensional Meshes type: journal_article user_id: '15415' year: '1992' ... --- _id: '16733' author: - first_name: Martin full_name: Dietzfelbinger, Martin 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. High performance universal hashing, with applications to shared memory simulations. In: Data Structures and Efficient Algorithms. Berlin, Heidelberg; 1992. doi:10.1007/3-540-55488-2_31' apa: Dietzfelbinger, M., & Meyer auf der Heide, F. (1992). High performance universal hashing, with applications to shared memory simulations. In Data structures and efficient algorithms. Berlin, Heidelberg. https://doi.org/10.1007/3-540-55488-2_31 bibtex: '@inbook{Dietzfelbinger_Meyer auf der Heide_1992, place={Berlin, Heidelberg}, title={High performance universal hashing, with applications to shared memory simulations}, DOI={10.1007/3-540-55488-2_31}, booktitle={Data structures and efficient algorithms}, author={Dietzfelbinger, Martin and Meyer auf der Heide, Friedhelm}, year={1992} }' chicago: Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance Universal Hashing, with Applications to Shared Memory Simulations.” In Data Structures and Efficient Algorithms. Berlin, Heidelberg, 1992. https://doi.org/10.1007/3-540-55488-2_31. ieee: M. Dietzfelbinger and F. Meyer auf der Heide, “High performance universal hashing, with applications to shared memory simulations,” in Data structures and efficient algorithms, Berlin, Heidelberg, 1992. mla: Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance Universal Hashing, with Applications to Shared Memory Simulations.” Data Structures and Efficient Algorithms, 1992, doi:10.1007/3-540-55488-2_31. short: 'M. Dietzfelbinger, F. Meyer auf der Heide, in: Data Structures and Efficient Algorithms, Berlin, Heidelberg, 1992.' date_created: 2020-04-20T11:27:50Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1007/3-540-55488-2_31 language: - iso: eng place: Berlin, Heidelberg publication: Data structures and efficient algorithms publication_identifier: isbn: - '9783540554882' - '9783540471035' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: High performance universal hashing, with applications to shared memory simulations type: book_chapter user_id: '15415' year: '1992' ... --- _id: '16734' 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. Hashing strategies for simulating shared memory on distributed memory machines. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1992. doi:10.1007/3-540-56731-3_3' apa: Meyer auf der Heide, F. (1992). Hashing strategies for simulating shared memory on distributed memory machines. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-56731-3_3 bibtex: '@inbook{Meyer auf der Heide_1992, place={Berlin, Heidelberg}, title={Hashing strategies for simulating shared memory on distributed memory machines}, DOI={10.1007/3-540-56731-3_3}, booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1992} }' chicago: Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 1992. https://doi.org/10.1007/3-540-56731-3_3. ieee: F. Meyer auf der Heide, “Hashing strategies for simulating shared memory on distributed memory machines,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1992. mla: Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines.” Lecture Notes in Computer Science, 1992, doi:10.1007/3-540-56731-3_3. short: 'F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1992.' date_created: 2020-04-20T11:29:58Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1007/3-540-56731-3_3 language: - iso: eng place: Berlin, Heidelberg publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783540567318' - '9783540476375' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Hashing strategies for simulating shared memory on distributed memory machines type: book_chapter user_id: '15415' year: '1992' ... --- _id: '16735' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Hieu Thien full_name: Pham, Hieu Thien last_name: Pham citation: ama: 'Meyer auf der Heide F, Pham HT. On the performance of networks with multiple busses. In: STACS 92. Berlin, Heidelberg; 1992. doi:10.1007/3-540-55210-3_176' apa: Meyer auf der Heide, F., & Pham, H. T. (1992). On the performance of networks with multiple busses. In STACS 92. Berlin, Heidelberg. https://doi.org/10.1007/3-540-55210-3_176 bibtex: '@inbook{Meyer auf der Heide_Pham_1992, place={Berlin, Heidelberg}, title={On the performance of networks with multiple busses}, DOI={10.1007/3-540-55210-3_176}, booktitle={STACS 92}, author={Meyer auf der Heide, Friedhelm and Pham, Hieu Thien}, year={1992} }' chicago: Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance of Networks with Multiple Busses.” In STACS 92. Berlin, Heidelberg, 1992. https://doi.org/10.1007/3-540-55210-3_176. ieee: F. Meyer auf der Heide and H. T. Pham, “On the performance of networks with multiple busses,” in STACS 92, Berlin, Heidelberg, 1992. mla: Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance of Networks with Multiple Busses.” STACS 92, 1992, doi:10.1007/3-540-55210-3_176. short: 'F. Meyer auf der Heide, H.T. Pham, in: STACS 92, Berlin, Heidelberg, 1992.' date_created: 2020-04-20T11:31:58Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1007/3-540-55210-3_176 language: - iso: eng place: Berlin, Heidelberg publication: STACS 92 publication_identifier: isbn: - '9783540552109' - '9783540467755' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: On the performance of networks with multiple busses type: book_chapter user_id: '15415' year: '1992' ... --- _id: '16736' author: - first_name: Richard M. full_name: Karp, Richard M. last_name: Karp - first_name: Michael full_name: Luby, Michael last_name: Luby - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Karp RM, Luby M, Meyer auf der Heide F. Efficient PRAM simulation on a distributed memory machine. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing  - STOC ’92. ; 1992. doi:10.1145/129712.129743' apa: Karp, R. M., Luby, M., & Meyer auf der Heide, F. (1992). Efficient PRAM simulation on a distributed memory machine. In Proceedings of the twenty-fourth annual ACM symposium on Theory of computing  - STOC ’92. https://doi.org/10.1145/129712.129743 bibtex: '@inproceedings{Karp_Luby_Meyer auf der Heide_1992, title={Efficient PRAM simulation on a distributed memory machine}, DOI={10.1145/129712.129743}, booktitle={Proceedings of the twenty-fourth annual ACM symposium on Theory of computing  - STOC ’92}, author={Karp, Richard M. and Luby, Michael and Meyer auf der Heide, Friedhelm}, year={1992} }' chicago: Karp, Richard M., Michael Luby, and Friedhelm Meyer auf der Heide. “Efficient PRAM Simulation on a Distributed Memory Machine.” In Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing  - STOC ’92, 1992. https://doi.org/10.1145/129712.129743. ieee: R. M. Karp, M. Luby, and F. Meyer auf der Heide, “Efficient PRAM simulation on a distributed memory machine,” in Proceedings of the twenty-fourth annual ACM symposium on Theory of computing  - STOC ’92, 1992. mla: Karp, Richard M., et al. “Efficient PRAM Simulation on a Distributed Memory Machine.” Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing  - STOC ’92, 1992, doi:10.1145/129712.129743. short: 'R.M. Karp, M. Luby, F. Meyer auf der Heide, in: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing  - STOC ’92, 1992.' date_created: 2020-04-20T11:33:22Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1145/129712.129743 language: - iso: eng publication: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 publication_identifier: isbn: - '0897915119' publication_status: published status: public title: Efficient PRAM simulation on a distributed memory machine type: conference user_id: '15415' year: '1992' ... --- _id: '16737' author: - first_name: Martin full_name: Dietzfelbinger, Martin 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. Dynamic Hashing in Real Time. In: TEUBNER-TEXTE Zur Informatik. Wiesbaden; 1992. doi:10.1007/978-3-322-95233-2_7' apa: Dietzfelbinger, M., & Meyer auf der Heide, F. (1992). Dynamic Hashing in Real Time. In TEUBNER-TEXTE zur Informatik. Wiesbaden. https://doi.org/10.1007/978-3-322-95233-2_7 bibtex: '@inbook{Dietzfelbinger_Meyer auf der Heide_1992, place={Wiesbaden}, title={Dynamic Hashing in Real Time}, DOI={10.1007/978-3-322-95233-2_7}, booktitle={TEUBNER-TEXTE zur Informatik}, author={Dietzfelbinger, Martin and Meyer auf der Heide, Friedhelm}, year={1992} }' chicago: Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Dynamic Hashing in Real Time.” In TEUBNER-TEXTE Zur Informatik. Wiesbaden, 1992. https://doi.org/10.1007/978-3-322-95233-2_7. ieee: M. Dietzfelbinger and F. Meyer auf der Heide, “Dynamic Hashing in Real Time,” in TEUBNER-TEXTE zur Informatik, Wiesbaden, 1992. mla: Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Dynamic Hashing in Real Time.” TEUBNER-TEXTE Zur Informatik, 1992, doi:10.1007/978-3-322-95233-2_7. short: 'M. Dietzfelbinger, F. Meyer auf der Heide, in: TEUBNER-TEXTE Zur Informatik, Wiesbaden, 1992.' date_created: 2020-04-20T11:35:06Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1007/978-3-322-95233-2_7 language: - iso: eng place: Wiesbaden publication: TEUBNER-TEXTE zur Informatik publication_identifier: isbn: - '9783815420331' - '9783322952332' issn: - 1615-4584 publication_status: published status: public title: Dynamic Hashing in Real Time type: book_chapter user_id: '15415' year: '1992' ... --- _id: '3050' author: - first_name: Helmut full_name: Alt, Helmut last_name: Alt - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer - first_name: Hubert full_name: Wagener, Hubert last_name: Wagener citation: ama: 'Alt H, Blömer J, Wagener H. Approximation of convex polygons. In: Automata, Languages and Programming. Berlin/Heidelberg: Springer-Verlag; 1990:703-716. doi:10.1007/bfb0032068' apa: 'Alt, H., Blömer, J., & Wagener, H. (1990). Approximation of convex polygons. In Automata, Languages and Programming (pp. 703–716). Berlin/Heidelberg: Springer-Verlag. https://doi.org/10.1007/bfb0032068' bibtex: '@inbook{Alt_Blömer_Wagener_1990, place={Berlin/Heidelberg}, title={Approximation of convex polygons}, DOI={10.1007/bfb0032068}, booktitle={Automata, Languages and Programming}, publisher={Springer-Verlag}, author={Alt, Helmut and Blömer, Johannes and Wagener, Hubert}, year={1990}, pages={703–716} }' chicago: 'Alt, Helmut, Johannes Blömer, and Hubert Wagener. “Approximation of Convex Polygons.” In Automata, Languages and Programming, 703–16. Berlin/Heidelberg: Springer-Verlag, 1990. https://doi.org/10.1007/bfb0032068.' ieee: 'H. Alt, J. Blömer, and H. Wagener, “Approximation of convex polygons,” in Automata, Languages and Programming, Berlin/Heidelberg: Springer-Verlag, 1990, pp. 703–716.' mla: Alt, Helmut, et al. “Approximation of Convex Polygons.” Automata, Languages and Programming, Springer-Verlag, 1990, pp. 703–16, doi:10.1007/bfb0032068. short: 'H. Alt, J. Blömer, H. Wagener, in: Automata, Languages and Programming, Springer-Verlag, Berlin/Heidelberg, 1990, pp. 703–716.' date_created: 2018-06-05T08:56:43Z date_updated: 2022-01-06T06:58:54Z department: - _id: '64' - _id: '63' doi: 10.1007/bfb0032068 extern: '1' language: - iso: eng page: 703-716 place: Berlin/Heidelberg publication: Automata, Languages and Programming publication_identifier: isbn: - '3540528261' publication_status: published publisher: Springer-Verlag status: public title: Approximation of convex polygons type: book_chapter user_id: '14955' year: '1990' ... --- _id: '16738' author: - first_name: Martin full_name: Dietzfelbinger, Martin 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. A new universal class of hash functions and dynamic hashing in real time. In: Automata, Languages and Programming. Berlin/Heidelberg; 1990. doi:10.1007/bfb0032018' apa: Dietzfelbinger, M., & Meyer auf der Heide, F. (1990). A new universal class of hash functions and dynamic hashing in real time. In Automata, Languages and Programming. Berlin/Heidelberg. https://doi.org/10.1007/bfb0032018 bibtex: '@inbook{Dietzfelbinger_Meyer auf der Heide_1990, place={Berlin/Heidelberg}, title={A new universal class of hash functions and dynamic hashing in real time}, DOI={10.1007/bfb0032018}, booktitle={Automata, Languages and Programming}, author={Dietzfelbinger, Martin and Meyer auf der Heide, Friedhelm}, year={1990} }' chicago: Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “A New Universal Class of Hash Functions and Dynamic Hashing in Real Time.” In Automata, Languages and Programming. Berlin/Heidelberg, 1990. https://doi.org/10.1007/bfb0032018. ieee: M. Dietzfelbinger and F. Meyer auf der Heide, “A new universal class of hash functions and dynamic hashing in real time,” in Automata, Languages and Programming, Berlin/Heidelberg, 1990. mla: Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “A New Universal Class of Hash Functions and Dynamic Hashing in Real Time.” Automata, Languages and Programming, 1990, doi:10.1007/bfb0032018. short: 'M. Dietzfelbinger, F. Meyer auf der Heide, in: Automata, Languages and Programming, Berlin/Heidelberg, 1990.' date_created: 2020-04-20T11:37:37Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1007/bfb0032018 language: - iso: eng place: Berlin/Heidelberg publication: Automata, Languages and Programming publication_identifier: isbn: - '3540528261' publication_status: published status: public title: A new universal class of hash functions and dynamic hashing in real time type: book_chapter user_id: '15415' year: '1990' ... --- _id: '16739' 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. Dynamic hashing strategies. In: Lecture Notes in Computer Science. Berlin/Heidelberg; 1990. doi:10.1007/bfb0029597' apa: Meyer auf der Heide, F. (1990). Dynamic hashing strategies. In Lecture Notes in Computer Science. Berlin/Heidelberg. https://doi.org/10.1007/bfb0029597 bibtex: '@inbook{Meyer auf der Heide_1990, place={Berlin/Heidelberg}, title={Dynamic hashing strategies}, DOI={10.1007/bfb0029597}, booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1990} }' chicago: Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.” In Lecture Notes in Computer Science. Berlin/Heidelberg, 1990. https://doi.org/10.1007/bfb0029597. ieee: F. Meyer auf der Heide, “Dynamic hashing strategies,” in Lecture Notes in Computer Science, Berlin/Heidelberg, 1990. mla: Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.” Lecture Notes in Computer Science, 1990, doi:10.1007/bfb0029597. short: 'F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.' date_created: 2020-04-20T11:39:31Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1007/bfb0029597 language: - iso: eng place: Berlin/Heidelberg publication: Lecture Notes in Computer Science publication_identifier: isbn: - '3540529535' publication_status: published status: public title: Dynamic hashing strategies type: book_chapter user_id: '15415' year: '1990' ...