Daniel Lemire

Orcid: 0000-0003-3306-6922

Affiliations:
  • Université du Québec, Canada


According to our database1, Daniel Lemire authored at least 95 papers between 2000 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Exact Short Products From Truncated Multipliers.
Comput. J., 2024

2023
Transcoding unicode characters with AVX-512 instructions.
Softw. Pract. Exp., December, 2023

Fast number parsing without fallback.
Softw. Pract. Exp., July, 2023

On-Demand JSON: A Better Way to Parse Documents?
CoRR, 2023

Parsing Millions of URLs per Second.
CoRR, 2023

Learning Engagement and Peer Learning in MOOC: A Selective Systematic Review.
Proceedings of the Augmented Intelligence and Intelligent Tutoring Systems, 2023

2022
Transcoding billions of Unicode characters per second with SIMD instructions.
Softw. Pract. Exp., 2022

Binary Fuse Filters: Fast and Smaller Than Xor Filters.
ACM J. Exp. Algorithmics, 2022

2021
Number parsing at a gigabyte per second.
Softw. Pract. Exp., 2021

Validating UTF-8 in less than one instruction per byte.
Softw. Pract. Exp., 2021

Efficient computation of positional population counts using SIMD instructions.
Concurr. Comput. Pract. Exp., 2021

Unicode at Gigabytes per Second.
Proceedings of the String Processing and Information Retrieval, 2021

SIMDGiraffe: Visualizing SIMD Functions.
Proceedings of the 16th International Joint Conference on Computer Vision, 2021

2020
Base64 encoding and decoding at almost the speed of a memory copy.
Softw. Pract. Exp., 2020

Xor Filters.
ACM J. Exp. Algorithmics, 2020

Integer Division by Constants: Optimal Bounds.
CoRR, 2020

2019
Parsing gigabytes of JSON per second.
VLDB J., 2019

Fast Random Integer Generation in an Interval.
ACM Trans. Model. Comput. Simul., 2019

Faster remainder by direct computation: Applications to compilers and software libraries.
Softw. Pract. Exp., 2019

Xorshift1024*, xorshift1024+, xorshift128+ and xoroshiro128+ fail statistical tests for linearity.
J. Comput. Appl. Math., 2019

Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters.
CoRR, 2019

2018
Faster Base64 Encoding and Decoding Using AVX2 Instructions.
ACM Trans. Web, 2018

Full Solution Indexing for Top-K Web Service Composition.
IEEE Trans. Serv. Comput., 2018

Roaring bitmaps: Implementation of an optimized software library.
Softw. Pract. Exp., 2018

Stream VByte: Faster byte-oriented integer compression.
Inf. Process. Lett., 2018

On Desirable Semantics of Functional Dependencies over Databases with Incomplete Information.
Fundam. Informaticae, 2018

Faster Population Counts Using AVX2 Instructions.
Comput. J., 2018

Apache Calcite: A Foundational Framework for Optimized Query Processing Over Heterogeneous Data Sources.
Proceedings of the 2018 International Conference on Management of Data, 2018

2017
Regular and almost universal hashing: an efficient implementation.
Softw. Pract. Exp., 2017

Upscaledb: Efficient integer-key compression in a key-value store using SIMD instructions.
Inf. Syst., 2017

Discovering the smart forests with virtual reality.
Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics, 2017

2016
Vers de meilleures performances avec des Roaring bitmaps.
Tech. Sci. Informatiques, 2016

Consistently faster and smaller compressed bitmaps with Roaring.
Softw. Pract. Exp., 2016

SIMD compression and the intersection of sorted integers.
Softw. Pract. Exp., 2016

Compressed bitmap indexes: beyond unions and intersections.
Softw. Pract. Exp., 2016

Better bitmap performance with Roaring bitmaps.
Softw. Pract. Exp., 2016

Faster 64-bit universal hashing using carry-less multiplications.
J. Cryptogr. Eng., 2016

Optimizing Druid with Roaring bitmaps.
Proceedings of the 20th International Database Engineering & Applications Symposium, 2016

Scaling Up Web Service Composition with the Skyline Operator.
Proceedings of the IEEE International Conference on Web Services, 2016

Nouveaux modèles d'index bitmap compressés à 64 bits.
Proceedings of the Actes des 12e journées francophones sur les Entrepôts de Données et l'Analyse en Ligne, 2016

2015
A General SIMD-Based Approach to Accelerating Compression Algorithms.
ACM Trans. Inf. Syst., 2015

Decoding billions of integers per second through vectorization.
Softw. Pract. Exp., 2015

Measuring academic influence: Not all citations are equal.
J. Assoc. Inf. Sci. Technol., 2015

Bloofi: Multidimensional Bloom filters.
Inf. Syst., 2015

Vectorized VByte Decoding.
CoRR, 2015

Functional Dependencies with null Markers.
Comput. J., 2015

An Analysis Tool for the Contextual Information from Field Experiments on Driving Fatigue.
Proceedings of the Modeling and Using Context, 2015

A Web Service Composition Method Based on Compact K2-Trees.
Proceedings of the 2015 IEEE International Conference on Services Computing, 2015

2014
Introductory Editorial.
Open J. Inf. Syst., 2014

Threshold and Symmetric Functions over Bitmaps.
CoRR, 2014

Strongly Universal String Hashing is Fast.
Comput. J., 2014

Roaring bitmap : nouveau modèle de compression bitmap.
Proceedings of the Actes des 10e journées francophones sur les Entrepôts de Données et l'Analyse en Ligne, 2014

Full Solution Indexing Using Database for QoS-Aware Web Service Composition.
Proceedings of the IEEE International Conference on Services Computing, SCC 2014, Anchorage, AK, USA, June 27, 2014

2013
Diamond dicing.
Data Knowl. Eng., 2013

2012
Reordering rows for better compression: Beyond the lexicographic order.
ACM Trans. Database Syst., 2012

Changing computational research. The challenges ahead.
Source Code Biol. Medicine, 2012

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

Time series classification by class-specific Mahalanobis distance measures.
Adv. Data Anal. Classif., 2012

2011
A call to arms: revisiting database design.
SIGMOD Rec., 2011

Reordering columns for smaller indexes.
Inf. Sci., 2011

Extracting, Transforming and Archiving Scientific Data
CoRR, 2011

2010
Sorting improves word-aligned bitmap indexes.
Data Knowl. Eng., 2010

Recursive n-gram hashing is pairwise independent, at best.
Comput. Speech Lang., 2010

Marketing your ideas: Don't sell yourself short.
XRDS, 2010

Time Series Classification by Class-Based Mahalanobis Distances
CoRR, 2010

Evaluating Multidimensional Queries by Diamond Dicing
CoRR, 2010

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

An optimal linear time algorithm for quasi-monotonic segmentation.
Int. J. Comput. Math., 2009

On the Challenges of Collaborative Data Processing
CoRR, 2009

2008
Hierarchical bin buffering: Online local moments for dynamic external memory arrays.
ACM Trans. Algorithms, 2008

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

Tri de la table de faits et compression des index bitmaps avec alignement sur les mots
CoRR, 2008

Web 2.0 OLAP: From Data Cubes to Tag Clouds.
Proceedings of the Web Information Systems and Technologies, 4th International Conference, 2008

Collaborative OLAP with Tag Clouds - Web 2.0 OLAP Formalism and Experimental Evaluation.
Proceedings of the WEBIST 2008, 2008

Pruning attribute values from data cubes with diamond dicing.
Proceedings of the 12th International Database Engineering and Applications Symposium (IDEAS 2008), 2008

Histogram-aware sorting for enhanced word-aligned compression in bitmap indexes.
Proceedings of the DOLAP 2008, 2008

2007
Tag-Cloud Drawing: Algorithms for Cloud Visualization
CoRR, 2007

Unasssuming View-Size Estimation Techniques in OLAP
CoRR, 2007

Recursive Hashing and One-Pass, One-Hash n-Gram Count Estimation
CoRR, 2007

Introduction to the Special Issue on Canadian Semantic Web.
Comput. Intell., 2007

A Better Alternative to Piecewise Linear Time Series Segmentation.
Proceedings of the Seventh SIAM International Conference on Data Mining, 2007

UNASSSUMING view-size estimation techniques in OLAP - an experimental comparison.
Proceedings of the ICEIS 2007, 2007

A comparison of five probabilistic view-size estimation techniques in OLAP.
Proceedings of the DOLAP 2007, 2007

Removing manually generated boilerplate from electronic texts: experiments with project Gutenberg e-books.
Proceedings of the 2007 conference of the Centre for Advanced Studies on Collaborative Research, 2007

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

Attribute value reordering for efficient hybrid OLAP.
Inf. Sci., 2006

One-Pass, One-Hash n-Gram Statistics Estimation
CoRR, 2006

Analyzing Large Collections of Electronic Text Using OLAP
CoRR, 2006

2005
Collaborative filtering and inference rules for context-aware learning object recommendation.
Interact. Technol. Smart Educ., 2005

Scale and Translation Invariant Collaborative Filtering Systems.
Inf. Retr., 2005

Slope One Predictors for Online Rating-Based Collaborative Filtering.
Proceedings of the 2005 SIAM International Conference on Data Mining, 2005

Scale-Based Monotonicity Analysis in Qualitative Modelling with Flat Segments.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Quasi-Monotonic Segmentation of State Variable Behavior for Reactive Control.
Proceedings of the Proceedings, 2005

2002
Wavelet-based relative prefix sum methods for range sum queries in data cubes.
Proceedings of the 2002 conference of the Centre for Advanced Studies on Collaborative Research, September 30, 2002

2000
Wavelet time entropy, T wave morphology and myocardial ischemia.
IEEE Trans. Biomed. Eng., 2000


  Loading...