[{"place":"Berlin, Heidelberg","year":"1999","citation":{"ieee":"E. W. Mayr, F. Meyer auf der Heide, and R. Wanka, “International Workshop on Communication and Data Management in Large Networks,” in <i>Informatik aktuell</i>, Berlin, Heidelberg, 1999.","chicago":"Mayr, E. W., Friedhelm Meyer auf der Heide, and Rolf Wanka. “International Workshop on Communication and Data Management in Large Networks.” In <i>Informatik Aktuell</i>. Berlin, Heidelberg, 1999. <a href=\"https://doi.org/10.1007/978-3-662-01069-3_47\">https://doi.org/10.1007/978-3-662-01069-3_47</a>.","ama":"Mayr EW, Meyer auf der Heide F, Wanka R. International Workshop on Communication and Data Management in Large Networks. In: <i>Informatik Aktuell</i>. ; 1999. doi:<a href=\"https://doi.org/10.1007/978-3-662-01069-3_47\">10.1007/978-3-662-01069-3_47</a>","apa":"Mayr, E. W., Meyer auf der Heide, F., &#38; Wanka, R. (1999). International Workshop on Communication and Data Management in Large Networks. In <i>Informatik aktuell</i>. <a href=\"https://doi.org/10.1007/978-3-662-01069-3_47\">https://doi.org/10.1007/978-3-662-01069-3_47</a>","bibtex":"@inbook{Mayr_Meyer auf der Heide_Wanka_1999, place={Berlin, Heidelberg}, title={International Workshop on Communication and Data Management in Large Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-01069-3_47\">10.1007/978-3-662-01069-3_47</a>}, booktitle={Informatik aktuell}, author={Mayr, E. W. and Meyer auf der Heide, Friedhelm and Wanka, Rolf}, year={1999} }","short":"E.W. Mayr, F. Meyer auf der Heide, R. Wanka, in: Informatik Aktuell, Berlin, Heidelberg, 1999.","mla":"Mayr, E. W., et al. “International Workshop on Communication and Data Management in Large Networks.” <i>Informatik Aktuell</i>, 1999, doi:<a href=\"https://doi.org/10.1007/978-3-662-01069-3_47\">10.1007/978-3-662-01069-3_47</a>."},"publication_status":"published","publication_identifier":{"issn":["1431-472X"],"isbn":["9783540664505","9783662010693"]},"title":"International Workshop on Communication and Data Management in Large Networks","doi":"10.1007/978-3-662-01069-3_47","date_updated":"2022-01-06T06:53:03Z","author":[{"first_name":"E. W.","full_name":"Mayr, E. W.","last_name":"Mayr"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Rolf","full_name":"Wanka, Rolf","last_name":"Wanka"}],"date_created":"2020-05-20T13:16:56Z","status":"public","type":"book_chapter","publication":"Informatik aktuell","language":[{"iso":"eng"}],"_id":"17052","user_id":"15415","department":[{"_id":"63"}]},{"publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540662518","9783540484813"]},"year":"1999","place":"Berlin, Heidelberg","citation":{"chicago":"Meyer auf der Heide, Friedhelm, Berthold Vöcking, and Matthias Westermann. “Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.” In <i>Algorithms - ESA’ 99</i>. Berlin, Heidelberg, 1999. <a href=\"https://doi.org/10.1007/3-540-48481-7_9\">https://doi.org/10.1007/3-540-48481-7_9</a>.","ieee":"F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Provably Good and Practical Strategies for Non-uniform Data Management in Networks,” in <i>Algorithms - ESA’ 99</i>, Berlin, Heidelberg, 1999.","ama":"Meyer auf der Heide F, Vöcking B, Westermann M. Provably Good and Practical Strategies for Non-uniform Data Management in Networks. In: <i>Algorithms - ESA’ 99</i>. Berlin, Heidelberg; 1999. doi:<a href=\"https://doi.org/10.1007/3-540-48481-7_9\">10.1007/3-540-48481-7_9</a>","bibtex":"@inbook{Meyer auf der Heide_Vöcking_Westermann_1999, place={Berlin, Heidelberg}, title={Provably Good and Practical Strategies for Non-uniform Data Management in Networks}, DOI={<a href=\"https://doi.org/10.1007/3-540-48481-7_9\">10.1007/3-540-48481-7_9</a>}, booktitle={Algorithms - ESA’ 99}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold and Westermann, Matthias}, year={1999} }","mla":"Meyer auf der Heide, Friedhelm, et al. “Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.” <i>Algorithms - ESA’ 99</i>, 1999, doi:<a href=\"https://doi.org/10.1007/3-540-48481-7_9\">10.1007/3-540-48481-7_9</a>.","short":"F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Algorithms - ESA’ 99, Berlin, Heidelberg, 1999.","apa":"Meyer auf der Heide, F., Vöcking, B., &#38; Westermann, M. (1999). Provably Good and Practical Strategies for Non-uniform Data Management in Networks. In <i>Algorithms - ESA’ 99</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-48481-7_9\">https://doi.org/10.1007/3-540-48481-7_9</a>"},"date_updated":"2022-01-06T06:53:03Z","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Vöcking","full_name":"Vöcking, Berthold","first_name":"Berthold"},{"first_name":"Matthias","full_name":"Westermann, Matthias","last_name":"Westermann"}],"date_created":"2020-05-20T13:35:49Z","title":"Provably Good and Practical Strategies for Non-uniform Data Management in Networks","doi":"10.1007/3-540-48481-7_9","type":"book_chapter","publication":"Algorithms - ESA’ 99","status":"public","_id":"17053","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"_id":"16503","department":[{"_id":"63"}],"user_id":"15415","status":"public","publication":"Theoretical Computer Science","type":"journal_article","title":"Routing on networks of optical crossbars","doi":"10.1016/s0304-3975(97)86791-6","date_updated":"2022-01-06T06:52:52Z","volume":196,"author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Schröder, Klaus","last_name":"Schröder","first_name":"Klaus"},{"first_name":"Frank","last_name":"Schwarze","full_name":"Schwarze, Frank"}],"date_created":"2020-04-14T12:20:57Z","year":"1998","page":"181-200","intvolume":"       196","citation":{"short":"F. Meyer auf der Heide, K. Schröder, F. Schwarze, Theoretical Computer Science 196 (1998) 181–200.","mla":"Meyer auf der Heide, Friedhelm, et al. “Routing on Networks of Optical Crossbars.” <i>Theoretical Computer Science</i>, vol. 196, 1998, pp. 181–200, doi:<a href=\"https://doi.org/10.1016/s0304-3975(97)86791-6\">10.1016/s0304-3975(97)86791-6</a>.","bibtex":"@article{Meyer auf der Heide_Schröder_Schwarze_1998, title={Routing on networks of optical crossbars}, volume={196}, DOI={<a href=\"https://doi.org/10.1016/s0304-3975(97)86791-6\">10.1016/s0304-3975(97)86791-6</a>}, journal={Theoretical Computer Science}, author={Meyer auf der Heide, Friedhelm and Schröder, Klaus and Schwarze, Frank}, year={1998}, pages={181–200} }","apa":"Meyer auf der Heide, F., Schröder, K., &#38; Schwarze, F. (1998). Routing on networks of optical crossbars. <i>Theoretical Computer Science</i>, <i>196</i>, 181–200. <a href=\"https://doi.org/10.1016/s0304-3975(97)86791-6\">https://doi.org/10.1016/s0304-3975(97)86791-6</a>","chicago":"Meyer auf der Heide, Friedhelm, Klaus Schröder, and Frank Schwarze. “Routing on Networks of Optical Crossbars.” <i>Theoretical Computer Science</i> 196 (1998): 181–200. <a href=\"https://doi.org/10.1016/s0304-3975(97)86791-6\">https://doi.org/10.1016/s0304-3975(97)86791-6</a>.","ieee":"F. Meyer auf der Heide, K. Schröder, and F. Schwarze, “Routing on networks of optical crossbars,” <i>Theoretical Computer Science</i>, vol. 196, pp. 181–200, 1998.","ama":"Meyer auf der Heide F, Schröder K, Schwarze F. Routing on networks of optical crossbars. <i>Theoretical Computer Science</i>. 1998;196:181-200. doi:<a href=\"https://doi.org/10.1016/s0304-3975(97)86791-6\">10.1016/s0304-3975(97)86791-6</a>"},"publication_identifier":{"issn":["0304-3975"]},"publication_status":"published"},{"date_created":"2020-04-14T12:36:47Z","author":[{"full_name":"Bäumker, Armin","last_name":"Bäumker","first_name":"Armin"},{"full_name":"Dittrich, Wolfgang","last_name":"Dittrich","first_name":"Wolfgang"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_updated":"2022-01-06T06:52:52Z","doi":"10.1016/s0304-3975(98)00020-6","title":"Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model","publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","page":"175-203","citation":{"chicago":"Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model.” <i>Theoretical Computer Science</i>, 1998, 175–203. <a href=\"https://doi.org/10.1016/s0304-3975(98)00020-6\">https://doi.org/10.1016/s0304-3975(98)00020-6</a>.","ieee":"A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model,” <i>Theoretical Computer Science</i>, pp. 175–203, 1998.","ama":"Bäumker A, Dittrich W, Meyer auf der Heide F. Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model. <i>Theoretical Computer Science</i>. 1998:175-203. doi:<a href=\"https://doi.org/10.1016/s0304-3975(98)00020-6\">10.1016/s0304-3975(98)00020-6</a>","apa":"Bäumker, A., Dittrich, W., &#38; Meyer auf der Heide, F. (1998). Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model. <i>Theoretical Computer Science</i>, 175–203. <a href=\"https://doi.org/10.1016/s0304-3975(98)00020-6\">https://doi.org/10.1016/s0304-3975(98)00020-6</a>","mla":"Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model.” <i>Theoretical Computer Science</i>, 1998, pp. 175–203, doi:<a href=\"https://doi.org/10.1016/s0304-3975(98)00020-6\">10.1016/s0304-3975(98)00020-6</a>.","bibtex":"@article{Bäumker_Dittrich_Meyer auf der Heide_1998, title={Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model}, DOI={<a href=\"https://doi.org/10.1016/s0304-3975(98)00020-6\">10.1016/s0304-3975(98)00020-6</a>}, journal={Theoretical Computer Science}, author={Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm}, year={1998}, pages={175–203} }","short":"A. Bäumker, W. Dittrich, F. Meyer auf der Heide, Theoretical Computer Science (1998) 175–203."},"year":"1998","department":[{"_id":"63"}],"user_id":"15415","_id":"16504","language":[{"iso":"eng"}],"publication":"Theoretical Computer Science","type":"journal_article","status":"public"},{"doi":"10.1007/bfb0054332","title":"Communication-efficient parallel multiway and approximate minimum cut computation","date_created":"2020-04-15T10:34:15Z","author":[{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"last_name":"Martinez","full_name":"Martinez, Gabriel Terán","first_name":"Gabriel Terán"}],"date_updated":"2022-01-06T06:52:52Z","citation":{"short":"F. Meyer auf der Heide, G.T. Martinez, in: LATIN’98: Theoretical Informatics, Berlin, Heidelberg, 1998.","mla":"Meyer auf der Heide, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation.” <i>LATIN’98: Theoretical Informatics</i>, 1998, doi:<a href=\"https://doi.org/10.1007/bfb0054332\">10.1007/bfb0054332</a>.","bibtex":"@inbook{Meyer auf der Heide_Martinez_1998, place={Berlin, Heidelberg}, title={Communication-efficient parallel multiway and approximate minimum cut computation}, DOI={<a href=\"https://doi.org/10.1007/bfb0054332\">10.1007/bfb0054332</a>}, booktitle={LATIN’98: Theoretical Informatics}, author={Meyer auf der Heide, Friedhelm and Martinez, Gabriel Terán}, year={1998} }","apa":"Meyer auf der Heide, F., &#38; Martinez, G. T. (1998). Communication-efficient parallel multiway and approximate minimum cut computation. In <i>LATIN’98: Theoretical Informatics</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/bfb0054332\">https://doi.org/10.1007/bfb0054332</a>","ama":"Meyer auf der Heide F, Martinez GT. Communication-efficient parallel multiway and approximate minimum cut computation. In: <i>LATIN’98: Theoretical Informatics</i>. Berlin, Heidelberg; 1998. doi:<a href=\"https://doi.org/10.1007/bfb0054332\">10.1007/bfb0054332</a>","chicago":"Meyer auf der Heide, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation.” In <i>LATIN’98: Theoretical Informatics</i>. Berlin, Heidelberg, 1998. <a href=\"https://doi.org/10.1007/bfb0054332\">https://doi.org/10.1007/bfb0054332</a>.","ieee":"F. Meyer auf der Heide and G. T. Martinez, “Communication-efficient parallel multiway and approximate minimum cut computation,” in <i>LATIN’98: Theoretical Informatics</i>, Berlin, Heidelberg, 1998."},"place":"Berlin, Heidelberg","year":"1998","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540642756","9783540697152"]},"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16562","status":"public","type":"book_chapter","publication":"LATIN'98: Theoretical Informatics"},{"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16563","status":"public","type":"conference","publication":"Proceedings of the thirtieth annual ACM symposium on Theory of computing  - STOC '98","doi":"10.1145/276698.276790","title":"Randomized protocols for low-congestion circuit routing in multistage interconnection networks","author":[{"last_name":"Cole","full_name":"Cole, Richard","first_name":"Richard"},{"last_name":"Maggs","full_name":"Maggs, Bruce M.","first_name":"Bruce M."},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Mitzenmacher","full_name":"Mitzenmacher, Michael","first_name":"Michael"},{"last_name":"Richa","full_name":"Richa, Andréa W.","first_name":"Andréa W."},{"last_name":"Schröder","full_name":"Schröder, Klaus","first_name":"Klaus"},{"last_name":"Sitaraman","full_name":"Sitaraman, Ramesh K.","first_name":"Ramesh K."},{"last_name":"Vöcking","full_name":"Vöcking, Berthold","first_name":"Berthold"}],"date_created":"2020-04-15T10:38:12Z","date_updated":"2022-01-06T06:52:52Z","citation":{"ieee":"R. Cole <i>et al.</i>, “Randomized protocols for low-congestion circuit routing in multistage interconnection networks,” in <i>Proceedings of the thirtieth annual ACM symposium on Theory of computing  - STOC ’98</i>, 1998.","chicago":"Cole, Richard, Bruce M. Maggs, Friedhelm Meyer auf der Heide, Michael Mitzenmacher, Andréa W. Richa, Klaus Schröder, Ramesh K. Sitaraman, and Berthold Vöcking. “Randomized Protocols for Low-Congestion Circuit Routing in Multistage Interconnection Networks.” In <i>Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing  - STOC ’98</i>, 1998. <a href=\"https://doi.org/10.1145/276698.276790\">https://doi.org/10.1145/276698.276790</a>.","ama":"Cole R, Maggs BM, Meyer auf der Heide F, et al. Randomized protocols for low-congestion circuit routing in multistage interconnection networks. In: <i>Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing  - STOC ’98</i>. ; 1998. doi:<a href=\"https://doi.org/10.1145/276698.276790\">10.1145/276698.276790</a>","mla":"Cole, Richard, et al. “Randomized Protocols for Low-Congestion Circuit Routing in Multistage Interconnection Networks.” <i>Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing  - STOC ’98</i>, 1998, doi:<a href=\"https://doi.org/10.1145/276698.276790\">10.1145/276698.276790</a>.","bibtex":"@inproceedings{Cole_Maggs_Meyer auf der Heide_Mitzenmacher_Richa_Schröder_Sitaraman_Vöcking_1998, title={Randomized protocols for low-congestion circuit routing in multistage interconnection networks}, DOI={<a href=\"https://doi.org/10.1145/276698.276790\">10.1145/276698.276790</a>}, booktitle={Proceedings of the thirtieth annual ACM symposium on Theory of computing  - STOC ’98}, author={Cole, Richard and Maggs, Bruce M. and Meyer auf der Heide, Friedhelm and Mitzenmacher, Michael and Richa, Andréa W. and Schröder, Klaus and Sitaraman, Ramesh K. and Vöcking, Berthold}, year={1998} }","short":"R. Cole, B.M. Maggs, F. Meyer auf der Heide, M. Mitzenmacher, A.W. Richa, K. Schröder, R.K. Sitaraman, B. Vöcking, in: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing  - STOC ’98, 1998.","apa":"Cole, R., Maggs, B. M., Meyer auf der Heide, F., Mitzenmacher, M., Richa, A. W., Schröder, K., … Vöcking, B. (1998). Randomized protocols for low-congestion circuit routing in multistage interconnection networks. In <i>Proceedings of the thirtieth annual ACM symposium on Theory of computing  - STOC ’98</i>. <a href=\"https://doi.org/10.1145/276698.276790\">https://doi.org/10.1145/276698.276790</a>"},"year":"1998","publication_status":"published","publication_identifier":{"isbn":["0897919629"]}},{"_id":"2175","department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","ddc":["040"],"file_date_updated":"2018-04-12T07:11:50Z","language":[{"iso":"eng"}],"publication":"IPPS","type":"conference","urn":"21759","status":"public","file":[{"file_size":88749,"file_name":"IPPS97.pdf","access_level":"open_access","file_id":"2284","date_updated":"2018-04-12T07:11:50Z","date_created":"2018-04-12T07:07:20Z","creator":"florida","relation":"main_file","content_type":"application/pdf"}],"publisher":"IEEE Computer Society","oa":"1","date_updated":"2022-01-06T06:55:13Z","date_created":"2018-04-03T09:11:47Z","author":[{"last_name":"Bock","full_name":"Bock, Stefan","first_name":"Stefan"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"title":"Optimal Wormhole Routing in the (n, d)-Torus","has_accepted_license":"1","year":"1997","page":"326--332","citation":{"mla":"Bock, Stefan, et al. “Optimal Wormhole Routing in the (n, d)-Torus.” <i>IPPS</i>, IEEE Computer Society, 1997, pp. 326--332.","bibtex":"@inproceedings{Bock_Meyer auf der Heide_Scheideler_1997, title={Optimal Wormhole Routing in the (n, d)-Torus}, booktitle={IPPS}, publisher={IEEE Computer Society}, author={Bock, Stefan and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1997}, pages={326--332} }","short":"S. Bock, F. Meyer auf der Heide, C. Scheideler, in: IPPS, IEEE Computer Society, 1997, pp. 326--332.","apa":"Bock, S., Meyer auf der Heide, F., &#38; Scheideler, C. (1997). Optimal Wormhole Routing in the (n, d)-Torus. In <i>IPPS</i> (pp. 326--332). IEEE Computer Society.","chicago":"Bock, Stefan, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Optimal Wormhole Routing in the (n, d)-Torus.” In <i>IPPS</i>, 326--332. IEEE Computer Society, 1997.","ieee":"S. Bock, F. Meyer auf der Heide, and C. Scheideler, “Optimal Wormhole Routing in the (n, d)-Torus,” in <i>IPPS</i>, 1997, pp. 326--332.","ama":"Bock S, Meyer auf der Heide F, Scheideler C. Optimal Wormhole Routing in the (n, d)-Torus. In: <i>IPPS</i>. IEEE Computer Society; 1997:326--332."}},{"title":"A lower bound for randomized algebraic decision trees","doi":"10.1007/bf01270387","date_updated":"2022-01-06T06:52:52Z","date_created":"2020-04-15T10:42:43Z","author":[{"full_name":"Grigoriev, Dima","last_name":"Grigoriev","first_name":"Dima"},{"first_name":"Marek","full_name":"Karpinski, Marek","last_name":"Karpinski"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Roman","last_name":"Smolensky","full_name":"Smolensky, Roman"}],"year":"1997","page":"357-375","citation":{"chicago":"Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” <i>Computational Complexity</i>, 1997, 357–75. <a href=\"https://doi.org/10.1007/bf01270387\">https://doi.org/10.1007/bf01270387</a>.","ieee":"D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower bound for randomized algebraic decision trees,” <i>computational complexity</i>, pp. 357–375, 1997.","ama":"Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound for randomized algebraic decision trees. <i>computational complexity</i>. 1997:357-375. doi:<a href=\"https://doi.org/10.1007/bf01270387\">10.1007/bf01270387</a>","bibtex":"@article{Grigoriev_Karpinski_Meyer auf der Heide_Smolensky_1997, title={A lower bound for randomized algebraic decision trees}, DOI={<a href=\"https://doi.org/10.1007/bf01270387\">10.1007/bf01270387</a>}, journal={computational complexity}, author={Grigoriev, Dima and Karpinski, Marek and Meyer auf der Heide, Friedhelm and Smolensky, Roman}, year={1997}, pages={357–375} }","mla":"Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.” <i>Computational Complexity</i>, 1997, pp. 357–75, doi:<a href=\"https://doi.org/10.1007/bf01270387\">10.1007/bf01270387</a>.","short":"D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, Computational Complexity (1997) 357–375.","apa":"Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., &#38; Smolensky, R. (1997). A lower bound for randomized algebraic decision trees. <i>Computational Complexity</i>, 357–375. <a href=\"https://doi.org/10.1007/bf01270387\">https://doi.org/10.1007/bf01270387</a>"},"publication_identifier":{"issn":["1016-3328","1420-8954"]},"publication_status":"published","language":[{"iso":"eng"}],"_id":"16564","department":[{"_id":"63"}],"user_id":"15415","status":"public","publication":"computational complexity","type":"journal_article"},{"date_updated":"2022-01-06T06:52:52Z","author":[{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"first_name":"Volker","last_name":"Stemann","full_name":"Stemann, Volker"}],"date_created":"2020-04-15T11:20:09Z","title":"Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures","doi":"10.1006/inco.1997.2642","publication_status":"published","publication_identifier":{"issn":["0890-5401"]},"year":"1997","citation":{"mla":"Czumaj, Artur, et al. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.” <i>Information and Computation</i>, 1997, pp. 103–20, doi:<a href=\"https://doi.org/10.1006/inco.1997.2642\">10.1006/inco.1997.2642</a>.","short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, Information and Computation (1997) 103–120.","bibtex":"@article{Czumaj_Meyer auf der Heide_Stemann_1997, title={Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures}, DOI={<a href=\"https://doi.org/10.1006/inco.1997.2642\">10.1006/inco.1997.2642</a>}, journal={Information and Computation}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1997}, pages={103–120} }","apa":"Czumaj, A., Meyer auf der Heide, F., &#38; Stemann, V. (1997). Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. <i>Information and Computation</i>, 103–120. <a href=\"https://doi.org/10.1006/inco.1997.2642\">https://doi.org/10.1006/inco.1997.2642</a>","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. <i>Information and Computation</i>. 1997:103-120. doi:<a href=\"https://doi.org/10.1006/inco.1997.2642\">10.1006/inco.1997.2642</a>","chicago":"Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.” <i>Information and Computation</i>, 1997, 103–20. <a href=\"https://doi.org/10.1006/inco.1997.2642\">https://doi.org/10.1006/inco.1997.2642</a>.","ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures,” <i>Information and Computation</i>, pp. 103–120, 1997."},"page":"103-120","_id":"16565","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Information and Computation","status":"public"},{"publication":"Theory of Computing Systems","type":"journal_article","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"16567","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1432-4350","1433-0490"]},"publication_status":"published","page":"627-644","citation":{"ama":"Meyer auf der Heide F, Storch M, Wanka R. Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. <i>Theory of Computing Systems</i>. Published online 1997:627-644. doi:<a href=\"https://doi.org/10.1007/s002240000071\">10.1007/s002240000071</a>","ieee":"F. Meyer auf der Heide, M. Storch, and R. Wanka, “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks,” <i>Theory of Computing Systems</i>, pp. 627–644, 1997, doi: <a href=\"https://doi.org/10.1007/s002240000071\">10.1007/s002240000071</a>.","chicago":"Meyer auf der Heide, Friedhelm, M. Storch, and Rolf Wanka. “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks.” <i>Theory of Computing Systems</i>, 1997, 627–44. <a href=\"https://doi.org/10.1007/s002240000071\">https://doi.org/10.1007/s002240000071</a>.","apa":"Meyer auf der Heide, F., Storch, M., &#38; Wanka, R. (1997). Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. <i>Theory of Computing Systems</i>, 627–644. <a href=\"https://doi.org/10.1007/s002240000071\">https://doi.org/10.1007/s002240000071</a>","mla":"Meyer auf der Heide, Friedhelm, et al. “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks.” <i>Theory of Computing Systems</i>, 1997, pp. 627–44, doi:<a href=\"https://doi.org/10.1007/s002240000071\">10.1007/s002240000071</a>.","short":"F. Meyer auf der Heide, M. Storch, R. Wanka, Theory of Computing Systems (1997) 627–644.","bibtex":"@article{Meyer auf der Heide_Storch_Wanka_1997, title={Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks}, DOI={<a href=\"https://doi.org/10.1007/s002240000071\">10.1007/s002240000071</a>}, journal={Theory of Computing Systems}, author={Meyer auf der Heide, Friedhelm and Storch, M. and Wanka, Rolf}, year={1997}, pages={627–644} }"},"year":"1997","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Storch","full_name":"Storch, M.","first_name":"M."},{"full_name":"Wanka, Rolf","last_name":"Wanka","first_name":"Rolf"}],"date_created":"2020-04-15T11:31:05Z","date_updated":"2022-01-06T06:52:52Z","doi":"10.1007/s002240000071","title":"Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks"},{"publication_identifier":{"isbn":["9783540634409","9783540695493"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","citation":{"bibtex":"@inbook{Meyer auf der Heide_Vöcking_1997, place={Berlin, Heidelberg}, title={Static and dynamic data management in networks}, DOI={<a href=\"https://doi.org/10.1007/bfb0002716\">10.1007/bfb0002716</a>}, booktitle={Euro-Par’97 Parallel Processing}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold}, year={1997} }","mla":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data Management in Networks.” <i>Euro-Par’97 Parallel Processing</i>, 1997, doi:<a href=\"https://doi.org/10.1007/bfb0002716\">10.1007/bfb0002716</a>.","short":"F. Meyer auf der Heide, B. Vöcking, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.","apa":"Meyer auf der Heide, F., &#38; Vöcking, B. (1997). Static and dynamic data management in networks. In <i>Euro-Par’97 Parallel Processing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/bfb0002716\">https://doi.org/10.1007/bfb0002716</a>","chicago":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data Management in Networks.” In <i>Euro-Par’97 Parallel Processing</i>. Berlin, Heidelberg, 1997. <a href=\"https://doi.org/10.1007/bfb0002716\">https://doi.org/10.1007/bfb0002716</a>.","ieee":"F. Meyer auf der Heide and B. Vöcking, “Static and dynamic data management in networks,” in <i>Euro-Par’97 Parallel Processing</i>, Berlin, Heidelberg, 1997.","ama":"Meyer auf der Heide F, Vöcking B. Static and dynamic data management in networks. In: <i>Euro-Par’97 Parallel Processing</i>. Berlin, Heidelberg; 1997. doi:<a href=\"https://doi.org/10.1007/bfb0002716\">10.1007/bfb0002716</a>"},"year":"1997","place":"Berlin, Heidelberg","author":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Vöcking, Berthold","last_name":"Vöcking","first_name":"Berthold"}],"date_created":"2020-04-15T11:47:28Z","date_updated":"2022-01-06T06:52:52Z","doi":"10.1007/bfb0002716","title":"Static and dynamic data management in networks","publication":"Euro-Par'97 Parallel Processing","type":"book_chapter","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"16569","language":[{"iso":"eng"}]},{"publication_status":"published","publication_identifier":{"isbn":["0897918908"]},"year":"1997","citation":{"apa":"Berenbrink, P., Meyer auf der Heide, F., &#38; Schröder, K. (1997). Allocating weighted jobs in parallel. In <i>Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’97</i>. <a href=\"https://doi.org/10.1145/258492.258522\">https://doi.org/10.1145/258492.258522</a>","bibtex":"@inproceedings{Berenbrink_Meyer auf der Heide_Schröder_1997, title={Allocating weighted jobs in parallel}, DOI={<a href=\"https://doi.org/10.1145/258492.258522\">10.1145/258492.258522</a>}, booktitle={Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’97}, author={Berenbrink, Petra and Meyer auf der Heide, Friedhelm and Schröder, Klaus}, year={1997} }","short":"P. Berenbrink, F. Meyer auf der Heide, K. Schröder, in: Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’97, 1997.","mla":"Berenbrink, Petra, et al. “Allocating Weighted Jobs in Parallel.” <i>Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’97</i>, 1997, doi:<a href=\"https://doi.org/10.1145/258492.258522\">10.1145/258492.258522</a>.","chicago":"Berenbrink, Petra, Friedhelm Meyer auf der Heide, and Klaus Schröder. “Allocating Weighted Jobs in Parallel.” In <i>Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’97</i>, 1997. <a href=\"https://doi.org/10.1145/258492.258522\">https://doi.org/10.1145/258492.258522</a>.","ieee":"P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, “Allocating weighted jobs in parallel,” in <i>Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’97</i>, 1997.","ama":"Berenbrink P, Meyer auf der Heide F, Schröder K. Allocating weighted jobs in parallel. In: <i>Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’97</i>. ; 1997. doi:<a href=\"https://doi.org/10.1145/258492.258522\">10.1145/258492.258522</a>"},"date_updated":"2022-01-06T06:52:53Z","date_created":"2020-04-16T06:18:07Z","author":[{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Schröder","full_name":"Schröder, Klaus","first_name":"Klaus"}],"title":"Allocating weighted jobs in parallel","doi":"10.1145/258492.258522","type":"conference","publication":"Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures  - SPAA '97","status":"public","_id":"16604","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}]},{"_id":"16605","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"book_chapter","publication":"Solving Irregularly Structured Problems in Parallel","status":"public","date_updated":"2022-01-06T06:52:53Z","author":[{"first_name":"Armin","last_name":"Bäumker","full_name":"Bäumker, Armin"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_created":"2020-04-16T06:22:32Z","title":"Communication efficient parallel searching","doi":"10.1007/3-540-63138-0_21","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540631385","9783540691570"]},"place":"Berlin, Heidelberg","year":"1997","citation":{"ieee":"A. Bäumker and F. Meyer auf der Heide, “Communication efficient parallel searching,” in <i>Solving Irregularly Structured Problems in Parallel</i>, Berlin, Heidelberg, 1997.","chicago":"Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.” In <i>Solving Irregularly Structured Problems in Parallel</i>. Berlin, Heidelberg, 1997. <a href=\"https://doi.org/10.1007/3-540-63138-0_21\">https://doi.org/10.1007/3-540-63138-0_21</a>.","ama":"Bäumker A, Meyer auf der Heide F. Communication efficient parallel searching. In: <i>Solving Irregularly Structured Problems in Parallel</i>. Berlin, Heidelberg; 1997. doi:<a href=\"https://doi.org/10.1007/3-540-63138-0_21\">10.1007/3-540-63138-0_21</a>","apa":"Bäumker, A., &#38; Meyer auf der Heide, F. (1997). Communication efficient parallel searching. In <i>Solving Irregularly Structured Problems in Parallel</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-63138-0_21\">https://doi.org/10.1007/3-540-63138-0_21</a>","bibtex":"@inbook{Bäumker_Meyer auf der Heide_1997, place={Berlin, Heidelberg}, title={Communication efficient parallel searching}, DOI={<a href=\"https://doi.org/10.1007/3-540-63138-0_21\">10.1007/3-540-63138-0_21</a>}, booktitle={Solving Irregularly Structured Problems in Parallel}, author={Bäumker, Armin and Meyer auf der Heide, Friedhelm}, year={1997} }","short":"A. Bäumker, F. Meyer auf der Heide, in: Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg, 1997.","mla":"Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.” <i>Solving Irregularly Structured Problems in Parallel</i>, 1997, doi:<a href=\"https://doi.org/10.1007/3-540-63138-0_21\">10.1007/3-540-63138-0_21</a>."}},{"status":"public","type":"book_chapter","publication":"Euro-Par'97 Parallel Processing","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16687","citation":{"ieee":"E. Karaivazoglou and F. Meyer auf der Heide, “Routing on asyncronous processor networks,” in <i>Euro-Par’97 Parallel Processing</i>, Berlin, Heidelberg, 1997.","chicago":"Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous Processor Networks.” In <i>Euro-Par’97 Parallel Processing</i>. Berlin, Heidelberg, 1997. <a href=\"https://doi.org/10.1007/bfb0002741\">https://doi.org/10.1007/bfb0002741</a>.","ama":"Karaivazoglou E, Meyer auf der Heide F. Routing on asyncronous processor networks. In: <i>Euro-Par’97 Parallel Processing</i>. Berlin, Heidelberg; 1997. doi:<a href=\"https://doi.org/10.1007/bfb0002741\">10.1007/bfb0002741</a>","bibtex":"@inbook{Karaivazoglou_Meyer auf der Heide_1997, place={Berlin, Heidelberg}, title={Routing on asyncronous processor networks}, DOI={<a href=\"https://doi.org/10.1007/bfb0002741\">10.1007/bfb0002741</a>}, booktitle={Euro-Par’97 Parallel Processing}, author={Karaivazoglou, Efstratios and Meyer auf der Heide, Friedhelm}, year={1997} }","mla":"Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous Processor Networks.” <i>Euro-Par’97 Parallel Processing</i>, 1997, doi:<a href=\"https://doi.org/10.1007/bfb0002741\">10.1007/bfb0002741</a>.","short":"E. Karaivazoglou, F. Meyer auf der Heide, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.","apa":"Karaivazoglou, E., &#38; Meyer auf der Heide, F. (1997). Routing on asyncronous processor networks. In <i>Euro-Par’97 Parallel Processing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/bfb0002741\">https://doi.org/10.1007/bfb0002741</a>"},"year":"1997","place":"Berlin, Heidelberg","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540634409","9783540695493"]},"doi":"10.1007/bfb0002741","title":"Routing on asyncronous processor networks","author":[{"first_name":"Efstratios","full_name":"Karaivazoglou, Efstratios","last_name":"Karaivazoglou"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_created":"2020-04-16T10:41:06Z","date_updated":"2022-01-06T06:52:54Z"},{"date_created":"2020-04-16T10:44:29Z","author":[{"first_name":"B.M.","full_name":"Maggs, B.M.","last_name":"Maggs"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Berthold","full_name":"Vöcking, Berthold","last_name":"Vöcking"},{"first_name":"Matthias","last_name":"Westermann","full_name":"Westermann, Matthias"}],"date_updated":"2022-01-06T06:52:54Z","doi":"10.1109/sfcs.1997.646117","title":"Exploiting locality for data management in systems of limited bandwidth","publication_identifier":{"isbn":["0818681977"]},"publication_status":"published","citation":{"ieee":"B. M. Maggs, F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Exploiting locality for data management in systems of limited bandwidth,” 1997, doi: <a href=\"https://doi.org/10.1109/sfcs.1997.646117\">10.1109/sfcs.1997.646117</a>.","chicago":"Maggs, B.M., Friedhelm Meyer auf der Heide, Berthold Vöcking, and Matthias Westermann. “Exploiting Locality for Data Management in Systems of Limited Bandwidth.” In <i>Proceedings 38th Annual Symposium on Foundations of Computer Science</i>, 1997. <a href=\"https://doi.org/10.1109/sfcs.1997.646117\">https://doi.org/10.1109/sfcs.1997.646117</a>.","ama":"Maggs BM, Meyer auf der Heide F, Vöcking B, Westermann M. Exploiting locality for data management in systems of limited bandwidth. In: <i>Proceedings 38th Annual Symposium on Foundations of Computer Science</i>. ; 1997. doi:<a href=\"https://doi.org/10.1109/sfcs.1997.646117\">10.1109/sfcs.1997.646117</a>","bibtex":"@inproceedings{Maggs_Meyer auf der Heide_Vöcking_Westermann_1997, title={Exploiting locality for data management in systems of limited bandwidth}, DOI={<a href=\"https://doi.org/10.1109/sfcs.1997.646117\">10.1109/sfcs.1997.646117</a>}, booktitle={Proceedings 38th Annual Symposium on Foundations of Computer Science}, author={Maggs, B.M. and Meyer auf der Heide, Friedhelm and Vöcking, Berthold and Westermann, Matthias}, year={1997} }","mla":"Maggs, B. M., et al. “Exploiting Locality for Data Management in Systems of Limited Bandwidth.” <i>Proceedings 38th Annual Symposium on Foundations of Computer Science</i>, 1997, doi:<a href=\"https://doi.org/10.1109/sfcs.1997.646117\">10.1109/sfcs.1997.646117</a>.","short":"B.M. Maggs, F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997.","apa":"Maggs, B. M., Meyer auf der Heide, F., Vöcking, B., &#38; Westermann, M. (1997). Exploiting locality for data management in systems of limited bandwidth. <i>Proceedings 38th Annual Symposium on Foundations of Computer Science</i>. <a href=\"https://doi.org/10.1109/sfcs.1997.646117\">https://doi.org/10.1109/sfcs.1997.646117</a>"},"year":"1997","department":[{"_id":"63"}],"user_id":"15415","_id":"16689","language":[{"iso":"eng"}],"publication":"Proceedings 38th Annual Symposium on Foundations of Computer Science","type":"conference","status":"public"},{"language":[{"iso":"eng"}],"_id":"16693","department":[{"_id":"63"}],"user_id":"15415","status":"public","publication":"Informatik ’97 Informatik als Innovationsmotor","type":"book_chapter","title":"Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications”","doi":"10.1007/978-3-642-60831-5_22","date_updated":"2022-01-06T06:52:54Z","date_created":"2020-04-16T10:48:16Z","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Thomas","last_name":"Decker","full_name":"Decker, Thomas"}],"year":"1997","place":"Berlin, Heidelberg","citation":{"ama":"Meyer auf der Heide F, Decker T. Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications.” In: <i>Informatik ’97 Informatik Als Innovationsmotor</i>. Berlin, Heidelberg; 1997. doi:<a href=\"https://doi.org/10.1007/978-3-642-60831-5_22\">10.1007/978-3-642-60831-5_22</a>","ieee":"F. Meyer auf der Heide and T. Decker, “Parallel Computing in Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications,’” in <i>Informatik ’97 Informatik als Innovationsmotor</i>, Berlin, Heidelberg, 1997.","chicago":"Meyer auf der Heide, Friedhelm, and Thomas Decker. “Parallel Computing in Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications.’” In <i>Informatik ’97 Informatik Als Innovationsmotor</i>. Berlin, Heidelberg, 1997. <a href=\"https://doi.org/10.1007/978-3-642-60831-5_22\">https://doi.org/10.1007/978-3-642-60831-5_22</a>.","short":"F. Meyer auf der Heide, T. Decker, in: Informatik ’97 Informatik Als Innovationsmotor, Berlin, Heidelberg, 1997.","bibtex":"@inbook{Meyer auf der Heide_Decker_1997, place={Berlin, Heidelberg}, title={Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications”}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-60831-5_22\">10.1007/978-3-642-60831-5_22</a>}, booktitle={Informatik ’97 Informatik als Innovationsmotor}, author={Meyer auf der Heide, Friedhelm and Decker, Thomas}, year={1997} }","mla":"Meyer auf der Heide, Friedhelm, and Thomas Decker. “Parallel Computing in Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications.’” <i>Informatik ’97 Informatik Als Innovationsmotor</i>, 1997, doi:<a href=\"https://doi.org/10.1007/978-3-642-60831-5_22\">10.1007/978-3-642-60831-5_22</a>.","apa":"Meyer auf der Heide, F., &#38; Decker, T. (1997). Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications.” In <i>Informatik ’97 Informatik als Innovationsmotor</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-60831-5_22\">https://doi.org/10.1007/978-3-642-60831-5_22</a>"},"publication_identifier":{"isbn":["9783540630661","9783642608315"],"issn":["1431-472X"]},"publication_status":"published"},{"type":"conference","status":"public","_id":"16568","user_id":"14972","series_title":"Lecture Notes in Computer Science","department":[{"_id":"63"}],"publication_status":"published","publication_identifier":{"isbn":["9783540633976","9783540695363"],"issn":["0302-9743","1611-3349"]},"place":"Berlin, Heidelberg","citation":{"apa":"Fischer, M., Meyer auf der Heide, F., &#38; Strothmann, W.-B. (1997). Dynamic data structures for realtime management of large geometric scenes. <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, <i>1284</i>, 157–170. <a href=\"https://doi.org/10.1007/3-540-63397-9_13\">https://doi.org/10.1007/3-540-63397-9_13</a>","short":"M. Fischer, F. Meyer auf der Heide, W.-B. Strothmann, in: 5th Annual European Symposium on Algorithms (ESA ’97), Springer, Berlin, Heidelberg, 1997, pp. 157–170.","mla":"Fischer, Matthias, et al. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, vol. 1284, Springer, 1997, pp. 157–70, doi:<a href=\"https://doi.org/10.1007/3-540-63397-9_13\">10.1007/3-540-63397-9_13</a>.","bibtex":"@inproceedings{Fischer_Meyer auf der Heide_Strothmann_1997, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Dynamic data structures for realtime management of large geometric scenes}, volume={1284}, DOI={<a href=\"https://doi.org/10.1007/3-540-63397-9_13\">10.1007/3-540-63397-9_13</a>}, booktitle={5th Annual European Symposium on Algorithms (ESA ’97)}, publisher={Springer}, author={Fischer, Matthias and Meyer auf der Heide, Friedhelm and Strothmann, Willy-Bernhard}, year={1997}, pages={157–170}, collection={Lecture Notes in Computer Science} }","ama":"Fischer M, Meyer auf der Heide F, Strothmann W-B. Dynamic data structures for realtime management of large geometric scenes. In: <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>. Vol 1284. Lecture Notes in Computer Science. Springer; 1997:157-170. doi:<a href=\"https://doi.org/10.1007/3-540-63397-9_13\">10.1007/3-540-63397-9_13</a>","ieee":"M. Fischer, F. Meyer auf der Heide, and W.-B. Strothmann, “Dynamic data structures for realtime management of large geometric scenes,” in <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, 1997, vol. 1284, pp. 157–170, doi: <a href=\"https://doi.org/10.1007/3-540-63397-9_13\">10.1007/3-540-63397-9_13</a>.","chicago":"Fischer, Matthias, Friedhelm Meyer auf der Heide, and Willy-Bernhard Strothmann. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” In <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, 1284:157–70. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 1997. <a href=\"https://doi.org/10.1007/3-540-63397-9_13\">https://doi.org/10.1007/3-540-63397-9_13</a>."},"page":"157-170","intvolume":"      1284","date_updated":"2026-02-23T16:05:33Z","author":[{"first_name":"Matthias","id":"146","full_name":"Fischer, Matthias","last_name":"Fischer"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Willy-Bernhard","last_name":"Strothmann","full_name":"Strothmann, Willy-Bernhard"}],"volume":1284,"doi":"10.1007/3-540-63397-9_13","publication":"5th Annual European Symposium on Algorithms (ESA '97)","abstract":[{"text":"We present a data structure problem which describes the requirements of a simple variant of fully dynamic walk-through animation: We assume the scene to consist of unit size balls in R2 or higher dimensions. The scene may be arbitrarily large and has to be stored in secondary memory (discs) with relatively slow access. We allow a visitor to walk in the scene, and a modeler to update the scene by insertions and deletions of balls. We focus on the realtime requirement of animation systems: For some t (specified by the computation power of (the rendering hardware of) the graphic workstation) the data structure has to guarantee that the balls within distance t of the current visitor's position are presented to the rendering hardware, 20 times per second. Insertions and deletions should also be available to the visitor with small delay, independent of the size of the scene. We present a data structure that fulfills the above task in realtime. Its runtime is output-sensitive, i.e. linear in a quantity close to the output size of the query. We further present (preliminary) experimental results indicating that our structure is efficient in practice.\r\n","lang":"eng"}],"language":[{"iso":"eng"}],"year":"1997","publisher":"Springer","date_created":"2020-04-15T11:44:36Z","title":"Dynamic data structures for realtime management of large geometric scenes"},{"date_updated":"2022-01-06T06:54:17Z","author":[{"first_name":"Frank","full_name":"Schwarze, Frank","last_name":"Schwarze"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Klaus","full_name":"Schröder, Klaus","last_name":"Schröder"}],"date_created":"2020-10-08T12:04:41Z","volume":"I","title":"Routing on Networks of Optical Crossbars (Extended Abstract).","year":"1996","citation":{"apa":"Schwarze, F., Meyer auf der Heide, F., &#38; Schröder, K. (1996). Routing on Networks of Optical Crossbars (Extended Abstract). <i>Euro-Par 1996</i>, <i>I</i>, 299–306.","mla":"Schwarze, Frank, et al. “Routing on Networks of Optical Crossbars (Extended Abstract).” <i>Euro-Par 1996</i>, vol. I, 1996, pp. 299–306.","bibtex":"@article{Schwarze_Meyer auf der Heide_Schröder_1996, title={Routing on Networks of Optical Crossbars (Extended Abstract).}, volume={I}, journal={Euro-Par 1996}, author={Schwarze, Frank and Meyer auf der Heide, Friedhelm and Schröder, Klaus}, year={1996}, pages={299–306} }","short":"F. Schwarze, F. Meyer auf der Heide, K. Schröder, Euro-Par 1996 I (1996) 299–306.","ama":"Schwarze F, Meyer auf der Heide F, Schröder K. Routing on Networks of Optical Crossbars (Extended Abstract). <i>Euro-Par 1996</i>. 1996;I:299-306.","chicago":"Schwarze, Frank, Friedhelm Meyer auf der Heide, and Klaus Schröder. “Routing on Networks of Optical Crossbars (Extended Abstract).” <i>Euro-Par 1996</i> I (1996): 299–306.","ieee":"F. Schwarze, F. Meyer auf der Heide, and K. Schröder, “Routing on Networks of Optical Crossbars (Extended Abstract).,” <i>Euro-Par 1996</i>, vol. I, pp. 299–306, 1996."},"page":"299-306","_id":"19958","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Euro-Par 1996","status":"public"},{"language":[{"iso":"eng"}],"_id":"17418","department":[{"_id":"63"}],"series_title":"Technical Report SFB, University of Paderborn","user_id":"15415","status":"public","type":"report","report_number":"tr-rsfb-96-005","title":"Contention Resolution in Hashing Based Shared Memory Simulations","date_updated":"2022-01-06T06:53:11Z","date_created":"2020-07-27T13:03:41Z","author":[{"full_name":"Czumaj, Artur","last_name":"Czumaj","first_name":"Artur"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Stemann, Volker","last_name":"Stemann","first_name":"Volker"}],"year":"1996","citation":{"chicago":"Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. <i>Contention Resolution in Hashing Based Shared Memory Simulations</i>. Technical Report SFB, University of Paderborn, 1996.","ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, <i>Contention Resolution in Hashing Based Shared Memory Simulations</i>. 1996.","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. <i>Contention Resolution in Hashing Based Shared Memory Simulations</i>.; 1996.","short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations, 1996.","bibtex":"@book{Czumaj_Meyer auf der Heide_Stemann_1996, series={Technical Report SFB, University of Paderborn}, title={Contention Resolution in Hashing Based Shared Memory Simulations}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1996}, collection={Technical Report SFB, University of Paderborn} }","mla":"Czumaj, Artur, et al. <i>Contention Resolution in Hashing Based Shared Memory Simulations</i>. 1996.","apa":"Czumaj, A., Meyer auf der Heide, F., &#38; Stemann, V. (1996). <i>Contention Resolution in Hashing Based Shared Memory Simulations</i>."}},{"language":[{"iso":"eng"}],"user_id":"15415","series_title":"Lecture Notes in Computer Science","department":[{"_id":"63"}],"_id":"17419","status":"public","abstract":[{"text":"We present a parallel algorithm for the rendering of complex three-dimensional scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting of a visualization-node, equipped with a powerful graphics adapter, and cluster nodes requiring weaker graphics capabilities only. The visualization-node renders a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes assist the visualization-node by asynchronous computing of Reliefboards, which are used to replace and render distant parts of the scene. Our algorithm is capable of gaining significant speedups if the cluster's nodes provide weak graphics adapters only. We trade the number of cluster nodes off the scene objects' image quality.","lang":"eng"}],"type":"conference","publication":"Proc. of 28th ACM-STOC","title":"A lower bound for randomized algebraic decision trees","author":[{"last_name":"Grigoriev","full_name":"Grigoriev, Dima","first_name":"Dima"},{"first_name":"Marek","full_name":"Karpinski, Marek","last_name":"Karpinski"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Roman","last_name":"Smolensky","full_name":"Smolensky, Roman"}],"date_created":"2020-07-27T13:09:09Z","volume":65453,"publisher":"Eurographics Symposium on Parallel Graphics and Visualization","date_updated":"2022-01-06T06:53:11Z","citation":{"apa":"Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., &#38; Smolensky, R. (1996). A lower bound for randomized algebraic decision trees. In <i>Proc. of 28th ACM-STOC</i> (Vol. 65453, pp. 612–621). Eurographics Symposium on Parallel Graphics and Visualization.","bibtex":"@inproceedings{Grigoriev_Karpinski_Meyer auf der Heide_Smolensky_1996, series={Lecture Notes in Computer Science}, title={A lower bound for randomized algebraic decision trees}, volume={65453}, booktitle={Proc. of 28th ACM-STOC}, publisher={Eurographics Symposium on Parallel Graphics and Visualization}, author={Grigoriev, Dima and Karpinski, Marek and Meyer auf der Heide, Friedhelm and Smolensky, Roman}, year={1996}, pages={612–621}, collection={Lecture Notes in Computer Science} }","mla":"Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.” <i>Proc. of 28th ACM-STOC</i>, vol. 65453, Eurographics Symposium on Parallel Graphics and Visualization, 1996, pp. 612–21.","short":"D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, in: Proc. of 28th ACM-STOC, Eurographics Symposium on Parallel Graphics and Visualization, 1996, pp. 612–621.","ieee":"D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower bound for randomized algebraic decision trees,” in <i>Proc. of 28th ACM-STOC</i>, 1996, vol. 65453, pp. 612–621.","chicago":"Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” In <i>Proc. of 28th ACM-STOC</i>, 65453:612–21. Lecture Notes in Computer Science. Eurographics Symposium on Parallel Graphics and Visualization, 1996.","ama":"Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound for randomized algebraic decision trees. In: <i>Proc. of 28th ACM-STOC</i>. Vol 65453. Lecture Notes in Computer Science. Eurographics Symposium on Parallel Graphics and Visualization; 1996:612-621."},"intvolume":"     65453","page":"612-621","year":"1996"}]