@inbook{16473,
  author       = {{Dynia, M. and Kutyłowski, J. and Meyer auf der Heide, Friedhelm and Schindelhauer, Christian}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783540377917}},
  issn         = {{0302-9743}},
  title        = {{{Smart Robot Teams Exploring Sparse Trees}}},
  doi          = {{10.1007/11821069_29}},
  year         = {{2006}},
}

@inbook{16476,
  author       = {{Dynia, Miroslaw and Kutyłowski, Jarosław and Lorek, Paweł and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{IFIP International Federation for Information Processing}},
  isbn         = {{9780387346328}},
  issn         = {{1571-5736}},
  title        = {{{Maintaining Communication Between an Explorer and a Base Station}}},
  doi          = {{10.1007/978-0-387-34733-2_14}},
  year         = {{2006}},
}

@techreport{17011,
  author       = {{Dynia, Miroslaw and Kuhmlehn, Andreas and Kutylowski, Jaroslaw and Meyer auf der Heide, Friedhelm and Schindelhauer, Christian}},
  title        = {{{SmartS Simulator Design}}},
  year         = {{2006}},
}

@inbook{16468,
  author       = {{Bienkowski, Marcin and Korzeniowski, Miroslaw and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Peer-to-Peer Systems IV}},
  isbn         = {{9783540290681}},
  issn         = {{0302-9743}},
  title        = {{{Dynamic Load Balancing in Distributed Hash Tables}}},
  doi          = {{10.1007/11558989_20}},
  year         = {{2005}},
}

@inbook{16469,
  author       = {{Bienkowski, Marcin and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Mathematical Foundations of Computer Science 2005}},
  isbn         = {{9783540287025}},
  issn         = {{0302-9743}},
  title        = {{{Page Migration in Dynamic Networks}}},
  doi          = {{10.1007/11549345_1}},
  year         = {{2005}},
}

@inproceedings{16470,
  abstract     = {{We present a web computing library (PUBWCL) in Java that allows to execute strongly 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.
}},
  author       = {{Bonorden, Olaf and Gehweiler, Joachim and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)}},
  isbn         = {{9783540341413}},
  issn         = {{0302-9743}},
  pages        = {{801--808}},
  title        = {{{A Web Computing Environment for Parallel Algorithms in Java}}},
  doi          = {{10.1007/11752578_96}},
  year         = {{2005}},
}

@inproceedings{16471,
  abstract     = {{We compare different load balancing strategies for Bulk-Synchronous Parallel (BSP) programs in a web computing environment. In order to handle the influence of the fluctuating available computation power, we classify the external work load.

We evaluate the load balancing algorithms using our web computing library for BSP programs in Java (PUBWCL). Thereby 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 averaged and even up to 50% in particular cases.}},
  author       = {{Bonorden, Olaf and Gehweiler, Joachim and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)}},
  isbn         = {{9783540341413}},
  issn         = {{0302-9743}},
  pages        = {{839--846}},
  title        = {{{Load Balancing Strategies in a Web Computing Environment}}},
  doi          = {{10.1007/11752578_101}},
  year         = {{2005}},
}

@inproceedings{17112,
  author       = {{Bienkowski, Marcin and Damerow, Valentina and Meyer auf der Heide, Friedhelm and Sohler, Christian}},
  booktitle    = {{Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005}},
  publisher    = {{Technische Universiteit Eindhoven}},
  title        = {{{Average case complexity of Voronoi diagrams of n sites from the unit cube}}},
  year         = {{2005}},
}

@proceedings{17113,
  editor       = {{Leonardi, Stefano and Meyer auf der Heide, Friedhelm and Wagner, Dorothea}},
  location     = {{Schloss Dagstuhl, Germany}},
  title        = {{{Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks}}},
  volume       = {{05361}},
  year         = {{2005}},
}

@inproceedings{17346,
  author       = {{Brinkmann, André and Heidebuer, Michael and Meyer auf der Heide, Friedhelm and Rückert, Ulrich  and Salzwedel, Kay and Vodisek, Mario}},
  booktitle    = {{21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA}},
  editor       = {{Kobler, Ben and Hariharan, P. C.}},
  pages        = {{153----157}},
  publisher    = {{IEEE}},
  title        = {{{V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System}}},
  year         = {{2004}},
}

@inproceedings{16474,
  abstract     = {{Given n distinct points p1, p2, ... , pn in the plane, the map labeling
problem with four squares is to place n axis-parallel equi-sized squares Q1, ... ,Qn
of maximum possible size such that pi is a corner of Qi and no two squares overlap.
This problem is NP-hard and no algorithm with approximation ratio better
than 1/2 exists unless P = NP [10].
In this paper, we consider a scenario where we want to visualize the information
gathered by smart dust, i.e. by a large set of simple devices, each consisting of
a sensor and a sender that can gather sensor data and send it to a central station.
Our task is to label (the positions of) these sensors in a way described by the
labeling problem above. Since these devices are not positioned accurately (for
example, they might be dropped from an airplane), this gives rise to consider the
map labeling problem under the assumption, that the positions of the points are
not fixed precisely, but perturbed by random noise. In other words, we consider
the smoothed complexity of the map labeling problem. We present an algorithm
that, under such an assumption and Gaussian random noise with sufficiently large
variance, has linear smoothed complexity.}},
  author       = {{Bansal, Vikas and Meyer auf der Heide, Friedhelm and Sohler, Christian}},
  booktitle    = {{12th Annual European Symposium on Algorithms (ESA 2004)}},
  isbn         = {{9783540230250}},
  issn         = {{0302-9743}},
  title        = {{{Labeling Smart Dust}}},
  doi          = {{10.1007/978-3-540-30140-0_9}},
  volume       = {{3221}},
  year         = {{2004}},
}

@inproceedings{16475,
  author       = {{Bienkowski, Marcin and Korzeniowski, Miroslaw and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures  - SPAA '04}},
  isbn         = {{1581138407}},
  title        = {{{Fighting against two adversaries}}},
  doi          = {{10.1145/1007912.1007923}},
  year         = {{2004}},
}

@article{16477,
  author       = {{Meyer auf der Heide, Friedhelm and Schindelhauer, Christian and Volbert, Klaus and Grünewald, Matthias}},
  issn         = {{1432-4350}},
  journal      = {{Theory of Computing Systems}},
  pages        = {{343--370}},
  title        = {{{Congestion, Dilation, and Energy in Radio Networks}}},
  doi          = {{10.1007/s00224-004-1124-z}},
  year         = {{2004}},
}

@inproceedings{16480,
  author       = {{Leonardi, S. and Marchetti-Spaccamela, A. and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures}},
  isbn         = {{1581138407}},
  title        = {{{Scheduling against an adversarial network}}},
  doi          = {{10.1145/1007912.1007936}},
  year         = {{2004}},
}

@article{16399,
  abstract     = {{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.

The sampling process is done in the preprocessing. There, the polygons are randomly distributed in our hierarchical data structure, the randomized sample tree. This tree only uses space that is linear in the number of polygons. In order to produce an approximate 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.

We 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.}},
  author       = {{Klein, Jan and Krokowski, Jens and Fischer, Matthias and Wand, Michael and Wanka, Rolf and Meyer auf der Heide, Friedhelm}},
  issn         = {{1054-7460}},
  journal      = {{Presence: Teleoperators and Virtual Environments}},
  pages        = {{617--637}},
  title        = {{{The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments}}},
  doi          = {{10.1162/1054746043280619}},
  year         = {{2004}},
}

@inproceedings{19790,
  abstract     = {{The advances in Internet technology have led to tremendous improvements in business, education, and science and have changed the way we think, live, and communicate. Information exchange has become ubiquitous by the possibilities offered through modern technologies. We are able to offer information 24 hours a day through our web sites and can leave messages every time and from anywhere in the world. This change in communication has led to new challenges. Enterprises have to deal with an information amount that doubles every year. The technological foundation to cope with this information explosion is given by Storage Area Networks (SANs), which are able to connect a great number of storage systems over a fast interconnection network. However, to be able to use the benefits of a SAN, an easy-to-use and efficient management support has to be given to the storage administrator. In this paper, we will suggest new storage management concepts and we will introduce a new management environment that is able to significantly reduce management costs and increases the performance and resource utilization of the given SAN infrastructure.}},
  author       = {{Scheideler, Christian and Salzwedel, Kay and Meyer auf der Heide, Friedhelm and Brinkmann, André and Vodisek, Mario and Rückert, Ulrich}},
  booktitle    = {{Proceedings of SSGRR 2003}},
  title        = {{{Storage Management as Means to cope with Exponential Information Growth}}},
  year         = {{2003}},
}

@inproceedings{2128,
  author       = {{Damerow, Valentina and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian}},
  booktitle    = {{ESA}},
  pages        = {{161----171}},
  publisher    = {{Springer}},
  title        = {{{Smoothed Motion Complexity}}},
  doi          = {{10.1007/978-3-540-39658-1_17}},
  volume       = {{2832}},
  year         = {{2003}},
}

@article{16481,
  abstract     = {{<jats:title>Zusammenfassung</jats:title><jats:p>Vernetzte Systeme sind zu unverzichtbaren Bestandteilen unseres Umfelds geworden, zum Beispiel als Höchstleistungsrechner, als Kommunikations- und Informationssysteme oder als Planungs- und Steuerungskomponenten von Transport- und Produktionssystemen. Die ständig wachsende Komplexität solcher Systeme stellt Informatiker und Ingenieure vor immer neue Herausforderungen. In diesem Beitrag beschreibe ich die Zielsetzungen und die Struktur des SFB 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen. Als Beispiel für unsere Arbeiten beschreibe ich einen algorithmisch orientierten Forschungszweig, in dem wir, ausgehend von theoretischen Problemen über effiziente Simulationen zwischen parallelen Rechenmodellen, Methoden, Techniken und Implementierungen entwickelt haben, die zu produktnahen Prototypen für die Speichervirtualisierung in verteilten Datenservern führen.</jats:p>}},
  author       = {{Meyer auf der Heide, Friedhelm}},
  issn         = {{2196-7032}},
  journal      = {{it - Information Technology}},
  title        = {{{Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications)}}},
  doi          = {{10.1524/itit.45.2.108.19606}},
  year         = {{2003}},
}

@article{16482,
  author       = {{Juurlink, Bernhardus and Kolman, Petr and Meyer auf der Heide, Friedhelm and Rieping, Ingo}},
  issn         = {{1570-8667}},
  journal      = {{Journal of Discrete Algorithms}},
  pages        = {{151--166}},
  title        = {{{Optimal broadcast on parallel locality models}}},
  doi          = {{10.1016/s1570-8667(03)00023-6}},
  year         = {{2003}},
}

@proceedings{16484,
  editor       = {{Rosenberg, Arnold L. and Meyer auf der Heide, Friedhelm}},
  isbn         = {{1581136617}},
  title        = {{{Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA '03}}},
  doi          = {{10.1145/777412}},
  year         = {{2003}},
}