- Scalable parallel graph coloring algorithms Assefaw Hadish Gebremedhin # Fredrik Manne
- Structured Data Partitioning Fredrik Manne
- On the Complexity of the Generalized Block Distribution
- Approximations for the General Block Distribution of a Matrix \Lambda Bengt Aspvall y Magn'us M. Halld'orsson z Fredrik Manne x
- Efficient Partitioning of Sequences with an Application to Sparse Matrix Computations
- A Scalable Parallel Union-Find Algorithm for Distributed Memory Computers
- Competing in Computing Fredrik Manne #
- Algorithms for Combinatorial Problems Related to Train Marshalling
- Ecient Self-stabilizing Algorithms for Tree Networks
- Minimale eliminasjonstrr for parallell Cholesky-faktorisering
- Efficient Multi-Stage Self-Stabilizing Algorithms for Tree Networks
- Parallel Distancek Coloring Algorithms for Numerical Optimization
- Minimale eliminasjonstrr for parallell Choleskyfaktorisering
- Seismisk modellering p# arbeidsstasjoner i Fredrik Manne \Lambda
- 1 Introduction In many scientific and industrial applications there is a need to solve large sparse
- A New Self-stabilizing Maximal Matching Fredrik Manne1
- On the Complexity of the Generalized Block Distribution
- Time Efficient Radio Broadcasting in Planar Graphs
- SIAM J. MATRIX ANAL. APPL. Vol. 13, No. 1, pp. 386-401, January 1992
- Theoretical Computer Science 410 (2009) 13361345 Contents lists available at ScienceDirect
- FOOD COMPOSITION AND ANALYSIS
- Optimal Partitioning of Sequences Fredrik Manne
- An Efficient Self-stabilizing Distance-2 Coloring Jean Blair1
- Maximum Weighted Matching Using the Partitioned Global Address Space Model Alicia Thorsen, Phillip Merkey Fredrik Manne
- A Self-stabilizing 2 -Approximation Algorithm
- A Memory Efficient Self-stabilizing Algorithm for Maximal k-Packing
- Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks
- Faster Centralized Communication in Radio Networks Ferdinando Cicalese1,
- A PARALLEL ALGORITHM FOR COMPUTING THE EXTREMAL EIGENVALUES OF VERY LARGE SPARSE MATRICES
- Approximations for the General Block Distribution of a Matrix Bengt Aspvall y Magnus M. Halldorssonz Fredrik Mannex
- Seismisk modellering p arbeidsstasjoner i Fredrik Manne
- 1 Introduction In many scienti c and industrial applications there is a need to solve large sparse
- Ser at antall reelle muligheter m vre # antall partisjoner av tallet n # da elementene uten tap av generalitet ikke kan vre strre enn B) da det jo er en
- Efficient Self-stabilizing Graph Searching in Tree Networks
- Computing Approximate Weighted Matchings in Parallel
- Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure
- A Self-stabilizing Weighted Matching Algorithm Fredrik Manne and Morten Mjelde
- A Parallel Algorithm for Computing the Extremal Eigenvalues of Very Large Sparse
- This is page 1 Printer: Opaque this
- Balanced Greedy Colorings of Sparse Random Fredrik Manne
- REDUCING THE HEIGHT OF AN ELIMINATION TREE THROUGH LOCAL REORDERINGS
- A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers
- Structured Data Partitioning Fredrik Manne
- University of Bergen Faculty of Mathematics and Natural Sciences
- Theoretical Computer Science 262 (2001) 145160 www.elsevier.com/locate/tcs
- Speeding up Parallel Graph Coloring Assefaw H. Gebremedhin1,
- Faster Radio Broadcasting in Planar Graphs Fredrik Manne1, Shuang Wang, Qin Xin1
- SIAM J. ScI. COMPUT. Vol. 16, No. 4, pp. 934-950, July 1995
- Competing in Computing Fredrik Manne
- Almost Optimal Distributed M2M Multicasting In Wireless Mesh Networks
- Automated image analysis as a tool to quantify the colour and composition of rainbow trout
- Heuristic Initialization for Bipartite Matching Problems
- Algorithmica (2009) 54: 226242 DOI 10.1007/s00453-007-9136-0
- 1322 IEEE TRANSACTIONS ON COMPUTERS, VOL. 44, NO. 1 1 , NOVEMBER 1995 vol. 33, pp. 493-506,June 1984.
- This is page 1 Printer: Opaque this
- An algorithm for computing an elimination tree of minimum height for a tree
- Partitioning an Array onto a Mesh of Processors Fredrik Manne and Tor S revik
