François Pellegrini - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 19 from 19

2023

Path Length-Driven Hypergraph Partitioning: An Integer Programming ApproachJulien Rodriguez, François Galea, François Pellegrini, Lilia Zaourar. FedCSIS 2023: 1119-1123 [doi]

A Hypergraph Model and Associated Optimization Strategies for Path Length-Driven Netlist PartitioningJulien Rodriguez, François Galea, François Pellegrini, Lilia Zaourar. iccs 2023: 652-660 [doi]

2018

Multi-criteria Graph Partitioning with ScotchRémi Barat, Cédric Chevalier, François Pellegrini. siamcsc 2018: 66-75 [doi]

2009

Contributions au partitionnement de graphes parallèle multi-niveaux (Contributions to parallel multilevel graph partitioning)François Pellegrini. 2009. [doi]

Distillating knowledge about SCOTCHFrançois Pellegrini. Dagstuhl 2009: [doi]

2008

PT-ScotchCédric Chevalier, François Pellegrini. pc, 34(6-8):318-331, 2008. [doi]

2007

A Parallelisable Multi-level Banded Diffusion Scheme for Computing Balanced Partitions with Smooth BoundariesFrançois Pellegrini. europar 2007: 195-204 [doi]

2006

Improvement of the Efficiency of Genetic Algorithms for Scalable Parallel Graph Partitioning in a Multi-level FrameworkCédric Chevalier, François Pellegrini. europar 2006: 243-252 [doi]

2004

Applying Parallel Direct Solver Techniques to Build Robust High Performance PreconditionersPascal Hénon, François Pellegrini, Pierre Ramet, Jean Roman, Yousef Saad. para 2006: 611-619 [doi]

2000

Parallel sparse linear algebra and application to structural mechanicsDavid Goudin, Pascal Hénon, François Pellegrini, Pierre Ramet, Jean Roman, Jean-Jacques Pesqué. na, 24(4):371-391, 2000. [doi]

Hybridizing Nested Dissection and Halo Approximate Minimum Degree for Efficient Sparse Matrix OrderingFrançois Pellegrini, Jean Roman, Patrick Amestoy. concurrency, 12(2-3):69-84, 2000.

1999

Hybridizing Nested Dissection and Halo Approximate Minimum Degree for Efficient Sparse Matrix OrderingFrançois Pellegrini, Jean Roman, Patrick Amestoy. ipps 1999: 986-995

1997

Unstructured Grapg Partitioning for Sparse Linear System SolvingJean Michel, François Pellegrini, Jean Roman. irregular 1997: 273-286

Graph Partitioning Based Methods and Tools for Scientific ComputingFrançois Pellegrini. pc, 23(1-2):153-164, 1997.

Sparse Matrix Ordering with SCOTCHFrançois Pellegrini, Jean Roman. hpcn 1997: 370-378

1996

SCOTCH: A Software Package for Static Mapping by Dual Recursive Bipartitioning of Process and Architecture GraphsFrançois Pellegrini, Jean Roman. hpcn 1996: 493-498

1995

On Bandwidth, Cutwidth, and Quotient GraphsDominique Barth, François Pellegrini, André Raspaud, Jean Roman. ita, 29(6):487-508, 1995.

1993

Bounds for the Bandwidth of the d-Ary de Bruijn GraphFrançois Pellegrini. ppl, 3:431-443, 1993.

Sign in or sign up to see more results.

runs on WebDSL