Bora Uçar
- Optimisation des ressources : modèles, algorithmes et ordonnancement (ROMA)
- Centre National de la Recherche Scientifique (CNRS)
- Laboratoire de l'Informatique du Parallélisme (LIP)
Publications
Publications
|
|
Exact Minimum Cuts in Hypergraphs at ScaleSIAM Symposium on Algorithm Engineering and Experiments (ALENEX26), SIAM, Jan 2026, Vancouver, Canada |
|
|
Efficient and effective methods for variant selection16th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics (BCB 2025), Oct 2025, Philadelphie, PA, United States |
|
|
Semi-Streaming Algorithms for Hypergraph MatchingESA 2025 - European Symposium on Algorithms, European Association for Theoretical Computer Science (EATCS), Sep 2025, Warsaw (POLAND), Poland |
|
|
Orthogonal matching pursuit-based algorithms for the Birkhoff-von Neumann decompositionEUSIPCO 2024 - 24th European Signal Processing Conference, Aug 2024, Lyon, France. pp.12 |
|
|
Engineering Edge Orientation AlgorithmsESA 2024 - 32nd Annual European Symposium on Algorithms, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Sep 2024, Egham, United Kingdom. pp.1-21, ⟨10.4230/LIPIcs.ESA.2024.97⟩ |
|
|
Engineering fast algorithms for the bottleneck matching problemESA 2023 - The 31st Annual European Symposium on Algorithms, Sep 2023, Amsterdam (Hollande), Netherlands |
|
|
An Efficient Parallel Implementation of a Perfect Hashing Method for HypergraphsGrAPL 2022 - Workshop on Graphs, Architectures, Programming, and Learning, IEEE, May 2022, Lyon, France. pp.265--274 |
|
|
Shared-memory implementation of the Karp-Sipser kernelization processHiPC 2021 - 28th edition of the IEEE International Conference on High Performance Computing, Data, and Analytics, Dec 2021, Bangalore, India. pp.71-80, ⟨10.1109/HiPC53243.2021.00021⟩ |
|
|
Fully-dynamic Weighted Matching Approximation in PracticeACDA 2021 - SIAM Conference on Applied and Computational Discrete Algorithms, SIAM, Jul 2021, Virtual, France. ⟨10.1137/1.9781611976830.4⟩ |
|
|
Streaming Hypergraph Partitioning Algorithms on Limited Memory EnvironmentsHPCS 2020 - International Conference on High Performance Computing & Simulation, Mar 2021, Virtual online, Spain. pp.1-8 |
|
|
Karp-Sipser based kernels for bipartite graph matchingALENEX20 - SIAM Symposium on Algorithm Engineering and Experiments, Jan 2020, Salt Lake City, Utah, United States. pp.1-12 |
|
|
Combinatorial Tiling for Sparse Neural Networks2020 IEEE High Performance Extreme Computing (virtual conference), Sep 2020, Waltham, MA, United States |
|
|
Engineering fast almost optimal algorithms for bipartite graph matchingESA 2020 - European Symposium on Algorithms, Sep 2020, Pisa, Italy |
|
|
Matrix symmetrization and sparse direct solversCSC 2020 - SIAM Workshop on Combinatorial Scientific Computing, Feb 2020, Seattle, United States. pp.1-10 |
|
|
Efficient and effective sparse tensor reorderingICS 2019 - ACM International Conference on Supercomputing, Jun 2019, Phoenix, United States. pp.227-237, ⟨10.1145/3330345.3330366⟩ |
|
|
High performance tensor-vector multiplication on shared-memory systemsPPAM 2019 - 13th International Conference on Parallel Processing and Applied Mathematics, Sep 2019, Bialystok, Poland. pp.1-11 |
|
|
Effective heuristics for matchings in hypergraphsSEA2 2019 - International Symposium on Experimental Algorithms - Special Event, Jun 2019, Kalamata, Greece. pp.248-264, ⟨10.1007/978-3-030-34029-2_17⟩ |
|
|
A scalable clustering-based task scheduler for homogeneous processors using DAG partitioningIPDPS 2019 - 33rd IEEE International Parallel & Distributed Processing Symposium, May 2019, Rio de Janeiro, Brazil. pp.155-165, ⟨10.1109/IPDPS.2019.00026⟩ |
|
|
Approximation algorithms for maximum matchings in undirected graphsCSC 2018 - SIAM Workshop on Combinatorial Scientific Computing, Jun 2018, Bergen, Norway. pp.56-65, ⟨10.1137/1.9781611975215.6⟩ |
|
|
SINA: A Scalable Iterative Network Aligner2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), Aug 2018, Barcelona, Spain |
|
|
Acyclic Partitioning of Large Directed Acyclic GraphsCCGRID 2017 - 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, May 2017, Madrid, Spain. pp.371-380, ⟨10.1109/CCGRID.2017.101⟩ |
|
|
High Performance Parallel Algorithms for the Tucker Decomposition of Sparse TensorsICPP 2016 - International Conference on Parallel Processing, Aug 2016, Philadelphia, United States |
|
|
Fast and high quality topology-aware task mapping29th IEEE International Parallel & Distributed Processing Symposium, May 2015, Hyderabad, India |
|
|
Semi-two-dimensional partitioning for parallel sparse matrix-vector multiplicationPCO2015 (IPDPSW), May 2015, Hyderabad, India. pp.1125--1134 |
|
|
Load-Balanced Local Time Stepping for Large-Scale Wave Propagation29th IEEE International Parallel & Distributed Processing Symposium, May 2015, Hyderabad, India. pp.925--935 |
|
|
Combining backward and forward recovery to cope with silent errors in iterative solversPDSEC2015, May 2015, Hyderabad, India. pp.980--989 |
|
|
Scalable sparse tensor decompositions in distributed memory systemsInternational Conference for High Performance Computing, Networking, Storage and Analysis (SC15), Nov 2015, Austin, TX, United States. ⟨10.1145/2807591.2807624⟩ |
|
|
Bipartite Matching Heuristics with Quality Guarantees on Shared Memory Parallel Computers28th IEEE International Parallel & Distributed Processing Symposium (IPDPS), May 2014, Phoenix, Arizona, United States. ⟨10.1109/IPDPS.2014.63⟩ |
|
|
On Partitioning Two Dimensional Finite Difference Meshes for Distributed Memory Parallel Computers22nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP 2014), Feb 2014, Turin, Italy. pp.9 - 16, ⟨10.1109/PDP.2014.10⟩ |
|
|
Analysis of Partitioning Models and Metrics in Parallel Sparse Matrix-Vector Multiplication10th PPAM - Parallel Processing and Applied Mathematics, Sep 2013, Varsovie, Poland. pp.174--184, ⟨10.1007/978-3-642-55195-6_16⟩ |
|
|
Reducing elimination tree height for parallel LU factorization of sparse unsymmetric matricesHiPC 2014, Dec 2014, Goa, India. pp.1--10 |
|
|
On Partitioning and Reordering Problems in a Hierarchically Parallel Hybrid Linear Solver2013 IEEE 27th International Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), IEEE, May 2013, Cambridge, MA, United States |
|
|
GPU accelerated maximum cardinality matching algorithms for bipartite graphsEuro-Par 2013, Aug 2013, Aachen, Germany. pp.850-861, ⟨10.1007/978-3-642-40047-6_84⟩ |
|
|
A Push-Relabel-Based Maximum Cardinality Bipartite Matching Algorithm on GPUs42nd International Conference on Parallel Processing, Oct 2013, Lyon, France. pp.21 - 29, ⟨10.1109/ICPP.2013.11⟩ |
|
|
Semi-matching algorithms for scheduling parallel tasks under resource constraintsIEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum, May 2013, Cambridge, MA, United States. pp.1744-1753, ⟨10.1109/IPDPSW.2013.30⟩ |
|
|
Multithreaded clustering for multi-level hypergraph partitioning26th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2012,, May 2012, Shanghai, China. pp.848--859, ⟨10.1109/IPDPS.2012.81⟩ |
|
|
On optimal and balanced sparse matrix partitioning problems2012 IEEE International Conference on Cluster Computing, Sep 2012, Beijing, China. pp.257--265, ⟨10.1109/CLUSTER.2012.77⟩ |
Partitioning problems on trees and simple meshesSIAM Conference on Parallel Processing for Scientific Computing, Feb 2012, Savannah, GA, United States |
|
|
|
On shared-memory parallelization of a sparse matrix scaling algorithm2012 41st International Conference on Parallel Processing, Sep 2012, Pittsburgh, PA, United States. pp.68--77 |
On partitioning problems with complex objectivesParallel Processing Workshops (Euro-Par 2011), Aug 2011, Bordeaux, France. pp.334-344, ⟨10.1007/978-3-642-29737-3_38⟩ |
|
|
|
Integrated data placement and task assignment for scientific workflows in cloudsProceedings of the fourth international workshop on Data-intensive distributed computing, Jun 2011, New York, NY, USA, United States. pp.45--54, ⟨10.1145/1996014.1996022⟩ |
On optimal tree traversals for sparse matrix factorizationIPDPS'2011, the 25th IEEE International Parallel and Distributed Processing Symposium, 2011, Unknown |
|
|
|
A Novel Aggregation Method based on Graph Matching for Algebraic MultiGrid Preconditioning of Sparse Linear SystemsInternational Conference On Preconditioning Techniques For Scientific And Industrial Applications (PRECONDITIONING 2011), INRIA Bordeaux Sud-Ouest; ENSEIRB; University of Bordeaux 1, May 2011, Bordeaux, France |
Partitioning regular meshes for minimizing the total communication volumeSIAM Conference on Parallel Processing for Scientific Computing (PP10), Feb 2010, Seattle, WA, United States |
|
|
|
On the scalability of hypergraph models for sparse matrix partitioning18th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP 2010), IEEE, Feb 2010, Pisa, Italy. pp.593-600, ⟨10.1109/PDP.2010.92⟩ |
Out-of-core solution for singleton right hand-side vectorsDagstuhl Seminar on Combinatorial Scientific Computing, Feb 2009, Saarbrucken, Germany |
|
Out-of-core solution for singleton rhs vectorsSIAM Conference on Computational Science and Engineering (CSE09), Mar 2009, Miami, FL, United States |
|
Towards parallel bipartite matching algorithmsScheduling for large-scale systems, May 2009, Knoxville, TN, United States |
|
Partitioning sparse matricesSIAM Conference on Computational Science and Engineering (CSE09), Mar 2009, Miami, FL, United States |
|
|
|
Heuristics for a matrix symmetrization problemProceedings of Parallel Processing and Applied Mathematics (PPAM'07), 2008, Gdansk, Poland. pp.718--727 |
|
|
A Parallel Matrix Scaling AlgorithmHigh Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Jun 2008, Toulouse, France. pp.301--313 |
|
|
Product preconditioning for Markov chain problemsProceedings of the 2006 Markov Anniversary Meeting, 2006, Charleston, SC, United States. pp.239--256 |
A Message Ordering Problem in Parallel ProgramsRecent Advances in Parallel Virtual Machine and Message Passing Interface, 2004, Unknown, pp.232--256 |
|
Minimizing Communication Cost in Fine-Grain Partitioning of Sparse MatricesComputer and Information Sciences - ISCIS 2003, 2003, Unknown, pp.926--933 |
|
|
Optimal partitioning of 2D meshes for stencil computationsRR-9585, Inria Lyon. 2025 |
|
|
SUperman: Efficient Permanent Computation on GPUsRR-9578, Inria Lyon. 2025, pp.1-29 |
|
|
Efficient parallel sparse tensor contractionRR-9551, Inria Lyon. 2024 |
|
|
Connectivity of a random directed graph modelRR-9540, Inria Lyon. 2024 |
|
|
Algorithms and data structures for hyperedge queries[Research Report] RR-9390, Inria Grenoble Rhône-Alpes. 2022, pp.28 |
|
|
High performance tensor-vector multiplies on shared memory systems[Research Report] RR-9274, Inria - Research Centre Grenoble – Rhône-Alpes. 2019, pp.1-20 |
|
|
Acyclic partitioning of large directed acyclic graphs[Research Report] RR-9163, Inria - Research Centre Grenoble – Rhône-Alpes. 2018 |
|
|
A scalable clustering-based task scheduler for homogeneous processors using DAG partitioning[Research Report] RR-9185, Inria Grenoble Rhône-Alpes. 2018, pp.1-34 |
|
|
Effective heuristics for matchings in hypergraphs[Research Report] RR-9224, Inria Grenoble Rhône-Alpes. 2018, pp.1-20 |
|
|
Computing Dense Tensor Decompositions with Optimal Dimension Trees[Research Report] RR-9080, Inria. 2017 |
|
|
Scheduling Series-Parallel Task Graphs to Minimize Peak Memory[Research Report] RR-8975, Inria Grenoble Rhône-Alpes, Université de Grenoble. 2016 |
|
|
On matrix symmetrization and sparse direct solvers[Research Report] RR-8977, Inria - Research Centre Grenoble – Rhône-Alpes. 2016, pp.1-31 |
|
|
Coping with silent errors in HPC applications[Research Report] RR-8825, CNRS, ENS Lyon & INRIA. 2015 |
|
|
Combining algorithm-based fault tolerance and checkpointing for iterative solvers[Research Report] RR-8675, INRIA Grenoble - Rhône-Alpes; INRIA. 2015 |
|
|
A Backward/Forward Recovery Approach for the Preconditioned Conjugate Gradient Algorithm[Research Report] RR-8826, ENS Lyon, CNRS & INRIA. 2015 |
|
|
High-performance parallel algorithms for the Tucker decomposition of higher order sparse tensors[Research Report] RR-8801, Inria - Research Centre Grenoble – Rhône-Alpes. 2015 |
|
|
Fill-in reduction in sparse matrix factorizations using hypergraphs[Research Report] RR-8448, INRIA. 2014 |
|
|
On the minimum edge cover and vertex partition by quasi-cliques problems[Research Report] RR-8255, INRIA. 2013 |
|
|
On analysis of partitioning models and metrics in parallel sparse matrix-vector multiplication[Research Report] RR-8301, INRIA. 2013, pp.25 |
|
|
Bipartite matching heuristics with quality guarantees on shared memory parallel computers[Research Report] Inria; laas. 2013, pp.28 |
|
|
Investigations on push-relabel based algorithms for the maximum transversal problem[Research Report] RR-8093, INRIA. 2012, pp.27 |
|
|
Partitioning, Ordering, and Load Balancing in a Hierarchically Parallel Hybrid Linear Solver[Research Report] 2011, pp.22 |
Experiments on push-relabel-based maximum cardinality matching algorithms for bipartite graphs[Research Report] TR/PA/11/33, 2011 |
|
|
|
On partitioning problems with complex objectives[Research Report] RR-7546, INRIA. 2011 |
|
|
Open Problems in (Hyper)Graph Decomposition2023 |
|
|
On optimal tree traversals for sparse matrix factorization2013 |
|
|
Combinatorial problems in solving linear systems2011 |
|
|
2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific ComputingAssefaw Gebremedhin; Erik Boman; Bora Uçar. Seventh SIAM Workshop on Combinatorial Scientific Computing, Oct 2016, Albuquerque, United States. 2016, eISBN: 978-1-61197-469-0. ⟨10.1137/1.9781611974690⟩ |
|
|
Trends in Combinatorial Analysis: Complex Data, Machine Learning, and High-Performance Computing2019, pp.1-3 |
|
|
Disrupting algorithms and software: Dispatch from IPDPS 20182018, pp.3--4. ⟨10.1145/3329082.3329086⟩ |
SIAM’s CSC Workshop Series Marks 10th Year2014 |
|
Overview of MUMPS (A multifrontal Massively Parallel Solver)2008 |
|
|
Partitioning, matching, and ordering: Combinatorial scientific computing with matrices and tensorsComputer Science [cs]. ENS de Lyon, 2019 |