Jop F. Sibeyn

75 papers A* 2A 7B 12C 1Misc 1Journal 27Unranked 24
YearRankTypeTitle / Venue / Authors
2007 J jnl
Feedback vertex sets in mesh-based networks.
Theor. Comput. Sci.
Flaminia L. Luccio, Jop F. Sibeyn
2006 J jnl
Algorithms and Experiments for the Webgraph.
J. Graph Algorithms Appl.
Debora Donato, Luigi Laura, Stefano Leonardi, Ulrich Meyer, Stefano Millozzi, Jop F. Sibeyn
2006 J jnl
External selection.
J. Algorithms
Jop F. Sibeyn
2005 J jnl
Faster gossiping on butterfly networks.
Theor. Comput. Sci.
Jop F. Sibeyn
2005 J jnl
Preface: Structural Information and Communication Complexity.
Theor. Comput. Sci.
David Peleg, Jop F. Sibeyn
2004 — conf
Engineering an External Memory Minimum Spanning Tree Algorithm.
IFIP TCS
Roman Dementiev, Peter Sanders, Dominik Schultes, Jop F. Sibeyn
2004 — conf
External Connected Components.
SWAT
Jop F. Sibeyn
2004 J jnl
External matrix multiplication and all-pairs shortest path.
Inf. Process. Lett.
Jop F. Sibeyn
2004 B conf
Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks.
SIROCCO
Flaminia L. Luccio, Jop F. Sibeyn
2003 J jnl
A bandwidth latency tradeoff for broadcast and reduction.
Inf. Process. Lett.
Peter Sanders, Jop F. Sibeyn
2003 A conf
Algorithms and Experiments for the Webgraph.
ESA
Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, Jop F. Sibeyn
2003 — ed.
Algorithms for Memory Hierarchies, Advanced Lectures [Dagstuhl Research Seminar, March 10-14, 2002]
Algorithms for Memory Hierarchies
Ulrich Meyer, Peter Sanders, Jop F. Sibeyn
2003 J jnl
Faster deterministic sorting through better sampling.
Theor. Comput. Sci.
Jop F. Sibeyn
2003 J jnl
List-ranking on interconnection networks.
Inf. Comput.
Jop F. Sibeyn
2003 — conf
Minimizing Global Communication in Parallel List Ranking.
Euro-Par
Jop F. Sibeyn
2003 J jnl
Optimal Gossiping on CCCs of Even Dimension.
Parallel Process. Lett.
Jop F. Sibeyn, Michal Soch
2003 A conf
Routing on Meshes in Optimum Time and with Really Small Queues.
IPDPS
Bogdan S. Chlebus, Jop F. Sibeyn
2003 B ed.
SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, June 18-20, 2003, Umeå Sweden
SIROCCO
Jop F. Sibeyn
2002 B conf
Heuristics for semi-external depth first search on directed graphs.
SPAA
Jop F. Sibeyn, James Abello, Ulrich Meyer
2002 J jnl
Oblivious Gossiping on Tori.
J. Algorithms
Ulrich Meyer, Jop F. Sibeyn
2002 J jnl
One-by-One Cleaning for Practical Parallel List Ranking.
Algorithmica
Jop F. Sibeyn
2002 J jnl
Optimal List Ranking on One-Dimensional Arrays.
Parallel Process. Lett.
Jop F. Sibeyn
2002 — conf
Routing and Communication in Interconnection Networks.
Euro-Par
Michele Flammini, Bruce M. Maggs, Jop F. Sibeyn, Berthold Vöcking
2001 — conf
Beyond External Computing: Analysis of the Cycle Structure of Permutations.
Euro-Par
Jörg Keller, Jop F. Sibeyn
2001 A* conf
Faster Gossiping on Butterflies.
ICALP
Jop F. Sibeyn
2000 — conf
A Bandwidth Latency Tradeoff for Broadcast and Reduction.
Euro-Par
Peter Sanders, Jop F. Sibeyn
2000 B conf
A powerful heuristic for telephone gossiping.
SIROCCO
René Beier, Jop F. Sibeyn
2000 J jnl
Constructive, Deterministic Implementation of Shared Memory on Meshes.
SIAM J. Comput.
Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn
2000 J jnl
Solving Fundamental Problems on Sparse-Meshes.
IEEE Trans. Parallel Distributed Syst.
Jop F. Sibeyn
1999 — conf
Better Deterministic Routing on Meshes.
IPPS/SPDP
Jop F. Sibeyn
1999 A conf
External Selection.
STACS
Jop F. Sibeyn
1999 B conf
Power and Limitations of Optical Reconfigurable Arrays.
SIROCCO
Jop F. Sibeyn
1999 J jnl
Practical Parallel List Ranking.
J. Parallel Distributed Comput.
Jop F. Sibeyn, Frank Guillaume, Tillmann Seidel
1999 Misc conf
Ultimate Parallel List Ranking?
HiPC
Jop F. Sibeyn
1998 — conf
Gossiping Large Packets on Full-Port Tori.
Euro-Par
Ulrich Meyer, Jop F. Sibeyn
1998 J jnl
Gossiping on Meshes and Tori.
IEEE Trans. Parallel Distributed Syst.
Ben H. H. Juurlink, Jop F. Sibeyn, P. S. Rao
1998 J jnl
List Ranking on Meshes.
Acta Informatica
Jop F. Sibeyn
1998 J jnl
Packet Routing in Fixed-Connection Networks: A Survey.
J. Parallel Distributed Comput.
Miltos D. Grammatikakis, D. Frank Hsu, Jop F. Sibeyn
1998 J jnl
Row-Major Sorting on Meshes.
SIAM J. Comput.
Jop F. Sibeyn
1998 — conf
Solving Fundamental Problems on Sparse-Meshes.
SWAT
Jop F. Sibeyn
1997 C conf
BSP-Like External-Memory Computation.
CIAC
Jop F. Sibeyn, Michael Kaufmann
1997 B conf
Better Trade-Offs for Parallel List Ranking.
SPAA
Jop F. Sibeyn
1997 J jnl
Deterministic Permutation Routing on Meshes.
J. Algorithms
Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann
1997 — conf
Matrix Transpose on Meshes: Theory and Practice.
IPPS
Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn
1997 J jnl
Matrix Transpose on Meshes: Theory and Practice.
Comput. Artif. Intell.
Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn
1997 — conf
Practical Parallel List Ranking.
IRREGULAR
Jop F. Sibeyn, Frank Guillaume, Tillmann Seidel
1997 J jnl
Randomized Multipacket Routing and Sorting on Meshes.
Algorithmica
Michael Kaufmann, Jop F. Sibeyn
1997 J jnl
Routing on Meshes with Buses.
Algorithmica
Michael Kaufmann, Rajeev Raman, Jop F. Sibeyn
1997 — conf
Routing on the PADAM: Degrees of Optimality.
Euro-Par
Bogdan S. Chlebus, Artur Czumaj, Jop F. Sibeyn
1997 J jnl
Routing or Triangles, Tori and Honeycombs.
Int. J. Found. Comput. Sci.
Jop F. Sibeyn
1997 B conf
Routing with Finite Speeds of Memory and Network.
MFCS
Jop F. Sibeyn
1997 — conf
Sample Sort on Meshes.
Euro-Par
Jop F. Sibeyn
1996 — conf
List Ranking on Interconnection Networks.
Euro-Par, Vol. I
Jop F. Sibeyn
1996 B conf
Routing on Triangles, Tori and Honeycombs.
MFCS
Jop F. Sibeyn
1996 — conf
Worm-Hole Gossiping on Meshes.
Euro-Par, Vol. I
Ben H. H. Juurlink, P. S. Rao, Jop F. Sibeyn
1995 A conf
Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes.
ESA
Michael Kaufmann, Jop F. Sibeyn, Torsten Suel
1995 J jnl
Load Balancing: a Programmer's Approach or the Impact of Task-Length Parameters on the Load Balancing Performance of Parallel Programs.
Int. J. High Speed Comput.
Yosi Ben-Asher, Assaf Schuster, Jop F. Sibeyn
1995 J jnl
Routing and Sorting on Reconfigurable Meshes.
Parallel Process. Lett.
Michael Kaufmann, Heiko Schröder, Jop F. Sibeyn
1995 — conf
Simulating the Simulator: Deterministic PRAM Simulation on a Mesh Simulator.
EUROSIM
Ulrich Meyer, Jop F. Sibeyn
1995 B conf
Solving Cheap Graph Problems an Meshes.
MFCS
Jop F. Sibeyn, Michael Kaufmann
1994 B conf
Constructive Deterministic PRAM Simulation on a Mesh-Connected Computer.
SPAA
Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn
1994 A* conf
Derandomizing Algorithms for Routing and Sorting on Meshes.
SODA
Michael Kaufmann, Jop F. Sibeyn, Torsten Suel
1994 A conf
Desnakification of Mesh Sorting Algorithms.
ESA
Jop F. Sibeyn
1994 A conf
Deterministic 1-k Routing on Meshes.
STACS
Jop F. Sibeyn, Michael Kaufmann
1994 — conf
Deterministic Routing and Sorting on Rings.
IPPS
Jop F. Sibeyn
1994 — conf
Exploiting Locality in LT-RAM Computations.
SWAT
Jop F. Sibeyn, Tim J. Harris
1994 B conf
Shorter Queues for Permutation Routing on Meshes.
MFCS
Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann
1994 — conf
Towards practical permutation routing on meshes.
SPDP
Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn
1993 — conf
Deterministic Permutation Routing on Meshes.
SPDP
Bogdan S. Chlebus, Michael Kaufmann, Jop F. Sibeyn
1993 A conf
Randomized Routing on Meshes with Buses.
ESA
Jop F. Sibeyn, Michael Kaufmann, Rajeev Raman
1992 — conf
Deterministic Routing on Circular Arrays.
SPDP
Michael Kaufmann, Jop F. Sibeyn
1992 B conf
Matching the Bisection Bound for Routing and Sorting on the Mesh.
SPAA
Michael Kaufmann, Sanguthevar Rajasekaran, Jop F. Sibeyn
1992 — conf
Optimal Multi-Packet Routing on the Torus.
SWAT
Michael Kaufmann, Jop F. Sibeyn
1992 — conf
The Impact of Task-Length Parameters on the Performance of the Random Load-Balancing Algorithm.
IPPS
Yosi Ben-Asher, Aviad Cohen, Assaf Schuster, Jop F. Sibeyn
1990 — conf
Routing Permutations on MESH Interconnection Networks.
SPDP
Jop F. Sibeyn