Rolf Wanka's Publications:

• Klein, J.; Krokowski, J.; Fischer, M.; Wand, M.;Wanka, R.; Meyer auf der Heide, F.:
  The Randomized Sample Tree: A Data Structure for Interactive Walkthroughs in Externally Stored Virtual Environments;
  in: Proc. ACM Symp. on Virtual Reality Software and Technology (VRST), pp. 157-146, 2002. (More Information)
  
  
• Bonorden, O.; Meyer auf der Heide, F.; Wanka, R.:
  Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example;
  in: Proc. Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA); Vol. IV, pp. 2202-2208; 2002. (More Information)
  
  
• Wanka, R.:
  Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs is Asymptotically Optimal;
  in: Proc. W'shop on Graph-Theoretic Concepts in Computer Science (WG); 2002, to appear.
  
  
• Meyer auf der Heide, F.; Wanka, R.:
  Parallel Bridging Models and Their Impact on Algorithm Design;
  in: Proc. Int. Conf. on Computational Science (ICCS); 2001; Part II, pp. 628-637. (More Information)
  
  
• Kutylowski, M.; Lorys, K.; Oesterdiekhoff, B.; Wanka, R.:
  Periodification Scheme: Constructing Sorting Networks with Constant Period;
  Journal of the ACM 47 (2000) 944-967. (More Information)
  
  
• Bednara, M.; Beyer, O.; Teich, J.; Wanka, R.:
  Tradeoff Analysis and Architecture Design of a Hybrid Hardware/Software Sorter;
  in: Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP); pp. 299-308, 2000. (More Information)
  
  
• Bednara, M.; Beyer, O.; Teich, J.; Wanka, R.:
  Hardware-Supported Sorting: Design and Tradeoff Analysis;
  in: W'shop on System Design Automation (SDA); pp. 37-44, 2000. (More Information)
  Final version in: System Design Automation - Fundamantals, Principles, Methods, Examples, pp. 97-107, 2001.
  
  
• Meyer auf der Heide, F.; Wanka, R.:
  Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik;
  in: ForschungsForum Paderborn; pp. 112-116, 2000. (More Information) (In German)
  
  
• Rabani, Y.; Sinclair, A.; Wanka, R.:
  Local Divergence of Markov Chains and the Analysis of Iterative Load-Balancing Schemes;
  in: Proc. 39th IEEE Symposium on Foundations of Computer Science (FOCS); pp. 694-703, 1998. (More Information)
  
  
• Kutylowski, M.; Wanka, R.:
  Playing Tetris on Meshes and Multi-Dimensional SHEARSORT;
  in: Proc. 8th International Symposium on Algorithms and Computation (ISAAC) ; pp. 32-41; 1997. (More Information)
  
  
• Wachsmann, A.; Wanka, R.:
  Sorting on a Massively Parallel System Using a Library of Basic Primitives: Modeling and Experimental Results;
  in: Proc. 3rd European Conference in Parallel Processing (Euro-Par) ; pp. 399-408; 1997. (More Information)
  Full Version Technischer Bericht TR-RSFB-96-011; Universität-GH Paderborn; May 1996.
  
  
• Brockmann, K.; Wanka, R.:
  Efficient Oblivious Parallel Sorting on the MasPar MP-1;
  in: Proc. 30th Hawaii International Conference on System Sciences (HICSS); Vol. I, pp. 200-208; 1997. © (Abstract)
  
  
• Meyer auf der Heide, F.; Wanka, R.:
  Kommunikation in parallelen Rechnernetzen (in German);
  in: Highlights aus der Informatik; I. Wegener (Hrsg.), Springer-Verlag; pp. 177-198; 1996. © (Abstract)
  
  
• Meyer auf der Heide, F.; Storch, M.; Wanka, R.:
  Optimal Trade-Offs Between Size and Slowdown for Universal Parallel Networks;
  in: Proc. 7th ACM Symposium on Parallel and Algorithms and Architectures (SPAA); pp. 119-128; 1995. © (Abstract)
  Full version appeared in: Theory of Computing Systems 30 (1997) 627-644. Springer-Link
  
  
• Kutylowski, M.; Lorys, K.; Oesterdiekhoff, B.; Wanka, R.:
  Fast and Feasible Periodic Sorting Networks of Constant Depth;
  in: Proc. 35th IEEE Symposium on Foundations of Computer Science (FOCS); pp. 369-380; 1994. © (Abstract)
  
  
• Diekmann, R.; Gehring, J.; Lüling, R.; Monien, B.; Nübel, M.; Wanka, R.:
  
  • Sorting Large Data Sets on a Massively Parallel System;
    in: Proc. 6th IEEE Symposium on Parallel and Distributed Processing (SPDP); pp. 2-9; 1994. © (Abstract)
  • Sortieren großer Datenmengen auf einem massiv parallelen System;
    (in German) in: Tagungsband des 6. Transputer-Anwender-Treffen (TAT); pp. 155-167; 1994. ©
    
    
• Meyer auf der Heide, F.; Oesterdiekhoff, B.; Wanka, R.:
  Strongly Adaptive Token Distribution;
  in: Proc. 20th International Colloquium on Automata, Languages, and Programming (ICALP); pp. 398-409; 1993. © (Abstract)
  Full version appeared in: Algorithmica 15 (1996) 413-427. Springer-Link
  
  
• Kutylowski, M.; Wanka, R.:
  Periodic Sorting on Two-Dimensional Meshes;
  Parallel Processing Letters 2 (1992); pp. 213-220. © (Abstract)
  
  
• Wanka, R.:
  Fast General Sorting on Meshes of Arbitrary Dimension Without Routing;
  Forschungsbericht Nr. 87, August 1991, Universität-GH Paderborn, Fachbereich 17.
  
  
• Meyer auf der Heide, F.; Wanka, R.:
  Time-Optimal Simulations of Networks by Universal Parallel Computers;
  in: Proc. 6th Symposium on Theoretical Aspects of Computer Science (STACS); pp. 120-131; 1989. © (Abstract)
  
  

© Copyright Notice:
The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.