The following pages link to Jop F. Sibeyn (Q1007567):
Displaying 35 items.
- (Q675294) (redirect page) (← links)
- Randomized multipacket routing and sorting on meshes (Q675295) (← links)
- A bandwidth latency tradeoff for broadcast and reduction (Q1007568) (← links)
- List ranking on meshes (Q1270562) (← links)
- Packet routing in fixed-connection networks: A survey (Q1273848) (← links)
- Practical parallel list ranking (Q1288547) (← links)
- One-by-one cleaning for practical parallel list ranking (Q1348937) (← links)
- Faster deterministic sorting through better sampling. (Q1401197) (← links)
- List-ranking on interconnection networks. (Q1401927) (← links)
- Faster gossiping on butterfly networks (Q1770425) (← links)
- Feedback vertex sets in mesh-based networks (Q2383604) (← links)
- External matrix multiplication and all-pairs shortest path (Q2390290) (← links)
- Oblivious Gossiping on Tori (Q2777603) (← links)
- Deterministic Permutation Routing on Meshes (Q3125221) (← links)
- (Q3128930) (← links)
- Solving cheap graph problems on Meshes (Q3569029) (← links)
- Row-Major Sorting on Meshes (Q4229411) (← links)
- (Q4342908) (← links)
- Routing on Triangles, Tori and Honeycombs (Q4366868) (← links)
- Constructive, Deterministic Implementation of Shared Memory on Meshes (Q4507367) (← links)
- (Q4535804) (← links)
- (Q4536939) (← links)
- (Q4536963) (← links)
- (Q4673406) (← links)
- (Q4791916) (← links)
- (Q4813134) (← links)
- (Q4942649) (← links)
- Exploiting locality in LT-RAM computations (Q5054773) (← links)
- Solving fundamental problems on sparse-meshes (Q5054864) (← links)
- Optimal multi-packet routing on the torus (Q5056134) (← links)
- Shorter queues for permutation routing on meshes (Q5096918) (← links)
- Algorithms and Experiments for the Webgraph (Q5301390) (← links)
- Structural Information and Communication Complexity (Q5315227) (← links)
- Algorithm Theory - SWAT 2004 (Q5315398) (← links)
- External selection (Q5468864) (← links)
