[{"user_id":"15415","department":[{"_id":"63"}],"_id":"16732","language":[{"iso":"eng"}],"type":"book_chapter","publication":"Lecture Notes in Computer Science","status":"public","date_created":"2020-04-20T11:25:51Z","author":[{"full_name":"Lürwer-Brüggemeier, Katharina","last_name":"Lürwer-Brüggemeier","first_name":"Katharina"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/3-540-56503-5_46","title":"Capabilities and complexity of computations with integer division","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540565031","9783540475743"]},"citation":{"apa":"Lürwer-Brüggemeier, K., &#38; Meyer auf der Heide, F. (1993). Capabilities and complexity of computations with integer division. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-56503-5_46\">https://doi.org/10.1007/3-540-56503-5_46</a>","mla":"Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities and Complexity of Computations with Integer Division.” <i>Lecture Notes in Computer Science</i>, 1993, doi:<a href=\"https://doi.org/10.1007/3-540-56503-5_46\">10.1007/3-540-56503-5_46</a>.","bibtex":"@inbook{Lürwer-Brüggemeier_Meyer auf der Heide_1993, place={Berlin, Heidelberg}, title={Capabilities and complexity of computations with integer division}, DOI={<a href=\"https://doi.org/10.1007/3-540-56503-5_46\">10.1007/3-540-56503-5_46</a>}, booktitle={Lecture Notes in Computer Science}, author={Lürwer-Brüggemeier, Katharina and Meyer auf der Heide, Friedhelm}, year={1993} }","short":"K. Lürwer-Brüggemeier, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1993.","ieee":"K. Lürwer-Brüggemeier and F. Meyer auf der Heide, “Capabilities and complexity of computations with integer division,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1993.","chicago":"Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities and Complexity of Computations with Integer Division.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 1993. <a href=\"https://doi.org/10.1007/3-540-56503-5_46\">https://doi.org/10.1007/3-540-56503-5_46</a>.","ama":"Lürwer-Brüggemeier K, Meyer auf der Heide F. Capabilities and complexity of computations with integer division. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1993. doi:<a href=\"https://doi.org/10.1007/3-540-56503-5_46\">10.1007/3-540-56503-5_46</a>"},"year":"1993","place":"Berlin, Heidelberg"},{"citation":{"chicago":"Kutylowski, Miroslaw, and Rolf Wanka. “Periodic Sorting on Two-Dimensional Meshes.” <i>Parallel Processing Letters 2</i>, 1992, 213–20. <a href=\"https://doi.org/10.1142/s0129626492000349\">https://doi.org/10.1142/s0129626492000349</a>.","ieee":"M. Kutylowski and R. Wanka, “Periodic Sorting on Two-Dimensional Meshes,” <i>Parallel Processing Letters 2</i>, pp. 213–220, 1992, doi: <a href=\"https://doi.org/10.1142/s0129626492000349\">10.1142/s0129626492000349</a>.","ama":"Kutylowski M, Wanka R. Periodic Sorting on Two-Dimensional Meshes. <i>Parallel Processing Letters 2</i>. Published online 1992:213-220. doi:<a href=\"https://doi.org/10.1142/s0129626492000349\">10.1142/s0129626492000349</a>","apa":"Kutylowski, M., &#38; Wanka, R. (1992). Periodic Sorting on Two-Dimensional Meshes. <i>Parallel Processing Letters 2</i>, 213–220. <a href=\"https://doi.org/10.1142/s0129626492000349\">https://doi.org/10.1142/s0129626492000349</a>","short":"M. Kutylowski, R. Wanka, Parallel Processing Letters 2 (1992) 213–220.","bibtex":"@article{Kutylowski_Wanka_1992, title={Periodic Sorting on Two-Dimensional Meshes}, DOI={<a href=\"https://doi.org/10.1142/s0129626492000349\">10.1142/s0129626492000349</a>}, journal={Parallel Processing Letters 2}, author={Kutylowski, Miroslaw and Wanka, Rolf}, year={1992}, pages={213–220} }","mla":"Kutylowski, Miroslaw, and Rolf Wanka. “Periodic Sorting on Two-Dimensional Meshes.” <i>Parallel Processing Letters 2</i>, 1992, pp. 213–20, doi:<a href=\"https://doi.org/10.1142/s0129626492000349\">10.1142/s0129626492000349</a>."},"page":"213-220","year":"1992","publication_status":"published","publication_identifier":{"issn":["0129-6264","1793-642X"]},"doi":"10.1142/s0129626492000349","title":"Periodic Sorting on Two-Dimensional Meshes","author":[{"last_name":"Kutylowski","full_name":"Kutylowski, Miroslaw","first_name":"Miroslaw"},{"first_name":"Rolf","last_name":"Wanka","full_name":"Wanka, Rolf"}],"date_created":"2020-09-03T11:05:14Z","date_updated":"2022-01-06T06:53:55Z","status":"public","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."}],"type":"journal_article","publication":"Parallel Processing Letters 2","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"18936"},{"date_updated":"2022-01-06T06:52:55Z","author":[{"full_name":"Dietzfelbinger, Martin","last_name":"Dietzfelbinger","first_name":"Martin"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_created":"2020-04-20T11:27:50Z","title":"High performance universal hashing, with applications to shared memory simulations","doi":"10.1007/3-540-55488-2_31","publication_identifier":{"isbn":["9783540554882","9783540471035"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","year":"1992","place":"Berlin, Heidelberg","citation":{"apa":"Dietzfelbinger, M., &#38; Meyer auf der Heide, F. (1992). High performance universal hashing, with applications to shared memory simulations. In <i>Data structures and efficient algorithms</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-55488-2_31\">https://doi.org/10.1007/3-540-55488-2_31</a>","bibtex":"@inbook{Dietzfelbinger_Meyer auf der Heide_1992, place={Berlin, Heidelberg}, title={High performance universal hashing, with applications to shared memory simulations}, DOI={<a href=\"https://doi.org/10.1007/3-540-55488-2_31\">10.1007/3-540-55488-2_31</a>}, booktitle={Data structures and efficient algorithms}, author={Dietzfelbinger, Martin and Meyer auf der Heide, Friedhelm}, year={1992} }","mla":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance Universal Hashing, with Applications to Shared Memory Simulations.” <i>Data Structures and Efficient Algorithms</i>, 1992, doi:<a href=\"https://doi.org/10.1007/3-540-55488-2_31\">10.1007/3-540-55488-2_31</a>.","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Data Structures and Efficient Algorithms, Berlin, Heidelberg, 1992.","chicago":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance Universal Hashing, with Applications to Shared Memory Simulations.” In <i>Data Structures and Efficient Algorithms</i>. Berlin, Heidelberg, 1992. <a href=\"https://doi.org/10.1007/3-540-55488-2_31\">https://doi.org/10.1007/3-540-55488-2_31</a>.","ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “High performance universal hashing, with applications to shared memory simulations,” in <i>Data structures and efficient algorithms</i>, Berlin, Heidelberg, 1992.","ama":"Dietzfelbinger M, Meyer auf der Heide F. High performance universal hashing, with applications to shared memory simulations. In: <i>Data Structures and Efficient Algorithms</i>. Berlin, Heidelberg; 1992. doi:<a href=\"https://doi.org/10.1007/3-540-55488-2_31\">10.1007/3-540-55488-2_31</a>"},"_id":"16733","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication":"Data structures and efficient algorithms","type":"book_chapter","status":"public"},{"type":"book_chapter","publication":"Lecture Notes in Computer Science","status":"public","user_id":"15415","department":[{"_id":"63"}],"_id":"16734","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9783540567318","9783540476375"],"issn":["0302-9743","1611-3349"]},"citation":{"ieee":"F. Meyer auf der Heide, “Hashing strategies for simulating shared memory on distributed memory machines,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1992.","chicago":"Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 1992. <a href=\"https://doi.org/10.1007/3-540-56731-3_3\">https://doi.org/10.1007/3-540-56731-3_3</a>.","ama":"Meyer auf der Heide F. Hashing strategies for simulating shared memory on distributed memory machines. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1992. doi:<a href=\"https://doi.org/10.1007/3-540-56731-3_3\">10.1007/3-540-56731-3_3</a>","apa":"Meyer auf der Heide, F. (1992). Hashing strategies for simulating shared memory on distributed memory machines. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-56731-3_3\">https://doi.org/10.1007/3-540-56731-3_3</a>","short":"F. Meyer auf der Heide, 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.” <i>Lecture Notes in Computer Science</i>, 1992, doi:<a href=\"https://doi.org/10.1007/3-540-56731-3_3\">10.1007/3-540-56731-3_3</a>.","bibtex":"@inbook{Meyer auf der Heide_1992, place={Berlin, Heidelberg}, title={Hashing strategies for simulating shared memory on distributed memory machines}, DOI={<a href=\"https://doi.org/10.1007/3-540-56731-3_3\">10.1007/3-540-56731-3_3</a>}, booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1992} }"},"year":"1992","place":"Berlin, Heidelberg","date_created":"2020-04-20T11:29:58Z","author":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/3-540-56731-3_3","title":"Hashing strategies for simulating shared memory on distributed memory machines"},{"language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16735","status":"public","publication":"STACS 92","type":"book_chapter","doi":"10.1007/3-540-55210-3_176","title":"On the performance of networks with multiple busses","author":[{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Pham","full_name":"Pham, Hieu Thien","first_name":"Hieu Thien"}],"date_created":"2020-04-20T11:31:58Z","date_updated":"2022-01-06T06:52:55Z","citation":{"ieee":"F. Meyer auf der Heide and H. T. Pham, “On the performance of networks with multiple busses,” in <i>STACS 92</i>, Berlin, Heidelberg, 1992.","chicago":"Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance of Networks with Multiple Busses.” In <i>STACS 92</i>. Berlin, Heidelberg, 1992. <a href=\"https://doi.org/10.1007/3-540-55210-3_176\">https://doi.org/10.1007/3-540-55210-3_176</a>.","ama":"Meyer auf der Heide F, Pham HT. On the performance of networks with multiple busses. In: <i>STACS 92</i>. Berlin, Heidelberg; 1992. doi:<a href=\"https://doi.org/10.1007/3-540-55210-3_176\">10.1007/3-540-55210-3_176</a>","short":"F. Meyer auf der Heide, H.T. Pham, in: STACS 92, Berlin, Heidelberg, 1992.","mla":"Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance of Networks with Multiple Busses.” <i>STACS 92</i>, 1992, doi:<a href=\"https://doi.org/10.1007/3-540-55210-3_176\">10.1007/3-540-55210-3_176</a>.","bibtex":"@inbook{Meyer auf der Heide_Pham_1992, place={Berlin, Heidelberg}, title={On the performance of networks with multiple busses}, DOI={<a href=\"https://doi.org/10.1007/3-540-55210-3_176\">10.1007/3-540-55210-3_176</a>}, booktitle={STACS 92}, author={Meyer auf der Heide, Friedhelm and Pham, Hieu Thien}, year={1992} }","apa":"Meyer auf der Heide, F., &#38; Pham, H. T. (1992). On the performance of networks with multiple busses. In <i>STACS 92</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-55210-3_176\">https://doi.org/10.1007/3-540-55210-3_176</a>"},"year":"1992","place":"Berlin, Heidelberg","publication_identifier":{"isbn":["9783540552109","9783540467755"],"issn":["0302-9743","1611-3349"]},"publication_status":"published"},{"_id":"16736","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the twenty-fourth annual ACM symposium on Theory of computing  - STOC '92","status":"public","date_updated":"2022-01-06T06:52:55Z","date_created":"2020-04-20T11:33:22Z","author":[{"full_name":"Karp, Richard M.","last_name":"Karp","first_name":"Richard M."},{"last_name":"Luby","full_name":"Luby, Michael","first_name":"Michael"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"title":"Efficient PRAM simulation on a distributed memory machine","doi":"10.1145/129712.129743","publication_status":"published","publication_identifier":{"isbn":["0897915119"]},"year":"1992","citation":{"mla":"Karp, Richard M., et al. “Efficient PRAM Simulation on a Distributed Memory Machine.” <i>Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing  - STOC ’92</i>, 1992, doi:<a href=\"https://doi.org/10.1145/129712.129743\">10.1145/129712.129743</a>.","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.","bibtex":"@inproceedings{Karp_Luby_Meyer auf der Heide_1992, title={Efficient PRAM simulation on a distributed memory machine}, DOI={<a href=\"https://doi.org/10.1145/129712.129743\">10.1145/129712.129743</a>}, 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} }","apa":"Karp, R. M., Luby, M., &#38; Meyer auf der Heide, F. (1992). Efficient PRAM simulation on a distributed memory machine. In <i>Proceedings of the twenty-fourth annual ACM symposium on Theory of computing  - STOC ’92</i>. <a href=\"https://doi.org/10.1145/129712.129743\">https://doi.org/10.1145/129712.129743</a>","chicago":"Karp, Richard M., Michael Luby, and Friedhelm Meyer auf der Heide. “Efficient PRAM Simulation on a Distributed Memory Machine.” In <i>Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing  - STOC ’92</i>, 1992. <a href=\"https://doi.org/10.1145/129712.129743\">https://doi.org/10.1145/129712.129743</a>.","ieee":"R. M. Karp, M. Luby, and F. Meyer auf der Heide, “Efficient PRAM simulation on a distributed memory machine,” in <i>Proceedings of the twenty-fourth annual ACM symposium on Theory of computing  - STOC ’92</i>, 1992.","ama":"Karp RM, Luby M, Meyer auf der Heide F. Efficient PRAM simulation on a distributed memory machine. In: <i>Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing  - STOC ’92</i>. ; 1992. doi:<a href=\"https://doi.org/10.1145/129712.129743\">10.1145/129712.129743</a>"}},{"date_created":"2020-04-20T11:35:06Z","author":[{"first_name":"Martin","full_name":"Dietzfelbinger, Martin","last_name":"Dietzfelbinger"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/978-3-322-95233-2_7","title":"Dynamic Hashing in Real Time","publication_status":"published","publication_identifier":{"issn":["1615-4584"],"isbn":["9783815420331","9783322952332"]},"citation":{"apa":"Dietzfelbinger, M., &#38; Meyer auf der Heide, F. (1992). Dynamic Hashing in Real Time. In <i>TEUBNER-TEXTE zur Informatik</i>. Wiesbaden. <a href=\"https://doi.org/10.1007/978-3-322-95233-2_7\">https://doi.org/10.1007/978-3-322-95233-2_7</a>","mla":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Dynamic Hashing in Real Time.” <i>TEUBNER-TEXTE Zur Informatik</i>, 1992, doi:<a href=\"https://doi.org/10.1007/978-3-322-95233-2_7\">10.1007/978-3-322-95233-2_7</a>.","bibtex":"@inbook{Dietzfelbinger_Meyer auf der Heide_1992, place={Wiesbaden}, title={Dynamic Hashing in Real Time}, DOI={<a href=\"https://doi.org/10.1007/978-3-322-95233-2_7\">10.1007/978-3-322-95233-2_7</a>}, booktitle={TEUBNER-TEXTE zur Informatik}, author={Dietzfelbinger, Martin and Meyer auf der Heide, Friedhelm}, year={1992} }","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: TEUBNER-TEXTE Zur Informatik, Wiesbaden, 1992.","chicago":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Dynamic Hashing in Real Time.” In <i>TEUBNER-TEXTE Zur Informatik</i>. Wiesbaden, 1992. <a href=\"https://doi.org/10.1007/978-3-322-95233-2_7\">https://doi.org/10.1007/978-3-322-95233-2_7</a>.","ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “Dynamic Hashing in Real Time,” in <i>TEUBNER-TEXTE zur Informatik</i>, Wiesbaden, 1992.","ama":"Dietzfelbinger M, Meyer auf der Heide F. Dynamic Hashing in Real Time. In: <i>TEUBNER-TEXTE Zur Informatik</i>. Wiesbaden; 1992. doi:<a href=\"https://doi.org/10.1007/978-3-322-95233-2_7\">10.1007/978-3-322-95233-2_7</a>"},"year":"1992","place":"Wiesbaden","user_id":"15415","department":[{"_id":"63"}],"_id":"16737","language":[{"iso":"eng"}],"type":"book_chapter","publication":"TEUBNER-TEXTE zur Informatik","status":"public"},{"status":"public","type":"book_chapter","publication":"Automata, Languages and Programming","language":[{"iso":"eng"}],"extern":"1","user_id":"14955","department":[{"_id":"64"},{"_id":"63"}],"_id":"3050","citation":{"apa":"Alt, H., Blömer, J., &#38; Wagener, H. (1990). Approximation of convex polygons. In <i>Automata, Languages and Programming</i> (pp. 703–716). Berlin/Heidelberg: Springer-Verlag. <a href=\"https://doi.org/10.1007/bfb0032068\">https://doi.org/10.1007/bfb0032068</a>","mla":"Alt, Helmut, et al. “Approximation of Convex Polygons.” <i>Automata, Languages and Programming</i>, Springer-Verlag, 1990, pp. 703–16, doi:<a href=\"https://doi.org/10.1007/bfb0032068\">10.1007/bfb0032068</a>.","bibtex":"@inbook{Alt_Blömer_Wagener_1990, place={Berlin/Heidelberg}, title={Approximation of convex polygons}, DOI={<a href=\"https://doi.org/10.1007/bfb0032068\">10.1007/bfb0032068</a>}, booktitle={Automata, Languages and Programming}, publisher={Springer-Verlag}, author={Alt, Helmut and Blömer, Johannes and Wagener, Hubert}, year={1990}, pages={703–716} }","short":"H. Alt, J. Blömer, H. Wagener, in: Automata, Languages and Programming, Springer-Verlag, Berlin/Heidelberg, 1990, pp. 703–716.","ama":"Alt H, Blömer J, Wagener H. Approximation of convex polygons. In: <i>Automata, Languages and Programming</i>. Berlin/Heidelberg: Springer-Verlag; 1990:703-716. doi:<a href=\"https://doi.org/10.1007/bfb0032068\">10.1007/bfb0032068</a>","chicago":"Alt, Helmut, Johannes Blömer, and Hubert Wagener. “Approximation of Convex Polygons.” In <i>Automata, Languages and Programming</i>, 703–16. Berlin/Heidelberg: Springer-Verlag, 1990. <a href=\"https://doi.org/10.1007/bfb0032068\">https://doi.org/10.1007/bfb0032068</a>.","ieee":"H. Alt, J. Blömer, and H. Wagener, “Approximation of convex polygons,” in <i>Automata, Languages and Programming</i>, Berlin/Heidelberg: Springer-Verlag, 1990, pp. 703–716."},"page":"703-716","year":"1990","place":"Berlin/Heidelberg","publication_status":"published","publication_identifier":{"isbn":["3540528261"]},"doi":"10.1007/bfb0032068","title":"Approximation of convex polygons","author":[{"last_name":"Alt","full_name":"Alt, Helmut","first_name":"Helmut"},{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"},{"full_name":"Wagener, Hubert","last_name":"Wagener","first_name":"Hubert"}],"date_created":"2018-06-05T08:56:43Z","date_updated":"2022-01-06T06:58:54Z","publisher":"Springer-Verlag"},{"publication_status":"published","publication_identifier":{"isbn":["3540528261"]},"citation":{"ama":"Dietzfelbinger M, Meyer auf der Heide F. A new universal class of hash functions and dynamic hashing in real time. In: <i>Automata, Languages and Programming</i>. Berlin/Heidelberg; 1990. doi:<a href=\"https://doi.org/10.1007/bfb0032018\">10.1007/bfb0032018</a>","ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “A new universal class of hash functions and dynamic hashing in real time,” in <i>Automata, Languages and Programming</i>, Berlin/Heidelberg, 1990.","chicago":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “A New Universal Class of Hash Functions and Dynamic Hashing in Real Time.” In <i>Automata, Languages and Programming</i>. Berlin/Heidelberg, 1990. <a href=\"https://doi.org/10.1007/bfb0032018\">https://doi.org/10.1007/bfb0032018</a>.","apa":"Dietzfelbinger, M., &#38; Meyer auf der Heide, F. (1990). A new universal class of hash functions and dynamic hashing in real time. In <i>Automata, Languages and Programming</i>. Berlin/Heidelberg. <a href=\"https://doi.org/10.1007/bfb0032018\">https://doi.org/10.1007/bfb0032018</a>","mla":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “A New Universal Class of Hash Functions and Dynamic Hashing in Real Time.” <i>Automata, Languages and Programming</i>, 1990, doi:<a href=\"https://doi.org/10.1007/bfb0032018\">10.1007/bfb0032018</a>.","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={<a href=\"https://doi.org/10.1007/bfb0032018\">10.1007/bfb0032018</a>}, booktitle={Automata, Languages and Programming}, author={Dietzfelbinger, Martin and Meyer auf der Heide, Friedhelm}, year={1990} }","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Automata, Languages and Programming, Berlin/Heidelberg, 1990."},"year":"1990","place":"Berlin/Heidelberg","date_created":"2020-04-20T11:37:37Z","author":[{"first_name":"Martin","full_name":"Dietzfelbinger, Martin","last_name":"Dietzfelbinger"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/bfb0032018","title":"A new universal class of hash functions and dynamic hashing in real time","type":"book_chapter","publication":"Automata, Languages and Programming","status":"public","user_id":"15415","department":[{"_id":"63"}],"_id":"16738","language":[{"iso":"eng"}]},{"publication_identifier":{"isbn":["3540529535"]},"publication_status":"published","citation":{"ama":"Meyer auf der Heide F. Dynamic hashing strategies. In: <i>Lecture Notes in Computer Science</i>. Berlin/Heidelberg; 1990. doi:<a href=\"https://doi.org/10.1007/bfb0029597\">10.1007/bfb0029597</a>","chicago":"Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.” In <i>Lecture Notes in Computer Science</i>. Berlin/Heidelberg, 1990. <a href=\"https://doi.org/10.1007/bfb0029597\">https://doi.org/10.1007/bfb0029597</a>.","ieee":"F. Meyer auf der Heide, “Dynamic hashing strategies,” in <i>Lecture Notes in Computer Science</i>, Berlin/Heidelberg, 1990.","mla":"Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.” <i>Lecture Notes in Computer Science</i>, 1990, doi:<a href=\"https://doi.org/10.1007/bfb0029597\">10.1007/bfb0029597</a>.","bibtex":"@inbook{Meyer auf der Heide_1990, place={Berlin/Heidelberg}, title={Dynamic hashing strategies}, DOI={<a href=\"https://doi.org/10.1007/bfb0029597\">10.1007/bfb0029597</a>}, booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1990} }","short":"F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.","apa":"Meyer auf der Heide, F. (1990). Dynamic hashing strategies. In <i>Lecture Notes in Computer Science</i>. Berlin/Heidelberg. <a href=\"https://doi.org/10.1007/bfb0029597\">https://doi.org/10.1007/bfb0029597</a>"},"year":"1990","place":"Berlin/Heidelberg","date_created":"2020-04-20T11:39:31Z","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/bfb0029597","title":"Dynamic hashing strategies","publication":"Lecture Notes in Computer Science","type":"book_chapter","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"16739","language":[{"iso":"eng"}]},{"publication_status":"published","publication_identifier":{"isbn":["3540529535"]},"citation":{"ama":"Karpinski M, Meyer auf der Heide F. On the complexity of genuinely polynomial computation. In: <i>Lecture Notes in Computer Science</i>. Berlin/Heidelberg; 1990. doi:<a href=\"https://doi.org/10.1007/bfb0029630\">10.1007/bfb0029630</a>","ieee":"M. Karpinski and F. Meyer auf der Heide, “On the complexity of genuinely polynomial computation,” in <i>Lecture Notes in Computer Science</i>, Berlin/Heidelberg, 1990.","chicago":"Karpinski, Marek, and Friedhelm Meyer auf der Heide. “On the Complexity of Genuinely Polynomial Computation.” In <i>Lecture Notes in Computer Science</i>. Berlin/Heidelberg, 1990. <a href=\"https://doi.org/10.1007/bfb0029630\">https://doi.org/10.1007/bfb0029630</a>.","apa":"Karpinski, M., &#38; Meyer auf der Heide, F. (1990). On the complexity of genuinely polynomial computation. In <i>Lecture Notes in Computer Science</i>. Berlin/Heidelberg. <a href=\"https://doi.org/10.1007/bfb0029630\">https://doi.org/10.1007/bfb0029630</a>","bibtex":"@inbook{Karpinski_Meyer auf der Heide_1990, place={Berlin/Heidelberg}, title={On the complexity of genuinely polynomial computation}, DOI={<a href=\"https://doi.org/10.1007/bfb0029630\">10.1007/bfb0029630</a>}, booktitle={Lecture Notes in Computer Science}, author={Karpinski, Marek and Meyer auf der Heide, Friedhelm}, year={1990} }","short":"M. Karpinski, F. Meyer auf der Heide, 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.” <i>Lecture Notes in Computer Science</i>, 1990, doi:<a href=\"https://doi.org/10.1007/bfb0029630\">10.1007/bfb0029630</a>."},"place":"Berlin/Heidelberg","year":"1990","author":[{"full_name":"Karpinski, Marek","last_name":"Karpinski","first_name":"Marek"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2020-04-20T11:40:17Z","date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/bfb0029630","title":"On the complexity of genuinely polynomial computation","type":"book_chapter","publication":"Lecture Notes in Computer Science","status":"public","user_id":"15415","department":[{"_id":"63"}],"_id":"16740","language":[{"iso":"eng"}]},{"doi":"10.1145/100216.100229","title":"How to distribute a dictionary in a complete network","author":[{"full_name":"Dietzfelbinger, M.","last_name":"Dietzfelbinger","first_name":"M."},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2020-04-20T11:41:08Z","date_updated":"2022-01-06T06:52:55Z","citation":{"short":"M. Dietzfelbinger, F. Meyer auf der Heide, 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.” <i>Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90</i>, 1990, doi:<a href=\"https://doi.org/10.1145/100216.100229\">10.1145/100216.100229</a>.","bibtex":"@inproceedings{Dietzfelbinger_Meyer auf der Heide_1990, title={How to distribute a dictionary in a complete network}, DOI={<a href=\"https://doi.org/10.1145/100216.100229\">10.1145/100216.100229</a>}, 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} }","apa":"Dietzfelbinger, M., &#38; Meyer auf der Heide, F. (1990). How to distribute a dictionary in a complete network. In <i>Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90</i>. <a href=\"https://doi.org/10.1145/100216.100229\">https://doi.org/10.1145/100216.100229</a>","chicago":"Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “How to Distribute a Dictionary in a Complete Network.” In <i>Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90</i>, 1990. <a href=\"https://doi.org/10.1145/100216.100229\">https://doi.org/10.1145/100216.100229</a>.","ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “How to distribute a dictionary in a complete network,” in <i>Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90</i>, 1990.","ama":"Dietzfelbinger M, Meyer auf der Heide F. How to distribute a dictionary in a complete network. In: <i>Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90</i>. ; 1990. doi:<a href=\"https://doi.org/10.1145/100216.100229\">10.1145/100216.100229</a>"},"year":"1990","publication_status":"published","publication_identifier":{"isbn":["0897913612"]},"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16741","status":"public","type":"conference","publication":"Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC '90"},{"date_created":"2020-04-20T11:41:55Z","author":[{"full_name":"Gil, J.","last_name":"Gil","first_name":"J."},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"A.","last_name":"Wigderson","full_name":"Wigderson, A."}],"date_updated":"2022-01-06T06:52:55Z","doi":"10.1145/100216.100247","title":"Not all keys can be hashed in constant time","publication_status":"published","publication_identifier":{"isbn":["0897913612"]},"citation":{"chicago":"Gil, J., Friedhelm Meyer auf der Heide, and A. Wigderson. “Not All Keys Can Be Hashed in Constant Time.” In <i>Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90</i>, 1990. <a href=\"https://doi.org/10.1145/100216.100247\">https://doi.org/10.1145/100216.100247</a>.","ieee":"J. Gil, F. Meyer auf der Heide, and A. Wigderson, “Not all keys can be hashed in constant time,” in <i>Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90</i>, 1990.","ama":"Gil J, Meyer auf der Heide F, Wigderson A. Not all keys can be hashed in constant time. In: <i>Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90</i>. ; 1990. doi:<a href=\"https://doi.org/10.1145/100216.100247\">10.1145/100216.100247</a>","bibtex":"@inproceedings{Gil_Meyer auf der Heide_Wigderson_1990, title={Not all keys can be hashed in constant time}, DOI={<a href=\"https://doi.org/10.1145/100216.100247\">10.1145/100216.100247</a>}, 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} }","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.","mla":"Gil, J., et al. “Not All Keys Can Be Hashed in Constant Time.” <i>Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90</i>, 1990, doi:<a href=\"https://doi.org/10.1145/100216.100247\">10.1145/100216.100247</a>.","apa":"Gil, J., Meyer auf der Heide, F., &#38; Wigderson, A. (1990). Not all keys can be hashed in constant time. In <i>Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90</i>. <a href=\"https://doi.org/10.1145/100216.100247\">https://doi.org/10.1145/100216.100247</a>"},"year":"1990","user_id":"15415","department":[{"_id":"63"}],"_id":"16742","language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC '90","status":"public"},{"date_updated":"2022-01-06T06:52:56Z","volume":13,"author":[{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"date_created":"2020-04-22T10:28:27Z","title":"Das Heinz Nixdorf-Institut der Universität-GH Paderborn","issue":"4","year":"1990","page":"231-232","intvolume":"        13","citation":{"apa":"Meyer auf der Heide, F. (1990). Das Heinz Nixdorf-Institut der Universität-GH Paderborn. <i>Informatik Spektrum</i>, <i>13</i>(4), 231–232.","short":"F. Meyer auf der Heide, Informatik Spektrum 13 (1990) 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} }","mla":"Meyer auf der Heide, Friedhelm. “Das Heinz Nixdorf-Institut Der Universität-GH Paderborn.” <i>Informatik Spektrum</i>, vol. 13, no. 4, 1990, pp. 231–32.","ama":"Meyer auf der Heide F. Das Heinz Nixdorf-Institut der Universität-GH Paderborn. <i>Informatik Spektrum</i>. 1990;13(4):231-232.","ieee":"F. Meyer auf der Heide, “Das Heinz Nixdorf-Institut der Universität-GH Paderborn,” <i>Informatik Spektrum</i>, vol. 13, no. 4, pp. 231–232, 1990.","chicago":"Meyer auf der Heide, Friedhelm. “Das Heinz Nixdorf-Institut Der Universität-GH Paderborn.” <i>Informatik Spektrum</i> 13, no. 4 (1990): 231–32."},"_id":"16824","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication":"Informatik Spektrum","type":"journal_article","status":"public"},{"doi":"10.1051/ita/1989230101011","title":"On computations with integer division","author":[{"last_name":"Just","full_name":"Just, Bettina","first_name":"Bettina"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Wigderson","full_name":"Wigderson, Avi","first_name":"Avi"}],"date_created":"2020-04-20T11:49:38Z","date_updated":"2022-01-06T06:52:55Z","citation":{"bibtex":"@article{Just_Meyer auf der Heide_Wigderson_1989, title={On computations with integer division}, DOI={<a href=\"https://doi.org/10.1051/ita/1989230101011\">10.1051/ita/1989230101011</a>}, journal={RAIRO - Theoretical Informatics and Applications}, author={Just, Bettina and Meyer auf der Heide, Friedhelm and Wigderson, Avi}, year={1989}, pages={101–111} }","short":"B. Just, F. Meyer auf der Heide, A. Wigderson, RAIRO - Theoretical Informatics and Applications (1989) 101–111.","mla":"Just, Bettina, et al. “On Computations with Integer Division.” <i>RAIRO - Theoretical Informatics and Applications</i>, 1989, pp. 101–11, doi:<a href=\"https://doi.org/10.1051/ita/1989230101011\">10.1051/ita/1989230101011</a>.","apa":"Just, B., Meyer auf der Heide, F., &#38; Wigderson, A. (1989). On computations with integer division. <i>RAIRO - Theoretical Informatics and Applications</i>, 101–111. <a href=\"https://doi.org/10.1051/ita/1989230101011\">https://doi.org/10.1051/ita/1989230101011</a>","ama":"Just B, Meyer auf der Heide F, Wigderson A. On computations with integer division. <i>RAIRO - Theoretical Informatics and Applications</i>. 1989:101-111. doi:<a href=\"https://doi.org/10.1051/ita/1989230101011\">10.1051/ita/1989230101011</a>","ieee":"B. Just, F. Meyer auf der Heide, and A. Wigderson, “On computations with integer division,” <i>RAIRO - Theoretical Informatics and Applications</i>, pp. 101–111, 1989.","chicago":"Just, Bettina, Friedhelm Meyer auf der Heide, and Avi Wigderson. “On Computations with Integer Division.” <i>RAIRO - Theoretical Informatics and Applications</i>, 1989, 101–11. <a href=\"https://doi.org/10.1051/ita/1989230101011\">https://doi.org/10.1051/ita/1989230101011</a>."},"page":"101-111","year":"1989","publication_status":"published","publication_identifier":{"issn":["0988-3754","1290-385X"]},"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16743","status":"public","type":"journal_article","publication":"RAIRO - Theoretical Informatics and Applications"},{"publication":"Proceedings of the first annual ACM symposium on Parallel algorithms and architectures  - SPAA '89","type":"conference","status":"public","_id":"16744","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["089791323X"]},"publication_status":"published","year":"1989","citation":{"ama":"Dietzfelbinger M, Meyer auf der Heide F. An optimal parallel dictionary. In: <i>Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’89</i>. ; 1989. doi:<a href=\"https://doi.org/10.1145/72935.72974\">10.1145/72935.72974</a>","chicago":"Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.” In <i>Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’89</i>, 1989. <a href=\"https://doi.org/10.1145/72935.72974\">https://doi.org/10.1145/72935.72974</a>.","ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “An optimal parallel dictionary,” in <i>Proceedings of the first annual ACM symposium on Parallel algorithms and architectures  - SPAA ’89</i>, 1989.","mla":"Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.” <i>Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’89</i>, 1989, doi:<a href=\"https://doi.org/10.1145/72935.72974\">10.1145/72935.72974</a>.","bibtex":"@inproceedings{Dietzfelbinger_Meyer auf der Heide_1989, title={An optimal parallel dictionary}, DOI={<a href=\"https://doi.org/10.1145/72935.72974\">10.1145/72935.72974</a>}, booktitle={Proceedings of the first annual ACM symposium on Parallel algorithms and architectures  - SPAA ’89}, author={Dietzfelbinger, M. and Meyer auf der Heide, Friedhelm}, year={1989} }","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’89, 1989.","apa":"Dietzfelbinger, M., &#38; Meyer auf der Heide, F. (1989). An optimal parallel dictionary. In <i>Proceedings of the first annual ACM symposium on Parallel algorithms and architectures  - SPAA ’89</i>. <a href=\"https://doi.org/10.1145/72935.72974\">https://doi.org/10.1145/72935.72974</a>"},"date_updated":"2022-01-06T06:52:55Z","author":[{"first_name":"M.","full_name":"Dietzfelbinger, M.","last_name":"Dietzfelbinger"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_created":"2020-04-20T11:51:01Z","title":"An optimal parallel dictionary","doi":"10.1145/72935.72974"},{"language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16745","status":"public","publication":"STACS 89","type":"book_chapter","doi":"10.1007/bfb0028969","title":"On genuinely time bounded computations","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2020-04-20T11:51:54Z","date_updated":"2022-01-06T06:52:55Z","citation":{"ama":"Meyer auf der Heide F. On genuinely time bounded computations. In: <i>STACS 89</i>. Berlin/Heidelberg; 1989. doi:<a href=\"https://doi.org/10.1007/bfb0028969\">10.1007/bfb0028969</a>","ieee":"F. Meyer auf der Heide, “On genuinely time bounded computations,” in <i>STACS 89</i>, Berlin/Heidelberg, 1989.","chicago":"Meyer auf der Heide, Friedhelm. “On Genuinely Time Bounded Computations.” In <i>STACS 89</i>. Berlin/Heidelberg, 1989. <a href=\"https://doi.org/10.1007/bfb0028969\">https://doi.org/10.1007/bfb0028969</a>.","bibtex":"@inbook{Meyer auf der Heide_1989, place={Berlin/Heidelberg}, title={On genuinely time bounded computations}, DOI={<a href=\"https://doi.org/10.1007/bfb0028969\">10.1007/bfb0028969</a>}, booktitle={STACS 89}, author={Meyer auf der Heide, Friedhelm}, year={1989} }","short":"F. Meyer auf der Heide, in: STACS 89, Berlin/Heidelberg, 1989.","mla":"Meyer auf der Heide, Friedhelm. “On Genuinely Time Bounded Computations.” <i>STACS 89</i>, 1989, doi:<a href=\"https://doi.org/10.1007/bfb0028969\">10.1007/bfb0028969</a>.","apa":"Meyer auf der Heide, F. (1989). On genuinely time bounded computations. In <i>STACS 89</i>. Berlin/Heidelberg. <a href=\"https://doi.org/10.1007/bfb0028969\">https://doi.org/10.1007/bfb0028969</a>"},"place":"Berlin/Heidelberg","year":"1989","publication_identifier":{"isbn":["3540508406"]},"publication_status":"published"},{"status":"public","publication":"STACS 89","type":"book_chapter","language":[{"iso":"eng"}],"_id":"16746","department":[{"_id":"63"}],"user_id":"15415","place":"Berlin/Heidelberg","year":"1989","citation":{"ama":"Meyer auf der Heide F, Wanka R. Time-optimal simulations of networks by universal parallel computers. In: <i>STACS 89</i>. Berlin/Heidelberg; 1989. doi:<a href=\"https://doi.org/10.1007/bfb0028978\">10.1007/bfb0028978</a>","ieee":"F. Meyer auf der Heide and R. Wanka, “Time-optimal simulations of networks by universal parallel computers,” in <i>STACS 89</i>, Berlin/Heidelberg, 1989.","chicago":"Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Time-Optimal Simulations of Networks by Universal Parallel Computers.” In <i>STACS 89</i>. Berlin/Heidelberg, 1989. <a href=\"https://doi.org/10.1007/bfb0028978\">https://doi.org/10.1007/bfb0028978</a>.","apa":"Meyer auf der Heide, F., &#38; Wanka, R. (1989). Time-optimal simulations of networks by universal parallel computers. In <i>STACS 89</i>. Berlin/Heidelberg. <a href=\"https://doi.org/10.1007/bfb0028978\">https://doi.org/10.1007/bfb0028978</a>","mla":"Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Time-Optimal Simulations of Networks by Universal Parallel Computers.” <i>STACS 89</i>, 1989, doi:<a href=\"https://doi.org/10.1007/bfb0028978\">10.1007/bfb0028978</a>.","bibtex":"@inbook{Meyer auf der Heide_Wanka_1989, place={Berlin/Heidelberg}, title={Time-optimal simulations of networks by universal parallel computers}, DOI={<a href=\"https://doi.org/10.1007/bfb0028978\">10.1007/bfb0028978</a>}, booktitle={STACS 89}, author={Meyer auf der Heide, Friedhelm and Wanka, Rolf}, year={1989} }","short":"F. Meyer auf der Heide, R. Wanka, in: STACS 89, Berlin/Heidelberg, 1989."},"publication_identifier":{"isbn":["3540508406"]},"publication_status":"published","title":"Time-optimal simulations of networks by universal parallel computers","doi":"10.1007/bfb0028978","date_updated":"2022-01-06T06:52:55Z","date_created":"2020-04-20T11:52:46Z","author":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"first_name":"Rolf","full_name":"Wanka, Rolf","last_name":"Wanka"}]},{"type":"book_chapter","publication":"STACS 89","status":"public","user_id":"15415","department":[{"_id":"63"}],"_id":"16789","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540508403","9783540460985"]},"citation":{"ama":"Meyer auf der Heide F. Computing minimum spanning forests on 1- and 2-dimensional processor arrays. In: <i>STACS 89</i>. Berlin, Heidelberg; 1989. doi:<a href=\"https://doi.org/10.1007/bfb0028983\">10.1007/bfb0028983</a>","chicago":"Meyer auf der Heide, Friedhelm. “Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays.” In <i>STACS 89</i>. Berlin, Heidelberg, 1989. <a href=\"https://doi.org/10.1007/bfb0028983\">https://doi.org/10.1007/bfb0028983</a>.","ieee":"F. Meyer auf der Heide, “Computing minimum spanning forests on 1- and 2-dimensional processor arrays,” in <i>STACS 89</i>, Berlin, Heidelberg, 1989.","apa":"Meyer auf der Heide, F. (1989). Computing minimum spanning forests on 1- and 2-dimensional processor arrays. In <i>STACS 89</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/bfb0028983\">https://doi.org/10.1007/bfb0028983</a>","short":"F. Meyer auf der Heide, in: STACS 89, Berlin, Heidelberg, 1989.","bibtex":"@inbook{Meyer auf der Heide_1989, place={Berlin, Heidelberg}, title={Computing minimum spanning forests on 1- and 2-dimensional processor arrays}, DOI={<a href=\"https://doi.org/10.1007/bfb0028983\">10.1007/bfb0028983</a>}, booktitle={STACS 89}, author={Meyer auf der Heide, Friedhelm}, year={1989} }","mla":"Meyer auf der Heide, Friedhelm. “Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays.” <i>STACS 89</i>, 1989, doi:<a href=\"https://doi.org/10.1007/bfb0028983\">10.1007/bfb0028983</a>."},"year":"1989","place":"Berlin, Heidelberg","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2020-04-21T11:37:58Z","date_updated":"2022-01-06T06:52:56Z","doi":"10.1007/bfb0028983","title":"Computing minimum spanning forests on 1- and 2-dimensional processor arrays"},{"user_id":"15415","department":[{"_id":"63"}],"_id":"16763","language":[{"iso":"eng"}],"type":"journal_article","publication":"Information and Computation","status":"public","date_created":"2020-04-21T08:50:17Z","author":[{"full_name":"Babai, László","last_name":"Babai","first_name":"László"},{"full_name":"Just, Bettina","last_name":"Just","first_name":"Bettina"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_updated":"2022-01-06T06:52:55Z","doi":"10.1016/0890-5401(88)90031-4","title":"On the limits of computations with the floor function","publication_status":"published","publication_identifier":{"issn":["0890-5401"]},"citation":{"ama":"Babai L, Just B, Meyer auf der Heide F. On the limits of computations with the floor function. <i>Information and Computation</i>. 1988:99-107. doi:<a href=\"https://doi.org/10.1016/0890-5401(88)90031-4\">10.1016/0890-5401(88)90031-4</a>","chicago":"Babai, László, Bettina Just, and Friedhelm Meyer auf der Heide. “On the Limits of Computations with the Floor Function.” <i>Information and Computation</i>, 1988, 99–107. <a href=\"https://doi.org/10.1016/0890-5401(88)90031-4\">https://doi.org/10.1016/0890-5401(88)90031-4</a>.","ieee":"L. Babai, B. Just, and F. Meyer auf der Heide, “On the limits of computations with the floor function,” <i>Information and Computation</i>, pp. 99–107, 1988.","bibtex":"@article{Babai_Just_Meyer auf der Heide_1988, title={On the limits of computations with the floor function}, DOI={<a href=\"https://doi.org/10.1016/0890-5401(88)90031-4\">10.1016/0890-5401(88)90031-4</a>}, journal={Information and Computation}, author={Babai, László and Just, Bettina and Meyer auf der Heide, Friedhelm}, year={1988}, pages={99–107} }","mla":"Babai, László, et al. “On the Limits of Computations with the Floor Function.” <i>Information and Computation</i>, 1988, pp. 99–107, doi:<a href=\"https://doi.org/10.1016/0890-5401(88)90031-4\">10.1016/0890-5401(88)90031-4</a>.","short":"L. Babai, B. Just, F. Meyer auf der Heide, Information and Computation (1988) 99–107.","apa":"Babai, L., Just, B., &#38; Meyer auf der Heide, F. (1988). On the limits of computations with the floor function. <i>Information and Computation</i>, 99–107. <a href=\"https://doi.org/10.1016/0890-5401(88)90031-4\">https://doi.org/10.1016/0890-5401(88)90031-4</a>"},"page":"99-107","year":"1988"}]