Vitenskapelig monografi

• Olav Lysne; Kristine Beitland; Kristian Gjøsteen et al. (2015). Digital sårbarhet – sikkert samfunn. (ekstern lenke)

Vitenskapelig bokkapittel

• Fredrik Manne; Mostofa Ali Md. Patwary (2022). Efficient Multi-core Algorithms for Computing Spanning Forests and Connected Components. (ekstern lenke)
• Mostofa Ali Md. Patwary; Nadathur Satish; Narayanan Sundaram et al. (2014). Pardicle: parallel approximate density-based clustering. (ekstern lenke)
• Fredrik Manne; Mahantesh Halappanavar (2014). New Effective Multithreaded Matching Algorithms. (ekstern lenke)
• Fredrik Manne; Mahantesh Halappanavar; Håkon Lerring et al. (2016). On Stable Marriages and Greedy Matchings. (ekstern lenke)
• Fredrik Manne; Mostofa Ali Md. Patwary; Rob Bisseling (2010). Parallel Greedy Graph Matching Using an Edge Partitioning Approach. (ekstern lenke)
• Fredrik Manne; Alexander Idelberger (2014). New Iterative Algorithms for Weighted Matching. (ekstern lenke)
• Fredrik Manne; Mostofa Ali Md. Patwary; Diana Palsetia et al. (2012). A new scalable parallel DBSCAN algorithm using the disjoint-set data structure. (ekstern lenke)
• Thorsen Alicia; Philip Merkey; Fredrik Manne (2009). Maximum weighted matching using the partitioned global address space model. (ekstern lenke)
• Mostofa Ali Md. Patwary; Diana Palsetia; Ankit Agrawal et al. (2013). Scalable parallel OPTICS data clustering using graph algorithmic techniques. (ekstern lenke)
• Fredrik Manne; Erik Boman (2005). Balanced greedy coloring of sparce random graphs. (ekstern lenke)
• Fredrik Manne; Qin Xin; Shuang Wang (2007). Faster Radio Broadcasting in Planar Graphs. (ekstern lenke)
• Md. Naim; Fredrik Manne; Mahantesh Halappanavar et al. (2015). Optimizing Approximate Weighted Matching on Nvidia Kepler K40. (ekstern lenke)

Vitenskapelig artikkel

• Fredrik Manne; Morten Mjelde; Laurence Pilard et al. (2008). A Self-stabilizing 2/3-Approximation Algorithm for the Maximum Matching. (ekstern lenke)
• Petter Erling Bjørstad; Fredrik Manne; Tor Sørevik et al. (1992). Efficient matrix multiplication on SIMD computers. (ekstern lenke)
• AH Gebremedhin; Fredrik Manne; T Woods (2006). Speeding up parallel graph coloring. (ekstern lenke)
• Johannes Langguth; Ariful Azad; Mahantesh Halappanavar et al. (2014). On parallel push-relabel based algorithms for bipartite maximum matching. (ekstern lenke)
• Kenneth Langedal; Johannes Langguth; Fredrik Manne et al. (2022). Efficient Minimum Weight Vertex Cover Heuristics Using Graph Neural Networks. (ekstern lenke)
• Lars Helge Stien; Kari Ruohonene; Antti Kause et al. (2006). Automated image analysis as a tool to quantify the colour and composition of rainbow trout (Oncorhynchus mykiss W.) cutlets. (ekstern lenke)
• Assefaw Hadish Gebremedhin; Fredrik Manne (2000). Scalable parallel graph coloring algorithms. (ekstern lenke)
• Johannes Langguth; Fredrik Manne; Peter Sanders (2010). Heuristic initialization for bipartite matching problems. (ekstern lenke)
• Doruk Bozdağ; Ümit V. Çatalyürek; Assefaw Hadish Gebremedhin et al. (2010). Distributed-memory parallel algorithms for distance-2 coloring and related problems in derivative computation. (ekstern lenke)
• Fredrik Manne; Morten Mjelde; Laurence Pilard et al. (2011). A self-stabilizing 2/3-approximation algorithm for the maximum matching problem. (ekstern lenke)
• Assefaw Hadish Gebremedhin; Arijit Tarafdar; Fredrik Manne et al. (2007). New acyclic and star coloring algorithms with application to computing hessians. (ekstern lenke)
• Petr Golovach; Pinar Heggernes; Pim van 't Hof et al. (2015). Modifying a graph using vertex elimination. (ekstern lenke)
• Alex Pothen; SM Ferdous; Fredrik Manne (2019). Approximation algorithms in combinatorial scientific computing. (ekstern lenke)
• Mahantesh Halappanavar; Alex Pothen; Ariful Azad et al. (2015). Codesign lessons learned from implementing graph matching on multithreaded architectures. (ekstern lenke)
• Lars Helge Stien; Anders Kiessling; Fredrik Manne (2007). Rapid estimation of fat content in salmon fillets by colour image analysis. (ekstern lenke)
• Mostofa Ali Md. Patwary; Nadathur Satish; Narayanan Sundaram et al. (2015). Pardicle: parallel approximate density-based clustering. (ekstern lenke)
• Bengt Aspvall; Magnus Hallsdorsson; Fredrik Manne (2001). Approximations for the Generalized Block Distribution of a Matrix. (ekstern lenke)
• Petr Golovach; Pinar Heggernes; Pim van 't Hof et al. (2012). How to Eliminate a Graph. (ekstern lenke)
• Fredrik Manne; Morten Mjelde; Laurence Pilard et al. (2009). A new self-stabilizing maximal matching algorithm. (ekstern lenke)
• Johannes Langguth; Mostofa Ali Md. Patwary; Fredrik Manne (2011). Parallel algorithms for bipartite matching problems on distributed memory computers. (ekstern lenke)
• Qin Xin; Fredrik Manne; Xiaolan Yao (2014). Latency-optimal communication in wireless mesh networks. (ekstern lenke)
• AH Gebremedhin; Fredrik Manne; A Pothen (2004). Parallel distance-k coloring algorithms for numerical optimization. (ekstern lenke)
• Fredrik Manne; Qin Xin (2008). Time Efficient Radio Broadcasting in Planar Graphs. (ekstern lenke)
• Fredrik Manne; Morten Mjelde (2007). A Self-stabilizing Weighted Matching Algorithm. (ekstern lenke)
• Fredrik Manne; Morten Mjelde; Laurence Pilard et al. (2007). A New Self-stabilizing Maximal Matching Algorithm. (ekstern lenke)
• Fredrik Manne; Erik Boman; Umit Catalyurek et al. (2005). A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers. (ekstern lenke)
• Fredrik Manne; Erik Boman; Assefaw Gebremedhin et al. (2005). A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers. (ekstern lenke)
• Ferdinando Cicalese; Fredrik Manne; Qin Xin (2009). Faster Deterministic Communication in Radio Networks. (ekstern lenke)
• Fredrik Manne; Qin Xin (2006). Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks. (ekstern lenke)
• Fredrik Manne; Qin Xin; Ferdinando Cicalese (2006). Faster Centralized Communication in Radio Networks. (ekstern lenke)
• Fredrik Manne; Morten Mjelde (2006). A Memory Efficient Self-stabilizing Algorithm for Maximal k-packing. (ekstern lenke)
• Mostofa Ali Md. Patwary; Fredrik Manne (2009). A Scalable Parallel Union-Find Algorithm for Distributed Memory Computers. (ekstern lenke)
• Mostofa Ali Md. Patwary; Jean Blair; Fredrik Manne (2010). Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure. (ekstern lenke)
• Kamer Kaya; Johannes Langguth; Fredrik Manne et al. (2013). Push-relabel based algorithms for the maximum transversal problem. (ekstern lenke)
• Jean Blair; Fredrik Manne (2012). An efficient self-stabilizing distance-2 coloring algorithm. (ekstern lenke)
• Qin Xin; Fredrik Manne; Yan Zhang et al. (2012). Almost optimal distributed M2M multicasting in wireless mesh networks. (ekstern lenke)
• Lars Helge Stien; Anders Kiessling; Fredrik Manne (2007). Rapid estimation of fat content in salmon fillets by colour image analysis. (ekstern lenke)
• Arif Khan; Alex Pothen; Mostofa Ali Md. Patwary et al. (2016). Efficient approximation algorithms for weighted b-matching. (ekstern lenke)
• Fredrik Manne; Jean R. S. Blair; Rodica Mihai (2010). Efficient Self-stabilizing Graph Searching in Tree Networks. (ekstern lenke)
• Fredrik Manne; Jean R. S. Blair (2010). An Efficient Self-stabilizing Distance-2 Coloring Algorithm. (ekstern lenke)
• Doruk Bozdag; Assefaw Hadish Gebremedhin; Fredrik Manne et al. (2008). A framework for scalable greedy coloring on distributed-memory parallel computers. (ekstern lenke)
• Petr Golovach; Pinar Heggernes; Pim van 't Hof et al. (2013). Modifying a Graph Using Vertex Elimination. (ekstern lenke)
• Jean R S Blair; Pinar Heggernes; Steve Horton et al. (2004). Broadcast Domination Algorithms for Interval Graphs, Series-Parallel Graphs, and Trees. (ekstern lenke)
• Fredrik Manne; Sadia Sharmin (2013). Efficient counting of maximal independent sets in sparse graphs. (ekstern lenke)
• Fredrik Manne; Peder Rindal Refsnes; Mostofa Ali Md. Patwary (2012). Multi-core Spanning Forest Algorithms using the Disjoint-set Data Structure. (ekstern lenke)

Vitenskapelig litteraturgjennomgang

• Fredrik Manne; Assefaw Gebremedhin; Alex Pothen (2005). What Color is Your Jacobian? Graph Coloring for Computing Derivatives. (ekstern lenke)

Konferanseforedrag

• Assefaw Gebremedhin; Fredrik Manne (1999). Parallel Graph Coloring Using OpenMP. (ekstern lenke)
• Fredrik Manne (2000). Competing in computing. (ekstern lenke)
• Fredrik Manne; Elias Dahlhaus; Mirka Miller et al. (2000). Algorithms for combinatorial problems related to train marshalling. (ekstern lenke)
• Fredrik Manne; Jean Blair (2003). Efficient Self-stabilizing algorithms for tree networks. (ekstern lenke)
• Fredrik Manne; Jean Blair (2003). Efficient self-stabilizing algorithms. (ekstern lenke)
• Fredrik Manne (1998). A parallel algorithm for computing the extremal eigenvalues of very large sparse matrices (Extended Abstract). (ekstern lenke)
• Fredrik Manne; Assefaw Hadish Gebremedhin; Alex Pothen (2003). Graph coloring in optimization, revisited. (ekstern lenke)
• Fredrik Manne (2000). Competing in computing. (ekstern lenke)
• Lars H. Stien; Fredrik Manne; Anders Kiessling et al. (2004). Anvendelse av bildeanalyse og andre ikke-destruktive målemetoder for kvalitetsvurdering av fisk. (ekstern lenke)
• Fredrik Manne; Elias Dahlhaus; Mirka Miller et al. (2000). Algorithms for combinatorial problems related to train marshalling. (ekstern lenke)
• Fredrik Manne (2004). Efficient Generic Multi-stage Self-stabilizing algorithms for trees. (ekstern lenke)
• Fredrik Manne (2004). Efficient multi-stage self-stabilizing algorithms for tree-networks. (ekstern lenke)
• Fredrik Manne (2004). Self stabilizing algorithms on tree networks. (ekstern lenke)
• Fredrik Manne (2004). Speeding up parallel graph coloring. (ekstern lenke)
• Jean R S Blair; Pinar Heggernes; Steve Horton et al. (2004). Broadcast Domination Algorithms for Interval Graphs, Series-Parallel Graphs, and Trees. (ekstern lenke)
• Jean Blair; Fredrik Manne (2002). Efficient Self-stabilizing Algorithms for Tree Networks. (ekstern lenke)
• Assefaw Hadish Gebremedhin; Fredrik Manne; Alex Pothen (2002). Parallel Distance-k Coloring Algorithms for Numerical Optimization. (ekstern lenke)
• Bengt Aspvall; Mágnus Halldórsson; Fredrik Manne (1998). Approximations for the generalized block distribution of a matrix. (ekstern lenke)
• Bengt Aspvall; Mágnus Halldórsson; Fredrik Manne (1997). Approximations for the General Block Distribution of a Matrix. (ekstern lenke)
• Fredrik Manne; Erik Boman (2005). Balanced greedy colorings of sparse random graphs. (ekstern lenke)
• Fredrik Manne; Alex Pothen; Assefaw Gebremedhin et al. (2005). Graph Coloring for Computing Derivatives: A Unifying Framework. (ekstern lenke)
• Fredrik Manne; Alex Pothen; Assefaw Gebremedhin (2005). A New Linear-Time Acyclic Coloring Algorithm. (ekstern lenke)
• Fredrik Manne (2005). Parallel Graph Coloring. (ekstern lenke)
• Fredrik Manne; Assefaw Hadish Gebremedhin; Alex Pothen (2002). Parallel Distance-k Coloring Algorithms for Numerical Optimization. (ekstern lenke)

Doktorgradsavhandling

• Fredrik Manne (1993). Load balancing in parallel sparse matrix computations. (ekstern lenke)
• Md. Naim; Fredrik Manne (2017). Parallel Matching and Clustering Algorithms on GPUs. (ekstern lenke)

Forskningsrapport

• Fredrik Manne; Tor Sørevik (1996). Partitioning an array onto a mesh of processors. (ekstern lenke)
• B. Olstad; Fredrik Manne (1993). Efficient sparce Cholesky factorization on a parallel SIMD computer. (ekstern lenke)
• Fredrik Manne (1992). An algorithm for computing an elimination tree of minimum height for a tree. (ekstern lenke)
• Fredrik Manne; Tor Sørevik (1992). Optimal partitioning of sequences. (ekstern lenke)
• Bengt Aspvall; Magnús M. Halldórsson; Fredrik Manne (1997). Approximations for the General Block Distribution of a Matrix. (ekstern lenke)
• Norvald Stohl; Torbjørn Strøm; Terje Fallmyr et al. (2002). Norsk Informatikkonferanse NIK'2002. (ekstern lenke)
• Fredrik Manne (1992). An algorithm for computing a minimum height elimination tree for a tree. (ekstern lenke)
• Petter Erling Bjørstad; Fredrik Manne; Tor Sørevik et al. (1991). Efficient matrix multiplication on SIMD computers. (ekstern lenke)
• Fredrik Manne (1991). Reducing the height of an elimination tree through local recordings. (ekstern lenke)
• Fredrik Manne (1999). Competing in Computing. (ekstern lenke)
• Fredrik Manne (1991). Reducing the Height of an Elimination Tree Through Local Recordings. (ekstern lenke)
• Petter Erling Bjørstad; Fredrik Manne; Tor Sørevik et al. (1991). Efficient Matrix Multiplication on SIMD Computers. (ekstern lenke)
• Fredrik Manne; Tor Sørevik (1992). Optimal partitioning of sequences. (ekstern lenke)
• Jean Blair; Pinar Heggernes; Steve Horton et al. (2003). Broadcast domination algorithms for interval graphs, series-parallel graphs and trees. (ekstern lenke)
• Gabriel Oksa; Martin Becka; Marian Vajtersic et al. (2002). SCALABLE PARALLEL ALGORITHM FOR MATRIX MULTIPLICATION BY GRAMIAN OF TOEPLITZ--BLOCK MATRIX. (ekstern lenke)
• Jean Blair; Fredrik Manne (2002). Efficient Self-stabilizing Algorithms for Tree Networks. (ekstern lenke)
• Norvald Stol; Torbjørn Strøm; Terje Fallmyr et al. (2002). Norsk Informatikkonferanse NIK'2002. (ekstern lenke)

Antologi

• Ellen Munthe-Kaas; Terje Fallmyr; Solveig Bjørnestad et al. (2000). Norsk Informatikkonferanse NIK'2000. (ekstern lenke)
• Jeremy Cook; Fredrik Manne; Tor Sørevik (1994). Parallab Progress Report 1994. (ekstern lenke)
• Terje Fallmyr; Said Hadjerrouit; Dag Langmyhr et al. (2003). Norsk Informatikkonferanse NIK'2003. (ekstern lenke)
• Fredrik Manne; Peter Sanders; Sivan Toledo (2018). Proceedings of the Eighth SIAM Workshop on Combinatorial Scientific Computing, CSC 2018, Bergen, Norway, June 6-8, 2018. (ekstern lenke)
• Fredrik Manne; Md. Naim (2018). Scalable b-Matching on GPUs. (ekstern lenke)
• Tor Sørevik; Fredrik Manne; Randi Moe et al. (2001). Applied Parallel Computing, New Paradigms for HPC in Industry and Academia. (ekstern lenke)

Konferanseposter

• Fredrik Manne (2000). Competing in computing. (ekstern lenke)
• Fredrik Manne (2000). Competing in computing. (ekstern lenke)
• Fredrik Manne; Assefaw Gebremedhin; Alex Pothen et al. (2005). New Star and Acyclic Coloring Algorithms. (ekstern lenke)
• Fredrik Manne; Morten Mjelde (2005). Self-stabilizing K-Packing and K-Domination on tree graphs. (ekstern lenke)

Fagbok

• Tor Sørevik; Fredrik Manne; Randi Moe et al. (2000). Applied Parallel Computing, Procedings of the 5th International Workshop, PARA2000. (ekstern lenke)
• Tor Sørevik; Fredrik Manne; Randi Moe et al. (2000). Applied Parallel Computing, Procedings of the 5th International Workshop, PARA2000. (ekstern lenke)
• Norvald Stol; Yu Weihai; Solveig Bjørnestad et al. (2001). Norsk Informatikkonferanse, NIK'2001. (ekstern lenke)

Fremhevet artikkel i media

• Fredrik Manne (2012). Raskere, sterkere, høyere!. (ekstern lenke)

Se en fullstendig oversikt over publikasjoner i NVA.