[{"department":[{"_id":"63"}],"publication":"Lecture Notes in Computer Science","author":[{"last_name":"Lürwer-Brüggemeier","full_name":"Lürwer-Brüggemeier, Katharina","first_name":"Katharina"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540565031","9783540475743"]},"publication_status":"published","date_created":"2020-04-20T11:25:51Z","status":"public","place":"Berlin, Heidelberg","title":"Capabilities and complexity of computations with integer division","user_id":"15415","year":"1993","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","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.","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} }","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.","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."},"type":"book_chapter","language":[{"iso":"eng"}],"_id":"16732","date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/3-540-56503-5_46"},{"publication":"Parallel Processing Letters 2","department":[{"_id":"63"}],"author":[{"full_name":"Kutylowski, Miroslaw","first_name":"Miroslaw","last_name":"Kutylowski"},{"last_name":"Wanka","full_name":"Wanka, Rolf","first_name":"Rolf"}],"date_created":"2020-09-03T11:05:14Z","status":"public","publication_identifier":{"issn":["0129-6264","1793-642X"]},"publication_status":"published","abstract":[{"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.","lang":"eng"}],"user_id":"15415","title":"Periodic Sorting on Two-Dimensional Meshes","language":[{"iso":"eng"}],"page":"213-220","citation":{"short":"M. Kutylowski, R. Wanka, Parallel Processing Letters 2 (1992) 213–220.","ieee":"M. Kutylowski and R. Wanka, “Periodic Sorting on Two-Dimensional Meshes,” Parallel Processing Letters 2, pp. 213–220, 1992, doi: 10.1142/s0129626492000349.","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","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.","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} }","mla":"Kutylowski, Miroslaw, and Rolf Wanka. “Periodic Sorting on Two-Dimensional Meshes.” Parallel Processing Letters 2, 1992, pp. 213–20, doi:10.1142/s0129626492000349."},"type":"journal_article","year":"1992","_id":"18936","date_updated":"2022-01-06T06:53:55Z","doi":"10.1142/s0129626492000349"},{"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540554882","9783540471035"]},"status":"public","date_created":"2020-04-20T11:27:50Z","author":[{"full_name":"Dietzfelbinger, Martin","first_name":"Martin","last_name":"Dietzfelbinger"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"publication":"Data structures and efficient algorithms","department":[{"_id":"63"}],"title":"High performance universal hashing, with applications to shared memory simulations","user_id":"15415","place":"Berlin, Heidelberg","citation":{"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.","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","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","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} }","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.","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."},"year":"1992","type":"book_chapter","language":[{"iso":"eng"}],"doi":"10.1007/3-540-55488-2_31","_id":"16733","date_updated":"2022-01-06T06:52:55Z"},{"language":[{"iso":"eng"}],"citation":{"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.","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.” Lecture Notes in Computer Science, 1992, doi: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.","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"},"type":"book_chapter","year":"1992","doi":"10.1007/3-540-56731-3_3","_id":"16734","date_updated":"2022-01-06T06:52:55Z","status":"public","date_created":"2020-04-20T11:29:58Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540567318","9783540476375"]},"author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"department":[{"_id":"63"}],"publication":"Lecture Notes in Computer Science","user_id":"15415","title":"Hashing strategies for simulating shared memory on distributed memory machines","place":"Berlin, Heidelberg"},{"user_id":"15415","title":"On the performance of networks with multiple busses","place":"Berlin, Heidelberg","status":"public","date_created":"2020-04-20T11:31:58Z","publication_identifier":{"isbn":["9783540552109","9783540467755"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Pham, Hieu Thien","first_name":"Hieu Thien","last_name":"Pham"}],"department":[{"_id":"63"}],"publication":"STACS 92","doi":"10.1007/3-540-55210-3_176","date_updated":"2022-01-06T06:52:55Z","_id":"16735","language":[{"iso":"eng"}],"citation":{"ieee":"F. Meyer auf der Heide and H. T. Pham, “On the performance of networks with multiple busses,” in STACS 92, Berlin, Heidelberg, 1992.","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.” STACS 92, 1992, doi: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.","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","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"},"year":"1992","type":"book_chapter"},{"publication":"Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92","department":[{"_id":"63"}],"author":[{"first_name":"Richard M.","full_name":"Karp, Richard M.","last_name":"Karp"},{"last_name":"Luby","first_name":"Michael","full_name":"Luby, Michael"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_created":"2020-04-20T11:33:22Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["0897915119"]},"user_id":"15415","title":"Efficient PRAM simulation on a distributed memory machine","language":[{"iso":"eng"}],"year":"1992","type":"conference","citation":{"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.","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.","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.","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.","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"},"date_updated":"2022-01-06T06:52:55Z","_id":"16736","doi":"10.1145/129712.129743"},{"place":"Wiesbaden","user_id":"15415","title":"Dynamic Hashing in Real Time","department":[{"_id":"63"}],"publication":"TEUBNER-TEXTE zur Informatik","author":[{"last_name":"Dietzfelbinger","full_name":"Dietzfelbinger, Martin","first_name":"Martin"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_created":"2020-04-20T11:35:06Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["9783815420331","9783322952332"],"issn":["1615-4584"]},"_id":"16737","date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/978-3-322-95233-2_7","language":[{"iso":"eng"}],"type":"book_chapter","year":"1992","citation":{"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","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","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.","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.","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} }","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: TEUBNER-TEXTE Zur Informatik, Wiesbaden, 1992.","ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “Dynamic Hashing in Real Time,” in TEUBNER-TEXTE zur Informatik, Wiesbaden, 1992."}},{"extern":"1","place":"Berlin/Heidelberg","title":"Approximation of convex polygons","user_id":"14955","author":[{"last_name":"Alt","full_name":"Alt, Helmut","first_name":"Helmut"},{"id":"23","last_name":"Blömer","full_name":"Blömer, Johannes","first_name":"Johannes"},{"last_name":"Wagener","first_name":"Hubert","full_name":"Wagener, Hubert"}],"publisher":"Springer-Verlag","publication":"Automata, Languages and Programming","department":[{"_id":"64"},{"_id":"63"}],"publication_identifier":{"isbn":["3540528261"]},"publication_status":"published","status":"public","date_created":"2018-06-05T08:56:43Z","date_updated":"2022-01-06T06:58:54Z","_id":"3050","doi":"10.1007/bfb0032068","year":"1990","type":"book_chapter","citation":{"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.","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","mla":"Alt, Helmut, et al. “Approximation of Convex Polygons.” Automata, Languages and Programming, Springer-Verlag, 1990, pp. 703–16, doi: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} }","short":"H. Alt, J. Blömer, H. Wagener, in: Automata, Languages and Programming, Springer-Verlag, Berlin/Heidelberg, 1990, pp. 703–716.","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."},"page":"703-716","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"type":"book_chapter","citation":{"short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Automata, Languages and Programming, Berlin/Heidelberg, 1990.","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.","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","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","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.","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} }","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."},"year":"1990","date_updated":"2022-01-06T06:52:55Z","_id":"16738","doi":"10.1007/bfb0032018","author":[{"last_name":"Dietzfelbinger","first_name":"Martin","full_name":"Dietzfelbinger, Martin"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publication":"Automata, Languages and Programming","department":[{"_id":"63"}],"status":"public","date_created":"2020-04-20T11:37:37Z","publication_identifier":{"isbn":["3540528261"]},"publication_status":"published","place":"Berlin/Heidelberg","user_id":"15415","title":"A new universal class of hash functions and dynamic hashing in real time"},{"user_id":"15415","title":"Dynamic hashing strategies","place":"Berlin/Heidelberg","status":"public","date_created":"2020-04-20T11:39:31Z","publication_identifier":{"isbn":["3540529535"]},"publication_status":"published","author":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"publication":"Lecture Notes in Computer Science","department":[{"_id":"63"}],"doi":"10.1007/bfb0029597","_id":"16739","date_updated":"2022-01-06T06:52:55Z","language":[{"iso":"eng"}],"type":"book_chapter","year":"1990","citation":{"ieee":"F. Meyer auf der Heide, “Dynamic hashing strategies,” in Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.","short":"F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.","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} }","mla":"Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.” Lecture Notes in Computer Science, 1990, doi:10.1007/bfb0029597.","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","chicago":"Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.” In Lecture Notes in Computer Science. Berlin/Heidelberg, 1990. https://doi.org/10.1007/bfb0029597."}},{"title":"On the complexity of genuinely polynomial computation","user_id":"15415","place":"Berlin/Heidelberg","publication_status":"published","publication_identifier":{"isbn":["3540529535"]},"status":"public","date_created":"2020-04-20T11:40:17Z","author":[{"first_name":"Marek","full_name":"Karpinski, Marek","last_name":"Karpinski"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"department":[{"_id":"63"}],"publication":"Lecture Notes in Computer Science","doi":"10.1007/bfb0029630","_id":"16740","date_updated":"2022-01-06T06:52:55Z","type":"book_chapter","year":"1990","citation":{"short":"M. Karpinski, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.","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.","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.","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} }","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."},"language":[{"iso":"eng"}]},{"title":"How to distribute a dictionary in a complete network","user_id":"15415","publication_identifier":{"isbn":["0897913612"]},"publication_status":"published","status":"public","date_created":"2020-04-20T11:41:08Z","author":[{"last_name":"Dietzfelbinger","full_name":"Dietzfelbinger, M.","first_name":"M."},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"department":[{"_id":"63"}],"publication":"Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90","doi":"10.1145/100216.100229","date_updated":"2022-01-06T06:52:55Z","_id":"16741","citation":{"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.","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.","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","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","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.","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing - STOC ’90, 1990."},"type":"conference","year":"1990","language":[{"iso":"eng"}]},{"user_id":"15415","title":"Not all keys can be hashed in constant time","status":"public","date_created":"2020-04-20T11:41:55Z","publication_identifier":{"isbn":["0897913612"]},"publication_status":"published","author":[{"last_name":"Gil","first_name":"J.","full_name":"Gil, J."},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"A.","full_name":"Wigderson, A.","last_name":"Wigderson"}],"publication":"Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90","department":[{"_id":"63"}],"doi":"10.1145/100216.100247","_id":"16742","date_updated":"2022-01-06T06:52:55Z","language":[{"iso":"eng"}],"type":"conference","citation":{"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.","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.","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","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.","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.","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} }"},"year":"1990"},{"publication":"Informatik Spektrum","department":[{"_id":"63"}],"author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"volume":13,"date_created":"2020-04-22T10:28:27Z","status":"public","title":"Das Heinz Nixdorf-Institut der Universität-GH Paderborn","user_id":"15415","page":"231-232","type":"journal_article","year":"1990","citation":{"chicago":"Meyer auf der Heide, Friedhelm. “Das Heinz Nixdorf-Institut Der Universität-GH Paderborn.” Informatik Spektrum 13, no. 4 (1990): 231–32.","apa":"Meyer auf der Heide, F. (1990). Das Heinz Nixdorf-Institut der Universität-GH Paderborn. Informatik Spektrum, 13(4), 231–232.","ama":"Meyer auf der Heide F. Das Heinz Nixdorf-Institut der Universität-GH Paderborn. Informatik Spektrum. 1990;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} }","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.","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."},"language":[{"iso":"eng"}],"_id":"16824","date_updated":"2022-01-06T06:52:56Z","intvolume":" 13","issue":"4"},{"date_updated":"2022-01-06T06:52:55Z","_id":"16743","doi":"10.1051/ita/1989230101011","language":[{"iso":"eng"}],"type":"journal_article","citation":{"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.","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.” RAIRO - Theoretical Informatics and Applications, 1989, pp. 101–11, doi: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} }","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","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","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."},"year":"1989","page":"101-111","user_id":"15415","title":"On computations with integer division","author":[{"last_name":"Just","full_name":"Just, Bettina","first_name":"Bettina"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Wigderson","full_name":"Wigderson, Avi","first_name":"Avi"}],"department":[{"_id":"63"}],"publication":"RAIRO - Theoretical Informatics and Applications","status":"public","date_created":"2020-04-20T11:49:38Z","publication_status":"published","publication_identifier":{"issn":["0988-3754","1290-385X"]}},{"citation":{"short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’89, 1989.","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.","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.","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} }","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."},"type":"conference","year":"1989","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:55Z","_id":"16744","doi":"10.1145/72935.72974","department":[{"_id":"63"}],"publication":"Proceedings of the first annual ACM symposium on Parallel algorithms and architectures - SPAA '89","author":[{"last_name":"Dietzfelbinger","full_name":"Dietzfelbinger, M.","first_name":"M."},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"publication_status":"published","publication_identifier":{"isbn":["089791323X"]},"date_created":"2020-04-20T11:51:01Z","status":"public","title":"An optimal parallel dictionary","user_id":"15415"},{"title":"On genuinely time bounded computations","user_id":"15415","place":"Berlin/Heidelberg","publication_identifier":{"isbn":["3540508406"]},"publication_status":"published","status":"public","date_created":"2020-04-20T11:51:54Z","author":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"publication":"STACS 89","department":[{"_id":"63"}],"doi":"10.1007/bfb0028969","_id":"16745","date_updated":"2022-01-06T06:52:55Z","year":"1989","citation":{"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} }","mla":"Meyer auf der Heide, Friedhelm. “On Genuinely Time Bounded Computations.” STACS 89, 1989, doi:10.1007/bfb0028969.","chicago":"Meyer auf der Heide, Friedhelm. “On Genuinely Time Bounded Computations.” In STACS 89. Berlin/Heidelberg, 1989. https://doi.org/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","ama":"Meyer auf der Heide F. On genuinely time bounded computations. In: STACS 89. Berlin/Heidelberg; 1989. doi:10.1007/bfb0028969","ieee":"F. Meyer auf der Heide, “On genuinely time bounded computations,” in STACS 89, Berlin/Heidelberg, 1989.","short":"F. Meyer auf der Heide, in: STACS 89, Berlin/Heidelberg, 1989."},"type":"book_chapter","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"type":"book_chapter","year":"1989","citation":{"short":"F. Meyer auf der Heide, R. Wanka, in: STACS 89, Berlin/Heidelberg, 1989.","ieee":"F. Meyer auf der Heide and R. Wanka, “Time-optimal simulations of networks by universal parallel computers,” in STACS 89, Berlin/Heidelberg, 1989.","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","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.","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} }","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."},"date_updated":"2022-01-06T06:52:55Z","_id":"16746","doi":"10.1007/bfb0028978","publication":"STACS 89","department":[{"_id":"63"}],"author":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Wanka, Rolf","first_name":"Rolf","last_name":"Wanka"}],"date_created":"2020-04-20T11:52:46Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["3540508406"]},"place":"Berlin/Heidelberg","user_id":"15415","title":"Time-optimal simulations of networks by universal parallel computers"},{"place":"Berlin, Heidelberg","user_id":"15415","title":"Computing minimum spanning forests on 1- and 2-dimensional processor arrays","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"publication":"STACS 89","department":[{"_id":"63"}],"status":"public","date_created":"2020-04-21T11:37:58Z","publication_identifier":{"isbn":["9783540508403","9783540460985"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","date_updated":"2022-01-06T06:52:56Z","_id":"16789","doi":"10.1007/bfb0028983","language":[{"iso":"eng"}],"citation":{"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","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","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.","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} }","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.","ieee":"F. Meyer auf der Heide, “Computing minimum spanning forests on 1- and 2-dimensional processor arrays,” in STACS 89, Berlin, Heidelberg, 1989."},"type":"book_chapter","year":"1989"},{"page":"99-107","year":"1988","type":"journal_article","citation":{"short":"L. Babai, B. Just, F. Meyer auf der Heide, Information and Computation (1988) 99–107.","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.","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.","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","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.","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} }"},"language":[{"iso":"eng"}],"doi":"10.1016/0890-5401(88)90031-4","date_updated":"2022-01-06T06:52:55Z","_id":"16763","publication_status":"published","publication_identifier":{"issn":["0890-5401"]},"date_created":"2020-04-21T08:50:17Z","status":"public","department":[{"_id":"63"}],"publication":"Information and Computation","author":[{"first_name":"László","full_name":"Babai, László","last_name":"Babai"},{"last_name":"Just","full_name":"Just, Bettina","first_name":"Bettina"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"title":"On the limits of computations with the floor function","user_id":"15415"},{"language":[{"iso":"eng"}],"citation":{"ieee":"F. Meyer auf der Heide, “Fast algorithms for N-dimensional restrictions of hard problems,” Journal of the ACM (JACM), pp. 740–747, 1988.","short":"F. Meyer auf der Heide, Journal of the ACM (JACM) (1988) 740–747.","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} }","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.","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.","apa":"Meyer auf der Heide, F. (1988). Fast algorithms for N-dimensional restrictions of hard problems. Journal of the ACM (JACM), 740–747. https://doi.org/10.1145/44483.44490","ama":"Meyer auf der Heide F. Fast algorithms for N-dimensional restrictions of hard problems. Journal of the ACM (JACM). 1988:740-747. doi:10.1145/44483.44490"},"type":"journal_article","year":"1988","page":"740-747","doi":"10.1145/44483.44490","_id":"16764","date_updated":"2022-01-06T06:52:55Z","status":"public","date_created":"2020-04-21T08:51:54Z","publication_identifier":{"issn":["0004-5411","1557-735X"]},"publication_status":"published","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"department":[{"_id":"63"}],"publication":"Journal of the ACM (JACM)","user_id":"15415","title":"Fast algorithms for N-dimensional restrictions of hard problems"},{"status":"public","date_created":"2020-04-21T08:53:13Z","publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","author":[{"full_name":"Borodin, Allan","first_name":"Allan","last_name":"Borodin"},{"last_name":"Fich","first_name":"Faith E.","full_name":"Fich, Faith E."},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Upfal, Eli","first_name":"Eli","last_name":"Upfal"},{"last_name":"Wigderson","first_name":"Avi","full_name":"Wigderson, Avi"}],"department":[{"_id":"63"}],"publication":"Theoretical Computer Science","user_id":"15415","title":"A tradeoff between search and update time for the implicit dictionary problem","language":[{"iso":"eng"}],"citation":{"short":"A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, Theoretical Computer Science (1988) 57–68.","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.","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.","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} }","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."},"type":"journal_article","year":"1988","page":"57-68","doi":"10.1016/0304-3975(88)90018-7","_id":"16765","date_updated":"2022-01-06T06:52:55Z"},{"publication":"[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science","department":[{"_id":"63"}],"author":[{"first_name":"M.","full_name":"Dietzfelbinger, M.","last_name":"Dietzfelbinger"},{"last_name":"Karlin","first_name":"A.","full_name":"Karlin, A."},{"last_name":"Mehlhorn","full_name":"Mehlhorn, K.","first_name":"K."},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Rohnert, H.","first_name":"H.","last_name":"Rohnert"},{"last_name":"Tarjan","first_name":"R.E.","full_name":"Tarjan, R.E."}],"date_created":"2020-04-21T08:59:26Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["0818608773"]},"user_id":"15415","title":"Dynamic perfect hashing: upper and lower bounds","language":[{"iso":"eng"}],"citation":{"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.","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.","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","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","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.","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."},"year":"1988","type":"conference","_id":"16766","date_updated":"2022-01-06T06:52:55Z","doi":"10.1109/sfcs.1988.21968"},{"language":[{"iso":"eng"}],"type":"book_chapter","year":"1988","citation":{"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","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","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.","mla":"Just, Bettina, et al. “On Computations with Integer Division.” STACS 88, 1988, doi: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} }","short":"B. Just, F. Mathematik, F. Meyer auf der Heide, F. Informatik, A. Wigderson, in: STACS 88, Berlin, Heidelberg, 1988.","ieee":"B. Just, F. Mathematik, F. Meyer auf der Heide, F. Informatik, and A. Wigderson, “On computations with integer division,” in STACS 88, Berlin, Heidelberg, 1988."},"doi":"10.1007/bfb0035829","date_updated":"2022-01-06T06:52:55Z","_id":"16767","date_created":"2020-04-21T09:00:37Z","status":"public","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540188346","9783540481904"]},"department":[{"_id":"63"}],"publication":"STACS 88","author":[{"first_name":"Bettina","full_name":"Just, Bettina","last_name":"Just"},{"last_name":"Mathematik","full_name":"Mathematik, Fb","first_name":"Fb"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Informatik","first_name":"Fb","full_name":"Informatik, Fb"},{"full_name":"Wigderson, Avi","first_name":"Avi","last_name":"Wigderson"}],"user_id":"15415","title":"On computations with integer division","place":"Berlin, Heidelberg"},{"citation":{"short":"M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, in: SWAT 88, Berlin, Heidelberg, 1988.","ieee":"M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, and H. Rohnert, “Upper and lower bounds for the dictionary problem,” in SWAT 88, Berlin, Heidelberg, 1988.","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","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.","mla":"Dietzfelbinger, M., et al. “Upper and Lower Bounds for the Dictionary Problem.” SWAT 88, 1988, doi: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} }"},"year":"1988","type":"book_chapter","language":[{"iso":"eng"}],"doi":"10.1007/3-540-19487-8_24","_id":"16768","date_updated":"2022-01-06T06:52:55Z","publication_identifier":{"isbn":["9783540194873","9783540392880"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","status":"public","date_created":"2020-04-21T09:01:36Z","author":[{"full_name":"Dietzfelbinger, M.","first_name":"M.","last_name":"Dietzfelbinger"},{"last_name":"Mehlhorn","first_name":"K.","full_name":"Mehlhorn, K."},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Rohnert, H.","first_name":"H.","last_name":"Rohnert"}],"department":[{"_id":"63"}],"publication":"SWAT 88","title":"Upper and lower bounds for the dictionary problem","user_id":"15415","place":"Berlin, Heidelberg"},{"doi":"10.1137/0216007","_id":"16772","date_updated":"2022-01-06T06:52:55Z","citation":{"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} }","mla":"Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.” SIAM Journal on Computing, 1987, pp. 97–99, doi:10.1137/0216007.","chicago":"Borodin, A., F. Fich, Friedhelm Meyer auf der Heide, E. Upfal, and A. Wigderson. “A Time-Space Tradeoff for Element Distinctness.” SIAM Journal on Computing, 1987, 97–99. https://doi.org/10.1137/0216007.","ama":"Borodin A, Fich F, Meyer auf der Heide F, Upfal E, Wigderson A. A Time-Space Tradeoff for Element Distinctness. SIAM Journal on Computing. 1987:97-99. doi:10.1137/0216007","apa":"Borodin, A., Fich, F., Meyer auf der Heide, F., Upfal, E., & Wigderson, A. (1987). A Time-Space Tradeoff for Element Distinctness. SIAM Journal on Computing, 97–99. https://doi.org/10.1137/0216007","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.","short":"A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, SIAM Journal on Computing (1987) 97–99."},"year":"1987","type":"journal_article","page":"97-99","language":[{"iso":"eng"}],"title":"A Time-Space Tradeoff for Element Distinctness","user_id":"15415","publication_status":"published","publication_identifier":{"issn":["0097-5397","1095-7111"]},"status":"public","date_created":"2020-04-21T10:00:29Z","author":[{"full_name":"Borodin, A.","first_name":"A.","last_name":"Borodin"},{"full_name":"Fich, F.","first_name":"F.","last_name":"Fich"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Upfal, E.","first_name":"E.","last_name":"Upfal"},{"last_name":"Wigderson","full_name":"Wigderson, A.","first_name":"A."}],"department":[{"_id":"63"}],"publication":"SIAM Journal on Computing"},{"user_id":"15415","title":"The Complexity of Parallel Sorting","date_created":"2020-04-21T10:01:37Z","status":"public","publication_identifier":{"issn":["0097-5397","1095-7111"]},"publication_status":"published","publication":"SIAM Journal on Computing","department":[{"_id":"63"}],"author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Avi","full_name":"Wigderson, Avi","last_name":"Wigderson"}],"doi":"10.1137/0216008","date_updated":"2022-01-06T06:52:55Z","_id":"16773","language":[{"iso":"eng"}],"page":"100-107","citation":{"ieee":"F. Meyer auf der Heide and A. Wigderson, “The Complexity of Parallel Sorting,” SIAM Journal on Computing, pp. 100–107, 1987.","short":"F. Meyer auf der Heide, A. Wigderson, SIAM Journal on Computing (1987) 100–107.","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} }","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.","apa":"Meyer auf der Heide, F., & Wigderson, A. (1987). The Complexity of Parallel Sorting. SIAM Journal on Computing, 100–107. https://doi.org/10.1137/0216008","ama":"Meyer auf der Heide F, Wigderson A. The Complexity of Parallel Sorting. SIAM Journal on Computing. 1987:100-107. doi:10.1137/0216008","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."},"type":"journal_article","year":"1987"},{"language":[{"iso":"eng"}],"page":"106-119","citation":{"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} }","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.","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.","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","ieee":"F. Meyer auf der Heide, “Efficient Simulations among Several Models of Parallel Computers,” SIAM Journal on Computing, pp. 106–119, 1986.","short":"F. Meyer auf der Heide, SIAM Journal on Computing (1986) 106–119."},"year":"1986","type":"journal_article","doi":"10.1137/0215008","_id":"16771","date_updated":"2022-01-06T06:52:55Z","date_created":"2020-04-21T09:59:29Z","status":"public","publication_status":"published","publication_identifier":{"issn":["0097-5397","1095-7111"]},"department":[{"_id":"63"}],"publication":"SIAM Journal on Computing","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"user_id":"15415","title":"Efficient Simulations among Several Models of Parallel Computers"},{"language":[{"iso":"eng"}],"year":"1986","type":"book_chapter","citation":{"chicago":"Borodin, Allan, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, and Avi Wigderson. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.” In Automata, Languages and Programming. Berlin, Heidelberg, 1986. https://doi.org/10.1007/3-540-16761-7_54.","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","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","mla":"Borodin, Allan, et al. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.” Automata, Languages and Programming, 1986, doi:10.1007/3-540-16761-7_54.","bibtex":"@inbook{Borodin_Fich_Meyer auf der Heide_Upfal_Wigderson_1986, place={Berlin, Heidelberg}, title={A tradeoff between search and update time for the implicit dictionary problem}, DOI={10.1007/3-540-16761-7_54}, booktitle={Automata, Languages and Programming}, author={Borodin, Allan and Fich, Faith E. and Meyer auf der Heide, Friedhelm and Upfal, Eli and Wigderson, Avi}, year={1986} }","short":"A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in: Automata, Languages and Programming, Berlin, Heidelberg, 1986.","ieee":"A. Borodin, F. E. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A tradeoff between search and update time for the implicit dictionary problem,” in Automata, Languages and Programming, Berlin, Heidelberg, 1986."},"date_updated":"2022-01-06T06:52:55Z","_id":"16774","doi":"10.1007/3-540-16761-7_54","author":[{"last_name":"Borodin","full_name":"Borodin, Allan","first_name":"Allan"},{"first_name":"Faith E.","full_name":"Fich, Faith E.","last_name":"Fich"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"first_name":"Eli","full_name":"Upfal, Eli","last_name":"Upfal"},{"first_name":"Avi","full_name":"Wigderson, Avi","last_name":"Wigderson"}],"department":[{"_id":"63"}],"publication":"Automata, Languages and Programming","status":"public","date_created":"2020-04-21T10:05:54Z","publication_status":"published","publication_identifier":{"isbn":["9783540167617","9783540398592"],"issn":["0302-9743","1611-3349"]},"place":"Berlin, Heidelberg","user_id":"15415","title":"A tradeoff between search and update time for the implicit dictionary problem"},{"language":[{"iso":"eng"}],"type":"book_chapter","year":"1986","citation":{"ieee":"F. Meyer auf der Heide, “Speeding up random access machines by few processors,” in STACS 86, Berlin, Heidelberg, 1986.","short":"F. Meyer auf der Heide, in: STACS 86, Berlin, Heidelberg, 1986.","bibtex":"@inbook{Meyer auf der Heide_1986, place={Berlin, Heidelberg}, title={Speeding up random access machines by few processors}, DOI={10.1007/3-540-16078-7_72}, booktitle={STACS 86}, author={Meyer auf der Heide, Friedhelm}, year={1986} }","mla":"Meyer auf der Heide, Friedhelm. “Speeding up Random Access Machines by Few Processors.” STACS 86, 1986, doi:10.1007/3-540-16078-7_72.","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.","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","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"},"date_updated":"2022-01-06T06:52:55Z","_id":"16775","doi":"10.1007/3-540-16078-7_72","department":[{"_id":"63"}],"publication":"STACS 86","author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"date_created":"2020-04-21T10:07:06Z","status":"public","publication_identifier":{"isbn":["9783540160786","9783540397588"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","place":"Berlin, Heidelberg","user_id":"15415","title":"Speeding up random access machines by few processors"},{"doi":"10.1007/3-540-16078-7_89","_id":"16776","date_updated":"2022-01-06T06:52:55Z","language":[{"iso":"eng"}],"type":"book_chapter","citation":{"short":"A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in: STACS 86, Berlin, Heidelberg, 1986.","ieee":"A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A time-space tradeoff for element distinctness,” in STACS 86, Berlin, Heidelberg, 1986.","chicago":"Borodin, A., F. Fich, Friedhelm Meyer auf der Heide, E. Upfal, and A. Wigderson. “A Time-Space Tradeoff for Element Distinctness.” In STACS 86. Berlin, Heidelberg, 1986. https://doi.org/10.1007/3-540-16078-7_89.","apa":"Borodin, A., Fich, F., Meyer auf der Heide, F., Upfal, E., & Wigderson, A. (1986). A time-space tradeoff for element distinctness. In STACS 86. Berlin, Heidelberg. https://doi.org/10.1007/3-540-16078-7_89","ama":"Borodin A, Fich F, Meyer auf der Heide F, Upfal E, Wigderson A. A time-space tradeoff for element distinctness. In: STACS 86. Berlin, Heidelberg; 1986. doi:10.1007/3-540-16078-7_89","bibtex":"@inbook{Borodin_Fich_Meyer auf der Heide_Upfal_Wigderson_1986, place={Berlin, Heidelberg}, title={A time-space tradeoff for element distinctness}, DOI={10.1007/3-540-16078-7_89}, booktitle={STACS 86}, author={Borodin, A. and Fich, F. and Meyer auf der Heide, Friedhelm and Upfal, E. and Wigderson, A.}, year={1986} }","mla":"Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.” STACS 86, 1986, doi:10.1007/3-540-16078-7_89."},"year":"1986","user_id":"15415","title":"A time-space tradeoff for element distinctness","place":"Berlin, Heidelberg","status":"public","date_created":"2020-04-21T10:08:23Z","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540160786","9783540397588"]},"publication_status":"published","author":[{"full_name":"Borodin, A.","first_name":"A.","last_name":"Borodin"},{"first_name":"F.","full_name":"Fich, F.","last_name":"Fich"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"first_name":"E.","full_name":"Upfal, E.","last_name":"Upfal"},{"full_name":"Wigderson, A.","first_name":"A.","last_name":"Wigderson"}],"publication":"STACS 86","department":[{"_id":"63"}]},{"date_created":"2020-04-21T10:15:46Z","status":"public","publication_identifier":{"issn":["0020-0190"]},"publication_status":"published","publication":"Information Processing Letters","department":[{"_id":"63"}],"author":[{"last_name":"Lautemann","full_name":"Lautemann, Clemens","first_name":"Clemens"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"user_id":"15415","title":"Lower time bounds for integer programming with two variables","language":[{"iso":"eng"}],"page":"101-105","type":"journal_article","citation":{"ieee":"C. Lautemann and F. Meyer auf der Heide, “Lower time bounds for integer programming with two variables,” Information Processing Letters, pp. 101–105, 1985.","short":"C. Lautemann, F. Meyer auf der Heide, Information Processing Letters (1985) 101–105.","mla":"Lautemann, Clemens, and Friedhelm Meyer auf der Heide. “Lower Time Bounds for Integer Programming with Two Variables.” Information Processing Letters, 1985, pp. 101–05, doi:10.1016/0020-0190(85)90042-0.","bibtex":"@article{Lautemann_Meyer auf der Heide_1985, title={Lower time bounds for integer programming with two variables}, DOI={10.1016/0020-0190(85)90042-0}, journal={Information Processing Letters}, author={Lautemann, Clemens and Meyer auf der Heide, Friedhelm}, year={1985}, pages={101–105} }","chicago":"Lautemann, Clemens, and Friedhelm Meyer auf der Heide. “Lower Time Bounds for Integer Programming with Two Variables.” Information Processing Letters, 1985, 101–5. https://doi.org/10.1016/0020-0190(85)90042-0.","apa":"Lautemann, C., & Meyer auf der Heide, F. (1985). Lower time bounds for integer programming with two variables. Information Processing Letters, 101–105. https://doi.org/10.1016/0020-0190(85)90042-0","ama":"Lautemann C, Meyer auf der Heide F. Lower time bounds for integer programming with two variables. Information Processing Letters. 1985:101-105. doi:10.1016/0020-0190(85)90042-0"},"year":"1985","doi":"10.1016/0020-0190(85)90042-0","date_updated":"2022-01-06T06:52:55Z","_id":"16779"},{"author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"department":[{"_id":"63"}],"publication":"Journal of the ACM (JACM)","status":"public","date_created":"2020-04-21T10:16:50Z","publication_status":"published","publication_identifier":{"issn":["0004-5411","1557-735X"]},"user_id":"15415","title":"Lower bounds for solving linear diophantine equations on random access machines","language":[{"iso":"eng"}],"year":"1985","type":"journal_article","citation":{"ieee":"F. Meyer auf der Heide, “Lower bounds for solving linear diophantine equations on random access machines,” Journal of the ACM (JACM), pp. 929–937, 1985.","short":"F. Meyer auf der Heide, Journal of the ACM (JACM) (1985) 929–937.","mla":"Meyer auf der Heide, Friedhelm. “Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines.” Journal of the ACM (JACM), 1985, pp. 929–37, doi:10.1145/4221.4250.","bibtex":"@article{Meyer auf der Heide_1985, title={Lower bounds for solving linear diophantine equations on random access machines}, DOI={10.1145/4221.4250}, journal={Journal of the ACM (JACM)}, author={Meyer auf der Heide, Friedhelm}, year={1985}, pages={929–937} }","ama":"Meyer auf der Heide F. Lower bounds for solving linear diophantine equations on random access machines. Journal of the ACM (JACM). 1985:929-937. doi:10.1145/4221.4250","apa":"Meyer auf der Heide, F. (1985). Lower bounds for solving linear diophantine equations on random access machines. Journal of the ACM (JACM), 929–937. https://doi.org/10.1145/4221.4250","chicago":"Meyer auf der Heide, Friedhelm. “Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines.” Journal of the ACM (JACM), 1985, 929–37. https://doi.org/10.1145/4221.4250."},"page":"929-937","date_updated":"2022-01-06T06:52:55Z","_id":"16780","doi":"10.1145/4221.4250"},{"_id":"16781","date_updated":"2022-01-06T06:52:55Z","doi":"10.1016/0304-3975(85)90079-9","language":[{"iso":"eng"}],"page":"325-330","year":"1985","type":"journal_article","citation":{"short":"F. Meyer auf der Heide, Theoretical Computer Science (1985) 325–330.","ieee":"F. Meyer auf der Heide, “Simulating probabilistic by deterministic algebraic computation trees,” Theoretical Computer Science, pp. 325–330, 1985.","ama":"Meyer auf der Heide F. Simulating probabilistic by deterministic algebraic computation trees. Theoretical Computer Science. 1985:325-330. doi:10.1016/0304-3975(85)90079-9","apa":"Meyer auf der Heide, F. (1985). Simulating probabilistic by deterministic algebraic computation trees. Theoretical Computer Science, 325–330. https://doi.org/10.1016/0304-3975(85)90079-9","chicago":"Meyer auf der Heide, Friedhelm. “Simulating Probabilistic by Deterministic Algebraic Computation Trees.” Theoretical Computer Science, 1985, 325–30. https://doi.org/10.1016/0304-3975(85)90079-9.","mla":"Meyer auf der Heide, Friedhelm. “Simulating Probabilistic by Deterministic Algebraic Computation Trees.” Theoretical Computer Science, 1985, pp. 325–30, doi:10.1016/0304-3975(85)90079-9.","bibtex":"@article{Meyer auf der Heide_1985, title={Simulating probabilistic by deterministic algebraic computation trees}, DOI={10.1016/0304-3975(85)90079-9}, journal={Theoretical Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1985}, pages={325–330} }"},"user_id":"15415","title":"Simulating probabilistic by deterministic algebraic computation trees","publication":"Theoretical Computer Science","department":[{"_id":"63"}],"author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"date_created":"2020-04-21T11:18:44Z","status":"public","publication_status":"published","publication_identifier":{"issn":["0304-3975"]}},{"language":[{"iso":"eng"}],"year":"1985","citation":{"bibtex":"@inproceedings{Meyer auf der Heide_Wigderson_1985, title={The complexity of parallel sorting}, DOI={10.1109/sfcs.1985.58}, booktitle={26th Annual Symposium on Foundations of Computer Science (sfcs 1985)}, author={Meyer auf der Heide, Friedhelm and Wigderson, Avi}, year={1985} }","mla":"Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.” 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985, doi:10.1109/sfcs.1985.58.","chicago":"Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.” In 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985. https://doi.org/10.1109/sfcs.1985.58.","apa":"Meyer auf der Heide, F., & Wigderson, A. (1985). The complexity of parallel sorting. In 26th Annual Symposium on Foundations of Computer Science (sfcs 1985). https://doi.org/10.1109/sfcs.1985.58","ama":"Meyer auf der Heide F, Wigderson A. The complexity of parallel sorting. In: 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985). ; 1985. doi:10.1109/sfcs.1985.58","ieee":"F. Meyer auf der Heide and A. Wigderson, “The complexity of parallel sorting,” in 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 1985.","short":"F. Meyer auf der Heide, A. Wigderson, in: 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985."},"type":"conference","doi":"10.1109/sfcs.1985.58","date_updated":"2022-01-06T06:52:55Z","_id":"16782","status":"public","date_created":"2020-04-21T11:19:34Z","publication_identifier":{"isbn":["0818606444"]},"publication_status":"published","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Avi","full_name":"Wigderson, Avi","last_name":"Wigderson"}],"department":[{"_id":"63"}],"publication":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","user_id":"15415","title":"The complexity of parallel sorting"},{"doi":"10.1145/22145.22151","date_updated":"2022-01-06T06:52:55Z","_id":"16783","citation":{"short":"F.E. Fich, F. Meyer auf der Heide, P. Ragde, A. Wigderson, in: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85, 1985.","ieee":"F. E. Fich, F. Meyer auf der Heide, P. Ragde, and A. Wigderson, “One, two, three . . . infinity: lower bounds for parallel computation,” in Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC ’85, 1985.","apa":"Fich, F. E., Meyer auf der Heide, F., Ragde, P., & Wigderson, A. (1985). One, two, three . . . infinity: lower bounds for parallel computation. In Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC ’85. https://doi.org/10.1145/22145.22151","ama":"Fich FE, Meyer auf der Heide F, Ragde P, Wigderson A. One, two, three . . . infinity: lower bounds for parallel computation. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85. ; 1985. doi:10.1145/22145.22151","chicago":"Fich, F E, Friedhelm Meyer auf der Heide, P Ragde, and A Wigderson. “One, Two, Three . . . Infinity: Lower Bounds for Parallel Computation.” In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85, 1985. https://doi.org/10.1145/22145.22151.","mla":"Fich, F. E., et al. “One, Two, Three . . . Infinity: Lower Bounds for Parallel Computation.” Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85, 1985, doi:10.1145/22145.22151.","bibtex":"@inproceedings{Fich_Meyer auf der Heide_Ragde_Wigderson_1985, title={One, two, three . . . infinity: lower bounds for parallel computation}, DOI={10.1145/22145.22151}, booktitle={Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC ’85}, author={Fich, F E and Meyer auf der Heide, Friedhelm and Ragde, P and Wigderson, A}, year={1985} }"},"year":"1985","type":"conference","language":[{"iso":"eng"}],"title":"One, two, three . . . infinity: lower bounds for parallel computation","user_id":"15415","publication_status":"published","publication_identifier":{"isbn":["0897911512"]},"status":"public","date_created":"2020-04-21T11:20:53Z","author":[{"last_name":"Fich","first_name":"F E","full_name":"Fich, F E"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Ragde","full_name":"Ragde, P","first_name":"P"},{"last_name":"Wigderson","full_name":"Wigderson, A","first_name":"A"}],"publication":"Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85","department":[{"_id":"63"}]},{"date_created":"2020-04-21T11:24:17Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["0897911512"]},"department":[{"_id":"63"}],"publication":"Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"user_id":"15415","title":"Fast algorithms for n-dimensional restrictions of hard problems","language":[{"iso":"eng"}],"citation":{"bibtex":"@inproceedings{Meyer auf der Heide_1985, title={Fast algorithms for n-dimensional restrictions of hard problems}, DOI={10.1145/22145.22191}, booktitle={Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC ’85}, author={Meyer auf der Heide, Friedhelm}, year={1985} }","mla":"Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions of Hard Problems.” Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85, 1985, doi:10.1145/22145.22191.","chicago":"Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions of Hard Problems.” In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85, 1985. https://doi.org/10.1145/22145.22191.","apa":"Meyer auf der Heide, F. (1985). Fast algorithms for n-dimensional restrictions of hard problems. In Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC ’85. https://doi.org/10.1145/22145.22191","ama":"Meyer auf der Heide F. Fast algorithms for n-dimensional restrictions of hard problems. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85. ; 1985. doi:10.1145/22145.22191","ieee":"F. Meyer auf der Heide, “Fast algorithms for n-dimensional restrictions of hard problems,” in Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC ’85, 1985.","short":"F. Meyer auf der Heide, in: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85, 1985."},"year":"1985","type":"conference","doi":"10.1145/22145.22191","date_updated":"2022-01-06T06:52:56Z","_id":"16784"},{"title":"Nondeterministic versus probabilistic linear search algorithms","user_id":"15415","author":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"department":[{"_id":"63"}],"publication":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","publication_identifier":{"isbn":["0818606444"]},"publication_status":"published","status":"public","date_created":"2020-04-21T11:30:30Z","_id":"16788","date_updated":"2022-01-06T06:52:56Z","doi":"10.1109/sfcs.1985.38","citation":{"short":"F. Meyer auf der Heide, in: 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985.","ieee":"F. Meyer auf der Heide, “Nondeterministic versus probabilistic linear search algorithms,” in 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 1985.","chicago":"Meyer auf der Heide, Friedhelm. “Nondeterministic versus Probabilistic Linear Search Algorithms.” In 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985. https://doi.org/10.1109/sfcs.1985.38.","apa":"Meyer auf der Heide, F. (1985). Nondeterministic versus probabilistic linear search algorithms. In 26th Annual Symposium on Foundations of Computer Science (sfcs 1985). https://doi.org/10.1109/sfcs.1985.38","ama":"Meyer auf der Heide F. Nondeterministic versus probabilistic linear search algorithms. In: 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985). ; 1985. doi:10.1109/sfcs.1985.38","bibtex":"@inproceedings{Meyer auf der Heide_1985, title={Nondeterministic versus probabilistic linear search algorithms}, DOI={10.1109/sfcs.1985.38}, booktitle={26th Annual Symposium on Foundations of Computer Science (sfcs 1985)}, author={Meyer auf der Heide, Friedhelm}, year={1985} }","mla":"Meyer auf der Heide, Friedhelm. “Nondeterministic versus Probabilistic Linear Search Algorithms.” 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985, doi:10.1109/sfcs.1985.38."},"type":"conference","year":"1985","language":[{"iso":"eng"}]},{"volume":67,"status":"public","date_created":"2020-04-22T09:58:17Z","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"department":[{"_id":"63"}],"publication":"Information and Control","title":"Lower time bounds for solving linear diophantine equations on several parallel computational models","user_id":"15415","type":"journal_article","citation":{"short":"F. Meyer auf der Heide, Information and Control 67 (1985) 195–211.","ieee":"F. Meyer auf der Heide, “Lower time bounds for solving linear diophantine equations on several parallel computational models,” Information and Control, vol. 67, no. 1–3, pp. 195–211, 1985.","chicago":"Meyer auf der Heide, Friedhelm. “Lower Time Bounds for Solving Linear Diophantine Equations on Several Parallel Computational Models.” Information and Control 67, no. 1–3 (1985): 195–211. https://doi.org/10.1016/S0019-9958(85)80035-8.","apa":"Meyer auf der Heide, F. (1985). Lower time bounds for solving linear diophantine equations on several parallel computational models. Information and Control, 67(1–3), 195–211. https://doi.org/10.1016/S0019-9958(85)80035-8","ama":"Meyer auf der Heide F. Lower time bounds for solving linear diophantine equations on several parallel computational models. Information and Control. 1985;67(1-3):195-211. doi:10.1016/S0019-9958(85)80035-8","bibtex":"@article{Meyer auf der Heide_1985, title={Lower time bounds for solving linear diophantine equations on several parallel computational models}, volume={67}, DOI={10.1016/S0019-9958(85)80035-8}, number={1–3}, journal={Information and Control}, author={Meyer auf der Heide, Friedhelm}, year={1985}, pages={195–211} }","mla":"Meyer auf der Heide, Friedhelm. “Lower Time Bounds for Solving Linear Diophantine Equations on Several Parallel Computational Models.” Information and Control, vol. 67, no. 1–3, 1985, pp. 195–211, doi:10.1016/S0019-9958(85)80035-8."},"year":"1985","page":"195-211","language":[{"iso":"eng"}],"doi":"10.1016/S0019-9958(85)80035-8","issue":"1-3","_id":"16823","intvolume":" 67","date_updated":"2022-01-06T06:52:56Z"},{"user_id":"15415","title":"A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem","department":[{"_id":"63"}],"publication":"Journal of the ACM (JACM)","author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"date_created":"2020-04-21T11:25:52Z","status":"public","publication_status":"published","publication_identifier":{"issn":["0004-5411","1557-735X"]},"_id":"16785","date_updated":"2022-01-06T06:52:56Z","doi":"10.1145/828.322450","language":[{"iso":"eng"}],"page":"668-676","type":"journal_article","year":"1984","citation":{"short":"F. Meyer auf der Heide, Journal of the ACM (JACM) (1984) 668–676.","ieee":"F. Meyer auf der Heide, “A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem,” Journal of the ACM (JACM), pp. 668–676, 1984.","ama":"Meyer auf der Heide F. A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem. Journal of the ACM (JACM). 1984:668-676. doi:10.1145/828.322450","apa":"Meyer auf der Heide, F. (1984). A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem. Journal of the ACM (JACM), 668–676. https://doi.org/10.1145/828.322450","chicago":"Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm Forr the N-Dimensional Knapsack Problem.” Journal of the ACM (JACM), 1984, 668–76. https://doi.org/10.1145/828.322450.","bibtex":"@article{Meyer auf der Heide_1984, title={A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem}, DOI={10.1145/828.322450}, journal={Journal of the ACM (JACM)}, author={Meyer auf der Heide, Friedhelm}, year={1984}, pages={668–676} }","mla":"Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm Forr the N-Dimensional Knapsack Problem.” Journal of the ACM (JACM), 1984, pp. 668–76, doi:10.1145/828.322450."}},{"doi":"10.1109/sfcs.1984.715901","_id":"16786","date_updated":"2022-01-06T06:52:56Z","language":[{"iso":"eng"}],"type":"conference","year":"1984","citation":{"apa":"Meyer auf der Heide, F., & Reischuk, R. (1984). On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication. In 25th Annual Symposium onFoundations of Computer Science, 1984. https://doi.org/10.1109/sfcs.1984.715901","ama":"Meyer auf der Heide F, Reischuk R. On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication. In: 25th Annual Symposium OnFoundations of Computer Science, 1984. ; 1984. doi:10.1109/sfcs.1984.715901","chicago":"Meyer auf der Heide, Friedhelm, and R. Reischuk. “On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication.” In 25th Annual Symposium OnFoundations of Computer Science, 1984., 1984. https://doi.org/10.1109/sfcs.1984.715901.","bibtex":"@inproceedings{Meyer auf der Heide_Reischuk_1984, title={On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication}, DOI={10.1109/sfcs.1984.715901}, booktitle={25th Annual Symposium onFoundations of Computer Science, 1984.}, author={Meyer auf der Heide, Friedhelm and Reischuk, R.}, year={1984} }","mla":"Meyer auf der Heide, Friedhelm, and R. Reischuk. “On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication.” 25th Annual Symposium OnFoundations of Computer Science, 1984., 1984, doi:10.1109/sfcs.1984.715901.","short":"F. Meyer auf der Heide, R. Reischuk, in: 25th Annual Symposium OnFoundations of Computer Science, 1984., 1984.","ieee":"F. Meyer auf der Heide and R. Reischuk, “On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication,” in 25th Annual Symposium onFoundations of Computer Science, 1984., 1984."},"user_id":"15415","title":"On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded Communication","date_created":"2020-04-21T11:27:07Z","status":"public","publication_identifier":{"isbn":["081860591X"]},"publication_status":"published","publication":"25th Annual Symposium onFoundations of Computer Science, 1984.","department":[{"_id":"63"}],"author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Reischuk, R.","first_name":"R.","last_name":"Reischuk"}]},{"author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"publication":"STACS 84","department":[{"_id":"63"}],"publication_status":"published","publication_identifier":{"isbn":["9783540129202","9783540388050"],"issn":["0302-9743","1611-3349"]},"status":"public","date_created":"2020-04-21T11:28:40Z","place":"Berlin, Heidelberg","title":"Efficient simulations among several models of parallel computers (extended abstract)","user_id":"15415","type":"book_chapter","citation":{"mla":"Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers (Extended Abstract).” STACS 84, 1984, doi:10.1007/3-540-12920-0_20.","bibtex":"@inbook{Meyer auf der Heide_1984, place={Berlin, Heidelberg}, title={Efficient simulations among several models of parallel computers (extended abstract)}, DOI={10.1007/3-540-12920-0_20}, booktitle={STACS 84}, author={Meyer auf der Heide, Friedhelm}, year={1984} }","apa":"Meyer auf der Heide, F. (1984). Efficient simulations among several models of parallel computers (extended abstract). In STACS 84. Berlin, Heidelberg. https://doi.org/10.1007/3-540-12920-0_20","ama":"Meyer auf der Heide F. Efficient simulations among several models of parallel computers (extended abstract). In: STACS 84. Berlin, Heidelberg; 1984. doi:10.1007/3-540-12920-0_20","chicago":"Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers (Extended Abstract).” In STACS 84. Berlin, Heidelberg, 1984. https://doi.org/10.1007/3-540-12920-0_20.","ieee":"F. Meyer auf der Heide, “Efficient simulations among several models of parallel computers (extended abstract),” in STACS 84, Berlin, Heidelberg, 1984.","short":"F. Meyer auf der Heide, in: STACS 84, Berlin, Heidelberg, 1984."},"year":"1984","language":[{"iso":"eng"}],"_id":"16787","date_updated":"2022-01-06T06:52:56Z","doi":"10.1007/3-540-12920-0_20"},{"user_id":"15415","title":"Efficiency of universal parallel computers","department":[{"_id":"63"}],"publication":"Acta Informatica","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"date_created":"2020-04-22T08:48:20Z","status":"public","publication_identifier":{"issn":["0001-5903","1432-0525"]},"publication_status":"published","_id":"16806","date_updated":"2022-01-06T06:52:56Z","doi":"10.1007/bf00265559","language":[{"iso":"eng"}],"page":"269-296","year":"1983","citation":{"ama":"Meyer auf der Heide F. Efficiency of universal parallel computers. Acta Informatica. 1983:269-296. doi:10.1007/bf00265559","apa":"Meyer auf der Heide, F. (1983). Efficiency of universal parallel computers. Acta Informatica, 269–296. https://doi.org/10.1007/bf00265559","chicago":"Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.” Acta Informatica, 1983, 269–96. https://doi.org/10.1007/bf00265559.","mla":"Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.” Acta Informatica, 1983, pp. 269–96, doi:10.1007/bf00265559.","bibtex":"@article{Meyer auf der Heide_1983, title={Efficiency of universal parallel computers}, DOI={10.1007/bf00265559}, journal={Acta Informatica}, author={Meyer auf der Heide, Friedhelm}, year={1983}, pages={269–296} }","short":"F. Meyer auf der Heide, Acta Informatica (1983) 269–296.","ieee":"F. Meyer auf der Heide, “Efficiency of universal parallel computers,” Acta Informatica, pp. 269–296, 1983."},"type":"journal_article"},{"title":"A lower time bound for the knapsack problem on random access machines","user_id":"15415","author":[{"first_name":"Peter","full_name":"Klein, Peter","last_name":"Klein"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publication":"Acta Informatica","department":[{"_id":"63"}],"publication_identifier":{"issn":["0001-5903","1432-0525"]},"publication_status":"published","status":"public","date_created":"2020-04-22T08:49:58Z","date_updated":"2022-01-06T06:52:56Z","_id":"16807","doi":"10.1007/bf00290735","citation":{"chicago":"Klein, Peter, and Friedhelm Meyer auf der Heide. “A Lower Time Bound for the Knapsack Problem on Random Access Machines.” Acta Informatica, 1983, 385–95. https://doi.org/10.1007/bf00290735.","apa":"Klein, P., & Meyer auf der Heide, F. (1983). A lower time bound for the knapsack problem on random access machines. Acta Informatica, 385–395. https://doi.org/10.1007/bf00290735","ama":"Klein P, Meyer auf der Heide F. A lower time bound for the knapsack problem on random access machines. Acta Informatica. 1983:385-395. doi:10.1007/bf00290735","bibtex":"@article{Klein_Meyer auf der Heide_1983, title={A lower time bound for the knapsack problem on random access machines}, DOI={10.1007/bf00290735}, journal={Acta Informatica}, author={Klein, Peter and Meyer auf der Heide, Friedhelm}, year={1983}, pages={385–395} }","mla":"Klein, Peter, and Friedhelm Meyer auf der Heide. “A Lower Time Bound for the Knapsack Problem on Random Access Machines.” Acta Informatica, 1983, pp. 385–95, doi:10.1007/bf00290735.","short":"P. Klein, F. Meyer auf der Heide, Acta Informatica (1983) 385–395.","ieee":"P. Klein and F. Meyer auf der Heide, “A lower time bound for the knapsack problem on random access machines,” Acta Informatica, pp. 385–395, 1983."},"year":"1983","type":"journal_article","page":"385-395","language":[{"iso":"eng"}]},{"date_updated":"2022-01-06T06:52:56Z","_id":"16808","doi":"10.1016/0020-0190(83)90001-7","language":[{"iso":"eng"}],"page":"1-2","citation":{"ieee":"F. Meyer auf der Heide, “Infinite cube-connected cycles,” Information Processing Letters, pp. 1–2, 1983.","short":"F. Meyer auf der Heide, Information Processing Letters (1983) 1–2.","mla":"Meyer auf der Heide, Friedhelm. “Infinite Cube-Connected Cycles.” Information Processing Letters, 1983, pp. 1–2, doi:10.1016/0020-0190(83)90001-7.","bibtex":"@article{Meyer auf der Heide_1983, title={Infinite cube-connected cycles}, DOI={10.1016/0020-0190(83)90001-7}, journal={Information Processing Letters}, author={Meyer auf der Heide, Friedhelm}, year={1983}, pages={1–2} }","apa":"Meyer auf der Heide, F. (1983). Infinite cube-connected cycles. Information Processing Letters, 1–2. https://doi.org/10.1016/0020-0190(83)90001-7","ama":"Meyer auf der Heide F. Infinite cube-connected cycles. Information Processing Letters. 1983:1-2. doi:10.1016/0020-0190(83)90001-7","chicago":"Meyer auf der Heide, Friedhelm. “Infinite Cube-Connected Cycles.” Information Processing Letters, 1983, 1–2. https://doi.org/10.1016/0020-0190(83)90001-7."},"year":"1983","type":"journal_article","user_id":"15415","title":"Infinite cube-connected cycles","publication":"Information Processing Letters","department":[{"_id":"63"}],"author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_created":"2020-04-22T08:51:01Z","status":"public","publication_identifier":{"issn":["0020-0190"]},"publication_status":"published"},{"title":"A polynomial linear search algorithm for the n-dimensional knapsack problem","user_id":"15415","publication_identifier":{"isbn":["0897910990"]},"publication_status":"published","status":"public","date_created":"2020-04-22T08:52:15Z","author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"department":[{"_id":"63"}],"publication":"Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83","doi":"10.1145/800061.808734","_id":"16809","date_updated":"2022-01-06T06:52:56Z","type":"conference","citation":{"short":"F. Meyer auf der Heide, in: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing - STOC ’83, 1983.","ieee":"F. Meyer auf der Heide, “A polynomial linear search algorithm for the n-dimensional knapsack problem,” in Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC ’83, 1983.","chicago":"Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack Problem.” In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing - STOC ’83, 1983. https://doi.org/10.1145/800061.808734.","ama":"Meyer auf der Heide F. A polynomial linear search algorithm for the n-dimensional knapsack problem. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing - STOC ’83. ; 1983. doi:10.1145/800061.808734","apa":"Meyer auf der Heide, F. (1983). A polynomial linear search algorithm for the n-dimensional knapsack problem. In Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC ’83. https://doi.org/10.1145/800061.808734","bibtex":"@inproceedings{Meyer auf der Heide_1983, title={A polynomial linear search algorithm for the n-dimensional knapsack problem}, DOI={10.1145/800061.808734}, booktitle={Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC ’83}, author={Meyer auf der Heide, Friedhelm}, year={1983} }","mla":"Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack Problem.” Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing - STOC ’83, 1983, doi:10.1145/800061.808734."},"year":"1983","language":[{"iso":"eng"}]},{"place":"Berlin/Heidelberg","title":"Efficiency of universal parallel computers","user_id":"15415","author":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"publication":"Lecture Notes in Computer Science","department":[{"_id":"63"}],"publication_status":"published","publication_identifier":{"isbn":["3540119736"]},"status":"public","date_created":"2020-04-22T08:53:33Z","date_updated":"2022-01-06T06:52:56Z","_id":"16810","doi":"10.1007/bfb0036483","year":"1983","citation":{"short":"F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1983.","ieee":"F. Meyer auf der Heide, “Efficiency of universal parallel computers,” in Lecture Notes in Computer Science, Berlin/Heidelberg, 1983.","ama":"Meyer auf der Heide F. Efficiency of universal parallel computers. In: Lecture Notes in Computer Science. Berlin/Heidelberg; 1983. doi:10.1007/bfb0036483","apa":"Meyer auf der Heide, F. (1983). Efficiency of universal parallel computers. In Lecture Notes in Computer Science. Berlin/Heidelberg. https://doi.org/10.1007/bfb0036483","chicago":"Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.” In Lecture Notes in Computer Science. Berlin/Heidelberg, 1983. https://doi.org/10.1007/bfb0036483.","bibtex":"@inbook{Meyer auf der Heide_1983, place={Berlin/Heidelberg}, title={Efficiency of universal parallel computers}, DOI={10.1007/bfb0036483}, booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1983} }","mla":"Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.” Lecture Notes in Computer Science, 1983, doi:10.1007/bfb0036483."},"type":"book_chapter","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"citation":{"short":"F. Meyer auf der Heide, A. Rollik, in: Fundamentals of Computation Theory, Berlin, Heidelberg, 1981.","ieee":"F. Meyer auf der Heide and A. Rollik, “Random access machines and straight-line programs,” in Fundamentals of Computation Theory, Berlin, Heidelberg, 1981.","chicago":"Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines and Straight-Line Programs.” In Fundamentals of Computation Theory. Berlin, Heidelberg, 1981. https://doi.org/10.1007/3-540-10854-8_29.","ama":"Meyer auf der Heide F, Rollik A. Random access machines and straight-line programs. In: Fundamentals of Computation Theory. Berlin, Heidelberg; 1981. doi:10.1007/3-540-10854-8_29","apa":"Meyer auf der Heide, F., & Rollik, A. (1981). Random access machines and straight-line programs. In Fundamentals of Computation Theory. Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_29","bibtex":"@inbook{Meyer auf der Heide_Rollik_1981, place={Berlin, Heidelberg}, title={Random access machines and straight-line programs}, DOI={10.1007/3-540-10854-8_29}, booktitle={Fundamentals of Computation Theory}, author={Meyer auf der Heide, Friedhelm and Rollik, Anton}, year={1981} }","mla":"Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines and Straight-Line Programs.” Fundamentals of Computation Theory, 1981, doi:10.1007/3-540-10854-8_29."},"type":"book_chapter","year":"1981","doi":"10.1007/3-540-10854-8_29","date_updated":"2022-01-06T06:52:56Z","_id":"16813","date_created":"2020-04-22T09:03:21Z","status":"public","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540108542","9783540387657"]},"publication_status":"published","department":[{"_id":"63"}],"publication":"Fundamentals of Computation Theory","author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Rollik","full_name":"Rollik, Anton","first_name":"Anton"}],"user_id":"15415","title":"Random access machines and straight-line programs","place":"Berlin, Heidelberg"},{"title":"Time-processor trade-offs for universal parallel computers","user_id":"15415","place":"Berlin, Heidelberg","publication_identifier":{"isbn":["9783540108566","9783540387695"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","date_created":"2020-04-22T09:05:15Z","status":"public","department":[{"_id":"63"}],"publication":"Lecture Notes in Computer Science","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"doi":"10.1007/3-540-10856-4_111","date_updated":"2022-01-06T06:52:56Z","_id":"16814","type":"book_chapter","year":"1981","citation":{"short":"F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1981.","ieee":"F. Meyer auf der Heide, “Time-processor trade-offs for universal parallel computers,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1981.","apa":"Meyer auf der Heide, F. (1981). Time-processor trade-offs for universal parallel computers. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_111","ama":"Meyer auf der Heide F. Time-processor trade-offs for universal parallel computers. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1981. doi:10.1007/3-540-10856-4_111","chicago":"Meyer auf der Heide, Friedhelm. “Time-Processor Trade-Offs for Universal Parallel Computers.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 1981. https://doi.org/10.1007/3-540-10856-4_111.","mla":"Meyer auf der Heide, Friedhelm. “Time-Processor Trade-Offs for Universal Parallel Computers.” Lecture Notes in Computer Science, 1981, doi:10.1007/3-540-10856-4_111.","bibtex":"@inbook{Meyer auf der Heide_1981, place={Berlin, Heidelberg}, title={Time-processor trade-offs for universal parallel computers}, DOI={10.1007/3-540-10856-4_111}, booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1981} }"},"language":[{"iso":"eng"}]},{"author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publication":"Theoretical Computer Science","department":[{"_id":"63"}],"publication_status":"published","publication_identifier":{"issn":["0304-3975"]},"status":"public","date_created":"2020-04-22T09:33:31Z","title":"A comparison of two variations of a pebble game on graphs","user_id":"15415","type":"journal_article","citation":{"mla":"Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.” Theoretical Computer Science, 1981, pp. 315–22, doi:10.1016/s0304-3975(81)80004-7.","bibtex":"@article{Meyer auf der Heide_1981, title={A comparison of two variations of a pebble game on graphs}, DOI={10.1016/s0304-3975(81)80004-7}, journal={Theoretical Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1981}, pages={315–322} }","chicago":"Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.” Theoretical Computer Science, 1981, 315–22. https://doi.org/10.1016/s0304-3975(81)80004-7.","apa":"Meyer auf der Heide, F. (1981). A comparison of two variations of a pebble game on graphs. Theoretical Computer Science, 315–322. https://doi.org/10.1016/s0304-3975(81)80004-7","ama":"Meyer auf der Heide F. A comparison of two variations of a pebble game on graphs. Theoretical Computer Science. 1981:315-322. doi:10.1016/s0304-3975(81)80004-7","ieee":"F. Meyer auf der Heide, “A comparison of two variations of a pebble game on graphs,” Theoretical Computer Science, pp. 315–322, 1981.","short":"F. Meyer auf der Heide, Theoretical Computer Science (1981) 315–322."},"year":"1981","page":"315-322","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:56Z","_id":"16820","doi":"10.1016/s0304-3975(81)80004-7"},{"publication_identifier":{"issn":["0343-3005"],"isbn":["9783540103882","9783642678387"]},"publication_status":"published","status":"public","date_created":"2020-04-22T09:06:48Z","author":[{"first_name":"P.","full_name":"Klein, P.","last_name":"Klein"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"department":[{"_id":"63"}],"publication":"GI - 10. Jahrestagung","title":"Untere Zeitschranken für das Rucksack-Problem","user_id":"15415","place":"Berlin, Heidelberg","year":"1980","type":"book_chapter","citation":{"ieee":"P. Klein and F. Meyer auf der Heide, “Untere Zeitschranken für das Rucksack-Problem,” in GI - 10. Jahrestagung, Berlin, Heidelberg, 1980.","short":"P. Klein, F. Meyer auf der Heide, in: GI - 10. Jahrestagung, Berlin, Heidelberg, 1980.","mla":"Klein, P., and Friedhelm Meyer auf der Heide. “Untere Zeitschranken Für Das Rucksack-Problem.” GI - 10. Jahrestagung, 1980, doi:10.1007/978-3-642-67838-7_34.","bibtex":"@inbook{Klein_Meyer auf der Heide_1980, place={Berlin, Heidelberg}, title={Untere Zeitschranken für das Rucksack-Problem}, DOI={10.1007/978-3-642-67838-7_34}, booktitle={GI - 10. Jahrestagung}, author={Klein, P. and Meyer auf der Heide, Friedhelm}, year={1980} }","ama":"Klein P, Meyer auf der Heide F. Untere Zeitschranken für das Rucksack-Problem. In: GI - 10. Jahrestagung. Berlin, Heidelberg; 1980. doi:10.1007/978-3-642-67838-7_34","apa":"Klein, P., & Meyer auf der Heide, F. (1980). Untere Zeitschranken für das Rucksack-Problem. In GI - 10. Jahrestagung. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-67838-7_34","chicago":"Klein, P., and Friedhelm Meyer auf der Heide. “Untere Zeitschranken Für Das Rucksack-Problem.” In GI - 10. Jahrestagung. Berlin, Heidelberg, 1980. https://doi.org/10.1007/978-3-642-67838-7_34."},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-67838-7_34","date_updated":"2022-01-06T06:52:56Z","_id":"16815"},{"user_id":"15415","title":"A comparison of two variations of a pebble game on graphs","publication":"Automata, Languages and Programming. ICALP 1979","department":[{"_id":"63"}],"author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"date_created":"2020-04-22T09:02:08Z","status":"public","publication_status":"published","_id":"16812","date_updated":"2022-01-06T06:52:56Z","doi":"10.1007/3-540-09510-1_32 ","language":[{"iso":"eng"}],"page":"411-421","citation":{"bibtex":"@article{Meyer auf der Heide_1979, title={A comparison of two variations of a pebble game on graphs}, DOI={10.1007/3-540-09510-1_32 }, journal={Automata, Languages and Programming. ICALP 1979}, author={Meyer auf der Heide, Friedhelm}, year={1979}, pages={411–421} }","mla":"Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.” Automata, Languages and Programming. ICALP 1979, 1979, pp. 411–21, doi:10.1007/3-540-09510-1_32 .","ama":"Meyer auf der Heide F. A comparison of two variations of a pebble game on graphs. Automata, Languages and Programming ICALP 1979. 1979:411-421. doi:10.1007/3-540-09510-1_32 ","apa":"Meyer auf der Heide, F. (1979). A comparison of two variations of a pebble game on graphs. Automata, Languages and Programming. ICALP 1979, 411–421. https://doi.org/10.1007/3-540-09510-1_32 ","chicago":"Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.” Automata, Languages and Programming. ICALP 1979, 1979, 411–21. https://doi.org/10.1007/3-540-09510-1_32 .","ieee":"F. Meyer auf der Heide, “A comparison of two variations of a pebble game on graphs,” Automata, Languages and Programming. ICALP 1979, pp. 411–421, 1979.","short":"F. Meyer auf der Heide, Automata, Languages and Programming. ICALP 1979 (1979) 411–421."},"type":"journal_article","year":"1979"}]