[{"date_created":"2020-09-04T10:45:47Z","type":"conference","department":[{"_id":"63"}],"publication":"Dagstuhl Seminar Proceedings 10261: Algorithm Engineering","citation":{"mla":"Gehweiler, Joachim, and Henning Meyerhenke. “On Dynamic Graph Partitioning and Graph Clustering Using Diffusion.” <i>Dagstuhl Seminar Proceedings 10261: Algorithm Engineering</i>, 2010.","ama":"Gehweiler J, Meyerhenke H. On Dynamic Graph Partitioning and Graph Clustering using Diffusion. In: <i>Dagstuhl Seminar Proceedings 10261: Algorithm Engineering</i>. ; 2010.","bibtex":"@inproceedings{Gehweiler_Meyerhenke_2010, title={On Dynamic Graph Partitioning and Graph Clustering using Diffusion}, booktitle={Dagstuhl Seminar Proceedings 10261: Algorithm Engineering}, author={Gehweiler, Joachim and Meyerhenke, Henning}, year={2010} }","apa":"Gehweiler, J., &#38; Meyerhenke, H. (2010). On Dynamic Graph Partitioning and Graph Clustering using Diffusion. In <i>Dagstuhl Seminar Proceedings 10261: Algorithm Engineering</i>.","ieee":"J. Gehweiler and H. Meyerhenke, “On Dynamic Graph Partitioning and Graph Clustering using Diffusion,” in <i>Dagstuhl Seminar Proceedings 10261: Algorithm Engineering</i>, 2010.","chicago":"Gehweiler, Joachim, and Henning Meyerhenke. “On Dynamic Graph Partitioning and Graph Clustering Using Diffusion.” In <i>Dagstuhl Seminar Proceedings 10261: Algorithm Engineering</i>, 2010.","short":"J. Gehweiler, H. Meyerhenke, in: Dagstuhl Seminar Proceedings 10261: Algorithm Engineering, 2010."},"related_material":{"link":[{"relation":"confirmation","url":"https://drops.dagstuhl.de/opus/volltexte/2010/2798/pdf/10261.MeyerhenkeHenning.Paper.2798.pdf"}]},"abstract":[{"text":"Load balancing is an important requirement for the efficient execu-tion of parallel numerical simulations. In particular when the simulation domainchanges over time, the mapping of computational tasks to processors needs tobe  modified  accordingly.  State-of-the-art  libraries  for  this  problem  are  basedon graph repartitioning. They have a number of drawbacks, including the opti-mized metric and the difficulty of parallelizing the popular repartitioning heuris-tic Kernighan-Lin (KL).Here we further explore the very promising diffusion-based graph partitioningalgorithm DIBAP (Meyerhenke et al., JPDC 69(9):750–761, 2009) by adaptingDIBAP  to  the  related  problem  of  load  balancing.  Experiments  with  graph  se-quences that imitate adaptive numerical simulations demonstrate the applicabilityand high quality of DIBAP for load balancing by repartitioning. Compared to thefaster state-of-the-art repartitioners PARMETIS and parallel JOSTLE, DIBAP’ssolutions have partitions with significantly fewer external edges and boundarynodes  and  the  resulting  average  migration  volume  in  the  important  maximumnorm is also the best in most cases.We also prove that one of DIBAP’s key components optimizes a relaxed versionof the minimum edge cut problem. Moreover, we hint at a distributed algorithmbased on ideas used in DIBAP for clustering a virtual P2P supercomputer.","lang":"eng"}],"language":[{"iso":"eng"}],"_id":"19016","user_id":"15415","year":"2010","status":"public","title":"On Dynamic Graph Partitioning and Graph Clustering using Diffusion","author":[{"full_name":"Gehweiler, Joachim","last_name":"Gehweiler","first_name":"Joachim"},{"last_name":"Meyerhenke","first_name":"Henning","full_name":"Meyerhenke, Henning"}],"date_updated":"2022-01-06T06:53:57Z"},{"title":"Thread Migration and Checkpointing in Java","year":"2010","status":"public","author":[{"first_name":"Michael","last_name":"Thies","full_name":"Thies, Michael"},{"last_name":"Gehweiler","first_name":"Joachim","full_name":"Gehweiler, Joachim"}],"date_updated":"2022-01-06T06:53:57Z","has_accepted_license":"1","language":[{"iso":"eng"}],"_id":"19018","ddc":["000"],"user_id":"15415","file_date_updated":"2020-09-04T10:54:26Z","citation":{"mla":"Thies, Michael, and Joachim Gehweiler. <i>Thread Migration and Checkpointing in Java</i>. 2010.","bibtex":"@book{Thies_Gehweiler_2010, title={Thread Migration and Checkpointing in Java}, author={Thies, Michael and Gehweiler, Joachim}, year={2010} }","ama":"Thies M, Gehweiler J. <i>Thread Migration and Checkpointing in Java</i>.; 2010.","ieee":"M. Thies and J. Gehweiler, <i>Thread Migration and Checkpointing in Java</i>. 2010.","apa":"Thies, M., &#38; Gehweiler, J. (2010). <i>Thread Migration and Checkpointing in Java</i>.","chicago":"Thies, Michael, and Joachim Gehweiler. <i>Thread Migration and Checkpointing in Java</i>, 2010.","short":"M. Thies, J. Gehweiler, Thread Migration and Checkpointing in Java, 2010."},"file":[{"date_created":"2020-09-04T10:54:26Z","creator":"koala","file_id":"19020","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2020-09-04T10:54:26Z","file_name":"tr-ri-10-315.pdf","access_level":"closed","file_size":240725}],"date_created":"2020-09-04T10:54:43Z","type":"report","department":[{"_id":"63"}]},{"author":[{"first_name":"Serge","last_name":"Kernbach","full_name":"Kernbach, Serge"},{"full_name":"Schmickl, Thomas","last_name":"Schmickl","first_name":"Thomas"},{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"},{"first_name":"Jürgen","last_name":"Stradner","full_name":"Stradner, Jürgen"},{"full_name":"Schlachter, Florian","first_name":"Florian","last_name":"Schlachter"},{"full_name":"Schwarzer, Christopher s. F.","last_name":"Schwarzer","first_name":"Christopher s. F."},{"full_name":"Winfield, Alan F. T.","first_name":"Alan F. T.","last_name":"Winfield"},{"full_name":"Matthias, Rene","last_name":"Matthias","first_name":"Rene"}],"status":"public","title":"Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics","year":"2010","publication_status":"published","date_updated":"2022-01-06T06:53:57Z","_id":"19023","language":[{"iso":"eng"}],"publisher":"MIT Press","page":"781-788","user_id":"15415","citation":{"short":"S. Kernbach, T. Schmickl, H. Hamann, J. Stradner, F. Schlachter, C. s. F. Schwarzer, A.F.T. Winfield, R. Matthias, in: Artificial Life XII (ALife XII), MIT Press, 2010, pp. 781–788.","ama":"Kernbach S, Schmickl T, Hamann H, et al. Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics. In: <i>Artificial Life XII (ALife XII)</i>. MIT Press; 2010:781-788.","chicago":"Kernbach, Serge, Thomas Schmickl, Heiko Hamann, Jürgen Stradner, Florian Schlachter, Christopher s. F. Schwarzer, Alan F. T. Winfield, and Rene Matthias. “Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics.” In <i>Artificial Life XII (ALife XII)</i>, 781–88. MIT Press, 2010.","bibtex":"@inproceedings{Kernbach_Schmickl_Hamann_Stradner_Schlachter_Schwarzer_Winfield_Matthias_2010, title={Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics}, booktitle={Artificial Life XII (ALife XII)}, publisher={MIT Press}, author={Kernbach, Serge and Schmickl, Thomas and Hamann, Heiko and Stradner, Jürgen and Schlachter, Florian and Schwarzer, Christopher s. F. and Winfield, Alan F. T. and Matthias, Rene}, year={2010}, pages={781–788} }","apa":"Kernbach, S., Schmickl, T., Hamann, H., Stradner, J., Schlachter, F., Schwarzer, C. s. F., … Matthias, R. (2010). Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics. In <i>Artificial Life XII (ALife XII)</i> (pp. 781–788). MIT Press.","mla":"Kernbach, Serge, et al. “Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics.” <i>Artificial Life XII (ALife XII)</i>, MIT Press, 2010, pp. 781–88.","ieee":"S. Kernbach <i>et al.</i>, “Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics,” in <i>Artificial Life XII (ALife XII)</i>, 2010, pp. 781–788."},"publication":"Artificial Life XII (ALife XII)","date_created":"2020-09-04T11:53:40Z","department":[{"_id":"63"},{"_id":"238"}],"type":"conference"},{"date_updated":"2022-01-06T06:53:57Z","publication_status":"published","title":"Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing","year":"2010","status":"public","author":[{"last_name":"Briest","first_name":"Patrick","full_name":"Briest, Patrick"},{"last_name":"Chalermsook","first_name":"Parinya","full_name":"Chalermsook, Parinya"},{"first_name":"Sanjeev","last_name":"Khanna","full_name":"Khanna, Sanjeev"},{"last_name":"Laekhanukit","first_name":"Bundit","full_name":"Laekhanukit, Bundit"},{"full_name":"Nanongkai, Danupon","first_name":"Danupon","last_name":"Nanongkai"}],"publication_identifier":{"isbn":["9783642175718","9783642175725"],"issn":["0302-9743","1611-3349"]},"doi":"10.1007/978-3-642-17572-5_37","user_id":"15415","_id":"19029","language":[{"iso":"eng"}],"publication":"Workshop on Internet and Network Economics (WINE)","citation":{"short":"P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, D. Nanongkai, in: Workshop on Internet and Network Economics (WINE), 2010.","chicago":"Briest, Patrick, Parinya Chalermsook, Sanjeev Khanna, Bundit Laekhanukit, and Danupon Nanongkai. “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.” In <i>Workshop on Internet and Network Economics (WINE)</i>, 2010. <a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">https://doi.org/10.1007/978-3-642-17572-5_37</a>.","ieee":"P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, and D. Nanongkai, “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing,” in <i>Workshop on Internet and Network Economics (WINE)</i>, 2010.","apa":"Briest, P., Chalermsook, P., Khanna, S., Laekhanukit, B., &#38; Nanongkai, D. (2010). Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. In <i>Workshop on Internet and Network Economics (WINE)</i>. <a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">https://doi.org/10.1007/978-3-642-17572-5_37</a>","bibtex":"@inproceedings{Briest_Chalermsook_Khanna_Laekhanukit_Nanongkai_2010, title={Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">10.1007/978-3-642-17572-5_37</a>}, booktitle={Workshop on Internet and Network Economics (WINE)}, author={Briest, Patrick and Chalermsook, Parinya and Khanna, Sanjeev and Laekhanukit, Bundit and Nanongkai, Danupon}, year={2010} }","ama":"Briest P, Chalermsook P, Khanna S, Laekhanukit B, Nanongkai D. Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. In: <i>Workshop on Internet and Network Economics (WINE)</i>. ; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">10.1007/978-3-642-17572-5_37</a>","mla":"Briest, Patrick, et al. “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.” <i>Workshop on Internet and Network Economics (WINE)</i>, 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">10.1007/978-3-642-17572-5_37</a>."},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-09-04T12:01:18Z"},{"type":"journal_article","department":[{"_id":"79"},{"_id":"63"}],"date_created":"2018-03-28T07:21:50Z","issue":"5","publication":"Informatik Spektrum","citation":{"apa":"Meyer auf der Heide, F., &#38; Scheideler, C. (2010). Algorithmische Grundlagen verteilter Speichersysteme. <i>Informatik Spektrum</i>, (5), 468--474. <a href=\"https://doi.org/10.1007/s00287-010-0470-2\">https://doi.org/10.1007/s00287-010-0470-2</a>","ieee":"F. Meyer auf der Heide and C. Scheideler, “Algorithmische Grundlagen verteilter Speichersysteme,” <i>Informatik Spektrum</i>, no. 5, pp. 468--474, 2010.","short":"F. Meyer auf der Heide, C. Scheideler, Informatik Spektrum (2010) 468--474.","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen Verteilter Speichersysteme.” <i>Informatik Spektrum</i>, no. 5 (2010): 468--474. <a href=\"https://doi.org/10.1007/s00287-010-0470-2\">https://doi.org/10.1007/s00287-010-0470-2</a>.","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen Verteilter Speichersysteme.” <i>Informatik Spektrum</i>, no. 5, 2010, pp. 468--474, doi:<a href=\"https://doi.org/10.1007/s00287-010-0470-2\">10.1007/s00287-010-0470-2</a>.","ama":"Meyer auf der Heide F, Scheideler C. Algorithmische Grundlagen verteilter Speichersysteme. <i>Informatik Spektrum</i>. 2010;(5):468--474. doi:<a href=\"https://doi.org/10.1007/s00287-010-0470-2\">10.1007/s00287-010-0470-2</a>","bibtex":"@article{Meyer auf der Heide_Scheideler_2010, title={Algorithmische Grundlagen verteilter Speichersysteme}, DOI={<a href=\"https://doi.org/10.1007/s00287-010-0470-2\">10.1007/s00287-010-0470-2</a>}, number={5}, journal={Informatik Spektrum}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2010}, pages={468--474} }"},"user_id":"14955","doi":"10.1007/s00287-010-0470-2","page":"468--474","language":[{"iso":"eng"}],"_id":"1903","date_updated":"2022-01-06T06:53:57Z","year":"2010","title":"Algorithmische Grundlagen verteilter Speichersysteme","status":"public","author":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}]},{"date_created":"2020-09-04T12:15:39Z","department":[{"_id":"63"}],"type":"conference","citation":{"ieee":"P. Briest, S. Chawla, R. Kleinberg, and S. M. Weinberg, “Pricing Randomized Allocations,” in <i>Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2010.","apa":"Briest, P., Chawla, S., Kleinberg, R., &#38; Weinberg, S. M. (2010). Pricing Randomized Allocations. In <i>Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms</i>. <a href=\"https://doi.org/10.1137/1.9781611973075.49\">https://doi.org/10.1137/1.9781611973075.49</a>","mla":"Briest, Patrick, et al. “Pricing Randomized Allocations.” <i>Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2010, doi:<a href=\"https://doi.org/10.1137/1.9781611973075.49\">10.1137/1.9781611973075.49</a>.","bibtex":"@inproceedings{Briest_Chawla_Kleinberg_Weinberg_2010, title={Pricing Randomized Allocations}, DOI={<a href=\"https://doi.org/10.1137/1.9781611973075.49\">10.1137/1.9781611973075.49</a>}, booktitle={Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms}, author={Briest, Patrick and Chawla, Shuchi and Kleinberg, Robert and Weinberg, S. Matthew}, year={2010} }","ama":"Briest P, Chawla S, Kleinberg R, Weinberg SM. Pricing Randomized Allocations. In: <i>Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms</i>. ; 2010. doi:<a href=\"https://doi.org/10.1137/1.9781611973075.49\">10.1137/1.9781611973075.49</a>","short":"P. Briest, S. Chawla, R. Kleinberg, S.M. Weinberg, in: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010.","chicago":"Briest, Patrick, Shuchi Chawla, Robert Kleinberg, and S. Matthew Weinberg. “Pricing Randomized Allocations.” In <i>Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2010. <a href=\"https://doi.org/10.1137/1.9781611973075.49\">https://doi.org/10.1137/1.9781611973075.49</a>."},"publication":"Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms","language":[{"iso":"eng"}],"_id":"19033","doi":"10.1137/1.9781611973075.49","user_id":"15415","author":[{"last_name":"Briest","first_name":"Patrick","full_name":"Briest, Patrick"},{"full_name":"Chawla, Shuchi","first_name":"Shuchi","last_name":"Chawla"},{"full_name":"Kleinberg, Robert","first_name":"Robert","last_name":"Kleinberg"},{"full_name":"Weinberg, S. Matthew","first_name":"S. Matthew","last_name":"Weinberg"}],"publication_identifier":{"isbn":["9780898717013","9781611973075"]},"status":"public","year":"2010","title":"Pricing Randomized Allocations","date_updated":"2022-01-06T06:53:57Z","publication_status":"published"},{"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"citation":{"chicago":"Mahlmann, Peter. <i>Peer-to-Peer Networks Based on Random Graphs</i>. Vol. 283. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","short":"P. Mahlmann, Peer-to-Peer Networks Based on Random Graphs, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","ieee":"P. Mahlmann, <i>Peer-to-peer networks based on random graphs</i>, vol. 283. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","apa":"Mahlmann, P. (2010). <i>Peer-to-peer networks based on random graphs</i> (Vol. 283). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","bibtex":"@book{Mahlmann_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Peer-to-peer networks based on random graphs}, volume={283}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Mahlmann, Peter}, year={2010}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Mahlmann P. <i>Peer-to-Peer Networks Based on Random Graphs</i>. Vol 283. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2010.","mla":"Mahlmann, Peter. <i>Peer-to-Peer Networks Based on Random Graphs</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010."},"related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20100421015"}]},"date_created":"2020-09-04T14:05:30Z","type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"status":"public","year":"2010","title":"Peer-to-peer networks based on random graphs","author":[{"first_name":"Peter","last_name":"Mahlmann","full_name":"Mahlmann, Peter"}],"publication_identifier":{"isbn":["978-3-942647-02-1"]},"date_updated":"2022-01-06T06:53:57Z","intvolume":"       283","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"19041","language":[{"iso":"eng"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","volume":283},{"volume":278,"user_id":"5786","_id":"19042","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"intvolume":"       278","date_updated":"2022-01-06T06:53:57Z","publication_identifier":{"isbn":["978-3-939350-97-2 "]},"author":[{"first_name":"Bastian","last_name":"Degener","full_name":"Degener, Bastian"}],"status":"public","title":"Local, distributed approximation algorithms for geometric assignment problems","year":"2010","department":[{"_id":"63"},{"_id":"26"}],"type":"dissertation","date_created":"2020-09-04T14:08:57Z","related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20100429011"}]},"citation":{"ama":"Degener B. <i>Local, Distributed Approximation Algorithms for Geometric Assignment Problems</i>. Vol 278. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2010.","bibtex":"@book{Degener_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Local, distributed approximation algorithms for geometric assignment problems}, volume={278}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Degener, Bastian}, year={2010}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Degener, Bastian. <i>Local, Distributed Approximation Algorithms for Geometric Assignment Problems</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","short":"B. Degener, Local, Distributed Approximation Algorithms for Geometric Assignment Problems, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","chicago":"Degener, Bastian. <i>Local, Distributed Approximation Algorithms for Geometric Assignment Problems</i>. Vol. 278. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","apa":"Degener, B. (2010). <i>Local, distributed approximation algorithms for geometric assignment problems</i> (Vol. 278). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"B. Degener, <i>Local, distributed approximation algorithms for geometric assignment problems</i>, vol. 278. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010."},"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}]},{"type":"conference","department":[{"_id":"63"}],"date_created":"2020-08-24T07:07:55Z","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"}],"publication":"Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)","citation":{"apa":"Fischer, M., Jähn, C., &#38; Suess, T. (2010). Asynchronous Parallel Reliefboard Computation for Scene Object Approximation. <i>Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)</i>, 43–51. <a href=\"https://doi.org/10.2312/EGPGV/EGPGV10/043-051\">https://doi.org/10.2312/EGPGV/EGPGV10/043-051</a>","mla":"Fischer, Matthias, et al. “Asynchronous Parallel Reliefboard Computation for Scene Object Approximation.” <i>Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)</i>, The Eurographics Association, 2010, pp. 43–51, doi:<a href=\"https://doi.org/10.2312/EGPGV/EGPGV10/043-051\">10.2312/EGPGV/EGPGV10/043-051</a>.","ieee":"M. Fischer, C. Jähn, and T. Suess, “Asynchronous Parallel Reliefboard Computation for Scene Object Approximation,” in <i>Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)</i>, 2010, pp. 43–51, doi: <a href=\"https://doi.org/10.2312/EGPGV/EGPGV10/043-051\">10.2312/EGPGV/EGPGV10/043-051</a>.","ama":"Fischer M, Jähn C, Suess T. Asynchronous Parallel Reliefboard Computation for Scene Object Approximation. In: <i>Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)</i>. The Eurographics Association; 2010:43-51. doi:<a href=\"https://doi.org/10.2312/EGPGV/EGPGV10/043-051\">10.2312/EGPGV/EGPGV10/043-051</a>","short":"M. Fischer, C. Jähn, T. Suess, in: Eurographics Symposium on Parallel Graphics and Visualization (EGPGV), The Eurographics Association, 2010, pp. 43–51.","chicago":"Fischer, Matthias, Claudius Jähn, and Tim Suess. “Asynchronous Parallel Reliefboard Computation for Scene Object Approximation.” In <i>Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)</i>, 43–51. The Eurographics Association, 2010. <a href=\"https://doi.org/10.2312/EGPGV/EGPGV10/043-051\">https://doi.org/10.2312/EGPGV/EGPGV10/043-051</a>.","bibtex":"@inproceedings{Fischer_Jähn_Suess_2010, title={Asynchronous Parallel Reliefboard Computation for Scene Object Approximation}, DOI={<a href=\"https://doi.org/10.2312/EGPGV/EGPGV10/043-051\">10.2312/EGPGV/EGPGV10/043-051</a>}, booktitle={Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)}, publisher={The Eurographics Association}, author={Fischer, Matthias and Jähn, Claudius and Suess, Tim}, year={2010}, pages={43–51} }"},"doi":"10.2312/EGPGV/EGPGV10/043-051","user_id":"15415","page":"43-51","publisher":"The Eurographics Association","_id":"18136","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:26Z","title":"Asynchronous Parallel Reliefboard Computation for Scene Object Approximation","year":"2010","status":"public","author":[{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"},{"full_name":"Jähn, Claudius","last_name":"Jähn","first_name":"Claudius"},{"first_name":"Tim","last_name":"Suess","full_name":"Suess, Tim"}]},{"department":[{"_id":"63"}],"type":"conference","date_created":"2020-08-25T14:04:38Z","abstract":[{"text":"Many professional cluster systems consist of nodes with different hardware configurations. Such heterogeneous environments require different load-balancing techniques than homogenous environments. The c-load-collision-protocol is able to achieve good results for data-management purposes. Using this protocol, we propose a way for load-balancing in interactive rendering environments. For this work, we implemented a parallel rendering system and took different picking strategies into account to compare the results. The advantage of our approach compared to other approaches is that we group the available nodes of a cluster into two different categories, based on the hardware abilities. Some nodes are used solely for rendering, while others serve as secondary storage and to assist the former ones by performing auxiliary calculations.","lang":"eng"}],"citation":{"mla":"Suess, Tim, et al. “Evaluation of a C-Load-Collision-Protocol for Load-Balancing in Interactive Environments.” <i>2010 IEEE Fifth International Conference on Networking, Architecture, and Storage</i>, 2010, pp. 448–56, doi:<a href=\"https://doi.org/10.1109/nas.2010.52\">10.1109/nas.2010.52</a>.","ama":"Suess T, Wiesemann T, Fischer M. Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments. In: <i>2010 IEEE Fifth International Conference on Networking, Architecture, and Storage</i>. ; 2010:448-456. doi:<a href=\"https://doi.org/10.1109/nas.2010.52\">10.1109/nas.2010.52</a>","bibtex":"@inproceedings{Suess_Wiesemann_Fischer_2010, title={Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments}, DOI={<a href=\"https://doi.org/10.1109/nas.2010.52\">10.1109/nas.2010.52</a>}, booktitle={2010 IEEE Fifth International Conference on Networking, Architecture, and Storage}, author={Suess, Tim and Wiesemann, Timo and Fischer, Matthias}, year={2010}, pages={448–456} }","apa":"Suess, T., Wiesemann, T., &#38; Fischer, M. (2010). Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments. <i>2010 IEEE Fifth International Conference on Networking, Architecture, and Storage</i>, 448–456. <a href=\"https://doi.org/10.1109/nas.2010.52\">https://doi.org/10.1109/nas.2010.52</a>","ieee":"T. Suess, T. Wiesemann, and M. Fischer, “Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments,” in <i>2010 IEEE Fifth International Conference on Networking, Architecture, and Storage</i>, 2010, pp. 448–456, doi: <a href=\"https://doi.org/10.1109/nas.2010.52\">10.1109/nas.2010.52</a>.","short":"T. Suess, T. Wiesemann, M. Fischer, in: 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage, 2010, pp. 448–456.","chicago":"Suess, Tim, Timo Wiesemann, and Matthias Fischer. “Evaluation of a C-Load-Collision-Protocol for Load-Balancing in Interactive Environments.” In <i>2010 IEEE Fifth International Conference on Networking, Architecture, and Storage</i>, 448–56, 2010. <a href=\"https://doi.org/10.1109/nas.2010.52\">https://doi.org/10.1109/nas.2010.52</a>."},"publication":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","user_id":"15415","doi":"10.1109/nas.2010.52","language":[{"iso":"eng"}],"_id":"18289","page":"448 - 456","publication_status":"published","date_updated":"2022-01-06T06:53:28Z","author":[{"full_name":"Suess, Tim","first_name":"Tim","last_name":"Suess"},{"first_name":"Timo","last_name":"Wiesemann","full_name":"Wiesemann, Timo"},{"id":"146","full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer"}],"publication_identifier":{"isbn":["9781424481330"]},"year":"2010","status":"public","title":"Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments"},{"author":[{"last_name":"Suess","first_name":"Tim","full_name":"Suess, Tim"},{"full_name":"Wiesemann, Timo","first_name":"Timo","last_name":"Wiesemann"},{"id":"146","full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer"}],"year":"2010","status":"public","title":"Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems","date_updated":"2022-01-06T06:53:28Z","_id":"18290","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"page":"39-52","user_id":"15415","citation":{"ieee":"T. Suess, T. Wiesemann, and M. Fischer, “Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems,” in <i>Augmented &#38; Virtual Reality in der Produktentstehung</i>, 2010, pp. 39–52.","apa":"Suess, T., Wiesemann, T., &#38; Fischer, M. (2010). Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems. In <i>Augmented &#38; Virtual Reality in der Produktentstehung</i> (pp. 39–52).","chicago":"Suess, Tim, Timo Wiesemann, and Matthias Fischer. “Gewichtetes C-Collision-Protokoll Zur Balancierung Eines Parallelen Out-of-Core-Renderingsystems.” In <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 39–52. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn, 2010.","short":"T. Suess, T. Wiesemann, M. Fischer, in: Augmented &#38; Virtual Reality in Der Produktentstehung, 2010, pp. 39–52.","mla":"Suess, Tim, et al. “Gewichtetes C-Collision-Protokoll Zur Balancierung Eines Parallelen Out-of-Core-Renderingsystems.” <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 2010, pp. 39–52.","bibtex":"@inbook{Suess_Wiesemann_Fischer_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems}, booktitle={Augmented &#38; Virtual Reality in der Produktentstehung}, author={Suess, Tim and Wiesemann, Timo and Fischer, Matthias}, year={2010}, pages={39–52}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Suess T, Wiesemann T, Fischer M. Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems. In: <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. ; 2010:39-52."},"publication":"Augmented & Virtual Reality in der Produktentstehung","abstract":[{"text":"Typischerweise sind die Knoten eines PC-Clusters nicht mit leistungsfähigen Grafikkarten ausgestattet. Dennoch bieten Cluster-Betreiber einige wenige Rechenknoten an, die mit Highend-Grafikkarten ausgestattet sind, um beispielsweise eine PowerWall zu betreiben. Wenn zwischen diesen unterschiedlichen Knotentypen ein schnelles Netzwerk existiert, kann die Bilderzeugung durch die Knoten mit schwacher Grafikkarte beschleunigt werden. Dabei können die unterschiedlichen Knotentypen unterschiedliche Aufgabe bearbeiten. In einem solchen heterogenen System, müssen die unterschiedlichen entstehenden Lasten auf andere Weise verteilt werden, als in einem System, bei dem alle Knoten gleich ausgestattet sind. Wir präsentieren in dieser Arbeit Lastbalancierungsmechanismen, die in einem parallelen Out-of-Core-Renderingsystem für heterogene PC-Cluster eingesetzt werden.\r\n","lang":"ger"}],"date_created":"2020-08-25T14:14:36Z","department":[{"_id":"63"}],"type":"book_chapter"},{"department":[{"_id":"63"}],"type":"conference","date_created":"2020-04-06T10:42:26Z","citation":{"bibtex":"@inproceedings{Meyer auf der Heide_Phillips_2010, title={Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10}, DOI={<a href=\"https://doi.org/10.1145/1810479\">10.1145/1810479</a>}, author={Meyer auf der Heide, Friedhelm and Phillips, Cynthia A.}, year={2010} }","ama":"Meyer auf der Heide F, Phillips CA. Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10. In: ; 2010. doi:<a href=\"https://doi.org/10.1145/1810479\">10.1145/1810479</a>","short":"F. Meyer auf der Heide, C.A. Phillips, in: 2010.","chicago":"Meyer auf der Heide, Friedhelm, and Cynthia A. Phillips. “Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10,” 2010. <a href=\"https://doi.org/10.1145/1810479\">https://doi.org/10.1145/1810479</a>.","ieee":"F. Meyer auf der Heide and C. A. Phillips, “Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10,” 2010.","apa":"Meyer auf der Heide, F., &#38; Phillips, C. A. (2010). Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10. <a href=\"https://doi.org/10.1145/1810479\">https://doi.org/10.1145/1810479</a>","mla":"Meyer auf der Heide, Friedhelm, and Cynthia A. Phillips. <i>Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10</i>. 2010, doi:<a href=\"https://doi.org/10.1145/1810479\">10.1145/1810479</a>."},"user_id":"15415","doi":"10.1145/1810479","_id":"16414","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:52:50Z","publication_identifier":{"isbn":["9781450300797"]},"author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Phillips, Cynthia A.","last_name":"Phillips","first_name":"Cynthia A."}],"status":"public","title":"Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA '10","year":"2010"},{"type":"book_chapter","department":[{"_id":"63"}],"place":"Berlin, Heidelberg","date_created":"2020-04-14T13:06:51Z","abstract":[{"text":"We present an approach for real-time rendering of complex 3D scenes consisting of millions of polygons on limited graphics hardware. In a preprocessing step, powerful hardware is used to gain fine granular global visibility information of a scene using an adaptive sampling algorithm. Additively the visual influence of each object on the eventual rendered image is estimated. This influence is used to select the most important objects to display in our approximative culling algorithm. After the visibility data is compressed to meet the storage capabilities of small devices, we achieve an interactive walkthrough of the Power Plant scene on a standard netbook with an integrated graphics chipset.","lang":"eng"}],"publication":"Advances in Visual Computing","citation":{"ieee":"B. Eikel, C. Jähn, and M. Fischer, “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware,” in <i>Advances in Visual Computing</i>, Berlin, Heidelberg, 2010.","apa":"Eikel, B., Jähn, C., &#38; Fischer, M. (2010). Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware. In <i>Advances in Visual Computing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">https://doi.org/10.1007/978-3-642-17289-2_60</a>","mla":"Eikel, Benjamin, et al. “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware.” <i>Advances in Visual Computing</i>, 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">10.1007/978-3-642-17289-2_60</a>.","bibtex":"@inbook{Eikel_Jähn_Fischer_2010, place={Berlin, Heidelberg}, title={Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">10.1007/978-3-642-17289-2_60</a>}, booktitle={Advances in Visual Computing}, author={Eikel, Benjamin and Jähn, Claudius and Fischer, Matthias}, year={2010} }","short":"B. Eikel, C. Jähn, M. Fischer, in: Advances in Visual Computing, Berlin, Heidelberg, 2010.","ama":"Eikel B, Jähn C, Fischer M. Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware. In: <i>Advances in Visual Computing</i>. Berlin, Heidelberg; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">10.1007/978-3-642-17289-2_60</a>","chicago":"Eikel, Benjamin, Claudius Jähn, and Matthias Fischer. “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware.” In <i>Advances in Visual Computing</i>. Berlin, Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">https://doi.org/10.1007/978-3-642-17289-2_60</a>."},"doi":"10.1007/978-3-642-17289-2_60","user_id":"15415","language":[{"iso":"eng"}],"_id":"16505","date_updated":"2022-01-06T06:52:52Z","publication_status":"published","status":"public","title":"Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware","year":"2010","author":[{"last_name":"Eikel","first_name":"Benjamin","full_name":"Eikel, Benjamin"},{"last_name":"Jähn","first_name":"Claudius","full_name":"Jähn, Claudius"},{"full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer","id":"146"}],"publication_identifier":{"isbn":["9783642172885","9783642172892"],"issn":["0302-9743","1611-3349"]}},{"author":[{"last_name":"Degener","first_name":"Bastian","full_name":"Degener, Bastian"},{"full_name":"Kempkes, Barbara","last_name":"Kempkes","first_name":"Barbara"},{"full_name":"Kling, Peter","first_name":"Peter","last_name":"Kling"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642132834","9783642132841"]},"title":"A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots","year":"2010","status":"public","publication_status":"published","date_updated":"2022-01-06T06:52:49Z","series_title":"SIROCCO 2010","_id":"16365","language":[{"iso":"eng"}],"page":"168-182","user_id":"15415","doi":"10.1007/978-3-642-13284-1_14","citation":{"mla":"Degener, Bastian, et al. “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.” <i>Structural Information and Communication Complexity</i>, 2010, pp. 168–82, doi:<a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">10.1007/978-3-642-13284-1_14</a>.","bibtex":"@inbook{Degener_Kempkes_Kling_Meyer auf der Heide_2010, place={Berlin, Heidelberg}, series={SIROCCO 2010}, title={A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">10.1007/978-3-642-13284-1_14</a>}, booktitle={Structural Information and Communication Complexity}, author={Degener, Bastian and Kempkes, Barbara and Kling, Peter and Meyer auf der Heide, Friedhelm}, year={2010}, pages={168–182}, collection={SIROCCO 2010} }","ama":"Degener B, Kempkes B, Kling P, Meyer auf der Heide F. A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. In: <i>Structural Information and Communication Complexity</i>. SIROCCO 2010. Berlin, Heidelberg; 2010:168-182. doi:<a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">10.1007/978-3-642-13284-1_14</a>","ieee":"B. Degener, B. Kempkes, P. Kling, and F. Meyer auf der Heide, “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots,” in <i>Structural Information and Communication Complexity</i>, Berlin, Heidelberg, 2010, pp. 168–182.","apa":"Degener, B., Kempkes, B., Kling, P., &#38; Meyer auf der Heide, F. (2010). A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. In <i>Structural Information and Communication Complexity</i> (pp. 168–182). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">https://doi.org/10.1007/978-3-642-13284-1_14</a>","chicago":"Degener, Bastian, Barbara Kempkes, Peter Kling, and Friedhelm Meyer auf der Heide. “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.” In <i>Structural Information and Communication Complexity</i>, 168–82. SIROCCO 2010. Berlin, Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-13284-1_14\">https://doi.org/10.1007/978-3-642-13284-1_14</a>.","short":"B. Degener, B. Kempkes, P. Kling, F. Meyer auf der Heide, in: Structural Information and Communication Complexity, Berlin, Heidelberg, 2010, pp. 168–182."},"publication":"Structural Information and Communication Complexity","date_created":"2020-04-02T13:56:17Z","place":"Berlin, Heidelberg","department":[{"_id":"63"}],"type":"book_chapter"},{"publication":"Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA '10","citation":{"bibtex":"@inproceedings{Degener_Kempkes_Meyer auf der Heide_2010, title={A local O(n2) gathering algorithm}, DOI={<a href=\"https://doi.org/10.1145/1810479.1810523\">10.1145/1810479.1810523</a>}, booktitle={Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10}, author={Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2010} }","chicago":"Degener, Bastian, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “A Local O(N2) Gathering Algorithm.” In <i>Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10</i>, 2010. <a href=\"https://doi.org/10.1145/1810479.1810523\">https://doi.org/10.1145/1810479.1810523</a>.","short":"B. Degener, B. Kempkes, F. Meyer auf der Heide, in: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10, 2010.","ama":"Degener B, Kempkes B, Meyer auf der Heide F. A local O(n2) gathering algorithm. In: <i>Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10</i>. ; 2010. doi:<a href=\"https://doi.org/10.1145/1810479.1810523\">10.1145/1810479.1810523</a>","ieee":"B. Degener, B. Kempkes, and F. Meyer auf der Heide, “A local O(n2) gathering algorithm,” in <i>Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10</i>, 2010.","apa":"Degener, B., Kempkes, B., &#38; Meyer auf der Heide, F. (2010). A local O(n2) gathering algorithm. In <i>Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures - SPAA ’10</i>. <a href=\"https://doi.org/10.1145/1810479.1810523\">https://doi.org/10.1145/1810479.1810523</a>","mla":"Degener, Bastian, et al. “A Local O(N2) Gathering Algorithm.” <i>Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’10</i>, 2010, doi:<a href=\"https://doi.org/10.1145/1810479.1810523\">10.1145/1810479.1810523</a>."},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-03T12:48:11Z","publication_status":"published","date_updated":"2022-01-06T06:52:50Z","title":"A local O(n2) gathering algorithm","year":"2010","status":"public","author":[{"first_name":"Bastian","last_name":"Degener","full_name":"Degener, Bastian"},{"first_name":"Barbara","last_name":"Kempkes","full_name":"Kempkes, Barbara"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publication_identifier":{"isbn":["9781450300797"]},"user_id":"15415","doi":"10.1145/1810479.1810523","language":[{"iso":"eng"}],"_id":"16401"},{"date_updated":"2022-01-06T06:52:50Z","publication_status":"published","title":"Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.","status":"public","year":"2010","publication_identifier":{"isbn":["9783642141614","9783642141621"],"issn":["0302-9743","1611-3349"]},"doi":"10.1007/978-3-642-14162-1","user_id":"15415","editor":[{"first_name":"Samson","last_name":"Abramsky","full_name":"Abramsky, Samson"},{"first_name":"Cyril","last_name":"Gavoille","full_name":"Gavoille, Cyril"},{"first_name":"Claude","last_name":"Kirchner","full_name":"Kirchner, Claude"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Spirakis, Paul G.","first_name":"Paul G.","last_name":"Spirakis"}],"language":[{"iso":"eng"}],"_id":"16403","citation":{"ama":"Abramsky S, Gavoille C, Kirchner C, Meyer auf der Heide F, Spirakis PG, eds. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> Berlin, Heidelberg; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-14162-1\">10.1007/978-3-642-14162-1</a>","bibtex":"@book{Abramsky_Gavoille_Kirchner_Meyer auf der Heide_Spirakis_2010, place={Berlin, Heidelberg}, title={Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-14162-1\">10.1007/978-3-642-14162-1</a>}, year={2010} }","mla":"Abramsky, Samson, et al., editors. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-14162-1\">10.1007/978-3-642-14162-1</a>.","short":"S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis, eds., Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II., Berlin, Heidelberg, 2010.","chicago":"Abramsky, Samson, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, and Paul G. Spirakis, eds. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> Berlin, Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14162-1\">https://doi.org/10.1007/978-3-642-14162-1</a>.","apa":"Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., &#38; Spirakis, P. G. (Eds.). (2010). <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-14162-1\">https://doi.org/10.1007/978-3-642-14162-1</a>","ieee":"S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, Eds., <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.</i> Berlin, Heidelberg, 2010."},"type":"book_editor","department":[{"_id":"63"}],"place":"Berlin, Heidelberg","date_created":"2020-04-03T12:56:30Z"},{"place":"Berlin, Heidelberg","date_created":"2020-04-03T12:58:05Z","type":"book_editor","department":[{"_id":"63"}],"citation":{"ieee":"S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, Eds., <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> Berlin, Heidelberg, 2010.","apa":"Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., &#38; Spirakis, P. G. (Eds.). (2010). <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-14165-2\">https://doi.org/10.1007/978-3-642-14165-2</a>","chicago":"Abramsky, Samson, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, and Paul G. Spirakis, eds. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> Berlin, Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14165-2\">https://doi.org/10.1007/978-3-642-14165-2</a>.","short":"S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis, eds., Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I., Berlin, Heidelberg, 2010.","mla":"Abramsky, Samson, et al., editors. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-14165-2\">10.1007/978-3-642-14165-2</a>.","bibtex":"@book{Abramsky_Gavoille_Kirchner_Meyer auf der Heide_Spirakis_2010, place={Berlin, Heidelberg}, title={Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-14165-2\">10.1007/978-3-642-14165-2</a>}, year={2010} }","ama":"Abramsky S, Gavoille C, Kirchner C, Meyer auf der Heide F, Spirakis PG, eds. <i>Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.</i> Berlin, Heidelberg; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-14165-2\">10.1007/978-3-642-14165-2</a>"},"language":[{"iso":"eng"}],"_id":"16404","doi":"10.1007/978-3-642-14165-2","user_id":"15415","editor":[{"full_name":"Abramsky, Samson","last_name":"Abramsky","first_name":"Samson"},{"full_name":"Gavoille, Cyril","last_name":"Gavoille","first_name":"Cyril"},{"full_name":"Kirchner, Claude","last_name":"Kirchner","first_name":"Claude"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Spirakis, Paul G.","first_name":"Paul G.","last_name":"Spirakis"}],"year":"2010","status":"public","title":"Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.","publication_identifier":{"isbn":["9783642141614","9783642141621"],"issn":["0302-9743","1611-3349"]},"date_updated":"2022-01-06T06:52:50Z","publication_status":"published"},{"language":[{"iso":"eng"}],"_id":"19605","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","volume":261,"user_id":"5786","author":[{"last_name":"Lürwer-Brüggemeier","first_name":"Katharina","full_name":"Lürwer-Brüggemeier, Katharina"}],"year":"2009","status":"public","title":"Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division","intvolume":"       261","date_updated":"2022-01-06T06:54:07Z","date_created":"2020-09-21T14:07:23Z","department":[{"_id":"63"},{"_id":"26"}],"type":"dissertation","supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"citation":{"mla":"Lürwer-Brüggemeier, Katharina. <i>Mächtigkeit Und Komplexität von Berechnungen Mit Der Ganzzahligen Division</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","apa":"Lürwer-Brüggemeier, K. (2009). <i>Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division</i> (Vol. 261). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"K. Lürwer-Brüggemeier, <i>Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division</i>, vol. 261. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","short":"K. Lürwer-Brüggemeier, Mächtigkeit Und Komplexität von Berechnungen Mit Der Ganzzahligen Division, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","ama":"Lürwer-Brüggemeier K. <i>Mächtigkeit Und Komplexität von Berechnungen Mit Der Ganzzahligen Division</i>. Vol 261. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2009.","chicago":"Lürwer-Brüggemeier, Katharina. <i>Mächtigkeit Und Komplexität von Berechnungen Mit Der Ganzzahligen Division</i>. Vol. 261. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","bibtex":"@book{Lürwer-Brüggemeier_2009, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division}, volume={261}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Lürwer-Brüggemeier, Katharina}, year={2009}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }"},"related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20090212010"}]}},{"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20090206016","relation":"confirmation"}]},"citation":{"ieee":"M. Mense, <i>On Fault-Tolerant Data Placement in Storage Networks</i>, vol. 260. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","apa":"Mense, M. (2009). <i>On Fault-Tolerant Data Placement in Storage Networks</i> (Vol. 260). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","chicago":"Mense, Mario. <i>On Fault-Tolerant Data Placement in Storage Networks</i>. Vol. 260. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","short":"M. Mense, On Fault-Tolerant Data Placement in Storage Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","mla":"Mense, Mario. <i>On Fault-Tolerant Data Placement in Storage Networks</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","bibtex":"@book{Mense_2009, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={On Fault-Tolerant Data Placement in Storage Networks}, volume={260}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Mense, Mario}, year={2009}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Mense M. <i>On Fault-Tolerant Data Placement in Storage Networks</i>. Vol 260. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2009."},"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"date_created":"2020-09-22T08:05:15Z","date_updated":"2022-01-06T06:54:08Z","intvolume":"       260","title":"On Fault-Tolerant Data Placement in Storage Networks","year":"2009","status":"public","author":[{"first_name":"Mario","last_name":"Mense","full_name":"Mense, Mario"}],"publication_identifier":{"isbn":["978-3-939350-79-8"]},"user_id":"5786","volume":260,"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"19614","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}]},{"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"citation":{"mla":"Kortenjan, Michael. <i>Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","ama":"Kortenjan M. <i>Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes</i>. Vol 258. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2009.","bibtex":"@book{Kortenjan_2009, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes}, volume={258}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Kortenjan, Michael}, year={2009}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","apa":"Kortenjan, M. (2009). <i>Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes</i> (Vol. 258). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"M. Kortenjan, <i>Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes</i>, vol. 258. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","short":"M. Kortenjan, Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","chicago":"Kortenjan, Michael. <i>Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes</i>. Vol. 258. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009."},"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20081218010","relation":"confirmation"}]},"date_created":"2020-09-22T08:42:22Z","department":[{"_id":"63"},{"_id":"26"}],"type":"dissertation","author":[{"last_name":"Kortenjan","first_name":"Michael","full_name":"Kortenjan, Michael"}],"publication_identifier":{"isbn":["978-3-939350-77-4"]},"title":"Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes","status":"public","year":"2009","intvolume":"       258","date_updated":"2022-01-06T06:54:08Z","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"19617","language":[{"iso":"eng"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","volume":258,"user_id":"5786"}]