Your search returned the following 47 documents:

47. Algorithms and Experiments for the Webgraph
    Debora Donato, Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, and Jop F. Sibeyn
    Journal of Graph Algorithms and Applications 10 (2): 219-236, 2006
    
    
46. Engineering an External Memory Minimum Spanning Tree Algorithm
    Roman Dementiev, Peter Sanders, Dominik Schultes, and Jop F. Sibeyn
    In: 3rd IFIP International Conference on Theoretical Computer Science (TSC2004), Toulouse, France, 2004, 195-208
    [PDF: Download: emst.pdf]
    
45. A Bandwidth Latency Tradeoff for Broadcast and Reduction
    Peter Sanders and Jop F. Sibeyn
    Information Processing Letters 86 (1): 33-38, 2003
    
44. Algorithms and Experiments for the Webgraph
    Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, and Jop F. Sibeyn
    In: Algorithms - ESA 2003: 11th Annual European Symposium, Budapest, September, 16 - September, 19, 2003, 703-714
    
43. Heuristics for Semi-External Depth First Search on Directed Graphs
    Jop F. Sibeyn, James Abello, and Ulrich Meyer
    In: SPAA 2002 : Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, Winnipeg, Canada, 2002, 282-292
    
42. Oblivious Gossiping on Tori
    Ulrich Meyer and Jop F. Sibeyn
    Journal of Algorithms 42 (1): 1-19, 2002
    
41. A Bandwidth Latency Tradeoff for Broadcast and Reduction
    Peter Sanders and Jop F. Sibeyn
    In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), Munich, Germany, August 29 - September 1, 2000, 918-926
    
40. A powerful heuristic for telephone gossiping
    Rene Beier and Jop F. Sibeyn
    In: Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity (SIROCCO-00), L'Aquila, Italy, June 20-22, 2000, 2000, 17-36
    
39. Solving fundamental problems on sparse-meshes
    Jop F. Sibeyn
    IEEE Transactions on Parallel & Distributed Systems 11 (12): 1324-1332, 2000
    
38. Better Deterministic Routing on Meshes
    Jop F. Sibeyn
    In: Proceedings of the 13th International Parallel Processing Symposium, and 10th Symposium on Parallel and Distributed Processing (IPPS/SPDP-99), St Juan, Puerto Rico, April, 12-16, 1999, 1999, 420-425
    
37. Effiziente parallele Algorithmen
    Jop F. Sibeyn
    Habilitation thesis, Universität des Saarlandes, 1999. Note: Lebenslauf, Schriftenverzeichnis, Zusammenfassung
    
36. External Selection
    Jop F. Sibeyn
    In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS-99), Trier, March 4-6, 1999, 1999, 291-301
    
35. Parallel and External List Ranking and Connected Components on a Cluster of Workstations
    Oliver Lambert and Jop F. Sibeyn
    In: Proceedings of the 11th International Conference on Parallel and Distributed Computing and Systems (PDCS-99), Boston, 11/1999, 1999, 454-460
    
34. Power and Limitations of Optical Reconfigurable Arrays
    Jop F. Sibeyn
    In: Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO 6), Lacanau-Océan, France, 7/1999, 1999, 249-263
    
33. Practical Parallel List Ranking
    Jop F. Sibeyn, Frank Guillaume, and Tillmann Seidel
    Journal of Parallel and Distributed Computing 56 (2): 156-180, 1999
    
32. Row-Major Sorting on Meshes
    Jop F. Sibeyn
    SIAM Journal on Computing 28 (3): 847-863, 1999
    
31. Ultimate Parallel List Ranking?
    Jop F. Sibeyn
    In: Proceedings of the 6th International Conference on High Performance Computing (HiPC-99), Calcutta, December 17-20, 1999, 1999, 197-201
    
30. Gossiping Large Packets on Full-Port Tori
    Ulrich Meyer and Jop F. Sibeyn
    In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), Southampton, United Kingdom, September, 1 - September, 4, 1998, 1040-1046
    
29. Gossiping on Meshes and Tori
    Jop F. Sibeyn, Ben Juurlink, and P. Srinivasa Rao
    IEEE Transactions on Parallel and Distributed Systems 9 (6): 513-525, 1998
    
28. List Ranking on Meshes
    Jop F. Sibeyn
    Acta Informatica 35 (7): 543-566, 1998
    
27. Packet Routing in Fixed-Connection Networks: A Survey
    Jop F. Sibeyn, M.D. Grammatikakis, D.F. Hsu, and M. Kraetzl
    Journal of Parallel and Distributed Computing 54: 77-132, 1998
    
26. Solving Fundamental Problems on Sparse-Meshes
    Jop F. Sibeyn
    In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), Stockholm, July 1998, 1998, 288-299
    
25. Better Trade-offs for Parallel List Ranking
    Jop F. Sibeyn
    In: Proceedings of the 9th Symposium on Parallel Algorithms and Architectures (SPAA-97), New-Port Beach, June 22-25, 1997, 221-230
    
24. BSP-Like External-Memory Computation
    Jop F. Sibeyn and Michael Kaufmann
    In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), Rome, Italy, March 12-14, 1997, 229-240
    
23. Deterministic Permutation Routing on Meshes
    Jop F. Sibeyn, Michael Kaufmann, and Bogdan S. Chlebus
    Journal of Algorithms 22 (1): 111-141, 1997
    
22. Matrix Transpose on Meshes: Theory and Practice
    Michael Kaufmann, Ulrich Meyer, and Jop F. Sibeyn
    In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), Geneva, Switzerland, April, 1-5, 1997, 315-319
    
21. Matrix Transpose on Meshes: Theory and Practice
    Michael Kaufmann, Ulrich Meyer, and Jop F. Sibeyn
    Computers and Artificial Intelligence 16 (2): 107-140, 1997
    
20. Practical Parallel List Ranking
    Jop F. Sibeyn, Frank Guillaume, and Tillmann Seidel
    In: Proceedings of the 4th Symposium on Solving Irregularly Structured Problems in Parallel (IRREGULAR-97), Paderborn, Germany, June 12-13, 1997, 25-36
    
19. Randomized Multipacket Routing and Sorting on Meshes
    Michael Kaufmann and Jop F. Sibeyn
    Algorithmica 17 (3): 224-244, 1997
    
18. Randomized Multipacket Routing and Sorting on Meshes
    Jop F. Sibeyn and Michael Kaufmann
    Algorithmica 17: 224-244, 1997
    
17. Routing on Meshes with Buses
    Michael Kaufmann, Rajeev Raman, and Jop F. Sibeyn
    Algorithmica 18 (3): 417-444, 1997
    
16. Routing on the PADAM: Degrees of Optimality
    Bogdan S. Chlebus, Artur Czumaj, and Jop F. Sibeyn
    In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), Passau, Germany, August 26-29, 1997, 272-279
    
15. Routing on Triangles, Tori and Honeycombs
    Jop F. Sibeyn
    International Journal on the Foundations of Computer Science 8 (3): 269-287, 1997
    
14. Routing with Finite Speeds of Memory and Network
    Jop F. Sibeyn
    In: Proceedings of the 22nd Symposium on the Mathematical Foundations of Computer Science (MFCS-97), Bratislava, Slovakia, August 22-29, 1997, 488-497
    
13. Sample Sort on Meshes
    Jop F. Sibeyn
    In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), Passau, Germany, August 26-29, 1997, 389-398
    
12. List Ranking on Interconnection Networks
    Jop F. Sibeyn
    In: 2nd Euro-Par Conference, Lyon, August, 26th-29th, 1996, 529-541
    
11. Parallel algorithm for maximum empty L-shaped polygon
    A. J. Preetham, Kamala Krithivasan, C. Pandu Rangan, and Jop F. Sibeyn
    In: 3rd Conference on High-Performance Computing, 1996
    
10. Routing on Triangles, Tori and Honeycombs
    Jop F. Sibeyn
    In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), Cracow, September, 2nd-6th, 1996, 529-541
    
9. Worm-Hole Gossiping on Meshes and Tori
   Ben Juurlink, Jop F. Sibeyn, and P. Srinivasa Rao
   In: 2nd Euro-Par Conference, Lyon, August, 26-29, 1996, 361-369
   
8. Towards Practical Permutation Routing on Meshes
   Michael Kaufmann, Ulrich Meyer, and Jop F. Sibeyn
   In: Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing, Dallas, Texas, October, 26-29, 1994, 656-663
   
7. Asymptotically Optimal and Practical Routing on the Reconfigurable Mesh
   Michael Kaufmann, Heiko Schröder, and Jop F. Sibeyn
   Parallel Processing Letters 5 (1): 81-95, 1995
   
6. Beyond the Worst-Case Bisection Bound: Fast Ranking and Counting on Meshes
   Michael Kaufmann, Jop F. Sibeyn, and Torsten Suel
   In: Algorithms - ESA'95: 3rd Annual European Symposium, Corfu, Greece, September, 25th - 27th, 1995, 75-88
   
5. Fast Routing on Weak Hypercubes: Making the Valiant-Brebner Algorithm More Practical
   Ben Juurlink and Jop F. Sibeyn
   In: Conference on High-Performance Computing, 1995, 755-760
   
4. Load balancing: A programmer's approach or the impact of task-length parameter on the load balancing performance of parallel programs
   Y. Ben-Asher, Assaf Schuster, and Jop F. Sibeyn
   International Journal on High-Speed Computing 7 (2): 303-326, 1995
   
3. Sample Sort on Meshes
   Jop F. Sibeyn
   In: Proceedings of Computing Science in the Netherlands, SION, 1995, 217-228
   
2. Simulating the Simulator: Determinstic PRAM Simulation on a Mesh Simulator
   Ulrich Meyer and Jop F. Sibeyn
   In: Eurosim '95, Vienna, Austria, September, 11 - September, 15, 1995, 285-290
   
1. Solving Cheap Graph Problems on Meshes
   Michael Kaufmann and Jop F. Sibeyn
   In: Mathematical Foundations of Computer Science 1995: 20th International Symposium (MFCS95), Prague, Czech Republic, Augst, 28th - September, 1st, 1995, 412-422