Jop F. Sibeyn

According to our database1, Jop F. Sibeyn
  • authored at least 73 papers between 1990 and 2007.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2007
Feedback vertex sets in mesh-based networks.
Theor. Comput. Sci., 2007

2006
Algorithms and Experiments for the Webgraph.
J. Graph Algorithms Appl., 2006

External selection.
J. Algorithms, 2006

2005
Faster gossiping on butterfly networks.
Theor. Comput. Sci., 2005

Preface: Structural Information and Communication Complexity.
Theor. Comput. Sci., 2005

2004
External matrix multiplication and all-pairs shortest path.
Inf. Process. Lett., 2004

External Connected Components.
Proceedings of the Algorithm Theory, 2004

Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks.
Proceedings of the Structural Information and Communication Complexity, 2004

Engineering an External Memory Minimum Spanning Tree Algorithm.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003
Faster deterministic sorting through better sampling.
Theor. Comput. Sci., 2003

Optimal Gossiping on CCCs of Even Dimension.
Parallel Processing Letters, 2003

A bandwidth latency tradeoff for broadcast and reduction.
Inf. Process. Lett., 2003

List-ranking on interconnection networks.
Inf. Comput., 2003

Routing on Meshes in Optimum Time and with Really Small Queues.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Minimizing Global Communication in Parallel List Ranking.
Proceedings of the Euro-Par 2003. Parallel Processing, 2003

Algorithms and Experiments for the Webgraph.
Proceedings of the Algorithms, 2003

2002
Optimal List Ranking on One-Dimensional Arrays.
Parallel Processing Letters, 2002

Oblivious Gossiping on Tori.
J. Algorithms, 2002

One-by-One Cleaning for Practical Parallel List Ranking.
Algorithmica, 2002

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

Routing and Communication in Interconnection Networks.
Proceedings of the Euro-Par 2002, 2002

2001
Faster Gossiping on Butterflies.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Beyond External Computing: Analysis of the Cycle Structure of Permutations.
Proceedings of the Euro-Par 2001: Parallel Processing, 2001

2000
Solving Fundamental Problems on Sparse-Meshes.
IEEE Trans. Parallel Distrib. Syst., 2000

Constructive, Deterministic Implementation of Shared Memory on Meshes.
SIAM J. Comput., 2000

A powerful heuristic for telephone gossiping.
Proceedings of the SIROCCO 7, 2000

A Bandwidth Latency Tradeoff for Broadcast and Reduction.
Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

1999
Practical Parallel List Ranking.
J. Parallel Distrib. Comput., 1999

External Selection.
Proceedings of the STACS 99, 1999

Power and Limitations of Optical Reconfigurable Arrays.
Proceedings of the SIROCCO'99, 1999

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

Ultimate Parallel List Ranking?
Proceedings of the High Performance Computing, 1999

1998
Gossiping on Meshes and Tori.
IEEE Trans. Parallel Distrib. Syst., 1998

Row-Major Sorting on Meshes.
SIAM J. Comput., 1998

Packet Routing in Fixed-Connection Networks: A Survey.
J. Parallel Distrib. Comput., 1998

List Ranking on Meshes.
Acta Inf., 1998

Solving Fundamental Problems on Sparse-Meshes.
Proceedings of the Algorithm Theory, 1998

Gossiping Large Packets on Full-Port Tori.
Proceedings of the Euro-Par '98 Parallel Processing, 1998

1997
Deterministic Permutation Routing on Meshes.
J. Algorithms, 1997

Routing or Triangles, Tori and Honeycombs.
Int. J. Found. Comput. Sci., 1997

Matrix Transpose on Meshes: Theory and Practice.
Computers and Artificial Intelligence, 1997

Randomized Multipacket Routing and Sorting on Meshes.
Algorithmica, 1997

Routing on Meshes with Buses.
Algorithmica, 1997

Better Trade-Offs for Parallel List Ranking.
SPAA, 1997

Routing with Finite Speeds of Memory and Network.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

Practical Parallel List Ranking.
Proceedings of the Solving Irregularly Structured Problems in Parallel, 1997

Matrix Transpose on Meshes: Theory and Practice.
Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

Sample Sort on Meshes.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

Routing on the PADAM: Degrees of Optimality.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

BSP-Like External-Memory Computation.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996
Routing on Triangles, Tori and Honeycombs.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

List Ranking on Interconnection Networks.
Proceedings of the Euro-Par '96 Parallel Processing, 1996

Worm-Hole Gossiping on Meshes.
Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995
Routing and Sorting on Reconfigurable Meshes.
Parallel Processing Letters, 1995

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, 1995

Solving Cheap Graph Problems an Meshes.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Simulating the Simulator: Deterministic PRAM Simulation on a Mesh Simulator.
Proceedings of the EUROSIM'96, 1995

Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes.
Proceedings of the Algorithms, 1995

1994
Exploiting Locality in LT-RAM Computations.
Proceedings of the Algorithm Theory, 1994

Deterministic 1-k Routing on Meshes.
Proceedings of the STACS 94, 1994

Towards practical permutation routing on meshes.
Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

Constructive Deterministic PRAM Simulation on a Mesh-Connected Computer.
SPAA, 1994

Derandomizing Algorithms for Routing and Sorting on Meshes.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Shorter Queues for Permutation Routing on Meshes.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Deterministic Routing and Sorting on Rings.
Proceedings of the 8th International Symposium on Parallel Processing, 1994

Desnakification of Mesh Sorting Algorithms.
Proceedings of the Algorithms, 1994

1993
Deterministic Permutation Routing on Meshes.
Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, 1993

Randomized Routing on Meshes with Buses.
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992
Optimal Multi-Packet Routing on the Torus.
Proceedings of the Algorithm Theory, 1992

Deterministic Routing on Circular Arrays.
Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

Matching the Bisection Bound for Routing and Sorting on the Mesh.
SPAA, 1992

The Impact of Task-Length Parameters on the Performance of the Random Load-Balancing Algorithm.
Proceedings of the 6th International Parallel Processing Symposium, 1992

1990
Routing Permutations on MESH Interconnection Networks.
Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, 1990


  Loading...