Who am I?
I am a CNRS researcher (CRCN) working at LIP, ENS de Lyon, in the ROMA team. Previously, I was a post-doctoral researcher at the Parallel Algorithms Project, CERFACS, Toulouse, France. Before that, I was at the Department of Mathematics and Computer Science, Emory University, Atlanta, GA, USA. I have received BSc (1997), MSc (1999), and PhD degrees (2005) from the Department of Computer Engineering, Bilkent University, Ankara, Turkey, and HDR (2019) from ENS de Lyon.
Blog | Google Scholar | Papers at HAL | | ORCID | DBLP
News and favorites
- 1st ACDA workshop in Aussois is under planning.
- Updated code: Hashing for hyperedge queries (April 2022, originally Feb 2021). See also the updated technical report.
- New paper: Parallel hashing for hypergraphs (local copy), with Somesh Singh (March 2022).
- Updated code MatchMaker comes with a julia interface (mmaker.jl). (Feb 2022).
- Proudly serving in the 2022 IEEE TCPP Outstanding Service and Contributions Award Committee.
- (For convenient access) My schedule for the Comité de suivi individuel of the PhD students at LIP.
- Software is our heritage:
Started saving...
- New project: A project proposal, jointly with Christian Schulz of Heidelberg University, has been accepted for funding within the PHC Procope Programme and starts on Jan 2022.
- Service recognition: Proud to have received IEEE TPDS Award for Editorial Excellence 2021
- Somesh Singh collaborates with the PeachTree project.
- Service Serving as the co-chair, with Russ Harmer, of the thesis committee of LIP
- Service Serving as the secretary of SIAM Activity Group on Applied and Computational Discrete Algorithms (ACDA).
- Filip Pawłowski graduated and is now a post-doc at Huawei Zürich Research Center (Dec 2020).
- Ioannis Panagiotas is now a post-doc at LIP6, Sorbonne University (November 2020).
- Filip Pawłowski has received an innovation award at the MIT/Amazon/IEEE Graph Challenge for his paper (local copy). (August 2020).
- PIKS project has started (Feb 2020).
- PeachTree project has started (Feb 2020).
- New code: Karp--Sipser-based heuristics for matchings in hypergraphs (May 2020).
- New code: Fast almost optimal algorithms for bipartite matching (Feb 2020, updates April 2020).
- Ioannis Panagiotas has received a best paper award at SEA^2 for his paper. A local copy is here.
- A SIAM News article on discrete algorithms and combinatorial analysis presented at SIAM CSE'19.
- Check out SIAM Activity Group on Applied and Computational Discrete Algorithms (ACDA). Students can join for free!
- Check out IEEE Computer Society Technical Committee on Parallel Processing (TCPP): an international forum to promote parallel processing research and education, and participates in setting up technical standards in this area. Join for free!
- CSC Research Blog: Updates, news, and everything about research on Combinatorial Scientific Computing.
- Parallel Computing (an international journal): Acting as a subject area editor.
- SIAM Journal on Matrix Analysis and Applications: Acting as an associate editor. A recent update of the editorial policy of SIMAX calls for papers with applications in graph theory and data science.
- SIAM Journal on Scientific Computing (SISC): Acting as an associate editor.
- IEEE Transactions on Parallel and Distributed Systems (TPDS) : Acting as an associate editor.
- Slides from Tensor Decompositions: Applications and Efficient Algorithms minisymposium which took place within SIAM CSE17.
- Slides from CSC minimyposia which took place within SIAM PP'16.
- Slides from Parallel tensor computations minimyposium which took place within SIAM PP'16.
- Slides from Sparse matrix and tensor computations at Parallel Matrix Algorithms and Applications (PMAA16) that took place in Bordeaux, July 6--8, 2016.
- Check out the SIAM Activity Group on Supercomputing (SIAG/SC), become a member, get informed, and receive additional discounts at SIAM Parallel Processing Conferences.