Bora Uçar

Orcid: 0000-0002-4960-3545

Affiliations:
  • ENS Lyon, France


According to our database1, Bora Uçar authored at least 87 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Engineering Edge Orientation Algorithms.
CoRR, 2024

2023
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331).
Dagstuhl Reports, 2023

Open Problems in (Hyper)Graph Decomposition.
CoRR, 2023

Engineering Fast Algorithms for the Bottleneck Matching Problem.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
Algorithms and Data Structures for Hyperedge Queries.
ACM J. Exp. Algorithmics, 2022

Scaling matrices and counting the perfect matchings in graphs.
Discret. Appl. Math., 2022

An Efficient Parallel Implementation of a Perfect Hashing Method for Hypergraphs.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2022

2021
Streaming Hypergraph Partitioning Algorithms on Limited Memory Environments.
CoRR, 2021

Shared-memory implementation of the Karp-Sipser kernelization process.
Proceedings of the 28th IEEE International Conference on High Performance Computing, 2021

Fully-dynamic Weighted Matching Approximation in Practice.
Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, 2021

2020
Programming Strategies for Irregular Algorithms on the Emu Chick.
ACM Trans. Parallel Comput., 2020

Matrix symmetrization and sparse direct solvers.
Proceedings of the SIAM Workshop on Combinatorial Scientific Computing, 2020

Combinatorial Tiling for Sparse Neural Networks.
Proceedings of the 2020 IEEE High Performance Extreme Computing Conference, 2020

Engineering Fast Almost Optimal Algorithms for Bipartite Graph Matching.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Karp-Sipser based kernels for bipartite graph matching.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019
Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs.
SIAM J. Sci. Comput., 2019

A multi-dimensional Morton-ordered block storage for mode-oblivious tensor computations.
J. Comput. Sci., 2019

Effective Heuristics for Matchings in Hypergraphs.
Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

High Performance Tensor-Vector Multiplication on Shared-Memory Systems.
Proceedings of the Parallel Processing and Applied Mathematics, 2019

A Scalable Clustering-Based Task Scheduler for Homogeneous Processors Using DAG Partitioning.
Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

Efficient and effective sparse tensor reordering.
Proceedings of the ACM International Conference on Supercomputing, 2019

Partitioning, matching, and ordering: Combinatorial scientific computing with matrices and tensors. (Partitionnement, couplage et permutation: Calcul scientifique combinatoire sur des matrices et des tenseurs).
, 2019

2018
Scheduling series-parallel task graphs to minimize peak memory.
Theor. Comput. Sci., 2018

1.5D Parallel Sparse Matrix-Vector Multiply.
SIAM J. Sci. Comput., 2018

Parallel Candecomp/Parafac Decomposition of Sparse Tensors Using Dimension Trees.
SIAM J. Sci. Comput., 2018

Approximation algorithms for maximum matchings in undirected graphs.
Proceedings of the Eighth SIAM Workshop on Combinatorial Scientific Computing, 2018

SiNA: A Scalable Iterative Network Aligner.
Proceedings of the IEEE/ACM 2018 International Conference on Advances in Social Networks Analysis and Mining, 2018

2017
Preconditioning Techniques Based on the Birkhoff-von Neumann Decomposition.
Comput. Methods Appl. Math., 2017

Acyclic Partitioning of Large Directed Acyclic Graphs.
Proceedings of the 17th IEEE/ACM International Symposium on Cluster, 2017

2016
A backward/forward recovery approach for the preconditioned conjugate gradient method.
J. Comput. Sci., 2016

High Performance Parallel Algorithms for the Tucker Decomposition of Sparse Tensors.
Proceedings of the 45th International Conference on Parallel Processing, 2016

2015
Two approximation algorithms for bipartite matching on multicore architectures.
J. Parallel Distributed Comput., 2015

Hypergraph partitioning for multiple communication cost metrics: Model and methods.
J. Parallel Distributed Comput., 2015

Comments on the hierarchically structured bin packing problem.
Inf. Process. Lett., 2015

Scalable sparse tensor decompositions in distributed memory systems.
Proceedings of the International Conference for High Performance Computing, 2015

Load-Balanced Local Time Stepping for Large-Scale Wave Propagation.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

Semi-two-dimensional Partitioning for Parallel Sparse Matrix-Vector Multiplication.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium Workshop, 2015

Combining Backward and Forward Recovery to Cope with Silent Errors in Iterative Solvers.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium Workshop, 2015

Fast and High Quality Topology-Aware Task Mapping.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

PCO Introduction and Committees.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium Workshop, 2015

2014
A Symmetry Preserving Algorithm for Matrix Scaling.
SIAM J. Matrix Anal. Appl., 2014

On Partitioning Two Dimensional Finite Difference Meshes for Distributed Memory Parallel Computers.
Proceedings of the 22nd Euromicro International Conference on Parallel, 2014

Bipartite Matching Heuristics with Quality Guarantees on Shared Memory Parallel Computers.
Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014

Reducing elimination tree height for parallel LU factorization of sparse unsymmetric matrices.
Proceedings of the 21st International Conference on High Performance Computing, 2014

Scheduling for Large-Scale Systems.
Proceedings of the Computing Handbook, 2014

2013
Constructing Elimination Trees for Sparse Unsymmetric Matrices.
SIAM J. Matrix Anal. Appl., 2013

Direct methods for sparse matrix solution.
Scholarpedia, 2013

Push-relabel based algorithms for the maximum transversal problem.
Comput. Oper. Res., 2013

Analysis of Partitioning Models and Metrics in Parallel Sparse Matrix-Vector Multiplication.
Proceedings of the Parallel Processing and Applied Mathematics, 2013

On Partitioning and Reordering Problems in a Hierarchically Parallel Hybrid Linear Solver.
Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

Semi-Matching Algorithms for Scheduling Parallel Tasks under Resource Constraints.
Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

A Push-Relabel-Based Maximum Cardinality Bipartite Matching Algorithm on GPUs.
Proceedings of the 42nd International Conference on Parallel Processing, 2013

GPU Accelerated Maximum Cardinality Matching Algorithms for Bipartite Graphs.
Proceedings of the Euro-Par 2013 Parallel Processing, 2013

2012
On Computing Inverse Entries of a Sparse Matrix in an Out-of-Core Environment.
SIAM J. Sci. Comput., 2012

Multithreaded Clustering for Multi-level Hypergraph Partitioning.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012

On Shared-Memory Parallelization of a Sparse Matrix Scaling Algorithm.
Proceedings of the 41st International Conference on Parallel Processing, 2012

Topic 10: Parallel Numerical Algorithms.
Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

A partitioning-based divisive clustering technique for maximizing the modularity.
Proceedings of the Graph Partitioning and Graph Clustering, 2012

UMPa: A multi-objective, multi-level partitioner for communication minimization.
Proceedings of the Graph Partitioning and Graph Clustering, 2012

On Optimal and Balanced Sparse Matrix Partitioning Problems.
Proceedings of the 2012 IEEE International Conference on Cluster Computing, 2012

2011
Hypergraph Partitioning.
Proceedings of the Encyclopedia of Parallel Computing, 2011

Mumps.
Proceedings of the Encyclopedia of Parallel Computing, 2011

Multifrontal Method.
Proceedings of the Encyclopedia of Parallel Computing, 2011

Parallel Frequent Item Set Mining with Selective Item Replication.
IEEE Trans. Parallel Distributed Syst., 2011

Design, implementation, and analysis of maximum transversal algorithms.
ACM Trans. Math. Softw., 2011

On Optimal Tree Traversals for Sparse Matrix Factorization.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Integrated data placement and task assignment for scientific workflows in clouds.
Proceedings of the DIDC'11, 2011

On the Use of Cluster-Based Partial Message Logging to Improve Fault Tolerance for MPI HPC Applications.
Proceedings of the Euro-Par 2011 Parallel Processing - 17th International Conference, 2011

On Partitioning Problems with Complex Objectives.
Proceedings of the Euro-Par 2011: Parallel Processing Workshops - CCPI, CGWS, HeteroPar, HiBB, HPCVirt, HPPC, HPSS, MDGS, ProPer, Resilience, UCHPC, VHPC, Bordeaux, France, August 29, 2011

2010
On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe.
SIAM J. Sci. Comput., 2010

On the Block Triangular Form of Symmetric Matrices.
SIAM Rev., 2010

A Matrix Partitioning Interface to PaToH in MATLAB.
Parallel Comput., 2010

On the Scalability of Hypergraph Models for Sparse Matrix Partitioning.
Proceedings of the 18th Euromicro Conference on Parallel, 2010

2009
Exact Algorithms for a Task Assignment Problem.
Parallel Process. Lett., 2009

Combinatorial problems in solving linear systems.
Proceedings of the Combinatorial Scientific Computing, 01.02. - 06.02.2009, 2009

2008
Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices.
J. Parallel Distributed Comput., 2008

A Parallel Matrix Scaling Algorithm.
Proceedings of the High Performance Computing for Computational Science, 2008

2007
Partitioning Sparse Matrices for Parallel Preconditioned Iterative Methods.
SIAM J. Sci. Comput., 2007

Revisiting Hypergraph Models for Sparse Matrix Partitioning.
SIAM Rev., 2007

Parallel image restoration using surrogate constraint methods.
J. Parallel Distributed Comput., 2007

Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories.
J. Parallel Distributed Comput., 2007

Heuristics for a Matrix Symmetrization Problem.
Proceedings of the Parallel Processing and Applied Mathematics, 2007

2006
Task assignment in heterogeneous computing systems.
J. Parallel Distributed Comput., 2006

2005
Parallel sparse matrix-vector multiplies and iterative solvers (Paralel seyrek matris-vektör çarpımı ve dolaylı yöntemler)
PhD thesis, 2005

2004
Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies.
SIAM J. Sci. Comput., 2004

A Message Ordering Problem in Parallel Programs.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2004

2003
Minimizing Communication Cost in Fine-Grain Partitioning of Sparse Matrices.
Proceedings of the Computer and Information Sciences, 2003


  Loading...