Hjem
Fredrik Mannes bilde

Fredrik Manne

Professor
  • E-postFredrik.Manne@uib.no
  • Telefon+47 55 58 41 90
  • Besøksadresse
    HIB - Thormøhlensgt. 55
    Rom 
    3145
  • Postadresse
    Postboks 7803
    5020 Bergen
Vitenskapelig artikkel
  • 2019. Approximation algorithms in combinatorial scientific computing. Acta Numerica. 541-633.
  • 2016. Efficient approximation algorithms for weighted b-matching. SIAM Review. S593-S619.
  • 2015. Pardicle: parallel approximate density-based clustering. International Conference for High Performance Computing, Networking, Storage and Analysis. 560-571.
  • 2015. Modifying a graph using vertex elimination. Algorithmica. 99-125.
  • 2015. Codesign lessons learned from implementing graph matching on multithreaded architectures. Computer. 46-55.
  • 2014. On parallel push-relabel based algorithms for bipartite maximum matching. Parallel Computing. 289-308.
  • 2014. Latency-optimal communication in wireless mesh networks. Theoretical Computer Science. 79-84.
  • 2013. Push-relabel based algorithms for the maximum transversal problem. Computers & Operations Research. 1266-1275.
  • 2013. Modifying a Graph Using Vertex Elimination. Algorithmica.
  • 2013. Efficient counting of maximal independent sets in sparse graphs. Lecture Notes in Computer Science (LNCS). 103-114.
  • 2012. Multi-core Spanning Forest Algorithms using the Disjoint-set Data Structure. Proceedings, International Parallel and Distributed Processing Symposium (IPDPS). 827-835.
  • 2012. How to Eliminate a Graph. Lecture Notes in Computer Science (LNCS). 320-331.
  • 2012. An efficient self-stabilizing distance-2 coloring algorithm. Theoretical Computer Science. 28-39.
  • 2012. Almost optimal distributed M2M multicasting in wireless mesh networks. Theoretical Computer Science. 69-82.
  • 2011. Parallel algorithms for bipartite matching problems on distributed memory computers. Parallel Computing. 820-845.
  • 2011. A self-stabilizing 2/3-approximation algorithm for the maximum matching problem. Theoretical Computer Science. 5515-5526.
  • 2010. Heuristic initialization for bipartite matching problems. ACM Journal of Experimental Algorithmics.
  • 2010. Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure. Lecture Notes in Computer Science (LNCS). 411-423.
  • 2010. Efficient Self-stabilizing Graph Searching in Tree Networks. Lecture Notes in Computer Science (LNCS). 111-125.
  • 2010. Distributed-memory parallel algorithms for distance-2 coloring and related problems in derivative computation. SIAM Journal on Scientific Computing. 2418-2446.
  • 2010. An Efficient Self-stabilizing Distance-2 Coloring Algorithm. Lecture Notes in Computer Science (LNCS). 237-251.
  • 2009. Faster Deterministic Communication in Radio Networks. Algorithmica. 226-242.
  • 2009. A new self-stabilizing maximal matching algorithm. Theoretical Computer Science. 1336-1345.
  • 2009. A Scalable Parallel Union-Find Algorithm for Distributed Memory Computers. Lecture Notes in Computer Science (LNCS). 186-195.
  • 2008. Time Efficient Radio Broadcasting in Planar Graphs. Journal of Networks. 9-16.
  • 2008. A framework for scalable greedy coloring on distributed-memory parallel computers. Journal of Parallel and Distributed Computing. 515-535.
  • 2008. A Self-stabilizing 2/3-Approximation Algorithm for the Maximum Matching. Lecture Notes in Computer Science (LNCS). 94-108.
  • 2007. Rapid estimation of fat content in salmon fillets by colour image analysis. Journal of Food Composition and Analysis. 73-79.
  • 2007. Rapid estimation of fat content in salmon fillets by colour image analysis. Journal of Food Composition and Analysis. 73-79.
  • 2007. New acyclic and star coloring algorithms with application to computing hessians. SIAM Journal on Scientific Computing. 1042-1072.
  • 2007. A Self-stabilizing Weighted Matching Algorithm. Lecture Notes in Computer Science (LNCS). 383-393.
  • 2007. A New Self-stabilizing Maximal Matching Algorithm. Lecture Notes in Computer Science (LNCS). 96-108.
  • 2006. Speeding up parallel graph coloring. Lecture Notes in Computer Science (LNCS).
  • 2006. Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks. Lecture Notes in Computer Science (LNCS). 125-134.
  • 2006. Faster Centralized Communication in Radio Networks. Lecture Notes in Computer Science (LNCS). 339-348.
  • 2006. Automated image analysis as a tool to quantify the colour and composition of rainbow trout (Oncorhynchus mykiss W.) cutlets. Aquaculture. 695-705.
  • 2006. A Memory Efficient Self-stabilizing Algorithm for Maximal k-packing. Lecture Notes in Computer Science (LNCS). 428-439.
  • 2005. A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers. Lecture Notes in Computer Science (LNCS). 241-251.
  • 2005. A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers. Lecture Notes in Computer Science (LNCS). 796-806.
  • 2004. Parallel distance-k coloring algorithms for numerical optimization. Lecture Notes in Computer Science (LNCS). 912-921.
  • 2004. Broadcast Domination Algorithms for Interval Graphs, Series-Parallel Graphs, and Trees. Congressus Numerantium. 55-77.
  • 2001. Approximations for the Generalized Block Distribution of a Matrix. Theoretical Computer Science. 145-160.
  • 2000. Scalable parallel graph coloring algorithms. Concurrency: Practice and Experience. 1131-1146.
  • 1992. Efficient matrix multiplication on SIMD computers. SIAM Journal on Matrix Analysis and Applications. 386-401.
Rapport
  • 2003. Broadcast domination algorithms for interval graphs, series-parallel graphs and trees. 249. 249. .
  • 2002. SCALABLE PARALLEL ALGORITHM FOR MATRIX MULTIPLICATION BY GRAMIAN OF TOEPLITZ--BLOCK MATRIX. NATO/977203/3. NATO/977203/3. .
  • 2002. Norsk Informatikkonferanse NIK'2002. .
  • 2002. Norsk Informatikkonferanse NIK'2002. .
  • 2002. Efficient Self-stabilizing Algorithms for Tree Networks. 232. 232. .
  • 1999. Competing in Computing. .
  • 1997. Approximations for the General Block Distribution of a Matrix. 141. 141. .
  • 1996. Partitioning an array onto a mesh of processors. .
  • 1993. Efficient sparce Cholesky factorization on a parallel SIMD computer. 84. 84. .
  • 1992. Optimal partitioning of sequences. .
  • 1992. Optimal partitioning of sequences. .
  • 1992. An algorithm for computing an elimination tree of minimum height for a tree. .
  • 1992. An algorithm for computing a minimum height elimination tree for a tree. .
  • 1991. Reducing the height of an elimination tree through local recordings. .
  • 1991. Reducing the Height of an Elimination Tree Through Local Recordings. .
  • 1991. Efficient matrix multiplication on SIMD computers. .
  • 1991. Efficient Matrix Multiplication on SIMD Computers. .
Vitenskapelig foredrag
  • 2005. Parallel Graph Coloring.
  • 2005. Graph Coloring for Computing Derivatives: A Unifying Framework.
  • 2005. Balanced greedy colorings of sparse random graphs.
  • 2005. A New Linear-Time Acyclic Coloring Algorithm.
  • 2004. Speeding up parallel graph coloring.
  • 2004. Self stabilizing algorithms on tree networks.
  • 2004. Efficient multi-stage self-stabilizing algorithms for tree-networks.
  • 2004. Efficient Generic Multi-stage Self-stabilizing algorithms for trees.
  • 2004. Broadcast Domination Algorithms for Interval Graphs, Series-Parallel Graphs, and Trees.
  • 2004. Anvendelse av bildeanalyse og andre ikke-destruktive målemetoder for kvalitetsvurdering av fisk.
  • 2003. Graph coloring in optimization, revisited.
  • 2003. Efficient self-stabilizing algorithms.
  • 2003. Efficient Self-stabilizing algorithms for tree networks.
  • 2002. Parallel Distance-k Coloring Algorithms for Numerical Optimization.
  • 2002. Parallel Distance-k Coloring Algorithms for Numerical Optimization.
  • 2002. Efficient Self-stabilizing Algorithms for Tree Networks.
  • 2000. Competing in computing.
  • 2000. Competing in computing.
  • 2000. Algorithms for combinatorial problems related to train marshalling.
  • 2000. Algorithms for combinatorial problems related to train marshalling.
  • 1999. Parallel Graph Coloring Using OpenMP.
  • 1998. Approximations for the generalized block distribution of a matrix.
  • 1998. A parallel algorithm for computing the extremal eigenvalues of very large sparse matrices (Extended Abstract).
  • 1997. Approximations for the General Block Distribution of a Matrix.
Vitenskapelig antologi/Konferanseserie
  • 2003. Norsk Informatikkonferanse NIK'2003. Tapir Akademisk Forlag.
  • 2001. Applied Parallel Computing, New Paradigms for HPC in Industry and Academia. Springer.
  • 2000. Norsk Informatikkonferanse NIK'2000. Tapir Akademisk Forlag.
Fagbok
  • 2001. Norsk Informatikkonferanse, NIK'2001. Universitetet i Tromsø.
  • 2000. Applied Parallel Computing, Procedings of the 5th International Workshop, PARA2000. Springer Lecture Notes in Computer Science.
  • 2000. Applied Parallel Computing, Procedings of the 5th International Workshop, PARA2000. Springer Lecture Notes in Computer Science.
Kronikk
  • 2012. Raskere, sterkere, høyere! Bergens Tidende. 3-3.
Doktorgradsavhandling
  • 2017. Parallel Matching and Clustering Algorithms on GPUs.
  • 1993. Load balancing in parallel sparse matrix computations.
Vitenskapelig Kapittel/Artikkel/Konferanseartikkel
  • 2016. On Stable Marriages and Greedy Matchings. 10 sider.
  • 2015. Optimizing Approximate Weighted Matching on Nvidia Kepler K40. 10 sider.
  • 2014. Pardicle: parallel approximate density-based clustering. 12 sider.
  • 2014. New Iterative Algorithms for Weighted Matching. 10 sider.
  • 2014. New Effective Multithreaded Matching Algorithms. 10 sider.
  • 2013. Scalable parallel OPTICS data clustering using graph algorithmic techniques. 12 sider.
  • 2012. A new scalable parallel DBSCAN algorithm using the disjoint-set data structure. 11 sider.
  • 2010. Parallel Greedy Graph Matching Using an Edge Partitioning Approach. 10 sider.
  • 2009. Maximum weighted matching using the partitioned global address space model. 6 sider.
  • 2007. Faster Radio Broadcasting in Planar Graphs. 5 sider.
  • 2005. Balanced greedy coloring of sparce random graphs. 12 sider.
Annet
  • 2002. Efficient Self-stabilizing Algorithms for Tree Networks. 121-132.
Poster
  • 2005. Self-stabilizing K-Packing and K-Domination on tree graphs.
  • 2005. New Star and Acyclic Coloring Algorithms.
  • 2000. Competing in computing.
  • 2000. Competing in computing.
Vitenskapelig oversiktsartikkel/review
  • 2005. What Color is Your Jacobian? Graph Coloring for Computing Derivatives. 629-705.

Se fullstendig oversikt over publikasjoner i CRIStin.