| Home | Research | Publications | Teaching and Students | Contact |
An efficient self-stabilizing distance-2 coloring algorithm. With J. Blair. Theoretical Computer Science, Vol. 444, (2012), pp. 28-39.
Almost optimal distributed M2M multicasting in wireless mesh networks. With Q. Xin, Y. Zhang, X. Wang, Theoretical Computer Science, Vol. 439, (2012), pp. 69-82.
Parallel algorithms for bipartite matching problems on distributed memory computers. With J. Langguth, Md. M. Patwary. Parallel Computing, Vol. 37, No. 12 (2012), pp. 820-845.
A self-stabilizing 2/3-approximation algorithm for the maximum matching problem. With M. Mjelde, L. Pilard, S. Tixeuil. Theoretical Computer Science, Vol. 412, No. 40 (2011), pp. 5515-5526.
Distributed-memory Parallel Algorithms for Distance-2 Coloring and Related Problems in Derivated Computation. With D. Bozdag, U. V. Catalyurek, A. H. Gebremedhin, E. G. Boman, and F. Ozguner, SIAM Journal on Scientific Computation, Vol. 32, No. 4 (2010), pp. 2418-2446. PDF
Heuristic Initialization for Bipartite Matching Problems. With J. Langguth and P. Sanders, Journal of Experimental Algorithmics, No 15 (2010). PDF
A New Self-stabilizing Maximal Matching Algorithm. With M. Mjelde, L. Pilard, and S. Tixeuil, Theoretical Computer Science, Vol 410, No 14 (2009), pp. 1336-1345. PDF
Faster Deterministic Communication in Radio Networks. With F. Cicalese and Q. Xin, Algorithmica, Vol 54, No 2 (2009), pp. 226-242. PDF
A Framework for Scalable Greedy Coloring on Distributed Memory Parallel Computers. With D. Bozdag, A. Gebremedhin, E. Boman, and U. Catalyurek, Journal of Parallel and Distributed Computing, Vol 68, No 4 (2008), pp. 515-535. PDF
Time Efficient Radio Broadcasting in Planar Graphs. With Q. Xin. Journal of Networks, Vol 3, No 2 (2008), pp. 9-16. PDF
New Acyclic and Star Coloring Algorithms With Application to Computing Hessians. With A. H. Gebremedhin, A. Tarafdar, and A. Pothen, SIAM Journal on Scientific Computing, Vol 29, No 3 (2007), pp. 1042-1072. PDF
Rapid Estimation of Fat Content in Salmon Fillets by Colour Image Analysis Journal of Food Composition and Analysis . With L. H. Stien and A. Kiessling. Journal of Food Composition and Analysis, No 20, (2007) pp. 73-79. PDF
Automated Image Analysis as a Tool to Quantify the Colour and Composition of Rainbow Trout (Oncorhynchus mykiss W.) cutlets. With L. H. Stien, K. Ruohonene, A. Kause, K. Rungruangsak-Torrissen and A. Kiessling. Aquaculture, Vol 261, No 2 (2006), pp. 695-705. PDF
What Color is Your Jacobian? Graph Coloring for Computing Derivatives. With A. H. Gebremedhin and A. Pothen. SIAM Review, Vol 47, No 4 (2005), pp. 629-705. PDF
Scalable Parallel Graph Coloring Algorithms. With A. H. Gebremedhin. Concurrency: Practice and Experience. Vol 12, No 12 (2000). pp. 1131-1146. PDF
Approximations for the Generalized Block Distribution of a Matrix. With B. Aspvall and M. Halldorsson. Theoretical Computer Science, Vol 262, No 1-2 (2001), pp. 145-160. PDF
Optimal Partitioning of Sequences. With T. Sørevik. Journal of Algorithms, Vol 19, No 2 (1995), pp. 235-249. PDF
Efficient Partitioning of Sequences. With B. Olstad. IEEE Transactions on Computing, Vol 44, No 11 (1995), pp. 1322-1326. PDF (See also note on [Man93]).
Efficient Sparse Cholesky Factorization on a Parallel SIMD Computer. With H. Hafsteinsson. SIAM Journal on Scientific Computing, Vol 16, No 4 (1995), pp. 934-950. PDF
Efficient Matrix Multiplication on SIMD Computers. With P. Bjørstad, T. Sørevik, and M. Vajtersic. SIAM Journal on Matrix Analysis and Applications, Vol 13, No 1 (1992), pp. 386-401. PDF
A Self-Stabilizing Weighted Matching Algorithm, With M. Mjelde. In proceedings of the 9th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2007, Lecture Notes in Computer Science 4838, Springer, pp. 383-393, 2007. PDF
A Memory Efficient Self-stabilizing Algorithm for Maximal k-packing, With M. Mjelde. In proceedings of The 8th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2006. Lecture Notes in Computer Science 4271, Springer, pp. 428-439, 2006. PDF
Optimal Gossiping with Unit Size Messages in Known Radio Networks. With Q. Xin. In proceedings of The 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2006. Lecture Notes in Computer Science 4235, Springer, pp. 125-134, 2006. PDF
Faster Centralized Communication in Radio Networks. With F.Cicalese and Q. Xin. In proceedings of The 17th International Symposium on Algorithms and Computation, ISAAC 2006, Lecture Notes in Computer Science 4288, Springer, pp. 339-348, 2006. PDF
Balanced Greedy Colorings of Sparse Random Graphs. With E. G. Boman. In proceedings of The Norwegian Informatics Conference, NIK'2005, pp. 113-124, 2005. PDF
A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers. With E. G. Boman, D. Bozdag, U. Catalyurek, and A. H. Gebremedhin. In proceedings of The 11th International Conference on Parallel and Distributed Computing, Euro-Par 2005, Lecture Notes in Computer Science 3648, Springer, pp. 241-251, 2005. PDF
A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers. With D. Bozdag, U. Catalyurek, A. H. Gebremedhin, E. G. Boman, and F. Ozguner. In proceedings of The 2005 International Conference on High Performance Computing and Communications, HPCC 05, Lecture Notes in Computer Science 3726, Springer, pp. 796-806, 2005. PDF
Broadcast Domination Algorithms for Interval Graphs, Series-Parallel Graphs, and Trees. With J. Blair, P. Heggernes, and S. Horton. In proceedings of The 35th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, CGTC 2004. Congressus Numerantium 169, pp. 55-77, 2004. PDF
Efficient Generic Multi-stage Self-stabilizing Algorithms for Trees. With J. Blair. In proceedings of The 17th International Conference on Parallel and Distrubted Computing Systems, ISCA PDCS-2004, pp. 333-338, 2004. PDF
Speeding up Parallel Graph Coloring. With A. Gebremedhin and T. Woods. In proceedings of The 7th International Workshop on Applied Parallel Computing, Para04, Lecture Notes in Computer Science 3732, Springer, pp. 1079-1088. PDF
Efficient Self-stabilzing Algorithms for Tree Networks. With J. Blair. In proceedings of The 23rd IEEE International Conference on Distributed Computing Systems, ICDCS 2003, pp. 20-26, 2003. PDF
Parallel Distance-k Coloring Algorithms for Numerical Optimization. With A.H. Gebremedhin and A. Pothen. In proceedings of The 8th International Conference on Parallel and Distributed Computing, Euro-Par 2002, Lecture Notes in Computer Science 2400, Springer, pp. 912-921, 2002. PDF
Competing in Computing. In proceedings of The Norwegian Informatics Conference, NIK'2000. pp. 129-138, 2000. PDF
Algorithms for Combinatorial Problems Related to Train Marshalling. With E. Dahlhaus, M. Miller, and J. Ryan. In proceedings of The 11th Australasian Workshop on Combinatorial Algorithms, AWOCA 2000. pp. 7-16, 2000. PDF
Parallel Graph Coloring Using OpenMP (Extended Abstract) . With A. H. Gebremedhin. In proceedings of The 1st European Workshop on OpenMP, EWOMP'99, pp. 10-18, 1999. PDF
A Parallel Algorithm for Computing the Extremal Eigenvalues of Very Large Sparse Matrices, Extended Abstract. In proceedings of The 4th International Workshop on Applied Parallel Computing, Para'98. Lecture Notes in Computer Science 1541, Springer, pp. 332-336, 1998. PDF or PDF (full paper)
Approximations for the Generalized Block Distribution of a Matrix. With B. Aspvall and M. Halldorsson. In proceedings of The 6th Scandinavian Workshop on Algorithm Theory, SWAT'98, Lecture Notes in Computer Science 1432, Springer, pp. 47-58, 1998. PDF
On the Complexity of the Generalized Block Distribution. With Michelangelo Grigni. In proceedings of The 3rd International Workshop on Parallel Algorithms for Irregularly Structured Problems, Irregular'96. Lecture Notes in Computer Science 1117, Springer, pp. 319-326, 1996. PDF
Partitioning an Array onto a Mesh of Processors. With Tor Sørevik. In proceedings of The 3rd International Workshop on Applied Parallel Computing in Industrial Problems and Optimization, Para'96. Lecture Notes in Computer Science 1184, Springer, pp. 467-477, 1996. PDF
Seismisk modellering på arbeidsstasjoner i nettverk. In proceedings of The Norwegian Informatics Conference, NIK'94, pp. 151-159, 1994.
An Algorithm for Computing an Elimination Tree of Minimum Height for a Tree, Presented at The 2nd Meeting of the International Linear Algebra Society, Lisbon, Portugal, 1992. Also available as: Tech. Report CS-91-59, University of Bergen, Norway, 1991. PDF
Reducing the Height of an Elimination Tree Through Local Reorderings. Presented at The 4th SIAM Triennial Conference on Applied Linear Algebra, Minneapolis, Minnesota 1991. Also available as: Tech. Report CS-91-51, University of Bergen, Norway 1991. PDF,
Top of page.
Top of page.
Computing Approximate Weighted Matchings in Parallel. Slides from presentation at SIAM Conference on Parallel Processing for Scientific Computing, San Francisco, Feb. 22-24, 2006. PDF,
Competing in Computing. Poster presentation. Extended abstract in proceedings of ITiCSE 2000, The 5th Annual Conference on Innovation and Technology in Computer Science Education, pp. 190-190. Full paper: PDF,
2D seismisk modellering på parallelmaskinen Cray Origin 2000. With Lars Frøyland and Norunn Skjei. Norsk Hydro U&P Internal report, 1998.
Parallellisering av Eclipse. Norsk Hydro U&P Internal report, 1995.
Distribuerte lokale gitter i Eclipse. Norsk Hydro U&P Internal report, 1994.
A test of the SGI Challenge parallel computer using software from Norsk Hydro. Norsk Hydro U&P Internal report, 1993.
An implementation of the Neocognitron as proposed by Fukushima. With Petter Møller. IBM Internal report, 1988.
Load Balancing in Parallel Sparse Matrix Computations , PhD thesis, Department of Informatics, University of Bergen, Norway, 1993.
Top of page.