Search the dblp DataBase
Fredrik Manne :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Michelangelo Grigni , Fredrik Manne On the Complexity of the Generalized Block Distribution. [Citation Graph (1, 0)][DBLP ] IRREGULAR, 1996, pp:319-326 [Conf ] Jean R. S. Blair , Fredrik Manne Efficient Generic Multi-Stage Self-Stabilizing Algorithms for Trees. [Citation Graph (0, 0)][DBLP ] ISCA PDCS, 2004, pp:333-338 [Conf ] Fredrik Manne , Qin Xin Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks. [Citation Graph (0, 0)][DBLP ] CAAN, 2006, pp:125-134 [Conf ] Erik G. Boman , Doruk Bozdag , Ümit V. Çatalyürek , Assefaw Hadish Gebremedhin , Fredrik Manne A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers. [Citation Graph (0, 0)][DBLP ] Euro-Par, 2005, pp:241-251 [Conf ] Assefaw Hadish Gebremedhin , Fredrik Manne , Alex Pothen Parallel Distance-k Coloring Algorithms for Numerical Optimization. [Citation Graph (0, 0)][DBLP ] Euro-Par, 2002, pp:912-921 [Conf ] Doruk 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. [Citation Graph (0, 0)][DBLP ] HPCC, 2005, pp:796-806 [Conf ] Jean R. S. Blair , Fredrik Manne Efficient Self-stabilizing Algorithms for Tree Network. [Citation Graph (0, 0)][DBLP ] ICDCS, 2003, pp:20-0 [Conf ] Ferdinando Cicalese , Fredrik Manne , Qin Xin Faster Centralized Communication in Radio Networks. [Citation Graph (0, 0)][DBLP ] ISAAC, 2006, pp:339-348 [Conf ] Assefaw Hadish Gebremedhin , Fredrik Manne , Tom Woods Speeding up Parallel Graph Coloring. [Citation Graph (0, 0)][DBLP ] PARA, 2004, pp:1079-1088 [Conf ] Fredrik Manne A Parallel Algorithm for Computing the Extremal Eigenvalues of Very Large Sparse Matrices. [Citation Graph (0, 0)][DBLP ] PARA, 1998, pp:332-336 [Conf ] Fredrik Manne , Tor Sørevik Partitioning an Array onto a Mesh of Processors. [Citation Graph (0, 0)][DBLP ] PARA, 1996, pp:467-477 [Conf ] Bengt Aspvall , Magnús M. Halldórsson , Fredrik Manne Approximations for the General Block Distribution of a Matrix. [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:47-58 [Conf ] Assefaw Hadish Gebremedhin , Fredrik Manne Scalable parallel graph coloring algorithms. [Citation Graph (0, 0)][DBLP ] Concurrency - Practice and Experience, 2000, v:12, n:12, pp:1131-1146 [Journal ] Fredrik Manne , Tor Sørevik Optimal Partitioning of Sequences. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1995, v:19, n:2, pp:235-249 [Journal ] Bjørn Olstad , Fredrik Manne Efficient Partitioning of Sequences. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1995, v:44, n:11, pp:1322-1326 [Journal ] Bengt Aspvall , Magnús M. Halldórsson , Fredrik Manne Approximations for the general block distribution of a matrix. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2001, v:262, n:1, pp:145-160 [Journal ] Assefaw Hadish Gebremedhin , Arijit Tarafdar , Fredrik Manne , Alex Pothen New Acyclic and Star Coloring Algorithms with Application to Computing Hessians. [Citation Graph (0, 0)][DBLP ] SIAM J. Scientific Computing, 2007, v:29, n:3, pp:1042-1072 [Journal ] Fredrik Manne , Morten Mjelde , Laurence Pilard , Sébastien Tixeuil A New Self-stabilizing Maximal Matching Algorithm. [Citation Graph (0, 0)][DBLP ] SIROCCO, 2007, pp:96-108 [Conf ] Fredrik Manne , Morten Mjelde A Memory Efficient Self-stabilizing Algorithm for Maximal k -Packing. [Citation Graph (0, 0)][DBLP ] SSS, 2006, pp:428-439 [Conf ] Fredrik Manne , Morten Mjelde A Self-stabilizing Weighted Matching Algorithm. [Citation Graph (0, 0)][DBLP ] SSS, 2007, pp:383-393 [Conf ] Fredrik Manne , Morten Mjelde , Laurence Pilard , Sébastien Tixeuil A New Self-Stabilizing Maximal Matching Algorithm [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem. [Citation Graph (, )][DBLP ] A Scalable Parallel Union-Find Algorithm for Distributed Memory Computers. [Citation Graph (, )][DBLP ] An Efficient Self-stabilizing Distance-2 Coloring Algorithm. [Citation Graph (, )][DBLP ] A Self-stabilizing -Approximation Algorithm for the Maximum Matching Problem. [Citation Graph (, )][DBLP ] Efficient Self-stabilizing Graph Searching in Tree Networks. [Citation Graph (, )][DBLP ] Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure. [Citation Graph (, )][DBLP ] Competing in computing (poster session). [Citation Graph (, )][DBLP ] Maximum weighted matching using the partitioned global address space model. [Citation Graph (, )][DBLP ] Faster Deterministic Communication in Radio Networks. [Citation Graph (, )][DBLP ] Search in 0.005secs, Finished in 0.006secs