Wavelet time entropy, T wave morphology and myocardial ischemia. - Daniel Lemire; Chantal Pharand; Jean-Claude Rajaonah; Bruno Dubé; A.-Robert LeBlanc (IEEE Trans. Biomed. Eng., 2000)

Wavelet-based relative prefix sum methods for range sum queries in data cubes. - Daniel Lemire (CASCON, 2002)

Quasi-Monotonic Segmentation of State Variable Behavior for Reactive Control. - Will Fitzgerald; Daniel Lemire; Martin Brooks (AAAI, 2005)

Scale-Based Monotonicity Analysis in Qualitative Modelling with Flat Segments. - Martin Brooks; Yuhong Yan; Daniel Lemire (IJCAI, 2005)

Slope One Predictors for Online Rating-Based Collaborative Filtering. - Daniel Lemire; Anna Maclachlan (SDM, 2005)

Scale and Translation Invariant Collaborative Filtering Systems. - Daniel Lemire (Inf. Retr., 2005)

Collaborative filtering and inference rules for context-aware learning object recommendation. - Daniel Lemire; Harold Boley; Sean McGrath; Marcel Ball (Interact. Technol. Smart Educ., 2005)

Analyzing Large Collections of Electronic Text Using OLAP - Steven Keith; Owen Kaser; Daniel Lemire (CoRR, 2006)

One-Pass, One-Hash n-Gram Statistics Estimation - Daniel Lemire; Owen Kaser (CoRR, 2006)

Attribute value reordering for efficient hybrid OLAP. - Owen Kaser; Daniel Lemire (Inf. Sci., 2006)

Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element. - Daniel Lemire (Nord. J. Comput., 2006)

Removing manually generated boilerplate from electronic texts: experiments with project Gutenberg e-books. - Owen Kaser; Daniel Lemire (CASCON, 2007)

A comparison of five probabilistic view-size estimation techniques in OLAP. - Kamel Aouiche; Daniel Lemire (DOLAP, 2007)

UNASSSUMING view-size estimation techniques in OLAP - an experimental comparison. - Kamel Aouiche; Daniel Lemire (ICEIS (1), 2007)

A Better Alternative to Piecewise Linear Time Series Segmentation. - Daniel Lemire (SDM, 2007)

Introduction to the Special Issue on Canadian Semantic Web. - Mamadou Tadiou Kone; Daniel Lemire (Comput. Intell., 2007)

Recursive Hashing and One-Pass, One-Hash n-Gram Count Estimation - Daniel Lemire; Owen Kaser (CoRR, 2007)

Unasssuming View-Size Estimation Techniques in OLAP - Kamel Aouiche; Daniel Lemire (CoRR, 2007)

Tag-Cloud Drawing: Algorithms for Cloud Visualization - Owen Kaser; Daniel Lemire (CoRR, 2007)

Histogram-aware sorting for enhanced word-aligned compression in bitmap indexes. - Owen Kaser; Daniel Lemire; Kamel Aouiche (DOLAP, 2008)

Pruning attribute values from data cubes with diamond dicing. - Hazel Webb; Owen Kaser; Daniel Lemire (IDEAS, 2008)

Collaborative OLAP with Tag Clouds - Web 2.0 OLAP Formalism and Experimental Evaluation. - Kamel Aouiche; Daniel Lemire; Robert Godin (WEBIST (1), 2008)

Web 2.0 OLAP: From Data Cubes to Tag Clouds. - Kamel Aouiche; Daniel Lemire; Robert Godin (WEBIST (Selected Papers), 2008)

Tri de la table de faits et compression des index bitmaps avec alignement sur les mots - Kamel Aouiche; Daniel Lemire; Owen Kaser (CoRR, 2008)

Faster Sequential Search with a Two-Pass Dynamic-Time-Warping Lower Bound - Daniel Lemire (CoRR, 2008)

Hierarchical bin buffering: Online local moments for dynamic external memory arrays. - Daniel Lemire; Owen Kaser (ACM Trans. Algorithms, 2008)

On the Challenges of Collaborative Data Processing - Sylvie Noël; Daniel Lemire (CoRR, 2009)

An optimal linear time algorithm for quasi-monotonic segmentation. - Daniel Lemire; Martin Brooks; Yuhong Yan (Int. J. Comput. Math., 2009)

Faster retrieval with a two-pass dynamic-time-warping lower bound. - Daniel Lemire (Pattern Recognit., 2009)

Evaluating Multidimensional Queries by Diamond Dicing - Hazel Webb; Owen Kaser; Daniel Lemire (CoRR, 2010)

Time Series Classification by Class-Based Mahalanobis Distances - Zoltán Prekopcsák; Daniel Lemire (CoRR, 2010)

Marketing your ideas: Don't sell yourself short. - Daniel Lemire (XRDS, 2010)

Recursive n-gram hashing is pairwise independent, at best. - Daniel Lemire; Owen Kaser (Comput. Speech Lang., 2010)

Sorting improves word-aligned bitmap indexes. - Daniel Lemire; Owen Kaser; Kamel Aouiche (Data Knowl. Eng., 2010)

Extracting, Transforming and Archiving Scientific Data - Daniel Lemire; André Vellino (CoRR, 2011)

Reordering columns for smaller indexes. - Daniel Lemire; Owen Kaser (Inf. Sci., 2011)

A call to arms: revisiting database design. - Antonio Badia; Daniel Lemire (SIGMOD Rec., 2011)

Time series classification by class-specific Mahalanobis distance measures. - Zoltán Prekopcsák; Daniel Lemire (Adv. Data Anal. Classif., 2012)

The universality of iterated hashing over variable-length strings. - Daniel Lemire (Discret. Appl. Math., 2012)

Changing computational research. The challenges ahead. - Cameron Neylon; Jan Aerts; C. Titus Brown; Simon J. Coles; Les Hatton; Daniel Lemire; K. Jarrod Millman; Peter Murray-Rust; Fernando Pérez; Neil F. W. Saunders; Nigam Shah; Arfon M. Smith; et al. (Source Code Biol. Medicine, 2012)

Reordering rows for better compression: Beyond the lexicographic order. - Daniel Lemire; Owen Kaser; Eduardo Gutarra (ACM Trans. Database Syst., 2012)

Diamond dicing. - Hazel Webb; Daniel Lemire; Owen Kaser (Data Knowl. Eng., 2013)

Full Solution Indexing Using Database for QoS-Aware Web Service Composition. - Jing Li 028; Yuhong Yan; Daniel Lemire (IEEE SCC, 2014)

Roaring bitmap : nouveau modèle de compression bitmap. - Samy Chambi; Daniel Lemire; Robert Godin; Owen Kaser (EDA, 2014)

Strongly Universal String Hashing is Fast. - Daniel Lemire; Owen Kaser (Comput. J., 2014)

Threshold and Symmetric Functions over Bitmaps. - Owen Kaser; Daniel Lemire (CoRR, 2014)

Introductory Editorial. - Daniel Lemire (Open J. Inf. Syst., 2014)

A Web Service Composition Method Based on Compact K2-Trees. - Jing Li 028; Yuhong Yan; Daniel Lemire (SCC, 2015)

An Analysis Tool for the Contextual Information from Field Experiments on Driving Fatigue. - Perrine Ruer; Charles Gouin-Vallerand; Le Zhang; Daniel Lemire; Evelyne F. Vallières (CONTEXT, 2015)

Functional Dependencies with null Markers. - Antonio Badia; Daniel Lemire (Comput. J., 2015)

Vectorized VByte Decoding. - Jeff Plaisance; Nathan Kurz; Daniel Lemire (CoRR, 2015)

Bloofi: Multidimensional Bloom filters. - Adina Crainiceanu; Daniel Lemire (Inf. Syst., 2015)

Measuring academic influence: Not all citations are equal. - Xiaodan Zhu 001; Peter D. Turney; Daniel Lemire; André Vellino (J. Assoc. Inf. Sci. Technol., 2015)

Decoding billions of integers per second through vectorization. - Daniel Lemire; Leonid Boytsov (Softw. Pract. Exp., 2015)

A General SIMD-Based Approach to Accelerating Compression Algorithms. - Wayne Xin Zhao; Xudong Zhang; Daniel Lemire; Dongdong Shan; Jian-Yun Nie; Hongfei Yan; Ji-Rong Wen (ACM Trans. Inf. Syst., 2015)

Nouveaux modèles d'index bitmap compressés à 64 bits. - Samy Chambi; Daniel Lemire; Robert Godin (EDA, 2016)

Scaling Up Web Service Composition with the Skyline Operator. - Jing Li 028; Yuhong Yan; Daniel Lemire (ICWS, 2016)

Optimizing Druid with Roaring bitmaps. - Samy Chambi; Daniel Lemire; Robert Godin; Kamel Boukhalfa; Charles R. Allen; Fangjin Yang (IDEAS, 2016)

Faster 64-bit universal hashing using carry-less multiplications. - Daniel Lemire; Owen Kaser (J. Cryptogr. Eng., 2016)

Better bitmap performance with Roaring bitmaps. - Samy Chambi; Daniel Lemire; Owen Kaser; Robert Godin (Softw. Pract. Exp., 2016)

Compressed bitmap indexes: beyond unions and intersections. - Owen Kaser; Daniel Lemire (Softw. Pract. Exp., 2016)

SIMD compression and the intersection of sorted integers. - Daniel Lemire; Leonid Boytsov; Nathan Kurz (Softw. Pract. Exp., 2016)

Consistently faster and smaller compressed bitmaps with Roaring. - Daniel Lemire; Gregory Ssi Yan Kai; Owen Kaser (Softw. Pract. Exp., 2016)

Vers de meilleures performances avec des Roaring bitmaps. - Samy Chambi; Daniel Lemire; Robert Godin (Tech. Sci. Informatiques, 2016)

Discovering the smart forests with virtual reality. - Dara Aghamirkarimi; Daniel Lemire (WIMS, 2017)

Upscaledb: Efficient integer-key compression in a key-value store using SIMD instructions. - Daniel Lemire; Christoph Rupp (Inf. Syst., 2017)

Regular and almost universal hashing: an efficient implementation. - Dmytro Ivanchykhin; Sergey Ignatchenko; Daniel Lemire (Softw. Pract. Exp., 2017)

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

Faster Population Counts Using AVX2 Instructions. - Wojciech Mula; Nathan Kurz; Daniel Lemire (Comput. J., 2018)

On Desirable Semantics of Functional Dependencies over Databases with Incomplete Information. - Antonio Badia; Daniel Lemire (Fundam. Informaticae, 2018)

Stream VByte: Faster byte-oriented integer compression. - Daniel Lemire; Nathan Kurz; Christoph Rupp (Inf. Process. Lett., 2018)

Roaring bitmaps: Implementation of an optimized software library. - Daniel Lemire; Owen Kaser; Nathan Kurz; Luca Deri; Chris O'Hara; François Saint-Jacques; Gregory Ssi Yan Kai (Softw. Pract. Exp., 2018)

Full Solution Indexing for Top-K Web Service Composition. - Jing Li 028; Yuhong Yan; Daniel Lemire (IEEE Trans. Serv. Comput., 2018)

Faster Base64 Encoding and Decoding Using AVX2 Instructions. - Wojciech Mula; Daniel Lemire (ACM Trans. Web, 2018)

Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters. - Thomas Mueller Graf; Daniel Lemire (CoRR, 2019)

Xorshift1024*, xorshift1024+, xorshift128+ and xoroshiro128+ fail statistical tests for linearity. - Daniel Lemire; Melissa E. O'Neill (J. Comput. Appl. Math., 2019)

Faster remainder by direct computation: Applications to compilers and software libraries. - Daniel Lemire; Owen Kaser; Nathan Kurz (Softw. Pract. Exp., 2019)

Fast Random Integer Generation in an Interval. - Daniel Lemire (ACM Trans. Model. Comput. Simul., 2019)

Parsing gigabytes of JSON per second. - Geoff Langdale; Daniel Lemire (VLDB J., 2019)

Integer Division by Constants: Optimal Bounds. - Daniel Lemire; Colin Bartlett; Owen Kaser (CoRR, 2020)

Xor Filters. - Thomas Mueller Graf; Daniel Lemire (ACM J. Exp. Algorithmics, 2020)

Base64 encoding and decoding at almost the speed of a memory copy. - Wojciech Mula; Daniel Lemire (Softw. Pract. Exp., 2020)

SIMDGiraffe: Visualizing SIMD Functions. - Pierre-Marie Ntang; Daniel Lemire (VISIGRAPP (3: IVAPP), 2021)

Unicode at Gigabytes per Second. - Daniel Lemire (SPIRE, 2021)

Efficient computation of positional population counts using SIMD instructions. - Marcus D. R. Klarqvist; Wojciech Mula; Daniel Lemire (Concurr. Comput. Pract. Exp., 2021)

Validating UTF-8 in less than one instruction per byte. - John Keiser; Daniel Lemire (Softw. Pract. Exp., 2021)

Number parsing at a gigabyte per second. - Daniel Lemire (Softw. Pract. Exp., 2021)

Binary Fuse Filters: Fast and Smaller Than Xor Filters. - Thomas Mueller Graf; Daniel Lemire (ACM J. Exp. Algorithmics, 2022)

Transcoding billions of Unicode characters per second with SIMD instructions. - Daniel Lemire; Wojciech Mula (Softw. Pract. Exp., 2022)

Learning Engagement and Peer Learning in MOOC: A Selective Systematic Review. - Fatma Miladi; Daniel Lemire; Valéry Psyché (ITS, 2023)

Fast number parsing without fallback. - Noble Mushtak; Daniel Lemire (Softw. Pract. Exp., 2023)

Transcoding unicode characters with AVX-512 instructions. - Robert Clausecker; Daniel Lemire (Softw. Pract. Exp., 2023)

Leveraging GPT-4 for Accuracy in Education: A Comparative Study on Retrieval-Augmented Generation in MOOCs. - Fatma Miladi; Valéry Psyché; Daniel Lemire (AIED Companion (1), 2024)

Comparative Performance of GPT-4, RAG-Augmented GPT-4, and Students in MOOCs. - Fatma Miladi; Valéry Psyché; Daniel Lemire (BBGI, 2024)

Comparative Analysis of Loop-Free Function Evaluation Using ChatGPT and Copilot with C Bounded Model Checking. - Faten Slama; Daniel Lemire (FLLM, 2024)

Exact Short Products From Truncated Multipliers. - Daniel Lemire (Comput. J., 2024)

Faster Positional-Population Counts for AVX2, AVX-512, and ASIMD. - Robert Clausecker; Daniel Lemire; Florian Schintke (CoRR, 2024)

On-demand JSON: A better way to parse documents? - John Keiser; Daniel Lemire (Softw. Pract. Exp., 2024)

Parsing millions of URLs per second. - Yagiz Nizipli; Daniel Lemire (Softw. Pract. Exp., 2024)

Will AI Flood Us with Irrelevant Papers? - Daniel Lemire (Commun. ACM, 2024)

Evaluating a GPT-4 and Retrieval-Augmented Generation-Based Conversational Agent to Enhance Learning Experience in a MOOC. - Fatma Miladi; Valéry Psyché; Awa Diattara; Nour El Mawas; Daniel Lemire (CSEDU (2), 2025)

Enhancing Developer Productivity: Benchmarking LLM-Powered Tools like GitHub Copilot and TabNine in Real-Time Coding Environments. - Faten Slama; Daniel Lemire (IDS, 2025)

Batched ranged random integer generation. - Nevin Brackett-Rozinsky; Daniel Lemire (Softw. Pract. Exp., 2025)

Parsing Millions of DNS Records Per Second. - Jeroen Koekkoek; Daniel Lemire (Softw. Pract. Exp., 2025)

Scanning HTML at Tens of Gigabytes Per Second on ARM Processors. - Daniel Lemire (Softw. Pract. Exp., 2025)