[{"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16720","status":"public","type":"conference","publication":"28th Annual IEEE International Conference on Local Computer Networks","doi":"10.1109/LCN.2003.1243185","title":"A holistic methodology for network processor design","author":[{"first_name":"Olaf","last_name":"Bonorden","full_name":"Bonorden, Olaf"},{"full_name":"Bruls, N.","last_name":"Bruls","first_name":"N."},{"last_name":"Kastens","full_name":"Kastens, U.","first_name":"U."},{"first_name":"D. K.","last_name":"Le","full_name":"Le, D. K."},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"last_name":"Niemann","full_name":"Niemann, J.-C.","first_name":"J.-C."},{"last_name":"Porrmann","full_name":"Porrmann, M.","first_name":"M."},{"last_name":"Rückert","full_name":"Rückert, U.","first_name":"U."},{"first_name":"A.","full_name":"Slowik, A.","last_name":"Slowik"},{"first_name":"M.","full_name":"Thies, M.","last_name":"Thies"}],"date_created":"2020-04-17T08:31:57Z","date_updated":"2022-01-06T06:52:55Z","citation":{"ama":"Bonorden O, Bruls N, Kastens U, et al. A holistic methodology for network processor design. In: <i>28th Annual IEEE International Conference on Local Computer Networks</i>. ; 2003. doi:<a href=\"https://doi.org/10.1109/LCN.2003.1243185\">10.1109/LCN.2003.1243185</a>","ieee":"O. Bonorden <i>et al.</i>, “A holistic methodology for network processor design,” in <i>28th Annual IEEE International Conference on Local Computer Networks</i>, 2003.","chicago":"Bonorden, Olaf, N. Bruls, U. Kastens, D. K. Le, Friedhelm Meyer auf der Heide, J.-C. Niemann, M. Porrmann, U. Rückert, A. Slowik, and M. Thies. “A Holistic Methodology for Network Processor Design.” In <i>28th Annual IEEE International Conference on Local Computer Networks</i>, 2003. <a href=\"https://doi.org/10.1109/LCN.2003.1243185\">https://doi.org/10.1109/LCN.2003.1243185</a>.","short":"O. Bonorden, N. Bruls, U. Kastens, D.K. Le, F. Meyer auf der Heide, J.-C. Niemann, M. Porrmann, U. Rückert, A. Slowik, M. Thies, in: 28th Annual IEEE International Conference on Local Computer Networks, 2003.","mla":"Bonorden, Olaf, et al. “A Holistic Methodology for Network Processor Design.” <i>28th Annual IEEE International Conference on Local Computer Networks</i>, 2003, doi:<a href=\"https://doi.org/10.1109/LCN.2003.1243185\">10.1109/LCN.2003.1243185</a>.","bibtex":"@inproceedings{Bonorden_Bruls_Kastens_Le_Meyer auf der Heide_Niemann_Porrmann_Rückert_Slowik_Thies_2003, title={A holistic methodology for network processor design}, DOI={<a href=\"https://doi.org/10.1109/LCN.2003.1243185\">10.1109/LCN.2003.1243185</a>}, booktitle={28th Annual IEEE International Conference on Local Computer Networks}, author={Bonorden, Olaf and Bruls, N. and Kastens, U. and Le, D. K. and Meyer auf der Heide, Friedhelm and Niemann, J.-C. and Porrmann, M. and Rückert, U. and Slowik, A. and Thies, M.}, year={2003} }","apa":"Bonorden, O., Bruls, N., Kastens, U., Le, D. K., Meyer auf der Heide, F., Niemann, J.-C., … Thies, M. (2003). A holistic methodology for network processor design. In <i>28th Annual IEEE International Conference on Local Computer Networks</i>. <a href=\"https://doi.org/10.1109/LCN.2003.1243185\">https://doi.org/10.1109/LCN.2003.1243185</a>"},"year":"2003"},{"title":"Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example","date_created":"2020-09-28T10:49:50Z","author":[{"full_name":"Bonorden, Olaf","last_name":"Bonorden","first_name":"Olaf"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Wanka, Rolf","last_name":"Wanka","first_name":"Rolf"}],"date_updated":"2022-01-06T06:54:10Z","citation":{"apa":"Bonorden, O., Meyer auf der Heide, F., &#38; Wanka, R. (2002). Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example. In <i>Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)</i> (pp. 2202–2208).","bibtex":"@inproceedings{Bonorden_Meyer auf der Heide_Wanka_2002, title={Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example}, booktitle={Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)}, author={Bonorden, Olaf and Meyer auf der Heide, Friedhelm and Wanka, Rolf}, year={2002}, pages={2202–2208} }","short":"O. Bonorden, F. Meyer auf der Heide, R. Wanka, in: Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA), 2002, pp. 2202–2208.","mla":"Bonorden, Olaf, et al. “Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example.” <i>Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)</i>, 2002, pp. 2202–08.","ama":"Bonorden O, Meyer auf der Heide F, Wanka R. Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example. In: <i>Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)</i>. ; 2002:2202-2208.","ieee":"O. Bonorden, F. Meyer auf der Heide, and R. Wanka, “Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example,” in <i>Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)</i>, 2002, pp. 2202–2208.","chicago":"Bonorden, Olaf, Friedhelm Meyer auf der Heide, and Rolf Wanka. “Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example.” In <i>Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)</i>, 2202–8, 2002."},"page":"2202-2208","year":"2002","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"19727","status":"public","type":"conference","publication":"Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)"},{"_id":"16489","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication":"Theory of Computing Systems","type":"journal_article","status":"public","date_updated":"2022-01-06T06:52:51Z","author":[{"first_name":"Christof","last_name":"Krick","full_name":"Krick, Christof"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Räcke, Harald","last_name":"Räcke","first_name":"Harald"},{"last_name":"Vöcking","full_name":"Vöcking, Bernhard","first_name":"Bernhard"},{"last_name":"Westermann","full_name":"Westermann, Matthias' ","first_name":"Matthias' "}],"date_created":"2020-04-09T10:03:55Z","title":"Data Management in Networks: Experimental Evaluation of a Provably Good Strategy","doi":"10.1007/s00224-001-1045-z","publication_identifier":{"issn":["1432-4350","1433-0490"]},"publication_status":"published","year":"2002","page":"217-245","citation":{"apa":"Krick, C., Meyer auf der Heide, F., Räcke, H., Vöcking, B., &#38; Westermann, M. (2002). Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. <i>Theory of Computing Systems</i>, 217–245. <a href=\"https://doi.org/10.1007/s00224-001-1045-z\">https://doi.org/10.1007/s00224-001-1045-z</a>","bibtex":"@article{Krick_Meyer auf der Heide_Räcke_Vöcking_Westermann_2002, title={Data Management in Networks: Experimental Evaluation of a Provably Good Strategy}, DOI={<a href=\"https://doi.org/10.1007/s00224-001-1045-z\">10.1007/s00224-001-1045-z</a>}, journal={Theory of Computing Systems}, author={Krick, Christof and Meyer auf der Heide, Friedhelm and Räcke, Harald and Vöcking, Bernhard and Westermann, Matthias’ }, year={2002}, pages={217–245} }","short":"C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, M. Westermann, Theory of Computing Systems (2002) 217–245.","mla":"Krick, Christof, et al. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.” <i>Theory of Computing Systems</i>, 2002, pp. 217–45, doi:<a href=\"https://doi.org/10.1007/s00224-001-1045-z\">10.1007/s00224-001-1045-z</a>.","chicago":"Krick, Christof, Friedhelm Meyer auf der Heide, Harald Räcke, Bernhard Vöcking, and Matthias’  Westermann. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.” <i>Theory of Computing Systems</i>, 2002, 217–45. <a href=\"https://doi.org/10.1007/s00224-001-1045-z\">https://doi.org/10.1007/s00224-001-1045-z</a>.","ieee":"C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, and M. Westermann, “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy,” <i>Theory of Computing Systems</i>, pp. 217–245, 2002, doi: <a href=\"https://doi.org/10.1007/s00224-001-1045-z\">10.1007/s00224-001-1045-z</a>.","ama":"Krick C, Meyer auf der Heide F, Räcke H, Vöcking B, Westermann M. Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. <i>Theory of Computing Systems</i>. Published online 2002:217-245. doi:<a href=\"https://doi.org/10.1007/s00224-001-1045-z\">10.1007/s00224-001-1045-z</a>"}},{"user_id":"15415","department":[{"_id":"63"}],"_id":"16490","language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the ACM symposium on Virtual reality software and technology  - VRST '02","status":"public","abstract":[{"text":"We present a new data structure for rendering highly complex virtual environments of arbitrary topology. The special feature of our approach is that it allows an interactive navigation in very large scenes (30 GB/400 million polygons in our benchmark scenes) that cannot be stored in main memory, but only on a local or remote hard disk. Furthermore, it allows interactive rendering of substantially more complex scenes by instantiating objects.\r\n\r\nFor the computation of an approximate image of the scene, a sampling technique is used. In the preprocessing, a so-called sample tree is built whose nodes contain randomly selected polygons from the scene. This tree only uses space that is linear in the number of polygons. In order to produce an image of the scene, the tree is traversed and polygons stored in the visited nodes are rendered. During the interactive walkthrough, parts of the sample tree are loaded from local or remote hard disk.\r\n\r\nWe implemented our algorithm in a prototypical walkthrough system. Analysis and experiments show that the quality of our images is comparable to images computed by the conventional z-buffer algorithm regardless of the scene topology.","lang":"eng"}],"author":[{"first_name":"Jan","full_name":"Klein, Jan","last_name":"Klein"},{"first_name":"Jens","full_name":"Krokowski, Jens","last_name":"Krokowski"},{"first_name":"Matthias","id":"146","full_name":"Fischer, Matthias","last_name":"Fischer"},{"first_name":"Michael","last_name":"Wand","full_name":"Wand, Michael"},{"first_name":"Rolf","full_name":"Wanka, Rolf","last_name":"Wanka"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2020-04-09T10:10:36Z","date_updated":"2022-01-06T06:52:51Z","doi":"10.1145/585740.585764","title":"The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments","publication_status":"published","publication_identifier":{"isbn":["1581135300"]},"citation":{"short":"J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, F. Meyer auf der Heide, in: Proceedings of the ACM Symposium on Virtual Reality Software and Technology  - VRST ’02, 2002.","bibtex":"@inproceedings{Klein_Krokowski_Fischer_Wand_Wanka_Meyer auf der Heide_2002, title={The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments}, DOI={<a href=\"https://doi.org/10.1145/585740.585764\">10.1145/585740.585764</a>}, booktitle={Proceedings of the ACM symposium on Virtual reality software and technology  - VRST ’02}, author={Klein, Jan and Krokowski, Jens and Fischer, Matthias and Wand, Michael and Wanka, Rolf and Meyer auf der Heide, Friedhelm}, year={2002} }","mla":"Klein, Jan, et al. “The Randomized Sample Tree: A Data Structure for Interactive Walkthroughs in Externally Stored Virtual Environments.” <i>Proceedings of the ACM Symposium on Virtual Reality Software and Technology  - VRST ’02</i>, 2002, doi:<a href=\"https://doi.org/10.1145/585740.585764\">10.1145/585740.585764</a>.","apa":"Klein, J., Krokowski, J., Fischer, M., Wand, M., Wanka, R., &#38; Meyer auf der Heide, F. (2002). The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments. In <i>Proceedings of the ACM symposium on Virtual reality software and technology  - VRST ’02</i>. <a href=\"https://doi.org/10.1145/585740.585764\">https://doi.org/10.1145/585740.585764</a>","chicago":"Klein, Jan, Jens Krokowski, Matthias Fischer, Michael Wand, Rolf Wanka, and Friedhelm Meyer auf der Heide. “The Randomized Sample Tree: A Data Structure for Interactive Walkthroughs in Externally Stored Virtual Environments.” In <i>Proceedings of the ACM Symposium on Virtual Reality Software and Technology  - VRST ’02</i>, 2002. <a href=\"https://doi.org/10.1145/585740.585764\">https://doi.org/10.1145/585740.585764</a>.","ieee":"J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, and F. Meyer auf der Heide, “The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments,” in <i>Proceedings of the ACM symposium on Virtual reality software and technology  - VRST ’02</i>, 2002.","ama":"Klein J, Krokowski J, Fischer M, Wand M, Wanka R, Meyer auf der Heide F. The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments. In: <i>Proceedings of the ACM Symposium on Virtual Reality Software and Technology  - VRST ’02</i>. ; 2002. doi:<a href=\"https://doi.org/10.1145/585740.585764\">10.1145/585740.585764</a>"},"year":"2002"},{"year":"2002","citation":{"apa":"Meyer auf der Heide, F., Schindelhauer, C., Volbert, K., &#38; Grünewald, M. (2002). Energy, congestion and dilation in radio networks. In <i>Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’02</i>. <a href=\"https://doi.org/10.1145/564870.564910\">https://doi.org/10.1145/564870.564910</a>","mla":"Meyer auf der Heide, Friedhelm, et al. “Energy, Congestion and Dilation in Radio Networks.” <i>Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’02</i>, 2002, doi:<a href=\"https://doi.org/10.1145/564870.564910\">10.1145/564870.564910</a>.","bibtex":"@inproceedings{Meyer auf der Heide_Schindelhauer_Volbert_Grünewald_2002, title={Energy, congestion and dilation in radio networks}, DOI={<a href=\"https://doi.org/10.1145/564870.564910\">10.1145/564870.564910</a>}, booktitle={Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’02}, author={Meyer auf der Heide, Friedhelm and Schindelhauer, Christian and Volbert, Klaus and Grünewald, Matthias}, year={2002} }","short":"F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, M. Grünewald, in: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’02, 2002.","ieee":"F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, and M. Grünewald, “Energy, congestion and dilation in radio networks,” in <i>Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’02</i>, 2002.","chicago":"Meyer auf der Heide, Friedhelm, Christian Schindelhauer, Klaus Volbert, and Matthias Grünewald. “Energy, Congestion and Dilation in Radio Networks.” In <i>Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’02</i>, 2002. <a href=\"https://doi.org/10.1145/564870.564910\">https://doi.org/10.1145/564870.564910</a>.","ama":"Meyer auf der Heide F, Schindelhauer C, Volbert K, Grünewald M. Energy, congestion and dilation in radio networks. In: <i>Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’02</i>. ; 2002. doi:<a href=\"https://doi.org/10.1145/564870.564910\">10.1145/564870.564910</a>"},"publication_status":"published","publication_identifier":{"isbn":["1581135297"]},"title":"Energy, congestion and dilation in radio networks","doi":"10.1145/564870.564910","date_updated":"2022-01-06T06:52:51Z","date_created":"2020-04-09T10:30:23Z","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Christian","full_name":"Schindelhauer, Christian","last_name":"Schindelhauer"},{"first_name":"Klaus","full_name":"Volbert, Klaus","last_name":"Volbert"},{"full_name":"Grünewald, Matthias","last_name":"Grünewald","first_name":"Matthias"}],"status":"public","type":"conference","publication":"Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA '02","language":[{"iso":"eng"}],"_id":"16491","user_id":"15415","department":[{"_id":"63"}]},{"doi":"10.1007/3-540-45706-2_133","title":"Mobile Computing, Mobile Networks","date_created":"2020-04-17T11:40:33Z","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Mohan","full_name":"Kumar, Mohan","last_name":"Kumar"},{"full_name":"Nikoletseas, Sotiris","last_name":"Nikoletseas","first_name":"Sotiris"},{"last_name":"Spirakis","full_name":"Spirakis, Paul","first_name":"Paul"}],"date_updated":"2022-01-06T06:52:55Z","citation":{"apa":"Meyer auf der Heide, F., Kumar, M., Nikoletseas, S., &#38; Spirakis, P. (2002). Mobile Computing, Mobile Networks. In <i>Euro-Par 2002 Parallel Processing</i> (Lecture Notes in Computer Science, vol 2400). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45706-2_133\">https://doi.org/10.1007/3-540-45706-2_133</a>","bibtex":"@inbook{Meyer auf der Heide_Kumar_Nikoletseas_Spirakis_2002, place={Berlin, Heidelberg}, edition={Lecture Notes in Computer Science, vol 2400}, title={Mobile Computing, Mobile Networks}, DOI={<a href=\"https://doi.org/10.1007/3-540-45706-2_133\">10.1007/3-540-45706-2_133</a>}, booktitle={Euro-Par 2002 Parallel Processing}, author={Meyer auf der Heide, Friedhelm and Kumar, Mohan and Nikoletseas, Sotiris and Spirakis, Paul}, year={2002} }","short":"F. Meyer auf der Heide, M. Kumar, S. Nikoletseas, P. Spirakis, in: Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400, Berlin, Heidelberg, 2002.","mla":"Meyer auf der Heide, Friedhelm, et al. “Mobile Computing, Mobile Networks.” <i>Euro-Par 2002 Parallel Processing</i>, Lecture Notes in Computer Science, vol 2400, 2002, doi:<a href=\"https://doi.org/10.1007/3-540-45706-2_133\">10.1007/3-540-45706-2_133</a>.","ama":"Meyer auf der Heide F, Kumar M, Nikoletseas S, Spirakis P. Mobile Computing, Mobile Networks. In: <i>Euro-Par 2002 Parallel Processing</i>. Lecture Notes in Computer Science, vol 2400. Berlin, Heidelberg; 2002. doi:<a href=\"https://doi.org/10.1007/3-540-45706-2_133\">10.1007/3-540-45706-2_133</a>","chicago":"Meyer auf der Heide, Friedhelm, Mohan Kumar, Sotiris Nikoletseas, and Paul Spirakis. “Mobile Computing, Mobile Networks.” In <i>Euro-Par 2002 Parallel Processing</i>, Lecture Notes in Computer Science, vol 2400. Berlin, Heidelberg, 2002. <a href=\"https://doi.org/10.1007/3-540-45706-2_133\">https://doi.org/10.1007/3-540-45706-2_133</a>.","ieee":"F. Meyer auf der Heide, M. Kumar, S. Nikoletseas, and P. Spirakis, “Mobile Computing, Mobile Networks,” in <i>Euro-Par 2002 Parallel Processing</i>, Lecture Notes in Computer Science, vol 2400., Berlin, Heidelberg, 2002."},"year":"2002","place":"Berlin, Heidelberg","edition":"Lecture Notes in Computer Science, vol 2400","publication_identifier":{"isbn":["9783540440499","9783540457060"],"issn":["0302-9743"]},"publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16723","status":"public","publication":"Euro-Par 2002 Parallel Processing","type":"book_chapter"},{"issue":"1","intvolume":"        21","page":"95--138","citation":{"ieee":"F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols,” <i>Combinatorica</i>, vol. 21, no. 1, pp. 95--138, 2001.","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” <i>Combinatorica</i> 21, no. 1 (2001): 95--138. <a href=\"https://doi.org/10.1007/s004930170007\">https://doi.org/10.1007/s004930170007</a>.","ama":"Meyer auf der Heide F, Scheideler C. Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. <i>Combinatorica</i>. 2001;21(1):95--138. doi:<a href=\"https://doi.org/10.1007/s004930170007\">10.1007/s004930170007</a>","bibtex":"@article{Meyer auf der Heide_Scheideler_2001, title={Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols}, volume={21}, DOI={<a href=\"https://doi.org/10.1007/s004930170007\">10.1007/s004930170007</a>}, number={1}, journal={Combinatorica}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2001}, pages={95--138} }","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” <i>Combinatorica</i>, vol. 21, no. 1, 2001, pp. 95--138, doi:<a href=\"https://doi.org/10.1007/s004930170007\">10.1007/s004930170007</a>.","short":"F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138.","apa":"Meyer auf der Heide, F., &#38; Scheideler, C. (2001). Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. <i>Combinatorica</i>, <i>21</i>(1), 95--138. <a href=\"https://doi.org/10.1007/s004930170007\">https://doi.org/10.1007/s004930170007</a>"},"year":"2001","volume":21,"author":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"date_created":"2018-04-03T05:47:20Z","date_updated":"2022-01-06T06:54:57Z","doi":"10.1007/s004930170007","title":"Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols","publication":"Combinatorica","type":"journal_article","status":"public","department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","_id":"2139","language":[{"iso":"eng"}]},{"status":"public","abstract":[{"lang":"eng","text":"We present a new output-sensitive rendering algorithm, the randomized z-buffer algorithm. It renders an image of an arbitrary three-dimensional scene consisting of triangular primitives by reconstruction from a dynamically chosen set of random surface sample points. This approach is independent of mesh connectivity and topology. The resulting rendering time grows only logarithmically with the numbers of triangles in the scene. We were able to render walkthroughs of scenes of up to 10^14 triangles at interactive frame rates. Automatic identification of low detail scene components ensures that the rendering speed of the randomized z-buffer cannot drop below that of conventional z-buffer rendering. Experimental and analytical evidence is given that the image quality is comparable to that of common approaches like z-buffer rendering. The precomputed data structures employed by the randomized z-buffer allow for interactive dynamic updates of the scene. Their memory requirements grow only linearly with the number of triangles and allow for a scene graph based instantiation scheme to further reduce memory consumption."}],"publication":"Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH '01","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16492","citation":{"chicago":"Wand, Michael, Matthias Fischer, Ingmar Peter, Friedhelm Meyer auf der Heide, and Wolfgang Straßer. “The Randomized Z-Buffer Algorithm.” In <i>Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01</i>, 2001. <a href=\"https://doi.org/10.1145/383259.383299\">https://doi.org/10.1145/383259.383299</a>.","ieee":"M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, and W. Straßer, “The randomized z-buffer algorithm,” in <i>Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH ’01</i>, 2001.","ama":"Wand M, Fischer M, Peter I, Meyer auf der Heide F, Straßer W. The randomized z-buffer algorithm. In: <i>Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01</i>. ; 2001. doi:<a href=\"https://doi.org/10.1145/383259.383299\">10.1145/383259.383299</a>","short":"M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, W. Straßer, in: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01, 2001.","mla":"Wand, Michael, et al. “The Randomized Z-Buffer Algorithm.” <i>Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01</i>, 2001, doi:<a href=\"https://doi.org/10.1145/383259.383299\">10.1145/383259.383299</a>.","bibtex":"@inproceedings{Wand_Fischer_Peter_Meyer auf der Heide_Straßer_2001, title={The randomized z-buffer algorithm}, DOI={<a href=\"https://doi.org/10.1145/383259.383299\">10.1145/383259.383299</a>}, booktitle={Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH ’01}, author={Wand, Michael and Fischer, Matthias and Peter, Ingmar and Meyer auf der Heide, Friedhelm and Straßer, Wolfgang}, year={2001} }","apa":"Wand, M., Fischer, M., Peter, I., Meyer auf der Heide, F., &#38; Straßer, W. (2001). The randomized z-buffer algorithm. In <i>Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH ’01</i>. <a href=\"https://doi.org/10.1145/383259.383299\">https://doi.org/10.1145/383259.383299</a>"},"year":"2001","publication_identifier":{"isbn":["158113374X"]},"publication_status":"published","doi":"10.1145/383259.383299","title":"The randomized z-buffer algorithm","date_created":"2020-04-09T10:36:54Z","author":[{"full_name":"Wand, Michael","last_name":"Wand","first_name":"Michael"},{"last_name":"Fischer","id":"146","full_name":"Fischer, Matthias","first_name":"Matthias"},{"full_name":"Peter, Ingmar","last_name":"Peter","first_name":"Ingmar"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Wolfgang","full_name":"Straßer, Wolfgang","last_name":"Straßer"}],"date_updated":"2022-01-06T06:52:51Z"},{"publication":"Graph-Theoretic Concepts in Computer Science","type":"book_chapter","status":"public","_id":"16493","department":[{"_id":"63"}],"series_title":" Lecture Notes in Computer Science","user_id":"15415","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0302-9743"],"isbn":["9783540427070","9783540454779"]},"publication_status":"published","year":"2001","place":"Berlin, Heidelberg","intvolume":"      2204","citation":{"ama":"Meyer auf der Heide F. Data Management in Networks. In: <i>Graph-Theoretic Concepts in Computer Science</i>. Vol 2204.  Lecture Notes in Computer Science. Berlin, Heidelberg; 2001. doi:<a href=\"https://doi.org/10.1007/3-540-45477-2_2\">10.1007/3-540-45477-2_2</a>","chicago":"Meyer auf der Heide, Friedhelm. “Data Management in Networks.” In <i>Graph-Theoretic Concepts in Computer Science</i>, Vol. 2204.  Lecture Notes in Computer Science. Berlin, Heidelberg, 2001. <a href=\"https://doi.org/10.1007/3-540-45477-2_2\">https://doi.org/10.1007/3-540-45477-2_2</a>.","ieee":"F. Meyer auf der Heide, “Data Management in Networks,” in <i>Graph-Theoretic Concepts in Computer Science</i>, vol. 2204, Berlin, Heidelberg, 2001.","apa":"Meyer auf der Heide, F. (2001). Data Management in Networks. In <i>Graph-Theoretic Concepts in Computer Science</i> (Vol. 2204). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45477-2_2\">https://doi.org/10.1007/3-540-45477-2_2</a>","bibtex":"@inbook{Meyer auf der Heide_2001, place={Berlin, Heidelberg}, series={ Lecture Notes in Computer Science}, title={Data Management in Networks}, volume={2204}, DOI={<a href=\"https://doi.org/10.1007/3-540-45477-2_2\">10.1007/3-540-45477-2_2</a>}, booktitle={Graph-Theoretic Concepts in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={2001}, collection={ Lecture Notes in Computer Science} }","short":"F. Meyer auf der Heide, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 2001.","mla":"Meyer auf der Heide, Friedhelm. “Data Management in Networks.” <i>Graph-Theoretic Concepts in Computer Science</i>, vol. 2204, 2001, doi:<a href=\"https://doi.org/10.1007/3-540-45477-2_2\">10.1007/3-540-45477-2_2</a>."},"date_updated":"2022-01-06T06:52:51Z","volume":2204,"author":[{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2020-04-09T10:40:48Z","title":"Data Management in Networks","doi":"10.1007/3-540-45477-2_2"},{"status":"public","type":"book_chapter","publication":"Computational Science - ICCS 2001","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16494","citation":{"ama":"Meyer auf der Heide F, Wanka R. Parallel Bridging Models and Their Impact on Algorithm Design. In: <i>Computational Science - ICCS 2001</i>. Berlin, Heidelberg; 2001. doi:<a href=\"https://doi.org/10.1007/3-540-45718-6_68\">10.1007/3-540-45718-6_68</a>","chicago":"Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and Their Impact on Algorithm Design.” In <i>Computational Science - ICCS 2001</i>. Berlin, Heidelberg, 2001. <a href=\"https://doi.org/10.1007/3-540-45718-6_68\">https://doi.org/10.1007/3-540-45718-6_68</a>.","ieee":"F. Meyer auf der Heide and R. Wanka, “Parallel Bridging Models and Their Impact on Algorithm Design,” in <i>Computational Science - ICCS 2001</i>, Berlin, Heidelberg, 2001.","apa":"Meyer auf der Heide, F., &#38; Wanka, R. (2001). Parallel Bridging Models and Their Impact on Algorithm Design. In <i>Computational Science - ICCS 2001</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45718-6_68\">https://doi.org/10.1007/3-540-45718-6_68</a>","short":"F. Meyer auf der Heide, R. Wanka, in: Computational Science - ICCS 2001, Berlin, Heidelberg, 2001.","mla":"Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and Their Impact on Algorithm Design.” <i>Computational Science - ICCS 2001</i>, 2001, doi:<a href=\"https://doi.org/10.1007/3-540-45718-6_68\">10.1007/3-540-45718-6_68</a>.","bibtex":"@inbook{Meyer auf der Heide_Wanka_2001, place={Berlin, Heidelberg}, title={Parallel Bridging Models and Their Impact on Algorithm Design}, DOI={<a href=\"https://doi.org/10.1007/3-540-45718-6_68\">10.1007/3-540-45718-6_68</a>}, booktitle={Computational Science - ICCS 2001}, author={Meyer auf der Heide, Friedhelm and Wanka, Rolf}, year={2001} }"},"year":"2001","place":"Berlin, Heidelberg","publication_status":"published","publication_identifier":{"isbn":["9783540422334","9783540457183"],"issn":["0302-9743"]},"doi":"10.1007/3-540-45718-6_68","title":"Parallel Bridging Models and Their Impact on Algorithm Design","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Wanka","full_name":"Wanka, Rolf","first_name":"Rolf"}],"date_created":"2020-04-09T10:51:36Z","date_updated":"2022-01-06T06:52:51Z"},{"user_id":"15415","department":[{"_id":"63"}],"_id":"16722","language":[{"iso":"eng"}],"type":"book_editor","status":"public","editor":[{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"date_created":"2020-04-17T10:59:08Z","date_updated":"2022-01-06T06:52:55Z","publisher":"Springer ","doi":"10.1007/3-540-44676-1","title":"Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark","edition":"Lecture Notes in Computer Science (LNCS, volume 2161)","publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540424932","9783540446767"]},"citation":{"bibtex":"@book{Meyer auf der Heide_2001, place={Berlin, Heidelberg}, edition={Lecture Notes in Computer Science (LNCS, volume 2161)}, title={Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark}, DOI={<a href=\"https://doi.org/10.1007/3-540-44676-1\">10.1007/3-540-44676-1</a>}, publisher={Springer }, year={2001} }","mla":"Meyer auf der Heide, Friedhelm, editor. <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i>. Lecture Notes in Computer Science (LNCS, Volume 2161), Springer , 2001, doi:<a href=\"https://doi.org/10.1007/3-540-44676-1\">10.1007/3-540-44676-1</a>.","short":"F. Meyer auf der Heide, ed., Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark, Lecture Notes in Computer Science (LNCS, volume 2161), Springer , Berlin, Heidelberg, 2001.","apa":"Meyer auf der Heide, F. (Ed.). (2001). <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i> (Lecture Notes in Computer Science (LNCS, volume 2161)). Berlin, Heidelberg: Springer . <a href=\"https://doi.org/10.1007/3-540-44676-1\">https://doi.org/10.1007/3-540-44676-1</a>","ama":"Meyer auf der Heide F, ed. <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i>. Lecture Notes in Computer Science (LNCS, volume 2161). Berlin, Heidelberg: Springer ; 2001. doi:<a href=\"https://doi.org/10.1007/3-540-44676-1\">10.1007/3-540-44676-1</a>","chicago":"Meyer auf der Heide, Friedhelm, ed. <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i>. Lecture Notes in Computer Science (LNCS, Volume 2161). Berlin, Heidelberg: Springer , 2001. <a href=\"https://doi.org/10.1007/3-540-44676-1\">https://doi.org/10.1007/3-540-44676-1</a>.","ieee":"F. Meyer auf der Heide, Ed., <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i>, Lecture Notes in Computer Science (LNCS, Volume 2161). Berlin, Heidelberg: Springer , 2001."},"place":"Berlin, Heidelberg","year":"2001"},{"type":"report","file":[{"date_updated":"2020-08-12T13:27:33Z","date_created":"2020-08-12T13:27:33Z","creator":"koala","file_size":921817,"access_level":"closed","file_id":"17866","file_name":"tr-ri-00-217.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","abstract":[{"text":"We present a new output-sensitive rendering algorithm, the randomized z-buffer algorithm. It renders an image of a three dimensional scene of triangular primitives by reconstruction from a random sample of surface points which are chosen with a probability proportional to the projected area of the objects. The approach is independent of mesh connectivity and topology. It leads to a rendering time that grows only logarithmically with the numbers of triangles in the scene and to linear memory consumption, thus allowing walkthroughs of scenes of extreme complexity. We consider different methods for image reconstruction which aim at correctness, rendering speed and image quality and we develop an efficient data structure for sample extraction in output-sensitive time which allows for efficient dynamic updates of the scene. Experiments confirm that scenes consisting of some hundred billion triangles can be rendered within seconds with an image quality comparable to a conventional z-buffer rendering; in special cases, realtime performance can be achieved.","lang":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"17865","file_date_updated":"2020-08-12T13:27:33Z","language":[{"iso":"eng"}],"ddc":["000"],"has_accepted_license":"1","citation":{"ama":"Wand M, Fischer M, Meyer auf der Heide F. <i>Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes</i>. Universität Paderborn; 2000.","ieee":"M. Wand, M. Fischer, and F. Meyer auf der Heide, <i>Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes</i>. Universität Paderborn, 2000.","chicago":"Wand, Michael, Matthias Fischer, and Friedhelm Meyer auf der Heide. <i>Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes</i>. Universität Paderborn, 2000.","short":"M. Wand, M. Fischer, F. Meyer auf der Heide, Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes, Universität Paderborn, 2000.","mla":"Wand, Michael, et al. <i>Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes</i>. 2000.","bibtex":"@book{Wand_Fischer_Meyer auf der Heide_2000, place={Universität Paderborn}, title={Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes}, author={Wand, Michael and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2000} }","apa":"Wand, M., Fischer, M., &#38; Meyer auf der Heide, F. (2000). <i>Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes</i>. Universität Paderborn."},"year":"2000","place":"Universität Paderborn","author":[{"full_name":"Wand, Michael","last_name":"Wand","first_name":"Michael"},{"last_name":"Fischer","id":"146","full_name":"Fischer, Matthias","first_name":"Matthias"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2020-08-12T13:27:52Z","date_updated":"2022-01-06T06:53:21Z","title":"Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes"},{"title":"Data management in hierarchical bus networks","doi":"10.1145/341800.341814","date_updated":"2022-01-06T06:52:51Z","author":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Räcke","full_name":"Räcke, Harald","first_name":"Harald"},{"first_name":"Matthias","full_name":"Westermann, Matthias","last_name":"Westermann"}],"date_created":"2020-04-09T13:06:23Z","year":"2000","citation":{"chicago":"Meyer auf der Heide, Friedhelm, Harald Räcke, and Matthias Westermann. “Data Management in Hierarchical Bus Networks.” In <i>Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00</i>, 2000. <a href=\"https://doi.org/10.1145/341800.341814\">https://doi.org/10.1145/341800.341814</a>.","ieee":"F. Meyer auf der Heide, H. Räcke, and M. Westermann, “Data management in hierarchical bus networks,” 2000, doi: <a href=\"https://doi.org/10.1145/341800.341814\">10.1145/341800.341814</a>.","ama":"Meyer auf der Heide F, Räcke H, Westermann M. Data management in hierarchical bus networks. In: <i>Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00</i>. ; 2000. doi:<a href=\"https://doi.org/10.1145/341800.341814\">10.1145/341800.341814</a>","short":"F. Meyer auf der Heide, H. Räcke, M. Westermann, in: Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00, 2000.","bibtex":"@inproceedings{Meyer auf der Heide_Räcke_Westermann_2000, title={Data management in hierarchical bus networks}, DOI={<a href=\"https://doi.org/10.1145/341800.341814\">10.1145/341800.341814</a>}, booktitle={Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’00}, author={Meyer auf der Heide, Friedhelm and Räcke, Harald and Westermann, Matthias}, year={2000} }","mla":"Meyer auf der Heide, Friedhelm, et al. “Data Management in Hierarchical Bus Networks.” <i>Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00</i>, 2000, doi:<a href=\"https://doi.org/10.1145/341800.341814\">10.1145/341800.341814</a>.","apa":"Meyer auf der Heide, F., Räcke, H., &#38; Westermann, M. (2000). Data management in hierarchical bus networks. <i>Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00</i>. <a href=\"https://doi.org/10.1145/341800.341814\">https://doi.org/10.1145/341800.341814</a>"},"publication_identifier":{"isbn":["1581131852"]},"publication_status":"published","language":[{"iso":"eng"}],"_id":"16495","department":[{"_id":"63"}],"user_id":"15415","status":"public","publication":"Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures  - SPAA '00","type":"conference"},{"publication":"SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms","type":"conference","status":"public","abstract":[{"lang":"eng","text":"We present a general framework for the development of on-line algorithms for data management in networks with limited memory capacities. These algorithms dynamically create and delete copies of shared data objects that can be read and written by the nodes in the network. Our algorithms aim to minimize the congestion, i.e., the maximum communication load over all network resources, so that that none of these resources become a communication bottleneck. We give several examples of networks for which our framework yields efficient algorithms, including meshes, fat-trees, hypercubic networks, and complete networks. For example, our framework yields an $O(d cdot log n)$-competitive caching algorithm for $d$-dimensional meshes of size $n$ with respect to the congestion on the communication links, and an $O(1)$-competitive algorithms for complete networks with respect to the congestion at the memory modules due to remote accesses. Previous work on data management in networks either neglects memory capacity constraints or minimizes only the total communication load, i.e., the sum of the communication load over all resources, which may produce congestion as some of the links become bottlenecks."}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16496","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["0898714532"]},"page":"430–439","citation":{"apa":"Meyer auf der Heide, F., Vöcking, B., &#38; Westermann, M. (2000). Caching in networks. In <i>SODA ’00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms</i> (pp. 430–439).","mla":"Meyer auf der Heide, Friedhelm, et al. “Caching in Networks.” <i>SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2000, pp. 430–439.","bibtex":"@inproceedings{Meyer auf der Heide_Vöcking_Westermann_2000, title={Caching in networks}, booktitle={SODA ’00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold and Westermann, Matthias}, year={2000}, pages={430–439} }","short":"F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 430–439.","ama":"Meyer auf der Heide F, Vöcking B, Westermann M. Caching in networks. In: <i>SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms</i>. ; 2000:430–439.","ieee":"F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Caching in networks,” in <i>SODA ’00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms</i>, 2000, pp. 430–439.","chicago":"Meyer auf der Heide, Friedhelm, Berthold Vöcking, and Matthias Westermann. “Caching in Networks.” In <i>SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 430–439, 2000."},"year":"2000","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Vöcking, Berthold","last_name":"Vöcking","first_name":"Berthold"},{"full_name":"Westermann, Matthias","last_name":"Westermann","first_name":"Matthias"}],"date_created":"2020-04-09T13:16:15Z","date_updated":"2022-01-06T06:52:51Z","title":"Caching in networks"},{"author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Mirosław","full_name":"Kutyłowski, Mirosław","last_name":"Kutyłowski"},{"first_name":"Prabhakar","full_name":"Ragde, Prabhakar","last_name":"Ragde"}],"date_created":"2020-04-09T13:30:45Z","date_updated":"2022-01-06T06:52:51Z","doi":"10.1007/3-540-44520-x_59","title":"Complexity Theory and Algorithms","publication_status":"published","publication_identifier":{"isbn":["9783540679561","9783540445203"],"issn":["0302-9743"]},"citation":{"apa":"Meyer auf der Heide, F., Kutyłowski, M., &#38; Ragde, P. (2000). Complexity Theory and Algorithms. In <i>Euro-Par 2000 Parallel Processing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-44520-x_59\">https://doi.org/10.1007/3-540-44520-x_59</a>","bibtex":"@inbook{Meyer auf der Heide_Kutyłowski_Ragde_2000, place={Berlin, Heidelberg}, title={Complexity Theory and Algorithms}, DOI={<a href=\"https://doi.org/10.1007/3-540-44520-x_59\">10.1007/3-540-44520-x_59</a>}, booktitle={Euro-Par 2000 Parallel Processing}, author={Meyer auf der Heide, Friedhelm and Kutyłowski, Mirosław and Ragde, Prabhakar}, year={2000} }","mla":"Meyer auf der Heide, Friedhelm, et al. “Complexity Theory and Algorithms.” <i>Euro-Par 2000 Parallel Processing</i>, 2000, doi:<a href=\"https://doi.org/10.1007/3-540-44520-x_59\">10.1007/3-540-44520-x_59</a>.","short":"F. Meyer auf der Heide, M. Kutyłowski, P. Ragde, in: Euro-Par 2000 Parallel Processing, Berlin, Heidelberg, 2000.","ama":"Meyer auf der Heide F, Kutyłowski M, Ragde P. Complexity Theory and Algorithms. In: <i>Euro-Par 2000 Parallel Processing</i>. Berlin, Heidelberg; 2000. doi:<a href=\"https://doi.org/10.1007/3-540-44520-x_59\">10.1007/3-540-44520-x_59</a>","chicago":"Meyer auf der Heide, Friedhelm, Mirosław Kutyłowski, and Prabhakar Ragde. “Complexity Theory and Algorithms.” In <i>Euro-Par 2000 Parallel Processing</i>. Berlin, Heidelberg, 2000. <a href=\"https://doi.org/10.1007/3-540-44520-x_59\">https://doi.org/10.1007/3-540-44520-x_59</a>.","ieee":"F. Meyer auf der Heide, M. Kutyłowski, and P. Ragde, “Complexity Theory and Algorithms,” in <i>Euro-Par 2000 Parallel Processing</i>, Berlin, Heidelberg, 2000."},"place":"Berlin, Heidelberg","year":"2000","user_id":"15415","department":[{"_id":"63"}],"_id":"16497","language":[{"iso":"eng"}],"type":"book_chapter","publication":"Euro-Par 2000 Parallel Processing","status":"public"},{"status":"public","type":"journal_article","publication":"SIAM Journal on Computing","language":[{"iso":"eng"}],"_id":"17010","user_id":"15415","department":[{"_id":"63"}],"year":"2000","citation":{"apa":"Czumaj, A., Meyer auf der Heide, F., &#38; Stemann, V. (2000). Contention Resolution in Hashing Based Shared Memory Simulations. <i>SIAM Journal on Computing</i>, 1703–1739. <a href=\"https://doi.org/10.1137/s009753979529564x\">https://doi.org/10.1137/s009753979529564x</a>","mla":"Czumaj, Artur, et al. “Contention Resolution in Hashing Based Shared Memory Simulations.” <i>SIAM Journal on Computing</i>, 2000, pp. 1703–39, doi:<a href=\"https://doi.org/10.1137/s009753979529564x\">10.1137/s009753979529564x</a>.","short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, SIAM Journal on Computing (2000) 1703–1739.","bibtex":"@article{Czumaj_Meyer auf der Heide_Stemann_2000, title={Contention Resolution in Hashing Based Shared Memory Simulations}, DOI={<a href=\"https://doi.org/10.1137/s009753979529564x\">10.1137/s009753979529564x</a>}, journal={SIAM Journal on Computing}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={2000}, pages={1703–1739} }","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. Contention Resolution in Hashing Based Shared Memory Simulations. <i>SIAM Journal on Computing</i>. 2000:1703-1739. doi:<a href=\"https://doi.org/10.1137/s009753979529564x\">10.1137/s009753979529564x</a>","ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Contention Resolution in Hashing Based Shared Memory Simulations,” <i>SIAM Journal on Computing</i>, pp. 1703–1739, 2000.","chicago":"Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Contention Resolution in Hashing Based Shared Memory Simulations.” <i>SIAM Journal on Computing</i>, 2000, 1703–39. <a href=\"https://doi.org/10.1137/s009753979529564x\">https://doi.org/10.1137/s009753979529564x</a>."},"page":"1703-1739","publication_status":"published","publication_identifier":{"issn":["0097-5397","1095-7111"]},"title":"Contention Resolution in Hashing Based Shared Memory Simulations","doi":"10.1137/s009753979529564x","date_updated":"2022-01-06T06:53:01Z","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"}],"date_created":"2020-05-18T13:47:36Z"},{"article_type":"original","ddc":["000"],"file_date_updated":"2020-08-04T13:17:46Z","language":[{"iso":"eng"}],"_id":"16345","user_id":"15415","department":[{"_id":"63"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":477845,"file_name":"FFP-06-2000.pdf","file_id":"17588","access_level":"closed","date_updated":"2020-08-04T13:17:46Z","date_created":"2020-08-04T13:17:46Z","creator":"koala"}],"status":"public","type":"journal_article","publication":"ForschungsForum Paderborn","title":"Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik","date_updated":"2022-01-06T06:52:49Z","author":[{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Wanka","full_name":"Wanka, Rolf","first_name":"Rolf"}],"date_created":"2020-03-24T10:59:27Z","year":"2000","citation":{"ama":"Meyer auf der Heide F, Wanka R. Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik. <i>ForschungsForum Paderborn</i>. 2000:112-116.","chicago":"Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Von Der Hollerith-Maschine Zum Parallelrechner - Die Alltägliche Aufgabe Des Sortierens Als Fortschrittsmotor Für Die Informatik.” <i>ForschungsForum Paderborn</i>, 2000, 112–16.","ieee":"F. Meyer auf der Heide and R. Wanka, “Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik,” <i>ForschungsForum Paderborn</i>, pp. 112–116, 2000.","apa":"Meyer auf der Heide, F., &#38; Wanka, R. (2000). Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik. <i>ForschungsForum Paderborn</i>, 112–116.","bibtex":"@article{Meyer auf der Heide_Wanka_2000, title={Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik}, journal={ForschungsForum Paderborn}, author={Meyer auf der Heide, Friedhelm and Wanka, Rolf}, year={2000}, pages={112–116} }","mla":"Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Von Der Hollerith-Maschine Zum Parallelrechner - Die Alltägliche Aufgabe Des Sortierens Als Fortschrittsmotor Für Die Informatik.” <i>ForschungsForum Paderborn</i>, 2000, pp. 112–16.","short":"F. Meyer auf der Heide, R. Wanka, ForschungsForum Paderborn (2000) 112–116."},"page":"112-116","publication_identifier":{"unknown":["ISBN 978-3-942647-99-1"]},"has_accepted_license":"1"},{"year":"1999","citation":{"chicago":"Krick, Christof, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, and Matthias Westermann. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.” In <i>Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’99</i>, 165–74, 1999. <a href=\"https://doi.org/10.1145/305619.305637\">https://doi.org/10.1145/305619.305637</a>.","ieee":"C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, and M. Westermann, “Data management in networks: experimental evaluation of a provably good strategy,” in <i>Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’99</i>, 1999, pp. 165–174.","ama":"Krick C, Meyer auf der Heide F, Räcke H, Vöcking B, Westermann M. Data management in networks: experimental evaluation of a provably good strategy. In: <i>Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’99</i>. ; 1999:165-174. doi:<a href=\"https://doi.org/10.1145/305619.305637\">10.1145/305619.305637</a>","mla":"Krick, Christof, et al. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.” <i>Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’99</i>, 1999, pp. 165–74, doi:<a href=\"https://doi.org/10.1145/305619.305637\">10.1145/305619.305637</a>.","short":"C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, M. Westermann, in: Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’99, 1999, pp. 165–174.","bibtex":"@inproceedings{Krick_Meyer auf der Heide_Räcke_Vöcking_Westermann_1999, title={Data management in networks: experimental evaluation of a provably good strategy}, DOI={<a href=\"https://doi.org/10.1145/305619.305637\">10.1145/305619.305637</a>}, booktitle={Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’99}, author={Krick, Christof and Meyer auf der Heide, Friedhelm and Räcke, Harald and Vöcking, Berthold and Westermann, Matthias}, year={1999}, pages={165–174} }","apa":"Krick, C., Meyer auf der Heide, F., Räcke, H., Vöcking, B., &#38; Westermann, M. (1999). Data management in networks: experimental evaluation of a provably good strategy. In <i>Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’99</i> (pp. 165–174). <a href=\"https://doi.org/10.1145/305619.305637\">https://doi.org/10.1145/305619.305637</a>"},"page":"165-174","publication_status":"published","publication_identifier":{"isbn":["1581131240"]},"title":"Data management in networks: experimental evaluation of a provably good strategy","doi":"10.1145/305619.305637","date_updated":"2022-01-06T06:53:56Z","date_created":"2020-09-03T14:27:14Z","author":[{"full_name":"Krick, Christof","last_name":"Krick","first_name":"Christof"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Räcke","full_name":"Räcke, Harald","first_name":"Harald"},{"last_name":"Vöcking","full_name":"Vöcking, Berthold","first_name":"Berthold"},{"last_name":"Westermann","full_name":"Westermann, Matthias","first_name":"Matthias"}],"status":"public","type":"conference","publication":"Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures  - SPAA '99","language":[{"iso":"eng"}],"_id":"18965","user_id":"15415","department":[{"_id":"63"}]},{"citation":{"ieee":"F. Meyer auf der Heide and B. Vöcking, “Shortest-Path Routing in Arbitrary Networks,” <i>Journal of Algorithms</i>, pp. 105–131, 1999.","chicago":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Shortest-Path Routing in Arbitrary Networks.” <i>Journal of Algorithms</i>, 1999, 105–31. <a href=\"https://doi.org/10.1006/jagm.1998.0980\">https://doi.org/10.1006/jagm.1998.0980</a>.","ama":"Meyer auf der Heide F, Vöcking B. Shortest-Path Routing in Arbitrary Networks. <i>Journal of Algorithms</i>. 1999:105-131. doi:<a href=\"https://doi.org/10.1006/jagm.1998.0980\">10.1006/jagm.1998.0980</a>","apa":"Meyer auf der Heide, F., &#38; Vöcking, B. (1999). Shortest-Path Routing in Arbitrary Networks. <i>Journal of Algorithms</i>, 105–131. <a href=\"https://doi.org/10.1006/jagm.1998.0980\">https://doi.org/10.1006/jagm.1998.0980</a>","bibtex":"@article{Meyer auf der Heide_Vöcking_1999, title={Shortest-Path Routing in Arbitrary Networks}, DOI={<a href=\"https://doi.org/10.1006/jagm.1998.0980\">10.1006/jagm.1998.0980</a>}, journal={Journal of Algorithms}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold}, year={1999}, pages={105–131} }","short":"F. Meyer auf der Heide, B. Vöcking, Journal of Algorithms (1999) 105–131.","mla":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Shortest-Path Routing in Arbitrary Networks.” <i>Journal of Algorithms</i>, 1999, pp. 105–31, doi:<a href=\"https://doi.org/10.1006/jagm.1998.0980\">10.1006/jagm.1998.0980</a>."},"page":"105-131","year":"1999","publication_status":"published","publication_identifier":{"issn":["0196-6774"]},"doi":"10.1006/jagm.1998.0980","title":"Shortest-Path Routing in Arbitrary Networks","date_created":"2020-04-14T11:50:52Z","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Vöcking","full_name":"Vöcking, Berthold","first_name":"Berthold"}],"date_updated":"2022-01-06T06:52:52Z","status":"public","type":"journal_article","publication":"Journal of Algorithms","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16501"},{"year":"1999","citation":{"ama":"Berenbrink P, Meyer auf der Heide F, Schröder K. Allocating Weighted Jobs in Parallel. <i>Theory of Computing Systems</i>. 1999:281-300. doi:<a href=\"https://doi.org/10.1007/s002240000119\">10.1007/s002240000119</a>","chicago":"Berenbrink, P., Friedhelm Meyer auf der Heide, and K. Schröder. “Allocating Weighted Jobs in Parallel.” <i>Theory of Computing Systems</i>, 1999, 281–300. <a href=\"https://doi.org/10.1007/s002240000119\">https://doi.org/10.1007/s002240000119</a>.","ieee":"P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, “Allocating Weighted Jobs in Parallel,” <i>Theory of Computing Systems</i>, pp. 281–300, 1999.","mla":"Berenbrink, P., et al. “Allocating Weighted Jobs in Parallel.” <i>Theory of Computing Systems</i>, 1999, pp. 281–300, doi:<a href=\"https://doi.org/10.1007/s002240000119\">10.1007/s002240000119</a>.","short":"P. Berenbrink, F. Meyer auf der Heide, K. Schröder, Theory of Computing Systems (1999) 281–300.","bibtex":"@article{Berenbrink_Meyer auf der Heide_Schröder_1999, title={Allocating Weighted Jobs in Parallel}, DOI={<a href=\"https://doi.org/10.1007/s002240000119\">10.1007/s002240000119</a>}, journal={Theory of Computing Systems}, author={Berenbrink, P. and Meyer auf der Heide, Friedhelm and Schröder, K.}, year={1999}, pages={281–300} }","apa":"Berenbrink, P., Meyer auf der Heide, F., &#38; Schröder, K. (1999). Allocating Weighted Jobs in Parallel. <i>Theory of Computing Systems</i>, 281–300. <a href=\"https://doi.org/10.1007/s002240000119\">https://doi.org/10.1007/s002240000119</a>"},"page":"281-300","publication_status":"published","publication_identifier":{"issn":["1432-4350","1433-0490"]},"title":"Allocating Weighted Jobs in Parallel","doi":"10.1007/s002240000119","date_updated":"2022-01-06T06:52:52Z","date_created":"2020-04-14T12:00:32Z","author":[{"last_name":"Berenbrink","full_name":"Berenbrink, P.","first_name":"P."},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"first_name":"K.","full_name":"Schröder, K.","last_name":"Schröder"}],"status":"public","type":"journal_article","publication":"Theory of Computing Systems","language":[{"iso":"eng"}],"_id":"16502","user_id":"15415","department":[{"_id":"63"}]}]