The following pages link to Fredrik Manne (Q235186):
Displaying 31 items.
- A framework for scalable greedy coloring on distributed-memory parallel computers (Q436752) (← links)
- Almost optimal distributed M2M multicasting in wireless mesh networks (Q441875) (← links)
- An efficient self-stabilizing distance-2 coloring algorithm (Q442253) (← links)
- Push-relabel based algorithms for the maximum transversal problem (Q502434) (← links)
- Parallel algorithms for bipartite matching problems on distributed memory computers (Q712711) (← links)
- A self-stabilizing \(\frac23\)-approximation algorithm for the maximum matching problem (Q719294) (← links)
- A new self-stabilizing maximal matching algorithm (Q1008731) (← links)
- Faster deterministic communication in radio networks (Q1022346) (← links)
- Modifying a graph using vertex elimination (Q2345941) (← links)
- Latency-optimal communication in wireless mesh networks (Q2437856) (← links)
- Distributed-Memory Parallel Algorithms for Distance-2 Coloring and Related Problems in Derivative Computation (Q2998040) (← links)
- An Efficient Self-stabilizing Distance-2 Coloring Algorithm (Q3408175) (← links)
- New Acyclic and Star Coloring Algorithms with Application to Computing Hessians (Q3506547) (← links)
- (Q3635574) (← links)
- Efficient Matrix Multiplication on SIMD Computers (Q3988995) (← links)
- (Q4356479) (← links)
- Efficient partitioning of sequences (Q4421153) (← links)
- (Q4677956) (← links)
- (Q4790880) (← links)
- (Q4813178) (← links)
- Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer (Q4842591) (← links)
- Optimal Partitioning of Sequences (Q4845850) (← links)
- Approximations for the general block distribution of a matrix (Q5054840) (← links)
- How to Eliminate a Graph (Q5200518) (← links)
- Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)
- Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks (Q5385938) (← links)
- Heuristic initialization for bipartite matching problems (Q5406225) (← links)
- Faster Centralized Communication in Radio Networks (Q5459129) (← links)
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives (Q5713152) (← links)
- Approximations for the general block distribution of a matrix (Q5958117) (← links)
- On stable marriages and greedy matchings (Q6539150) (← links)
