Daniel Lemire

ORCID

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 78

Top Venues

Publications

Yagiz Nizipli, Daniel Lemire
Parsing millions of URLs per second. Softw. Pract. Exp. 54 (5) (2024)
John Keiser, Daniel Lemire
On-demand JSON: A better way to parse documents? Softw. Pract. Exp. 54 (6) (2024)
Daniel Lemire
Exact Short Products From Truncated Multipliers. Comput. J. 67 (4) (2024)
Fatma Miladi, Valéry Psyché, Daniel Lemire
Leveraging GPT-4 for Accuracy in Education: A Comparative Study on Retrieval-Augmented Generation in MOOCs. AIED Companion (1) (2024)
John Keiser, Daniel Lemire
On-Demand JSON: A Better Way to Parse Documents? CoRR (2023)
Yagiz Nizipli, Daniel Lemire
Parsing Millions of URLs per Second. CoRR (2023)
Robert Clausecker, Daniel Lemire
Transcoding unicode characters with AVX-512 instructions. Softw. Pract. Exp. 53 (12) (2023)
Daniel Lemire
Exact Short Products From Truncated Multipliers. CoRR (2023)
Fatma Miladi, Daniel Lemire, Valéry Psyché
Learning Engagement and Peer Learning in MOOC: A Selective Systematic Review. ITS (2023)
Noble Mushtak, Daniel Lemire
Fast number parsing without fallback. Softw. Pract. Exp. 53 (7) (2023)
Noble Mushtak, Daniel Lemire
Fast Number Parsing Without Fallback. CoRR (2022)
Thomas Mueller Graf, Daniel Lemire
Binary Fuse Filters: Fast and Smaller Than Xor Filters. ACM J. Exp. Algorithmics 27 (2022)
Thomas Mueller Graf, Daniel Lemire
Binary Fuse Filters: Fast and Smaller Than Xor Filters. CoRR (2022)
Daniel Lemire, Wojciech Mula
Transcoding billions of Unicode characters per second with SIMD instructions. Softw. Pract. Exp. 52 (2) (2022)
Robert Clausecker, Daniel Lemire
Transcoding Unicode Characters with AVX-512 Instructions. CoRR (2022)
Daniel Lemire, Wojciech Mula
Transcoding Billions of Unicode Characters per Second with SIMD Instructions. CoRR (2021)
Daniel Lemire
Number parsing at a gigabyte per second. Softw. Pract. Exp. 51 (8) (2021)
Daniel Lemire
Unicode at Gigabytes per Second. SPIRE (2021)
Daniel Lemire
Number Parsing at a Gigabyte per Second. CoRR (2021)
John Keiser, Daniel Lemire
Validating UTF-8 in less than one instruction per byte. Softw. Pract. Exp. 51 (5) (2021)
Pierre-Marie Ntang, Daniel Lemire
SIMDGiraffe: Visualizing SIMD Functions. VISIGRAPP (3: IVAPP) (2021)
Marcus D. R. Klarqvist, Wojciech Mula, Daniel Lemire
Efficient computation of positional population counts using SIMD instructions. Concurr. Comput. Pract. Exp. 33 (17) (2021)
Daniel Lemire
Unicode at Gigabytes per Second. CoRR (2021)
Daniel Lemire, Colin Bartlett, Owen Kaser
Integer Division by Constants: Optimal Bounds. CoRR (2020)
John Keiser, Daniel Lemire
Validating UTF-8 In Less Than One Instruction Per Byte. CoRR (2020)
Thomas Mueller Graf, Daniel Lemire
Xor Filters. ACM J. Exp. Algorithmics 25 (2020)
Wojciech Mula, Daniel Lemire
Base64 encoding and decoding at almost the speed of a memory copy. Softw. Pract. Exp. 50 (2) (2020)
Daniel Lemire, Owen Kaser, Nathan Kurz
Faster Remainder by Direct Computation: Applications to Compilers and Software Libraries. CoRR (2019)
Wojciech Mula, Daniel Lemire
Base64 encoding and decoding at almost the speed of a memory copy. CoRR (2019)
Thomas Mueller Graf, Daniel Lemire
Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters. CoRR (2019)
Geoff Langdale, Daniel Lemire
Parsing Gigabytes of JSON per Second. CoRR (2019)
Geoff Langdale, Daniel Lemire
Parsing gigabytes of JSON per second. VLDB J. 28 (6) (2019)
Daniel Lemire, Melissa E. O'Neill
Xorshift1024*, xorshift1024+, xorshift128+ and xoroshiro128+ fail statistical tests for linearity. J. Comput. Appl. Math. 350 (2019)
Marcus D. R. Klarqvist, Wojciech Mula, Daniel Lemire
Efficient Computation of Positional Population Counts Using SIMD Instructions. CoRR (2019)
Daniel Lemire, Owen Kaser, Nathan Kurz
Faster remainder by direct computation: Applications to compilers and software libraries. Softw. Pract. Exp. 49 (6) (2019)
Daniel Lemire
Fast Random Integer Generation in an Interval. ACM Trans. Model. Comput. Simul. 29 (1) (2019)
Daniel Lemire, Nathan Kurz, Christoph Rupp
Stream VByte: Faster byte-oriented integer compression. Inf. Process. Lett. 130 (2018)
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 Conference (2018)
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. Softw. Pract. Exp. 48 (4) (2018)
Wojciech Mula, Nathan Kurz, Daniel Lemire
Faster Population Counts Using AVX2 Instructions. Comput. J. 61 (1) (2018)
Antonio Badia, Daniel Lemire
On Desirable Semantics of Functional Dependencies over Databases with Incomplete Information. Fundam. Informaticae 158 (4) (2018)
Daniel Lemire, Melissa E. O'Neill
Xorshift1024*, Xorshift1024+, Xorshift128+ and Xoroshiro128+ Fail Statistical Tests for Linearity. CoRR (2018)
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. CoRR (2018)
Daniel Lemire
Fast Random Integer Generation in an Interval. CoRR (2018)
Wojciech Mula, Daniel Lemire
Faster Base64 Encoding and Decoding Using AVX2 Instructions. ACM Trans. Web 12 (3) (2018)
Jing Li, Yuhong Yan, Daniel Lemire
Full Solution Indexing for Top-K Web Service Composition. IEEE Trans. Serv. Comput. 11 (3) (2018)
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. CoRR (2017)
Dmytro Ivanchykhin, Sergey Ignatchenko, Daniel Lemire
Regular and almost universal hashing: an efficient implementation. Softw. Pract. Exp. 47 (10) (2017)
Dara Aghamirkarimi, Daniel Lemire
Discovering the smart forests with virtual reality. WIMS (2017)
Antonio Badia, Daniel Lemire
On Desirable Semantics of Functional Dependencies over Databases with Incomplete Information. CoRR (2017)
Daniel Lemire, Christoph Rupp
Upscaledb: Efficient integer-key compression in a key-value store using SIMD instructions. Inf. Syst. 66 (2017)
Wojciech Mula, Daniel Lemire
Faster Base64 Encoding and Decoding Using AVX2 Instructions. CoRR (2017)
Daniel Lemire, Nathan Kurz, Christoph Rupp
Stream VByte: Faster Byte-Oriented Integer Compression. CoRR (2017)
Dmytro Ivanchykhin, Sergey Ignatchenko, Daniel Lemire
Regular and almost universal hashing: an efficient implementation. CoRR (2016)
Samy Chambi, Daniel Lemire, Robert Godin, Kamel Boukhalfa, Charles R. Allen, Fangjin Yang
Optimizing Druid with Roaring bitmaps. IDEAS (2016)
Samy Chambi, Daniel Lemire, Owen Kaser, Robert Godin
Better bitmap performance with Roaring bitmaps. Softw. Pract. Exp. 46 (5) (2016)
Daniel Lemire, Christoph Rupp
Upscaledb: Efficient Integer-Key Compression in a Key-Value Store using SIMD Instructions. CoRR (2016)
Samy Chambi, Daniel Lemire, Robert Godin
Vers de meilleures performances avec des Roaring bitmaps. Tech. Sci. Informatiques 35 (3) (2016)
Jing Li, Yuhong Yan, Daniel Lemire
Scaling Up Web Service Composition with the Skyline Operator. ICWS (2016)
Daniel Lemire, Gregory Ssi Yan Kai, Owen Kaser
Consistently faster and smaller compressed bitmaps with Roaring. Softw. Pract. Exp. 46 (11) (2016)
Daniel Lemire, Leonid Boytsov, Nathan Kurz
SIMD compression and the intersection of sorted integers. Softw. Pract. Exp. 46 (6) (2016)
Samy Chambi, Daniel Lemire, Robert Godin
Nouveaux modèles d'index bitmap compressés à 64 bits. EDA (2016)
Owen Kaser, Daniel Lemire
Compressed bitmap indexes: beyond unions and intersections. Softw. Pract. Exp. 46 (2) (2016)
Wojciech Mula, Nathan Kurz, Daniel Lemire
Faster Population Counts using AVX2 Instructions. CoRR (2016)
Daniel Lemire, Owen Kaser
Faster 64-bit universal hashing using carry-less multiplications. J. Cryptogr. Eng. 6 (3) (2016)
Daniel Lemire, Gregory Ssi Yan Kai, Owen Kaser
Consistently faster and smaller compressed bitmaps with Roaring. CoRR (2016)
Antonio Badia, Daniel Lemire
Functional Dependencies with null Markers. Comput. J. 58 (5) (2015)
Daniel Lemire, Leonid Boytsov
Decoding billions of integers per second through vectorization. Softw. Pract. Exp. 45 (1) (2015)
Jeff Plaisance, Nathan Kurz, Daniel Lemire
Vectorized VByte Decoding. CoRR (2015)
Xiaodan Zhu, Peter D. Turney, Daniel Lemire, André Vellino
Measuring academic influence: Not all citations are equal. CoRR (2015)
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. CoRR (2015)
Xiaodan Zhu, Peter D. Turney, Daniel Lemire, André Vellino
Measuring academic influence: Not all citations are equal. J. Assoc. Inf. Sci. Technol. 66 (2) (2015)
Adina Crainiceanu, Daniel Lemire
Bloofi: Multidimensional Bloom filters. Inf. Syst. 54 (2015)
Adina Crainiceanu, Daniel Lemire
Bloofi: Multidimensional Bloom Filters. CoRR (2015)
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 Trans. Inf. Syst. 33 (3) (2015)
Jing Li, Yuhong Yan, Daniel Lemire
A Web Service Composition Method Based on Compact K2-Trees. SCC (2015)
Perrine Ruer, Charles Gouin-Vallerand, Le Zhang, Daniel Lemire, Evelyne F. Vallières
An Analysis Tool for the Contextual Information from Field Experiments on Driving Fatigue. CONTEXT (2015)
Daniel Lemire, Owen Kaser
Faster 64-bit universal hashing using carry-less multiplications. CoRR (2015)
Daniel Lemire, Leonid Boytsov, Nathan Kurz
SIMD Compression and the Intersection of Sorted Integers. CoRR (2014)
Owen Kaser, Daniel Lemire
Compressed bitmap indexes: beyond unions and intersections. CoRR (2014)
Owen Kaser, Daniel Lemire
Threshold and Symmetric Functions over Bitmaps. CoRR (2014)
Daniel Lemire, Owen Kaser
Strongly Universal String Hashing is Fast. Comput. J. 57 (11) (2014)
Jing Li, Yuhong Yan, Daniel Lemire
Full Solution Indexing Using Database for QoS-Aware Web Service Composition. IEEE SCC (2014)
Samy Chambi, Daniel Lemire, Owen Kaser, Robert Godin
Better bitmap performance with Roaring bitmaps. CoRR (2014)
Samy Chambi, Daniel Lemire, Robert Godin, Owen Kaser
Roaring bitmap : nouveau modèle de compression bitmap. EDA (2014)
Daniel Lemire
Introductory Editorial. Open J. Inf. Syst. 1 (1) (2014)
Antonio Badia, Daniel Lemire
Functional dependencies with null markers. CoRR (2014)
Hazel Webb, Daniel Lemire, Owen Kaser
Diamond dicing. Data Knowl. Eng. 86 (2013)
Daniel Lemire, Leonid Boytsov
Decoding billions of integers per second through vectorization CoRR (2012)
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, Gaël Varoquaux, Egon L. Willighagen
Changing computational research. The challenges ahead. Source Code Biol. Medicine 7 (2012)
Daniel Lemire, Owen Kaser, Eduardo Gutarra
Reordering rows for better compression: Beyond the lexicographic order. ACM Trans. Database Syst. 37 (3) (2012)
Zoltán Prekopcsák, Daniel Lemire
Time series classification by class-specific Mahalanobis distance measures. Adv. Data Anal. Classif. 6 (3) (2012)
Daniel Lemire, Owen Kaser, Eduardo Gutarra
Reordering Rows for Better Compression: Beyond the Lexicographic Order CoRR (2012)
Daniel Lemire
The universality of iterated hashing over variable-length strings. Discret. Appl. Math. 160 (4-5) (2012)
Owen Kaser, Daniel Lemire
Strongly universal string hashing is fast CoRR (2012)
Antonio Badia, Daniel Lemire
A Call to Arms: Revisiting Database Design CoRR (2011)
Daniel Lemire, Owen Kaser
Reordering columns for smaller indexes. Inf. Sci. 181 (12) (2011)
Antonio Badia, Daniel Lemire
A call to arms: revisiting database design. SIGMOD Rec. 40 (3) (2011)
Daniel Lemire, André Vellino
Extracting, Transforming and Archiving Scientific Data CoRR (2011)
Hazel Webb, Owen Kaser, Daniel Lemire
Evaluating Multidimensional Queries by Diamond Dicing CoRR (2010)

Daniel Lemire.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Daniel Lemire