TY - CONF AU - Flammini, Michele AU - Scheideler, Christian ID - 2179 T2 - SPAA TI - Simple, Efficient Routing Schemes for All-Optical Networks ER - TY - JOUR AU - Grigoriev, Dima AU - Karpinski, Marek AU - Meyer auf der Heide, Friedhelm AU - Smolensky, Roman ID - 16564 JF - computational complexity SN - 1016-3328 TI - A lower bound for randomized algebraic decision trees ER - TY - JOUR AU - Czumaj, Artur AU - Meyer auf der Heide, Friedhelm AU - Stemann, Volker ID - 16565 JF - Information and Computation SN - 0890-5401 TI - Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures ER - TY - JOUR AU - Meyer auf der Heide, Friedhelm AU - Storch, M. AU - Wanka, Rolf ID - 16567 JF - Theory of Computing Systems SN - 1432-4350 TI - Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks ER - TY - CONF AB - 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. AU - Fischer, Matthias AU - Meyer auf der Heide, Friedhelm AU - Strothmann, Willy-Bernhard ID - 16568 SN - 0302-9743 T2 - 5th Annual European Symposium on Algorithms (ESA '97) TI - Dynamic data structures for realtime management of large geometric scenes VL - 1284 ER - TY - CHAP AU - Meyer auf der Heide, Friedhelm AU - Vöcking, Berthold ID - 16569 SN - 0302-9743 T2 - Euro-Par'97 Parallel Processing TI - Static and dynamic data management in networks ER - TY - CONF AU - Berenbrink, Petra AU - Meyer auf der Heide, Friedhelm AU - Schröder, Klaus ID - 16604 SN - 0897918908 T2 - Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA '97 TI - Allocating weighted jobs in parallel ER - TY - CHAP AU - Bäumker, Armin AU - Meyer auf der Heide, Friedhelm ID - 16605 SN - 0302-9743 T2 - Solving Irregularly Structured Problems in Parallel TI - Communication efficient parallel searching ER - TY - CHAP AU - Karaivazoglou, Efstratios AU - Meyer auf der Heide, Friedhelm ID - 16687 SN - 0302-9743 T2 - Euro-Par'97 Parallel Processing TI - Routing on asyncronous processor networks ER - TY - CONF AU - Maggs, B.M. AU - Meyer auf der Heide, Friedhelm AU - Vöcking, Berthold AU - Westermann, Matthias ID - 16689 SN - 0818681977 T2 - Proceedings 38th Annual Symposium on Foundations of Computer Science TI - Exploiting locality for data management in systems of limited bandwidth ER -