With respect to those basic notions, we now investigate on the computability of natural OPERATIONS on regular sets: union, intersection, complement, convex hull, image, and pre-image under suitable classes of functions.}, author = {Ziegler, Martin}, booktitle = {Computability and Complexity in Analysis}, issn = {0942-5616}, number = {302-8/2003}, pages = {389--406}, title = {{Computable operators on regular sets}}, doi = {10.1002/malq.200310107}, year = {2003}, } @phdthesis{18967, author = {Räcke, Harald}, isbn = {3-935433-63-8}, title = {{Data Management and Routing in General Networks}}, year = {2003}, } @inproceedings{19833, abstract = {Communication facilities are important in Robotics if several robots have to work together. In this paper, we describe problems and solutions encountered while designing an infrared-based communication device for the mini robot Khepera. In contrast to traditional omnidirectional systems, it features directed, power-variable transmission in eight directions at unit[23.4]kbps up to a range of unit[1m]. It can differentiate incoming data signals from interference from adjacent sectors and can estimate their direction-of-arrival. We model the transmission over the infrared channel and show how interference influences the reception of the data signals. We also describe methods how to reduce these effects. We have tested the performance of the resulted signal processing in a worst case scenario by simulations and in experiments with a prototype implementation. The resulted module is especially suited for experimental evaluation of ad hoc network protocols and for position estimation.}, author = {Volbert, Klaus and Grünewald, Matthias and Schindelhauer, Christian and Rückert, Ulrich}, booktitle = {Proceedings of the 2nd International Conference on Autonomous Minirobots for Research and Edutainment}, pages = {113--122}, title = {{Directed power-variable infrared communication for the mini robot Khepera}}, year = {2003}, } @article{16481, abstract = {

Gegenüber anderen bekannten Web-Computing Projekten wie z.B. SETI@home oder distributed.net zeichnet sich dieses System dadurch aus, dass nicht Clients von einem zentralen Server "häppchenweise" unabhängige Teilprobleme anfordern und lösen, sondern dass die Clients gemeinsam an einem Problem arbeiten, indem sie nach dem BSP-Modell miteinander kommunizieren und sich synchronisieren.}, author = {Gehweiler, Joachim}, title = {{Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java}}, year = {2003}, } @article{19726, abstract = {The Paderborn University BSP (PUB) library is a C communication library based on the BSP model. The basic library supports buffered as well as unbuffered non-blocking communication between any pair of processors and a mechanism for synchronizing the processors in a barrier style. In addition, PUB provides non-blocking collective communication operations on arbitrary subsets of processors, the ability to partition the processors into independent groups that execute asynchronously from each other, and a zero-cost synchronization mechanism. Furthermore, some techniques used in the implementation of the PUB library deviate significantly from the techniques used in other BSP libraries.}, author = {Bonorden, Olaf and Juurlink, Ben and von Otte, Ingo and Rieping, Ingo}, issn = {0167-8191}, journal = {Parallel Computing}, pages = {187--207}, title = {{The Paderborn University BSP (PUB) library}}, doi = {10.1016/s0167-8191(02)00218-1}, year = {2003}, } @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}, } @article{16482, author = {Juurlink, Ben 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}, } @inproceedings{17423, author = {Mueck, Bengt and Dangelmaier, Wilhelm and Fischer, Matthias}, booktitle = {15th European Simulation Symposium (ESS 2003)}, pages = {367--371}, publisher = {SCS - Europe}, title = {{Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment}}, year = {2003}, } @inproceedings{18907, abstract = {In a (randomized) oblivious routing scheme the path chosen for a request

between a source $s$ and a target $t$ is independent from the current traffic

in the network. Hence, such a scheme consists of probability distributions

over $s-t$ paths for every source-target pair $s,t$ in the network.

In a recent result citeR02 it was shown that for any undirected network

there is an oblivious routing scheme that achieves a polylogarithmic

competitive ratio with respect to congestion. Subsequently, Azar et

al. citeACF+03 gave a polynomial time algorithm that for a given network

constructs the best oblivious routing scheme, i.e. the scheme that guarantees

the best possible competitive ratio.

Unfortunately, the latter result is based on the Ellipsoid algorithm; hence

it is unpractical for large networks.

In this paper we present a combinatorial algorithm for constructing an

oblivious routing scheme that guarantees a competitive ratio of $O(log^4n)$

for undirected networks. Furthermore, our approach yields a proof

for the existence of an oblivious routing scheme with competitive ratio

$O(log^3n)$, which is much simpler than the original proof from citeR02.}, author = {Bienkowski, Marcin and Korzeniowski, Miroslaw and Räcke, Harald}, booktitle = {Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '03}, isbn = {1581136617}, title = {{A practical algorithm for constructing oblivious routing schemes}}, doi = {10.1145/777412.777418}, year = {2003}, } @misc{19828, author = {Mahlmann, Peter}, title = {{Implementierung und Vergleich von Verfahren zum Information Retrieval im World Wide Web}}, year = {2003}, } @inproceedings{19900, author = {Klein, Jan and Zachmann, Gabriel}, booktitle = { Proc. ACM Symposium on Virtual Reality Software and Technology (VRST 2003)}, pages = {22--31}, title = {{Time-Critical Collision Detection Using an Average-Case Approach}}, doi = {10.1145/1008653.1008660}, 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}, } @inproceedings{18960, abstract = {We investigate distributed algorithms for mobile ad hoc networks for moving radio stations with adjustable transmission power in a worst case scenario. We consider two models to find a reasonable restriction on the worst-case mobility. In the pedestrian model we assume a maximum speed $v_max$ of the radio stations, while in the vehicular model we assume a maximum acceleration $a_max$ of the points. Our goal is to maintain persistent routes with nice communication network properties like hop-distance, energy-consumption, congestion and number of interferences. A route is persistent, if we can guarantee that all edges of this route can be uphold for a given time span $Delta$, which is a parameter denoting the minimum time the mobile network needs to adopt changes, i.e. update routing tables, change directory entries, etc. This $Delta$ can be used as the length of an update interval for a proactive routing scheme. We extend some known notions such as transmission range, interferences, spanner, power spanner and congestion to both mobility models and introduce a new parameter called crowdedness that states a lower bound on the number of radio interferences. Then we prove that a mobile spanner hosts a path system that polylogarithmically approximates the optimal congestion. We present distributed algorithms based on a grid clustering technique and a high-dimensional representation of the dynamical start situation which construct mobile spanners with low congestion, low interference number, low energy-consumption, and low degree. We measure the optimality of the output of our algorithm by comparing it with the optimal choice of persistent routes under the same circumstances with respect to pedestrian or vehicular worst-case movements. Finally, we present solutions for dynamic position information management under our mobility models.}, author = {Schindelhauer, Christian and Lukovszki, Tamás and Rührup, Stefan and Volbert, Klaus}, booktitle = {Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)}, isbn = {1581136617}, title = {{Worst case mobility in ad hoc networks}}, doi = {10.1145/777412.777448}, year = {2003}, } @article{19785, author = {Salzwedel, Kay A.}, isbn = {9783540008835}, issn = {0302-9743}, journal = {Algorithms for Memory Hierarchies}, title = {{Algorithmic Approaches for Storage Networks}}, doi = {10.1007/3-540-36574-5_12}, volume = {2625}, year = {2003}, } @inproceedings{19874, abstract = {We present a novel framework for hierarchical collision detection that can be applied to virtually all bounding volume (BV) hierarchies. It allows an application to trade quality for speed. Our algorithm yields an estimation of the quality, so that applications can specify the desired quality. In a timecritical system, applications can specify the maximum time budget instead, and quantitatively assess the quality of the results returned by the collision detection afterwards.}, author = {Klein, Jan and Zachmann, Gabriel}, booktitle = {Proc. 8th International Fall Workshop Vision, Modeling, and Visualization (VMV 2003)}, pages = {37--45}, title = {{ADB-Trees: Controlling the Error of Time-Critical Collision Detection}}, year = {2003}, } @inproceedings{2129, author = {Awerbuch, Baruch and Brinkmann, André and Scheideler, Christian}, booktitle = {ICALP}, pages = {1153----1168}, publisher = {Springer}, title = {{Anycasting in Adversarial Systems: Routing and Admission Control}}, volume = {2719}, 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}, } @inproceedings{16720, author = {Bonorden, Olaf and Bruls, N. and Kastens, U. and Le, D. K. and Meyer auf der Heide, Friedhelm and Niemann, J.-C. and Porrmann, M. and Rückert, U. and Slowik, A. and Thies, M.}, booktitle = {28th Annual IEEE International Conference on Local Computer Networks}, title = {{A holistic methodology for network processor design}}, doi = {10.1109/LCN.2003.1243185}, year = {2003}, } @inproceedings{18372, abstract = {Simulation und Visualisierung sind anerkannte Mittel zum Verstehen und Analysieren von Fertigungsprozessen. In Visualisierungen von Fertigungsprozessen können Betrachter frei und ungeleitet umherwandern. Erkenntnisse werden so aber eher zufällig erworben. Dieser Artikel skizziert ein System und Methoden, die den Betrachter unterstützen auf auffällige/signifikante Prozesse/ Punkte in Materialflusssimulationen aufmerksam zu werden und diese zu entschärfen. Es wird der Entwurf eines Werkzeugs beschrieben, dass den Betrachter einer Simulation die Möglichkeit bietet, signifikante Produktionsprozesse interaktiv zu verbessern. Der Benutzer wird sich in einer virtuellen 3D-Umgebung (Walkthrough-System) bewegen können und automatisch ermittelte Indizien für signifikante Abläufe erhalten. Zugleich soll die Simulation signifikante Objekte genauer simulieren. Bekundet der Benutzer Interesse an einem signifikanten Prozess, wird er automatisch zu dem jeweiligen Ort geführt werden und dort durch Eingriffe in die Simulation die kritische Situation experimentell untersuchen können. Da der kritische Moment in der Vergangenheit liegt und somit vom Betrachter schon verpasst ist, wird es dem Betrachter möglich sein, die Simulation auf einen Zeitpunkt vor dem Eintreten zurück zu setzen. Die virtuelle Szene (3D-Grafik-Modelle) einer typischen dynamischen Simulationsumgebung ist in der Regel zu komplex, um sie in Echtzeit in einem Walkthrough-System zu visualisieren und darzustellen. Typischerweise werden Approximationsverfahren eingesetzt, um die Komplexität zu reduzieren und ein flüssiges Navigieren des Betrachters zu erlauben. Durch spezifische Simulations-Anforderungen ist bekannt, an welchen Objekten des Simulationsmodells Probleme auftreten; sie sind für den Betrachter wichtig. Die zugehörigen virtuellen 3D-Repräsentanten, können von den Approximationsalgorithmen mit einer besonders hohen Darstellungsqualität dargestellt werden und die übrigen Teile der virtuellen Szene entsprechend vernachlässigt werden. Solche Approximationsalgorithmen und Datenstrukturen nutzen die spezifischen Eigenschaften virtueller Simulationsumgebungen aus, um eine hohe Darstellungsqualität und Darstellungsperformance zu erreichen. }, author = {Dangelmaier, Wilhelm and Franke, Werner and Mueck, Bengt and Fischer, Matthias}, booktitle = {2. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung}, pages = {141--151}, title = {{Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen}}, volume = {123}, year = {2003}, } @article{18567, author = {Adler, Micah and Vöcking, Berthold and Sohler, Christian and Räcke, Harald and Sivadasan, Naveen}, journal = {Combinatorics, Probability & Computing}, pages = {225--244}, title = {{Randomized Pursuit-Evasion in Graphs}}, year = {2003}, } @inproceedings{18947, abstract = {In this paper, we define a Petri net model for the network or routing layer of a mobile ad hoc network. Such networks require routing strategies substantially different from those used in static communication networks. The model pre- sented consists of two layers, a location service and a po- sition based routing. Both are described in detail. Our ap- proach considers a very strong definition of fault tolerance thereby improving state-of-the-art ad hoc routing protocols in several respects. Modeling of the communication archi- tecture for mobile ad hoc networks is part of our overall effort towards a design methodology for distributed embed- ded real-time systems including dynamically evolving com- ponents.}, author = {Rust, Carsten and Stappert, Friedhelm and Lukovszki, Tamás}, booktitle = {7th World Multiconference on Systemics, Cybernetics and Informatics}, title = {{A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture}}, year = {2003}, } @inproceedings{18966, abstract = {A recent seminal result of Räcke is that for any undirected network there is an oblivious routing algorithm with a polylogarithmic competitive ratio with respect to congestion. Unfortunately, Räcke's construction is not polynomial time. We give a polynomial time construction that guarantees Räcke's bounds, and more generally gives the true optimal ratio for any (undirected or directed) network.}, author = {Azar, Yossi and Cohen, Edith and Fiat, Amos and Kaplan, Haim and Racke, Harald}, booktitle = {Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03}, isbn = {1581136749}, title = {{Optimal oblivious routing in polynomial time}}, doi = {10.1145/780542.780599}, year = {2003}, } @inproceedings{19806, abstract = {We try to close the gap between theoretical investigations of wireless network topologies and realistic wireless environments. For point-to-point communication, we examine theoretically well-analyzed sparse graphs, i.e. the Yao-graph, the SparsY-graph, and the SymmY-graph. We present distributed algorithms that can be used to build up these graphs in time $O(log n)$ per node without the use of any geo-graphical positioning system. Our algorithms are based only on local knowledge and local decisions and make use of power control to establish communication links with low energy-cost. We compare these algorithms with respect to congestion, dilation, and energy. For congestion we introduce different measures that allow us to investigate the difference between real-world wireless networks and models for wireless communication at a high level of abstraction. For more realistic simulations we extend our simulation environment SAHNE. We use a realistic transmission model for directed communication that uses sector subdivision. Finally, our experimental results show that our topologies and algorithms work well in a distributed environment and we give some recommendations for the topology control based on our simulations.}, author = {Rührup, S. and Schindelhauer, C. and Volbert, K. and Grünewald, M.}, booktitle = {Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS)}, isbn = {0769519261}, title = {{Performance of distributed algorithms for topology control in wireless networks}}, doi = {10.1109/ipdps.2003.1213107}, year = {2003}, } @inproceedings{19952, abstract = {Graph minors theory, developed by Robertson & Seymour, provides a list of powerful theoretical results and tools. However, the wide spread opinion in Graph Algorithms community about this theory is that it is mainly of theoretical importance. The main purpose of this paper is to show how very deep min-max and duality theorems from Graph Minors can be used to obtain essential speed-up to many known algorithms on different domination problems.}, author = {Fomin, Fedor V. and Thilikos, Dimitrios M.}, booktitle = {Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)}, issn = {0097-5397}, title = {{Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up}}, doi = {10.1137/s0097539702419649}, year = {2003}, } @article{20435, author = {Hamann, Heiko}, journal = {Complex Systems}, number = {3}, pages = {263----268}, title = {{Definition and Behavior of Langton's Ant in Three Dimensions}}, volume = {14}, year = {2003}, } @article{18176, author = {Ziegler, Martin}, issn = {0942-5616}, journal = {Mathematical Logic Quarterly (MLQ)}, number = {S1}, pages = {157--181}, title = {{Computability on Regular Subsets of Euclidean Space}}, doi = {10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4}, volume = {48}, year = {2002}, } @phdthesis{18169, abstract = {Die Implementierung von Algorithmen zur Lösung geometrischer Probleme im Euklidischen Raum (z.B. Berechnung der konvexen Hülle oder des Durchschnitts zweier Polyeder) stellt sich oftmals als hochgradig nichttrivial heraus. Ob und unter welchen Voraussetzungen die verursachenden numerischen Instabilitäten überhaupt ini den Griff zu kriegen oder vielmehr dem Problem inhärent sind, untersucht diese Arbeit in einem auf Turing zurückgehenden Rechenmodell. Im Gegensatz zu algebraischen Ansätzen geht jenes nicht von der Verfügbarkeit exakter Tests auf z.B. Gleichheit reeller Zahlen aus, sondern berücksichtigt die auf Digitalcomputern tatsächlich realisierbare Approximation durch rationale Zahlen. In diesem Rahmen werden beweisbar stabile Algorithmen zum Lösen linearer Gleichungssysteme, zur Matrix-Diagonalisierung und zur linearen wie nichtlinearen Optimierung präsentiert. Als wichtiges technisches Hilfsmittel dient ein neuer Berechenbarkeitsbegriff für reguläre unendliche Mengen reller Zahlen, der sich aus dem systematischen Vergleich verschiedener der Literatur entnommener ad-hoc Ansätze ergibt.}, author = {Ziegler, Martin}, title = {{Zur Berechenbarkeit reeller geometrischer Probleme}}, year = {2002}, } @inproceedings{18177, abstract = {Consider the classical point location problem: for a fixed arrangement of m hyperplanes and its induced partition of d-space report, upon input of some point, which face it lies in. With sufficient memory, this is easy to solve in logarithmic time O(log m). But how fast can algorithms (formalized as Linear Decision Trees) of *minimum* size be? The present work gives lower and upper bounds for the time complexity of point location under this constraint. They show that, in addition to m, the maximum number w of walls of a cell turns out to be a crucial parameter. We also consider a relaxation of the strict minimum-size condition allowing for constant factor overhead.}, author = {Ziegler, Martin and Damerow, Valentina and Finschi, Lukas}, booktitle = {Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG'02)}, title = {{Point Location Algorithms of Minimum Size}}, year = {2002}, } @inbook{16723, author = {Meyer auf der Heide, Friedhelm and Kumar, Mohan and Nikoletseas, Sotiris and Spirakis, Paul}, booktitle = {Euro-Par 2002 Parallel Processing}, isbn = {9783540440499}, issn = {0302-9743}, title = {{Mobile Computing, Mobile Networks}}, doi = {10.1007/3-540-45706-2_133}, year = {2002}, } @inproceedings{19727, author = {Bonorden, Olaf and Meyer auf der Heide, Friedhelm and Wanka, Rolf}, booktitle = {Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)}, pages = {2202--2208}, title = {{Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example}}, year = {2002}, } @inproceedings{19873, abstract = {We present a new and easy to use framework for navigating through scenes of arbitrary complexity and topology. In the preprocessing, images for discrete viewpoints and viewing directions are rendered and stored on an external volume. During navigation each image can be displayed within a very short time by loading it from the volume. For acceleration, our prefetching strategy loads possibly needed images for the next few frames if the viewer takes a break. The measurements show that we achieve interactive frame rates, whereby the difference between the minimal and maximal display time is very small. Our system works well with scenes modelled by polygons, but also digital photos can easily be used for describing a 3D scene.}, author = {Klein, Jan and Krokowski, Jens and Cuntz, Nicolas}, booktitle = {Proc. of 4. GI-Informatiktage}, pages = {224--229}, title = {{Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression}}, year = {2002}, } @inproceedings{18179, abstract = {Do the solutions of linear equations depend computably on their coefficients? Implicitly, this has been one of the central questions in linear algebra since the very beginning of the subject and the famous Gauß algorithm is one of its numerical answers. Today there exists a tremendous number of algorithms which solve this problem for different types of linear equations. However, actual implementations in floating point arithmetic keep exhibiting numerical instabilities for ill-conditioned inputs. This situation raises the question which of these instabilities are intrinsic, thus caused by the very nature of the problem, and which are just side effects of specific algorithms. To approach this principle question we revisit linear equations from the rigorous point of view of computability. Therefore we apply methods of computable analysis, which is the Turing machine based theory of computable real number functions. It turns out that, given the coefficients of a system of linear equations, we can compute the space of solutions, if and only if the dimension of the solution space is known in advance. Especially, this explains why there cannot exist any stable algorithms under weaker assumptions.}, author = {Brattka, Vasco and Ziegler, Martin}, booktitle = {Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science}, pages = {95--106}, title = {{Computability of Linear Equations}}, doi = {10.1007/978-0-387-35608-2_9}, year = {2002}, } @inproceedings{16490, 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. For the computation of an approximate image of the scene, a sampling technique is used. In the preprocessing, a so-called sample tree is built whose nodes contain randomly selected polygons from the scene. This tree only uses space that is linear in the number of polygons. In order to produce an image of the scene, the tree is traversed and polygons stored in the visited nodes are rendered. During the interactive walkthrough, parts of the sample tree are loaded from local or remote hard disk. 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}, booktitle = {Proceedings of the ACM symposium on Virtual reality software and technology - VRST '02}, isbn = {1581135300}, title = {{The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments}}, doi = {10.1145/585740.585764}, year = {2002}, } @inproceedings{18369, abstract = {Visualising is a method used to help experiencing and understanding causal cohesions in simulation processes. For this purpose, tools for visualising are already implemented in prevalent simulation systems. The user creates his simulation model and generates a 3-dimensional (2,5-dimensional) visualising by means of the simulation system. This helps examining the process which makes it easier for the viewer to understand it. Simulation tools usually only provide the opportunity for a unidirectional visualising. In a 3-dimensional surrounding the viewer can not implement an interaction with the simulation while the system is running. Though an interaction during the simulation run enables the user to gain a better understanding of causal cohesions. Solutions via HLA are sophisticated and therefore rather suited for extensive projects. We present a distributed system consisting of a commercial manufacturing simulation tool, a coupling module and a walkthrough system. The distributed system in conjunctions with the coupling module guarantees generality and a wide field of applications of the walkthrough system. Further it guarantees flexibility and selection of the specialized graphics hardware for the walkthrough system. A further contribution of this paper is the solution of the time synchronisation problem caused by simulation tool and walkthrough system. }, author = {Mueck, Bengt and Dangelmaier, Wilhelm and Fischer, Matthias and Klemisch, Wolfram}, booktitle = {Simulation und Visualisierung}, pages = {71--84}, publisher = {SCS European Publishing House}, title = {{Bi-directional Coupling of Simulation Tools with a Walkthrough-System}}, year = {2002}, } @inproceedings{18566, abstract = {We analyze a randomized pursuit-evasion game on graphs. This game is played by two players, a hunter and a rabbit. Let G be any connected, undirected graph with n nodes. The game is played in rounds and in each round both the hunter and the rabbit are located at a node of the graph. Between rounds both the hunter and the rabbit can stay at the current node or move to another node. The hunter is assumed to be restricted to the graph G: in every round, the hunter can move using at most one edge. For the rabbit we investigate two models: in one model the rabbit is restricted to the same graph as the hunter, and in the other model the rabbit is unrestricted, i.e., it can jump to an arbitrary node in every round. We say that the rabbit is caught as soon as hunter and rabbit are located at the same node in a round. The goal of the hunter is to catch the rabbit in as few rounds as possible, whereas the rabbit aims to maximize the number of rounds until it is caught. Given a randomized hunter strategy for G, the escape length for that strategy is the worst case expected number of rounds it takes the hunter to catch the rabbit, where the worst case is with regards to all (possibly randomized) rabbit strategies. Our main result is a hunter strategy for general graphs with an escape length of only O (n log (diam(G))) against restricted as well as unrestricted rabbits. This bound is close to optimal since Ω(n) is a trivial lower bound on the escape length in both models. Furthermore, we prove that our upper bound is optimal up to constant factors against unrestricted rabbits.}, author = {Adler, Micah and Räcke, Harald and Sivadasan, Naveen and Sohler, Christian and Vöcking, Berthold}, booktitle = {Proceedings of the 29th International Colloquium on Automata, Languages and Programming}, isbn = {9783540438649}, issn = {0302-9743}, title = {{Randomized Pursuit-Evasion in Graphs}}, doi = {10.1007/3-540-45465-9_77}, year = {2002}, } @phdthesis{18573, author = {Sohler, Christian}, isbn = {3-935433-28-X}, title = {{Property Testing and Geometry}}, year = {2002}, } @inproceedings{19850, author = {Wanka, Rolf}, booktitle = {Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)}, isbn = {9783540003311}, issn = {0302-9743}, pages = {413--420}, title = {{Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal}}, doi = {10.1007/3-540-36379-3_36}, year = {2002}, } @inproceedings{2136, author = {Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}, booktitle = {SPAA}, pages = {53----62}, title = {{Compact, adaptive placement schemes for non-uniform requirements}}, year = {2002}, } @article{16489, author = {Krick, C. and Meyer auf der Heide, Friedhelm and Räcke, H. and Vöcking, B. and Westermann, M.}, issn = {1432-4350}, journal = {Theory of Computing Systems}, pages = {217--245}, title = {{Data Management in Networks: Experimental Evaluation of a Provably Good Strategy}}, doi = {10.1007/s00224-001-1045-z}, year = {2002}, } @inproceedings{16491, author = {Meyer auf der Heide, Friedhelm and Schindelhauer, Christian and Volbert, Klaus and Grünewald, Matthias}, booktitle = {Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '02}, isbn = {1581135297}, title = {{Energy, congestion and dilation in radio networks}}, doi = {10.1145/564870.564910}, year = {2002}, } @article{18853, author = {Sohler, Christian and Czumaj, Artur}, journal = {Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS)}, pages = {83--92}, title = {{Abstract Combinatorial Programs and Efficient Property Testers}}, year = {2002}, } @techreport{18961, author = {Lukovszki, Tamás and Benczúr, A.}, title = {{A Degree O(log log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing}}, year = {2002}, } @inproceedings{18152, abstract = {Computing the spectral decomposition of a normal matrix is among the most frequent tasks to numerical mathematics. A vast range of methods are employed to do so, but all of them suffer from instabilities when applied to degenerate matrices, i.e., those having multiple eigenvalues. We investigate the spectral representation's effectivity properties on the sound formal basis of computable analysis. It turns out that in general the eigenvectors cannot be computed from a given matrix. If however the size of the matrix' spectrum (=number of different eigenvalues) is known in advance, it can be diagonalized effectively. Thus, in principle the spectral decomposition can be computed under remarkably weak non-degeneracy conditions.}, author = {Ziegler, Martin and Brattka, Vasco}, booktitle = {Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA'2000)}, isbn = {9783540421979}, issn = {0302-9743}, pages = {378--388}, title = {{A Computable Spectral Theorem}}, doi = {10.1007/3-540-45335-0_23}, volume = {2064}, year = {2001}, } @inproceedings{16492, abstract = {We present a new output-sensitive rendering algorithm, the randomized z-buffer algorithm. It renders an image of an arbitrary three-dimensional scene consisting of triangular primitives by reconstruction from a dynamically chosen set of random surface sample points. This approach is independent of mesh connectivity and topology. The resulting rendering time grows only logarithmically with the numbers of triangles in the scene. We were able to render walkthroughs of scenes of up to 10^14 triangles at interactive frame rates. Automatic identification of low detail scene components ensures that the rendering speed of the randomized z-buffer cannot drop below that of conventional z-buffer rendering. Experimental and analytical evidence is given that the image quality is comparable to that of common approaches like z-buffer rendering. The precomputed data structures employed by the randomized z-buffer allow for interactive dynamic updates of the scene. Their memory requirements grow only linearly with the number of triangles and allow for a scene graph based instantiation scheme to further reduce memory consumption.}, author = {Wand, Michael and Fischer, Matthias and Peter, Ingmar and Meyer auf der Heide, Friedhelm and Straßer, Wolfgang}, booktitle = {Proceedings of the 28th annual conference on Computer graphics and interactive techniques - SIGGRAPH '01}, isbn = {158113374X}, title = {{The randomized z-buffer algorithm}}, doi = {10.1145/383259.383299}, year = {2001}, } @book{16722, editor = {Meyer auf der Heide, Friedhelm}, isbn = {9783540424932}, issn = {0302-9743}, publisher = {Springer }, title = {{Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark}}, doi = {10.1007/3-540-44676-1}, year = {2001}, } @inbook{16493, author = {Meyer auf der Heide, Friedhelm}, booktitle = {Graph-Theoretic Concepts in Computer Science}, isbn = {9783540427070}, issn = {0302-9743}, title = {{Data Management in Networks}}, doi = {10.1007/3-540-45477-2_2}, volume = {2204}, year = {2001}, } @inproceedings{2141, author = {Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}, booktitle = {PDP}, pages = {227----234}, publisher = {IEEE Computer Society}, title = {{SIMLAB-A Simulation Environment for Storage Area Networks}}, year = {2001}, } @article{2139, author = {Meyer auf der Heide, Friedhelm and Scheideler, Christian}, journal = {Combinatorica}, number = {1}, pages = {95----138}, title = {{Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols}}, doi = {10.1007/s004930170007}, volume = {21}, year = {2001}, } @inbook{16494, author = {Meyer auf der Heide, Friedhelm and Wanka, Rolf}, booktitle = {Computational Science - ICCS 2001}, isbn = {9783540422334}, issn = {0302-9743}, title = {{Parallel Bridging Models and Their Impact on Algorithm Design}}, doi = {10.1007/3-540-45718-6_68}, year = {2001}, } @inproceedings{18166, abstract = {What is the maximum number of edges of the d-dimensional hypercube, denoted by S(d,k), that can be sliced by k many hyperplanes? This question on combinatorial properties of Euclidean geometry arising from linear separability considerations in the theory of Perceptrons has become an issue on its own. We use computational and combinatorial methods to obtain new bounds on S(d,k), s<=8. These strengthen earlier results on hypercube cut numbers.}, author = {Ziegler, Martin and Emamy-Khansari, M. Reza}, booktitle = {Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG'2001)}, pages = {155--164}, title = {{New Bounds for Hypercube Slicing Numbers}}, volume = {AA}, year = {2001}, } @inproceedings{18370, abstract = {We present a new approximate occlusion-culling algorithm that in contrast to other algorithms, manages the objects of the scene in a 3D-sectorgraph. For generating a frame, as far as possible only the visible objects are rendered that can be found quickly by an edge of the graph. The algorithm allows a real-time navigation with over 20 frames per second in complex scenes consisting of over 10 millions of polygons. Moreover, approximation errors are very low.}, author = {Klein, Jan and Fischer, Matthias}, booktitle = {Proc. of 3. GI-Informatiktage 2001}, pages = {275 -- 278}, title = {{Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph}}, year = {2001}, } @inproceedings{18750, author = {Sohler, Christian and Czumaj, Artur}, booktitle = {Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms}, pages = {865--872}, title = {{Soft Kinetic Data Structures}}, year = {2001}, } @inproceedings{18964, author = {Lukovszki, Tamás and Maheshwari, Anil and Zeh, Norbert}, booktitle = {Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS}, isbn = {9783540430025}, issn = {0302-9743}, title = {{I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems}}, doi = {10.1007/3-540-45294-x_21}, year = {2001}, } @article{18749, author = {Czumaj, Artur and Sohler, Christian}, isbn = {9783540422877}, issn = {0302-9743}, journal = {Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)}, pages = {493--505}, title = {{Testing Hypergraph Coloring}}, doi = {10.1007/3-540-48224-5_41}, year = {2001}, } @article{18857, abstract = {This paper investigates geometric problems in the context of property testing algorithms. Property testing is an emerging area in computer science in which one is aiming at verifying whether a given object has a predetermined property or is “far” from any object having the property. Although there has been some research previously done in testing geometric properties, prior works have been mostly dealing with the study of combinatorial notion of the distance defining whether an object is “far” or it is “close”; very little research has been done for geometric notion of distance measures, that is, distance measures that are based on the geometry underlying input objects. The main objective of this work is to develop sound models to study geometric problems in the context of property testing. Comparing to the previous work in property testing, there are two novel aspects developed in this paper: geometric measures of being close to an object having the predetermined property, and the use of geometric data structures as basic primitives to design the testers. We believe that the second aspect is of special importance in the context of property testing and that the use of specialized data structures as basic primitives in the testers can be applied to other important problems in this area. We shall discuss a number of models that in our opinion fit best geometric problems and apply them to study geometric properties for three very fundamental and representative problems in the area: testing convex position, testing map labeling, and testing clusterability.}, author = {Sohler, Christian and Czumaj, Artur}, journal = {Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)}, pages = {266--277}, title = {{Property Testing with Geometric Queries}}, doi = {10.1007/3-540-44676-1_22}, year = {2001}, } @phdthesis{19622, author = {Schröder, Klaus}, isbn = {3-931466-88-4}, title = {{Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing}}, year = {2001}, } @inproceedings{19797, author = {Salzwedel, Kay and Hartmann, Georg and Wolff, Carsten and Preis, Robert}, booktitle = {Proceedings of the PDPTA 2001}, pages = {463--470}, title = {{Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN)}}, volume = {1}, year = {2001}, } @inproceedings{18168, abstract = {We consider the classical LINEAR OPTIMIZATION Problem, but in the Turing rather than the RealRAM model. Asking for mere computability of a function's maximum over some closed domain, we show that the common presumptions 'full-dimensional' and `bounded' in fact cannot be omitted: The sound framework of Recursive Analysis enables us to rigorously prove this folkloristic observation! On the other hand, convexity of this domain may be weakened to connectedness, and even NON-linear functions turn out to be effectively optimizable.}, author = {Brattka, Vasco and Ziegler, Martin}, booktitle = {Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG'01)}, pages = {181--184}, title = {{Turing Computability of (Non-)Linear Optimization}}, year = {2001}, } @inbook{16497, author = {Meyer auf der Heide, Friedhelm and Kutyłowski, Mirosław and Ragde, Prabhakar}, booktitle = {Euro-Par 2000 Parallel Processing}, isbn = {9783540679561}, issn = {0302-9743}, title = {{Complexity Theory and Algorithms}}, doi = {10.1007/3-540-44520-x_59}, year = {2000}, } @article{17010, author = {Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, issn = {0097-5397}, journal = {SIAM Journal on Computing}, pages = {1703--1739}, title = {{Contention Resolution in Hashing Based Shared Memory Simulations}}, doi = {10.1137/s009753979529564x}, year = {2000}, } @inproceedings{17990, abstract = {We consider the notion of Property Testing as applied to computational geometry. We aim at developing efficient algorithms which determine whether a given (geometrical) object has a predetermined property Q or is 'far' from any object having the property. We show that many basic geometric properties have very efficient testing algorithms, whose running time is significantly smaller than the object description size.}, author = {Czumaj, Artur and Sohler, Christian and Ziegler, Martin}, booktitle = {Proceedings of the 8th Annual European Symposium on Algorithms (ESA'00)}, isbn = {9783540410041}, issn = {0302-9743}, pages = {155--166}, publisher = {Springer}, title = {{Property Testing in Computational Geometry}}, doi = {10.1007/3-540-45253-2_15}, volume = {4698}, year = {2000}, } @inproceedings{18962, author = {Govindarajan, Sathish and Lukovszki, Tamas and Maheshwari, Anil and Zeh, Norbert}, booktitle = {Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS}, issn = {0178-4617}, pages = {585--614}, title = {{I/O-Efficient Well-Separated Pair Decomposition and Applications}}, doi = {10.1007/s00453-005-1197-3}, year = {2000}, } @article{2145, author = {Scheideler, Christian and Vöcking, Berthold}, journal = {SIAM J. Comput.}, number = {4}, pages = {1126----1155}, title = {{From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols}}, doi = {10.1137/S0097539799353431}, volume = {30}, year = {2000}, } @inproceedings{18146, abstract = {Since its very beginning, linear algebra is a highly algorithmic subject. Let us just mention the famous Gauss Algorithm which was invented before the theory of algorithms has been developed. The purpose of this paper is to link linear algebra explicitly to computable analysis, that is the theory of computable real number functions. Especially, we will investigate in which sense the dimension of a given linear subspace can be computed. The answer highly depends on how the linear subspace is given: if it is given by a finite number of vectors whose linear span represents the space, then the dimension does not depend continuously on these vectors and consequently it cannot be computed. If the linear subspace is represented via its distance function, which is a standard way to represent closed subspaces in computable analysis, then the dimension does computably depend on the distance function.}, author = {Ziegler, Martin and Brattka, Vasco}, booktitle = {SOFSEM 2000: Theory and Practice of Informatics}, isbn = {9783540413486}, issn = {0302-9743}, pages = {450--458}, publisher = {Springer}, title = {{Computing the Dimension of Linear Subspaces}}, doi = {10.1007/3-540-44411-4_34}, volume = {1963}, year = {2000}, } @phdthesis{19620, author = {Rieping, Ingo}, isbn = {3-931466-80-9}, title = {{Communication in Parallel Systems-Models, Algorithms and Implementations}}, year = {2000}, } @techreport{19733, author = {Bonorden, Olaf and Rieping, Ingo and von Otte, Ingo and Juurlink, Bernhardus}, title = {{PUB-Library, Release 7.0, User Guide and Function Reference}}, year = {2000}, } @inproceedings{2146, author = {Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}, booktitle = {PDPTA}, title = {{Distributed Path Selection for Storage Networks}}, year = {2000}, } @inproceedings{2211, author = {Czumaj, Artur and Scheideler, Christian}, booktitle = {32nd ACM Symposium on Theory of Computing}, pages = {38--47}, title = {{A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems }}, year = {2000}, } @techreport{17865, abstract = {We present a new output-sensitive rendering algorithm, the randomized z-buffer algorithm. It renders an image of a three dimensional scene of triangular primitives by reconstruction from a random sample of surface points which are chosen with a probability proportional to the projected area of the objects. The approach is independent of mesh connectivity and topology. It leads to a rendering time that grows only logarithmically with the numbers of triangles in the scene and to linear memory consumption, thus allowing walkthroughs of scenes of extreme complexity. We consider different methods for image reconstruction which aim at correctness, rendering speed and image quality and we develop an efficient data structure for sample extraction in output-sensitive time which allows for efficient dynamic updates of the scene. Experiments confirm that scenes consisting of some hundred billion triangles can be rendered within seconds with an image quality comparable to a conventional z-buffer rendering; in special cases, realtime performance can be achieved.}, author = {Wand, Michael and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, title = {{Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes}}, year = {2000}, } @phdthesis{19621, author = {Westermann, Matthias}, isbn = {3-931466-89-2}, title = {{Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints}}, year = {2000}, } @misc{19784, author = {Scheideler, Christian}, isbn = {3-931466-77-9}, title = {{Probabilistic Methods for Coordination Problems}}, year = {2000}, } @inproceedings{2147, author = {Czumaj, Artur and Scheideler, Christian}, booktitle = {SODA}, pages = {30----39}, title = {{Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma}}, year = {2000}, } @inproceedings{16495, author = {Meyer auf der Heide, Friedhelm and Räcke, H. and Westermann, M.}, booktitle = {Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures - SPAA '00}, isbn = {1581131852}, title = {{Data management in hierarchical bus networks}}, doi = {10.1145/341800.341814}, year = {2000}, } @inproceedings{18150, abstract = {What is the minimum number of hyperplanes that slice all edges of the d-dimensional hypercube? The answers have been known for d<=4.

This work settles the problem for d=5 and d=6. More precisely, a computer search implies that 4 hyperplanes do not suffice for this purpose (but 5 do).

We also develop computational approaches for attacking this extremal problem from combinatorial geometry in higher dimensions. They allow us to determine for example all maximal sliceable subsets of hypercube edges up to dimension 7.}, author = {Ziegler, Martin and Sohler, Christian}, booktitle = {Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG'00)}, pages = {73--79}, title = {{Computing Cut Numbers}}, year = {2000}, } @article{18446, author = {Lorys, Krzysztof and Wanka, Rolf and Oesterdiekhoff, Brigitte and Kutylowski, Miroslaw}, journal = {Journal of the ACM}, pages = {944--967}, title = {{Periodification Scheme: Constructing Sorting Networks with Constant Period}}, volume = {45}, year = {2000}, } @article{2143, author = {Adler, Micah and Scheideler, Christian}, journal = {Theory Comput. Syst.}, number = {5/6}, pages = {337----391}, title = {{Efficient Communication Strategies for Ad Hoc Wireless Networks}}, doi = {10.1007/s002240010006}, volume = {33}, year = {2000}, } @inproceedings{2150, author = {Czumaj, Artur and Scheideler, Christian}, booktitle = {STOC}, pages = {38----47}, publisher = {ACM}, title = {{A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)}}, year = {2000}, } @article{2148, author = {Czumaj, Artur and Scheideler, Christian}, journal = {Random Struct. Algorithms}, number = {3-4}, pages = {213----237}, title = {{Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma}}, volume = {17}, year = {2000}, } @article{16345, author = {Meyer auf der Heide, Friedhelm and Wanka, Rolf}, journal = {ForschungsForum Paderborn}, pages = {112--116}, title = {{Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik}}, year = {2000}, } @inproceedings{16496, abstract = {We present a general framework for the development of on-line algorithms for data management in networks with limited memory capacities. These algorithms dynamically create and delete copies of shared data objects that can be read and written by the nodes in the network. Our algorithms aim to minimize the congestion, i.e., the maximum communication load over all network resources, so that that none of these resources become a communication bottleneck. We give several examples of networks for which our framework yields efficient algorithms, including meshes, fat-trees, hypercubic networks, and complete networks. For example, our framework yields an $O(d cdot log n)$-competitive caching algorithm for $d$-dimensional meshes of size $n$ with respect to the congestion on the communication links, and an $O(1)$-competitive algorithms for complete networks with respect to the congestion at the memory modules due to remote accesses. Previous work on data management in networks either neglects memory capacity constraints or minimizes only the total communication load, i.e., the sum of the communication load over all resources, which may produce congestion as some of the links become bottlenecks.}, author = {Meyer auf der Heide, Friedhelm and Vöcking, Berthold and Westermann, Matthias}, booktitle = {SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms}, isbn = {0898714532}, pages = {430–439}, title = {{Caching in networks}}, year = {2000}, } @inproceedings{19849, author = {Bednara, M. and Beyer, O. and Teich, J. and Wanka, R.}, booktitle = {Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP)}, isbn = {0769507166}, pages = {299--308}, title = {{Tradeoff analysis and architecture design of a hybrid hardware/software sorter}}, doi = {10.1109/asap.2000.862400}, year = {2000}, } @inproceedings{2149, author = {Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}, booktitle = {SPAA}, pages = {119----128}, title = {{Efficient, distributed data placement strategies for storage area networks (extended abstract)}}, year = {2000}, } @inbook{17053, author = {Meyer auf der Heide, Friedhelm and Vöcking, Berthold and Westermann, Matthias}, booktitle = {Algorithms - ESA’ 99}, isbn = {9783540662518}, issn = {0302-9743}, title = {{Provably Good and Practical Strategies for Non-uniform Data Management in Networks}}, doi = {10.1007/3-540-48481-7_9}, year = {1999}, } @inproceedings{19732, abstract = {The Paderborn University BSP (PUB) library is a parallel C library based on the BSP model. The basic library supports buffered and unbuffered asynchronous communication between any pair of processors, and a mechanism for synchronizing the processors in a barrier style. In ad-dition, it provides routines for collective communication on arbitrary subsets of processors, partition operations, and a zero-cost synchronization mechanism. Furthermore, some techniques used in its implementation deviate significantly from the techniques used in other BSP libraries.}, author = {Bonorden, O. and Juurlink, B. and Von Otte, I. and Rieping, I.}, booktitle = {Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing}, isbn = {0769501435}, pages = {99--104}, title = {{The Paderborn university BSP (PUB) library-design, implementation and performance}}, doi = {10.1109/ipps.1999.760442}, year = {1999}, } @inproceedings{2210, author = {Berenbrink, Petra and Riedel, Marco and Scheideler, Christian}, booktitle = {International Workshop on Communication and Data Management in Large Networks (CDMLarge)}, pages = {2--12}, title = {{Design of the PRESTO Multimedia Storage Network (Extended Abstract)}}, year = {1999}, } @inproceedings{2164, author = {Berenbrink, Petra and Scheideler, Christian}, booktitle = {SODA}, pages = {112----121}, title = {{Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths}}, year = {1999}, }