[{"citation":{"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>","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>.","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} }","short":"F. Meyer auf der Heide, M. Westermann, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 1995.","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.","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>.","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>"},"year":"1995","place":"Berlin, Heidelberg","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540606185","9783540484875"]},"publication_status":"published","doi":"10.1007/3-540-60618-1_77","title":"Hot-potato routing on multi-dimensional tori","date_created":"2020-04-17T07:46:18Z","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Westermann, Matthias","last_name":"Westermann","first_name":"Matthias"}],"date_updated":"2022-01-06T06:52:55Z","status":"public","publication":"Graph-Theoretic Concepts in Computer Science","type":"book_chapter","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16717"},{"title":"Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model","doi":"10.1007/3-540-60313-1_131","date_updated":"2022-01-06T06:52:58Z","date_created":"2020-04-27T13:59:05Z","author":[{"first_name":"Armin","full_name":"Bäumker, Armin","last_name":"Bäumker"},{"first_name":"Wolfgang","full_name":"Dittrich, Wolfgang","last_name":"Dittrich"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"place":"Berlin, Heidelberg","year":"1995","citation":{"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} }","short":"A. Bäumker, W. Dittrich, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.","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>.","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>","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."},"publication_identifier":{"isbn":["9783540603139","9783540449133"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","language":[{"iso":"eng"}],"_id":"16874","department":[{"_id":"63"}],"user_id":"15415","status":"public","publication":"Lecture Notes in Computer Science","type":"book_chapter"},{"title":"Dynamic Perfect Hashing: Upper and Lower Bounds","doi":"10.1137/s0097539791194094","date_updated":"2022-01-06T06:52:55Z","date_created":"2020-04-20T10:19:33Z","author":[{"first_name":"Martin","full_name":"Dietzfelbinger, Martin","last_name":"Dietzfelbinger"},{"first_name":"Anna","last_name":"Karlin","full_name":"Karlin, Anna"},{"full_name":"Mehlhorn, Kurt","last_name":"Mehlhorn","first_name":"Kurt"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Rohnert","full_name":"Rohnert, Hans","first_name":"Hans"},{"last_name":"Tarjan","full_name":"Tarjan, Robert E.","first_name":"Robert E."}],"year":"1994","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>","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>.","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.","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>","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} }","short":"M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, R.E. Tarjan, SIAM Journal on Computing (1994) 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>."},"page":"738-761","publication_status":"published","publication_identifier":{"issn":["0097-5397","1095-7111"]},"language":[{"iso":"eng"}],"_id":"16728","user_id":"15415","department":[{"_id":"63"}],"status":"public","type":"journal_article","publication":"SIAM Journal on Computing"},{"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"17477","status":"public","editor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Monien, B.","last_name":"Monien","first_name":"B."},{"last_name":"Rosenberg","full_name":"Rosenberg, A. L.","first_name":"A. L."}],"type":"book_editor","doi":"10.1007/3-540-56731-3","title":"Parallel Architectures and Their Efficient Use","date_created":"2020-07-30T09:49:20Z","publisher":"Springer","date_updated":"2022-01-06T06:53:12Z","citation":{"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>","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>.","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} }","short":"F. Meyer auf der Heide, B. Monien, A.L. Rosenberg, eds., Parallel Architectures and Their Efficient Use, Springer, Berlin, Heidelberg, 1993.","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>.","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.","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>"},"place":"Berlin, Heidelberg","year":"1993","publication_status":"published","publication_identifier":{"isbn":["9783540567318","9783540476375"],"issn":["0302-9743","1611-3349"]}},{"page":"50-55","citation":{"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.","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.","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.","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).","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.","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} }","short":"U. Kastens, F. Meyer auf der Heide, A. Wachsmann, F. Wichmann, in: Proc. 3rd PASA Workshop, PARS Mitteilungen, 1993, pp. 50–55."},"year":"1993","date_created":"2020-07-30T10:54:52Z","author":[{"first_name":"Uwe","last_name":"Kastens","full_name":"Kastens, Uwe"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Alf","full_name":"Wachsmann, Alf","last_name":"Wachsmann"},{"first_name":"Friedrich","full_name":"Wichmann, Friedrich","last_name":"Wichmann"}],"date_updated":"2022-01-06T06:53:12Z","title":"OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report)","publication":"Proc. 3rd PASA Workshop, PARS Mitteilungen","type":"conference","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"17479","language":[{"iso":"eng"}]},{"status":"public","publication":"Information and Computation","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16729","page":"196-217","citation":{"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>","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>.","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>","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} }","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>.","short":"M. Dietzfelbinger, F. Meyer auf der Heide, Information and Computation (1993) 196–217."},"year":"1993","publication_identifier":{"issn":["0890-5401"]},"publication_status":"published","doi":"10.1006/inco.1993.1007","title":"An Optimal Parallel Dictionary","date_created":"2020-04-20T10:31:51Z","author":[{"last_name":"Dietzfelbinger","full_name":"Dietzfelbinger, M.","first_name":"M."},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"date_updated":"2022-01-06T06:52:55Z"},{"author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Oesterdiekhoff","full_name":"Oesterdiekhoff, Brigitte","first_name":"Brigitte"},{"first_name":"Rolf","last_name":"Wanka","full_name":"Wanka, Rolf"}],"date_created":"2020-04-20T10:33:56Z","date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/3-540-56939-1_89","title":"Strongly adaptive token distribution","publication_status":"published","publication_identifier":{"isbn":["9783540569398","9783540478263"],"issn":["0302-9743","1611-3349"]},"citation":{"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>","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.","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>.","short":"F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, in: Automata, Languages and Programming, Berlin, Heidelberg, 1993.","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>.","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>"},"place":"Berlin, Heidelberg","year":"1993","user_id":"15415","department":[{"_id":"63"}],"_id":"16730","language":[{"iso":"eng"}],"type":"book_chapter","publication":"Automata, Languages and Programming","status":"public"},{"title":"Simple, efficient shared memory simulations","doi":"10.1145/165231.165246","date_updated":"2022-01-06T06:52:55Z","date_created":"2020-04-20T10:35:49Z","author":[{"full_name":"Dietzfelbinger, Martin","last_name":"Dietzfelbinger","first_name":"Martin"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"year":"1993","citation":{"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>","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} }","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’93, 1993.","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>.","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.","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>.","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>"},"publication_identifier":{"isbn":["0897915992"]},"publication_status":"published","language":[{"iso":"eng"}],"_id":"16731","department":[{"_id":"63"}],"user_id":"15415","status":"public","publication":"Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures  - SPAA '93","type":"conference"},{"status":"public","publication":"Lecture Notes in Computer Science","type":"book_chapter","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16732","citation":{"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>.","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.","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>","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>","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} }","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>.","short":"K. Lürwer-Brüggemeier, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1993."},"place":"Berlin, Heidelberg","year":"1993","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540565031","9783540475743"]},"publication_status":"published","doi":"10.1007/3-540-56503-5_46","title":"Capabilities and complexity of computations with integer division","author":[{"first_name":"Katharina","full_name":"Lürwer-Brüggemeier, Katharina","last_name":"Lürwer-Brüggemeier"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"date_created":"2020-04-20T11:25:51Z","date_updated":"2022-01-06T06:52:55Z"},{"user_id":"15415","department":[{"_id":"63"}],"_id":"16733","language":[{"iso":"eng"}],"type":"book_chapter","publication":"Data structures and efficient algorithms","status":"public","date_created":"2020-04-20T11:27:50Z","author":[{"first_name":"Martin","full_name":"Dietzfelbinger, Martin","last_name":"Dietzfelbinger"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/3-540-55488-2_31","title":"High performance universal hashing, with applications to shared memory simulations","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540554882","9783540471035"]},"citation":{"apa":"Dietzfelbinger, M., &#38; Meyer auf der Heide, F. (1992). High performance universal hashing, with applications to shared memory simulations. In <i>Data structures and efficient algorithms</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-55488-2_31\">https://doi.org/10.1007/3-540-55488-2_31</a>","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} }","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Data Structures and Efficient Algorithms, Berlin, Heidelberg, 1992.","ama":"Dietzfelbinger M, Meyer auf der Heide F. High performance universal hashing, with applications to shared memory simulations. In: <i>Data Structures and Efficient Algorithms</i>. Berlin, Heidelberg; 1992. doi:<a href=\"https://doi.org/10.1007/3-540-55488-2_31\">10.1007/3-540-55488-2_31</a>","chicago":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance Universal Hashing, with Applications to Shared Memory Simulations.” In <i>Data Structures and Efficient Algorithms</i>. Berlin, Heidelberg, 1992. <a href=\"https://doi.org/10.1007/3-540-55488-2_31\">https://doi.org/10.1007/3-540-55488-2_31</a>.","ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “High performance universal hashing, with applications to shared memory simulations,” in <i>Data structures and efficient algorithms</i>, Berlin, Heidelberg, 1992."},"year":"1992","place":"Berlin, Heidelberg"},{"_id":"16734","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication":"Lecture Notes in Computer Science","type":"book_chapter","status":"public","date_updated":"2022-01-06T06:52:55Z","author":[{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"date_created":"2020-04-20T11:29:58Z","title":"Hashing strategies for simulating shared memory on distributed memory machines","doi":"10.1007/3-540-56731-3_3","publication_identifier":{"isbn":["9783540567318","9783540476375"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","place":"Berlin, Heidelberg","year":"1992","citation":{"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>","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>.","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.","short":"F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1992.","mla":"Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines.” <i>Lecture Notes in Computer Science</i>, 1992, doi:<a href=\"https://doi.org/10.1007/3-540-56731-3_3\">10.1007/3-540-56731-3_3</a>.","bibtex":"@inbook{Meyer auf der Heide_1992, place={Berlin, Heidelberg}, title={Hashing strategies for simulating shared memory on distributed memory machines}, DOI={<a href=\"https://doi.org/10.1007/3-540-56731-3_3\">10.1007/3-540-56731-3_3</a>}, booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1992} }","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>"}},{"type":"book_chapter","publication":"STACS 92","status":"public","user_id":"15415","department":[{"_id":"63"}],"_id":"16735","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9783540552109","9783540467755"],"issn":["0302-9743","1611-3349"]},"citation":{"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>","short":"F. Meyer auf der Heide, H.T. Pham, in: STACS 92, Berlin, Heidelberg, 1992.","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} }","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>.","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>.","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.","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>"},"place":"Berlin, Heidelberg","year":"1992","date_created":"2020-04-20T11:31:58Z","author":[{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Pham, Hieu Thien","last_name":"Pham","first_name":"Hieu Thien"}],"date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/3-540-55210-3_176","title":"On the performance of networks with multiple busses"},{"_id":"16736","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the twenty-fourth annual ACM symposium on Theory of computing  - STOC '92","status":"public","date_updated":"2022-01-06T06:52:55Z","date_created":"2020-04-20T11:33:22Z","author":[{"full_name":"Karp, Richard M.","last_name":"Karp","first_name":"Richard M."},{"first_name":"Michael","full_name":"Luby, Michael","last_name":"Luby"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"title":"Efficient PRAM simulation on a distributed memory machine","doi":"10.1145/129712.129743","publication_status":"published","publication_identifier":{"isbn":["0897915119"]},"year":"1992","citation":{"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>","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.” <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} }","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.","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>.","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>"}},{"doi":"10.1007/978-3-322-95233-2_7","title":"Dynamic Hashing in Real Time","date_created":"2020-04-20T11:35:06Z","author":[{"last_name":"Dietzfelbinger","full_name":"Dietzfelbinger, Martin","first_name":"Martin"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"date_updated":"2022-01-06T06:52:55Z","citation":{"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>","chicago":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Dynamic Hashing in Real Time.” In <i>TEUBNER-TEXTE Zur Informatik</i>. Wiesbaden, 1992. <a href=\"https://doi.org/10.1007/978-3-322-95233-2_7\">https://doi.org/10.1007/978-3-322-95233-2_7</a>.","ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “Dynamic Hashing in Real Time,” in <i>TEUBNER-TEXTE zur Informatik</i>, Wiesbaden, 1992.","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} }","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>.","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: TEUBNER-TEXTE Zur Informatik, 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>"},"year":"1992","place":"Wiesbaden","publication_status":"published","publication_identifier":{"isbn":["9783815420331","9783322952332"],"issn":["1615-4584"]},"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16737","status":"public","type":"book_chapter","publication":"TEUBNER-TEXTE zur Informatik"},{"publication":"Automata, Languages and Programming","type":"book_chapter","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"16738","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["3540528261"]},"publication_status":"published","citation":{"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>.","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.","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>","mla":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “A New Universal Class of Hash Functions and Dynamic Hashing in Real Time.” <i>Automata, Languages and Programming</i>, 1990, doi:<a href=\"https://doi.org/10.1007/bfb0032018\">10.1007/bfb0032018</a>.","bibtex":"@inbook{Dietzfelbinger_Meyer auf der Heide_1990, place={Berlin/Heidelberg}, title={A new universal class of hash functions and dynamic hashing in real time}, DOI={<a href=\"https://doi.org/10.1007/bfb0032018\">10.1007/bfb0032018</a>}, booktitle={Automata, Languages and Programming}, author={Dietzfelbinger, Martin and Meyer auf der Heide, Friedhelm}, year={1990} }","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Automata, Languages and Programming, Berlin/Heidelberg, 1990.","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>"},"place":"Berlin/Heidelberg","year":"1990","date_created":"2020-04-20T11:37:37Z","author":[{"first_name":"Martin","full_name":"Dietzfelbinger, Martin","last_name":"Dietzfelbinger"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/bfb0032018","title":"A new universal class of hash functions and dynamic hashing in real time"},{"user_id":"15415","department":[{"_id":"63"}],"_id":"16739","language":[{"iso":"eng"}],"type":"book_chapter","publication":"Lecture Notes in Computer Science","status":"public","author":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_created":"2020-04-20T11:39:31Z","date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/bfb0029597","title":"Dynamic hashing strategies","publication_status":"published","publication_identifier":{"isbn":["3540529535"]},"citation":{"bibtex":"@inbook{Meyer auf der Heide_1990, place={Berlin/Heidelberg}, title={Dynamic hashing strategies}, DOI={<a href=\"https://doi.org/10.1007/bfb0029597\">10.1007/bfb0029597</a>}, booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1990} }","short":"F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.","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>.","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.","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>.","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>"},"year":"1990","place":"Berlin/Heidelberg"},{"language":[{"iso":"eng"}],"_id":"16740","user_id":"15415","department":[{"_id":"63"}],"status":"public","type":"book_chapter","publication":"Lecture Notes in Computer Science","title":"On the complexity of genuinely polynomial computation","doi":"10.1007/bfb0029630","date_updated":"2022-01-06T06:52:55Z","author":[{"full_name":"Karpinski, Marek","last_name":"Karpinski","first_name":"Marek"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2020-04-20T11:40:17Z","place":"Berlin/Heidelberg","year":"1990","citation":{"ieee":"M. Karpinski and F. Meyer auf der Heide, “On the complexity of genuinely polynomial computation,” in <i>Lecture Notes in Computer Science</i>, Berlin/Heidelberg, 1990.","chicago":"Karpinski, Marek, and Friedhelm Meyer auf der Heide. “On the Complexity of Genuinely Polynomial Computation.” In <i>Lecture Notes in Computer Science</i>. Berlin/Heidelberg, 1990. <a href=\"https://doi.org/10.1007/bfb0029630\">https://doi.org/10.1007/bfb0029630</a>.","ama":"Karpinski M, Meyer auf der Heide F. On the complexity of genuinely polynomial computation. In: <i>Lecture Notes in Computer Science</i>. Berlin/Heidelberg; 1990. doi:<a href=\"https://doi.org/10.1007/bfb0029630\">10.1007/bfb0029630</a>","mla":"Karpinski, Marek, and Friedhelm Meyer auf der Heide. “On the Complexity of Genuinely Polynomial Computation.” <i>Lecture Notes in Computer Science</i>, 1990, doi:<a href=\"https://doi.org/10.1007/bfb0029630\">10.1007/bfb0029630</a>.","bibtex":"@inbook{Karpinski_Meyer auf der Heide_1990, place={Berlin/Heidelberg}, title={On the complexity of genuinely polynomial computation}, DOI={<a href=\"https://doi.org/10.1007/bfb0029630\">10.1007/bfb0029630</a>}, booktitle={Lecture Notes in Computer Science}, author={Karpinski, Marek and Meyer auf der Heide, Friedhelm}, year={1990} }","short":"M. Karpinski, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.","apa":"Karpinski, M., &#38; Meyer auf der Heide, F. (1990). On the complexity of genuinely polynomial computation. In <i>Lecture Notes in Computer Science</i>. Berlin/Heidelberg. <a href=\"https://doi.org/10.1007/bfb0029630\">https://doi.org/10.1007/bfb0029630</a>"},"publication_status":"published","publication_identifier":{"isbn":["3540529535"]}},{"doi":"10.1145/100216.100229","title":"How to distribute a dictionary in a complete network","date_created":"2020-04-20T11:41:08Z","author":[{"first_name":"M.","full_name":"Dietzfelbinger, M.","last_name":"Dietzfelbinger"},{"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","citation":{"chicago":"Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “How to Distribute a Dictionary in a Complete Network.” In <i>Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90</i>, 1990. <a href=\"https://doi.org/10.1145/100216.100229\">https://doi.org/10.1145/100216.100229</a>.","ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “How to distribute a dictionary in a complete network,” in <i>Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90</i>, 1990.","ama":"Dietzfelbinger M, Meyer auf der Heide F. How to distribute a dictionary in a complete network. In: <i>Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90</i>. ; 1990. doi:<a href=\"https://doi.org/10.1145/100216.100229\">10.1145/100216.100229</a>","bibtex":"@inproceedings{Dietzfelbinger_Meyer auf der Heide_1990, title={How to distribute a dictionary in a complete network}, DOI={<a href=\"https://doi.org/10.1145/100216.100229\">10.1145/100216.100229</a>}, booktitle={Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90}, author={Dietzfelbinger, M. and Meyer auf der Heide, Friedhelm}, year={1990} }","mla":"Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “How to Distribute a Dictionary in a Complete Network.” <i>Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90</i>, 1990, doi:<a href=\"https://doi.org/10.1145/100216.100229\">10.1145/100216.100229</a>.","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990.","apa":"Dietzfelbinger, M., &#38; Meyer auf der Heide, F. (1990). How to distribute a dictionary in a complete network. In <i>Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90</i>. <a href=\"https://doi.org/10.1145/100216.100229\">https://doi.org/10.1145/100216.100229</a>"},"year":"1990","publication_identifier":{"isbn":["0897913612"]},"publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16741","status":"public","publication":"Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC '90","type":"conference"},{"publication_identifier":{"isbn":["0897913612"]},"publication_status":"published","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.","bibtex":"@inproceedings{Gil_Meyer auf der Heide_Wigderson_1990, title={Not all keys can be hashed in constant time}, DOI={<a href=\"https://doi.org/10.1145/100216.100247\">10.1145/100216.100247</a>}, booktitle={Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90}, author={Gil, J. and Meyer auf der Heide, Friedhelm and Wigderson, A.}, year={1990} }","mla":"Gil, J., et al. “Not All Keys Can Be Hashed in Constant Time.” <i>Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90</i>, 1990, doi:<a href=\"https://doi.org/10.1145/100216.100247\">10.1145/100216.100247</a>.","apa":"Gil, J., Meyer auf der Heide, F., &#38; Wigderson, A. (1990). Not all keys can be hashed in constant time. In <i>Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90</i>. <a href=\"https://doi.org/10.1145/100216.100247\">https://doi.org/10.1145/100216.100247</a>","ama":"Gil J, Meyer auf der Heide F, Wigderson A. Not all keys can be hashed in constant time. In: <i>Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90</i>. ; 1990. doi:<a href=\"https://doi.org/10.1145/100216.100247\">10.1145/100216.100247</a>","ieee":"J. Gil, F. Meyer auf der Heide, and A. Wigderson, “Not all keys can be hashed in constant time,” in <i>Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90</i>, 1990.","chicago":"Gil, J., Friedhelm Meyer auf der Heide, and A. Wigderson. “Not All Keys Can Be Hashed in Constant Time.” In <i>Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90</i>, 1990. <a href=\"https://doi.org/10.1145/100216.100247\">https://doi.org/10.1145/100216.100247</a>."},"year":"1990","author":[{"full_name":"Gil, J.","last_name":"Gil","first_name":"J."},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Wigderson, A.","last_name":"Wigderson","first_name":"A."}],"date_created":"2020-04-20T11:41:55Z","date_updated":"2022-01-06T06:52:55Z","doi":"10.1145/100216.100247","title":"Not all keys can be hashed in constant time","publication":"Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC '90","type":"conference","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"16742","language":[{"iso":"eng"}]},{"status":"public","publication":"Informatik Spektrum","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16824","page":"231-232","intvolume":"        13","citation":{"ama":"Meyer auf der Heide F. Das Heinz Nixdorf-Institut der Universität-GH Paderborn. <i>Informatik Spektrum</i>. 1990;13(4):231-232.","chicago":"Meyer auf der Heide, Friedhelm. “Das Heinz Nixdorf-Institut Der Universität-GH Paderborn.” <i>Informatik Spektrum</i> 13, no. 4 (1990): 231–32.","ieee":"F. Meyer auf der Heide, “Das Heinz Nixdorf-Institut der Universität-GH Paderborn,” <i>Informatik Spektrum</i>, vol. 13, no. 4, pp. 231–232, 1990.","apa":"Meyer auf der Heide, F. (1990). Das Heinz Nixdorf-Institut der Universität-GH Paderborn. <i>Informatik Spektrum</i>, <i>13</i>(4), 231–232.","bibtex":"@article{Meyer auf der Heide_1990, title={Das Heinz Nixdorf-Institut der Universität-GH Paderborn}, volume={13}, number={4}, journal={Informatik Spektrum}, author={Meyer auf der Heide, Friedhelm}, year={1990}, pages={231–232} }","mla":"Meyer auf der Heide, Friedhelm. “Das Heinz Nixdorf-Institut Der Universität-GH Paderborn.” <i>Informatik Spektrum</i>, vol. 13, no. 4, 1990, pp. 231–32.","short":"F. Meyer auf der Heide, Informatik Spektrum 13 (1990) 231–232."},"year":"1990","issue":"4","title":"Das Heinz Nixdorf-Institut der Universität-GH Paderborn","volume":13,"date_created":"2020-04-22T10:28:27Z","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_updated":"2022-01-06T06:52:56Z"}]