@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}}, } @article{16503, author = {{Meyer auf der Heide, Friedhelm and Schröder, Klaus and Schwarze, Frank}}, issn = {{0304-3975}}, journal = {{Theoretical Computer Science}}, pages = {{181--200}}, title = {{{Routing on networks of optical crossbars}}}, doi = {{10.1016/s0304-3975(97)86791-6}}, volume = {{196}}, year = {{1998}}, } @article{16504, author = {{Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm}}, issn = {{0304-3975}}, journal = {{Theoretical Computer Science}}, pages = {{175--203}}, title = {{{Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model}}}, doi = {{10.1016/s0304-3975(98)00020-6}}, year = {{1998}}, } @inbook{16562, author = {{Meyer auf der Heide, Friedhelm and Martinez, Gabriel Terán}}, booktitle = {{LATIN'98: Theoretical Informatics}}, isbn = {{9783540642756}}, issn = {{0302-9743}}, title = {{{Communication-efficient parallel multiway and approximate minimum cut computation}}}, doi = {{10.1007/bfb0054332}}, year = {{1998}}, } @inproceedings{16563, author = {{Cole, Richard and Maggs, Bruce M. and Meyer auf der Heide, Friedhelm and Mitzenmacher, Michael and Richa, Andréa W. and Schröder, Klaus and Sitaraman, Ramesh K. and Vöcking, Berthold}}, booktitle = {{Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98}}, isbn = {{0897919629}}, title = {{{Randomized protocols for low-congestion circuit routing in multistage interconnection networks}}}, doi = {{10.1145/276698.276790}}, year = {{1998}}, } @inproceedings{2175, author = {{Bock, Stefan and Meyer auf der Heide, Friedhelm and Scheideler, Christian}}, booktitle = {{IPPS}}, pages = {{326----332}}, publisher = {{IEEE Computer Society}}, title = {{{Optimal Wormhole Routing in the (n, d)-Torus}}}, year = {{1997}}, } @article{16564, author = {{Grigoriev, Dima and Karpinski, Marek and Meyer auf der Heide, Friedhelm and Smolensky, Roman}}, issn = {{1016-3328}}, journal = {{computational complexity}}, pages = {{357--375}}, title = {{{A lower bound for randomized algebraic decision trees}}}, doi = {{10.1007/bf01270387}}, year = {{1997}}, } @article{16565, author = {{Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}}, issn = {{0890-5401}}, journal = {{Information and Computation}}, pages = {{103--120}}, title = {{{Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures}}}, doi = {{10.1006/inco.1997.2642}}, year = {{1997}}, } @article{16567, author = {{Meyer auf der Heide, Friedhelm and Storch, M. and Wanka, Rolf}}, issn = {{1432-4350}}, journal = {{Theory of Computing Systems}}, pages = {{627--644}}, title = {{{Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks}}}, doi = {{10.1007/s002240000071}}, year = {{1997}}, } @inproceedings{16568, abstract = {{We present a data structure problem which describes the requirements of a simple variant of fully dynamic walk-through animation: We assume the scene to consist of unit size balls in R2 or higher dimensions. The scene may be arbitrarily large and has to be stored in secondary memory (discs) with relatively slow access. We allow a visitor to walk in the scene, and a modeler to update the scene by insertions and deletions of balls. We focus on the realtime requirement of animation systems: For some t (specified by the computation power of (the rendering hardware of) the graphic workstation) the data structure has to guarantee that the balls within distance t of the current visitor's position are presented to the rendering hardware, 20 times per second. Insertions and deletions should also be available to the visitor with small delay, independent of the size of the scene. We present a data structure that fulfills the above task in realtime. Its runtime is output-sensitive, i.e. linear in a quantity close to the output size of the query. We further present (preliminary) experimental results indicating that our structure is efficient in practice. }}, author = {{Fischer, Matthias and Meyer auf der Heide, Friedhelm and Strothmann, Willy-Bernhard}}, booktitle = {{5th Annual European Symposium on Algorithms (ESA '97)}}, isbn = {{9783540633976}}, issn = {{0302-9743}}, pages = {{1157 -- 170}}, publisher = {{Springer}}, title = {{{Dynamic data structures for realtime management of large geometric scenes}}}, doi = {{10.1007/3-540-63397-9_13}}, volume = {{1284}}, year = {{1997}}, } @inbook{16569, author = {{Meyer auf der Heide, Friedhelm and Vöcking, Berthold}}, booktitle = {{Euro-Par'97 Parallel Processing}}, isbn = {{9783540634409}}, issn = {{0302-9743}}, title = {{{Static and dynamic data management in networks}}}, doi = {{10.1007/bfb0002716}}, year = {{1997}}, } @inproceedings{16604, author = {{Berenbrink, Petra and Meyer auf der Heide, Friedhelm and Schröder, Klaus}}, booktitle = {{Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA '97}}, isbn = {{0897918908}}, title = {{{Allocating weighted jobs in parallel}}}, doi = {{10.1145/258492.258522}}, year = {{1997}}, } @inbook{16605, author = {{Bäumker, Armin and Meyer auf der Heide, Friedhelm}}, booktitle = {{Solving Irregularly Structured Problems in Parallel}}, isbn = {{9783540631385}}, issn = {{0302-9743}}, title = {{{Communication efficient parallel searching}}}, doi = {{10.1007/3-540-63138-0_21}}, year = {{1997}}, } @inbook{16687, author = {{Karaivazoglou, Efstratios and Meyer auf der Heide, Friedhelm}}, booktitle = {{Euro-Par'97 Parallel Processing}}, isbn = {{9783540634409}}, issn = {{0302-9743}}, title = {{{Routing on asyncronous processor networks}}}, doi = {{10.1007/bfb0002741}}, year = {{1997}}, } @inproceedings{16689, author = {{Maggs, B.M. and Meyer auf der Heide, Friedhelm and Vöcking, Berthold and Westermann, Matthias}}, booktitle = {{Proceedings 38th Annual Symposium on Foundations of Computer Science}}, isbn = {{0818681977}}, title = {{{Exploiting locality for data management in systems of limited bandwidth}}}, doi = {{10.1109/sfcs.1997.646117}}, year = {{1997}}, } @inbook{16693, author = {{Meyer auf der Heide, Friedhelm and Decker, Thomas}}, booktitle = {{Informatik ’97 Informatik als Innovationsmotor}}, isbn = {{9783540630661}}, issn = {{1431-472X}}, title = {{{Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications”}}}, doi = {{10.1007/978-3-642-60831-5_22}}, year = {{1997}}, } @article{19958, author = {{Schwarze, Frank and Meyer auf der Heide, Friedhelm and Schröder, Klaus}}, journal = {{Euro-Par 1996}}, pages = {{299--306}}, title = {{{Routing on Networks of Optical Crossbars (Extended Abstract).}}}, volume = {{I}}, year = {{1996}}, } @techreport{17418, author = {{Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}}, title = {{{Contention Resolution in Hashing Based Shared Memory Simulations}}}, year = {{1996}}, } @inproceedings{17419, 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.}}, author = {{Grigoriev, Dima and Karpinski, Marek and Meyer auf der Heide, Friedhelm and Smolensky, Roman}}, booktitle = {{Proc. of 28th ACM-STOC}}, pages = {{612--621}}, publisher = {{Eurographics Symposium on Parallel Graphics and Visualization}}, title = {{{A lower bound for randomized algebraic decision trees}}}, volume = {{65453}}, year = {{1996}}, } @inbook{17564, author = {{Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm and Rieping, Ingo}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783540616276}}, issn = {{0302-9743}}, pages = {{369--376}}, title = {{{Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model}}}, doi = {{10.1007/bfb0024725}}, year = {{1996}}, }