| 2007 |
|---|
| 74 | EE | Flaminia L. Luccio,
Jop F. Sibeyn:
Feedback vertex sets in mesh-based networks.
Theor. Comput. Sci. 383(1): 86-101 (2007) |
| 2006 |
|---|
| 73 | EE | Jop F. Sibeyn:
External selection.
J. Algorithms 58(2): 104-117 (2006) |
| 72 | EE | Debora Donato,
Luigi Laura,
Stefano Leonardi,
Ulrich Meyer,
Stefano Millozzi,
Jop F. Sibeyn:
Algorithms and Experiments for the Webgraph.
J. Graph Algorithms Appl. 10(2): 219-236 (2006) |
| 2005 |
|---|
| 71 | EE | Jop F. Sibeyn:
Faster gossiping on butterfly networks.
Theor. Comput. Sci. 331(1): 53-72 (2005) |
| 70 | EE | David Peleg,
Jop F. Sibeyn:
Preface: Structural Information and Communication Complexity.
Theor. Comput. Sci. 333(3): 329-330 (2005) |
| 2004 |
|---|
| 69 | | Roman Dementiev,
Peter Sanders,
Dominik Schultes,
Jop F. Sibeyn:
Engineering an External Memory Minimum Spanning Tree Algorithm.
IFIP TCS 2004: 195-208 |
| 68 | EE | Flaminia L. Luccio,
Jop F. Sibeyn:
Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks.
SIROCCO 2004: 209-220 |
| 67 | EE | Jop F. Sibeyn:
External Connected Components.
SWAT 2004: 468-479 |
| 66 | EE | Jop F. Sibeyn:
External matrix multiplication and all-pairs shortest path.
Inf. Process. Lett. 91(2): 99-106 (2004) |
| 2003 |
|---|
| 65 | | Jop F. Sibeyn:
SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, June 18-20, 2003, Umeå Sweden
Carleton Scientific 2003 |
| 64 | | Ulrich Meyer,
Peter Sanders,
Jop F. Sibeyn:
Algorithms for Memory Hierarchies, Advanced Lectures [Dagstuhl Research Seminar, March 10-14, 2002]
Springer 2003 |
| 63 | EE | Luigi Laura,
Stefano Leonardi,
Stefano Millozzi,
Ulrich Meyer,
Jop F. Sibeyn:
Algorithms and Experiments for the Webgraph.
ESA 2003: 703-714 |
| 62 | EE | Jop F. Sibeyn:
Minimizing Global Communication in Parallel List Ranking.
Euro-Par 2003: 894-902 |
| 61 | EE | Bogdan S. Chlebus,
Jop F. Sibeyn:
Routing on Meshes in Optimum Time and with Really Small Queues.
IPDPS 2003: 56 |
| 60 | EE | Jop F. Sibeyn:
List-ranking on interconnection networks.
Inf. Comput. 181(2): 75-87 (2003) |
| 59 | EE | Peter Sanders,
Jop F. Sibeyn:
A bandwidth latency tradeoff for broadcast and reduction.
Inf. Process. Lett. 86(1): 33-38 (2003) |
| 58 | EE | Jop F. Sibeyn,
Michal Soch:
Optimal Gossiping on CCCs of Even Dimension.
Parallel Processing Letters 13(1): 35-42 (2003) |
| 57 | | Jop F. Sibeyn:
Faster deterministic sorting through better sampling.
Theor. Comput. Sci. 290(3): 1829-1850 (2003) |
| 2002 |
|---|
| 56 | EE | Michele Flammini,
Bruce M. Maggs,
Jop F. Sibeyn,
Berthold Vöcking:
Routing and Communication in Interconnection Networks.
Euro-Par 2002: 735 |
| 55 | EE | Jop F. Sibeyn,
James Abello,
Ulrich Meyer:
Heuristics for semi-external depth first search on directed graphs.
SPAA 2002: 282-292 |
| 54 | EE | Jop F. Sibeyn:
One-by-One Cleaning for Practical Parallel List Ranking.
Algorithmica 32(3): 345-363 (2002) |
| 53 | EE | Ulrich Meyer,
Jop F. Sibeyn:
Oblivious Gossiping on Tori.
J. Algorithms 42(1): 1-19 (2002) |
| 52 | EE | Jop F. Sibeyn:
Optimal List Ranking on One-Dimensional Arrays.
Parallel Processing Letters 12(3-4): 375-383 (2002) |
| 2001 |
|---|
| 51 | EE | Jörg Keller,
Jop F. Sibeyn:
Beyond External Computing: Analysis of the Cycle Structure of Permutations.
Euro-Par 2001: 333-342 |
| 50 | EE | Jop F. Sibeyn:
Faster Gossiping on Butterflies.
ICALP 2001: 785-796 |
| 2000 |
|---|
| 49 | EE | Peter Sanders,
Jop F. Sibeyn:
A Bandwidth Latency Tradeoff for Broadcast and Reduction.
Euro-Par 2000: 918-926 |
| 48 | | René Beier,
Jop F. Sibeyn:
A powerful heuristic for telephone gossiping.
SIROCCO 2000: 17-35 |
| 47 | EE | Jop F. Sibeyn:
Solving Fundamental Problems on Sparse-Meshes.
IEEE Trans. Parallel Distrib. Syst. 11(12): 1324-1332 (2000) |
| 46 | | Andrea Pietracaprina,
Geppino Pucci,
Jop F. Sibeyn:
Constructive, Deterministic Implementation of Shared Memory on Meshes.
SIAM J. Comput. 30(2): 625-648 (2000) |
| 1999 |
|---|
| 45 | | Jop F. Sibeyn:
Ultimate Parallel List Ranking?
HiPC 1999: 197-201 |
| 44 | EE | Jop F. Sibeyn:
Better Deterministic Routing on Meshes.
IPPS/SPDP 1999: 420-425 |
| 43 | | Jop F. Sibeyn:
Power and Limitations of Optical Reconfigurable Arrays.
SIROCCO 1999: 249-265 |
| 42 | EE | Jop F. Sibeyn:
External Selection.
STACS 1999: 291-301 |
| 41 | | Jop F. Sibeyn,
Frank Guillaume,
Tillmann Seidel:
Practical Parallel List Ranking.
J. Parallel Distrib. Comput. 56(2): 156-180 (1999) |
| 1998 |
|---|
| 40 | EE | Ulrich Meyer,
Jop F. Sibeyn:
Gossiping Large Packets on Full-Port Tori.
Euro-Par 1998: 1040-1046 |
| 39 | EE | Jop F. Sibeyn:
Solving Fundamental Problems on Sparse-Meshes.
SWAT 1998: 288-299 |
| 38 | EE | Jop F. Sibeyn:
List Ranking on Meshes.
Acta Inf. 35(7): 543-566 (1998) |
| 37 | EE | Ben H. H. Juurlink,
Jop F. Sibeyn,
P. S. Rao:
Gossiping on Meshes and Tori.
IEEE Trans. Parallel Distrib. Syst. 9(6): 513-525 (1998) |
| 36 | | Miltos D. Grammatikakis,
D. Frank Hsu,
Jop F. Sibeyn:
Packet Routing in Fixed-Connection Networks: A Survey.
J. Parallel Distrib. Comput. 54(2): 77-132 (1998) |
| 35 | | Jop F. Sibeyn:
Row-Major Sorting on Meshes.
SIAM J. Comput. 28(3): 847-863 (1998) |
| 1997 |
|---|
| 34 | | Jop F. Sibeyn,
Michael Kaufmann:
BSP-Like External-Memory Computation.
CIAC 1997: 229-240 |
| 33 | | Bogdan S. Chlebus,
Artur Czumaj,
Jop F. Sibeyn:
Routing on the PADAM: Degrees of Optimality.
Euro-Par 1997: 272-279 |
| 32 | | Jop F. Sibeyn:
Sample Sort on Meshes.
Euro-Par 1997: 389-398 |
| 31 | EE | Michael Kaufmann,
Ulrich Meyer,
Jop F. Sibeyn:
Matrix Transpose on Meshes: Theory and Practice.
IPPS 1997: 315-319 |
| 30 | | Jop F. Sibeyn,
Frank Guillaume,
Tillmann Seidel:
Practical Parallel List Ranking.
IRREGULAR 1997: 25-36 |
| 29 | | Jop F. Sibeyn:
Routing with Finite Speeds of Memory and Network.
MFCS 1997: 488-497 |
| 28 | EE | Jop F. Sibeyn:
Better Trade-Offs for Parallel List Ranking.
SPAA 1997: 221-230 |
| 27 | | Michael Kaufmann,
Jop F. Sibeyn:
Randomized Multipacket Routing and Sorting on Meshes.
Algorithmica 17(3): 224-244 (1997) |
| 26 | | Michael Kaufmann,
Rajeev Raman,
Jop F. Sibeyn:
Routing on Meshes with Buses.
Algorithmica 18(3): 417-444 (1997) |
| 25 | | Michael Kaufmann,
Ulrich Meyer,
Jop F. Sibeyn:
Matrix Transpose on Meshes: Theory and Practice.
Computers and Artificial Intelligence 16(2): (1997) |
| 24 | | Jop F. Sibeyn:
Routing or Triangles, Tori and Honeycombs.
Int. J. Found. Comput. Sci. 8(3): 269-287 (1997) |
| 23 | | Jop F. Sibeyn,
Bogdan S. Chlebus,
Michael Kaufmann:
Deterministic Permutation Routing on Meshes.
J. Algorithms 22(1): 111-141 (1997) |
| 1996 |
|---|
| 22 | | Ben H. H. Juurlink,
P. S. Rao,
Jop F. Sibeyn:
Worm-Hole Gossiping on Meshes.
Euro-Par, Vol. I 1996: 361-369 |
| 21 | | Jop F. Sibeyn:
List Ranking on Interconnection Networks.
Euro-Par, Vol. I 1996: 799-808 |
| 20 | | Jop F. Sibeyn:
Routing on Triangles, Tori and Honeycombs.
MFCS 1996: 529-541 |
| 1995 |
|---|
| 19 | | Michael Kaufmann,
Jop F. Sibeyn,
Torsten Suel:
Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes.
ESA 1995: 75-88 |
| 18 | | Ulrich Meyer,
Jop F. Sibeyn:
Simulating the Simulator: Deterministic PRAM Simulation on a Mesh Simulator.
EUROSIM 1995: 285-290 |
| 17 | | Jop F. Sibeyn,
Michael Kaufmann:
Solving Cheap Graph Problems an Meshes.
MFCS 1995: 412-422 |
| 16 | EE | Yosi Ben-Asher,
Assaf Schuster,
Jop F. Sibeyn:
Load Balancing: a Programmer's Approach or the Impact of Task-Length Parameters on the Load Balancing Performance of Parallel Programs.
International Journal of High Speed Computing 7(2): 303-325 (1995) |
| 15 | | Michael Kaufmann,
Heiko Schröder,
Jop F. Sibeyn:
Routing and Sorting on Reconfigurable Meshes.
Parallel Processing Letters 5: 81-95 (1995) |
| 1994 |
|---|
| 14 | | Jop F. Sibeyn:
Desnakification of Mesh Sorting Algorithms.
ESA 1994: 377-390 |
| 13 | | Jop F. Sibeyn:
Deterministic Routing and Sorting on Rings.
IPPS 1994: 406-410 |
| 12 | | Jop F. Sibeyn,
Bogdan S. Chlebus,
Michael Kaufmann:
Shorter Queues for Permutation Routing on Meshes.
MFCS 1994: 597-607 |
| 11 | | Michael Kaufmann,
Jop F. Sibeyn,
Torsten Suel:
Derandomizing Algorithms for Routing and Sorting on Meshes.
SODA 1994: 669-679 |
| 10 | EE | Andrea Pietracaprina,
Geppino Pucci,
Jop F. Sibeyn:
Constructive Deterministic PRAM Simulation on a Mesh-Connected Computer.
SPAA 1994: 248-256 |
| 9 | | Jop F. Sibeyn,
Michael Kaufmann:
Deterministic 1-k Routing on Meshes.
STACS 1994: 237-248 |
| 8 | | Jop F. Sibeyn,
Tim J. Harris:
Exploiting Locality in LT-RAM Computations.
SWAT 1994: 338-349 |
| 1993 |
|---|
| 7 | | Jop F. Sibeyn,
Michael Kaufmann,
Rajeev Raman:
Randomized Routing on Meshes with Buses.
ESA 1993: 333-344 |
| 6 | | Bogdan S. Chlebus,
Michael Kaufmann,
Jop F. Sibeyn:
Deterministic Permutation Routing on Meshes.
SPDP 1993: 284 |
| 1992 |
|---|
| 5 | | Yosi Ben-Asher,
Aviad Cohen,
Assaf Schuster,
Jop F. Sibeyn:
The Impact of Task-Length Parameters on the Performance of the Random Load-Balancing Algorithm.
IPPS 1992: 82-85 |
| 4 | EE | Michael Kaufmann,
Sanguthevar Rajasekaran,
Jop F. Sibeyn:
Matching the Bisection Bound for Routing and Sorting on the Mesh.
SPAA 1992: 31-40 |
| 3 | | Michael Kaufmann,
Jop F. Sibeyn:
Deterministic Routing on Circular Arrays.
SPDP 1992: 376-383 |
| 2 | | Michael Kaufmann,
Jop F. Sibeyn:
Optimal Multi-Packet Routing on the Torus.
SWAT 1992: 118-129 |
| 1990 |
|---|
| 1 | EE | Jop F. Sibeyn:
Routing Permutations on MESH Interconnection Networks.
SPDP 1990: 94-97 |
