@proceedings{16431,
  editor       = {{Meyer auf der Heide, Friedhelm and Bender, Michael A.}},
  isbn         = {{9781605586069}},
  title        = {{{Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA '09}}},
  doi          = {{10.1145/1583991}},
  year         = {{2009}},
}

@article{16398,
  author       = {{Bienkowski, Marcin and Byrka, Jaroslaw and Korzeniowski, Miroslaw and Meyer auf der Heide, Friedhelm}},
  issn         = {{1570-8667}},
  journal      = {{Journal of Discrete Algorithms}},
  pages        = {{545--569}},
  title        = {{{Optimal algorithms for page migration in dynamic networks}}},
  doi          = {{10.1016/j.jda.2008.07.006}},
  year         = {{2009}},
}

@book{25833,
  author       = {{Meyer auf der Heide, Friedhelm}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{The European Integrated Project "Dynamically Evolving, Large Scale Information Systems (DELIS)", Proceedings of the Final Workshop, Barcelona, February 27-28, 2008}}},
  volume       = {{222}},
  year         = {{2008}},
}

@inbook{16463,
  author       = {{Meyer auf der Heide, Friedhelm and Schneider, Barbara}},
  booktitle    = {{Biologically-Inspired Collaborative Computing}},
  isbn         = {{9780387096544}},
  issn         = {{1571-5736}},
  title        = {{{Local Strategies for Connecting Stations by Small Robotic Networks}}},
  doi          = {{10.1007/978-0-387-09655-1_9}},
  year         = {{2008}},
}

@inbook{16464,
  author       = {{Gehweiler, Joachim and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Taschenbuch der Algorithmen}},
  isbn         = {{9783540763932}},
  title        = {{{Bin Packing oder „Wie bekomme ich die Klamotten in die Kisten?“}}},
  doi          = {{10.1007/978-3-540-76394-9_40}},
  year         = {{2008}},
}

@unpublished{16465,
  abstract     = {{For a fixed virtual scene (=collection of simplices) S and given observer
position p, how many elements of S are weakly visible (i.e. not fully occluded
by others) from p? The present work explores the trade-off between query time
and preprocessing space for these quantities in 2D: exactly, in the approximate
deterministic, and in the probabilistic sense. We deduce the EXISTENCE of an
O(m^2/n^2) space data structure for S that, given p and time O(log n), allows
to approximate the ratio of occluded segments up to arbitrary constant absolute
error; here m denotes the size of the Visibility Graph--which may be quadratic,
but typically is just linear in the size n of the scene S. On the other hand,
we present a data structure CONSTRUCTIBLE in O(n*log(n)+m^2*polylog(n)/k)
preprocessing time and space with similar approximation properties and query
time O(k*polylog n), where k<n is an arbitrary parameter. We describe an
implementation of this approach and demonstrate the practical benefit of the
parameter k to trade memory for query time in an empirical evaluation on three
classes of benchmark scenes.}},
  author       = {{Fischer, Matthias and Hilbig, Matthias and Jähn, Claudius and Meyer auf der Heide, Friedhelm and Ziegler, Martin}},
  booktitle    = {{arXiv:0810.0052}},
  title        = {{{Planar Visibility Counting}}},
  year         = {{2008}},
}

@proceedings{16466,
  editor       = {{Meyer auf der Heide, Friedhelm and Shavit, Nir}},
  isbn         = {{978-1-59593-973-9}},
  publisher    = {{ACM}},
  title        = {{{Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA '08}}},
  doi          = {{10.1145/1378533}},
  year         = {{2008}},
}

@book{17566,
  author       = {{Meyer auf der Heide, Friedhelm}},
  isbn         = {{ISBN 978-3-939350-41-5}},
  publisher    = {{Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn}},
  title        = {{{The European Integrated Project "Dynamically Evolving, Large Scale Information Systems (DELIS)"}}},
  volume       = {{222}},
  year         = {{2008}},
}

@article{17567,
  author       = {{Leonardi, Stefano and Mahlmann, Peter and Meyer auf der Heide, Friedhelm and Spirakis, Paul G. and Weikum, Gerhard}},
  journal      = {{e-Strategies, www.britishpublishers.com}},
  title        = {{{Guarding our digital society's well-being}}},
  volume       = {{3-10-2007}},
  year         = {{2007}},
}

@inproceedings{2214,
  abstract     = {{We present a randomized block-level storage virtualization for arbitrary heterogeneous storage systems that can distribute data in a fair and redundant way and can adapt this distribution in an efficient way as storage devices enter or leave the system. More precisely, our virtualization strategies can distribute a set of data blocks among a set of storage devices of arbitrary non-uniform capacities so that a storage device representing x% of the capacity in the system will get x% of the data (as long as this is in principle possible) and the different copies of each data block are stored so that no two copies of a data block are located in the same device. Achieving these two properties is not easy, and no virtualization strategy has been presented so far that has been formally shown to satisfy fairness and redundancy while being time- and space-eflcient and allowing an efficient adaptation to a changing set of devices.}},
  author       = {{Brinkmann, André and Effert, Sascha and Meyer auf der Heide, Friedhelm and Scheideler, Christian}},
  booktitle    = {{IEEE International Conference on Distributed Computing Systems (ICDCS)}},
  title        = {{{Dynamic and redundant data placement}}},
  year         = {{2007}},
}

@inproceedings{7970,
  abstract     = {{We consider the problem of exploring an unknown environment using a swarm of autonomous robots with collective behavior emerging from their local rules. Each robot has only a very restricted view on the environment which makes cooperation difficult. We introduce a software system which is capable of simulating a large number of such robots (e.g. 1000) on highly complex terrains with millions of obstacles. Its main purpose is to easily integrate and evaluate any kind of algorithm for controlling the robot behavior. The simulation may be observed in real-time via a visualization that displays both the individual and the collective progress of the robots. We present the system design, its main features and underlying concepts.}},
  author       = {{Arens, Stephan and Buss, Alexander and Deck, Helena and Dynia, Miroslaw and Fischer, Matthias and Hagedorn, Holger and Isaak, Peter and Kutylowski, Jaroslaw and Meyer auf der Heide, Friedhelm and Nesterow, Viktor and Ogiermann, Adrian and Stobbe, Boris and Storm, Thomas and Wachsmuth, Henning}},
  booktitle    = {{Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment}},
  pages        = {{215--222}},
  publisher    = {{Heinz Nixdorf Institut, University of Paderborn}},
  title        = {{{Smart Teams: Simulating Large Robotic Swarms in Vast Environments}}},
  year         = {{2007}},
}

@inproceedings{16467,
  author       = {{Dynia, Miroslaw and Kutylowski, Jaroslaw and Meyer auf der Heide, Friedhelm and Schrieb, Jonas}},
  booktitle    = {{Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA '07}},
  isbn         = {{9781595936677}},
  title        = {{{Local strategies for maintaining a chain of relay stations between an explorer and a base station}}},
  doi          = {{10.1145/1248377.1248420}},
  year         = {{2007}},
}

@book{25529,
  author       = {{Monien, Burkhard and Meyer auf der Heide, Friedhelm}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{New Trends in Parallel & Distributed Computing}}},
  volume       = {{181}},
  year         = {{2006}},
}

@proceedings{17417,
  abstract     = {{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.}},
  editor       = {{Rammig, Franz-Josef and Dangelmaier, Wilhelm and Karl, Holger and Mertsching, Bärbel and Meyer auf der Heide, Friedhelm and Trächtler, Ansgar}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts}},
  title        = {{{Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems}}},
  year         = {{2006}},
}

@book{17475,
  author       = {{Monien, Burkhard and Meyer auf der Heide, Friedhelm}},
  isbn         = {{978-3-939350-00-2}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{New trends in parallel and distributed computing}}},
  volume       = {{181}},
  year         = {{2006}},
}

@inproceedings{17619,
  author       = {{Grünewald, Matthias and Meyer auf der Heide, Friedhelm and Rührup, Stefan and Schindelhauer, Christian and Volbert, Klaus}},
  booktitle    = {{New Trends in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf Symposium}},
  pages        = {{225--234}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts}},
  title        = {{{Directional Communication in Mobile Ad Hoc Networks}}},
  year         = {{2006}},
}

@inproceedings{18999,
  abstract     = {{We present a web computing library (PUBWCL) in Java that allows to execute tightly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style on PCs distributed over the internet whose owners are willing to donate their unused computation power. PUBWCL is realized as a peer-to-peer system and features migration and restoration of BSP processes executed on it. The use of Java guarantees a high level of security and makes PUBWCL platform- independent. In order to estimate the loss of efficiency inherent in such a Java-based system, we have compared it to our C-based PUB-Library.
As the unused computation power of the participating PCs is unpredictable, we need novel strategies for load balancing that have no access to future changes of the computation power available for the application. We develop, analyze, and compare different load balancing strategies for PUBWCL. In order to handle the influence of the fluctuating available computation power, we classify the external work load.
During our evaluation of the load balancing algorithms we simulated the external work load in order to have repeatable testing conditions. With the best performing load balancing strategy we could save 39% of the execution time on average and even up to 50% in particular cases, in our test environment.
}},
  author       = {{Bonorden, Olaf and Meyer auf der Heide, Friedhelm and Gehweiler, Joachim}},
  booktitle    = {{Journal on Scalable Computing: Practice and Experience}},
  pages        = {{1--14}},
  title        = {{{A Web Computing Environment for Parallel Algorithms in Java}}},
  year         = {{2006}},
}

@inproceedings{23299,
  author       = {{Rammig, Franz-Josef and Dangelmaier, Wilhelm and Karl, Holger and Mertsching, Bärbel and Meyer auf der Heide, Friedhelm and Trächtler, Ansgar}},
  booktitle    = {{New Trends in Parallel & Distributed Computing}},
  pages        = {{248 -- 259}},
  publisher    = {{Heinz Nixdorf Institut}},
  title        = {{{Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems}}},
  volume       = {{181}},
  year         = {{2006}},
}

@inproceedings{16462,
  author       = {{Bonorden, Olaf and Gehweiler, Joachim and Meyer auf der Heide, Friedhelm and Rehberg, Bettina}},
  booktitle    = {{Proceedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel & Distributed Computing}},
  pages        = {{137--153}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Efficient Parallel Algorithms}}},
  volume       = {{181}},
  year         = {{2006}},
}

@inbook{16472,
  author       = {{Demaine, Erik D. and Meyer auf der Heide, Friedhelm and Pagh, Rasmus and Pǎtraşcu, Mihai}},
  booktitle    = {{LATIN 2006: Theoretical Informatics}},
  isbn         = {{9783540327554}},
  issn         = {{0302-9743}},
  title        = {{{De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space)}}},
  doi          = {{10.1007/11682462_34}},
  year         = {{2006}},
}