Daniel Lemire is a computer science professor at the Université du Québec (TELUQ). He has also been a research officer at the National Research Council of Canada and an entrepreneur. He has written over 75 peer-reviewed publications, including more than 45 journal articles. He has held competitive research grants for the last 20 years. He serves on the program committees of leading computer science conferences (e.g., ACM CIKM, WWW, ACM WSDM, ACM SIGIR, ACM RecSys). His software is used by major corporations like Google and Facebook. During the 2016-2017 NSERC Discovery Grant competition, he received a rating of outstanding for the excellence of the researcher. In 2020, Daniel Lemire was co-chair of the NSERC computer science committee. He received the University of Quebec’s 2020 Award of Excellence for Achievement in Research (all fields) for his work on the acceleration of JSON parsing.

He programs in C, C++, Java, JavaScript, Python, Swift and Go. He works primarily in an open-source setting. You can find his software in Git, Apache Hive, Druid, Apache Kylin, Netflix Atlas, LinkedIn Pinot, Microsoft Visual Studio Team Services and so forth. Some of his compression software is used by Apache Arrow, Apache Kudu and Apache Impala. In 2012, he was rewarded by the Google Open Source Peer Bonus Program. In February 2019, he was ranked in second position among the most popular developers on GitHub and most popular in C++ (ahead of Microsoft, Google and Facebook); GitHub has 28 million developers.

He is a long-time social media user: his blog has thousands of readers and was featured on Slashdot, Reddit and Hacker News. He was one of the first Twitter users: @lemire.

He is an adjunct professor at UQAM within the computer science department where he is a member of the LATECE laboratory. He is also an adjunct professor at the University of New Brunswick within the computer science department.

He organizes regular talks open to the public in Montreal (typically in French): tribalab and technolab. He is department chair.

We offer scholarships for graduate studies in software performance for data engineering (in French).

I take the production of software seriously. You can find most of my software on GitHub.

Some noteworthy contributions:

• simdjson: the first JSON parser to run at speeds of gigabytes per second with full validation using a single core on a commodity processor.
• Roaring bitmaps have been widely adopted: Google Procella (YouTube’s database engine), Apache Lucene, Solr, Elasticsearch, Metamarkets’ Druid, Apache Spark, Apache Hive, Apache Tez, Apache CarbonData, Netflix Atlas, LinkedIn Pinot, Pilosa, Microsoft Visual Studio Team Services (VSTS), eBay’s Apache Kylin, and so forth.
• JavaFastPFOR and FastPFor have been included in Terrier, Apache Parquet, Apache Lucene, and Apache NiFi.
• EWAHBoolArray and JavaEWAH have been included in Git (i.e., GitHub), jGit, Apache Hive, and so forth. JavaEWAH is part of standard Linux distributions like Ubuntu and RedHat.

Some of my blog posts and articles lead to improvements in widely used software. Here are some examples:

• My blog post Accelerating PHP hashing by “unoptimizing” it lead to an optimization of the PHP hash function (starting with PHP 7.4).
• My blog post A fast alternative to the modulo reduction describes a technique used by TensorFlow, by Facebook RocksDB, by Google netstack and by the Bitcoin core.
• My blog post Visiting all values in an array exactly once in random order is quoted in the source code of the Swift compiler.

• Techniques to measure memory-level parallelism developed on my blog have been adopted by tech journalists at sites such as anandtech.com.

• Our StreamVByte compression algorithm from the article Stream VByte: Faster Byte-Oriented Integer Compression is used by Facebook Thrift and RedisLabs’ RediSeach.

• The algorithm described in my article Fast Random Integer Generation in an Interval was adopted to accelerate random number generation

  • by Google’s Abseil C++ Common Libraries,
  • by the Swift standard library,
  • by the Go language,
  • by the Julia language,
  • and by Numpy (Python).

• The algorithm described in our article Faster Base64 Encoding and Decoding using AVX2 Instructions is used within PHP (as of version 7.4).

• The algorithm described in our paper Faster Population Counts using AVX2 Instructions is used by the Windows Terminal by Microsoft.

• The algorithm described in our article Faster Remainder by Direct Computation: Applications to Compilers and Software Libraries is used within the C# standard library to accelerate the Dictionary class.

You can find my work on arXiv, on Google Scholar, on DBLP, on the ACM Portal, on R Libre and elsewhere.

• Daniel Lemire
  Making Your Code Faster by Taming Branches
  InfoQ (online) 2020

  Details PDF Code

• Thomas Mueller Graf, Daniel Lemire
  Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters
  Journal of Experimental Algorithmics (to appear)

  Details PDF (arXiv) Code

• Wojciech Muła, Daniel Lemire
  Base64 encoding and decoding at almost the speed of a memory copy
  Software: Practice and Experience 50 (2), 2020

  Details PDF (arXiv) Code

• Geoff Langdale, Daniel Lemire
  Parsing Gigabytes of JSON per Second
  VLDB Journal 28 (6), 2019

  Details PDF (arXiv) Code

• Daniel Lemire
  Fast Random Integer Generation in an Interval
  ACM Transactions on Modeling and Computer Simulation 29 (1), 2019

  Details PDF (arXiv) Video Code

• Daniel Lemire, Owen Kaser, Nathan Kurz
  Faster Remainder by Direct Computation: Applications to Compilers and Software Libraries
  Software: Practice and Experience 49 (6), 2019

  Details PDF (arXiv) Code

• Daniel Lemire, Melissa E. O’Neill
  Xorshift1024*, Xorshift1024+, Xorshift128+ and Xoroshiro128+ Fail Statistical Tests for Linearity
  Computational and Applied Mathematics 350, 2019

  Details PDF (arXiv) Code

• Wojciech Muła, Daniel Lemire
  Faster Base64 Encoding and Decoding using AVX2 Instructions
  ACM Transactions on the Web 12 (3), 2018

  Details PDF (arXiv) Code

• Daniel Lemire, Owen Kaser, Nathan Kurz, Luca Deri, Chris O’Hara, François Saint-Jacques, Gregory Ssi-Yan-Kai
  Roaring Bitmaps: Implementation of an Optimized Software Library
  Software: Practice and Experience 48 (4), 2018

  Details PDF (arXiv) Code

• Edmon Begoli, Jesús Camacho Rodríguez, Julian Hyde, Michael J. Mior, Daniel Lemire
  Apache Calcite: A Foundational Framework for Optimized Query Processing Over Heterogeneous Data Sources
  SIGMOD’18, 2018

  Details PDF (arXiv) Code

• Wojciech Muła, Nathan Kurz, Daniel Lemire
  Faster Population Counts Using AVX2 Instructions
  Computer Journal 61 (1), 2018

  Details PDF (arXiv) Code

• Antonio Badia, Daniel Lemire
  On Desirable Semantics of Functional Dependencies over Databases with Incomplete Information
  Fundamenta Informaticae 158 (4), 2018

  Details PDF (arXiv)

• Daniel Lemire, Nathan Kurz, Christoph Rupp
  Stream VByte: Faster Byte-Oriented Integer Compression
  Information Processing Letters 130, 2018

  Details PDF (arXiv) Code

• Daniel Lemire, Christoph Rupp
  Efficient Integer-Key Compression in a Key-Value Store using SIMD Instructions
  Information Systems 66, 2017

  Details PDF (arXiv) Code

• Dmytro Ivanchykhin, Sergey Ignatchenko, Daniel Lemire
  Regular and almost universal hashing: an efficient implementation
  Software: Practice and Experience 47 (10), 2017

  Details PDF (arXiv) Code

• Samy Chambi, Daniel Lemire, Owen Kaser, Robert Godin
  Better bitmap performance with Roaring bitmaps
  Software: Practice and Experience 46 (5), 2016

  Details PDF (arXiv) Slides Code Project

• Owen Kaser, Daniel Lemire
  Compressed bitmap indexes: beyond unions and intersections
  Software: Practice and Experience 46 (2), 2016

  Details PDF (arXiv) Code

• Daniel Lemire, Gregory Ssi-Yan-Kai, Owen Kaser
  Consistently faster and smaller compressed bitmaps with Roaring
  Software: Practice and Experience 46 (11), 2016

  Details PDF (arXiv) Slides Code Project

• Daniel Lemire, Owen Kaser
  Faster 64-bit universal hashing using carry-less multiplications
  Journal of Cryptographic Engineering 6(3), 2016

  Details PDF (arXiv) Code

• Daniel Lemire, Leonid Boytsov, Nathan Kurz
  SIMD Compression and the Intersection of Sorted Integers
  Software: Practice and Experience 46 (6), 2016

  Details PDF (arXiv) Slides Code

• Wayne Xin Zhao, Xudong Zhang, Daniel Lemire, Dongdong Shan, Jian-Yun Nie, Hongfei Yan, Ji-Rong Wen
  A General SIMD-based Approach to Accelerating Compression Algorithms
  ACM Transactions on Information Systems 33 (3), 2015

  Details PDF (arXiv)

• Daniel Lemire, Leonid Boytsov
  Decoding billions of integers per second through vectorization
  Software: Practice & Experience 45 (1), 2015

  Details PDF (arXiv) Slides Code

• Antonia Badia, Daniel Lemire
  Functional dependencies with null markers
  Computer Journal 58 (5), 2015

  Details PDF (arXiv)

• Xiaodan Zhu, Peter Turney, Daniel Lemire, Andre Vellino
  Measuring academic influence: Not all citations are equal
  Journal of the Association for Information Science and Technology 66 (2), 2015

  Details PDF (arXiv) Dataset

• Adina Crainiceanu, Daniel Lemire
  Multidimensional Bloom Filters
  Information Systems (54), 2015

  Details PDF (arXiv) Code

• Jeff Plaisance, Nathan Kurz, Daniel Lemire
  Vectorized VByte Decoding
  International Symposium on Web Algorithms 2015, 2015

  Details PDF (arXiv) Slides Code

• Owen Kaser, Daniel Lemire
  Strongly universal string hashing is fast
  Computer Journal 57 (11), 2014

  Details PDF (arXiv) Code

• Hazel Webb, Owen Kaser, Daniel Lemire
  Diamond Dicing
  Data & Knowledge Engineering 86, 2013

  Details PDF (arXiv)

• Daniel Lemire, Owen Kaser, Eduardo Gutarra
  Reordering Rows for Better Compression: Beyond the Lexicographic Order
  ACM Transactions on Database Systems 37 (3), 2012

  Details PDF (arXiv) Slides Code Code Code

• Daniel Lemire
  The universality of iterated hashing over variable-length strings
  Discrete Applied Mathematics 160 (4-5), 2012

  Details PDF (arXiv)

• Zoltán Prekopcsák, Daniel Lemire
  Time Series Classification by Class-Specific Mahalanobis Distances
  Advances in Data Analysis and Classification 6 (3), 2012

  Details PDF (arXiv)

• Antonio Badia, Daniel Lemire
  A Call to Arms: Revisiting Database Design
  SIGMOD Record 40 (3), 2011

  Details PDF (arXiv)

• Daniel Lemire, Andre Vellino
  Extracting, Transforming and Archiving Scientific Data
  In VLDL 2011, Berlin, Germany, 2011

  Details PDF (arXiv)

• Daniel Lemire, Owen Kaser
  Reordering Columns for Smaller Indexes
  Information Sciences 181 (12), 2011

  Details PDF (arXiv)

• Daniel Lemire, Owen Kaser
  Recursive n-gram hashing is pairwise independent, at best
  Computer Speech & Language 24 (4), pages 698-710, 2010

  Details PDF (arXiv) Code

• Daniel Lemire, Owen Kaser, Kamel Aouiche
  Sorting improves word-aligned bitmap indexes
  Data & Knowledge Engineering 69 (1), 2010

  Details PDF (arXiv) Code

• Daniel Lemire, Martin Brooks, Yuhong Yan
  An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation
  International Journal of Computer Mathematics 86 (7), 2009

  Details PDF (arXiv) Code

• Daniel Lemire
  Faster retrieval with a two-pass dynamic-time-warping lower bound
  Pattern recognition 42 (9), 2009

  Details PDF (arXiv) Code

• Daniel Lemire, Owen Kaser
  Hierarchical Bin Buffering: Online Local Moments for Dynamic External Memory Arrays
  ACM Transactions on Algorithms 4(1): 14 (2008)

  Details PDF (arXiv) Code

• Owen Kaser, Daniel Lemire, Kamel Aouiche
  Histogram-Aware Sorting for Enhanced Word-Aligned Compression in Bitmap Indexes
  DOLAP 2008

  Details PDF (arXiv) Code

• Hazel Webb, Owen Kaser, Daniel Lemire
  Pruning Attribute Values From Data Cubes with Diamond Dicing
  IDEAS 2008

  Details PDF (arXiv)

• Daniel Lemire
  A Better Alternative to Piecewise Linear Time Series Segmentation
  SIAM Data Mining 2007

  Details PDF (arXiv) Code

• Kamel Aouiche, Daniel Lemire
  A Comparison of Five Probabilistic View-Size Estimation Techniques in OLAP
  DOLAP 2007, pp. 17-24, 2007

  Details PDF (arXiv) Slides Code

• Dan Kucerovsky, Daniel Lemire
  Monotonicity Analysis over Chains and Curves
  In Curves and Surfaces 2006, Saint-Malo, France, 2007

  Details PDF (arXiv)

• Owen Kaser, Daniel Lemire
  Removing Manually-Generated Boilerplate from Electronic Texts: Experiments with Project Gutenberg e-Books
  CASCON 2007

  Details PDF (arXiv) Code

• Owen Kaser, Daniel Lemire
  Tag-Cloud Drawing: Algorithms for Cloud Visualization
  Tagging and Metadata for Social Information Organization (WWW 2007)

  Details PDF (arXiv) Slides Code Dataset

• Owen Kaser, Daniel Lemire
  Attribute Value Reordering For Efficient Hybrid OLAP
  Information Sciences 176 (16) 2006

  Details PDF (arXiv)

• Daniel Lemire
  Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element
  Nordic Journal of Computing 13 (4), pages 328-339, 2006

  Details PDF (arXiv) Code Code

• Daniel Lemire, Harold Boley, Sean McGrath, Marcel Ball
  Collaborative filtering and inference rules for context‐aware learning object recommendation
  Interactive Technology and Smart Education 2 (3), 2005

  Details PDF

• Daniel Lemire
  Scale and Translation Invariant Collaborative Filtering Systems
  Information Retrieval 8 (1), 2005

  Details PDF

• Daniel Lemire, Anna Maclachlan
  Slope One Predictors for Online Rating-Based Collaborative Filtering
  In SIAM Data Mining (SDM 2005), Newport Beach, California, April 21-23, 2005

  Details PDF (arXiv)

• Daniel Lemire
  A family of 4-point dyadic high resolution subdivision schemes
  In Curves and Surfaces 2002, Saint-Malo, France, 2003

  Details PDF Code

• Serge Dubuc, Daniel Lemire, Jean-Louis Merrien
  Fourier analysis of 2-point Hermite interpolatory subdivision schemes
  Journal of Fourier Analysis and Applications 7 (5), 2001

  Details PDF

• Daniel Lemire, Chantal Pharand, Jean-Claude Rajaonah, Benoît Dubé, A.-Robert LeBlanc
  Wavelet time entropy, T wave morphology and myocardial ischemia
  IEEE Transactions on Biomedical Engineering 47 (7), 2000

  Details PDF

• Gilles Deslauriers, Serge Dubuc, Daniel Lemire
  Une famille d'ondelettes biorthogonales sur l'intervalle obtenue par un schéma d'interpolation itérative
  Annales des Sciences Mathématiques du Québec 23 (1), 1999

  Details PDF

I regularly give industrial talks; they are often well received. My QCon San Francisco 2019 talk was outlined as a “best voted” talk with 98% of the audience giving it thumbs up; this is much higher than the average.

• Data Engineering at the Speed of Your Disk

  Mon, Oct 7, 2019, Performance Summit III (Facebook)

• Parsing JSON Really Quickly: Lessons Learned

  Mon, Oct 7, 2019, QCon San Francisco 2019

• Next Generation Indexes For Big Data Engineering

  Wed, Feb 7, 2018, ODSC East 2018

• Engineering Fast Indexes for Big Data Applications

  Tue, Feb 7, 2017, Spark Summit East 2017

• Engineering Fast Indexes for Big Data Applications (Deep Dive)

  Tue, Feb 7, 2017, Spark Summit East 2017

• Algorithms: How content finds you

  Tue, May 10, 2016, Discoverability Summit

We are lucky to have a fully equipped laboratory with a dedicated technician. We have a server farm that has been used worldwide for experiments in software performance (e.g., by researchers such as Agner Fog). Some of our machines have the following specifications:

• Haswell microarchitecture: Intel Core i7-4770 CPU @ 3.40GHz
• Knights Landing microarchitecture: Intel Xeon Phi™ CPU 7210 @ 1.30GHz (64 cores)
• Skylake microarchitecture: Intel Core i7-6700 CPU @ 3.40GHz
• Skylake-X microarchitecture: Intel Xeon W-2104 CPU @ 3.20GHz
• IBM POWER9 2.2 GHz, 4-core
• Cannonlake microarchitecture: Intel Core i3-8121U CPU @2.20GHz
• Skylark microarchitecture (ARMv8): Ampere eMAG CPU 32 cores @ 3.3 GHz

We also have several workstations and space in our laboratory to explore virtual reality as a tool in data science.

I teach primarily in French and online since 2004.

Undergraduate courses:

• INF6460: Recherche et filtrage d’informations

Graduate courses:

• INF6104: Recherche d’informations et Web
• INF6408: Informatique de l’analyse multidimensionnelle
• INF6107: Web social

I’m recruiting students and postdoctoral fellows for my lab. If you love writing crazily fast software and want to come to Montreal, drop me a line. Link to an impressive GitHub profile is an asset. Speaking French is an asset if you want to pursue an academic program with me. Some of my best students are women. We offer scholarships for graduate studies in software performance for data engineering (in French).

If you are a Canadian undergraduate student with at least a B average, you might be interested in coming to work with me under an NSERC Undergraduate Student Research Awards. The awards help pay for a full-time research project in our Montreal labs. The application deadlines are:

• March 1st for the Summer term;
• July 1st for the Fall term;
• November 1st for the Winter term.

It is an ongoing competition: I can receive applications for every term. Please allow at least a week to put together an application with my help. Email me if you are interested.

If you are interested in pursuing a master in information technology full-time under my supervision in Montreal and you know some French, I take applications for NSERC Graduate Scholarships. You need to have a strong academic profile to apply. You should be a Canadian citizen or permanent resident of Canada. The deadline is December first of each year. You must plan ahead. I take applications every year. Please get in touch by email if you are interested.

If you are interested in pursuing a Ph.D. in cognitive computing full-time under my supervision in Montreal and you know some French, I take applications for NSERC graduate scholarships. You need to have a strong academic profile to apply. You should be a Canadian citizen or permanent resident of Canada. The deadline is November 1st of each year. You must plan ahead. I take applications every year. Please get in touch by email if you are interested.

I supervise graduate students at the University of Quebec (TÉLUQ and UQAM). I also co-supervise students the University of New Brunswick, at the École Polytechnique and at Concordia University.

Recent graduates:

• Zeeshan Ahmed (M.Sc., 2020);
• Tarek Khei (Ph.D., 2020);
• Xueping Dai (Ph.D., 2019);
• Massamba Fall (M.Sc., 2018)
• Erick Aokou Koffi (Ph.D., 2018);
• Badis Merdaoui (Ph.D., 2017) (Architecte en technologie de l’information chez Saputo);
• Maxime Boisvert (M.Sc., 2017) (Production Engineering Manager chez Shopify);
• Shany Carle (M.Sc., 2017) (professeur d’informatique au cégep de Victoriaville);
• Joseph Tumusenge (M.Sc., 2016);
• Samy Chambi (Ph.D., 2016, with Robert Godin);
• Jing Li (Ph.D., 2016, with Yuhong Yan);
• Claude Corriolan (M.Sc., 2016);
• Ikhtear Sharif (M.Sc. 2013), Performance evaluation of fast integer compression techniques;
• Hazel Webb (Ph.D., 2010, with Owen Kaser);
• Eduardo Gutarra (M.Sc. 2012), Multi-column Bitmap Indexing;
• Steven Keith (M.Sc. 2006), Efficient Storage Methods for a Literary Data Warehouse.

Some alumni:

• Shira Smith is an engineer at Discord in California.
• Dara Aghamirkarimi teaches Computer Science at LaSalle College.

Current Ph.D. students:

• Gary Germeil (cosupervised with Richard Hotte)
• François Lewis (supervised with Patrick Plante)
• Ludovic Bocken (supervised with Étienne Harnad)
• Pierre Marie Ntang
• Fatma Miladi (supervised with Valéry Psyché)
• Guy Jobin
• Luis Garcia Vargas

Current M.Sc. students:

• Hernandez Juan
• Geneviève Lefebvre
• Abdel Ghani Laaouissi
• Achille Kamdem
• Yassine Rabbouh
• Jean-François Grenier, GitHub and Blog
• Nadine Gauthier
• Carine Croteau, GitHub
• Honoré Takamgang Lousse
• Marina Lopez
• Victor-Anthony Masson
• Alex Bélisle Turcot
• Abdelkader Kaddour Brahim
• Chaqri Fatima-Ezzahra
• Sara Ait Bouziaren
• Mbaye Sarr
• Pomaridès Vofo
• Rachid Kherchache
• Caroline Arseneau
• Roger Guévin-Kamena
• Patrick Roberge
• Hakim Berraki

Recent research assistants (undergraduate):

• Yoann Le Rouzic, Summer 2020. GitHub
• Io Andes Daza-Dillon, Summer 2019, recipient of an NSERC Undergraduate Student Research Award. GitHub
• Jérémie Piotte, Fall 2018 and 2019, recipient of an NSERC Undergraduate Student Research Award. GitHub
• Niko Girardelli, Winter 2018. GitHub

Mentoring

• Homma Kazutaka, Google Summer of Code, Summer 2018 (co-mentor with Harlan Haskins at Apple)

I organize in Montreal ongoing series of workshops open to the public: the technolab workshops and the tribalab workshops.

I have served in the program committee of several international conferences such as

• ACM Conference on Information and Knowledge Management (ACM CIKM)
• ACM Conference on Web Search and Data Mining (ACM WSDM)
• ACM Conference on Information Retrieval (ACM SIGIR)
• ACM Conference on Recommender Systems (ACM RecSys)
• ACM/IEEE Joint Conference on Digital Libraries (JCDL)

In 2019, I was the chair of EDA 2019 (Business Intelligence & Big Data) held in October at Montpellier, France.

In 2018, I was recognized by the journal Software: Practice and Experience as a distinguished referee for my “insightful, careful, constructive and timely reviews”.

In June 2018, I participated to the Dagstuhl Seminar 18251: Database Architectures for Modern Hardware.

I recently served on the following program committees:

• WSDM 2021:14th ACM International WSDM Conference (Jerusalem, Israel, March 8-12, 2021)
• EDML20: Second Workshop on Evaluation and Experimental Design
• RecSys 2020: 14th ACM Recommender Systems Conference (Rio de Janeiro, Brazil)
• BBIGAP’2020: Second International Workshop for Business Intelligence & Big Data Applications
• ECML-PKDD 2020: European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (Area Chair)
• CIKM 2020: 29th ACM International Conference on Information and Knowledge
• DaWak 2020: 22nd International Conference on Big Data Analytics and Knowledge Discovery
• SIGIR 2020: 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval
• DOLAP 2020: 22nd International Workshop On Design, Optimization, Languages and Analytical Processing of Big Data
• ADBIS 2020: 24th European Conference on Advances in Databases and Information System (August 25-28: Lyon, France)
• CIKM 2019: 28th ACM International Conference on Information and Knowledge Management (Nov 3-7, 2019: Beijing, China)
• RecSys 2019: 13th ACM Recommender Systems Conference (September 2019; Copenhagen, Denmark)
• BBigAP 2019: 1st International Workshop on BI & Big Data applications, In conjunction with the 23rd European Conference on Advances in Databases and Information Systems (ADBIS 2019) (September 8, 2019; Bled, Slovenia)
• DOLAP 2019 - 21st International Workshop On Design, Optimization, Languages and Analytical Processing of Big Data (March 26, 2019; Lisbon, Portugal)
• CIKM 2018 - Twenty-Seventh ACM International Conference on Information and Knowledge Management (October 22-26, 2018; Turing, Italy)
• ASD 2018 - 12th edition of the Conference on Advances of Decisional Systems : Big data & Applications (May 2018; Marrakech, Morocco)
• WABiD* 2018 - 1st International Workshop on Advances on Big Data Management, Analytics and Security (September 2018; Budapest, Hungary)
• RecSys 2018 - 12th ACM Recommender Systems Conference (October 2018; Vancouver, Canada)
• WWW 2018 - Twenty-seventh International WWW Conference (April 23-27 2018; Lyon, France)
• DOLAP 2018 - 20th International Workshop On Design, Optimization, Languages and Analytical Processing of Big Data (March 26–29, 2018; Vienna, Austria)
• CIKM 2017 - Twenty-Sixth ACM International Conference on Information and Knowledge Management (November 6-10, 2017; Singapore)
• SPIRE 2017 - 24th International Symposium on String Processing and Information Retrieval (September 26-29, 2017; Palermo, Italy)

I was an external referee for the following Ph.D. students:

• Kareem El Gebaly at Waterloo University (2018) - supervised by Jimmy Lin, Lukasz Golab and Ashraf Aboulnaga.
• Mohammed Shaaban at Université Pierre et Marie Curie (2017) - supervised by Patrick Garda.
• Mehdi Boukhechba at UQAC (2016) - supervised by Abdenour Bouzouane and Charles Gouin-Vallerand.
• Hicham Assoudi at UQAM (2016) - supervised by Hakim Lounis.
• Khaled Dehdouh at Lyon 2 (2015) - supervised by Omar Boussaid.
• Martin Leginus at Aalborg University (2015) - supervised by Peter Dolog.
• Ahmad Taleb at Université Concordia (2011) - supervised by Todd Eavis.

I served as a committee member for several funding bodies:

• FRQNT: review committee 03F (theoretical computer science) since 2007.
• FRQNT: review committee 309 (team projects in computer science) since 2006.
• NSERC: Research Tools and Instruments Grants Program (2012-2015)
• NSERC: Computer Science Evaluation Group (EG 1507) for the Discovery Grants Program, comité 1507 (2018-2021), co-chair in 2019-2020

• Resume (1 page, PDF)
• English c.v. (PDF)
• French c.v. (PDF)

• The research paper should NOT be the final product (interview), A.I. Socratic Circles, March 3rd 2020.
• Des serveurs informatiques plus rapides et moins énergivores (interview), Les années lumières, Radio-Canada, December 13th 2019.
• Des langues découpées en bits pour comparer leur efficacité (interview), Les années lumières, Radio-Canada, September 15th 2019.
• L’intelligence artificielle pour rendre les logiciels plus rapides (magazine article on Daniel Lemire’s work), Québec Science, March 28th 2019.

Click on the picture for a high resolution version.

• [email protected]
• University of Quebec (TELUQ), 5800 Saint-Denis, Office 1105, Montreal (Quebec) H2S 3L5 Canada
• email for appointment