[{"citation":{"short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995.","chicago":"Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.” In <i>Proceedings Third Israel Symposium on the Theory of Computing and Systems</i>, 1995. <a href=\"https://doi.org/10.1109/istcs.1995.377051\">https://doi.org/10.1109/istcs.1995.377051</a>.","apa":"Czumaj, A., Meyer auf der Heide, F., &#38; Stemann, V. (1995). Improved optimal shared memory simulations, and the power of reconfiguration. <i>Proceedings Third Israel Symposium on the Theory of Computing and Systems</i>. <a href=\"https://doi.org/10.1109/istcs.1995.377051\">https://doi.org/10.1109/istcs.1995.377051</a>","ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Improved optimal shared memory simulations, and the power of reconfiguration,” 1995, doi: <a href=\"https://doi.org/10.1109/istcs.1995.377051\">10.1109/istcs.1995.377051</a>.","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. Improved optimal shared memory simulations, and the power of reconfiguration. In: <i>Proceedings Third Israel Symposium on the Theory of Computing and Systems</i>. ; 1995. doi:<a href=\"https://doi.org/10.1109/istcs.1995.377051\">10.1109/istcs.1995.377051</a>","bibtex":"@inproceedings{Czumaj_Meyer auf der Heide_Stemann_1995, title={Improved optimal shared memory simulations, and the power of reconfiguration}, DOI={<a href=\"https://doi.org/10.1109/istcs.1995.377051\">10.1109/istcs.1995.377051</a>}, booktitle={Proceedings Third Israel Symposium on the Theory of Computing and Systems}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1995} }","mla":"Czumaj, Artur, et al. “Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.” <i>Proceedings Third Israel Symposium on the Theory of Computing and Systems</i>, 1995, doi:<a href=\"https://doi.org/10.1109/istcs.1995.377051\">10.1109/istcs.1995.377051</a>."},"publication":"Proceedings Third Israel Symposium on the Theory of Computing and Systems","date_created":"2020-04-16T13:49:13Z","department":[{"_id":"63"}],"type":"conference","publication_identifier":{"isbn":["0818669152"]},"author":[{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"last_name":"Stemann","first_name":"Volker","full_name":"Stemann, Volker"}],"title":"Improved optimal shared memory simulations, and the power of reconfiguration","status":"public","year":"1995","date_updated":"2022-01-06T06:52:54Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"16707","doi":"10.1109/istcs.1995.377051","user_id":"15415"},{"author":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Westermann, Matthias","first_name":"Matthias","last_name":"Westermann"}],"publication_identifier":{"isbn":["9783540606185","9783540484875"],"issn":["0302-9743","1611-3349"]},"status":"public","title":"Hot-potato routing on multi-dimensional tori","year":"1995","publication_status":"published","date_updated":"2022-01-06T06:52:55Z","_id":"16717","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1007/3-540-60618-1_77","citation":{"chicago":"Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.” In <i>Graph-Theoretic Concepts in Computer Science</i>. Berlin, Heidelberg, 1995. <a href=\"https://doi.org/10.1007/3-540-60618-1_77\">https://doi.org/10.1007/3-540-60618-1_77</a>.","short":"F. Meyer auf der Heide, M. Westermann, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 1995.","apa":"Meyer auf der Heide, F., &#38; Westermann, M. (1995). Hot-potato routing on multi-dimensional tori. In <i>Graph-Theoretic Concepts in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-60618-1_77\">https://doi.org/10.1007/3-540-60618-1_77</a>","ieee":"F. Meyer auf der Heide and M. Westermann, “Hot-potato routing on multi-dimensional tori,” in <i>Graph-Theoretic Concepts in Computer Science</i>, Berlin, Heidelberg, 1995.","ama":"Meyer auf der Heide F, Westermann M. Hot-potato routing on multi-dimensional tori. In: <i>Graph-Theoretic Concepts in Computer Science</i>. Berlin, Heidelberg; 1995. doi:<a href=\"https://doi.org/10.1007/3-540-60618-1_77\">10.1007/3-540-60618-1_77</a>","bibtex":"@inbook{Meyer auf der Heide_Westermann_1995, place={Berlin, Heidelberg}, title={Hot-potato routing on multi-dimensional tori}, DOI={<a href=\"https://doi.org/10.1007/3-540-60618-1_77\">10.1007/3-540-60618-1_77</a>}, booktitle={Graph-Theoretic Concepts in Computer Science}, author={Meyer auf der Heide, Friedhelm and Westermann, Matthias}, year={1995} }","mla":"Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.” <i>Graph-Theoretic Concepts in Computer Science</i>, 1995, doi:<a href=\"https://doi.org/10.1007/3-540-60618-1_77\">10.1007/3-540-60618-1_77</a>."},"publication":"Graph-Theoretic Concepts in Computer Science","date_created":"2020-04-17T07:46:18Z","place":"Berlin, Heidelberg","department":[{"_id":"63"}],"type":"book_chapter"},{"citation":{"short":"A. Bäumker, W. Dittrich, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.","chicago":"Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 1995. <a href=\"https://doi.org/10.1007/3-540-60313-1_131\">https://doi.org/10.1007/3-540-60313-1_131</a>.","ieee":"A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1995.","apa":"Bäumker, A., Dittrich, W., &#38; Meyer auf der Heide, F. (1995). Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-60313-1_131\">https://doi.org/10.1007/3-540-60313-1_131</a>","bibtex":"@inbook{Bäumker_Dittrich_Meyer auf der Heide_1995, place={Berlin, Heidelberg}, title={Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model}, DOI={<a href=\"https://doi.org/10.1007/3-540-60313-1_131\">10.1007/3-540-60313-1_131</a>}, booktitle={Lecture Notes in Computer Science}, author={Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm}, year={1995} }","ama":"Bäumker A, Dittrich W, Meyer auf der Heide F. Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1995. doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_131\">10.1007/3-540-60313-1_131</a>","mla":"Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.” <i>Lecture Notes in Computer Science</i>, 1995, doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_131\">10.1007/3-540-60313-1_131</a>."},"publication":"Lecture Notes in Computer Science","department":[{"_id":"63"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_created":"2020-04-27T13:59:05Z","date_updated":"2022-01-06T06:52:58Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540603139","9783540449133"]},"author":[{"last_name":"Bäumker","first_name":"Armin","full_name":"Bäumker, Armin"},{"full_name":"Dittrich, Wolfgang","first_name":"Wolfgang","last_name":"Dittrich"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"title":"Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model","status":"public","year":"1995","doi":"10.1007/3-540-60313-1_131","user_id":"15415","_id":"16874","language":[{"iso":"eng"}]},{"date_updated":"2022-01-06T06:54:09Z","has_accepted_license":"1","title":"Paralleles Sortieren auf mehrdimensionalen Gittern","status":"public","year":"1994","author":[{"full_name":"Wanka, Rolf","first_name":"Rolf","last_name":"Wanka"}],"user_id":"15415","ddc":["000"],"language":[{"iso":"eng"}],"_id":"19624","file_date_updated":"2020-09-22T12:32:33Z","citation":{"chicago":"Wanka, Rolf. <i>Paralleles Sortieren Auf Mehrdimensionalen Gittern</i>. Universität Paderborn, 1994.","short":"R. Wanka, Paralleles Sortieren Auf Mehrdimensionalen Gittern, Universität Paderborn, 1994.","ieee":"R. Wanka, <i>Paralleles Sortieren auf mehrdimensionalen Gittern</i>. Universität Paderborn, 1994.","apa":"Wanka, R. (1994). <i>Paralleles Sortieren auf mehrdimensionalen Gittern</i>. Universität Paderborn.","bibtex":"@book{Wanka_1994, place={Universität Paderborn}, title={Paralleles Sortieren auf mehrdimensionalen Gittern}, author={Wanka, Rolf}, year={1994} }","ama":"Wanka R. <i>Paralleles Sortieren Auf Mehrdimensionalen Gittern</i>. Universität Paderborn; 1994.","mla":"Wanka, Rolf. <i>Paralleles Sortieren Auf Mehrdimensionalen Gittern</i>. 1994."},"supervisor":[{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"type":"dissertation","department":[{"_id":"63"}],"file":[{"file_size":967735,"access_level":"closed","file_name":"pub-hni-9686.pdf","date_updated":"2020-09-22T12:32:33Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"19625","creator":"koala","date_created":"2020-09-22T12:32:33Z"}],"date_created":"2020-09-22T12:32:48Z","place":"Universität Paderborn"},{"page":"738-761","language":[{"iso":"eng"}],"_id":"16728","doi":"10.1137/s0097539791194094","user_id":"15415","status":"public","title":"Dynamic Perfect Hashing: Upper and Lower Bounds","year":"1994","author":[{"first_name":"Martin","last_name":"Dietzfelbinger","full_name":"Dietzfelbinger, Martin"},{"full_name":"Karlin, Anna","last_name":"Karlin","first_name":"Anna"},{"full_name":"Mehlhorn, Kurt","last_name":"Mehlhorn","first_name":"Kurt"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Rohnert","first_name":"Hans","full_name":"Rohnert, Hans"},{"full_name":"Tarjan, Robert E.","last_name":"Tarjan","first_name":"Robert E."}],"publication_identifier":{"issn":["0097-5397","1095-7111"]},"date_updated":"2022-01-06T06:52:55Z","publication_status":"published","date_created":"2020-04-20T10:19:33Z","type":"journal_article","department":[{"_id":"63"}],"publication":"SIAM Journal on Computing","citation":{"ama":"Dietzfelbinger M, Karlin A, Mehlhorn K, Meyer auf der Heide F, Rohnert H, Tarjan RE. Dynamic Perfect Hashing: Upper and Lower Bounds. <i>SIAM Journal on Computing</i>. 1994:738-761. doi:<a href=\"https://doi.org/10.1137/s0097539791194094\">10.1137/s0097539791194094</a>","bibtex":"@article{Dietzfelbinger_Karlin_Mehlhorn_Meyer auf der Heide_Rohnert_Tarjan_1994, title={Dynamic Perfect Hashing: Upper and Lower Bounds}, DOI={<a href=\"https://doi.org/10.1137/s0097539791194094\">10.1137/s0097539791194094</a>}, journal={SIAM Journal on Computing}, author={Dietzfelbinger, Martin and Karlin, Anna and Mehlhorn, Kurt and Meyer auf der Heide, Friedhelm and Rohnert, Hans and Tarjan, Robert E.}, year={1994}, pages={738–761} }","mla":"Dietzfelbinger, Martin, et al. “Dynamic Perfect Hashing: Upper and Lower Bounds.” <i>SIAM Journal on Computing</i>, 1994, pp. 738–61, doi:<a href=\"https://doi.org/10.1137/s0097539791194094\">10.1137/s0097539791194094</a>.","short":"M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, R.E. Tarjan, SIAM Journal on Computing (1994) 738–761.","chicago":"Dietzfelbinger, Martin, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, and Robert E. Tarjan. “Dynamic Perfect Hashing: Upper and Lower Bounds.” <i>SIAM Journal on Computing</i>, 1994, 738–61. <a href=\"https://doi.org/10.1137/s0097539791194094\">https://doi.org/10.1137/s0097539791194094</a>.","apa":"Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., &#38; Tarjan, R. E. (1994). Dynamic Perfect Hashing: Upper and Lower Bounds. <i>SIAM Journal on Computing</i>, 738–761. <a href=\"https://doi.org/10.1137/s0097539791194094\">https://doi.org/10.1137/s0097539791194094</a>","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,” <i>SIAM Journal on Computing</i>, pp. 738–761, 1994."}},{"language":[{"iso":"eng"}],"_id":"17477","publisher":"Springer","editor":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Monien, B.","last_name":"Monien","first_name":"B."},{"first_name":"A. L.","last_name":"Rosenberg","full_name":"Rosenberg, A. L."}],"doi":"10.1007/3-540-56731-3","user_id":"15415","publication_identifier":{"isbn":["9783540567318","9783540476375"],"issn":["0302-9743","1611-3349"]},"year":"1993","status":"public","title":"Parallel Architectures and Their Efficient Use","date_updated":"2022-01-06T06:53:12Z","publication_status":"published","place":"Berlin, Heidelberg","date_created":"2020-07-30T09:49:20Z","department":[{"_id":"63"}],"type":"book_editor","citation":{"ama":"Meyer auf der Heide F, Monien B, Rosenberg AL, eds. <i>Parallel Architectures and Their Efficient Use</i>. Berlin, Heidelberg: Springer; 1993. doi:<a href=\"https://doi.org/10.1007/3-540-56731-3\">10.1007/3-540-56731-3</a>","bibtex":"@book{Meyer auf der Heide_Monien_Rosenberg_1993, place={Berlin, Heidelberg}, title={Parallel Architectures and Their Efficient Use}, DOI={<a href=\"https://doi.org/10.1007/3-540-56731-3\">10.1007/3-540-56731-3</a>}, publisher={Springer}, year={1993} }","mla":"Meyer auf der Heide, Friedhelm, et al., editors. <i>Parallel Architectures and Their Efficient Use</i>. Springer, 1993, doi:<a href=\"https://doi.org/10.1007/3-540-56731-3\">10.1007/3-540-56731-3</a>.","chicago":"Meyer auf der Heide, Friedhelm, B. Monien, and A. L. Rosenberg, eds. <i>Parallel Architectures and Their Efficient Use</i>. Berlin, Heidelberg: Springer, 1993. <a href=\"https://doi.org/10.1007/3-540-56731-3\">https://doi.org/10.1007/3-540-56731-3</a>.","short":"F. Meyer auf der Heide, B. Monien, A.L. Rosenberg, eds., Parallel Architectures and Their Efficient Use, Springer, Berlin, Heidelberg, 1993.","apa":"Meyer auf der Heide, F., Monien, B., &#38; Rosenberg, A. L. (Eds.). (1993). <i>Parallel Architectures and Their Efficient Use</i>. Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/3-540-56731-3\">https://doi.org/10.1007/3-540-56731-3</a>","ieee":"F. Meyer auf der Heide, B. Monien, and A. L. Rosenberg, Eds., <i>Parallel Architectures and Their Efficient Use</i>. Berlin, Heidelberg: Springer, 1993."}},{"page":"50-55","_id":"17479","language":[{"iso":"eng"}],"user_id":"15415","title":"OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report)","year":"1993","status":"public","author":[{"last_name":"Kastens","first_name":"Uwe","full_name":"Kastens, Uwe"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Wachsmann, Alf","first_name":"Alf","last_name":"Wachsmann"},{"last_name":"Wichmann","first_name":"Friedrich","full_name":"Wichmann, Friedrich"}],"date_updated":"2022-01-06T06:53:12Z","date_created":"2020-07-30T10:54:52Z","type":"conference","department":[{"_id":"63"}],"publication":"Proc. 3rd PASA Workshop, PARS Mitteilungen","citation":{"mla":"Kastens, Uwe, et al. “OCCAM-Light: A Language Combining Shared Memory and Message Passing (A First Report).” <i>Proc. 3rd PASA Workshop, PARS Mitteilungen</i>, 1993, pp. 50–55.","ama":"Kastens U, Meyer auf der Heide F, Wachsmann A, Wichmann F. OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report). In: <i>Proc. 3rd PASA Workshop, PARS Mitteilungen</i>. ; 1993:50-55.","bibtex":"@inproceedings{Kastens_Meyer auf der Heide_Wachsmann_Wichmann_1993, title={OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report)}, booktitle={Proc. 3rd PASA Workshop, PARS Mitteilungen}, author={Kastens, Uwe and Meyer auf der Heide, Friedhelm and Wachsmann, Alf and Wichmann, Friedrich}, year={1993}, pages={50–55} }","apa":"Kastens, U., Meyer auf der Heide, F., Wachsmann, A., &#38; Wichmann, F. (1993). OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report). In <i>Proc. 3rd PASA Workshop, PARS Mitteilungen</i> (pp. 50–55).","ieee":"U. Kastens, F. Meyer auf der Heide, A. Wachsmann, and F. Wichmann, “OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report),” in <i>Proc. 3rd PASA Workshop, PARS Mitteilungen</i>, 1993, pp. 50–55.","chicago":"Kastens, Uwe, Friedhelm Meyer auf der Heide, Alf Wachsmann, and Friedrich Wichmann. “OCCAM-Light: A Language Combining Shared Memory and Message Passing (A First Report).” In <i>Proc. 3rd PASA Workshop, PARS Mitteilungen</i>, 50–55, 1993.","short":"U. Kastens, F. Meyer auf der Heide, A. Wachsmann, F. Wichmann, in: Proc. 3rd PASA Workshop, PARS Mitteilungen, 1993, pp. 50–55."}},{"doi":"10.1006/inco.1993.1007","user_id":"15415","page":"196-217","language":[{"iso":"eng"}],"_id":"16729","date_updated":"2022-01-06T06:52:55Z","publication_status":"published","year":"1993","title":"An Optimal Parallel Dictionary","status":"public","publication_identifier":{"issn":["0890-5401"]},"author":[{"full_name":"Dietzfelbinger, M.","last_name":"Dietzfelbinger","first_name":"M."},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"type":"journal_article","department":[{"_id":"63"}],"date_created":"2020-04-20T10:31:51Z","publication":"Information and Computation","citation":{"mla":"Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.” <i>Information and Computation</i>, 1993, pp. 196–217, doi:<a href=\"https://doi.org/10.1006/inco.1993.1007\">10.1006/inco.1993.1007</a>.","ama":"Dietzfelbinger M, Meyer auf der Heide F. An Optimal Parallel Dictionary. <i>Information and Computation</i>. 1993:196-217. doi:<a href=\"https://doi.org/10.1006/inco.1993.1007\">10.1006/inco.1993.1007</a>","bibtex":"@article{Dietzfelbinger_Meyer auf der Heide_1993, title={An Optimal Parallel Dictionary}, DOI={<a href=\"https://doi.org/10.1006/inco.1993.1007\">10.1006/inco.1993.1007</a>}, journal={Information and Computation}, author={Dietzfelbinger, M. and Meyer auf der Heide, Friedhelm}, year={1993}, pages={196–217} }","apa":"Dietzfelbinger, M., &#38; Meyer auf der Heide, F. (1993). An Optimal Parallel Dictionary. <i>Information and Computation</i>, 196–217. <a href=\"https://doi.org/10.1006/inco.1993.1007\">https://doi.org/10.1006/inco.1993.1007</a>","ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “An Optimal Parallel Dictionary,” <i>Information and Computation</i>, pp. 196–217, 1993.","chicago":"Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.” <i>Information and Computation</i>, 1993, 196–217. <a href=\"https://doi.org/10.1006/inco.1993.1007\">https://doi.org/10.1006/inco.1993.1007</a>.","short":"M. Dietzfelbinger, F. Meyer auf der Heide, Information and Computation (1993) 196–217."}},{"publication":"Automata, Languages and Programming","citation":{"mla":"Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.” <i>Automata, Languages and Programming</i>, 1993, doi:<a href=\"https://doi.org/10.1007/3-540-56939-1_89\">10.1007/3-540-56939-1_89</a>.","ama":"Meyer auf der Heide F, Oesterdiekhoff B, Wanka R. Strongly adaptive token distribution. In: <i>Automata, Languages and Programming</i>. Berlin, Heidelberg; 1993. doi:<a href=\"https://doi.org/10.1007/3-540-56939-1_89\">10.1007/3-540-56939-1_89</a>","bibtex":"@inbook{Meyer auf der Heide_Oesterdiekhoff_Wanka_1993, place={Berlin, Heidelberg}, title={Strongly adaptive token distribution}, DOI={<a href=\"https://doi.org/10.1007/3-540-56939-1_89\">10.1007/3-540-56939-1_89</a>}, booktitle={Automata, Languages and Programming}, author={Meyer auf der Heide, Friedhelm and Oesterdiekhoff, Brigitte and Wanka, Rolf}, year={1993} }","apa":"Meyer auf der Heide, F., Oesterdiekhoff, B., &#38; Wanka, R. (1993). Strongly adaptive token distribution. In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-56939-1_89\">https://doi.org/10.1007/3-540-56939-1_89</a>","ieee":"F. Meyer auf der Heide, B. Oesterdiekhoff, and R. Wanka, “Strongly adaptive token distribution,” in <i>Automata, Languages and Programming</i>, Berlin, Heidelberg, 1993.","short":"F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, in: Automata, Languages and Programming, Berlin, Heidelberg, 1993.","chicago":"Meyer auf der Heide, Friedhelm, Brigitte Oesterdiekhoff, and Rolf Wanka. “Strongly Adaptive Token Distribution.” In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg, 1993. <a href=\"https://doi.org/10.1007/3-540-56939-1_89\">https://doi.org/10.1007/3-540-56939-1_89</a>."},"date_created":"2020-04-20T10:33:56Z","place":"Berlin, Heidelberg","type":"book_chapter","department":[{"_id":"63"}],"status":"public","year":"1993","title":"Strongly adaptive token distribution","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540569398","9783540478263"]},"author":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Oesterdiekhoff","first_name":"Brigitte","full_name":"Oesterdiekhoff, Brigitte"},{"full_name":"Wanka, Rolf","last_name":"Wanka","first_name":"Rolf"}],"publication_status":"published","date_updated":"2022-01-06T06:52:55Z","language":[{"iso":"eng"}],"_id":"16730","user_id":"15415","doi":"10.1007/3-540-56939-1_89"},{"publication_status":"published","date_updated":"2022-01-06T06:52:55Z","author":[{"first_name":"Martin","last_name":"Dietzfelbinger","full_name":"Dietzfelbinger, Martin"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"publication_identifier":{"isbn":["0897915992"]},"year":"1993","status":"public","title":"Simple, efficient shared memory simulations","user_id":"15415","doi":"10.1145/165231.165246","language":[{"iso":"eng"}],"_id":"16731","citation":{"bibtex":"@inproceedings{Dietzfelbinger_Meyer auf der Heide_1993, title={Simple, efficient shared memory simulations}, DOI={<a href=\"https://doi.org/10.1145/165231.165246\">10.1145/165231.165246</a>}, booktitle={Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’93}, author={Dietzfelbinger, Martin and Meyer auf der Heide, Friedhelm}, year={1993} }","ama":"Dietzfelbinger M, Meyer auf der Heide F. Simple, efficient shared memory simulations. In: <i>Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’93</i>. ; 1993. doi:<a href=\"https://doi.org/10.1145/165231.165246\">10.1145/165231.165246</a>","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’93, 1993.","chicago":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Simple, Efficient Shared Memory Simulations.” In <i>Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’93</i>, 1993. <a href=\"https://doi.org/10.1145/165231.165246\">https://doi.org/10.1145/165231.165246</a>.","ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “Simple, efficient shared memory simulations,” in <i>Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’93</i>, 1993.","apa":"Dietzfelbinger, M., &#38; Meyer auf der Heide, F. (1993). Simple, efficient shared memory simulations. In <i>Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’93</i>. <a href=\"https://doi.org/10.1145/165231.165246\">https://doi.org/10.1145/165231.165246</a>","mla":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Simple, Efficient Shared Memory Simulations.” <i>Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’93</i>, 1993, doi:<a href=\"https://doi.org/10.1145/165231.165246\">10.1145/165231.165246</a>."},"publication":"Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures  - SPAA '93","department":[{"_id":"63"}],"type":"conference","date_created":"2020-04-20T10:35:49Z"},{"place":"Berlin, Heidelberg","date_created":"2020-04-20T11:25:51Z","type":"book_chapter","department":[{"_id":"63"}],"publication":"Lecture Notes in Computer Science","citation":{"bibtex":"@inbook{Lürwer-Brüggemeier_Meyer auf der Heide_1993, place={Berlin, Heidelberg}, title={Capabilities and complexity of computations with integer division}, DOI={<a href=\"https://doi.org/10.1007/3-540-56503-5_46\">10.1007/3-540-56503-5_46</a>}, booktitle={Lecture Notes in Computer Science}, author={Lürwer-Brüggemeier, Katharina and Meyer auf der Heide, Friedhelm}, year={1993} }","chicago":"Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities and Complexity of Computations with Integer Division.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 1993. <a href=\"https://doi.org/10.1007/3-540-56503-5_46\">https://doi.org/10.1007/3-540-56503-5_46</a>.","ama":"Lürwer-Brüggemeier K, Meyer auf der Heide F. Capabilities and complexity of computations with integer division. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1993. doi:<a href=\"https://doi.org/10.1007/3-540-56503-5_46\">10.1007/3-540-56503-5_46</a>","short":"K. Lürwer-Brüggemeier, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1993.","ieee":"K. Lürwer-Brüggemeier and F. Meyer auf der Heide, “Capabilities and complexity of computations with integer division,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1993.","apa":"Lürwer-Brüggemeier, K., &#38; Meyer auf der Heide, F. (1993). Capabilities and complexity of computations with integer division. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-56503-5_46\">https://doi.org/10.1007/3-540-56503-5_46</a>","mla":"Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities and Complexity of Computations with Integer Division.” <i>Lecture Notes in Computer Science</i>, 1993, doi:<a href=\"https://doi.org/10.1007/3-540-56503-5_46\">10.1007/3-540-56503-5_46</a>."},"_id":"16732","language":[{"iso":"eng"}],"doi":"10.1007/3-540-56503-5_46","user_id":"15415","status":"public","year":"1993","title":"Capabilities and complexity of computations with integer division","publication_identifier":{"isbn":["9783540565031","9783540475743"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Lürwer-Brüggemeier, Katharina","first_name":"Katharina","last_name":"Lürwer-Brüggemeier"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_updated":"2022-01-06T06:52:55Z","publication_status":"published"},{"date_updated":"2022-01-06T06:53:55Z","publication_status":"published","year":"1992","status":"public","title":"Periodic Sorting on Two-Dimensional Meshes","author":[{"full_name":"Kutylowski, Miroslaw","last_name":"Kutylowski","first_name":"Miroslaw"},{"full_name":"Wanka, Rolf","first_name":"Rolf","last_name":"Wanka"}],"publication_identifier":{"issn":["0129-6264","1793-642X"]},"doi":"10.1142/s0129626492000349","user_id":"15415","page":"213-220","language":[{"iso":"eng"}],"_id":"18936","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"}],"publication":"Parallel Processing Letters 2","citation":{"ama":"Kutylowski M, Wanka R. Periodic Sorting on Two-Dimensional Meshes. <i>Parallel Processing Letters 2</i>. Published online 1992:213-220. doi:<a href=\"https://doi.org/10.1142/s0129626492000349\">10.1142/s0129626492000349</a>","bibtex":"@article{Kutylowski_Wanka_1992, title={Periodic Sorting on Two-Dimensional Meshes}, DOI={<a href=\"https://doi.org/10.1142/s0129626492000349\">10.1142/s0129626492000349</a>}, journal={Parallel Processing Letters 2}, author={Kutylowski, Miroslaw and Wanka, Rolf}, year={1992}, pages={213–220} }","mla":"Kutylowski, Miroslaw, and Rolf Wanka. “Periodic Sorting on Two-Dimensional Meshes.” <i>Parallel Processing Letters 2</i>, 1992, pp. 213–20, doi:<a href=\"https://doi.org/10.1142/s0129626492000349\">10.1142/s0129626492000349</a>.","short":"M. Kutylowski, R. Wanka, Parallel Processing Letters 2 (1992) 213–220.","chicago":"Kutylowski, Miroslaw, and Rolf Wanka. “Periodic Sorting on Two-Dimensional Meshes.” <i>Parallel Processing Letters 2</i>, 1992, 213–20. <a href=\"https://doi.org/10.1142/s0129626492000349\">https://doi.org/10.1142/s0129626492000349</a>.","apa":"Kutylowski, M., &#38; Wanka, R. (1992). Periodic Sorting on Two-Dimensional Meshes. <i>Parallel Processing Letters 2</i>, 213–220. <a href=\"https://doi.org/10.1142/s0129626492000349\">https://doi.org/10.1142/s0129626492000349</a>","ieee":"M. Kutylowski and R. Wanka, “Periodic Sorting on Two-Dimensional Meshes,” <i>Parallel Processing Letters 2</i>, pp. 213–220, 1992, doi: <a href=\"https://doi.org/10.1142/s0129626492000349\">10.1142/s0129626492000349</a>."},"type":"journal_article","department":[{"_id":"63"}],"date_created":"2020-09-03T11:05:14Z"},{"doi":"10.1007/3-540-55488-2_31","user_id":"15415","language":[{"iso":"eng"}],"_id":"16733","date_updated":"2022-01-06T06:52:55Z","publication_status":"published","publication_identifier":{"isbn":["9783540554882","9783540471035"],"issn":["0302-9743","1611-3349"]},"author":[{"first_name":"Martin","last_name":"Dietzfelbinger","full_name":"Dietzfelbinger, Martin"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"year":"1992","title":"High performance universal hashing, with applications to shared memory simulations","status":"public","department":[{"_id":"63"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_created":"2020-04-20T11:27:50Z","citation":{"mla":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance Universal Hashing, with Applications to Shared Memory Simulations.” <i>Data Structures and Efficient Algorithms</i>, 1992, doi:<a href=\"https://doi.org/10.1007/3-540-55488-2_31\">10.1007/3-540-55488-2_31</a>.","bibtex":"@inbook{Dietzfelbinger_Meyer auf der Heide_1992, place={Berlin, Heidelberg}, title={High performance universal hashing, with applications to shared memory simulations}, DOI={<a href=\"https://doi.org/10.1007/3-540-55488-2_31\">10.1007/3-540-55488-2_31</a>}, booktitle={Data structures and efficient algorithms}, author={Dietzfelbinger, Martin and Meyer auf der Heide, Friedhelm}, year={1992} }","ama":"Dietzfelbinger M, Meyer auf der Heide F. High performance universal hashing, with applications to shared memory simulations. In: <i>Data Structures and Efficient Algorithms</i>. Berlin, Heidelberg; 1992. doi:<a href=\"https://doi.org/10.1007/3-540-55488-2_31\">10.1007/3-540-55488-2_31</a>","ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “High performance universal hashing, with applications to shared memory simulations,” in <i>Data structures and efficient algorithms</i>, Berlin, Heidelberg, 1992.","apa":"Dietzfelbinger, M., &#38; Meyer auf der Heide, F. (1992). High performance universal hashing, with applications to shared memory simulations. In <i>Data structures and efficient algorithms</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-55488-2_31\">https://doi.org/10.1007/3-540-55488-2_31</a>","chicago":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance Universal Hashing, with Applications to Shared Memory Simulations.” In <i>Data Structures and Efficient Algorithms</i>. Berlin, Heidelberg, 1992. <a href=\"https://doi.org/10.1007/3-540-55488-2_31\">https://doi.org/10.1007/3-540-55488-2_31</a>.","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Data Structures and Efficient Algorithms, Berlin, Heidelberg, 1992."},"publication":"Data structures and efficient algorithms"},{"user_id":"15415","doi":"10.1007/3-540-56731-3_3","language":[{"iso":"eng"}],"_id":"16734","publication_status":"published","date_updated":"2022-01-06T06:52:55Z","year":"1992","title":"Hashing strategies for simulating shared memory on distributed memory machines","status":"public","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540567318","9783540476375"]},"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-04-20T11:29:58Z","place":"Berlin, Heidelberg","publication":"Lecture Notes in Computer Science","citation":{"apa":"Meyer auf der Heide, F. (1992). Hashing strategies for simulating shared memory on distributed memory machines. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-56731-3_3\">https://doi.org/10.1007/3-540-56731-3_3</a>","ieee":"F. Meyer auf der Heide, “Hashing strategies for simulating shared memory on distributed memory machines,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1992.","chicago":"Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 1992. <a href=\"https://doi.org/10.1007/3-540-56731-3_3\">https://doi.org/10.1007/3-540-56731-3_3</a>.","short":"F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1992.","mla":"Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines.” <i>Lecture Notes in Computer Science</i>, 1992, doi:<a href=\"https://doi.org/10.1007/3-540-56731-3_3\">10.1007/3-540-56731-3_3</a>.","ama":"Meyer auf der Heide F. Hashing strategies for simulating shared memory on distributed memory machines. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1992. doi:<a href=\"https://doi.org/10.1007/3-540-56731-3_3\">10.1007/3-540-56731-3_3</a>","bibtex":"@inbook{Meyer auf der Heide_1992, place={Berlin, Heidelberg}, title={Hashing strategies for simulating shared memory on distributed memory machines}, DOI={<a href=\"https://doi.org/10.1007/3-540-56731-3_3\">10.1007/3-540-56731-3_3</a>}, booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1992} }"}},{"type":"book_chapter","department":[{"_id":"63"}],"place":"Berlin, Heidelberg","date_created":"2020-04-20T11:31:58Z","publication":"STACS 92","citation":{"chicago":"Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance of Networks with Multiple Busses.” In <i>STACS 92</i>. Berlin, Heidelberg, 1992. <a href=\"https://doi.org/10.1007/3-540-55210-3_176\">https://doi.org/10.1007/3-540-55210-3_176</a>.","short":"F. Meyer auf der Heide, H.T. Pham, in: STACS 92, Berlin, Heidelberg, 1992.","ieee":"F. Meyer auf der Heide and H. T. Pham, “On the performance of networks with multiple busses,” in <i>STACS 92</i>, Berlin, Heidelberg, 1992.","apa":"Meyer auf der Heide, F., &#38; Pham, H. T. (1992). On the performance of networks with multiple busses. In <i>STACS 92</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-55210-3_176\">https://doi.org/10.1007/3-540-55210-3_176</a>","bibtex":"@inbook{Meyer auf der Heide_Pham_1992, place={Berlin, Heidelberg}, title={On the performance of networks with multiple busses}, DOI={<a href=\"https://doi.org/10.1007/3-540-55210-3_176\">10.1007/3-540-55210-3_176</a>}, booktitle={STACS 92}, author={Meyer auf der Heide, Friedhelm and Pham, Hieu Thien}, year={1992} }","ama":"Meyer auf der Heide F, Pham HT. On the performance of networks with multiple busses. In: <i>STACS 92</i>. Berlin, Heidelberg; 1992. doi:<a href=\"https://doi.org/10.1007/3-540-55210-3_176\">10.1007/3-540-55210-3_176</a>","mla":"Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance of Networks with Multiple Busses.” <i>STACS 92</i>, 1992, doi:<a href=\"https://doi.org/10.1007/3-540-55210-3_176\">10.1007/3-540-55210-3_176</a>."},"doi":"10.1007/3-540-55210-3_176","user_id":"15415","language":[{"iso":"eng"}],"_id":"16735","date_updated":"2022-01-06T06:52:55Z","publication_status":"published","title":"On the performance of networks with multiple busses","status":"public","year":"1992","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540552109","9783540467755"]},"author":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Pham","first_name":"Hieu Thien","full_name":"Pham, Hieu Thien"}]},{"publication":"Proceedings of the twenty-fourth annual ACM symposium on Theory of computing  - STOC '92","citation":{"ama":"Karp RM, Luby M, Meyer auf der Heide F. Efficient PRAM simulation on a distributed memory machine. In: <i>Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing  - STOC ’92</i>. ; 1992. doi:<a href=\"https://doi.org/10.1145/129712.129743\">10.1145/129712.129743</a>","bibtex":"@inproceedings{Karp_Luby_Meyer auf der Heide_1992, title={Efficient PRAM simulation on a distributed memory machine}, DOI={<a href=\"https://doi.org/10.1145/129712.129743\">10.1145/129712.129743</a>}, booktitle={Proceedings of the twenty-fourth annual ACM symposium on Theory of computing  - STOC ’92}, author={Karp, Richard M. and Luby, Michael and Meyer auf der Heide, Friedhelm}, year={1992} }","mla":"Karp, Richard M., et al. “Efficient PRAM Simulation on a Distributed Memory Machine.” <i>Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing  - STOC ’92</i>, 1992, doi:<a href=\"https://doi.org/10.1145/129712.129743\">10.1145/129712.129743</a>.","short":"R.M. Karp, M. Luby, F. Meyer auf der Heide, in: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing  - STOC ’92, 1992.","chicago":"Karp, Richard M., Michael Luby, and Friedhelm Meyer auf der Heide. “Efficient PRAM Simulation on a Distributed Memory Machine.” In <i>Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing  - STOC ’92</i>, 1992. <a href=\"https://doi.org/10.1145/129712.129743\">https://doi.org/10.1145/129712.129743</a>.","apa":"Karp, R. M., Luby, M., &#38; Meyer auf der Heide, F. (1992). Efficient PRAM simulation on a distributed memory machine. In <i>Proceedings of the twenty-fourth annual ACM symposium on Theory of computing  - STOC ’92</i>. <a href=\"https://doi.org/10.1145/129712.129743\">https://doi.org/10.1145/129712.129743</a>","ieee":"R. M. Karp, M. Luby, and F. Meyer auf der Heide, “Efficient PRAM simulation on a distributed memory machine,” in <i>Proceedings of the twenty-fourth annual ACM symposium on Theory of computing  - STOC ’92</i>, 1992."},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-20T11:33:22Z","publication_status":"published","date_updated":"2022-01-06T06:52:55Z","year":"1992","status":"public","title":"Efficient PRAM simulation on a distributed memory machine","author":[{"full_name":"Karp, Richard M.","last_name":"Karp","first_name":"Richard M."},{"full_name":"Luby, Michael","last_name":"Luby","first_name":"Michael"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"publication_identifier":{"isbn":["0897915119"]},"user_id":"15415","doi":"10.1145/129712.129743","language":[{"iso":"eng"}],"_id":"16736"},{"date_updated":"2022-01-06T06:52:55Z","publication_status":"published","author":[{"last_name":"Dietzfelbinger","first_name":"Martin","full_name":"Dietzfelbinger, Martin"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"publication_identifier":{"isbn":["9783815420331","9783322952332"],"issn":["1615-4584"]},"status":"public","title":"Dynamic Hashing in Real Time","year":"1992","doi":"10.1007/978-3-322-95233-2_7","user_id":"15415","_id":"16737","language":[{"iso":"eng"}],"citation":{"ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “Dynamic Hashing in Real Time,” in <i>TEUBNER-TEXTE zur Informatik</i>, Wiesbaden, 1992.","apa":"Dietzfelbinger, M., &#38; Meyer auf der Heide, F. (1992). Dynamic Hashing in Real Time. In <i>TEUBNER-TEXTE zur Informatik</i>. Wiesbaden. <a href=\"https://doi.org/10.1007/978-3-322-95233-2_7\">https://doi.org/10.1007/978-3-322-95233-2_7</a>","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: TEUBNER-TEXTE Zur Informatik, Wiesbaden, 1992.","chicago":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Dynamic Hashing in Real Time.” In <i>TEUBNER-TEXTE Zur Informatik</i>. Wiesbaden, 1992. <a href=\"https://doi.org/10.1007/978-3-322-95233-2_7\">https://doi.org/10.1007/978-3-322-95233-2_7</a>.","mla":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Dynamic Hashing in Real Time.” <i>TEUBNER-TEXTE Zur Informatik</i>, 1992, doi:<a href=\"https://doi.org/10.1007/978-3-322-95233-2_7\">10.1007/978-3-322-95233-2_7</a>.","bibtex":"@inbook{Dietzfelbinger_Meyer auf der Heide_1992, place={Wiesbaden}, title={Dynamic Hashing in Real Time}, DOI={<a href=\"https://doi.org/10.1007/978-3-322-95233-2_7\">10.1007/978-3-322-95233-2_7</a>}, booktitle={TEUBNER-TEXTE zur Informatik}, author={Dietzfelbinger, Martin and Meyer auf der Heide, Friedhelm}, year={1992} }","ama":"Dietzfelbinger M, Meyer auf der Heide F. Dynamic Hashing in Real Time. In: <i>TEUBNER-TEXTE Zur Informatik</i>. Wiesbaden; 1992. doi:<a href=\"https://doi.org/10.1007/978-3-322-95233-2_7\">10.1007/978-3-322-95233-2_7</a>"},"publication":"TEUBNER-TEXTE zur Informatik","department":[{"_id":"63"}],"type":"book_chapter","place":"Wiesbaden","date_created":"2020-04-20T11:35:06Z"},{"place":"Berlin/Heidelberg","date_created":"2018-06-05T08:56:43Z","type":"book_chapter","department":[{"_id":"64"},{"_id":"63"}],"publication":"Automata, Languages and Programming","citation":{"apa":"Alt, H., Blömer, J., &#38; Wagener, H. (1990). Approximation of convex polygons. In <i>Automata, Languages and Programming</i> (pp. 703–716). Berlin/Heidelberg: Springer-Verlag. <a href=\"https://doi.org/10.1007/bfb0032068\">https://doi.org/10.1007/bfb0032068</a>","ieee":"H. Alt, J. Blömer, and H. Wagener, “Approximation of convex polygons,” in <i>Automata, Languages and Programming</i>, Berlin/Heidelberg: Springer-Verlag, 1990, pp. 703–716.","chicago":"Alt, Helmut, Johannes Blömer, and Hubert Wagener. “Approximation of Convex Polygons.” In <i>Automata, Languages and Programming</i>, 703–16. Berlin/Heidelberg: Springer-Verlag, 1990. <a href=\"https://doi.org/10.1007/bfb0032068\">https://doi.org/10.1007/bfb0032068</a>.","short":"H. Alt, J. Blömer, H. Wagener, in: Automata, Languages and Programming, Springer-Verlag, Berlin/Heidelberg, 1990, pp. 703–716.","mla":"Alt, Helmut, et al. “Approximation of Convex Polygons.” <i>Automata, Languages and Programming</i>, Springer-Verlag, 1990, pp. 703–16, doi:<a href=\"https://doi.org/10.1007/bfb0032068\">10.1007/bfb0032068</a>.","ama":"Alt H, Blömer J, Wagener H. Approximation of convex polygons. In: <i>Automata, Languages and Programming</i>. Berlin/Heidelberg: Springer-Verlag; 1990:703-716. doi:<a href=\"https://doi.org/10.1007/bfb0032068\">10.1007/bfb0032068</a>","bibtex":"@inbook{Alt_Blömer_Wagener_1990, place={Berlin/Heidelberg}, title={Approximation of convex polygons}, DOI={<a href=\"https://doi.org/10.1007/bfb0032068\">10.1007/bfb0032068</a>}, booktitle={Automata, Languages and Programming}, publisher={Springer-Verlag}, author={Alt, Helmut and Blömer, Johannes and Wagener, Hubert}, year={1990}, pages={703–716} }"},"extern":"1","page":"703-716","language":[{"iso":"eng"}],"_id":"3050","publisher":"Springer-Verlag","doi":"10.1007/bfb0032068","user_id":"14955","title":"Approximation of convex polygons","status":"public","year":"1990","publication_identifier":{"isbn":["3540528261"]},"author":[{"first_name":"Helmut","last_name":"Alt","full_name":"Alt, Helmut"},{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"},{"first_name":"Hubert","last_name":"Wagener","full_name":"Wagener, Hubert"}],"date_updated":"2022-01-06T06:58:54Z","publication_status":"published"},{"citation":{"ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “A new universal class of hash functions and dynamic hashing in real time,” in <i>Automata, Languages and Programming</i>, Berlin/Heidelberg, 1990.","apa":"Dietzfelbinger, M., &#38; Meyer auf der Heide, F. (1990). A new universal class of hash functions and dynamic hashing in real time. In <i>Automata, Languages and Programming</i>. Berlin/Heidelberg. <a href=\"https://doi.org/10.1007/bfb0032018\">https://doi.org/10.1007/bfb0032018</a>","chicago":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “A New Universal Class of Hash Functions and Dynamic Hashing in Real Time.” In <i>Automata, Languages and Programming</i>. Berlin/Heidelberg, 1990. <a href=\"https://doi.org/10.1007/bfb0032018\">https://doi.org/10.1007/bfb0032018</a>.","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Automata, Languages and Programming, Berlin/Heidelberg, 1990.","mla":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “A New Universal Class of Hash Functions and Dynamic Hashing in Real Time.” <i>Automata, Languages and Programming</i>, 1990, doi:<a href=\"https://doi.org/10.1007/bfb0032018\">10.1007/bfb0032018</a>.","bibtex":"@inbook{Dietzfelbinger_Meyer auf der Heide_1990, place={Berlin/Heidelberg}, title={A new universal class of hash functions and dynamic hashing in real time}, DOI={<a href=\"https://doi.org/10.1007/bfb0032018\">10.1007/bfb0032018</a>}, booktitle={Automata, Languages and Programming}, author={Dietzfelbinger, Martin and Meyer auf der Heide, Friedhelm}, year={1990} }","ama":"Dietzfelbinger M, Meyer auf der Heide F. A new universal class of hash functions and dynamic hashing in real time. In: <i>Automata, Languages and Programming</i>. Berlin/Heidelberg; 1990. doi:<a href=\"https://doi.org/10.1007/bfb0032018\">10.1007/bfb0032018</a>"},"publication":"Automata, Languages and Programming","date_created":"2020-04-20T11:37:37Z","place":"Berlin/Heidelberg","department":[{"_id":"63"}],"type":"book_chapter","author":[{"full_name":"Dietzfelbinger, Martin","last_name":"Dietzfelbinger","first_name":"Martin"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publication_identifier":{"isbn":["3540528261"]},"year":"1990","status":"public","title":"A new universal class of hash functions and dynamic hashing in real time","publication_status":"published","date_updated":"2022-01-06T06:52:55Z","_id":"16738","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1007/bfb0032018"},{"doi":"10.1007/bfb0029597","user_id":"15415","_id":"16739","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:55Z","publication_status":"published","publication_identifier":{"isbn":["3540529535"]},"author":[{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"status":"public","title":"Dynamic hashing strategies","year":"1990","department":[{"_id":"63"}],"type":"book_chapter","place":"Berlin/Heidelberg","date_created":"2020-04-20T11:39:31Z","citation":{"ama":"Meyer auf der Heide F. Dynamic hashing strategies. In: <i>Lecture Notes in Computer Science</i>. Berlin/Heidelberg; 1990. doi:<a href=\"https://doi.org/10.1007/bfb0029597\">10.1007/bfb0029597</a>","bibtex":"@inbook{Meyer auf der Heide_1990, place={Berlin/Heidelberg}, title={Dynamic hashing strategies}, DOI={<a href=\"https://doi.org/10.1007/bfb0029597\">10.1007/bfb0029597</a>}, booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1990} }","mla":"Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.” <i>Lecture Notes in Computer Science</i>, 1990, doi:<a href=\"https://doi.org/10.1007/bfb0029597\">10.1007/bfb0029597</a>.","chicago":"Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.” In <i>Lecture Notes in Computer Science</i>. Berlin/Heidelberg, 1990. <a href=\"https://doi.org/10.1007/bfb0029597\">https://doi.org/10.1007/bfb0029597</a>.","short":"F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.","apa":"Meyer auf der Heide, F. (1990). Dynamic hashing strategies. In <i>Lecture Notes in Computer Science</i>. Berlin/Heidelberg. <a href=\"https://doi.org/10.1007/bfb0029597\">https://doi.org/10.1007/bfb0029597</a>","ieee":"F. Meyer auf der Heide, “Dynamic hashing strategies,” in <i>Lecture Notes in Computer Science</i>, Berlin/Heidelberg, 1990."},"publication":"Lecture Notes in Computer Science"}]