@phdthesis{18910, author = {{Bienkowski, Marcin}}, isbn = {{978-3-942647-01-4}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Page migration in dynamic networks}}}, volume = {{282}}, year = {{2010}}, } @phdthesis{18927, author = {{Dynia, Miroslaw}}, isbn = {{978-3-942647-03-8}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Collective graph exploration}}}, volume = {{284}}, year = {{2010}}, } @article{19011, author = {{Degener, Bastian and Gehweiler, Joachim and Lammersen, Christiane}}, issn = {{0178-4617}}, journal = {{Algorithmica}}, number = {{3}}, pages = {{562--584}}, title = {{{Kinetic Facility Location}}}, doi = {{10.1007/s00453-008-9250-7}}, volume = {{57}}, year = {{2010}}, } @book{19012, abstract = {{4. Auflage 2014}}, author = {{Eke, Norbert Otto and Allkemper, Alo}}, publisher = {{Fink}}, title = {{{Literaturwissenschaft}}}, year = {{2010}}, } @inproceedings{19013, author = {{Gehweiler, Joachim and Meyerhenke, Henning}}, booktitle = {{Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC)}}, isbn = {{9781424465330}}, title = {{{A distributed diffusive heuristic for clustering a virtual P2P supercomputer}}}, doi = {{10.1109/ipdpsw.2010.5470922}}, year = {{2010}}, } @inproceedings{19016, abstract = {{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.}}, author = {{Gehweiler, Joachim and Meyerhenke, Henning}}, booktitle = {{Dagstuhl Seminar Proceedings 10261: Algorithm Engineering}}, title = {{{On Dynamic Graph Partitioning and Graph Clustering using Diffusion}}}, year = {{2010}}, } @techreport{19018, author = {{Thies, Michael and Gehweiler, Joachim}}, title = {{{Thread Migration and Checkpointing in Java}}}, year = {{2010}}, } @inproceedings{19023, 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}}, booktitle = {{Artificial Life XII (ALife XII)}}, pages = {{781--788}}, publisher = {{MIT Press}}, title = {{{Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics}}}, year = {{2010}}, } @inbook{19027, author = {{Seng, Eva- Maria}}, booktitle = {{Geschichte der Rekonstruktion. Konstruktion der Geschichte. Publikation und Ausstellungskatalog, Pinakothek der Moderne}}, editor = {{Nerdinger, Winfried}}, pages = {{78--95 und 224--232}}, title = {{{Rekonstruktionen von Kontinuität zwischen 1600 und 1800: Überbrückung der durch Politik, Religion und Krieg verursachten Zäsuren}}}, year = {{2010}}, } @inproceedings{19029, author = {{Briest, Patrick and Chalermsook, Parinya and Khanna, Sanjeev and Laekhanukit, Bundit and Nanongkai, Danupon}}, booktitle = {{Workshop on Internet and Network Economics (WINE)}}, isbn = {{9783642175718}}, issn = {{0302-9743}}, title = {{{Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing}}}, doi = {{10.1007/978-3-642-17572-5_37}}, year = {{2010}}, } @article{1903, author = {{Meyer auf der Heide, Friedhelm and Scheideler, Christian}}, journal = {{Informatik Spektrum}}, number = {{5}}, pages = {{468----474}}, title = {{{Algorithmische Grundlagen verteilter Speichersysteme}}}, doi = {{10.1007/s00287-010-0470-2}}, year = {{2010}}, } @article{19032, author = {{Seng, Eva- Maria}}, journal = {{Enzyklopädie der Neuzeit, Stuttgart}}, title = {{{Stadtbaukunst}}}, year = {{2010}}, } @inproceedings{19033, author = {{Briest, Patrick and Chawla, Shuchi and Kleinberg, Robert and Weinberg, S. Matthew}}, booktitle = {{Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms}}, isbn = {{9780898717013}}, title = {{{Pricing Randomized Allocations}}}, doi = {{10.1137/1.9781611973075.49}}, year = {{2010}}, } @article{1904, author = {{Gavoille, Cyril and Patt-Shamir, Boaz and Scheideler, Christian}}, journal = {{Theory of Computing Systems}}, number = {{4}}, pages = {{809----810}}, title = {{{Foreword}}}, doi = {{10.1007/s00224-010-9284-5}}, year = {{2010}}, } @phdthesis{19041, author = {{Mahlmann, Peter}}, isbn = {{978-3-942647-02-1}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Peer-to-peer networks based on random graphs}}}, volume = {{283}}, year = {{2010}}, } @phdthesis{19042, author = {{Degener, Bastian}}, isbn = {{978-3-939350-97-2 }}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Local, distributed approximation algorithms for geometric assignment problems}}}, volume = {{278}}, year = {{2010}}, } @inproceedings{1905, author = {{Gall, Dominik and Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo}}, booktitle = {{LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings}}, isbn = {{978-3-642-12199-9}}, pages = {{294----305}}, publisher = {{Springer}}, title = {{{Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization}}}, doi = {{10.1007/978-3-642-12200-2_27}}, volume = {{6034}}, year = {{2010}}, } @inproceedings{1906, author = {{Richa, Andrea W. and Zhang, Jin and Scheideler, Christian and Schmid, Stefan}}, booktitle = {{Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010}}, isbn = {{978-1-60558-888-9}}, pages = {{114----115}}, publisher = {{ACM}}, title = {{{Brief announcement: towards robust medium access in multi-hop networks}}}, doi = {{10.1145/1835698.1835726}}, year = {{2010}}, } @inproceedings{1907, author = {{Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}}, booktitle = {{Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings}}, isbn = {{978-3-642-15762-2}}, pages = {{179----193}}, publisher = {{Springer}}, title = {{{A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks}}}, doi = {{10.1007/978-3-642-15763-9_17}}, volume = {{6343}}, year = {{2010}}, } @inproceedings{1908, author = {{Doerr, Benjamin and Ann Goldberg, Leslie and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian}}, booktitle = {{Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings}}, pages = {{528----530}}, publisher = {{Springer}}, title = {{{Brief Announcement: Stabilizing Consensus with the Power of Two Choices}}}, doi = {{10.1007/978-3-642-15763-9_50}}, volume = {{6343}}, year = {{2010}}, }