Fredrik Manne

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2008
23EEFredrik Manne, Qin Xin: Time Efficient Radio Broadcasting in Planar Graphs. JNW 3(2): 9-16 (2008)
2007
22EEFredrik Manne, Morten Mjelde, Laurence Pilard, Sébastien Tixeuil: A New Self-stabilizing Maximal Matching Algorithm. SIROCCO 2007: 96-108
21EEFredrik Manne, Morten Mjelde: A Self-stabilizing Weighted Matching Algorithm. SSS 2007: 383-393
20EEFredrik Manne, Morten Mjelde, Laurence Pilard, Sébastien Tixeuil: A New Self-Stabilizing Maximal Matching Algorithm CoRR abs/cs/0701189: (2007)
19EEAssefaw Hadish Gebremedhin, Arijit Tarafdar, Fredrik Manne, Alex Pothen: New Acyclic and Star Coloring Algorithms with Application to Computing Hessians. SIAM J. Scientific Computing 29(3): 1042-1072 (2007)
2006
18EEFredrik Manne, Qin Xin: Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks. CAAN 2006: 125-134
17EEFerdinando Cicalese, Fredrik Manne, Qin Xin: Faster Centralized Communication in Radio Networks. ISAAC 2006: 339-348
16EEFredrik Manne, Morten Mjelde: A Memory Efficient Self-stabilizing Algorithm for Maximal k -Packing. SSS 2006: 428-439
2005
15EEErik G. Boman, Doruk Bozdag, Ümit V. Çatalyürek, Assefaw Hadish Gebremedhin, Fredrik Manne: A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers. Euro-Par 2005: 241-251
14EEDoruk Bozdag, Ümit V. Çatalyürek, Assefaw Hadish Gebremedhin, Fredrik Manne, Erik G. Boman, Füsun Özgüner: A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers. HPCC 2005: 796-806
2004
13 Jean R. S. Blair, Fredrik Manne: Efficient Generic Multi-Stage Self-Stabilizing Algorithms for Trees. ISCA PDCS 2004: 333-338
12EEAssefaw Hadish Gebremedhin, Fredrik Manne, Tom Woods: Speeding up Parallel Graph Coloring. PARA 2004: 1079-1088
2003
11EEJean R. S. Blair, Fredrik Manne: Efficient Self-stabilizing Algorithms for Tree Network. ICDCS 2003: 20-
2002
10EEAssefaw Hadish Gebremedhin, Fredrik Manne, Alex Pothen: Parallel Distance-k Coloring Algorithms for Numerical Optimization. Euro-Par 2002: 912-921
2001
9 Tor Sørevik, Fredrik Manne, Randi Moe, Assefaw Hadish Gebremedhin: Applied Parallel Computing, New Paradigms for HPC in Industry and Academia, 5th International Workshop, PARA 2000 Bergen, Norway, June 18-20, 2000 Proceedings Springer 2001
8EEBengt Aspvall, Magnús M. Halldórsson, Fredrik Manne: Approximations for the general block distribution of a matrix. Theor. Comput. Sci. 262(1): 145-160 (2001)
2000
7 Assefaw Hadish Gebremedhin, Fredrik Manne: Scalable parallel graph coloring algorithms. Concurrency - Practice and Experience 12(12): 1131-1146 (2000)
1998
6 Fredrik Manne: A Parallel Algorithm for Computing the Extremal Eigenvalues of Very Large Sparse Matrices. PARA 1998: 332-336
5EEBengt Aspvall, Magnús M. Halldórsson, Fredrik Manne: Approximations for the General Block Distribution of a Matrix. SWAT 1998: 47-58
1996
4 Michelangelo Grigni, Fredrik Manne: On the Complexity of the Generalized Block Distribution. IRREGULAR 1996: 319-326
3 Fredrik Manne, Tor Sørevik: Partitioning an Array onto a Mesh of Processors. PARA 1996: 467-477
1995
2 Bjørn Olstad, Fredrik Manne: Efficient Partitioning of Sequences. IEEE Trans. Computers 44(11): 1322-1326 (1995)
1 Fredrik Manne, Tor Sørevik: Optimal Partitioning of Sequences. J. Algorithms 19(2): 235-249 (1995)

Coauthor Index

1Bengt Aspvall [5] [8]
2Jean R. S. Blair [11] [13]
3Erik G. Boman [14] [15]
4Doruk Bozdag [14] [15]
5Ümit V. Çatalyürek [14] [15]
6Ferdinando Cicalese [17]
7Assefaw Hadish Gebremedhin [7] [9] [10] [12] [14] [15] [19]
8Michelangelo Grigni [4]
9Magnús M. Halldórsson [5] [8]
10Morten Mjelde [16] [20] [21] [22]
11Randi Moe [9]
12Bjørn Olstad [2]
13Füsun Özgüner [14]
14Laurence Pilard [20] [22]
15Alex Pothen [10] [19]
16Tor Sørevik [1] [3] [9]
17Arijit Tarafdar [19]
18Sébastien Tixeuil [20] [22]
19Tom Woods [12]
20Qin Xin [17] [18] [23]

Colors in the list of coauthors

Copyright © Wed Aug 20 16:51:14 2008 by Michael Ley (ley@uni-trier.de)