Jop F. Sibeyn

According to our database, Jop F. Sibeyn authored at least 66 papers between 1990 and 2007.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2007

Feedback vertex sets in mesh-based networks.

Flaminia L. Luccio, Jop F. Sibeyn

Theor. Comput. Sci., 2007

2006

Algorithms and Experiments for the Webgraph.

Debora Donato, Luigi Laura, Stefano Leonardi, Ulrich Meyer, Stefano Millozzi, Jop F. Sibeyn

J. Graph Algorithms Appl., 2006

External selection.

Jop F. Sibeyn

J. Algorithms, 2006

2005

Faster gossiping on butterfly networks.

Jop F. Sibeyn

Theor. Comput. Sci., 2005

Preface: Structural Information and Communication Complexity.

David Peleg, Jop F. Sibeyn

Theor. Comput. Sci., 2005

2004

External matrix multiplication and all-pairs shortest path.

Jop F. Sibeyn

Inf. Process. Lett., 2004

External Connected Components.

Jop F. Sibeyn

Proceedings of the Algorithm Theory, 2004

Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks.

Flaminia L. Luccio, Jop F. Sibeyn

Proceedings of the Structural Information and Communication Complexity, 2004

Engineering an External Memory Minimum Spanning Tree Algorithm.

Roman Dementiev, Peter Sanders, Dominik Schultes, Jop F. Sibeyn

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003

Faster deterministic sorting through better sampling.

Jop F. Sibeyn

Theor. Comput. Sci., 2003

Optimal Gossiping on CCCs of Even Dimension.

Jop F. Sibeyn, Michal Soch

Parallel Process. Lett., 2003

A bandwidth latency tradeoff for broadcast and reduction.

Peter Sanders, Jop F. Sibeyn

Inf. Process. Lett., 2003

List-ranking on interconnection networks.

Jop F. Sibeyn

Inf. Comput., 2003

Routing on Meshes in Optimum Time and with Really Small Queues.

Bogdan S. Chlebus, Jop F. Sibeyn

Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Minimizing Global Communication in Parallel List Ranking.

Jop F. Sibeyn

Proceedings of the Euro-Par 2003. Parallel Processing, 2003

Algorithms and Experiments for the Webgraph.

Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, Jop F. Sibeyn

Proceedings of the Algorithms, 2003

2002

Optimal List Ranking on One-Dimensional Arrays.

Jop F. Sibeyn

Parallel Process. Lett., 2002

Oblivious Gossiping on Tori.

Ulrich Meyer, Jop F. Sibeyn

J. Algorithms, 2002

One-by-One Cleaning for Practical Parallel List Ranking.

Jop F. Sibeyn

Algorithmica, 2002

Heuristics for semi-external depth first search on directed graphs.

Jop F. Sibeyn, James Abello, Ulrich Meyer

Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002

Routing and Communication in Interconnection Networks.

Michele Flammini, Bruce M. Maggs, Jop F. Sibeyn, Berthold Vöcking

Proceedings of the Euro-Par 2002, 2002

2001

Faster Gossiping on Butterflies.

Jop F. Sibeyn

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Beyond External Computing: Analysis of the Cycle Structure of Permutations.

Jörg Keller, Jop F. Sibeyn

Proceedings of the Euro-Par 2001: Parallel Processing, 2001

2000

Solving Fundamental Problems on Sparse-Meshes.

Jop F. Sibeyn

IEEE Trans. Parallel Distributed Syst., 2000

Constructive, Deterministic Implementation of Shared Memory on Meshes.

Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn

SIAM J. Comput., 2000

A powerful heuristic for telephone gossiping.

René Beier, Jop F. Sibeyn

Proceedings of the SIROCCO 7, 2000

1999

Practical Parallel List Ranking.

Jop F. Sibeyn, Frank Guillaume, Tillmann Seidel

J. Parallel Distributed Comput., 1999

Power and Limitations of Optical Reconfigurable Arrays.

Jop F. Sibeyn

Proceedings of the SIROCCO'99, 1999

Better Deterministic Routing on Meshes.

Jop F. Sibeyn

Proceedings of the 13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP '99), 1999

Ultimate Parallel List Ranking?

Jop F. Sibeyn

Proceedings of the High Performance Computing, 1999

1998

Gossiping on Meshes and Tori.

Ben H. H. Juurlink, Jop F. Sibeyn, P. S. Rao

IEEE Trans. Parallel Distributed Syst., 1998

Row-Major Sorting on Meshes.

Jop F. Sibeyn

SIAM J. Comput., 1998

Packet Routing in Fixed-Connection Networks: A Survey.

Miltos D. Grammatikakis, D. Frank Hsu, Jop F. Sibeyn

J. Parallel Distributed Comput., 1998

List Ranking on Meshes.

Jop F. Sibeyn

Acta Informatica, 1998

Gossiping Large Packets on Full-Port Tori.

Ulrich Meyer, Jop F. Sibeyn

Proceedings of the Euro-Par '98 Parallel Processing, 1998

1997

Deterministic Permutation Routing on Meshes.

Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann

J. Algorithms, 1997

Routing or Triangles, Tori and Honeycombs.

Jop F. Sibeyn

Int. J. Found. Comput. Sci., 1997

Matrix Transpose on Meshes: Theory and Practice.

Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn

Comput. Artif. Intell., 1997

Randomized Multipacket Routing and Sorting on Meshes.

Michael Kaufmann, Jop F. Sibeyn

Algorithmica, 1997

Routing on Meshes with Buses.

Michael Kaufmann, Rajeev Raman, Jop F. Sibeyn

Algorithmica, 1997

Better Trade-Offs for Parallel List Ranking.

Jop F. Sibeyn

Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997

Routing with Finite Speeds of Memory and Network.

Jop F. Sibeyn

Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

Sample Sort on Meshes.

Jop F. Sibeyn

Proceedings of the Euro-Par '97 Parallel Processing, 1997

Routing on the PADAM: Degrees of Optimality.

Bogdan S. Chlebus, Artur Czumaj, Jop F. Sibeyn

Proceedings of the Euro-Par '97 Parallel Processing, 1997

BSP-Like External-Memory Computation.

Jop F. Sibeyn, Michael Kaufmann

Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996

Routing on Triangles, Tori and Honeycombs.

Jop F. Sibeyn

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

Worm-Hole Gossiping on Meshes.

Ben H. H. Juurlink, P. S. Rao, Jop F. Sibeyn

Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995

Routing and Sorting on Reconfigurable Meshes.

Michael Kaufmann, Heiko Schröder, Jop F. Sibeyn

Parallel Process. Lett., 1995

Load Balancing: a Programmer's Approach or the Impact of Task-Length Parameters on the Load Balancing Performance of Parallel Programs.

Yosi Ben-Asher, Assaf Schuster, Jop F. Sibeyn

Int. J. High Speed Comput., 1995

Solving Cheap Graph Problems an Meshes.

Jop F. Sibeyn, Michael Kaufmann

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Simulating the Simulator: Deterministic PRAM Simulation on a Mesh Simulator.

Ulrich Meyer, Jop F. Sibeyn

Proceedings of the EUROSIM'96, 1995

Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes.

Michael Kaufmann, Jop F. Sibeyn, Torsten Suel

Proceedings of the Algorithms, 1995

1994

Exploiting Locality in LT-RAM Computations.

Jop F. Sibeyn, Tim J. Harris

Proceedings of the Algorithm Theory, 1994

Deterministic 1-k Routing on Meshes.

Jop F. Sibeyn, Michael Kaufmann

Proceedings of the STACS 94, 1994

Towards practical permutation routing on meshes.

Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn

Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

Constructive Deterministic PRAM Simulation on a Mesh-Connected Computer.

Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn

Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

Derandomizing Algorithms for Routing and Sorting on Meshes.

Michael Kaufmann, Jop F. Sibeyn, Torsten Suel

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Shorter Queues for Permutation Routing on Meshes.

Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Deterministic Routing and Sorting on Rings.

Jop F. Sibeyn

Proceedings of the 8th International Symposium on Parallel Processing, 1994

Desnakification of Mesh Sorting Algorithms.

Jop F. Sibeyn

Proceedings of the Algorithms, 1994

1993

Randomized Routing on Meshes with Buses.

Jop F. Sibeyn, Michael Kaufmann, Rajeev Raman

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992

Optimal Multi-Packet Routing on the Torus.

Michael Kaufmann, Jop F. Sibeyn

Proceedings of the Algorithm Theory, 1992

Deterministic Routing on Circular Arrays.

Michael Kaufmann, Jop F. Sibeyn

Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

Matching the Bisection Bound for Routing and Sorting on the Mesh.

Michael Kaufmann, Sanguthevar Rajasekaran, Jop F. Sibeyn

Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

The Impact of Task-Length Parameters on the Performance of the Random Load-Balancing Algorithm.

Yosi Ben-Asher, Aviad Cohen, Assaf Schuster, Jop F. Sibeyn

Proceedings of the 6th International Parallel Processing Symposium, 1992

1990

Routing Permutations on MESH Interconnection Networks.

Jop F. Sibeyn

Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, 1990