Canyam
AI summaries for academic research
Home
Literature Help
Subscribe
Favorites
Tools
Analysis
Summary
Patents
Patent Payment
Patent Search
Not logged in
Back
D
Daniel Lemire
Université du Québec
26
H-index
156
Paper Count
3.0K
Citation Count
0
Related Insights
Subscribe
Published Papers
12
Publication Date
Publication Date
Impact Factor
Citations
Fixing Ill-Formed UTF-16 Strings With SIMD Instructions
SOFTWARE-PRACTICE & EXPERIENCE
IF
2.7
2026-09-22
0
OA
AI
Robert Clausecker; Daniel Lemire
Share
Save
Converting Binary Floating-Point Numbers to Shortest Decimal Strings: An Experimental Review
software: practice and experience
IF
0
2026-01-29
0
OA
AI
Jaël Champagne Gareau; Daniel Lemire
Share
Save
Faster Positional-Population Counts for AVX2, AVX-512, and ASIMD
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE
IF
1.5
2025-12-25
0
OA
AI
Clausecker, Robert; Lemire, Daniel; Schintke, Florian
Share
Save
Scanning HTML at Tens of Gigabytes Per Second on ARM Processors
SOFTWARE-PRACTICE & EXPERIENCE
IF
2.7
2025-03-17
0
OA
AI
Lemire, Daniel
Share
Save
Improving Performance with Rust, Stemming a Flood of AI Papers
COMMUNICATIONS OF THE ACM
IF
12.2
2024-09-01
0
PRE
AI
Williams, Alex; Lemire, Daniel
Share
Save
Integer division by constants: optimal bounds
HELIYON
IF
3.6
2021-06-01
0
OA
AI
Lemire, Daniel; Bartlett, Colin; Kaser, Owen
Share
Save
Full Solution Indexing for Top-K Web Service Composition
IEEE TRANSACTIONS ON SERVICES COMPUTING
IF
5.8
2018-05-01
18
OA
AI
Li, Jing; Yan, Yuhong; Lemire, Daniel
Share
Save
Upscaledb: Efficient integer-key compression in a key-value store using SIMD instructions
enterprise information systems
IF
3.4
2017-06-01
4
OA
AI
Lemire, Daniel; Rupp, Christoph
Share
Save
Bloofi: Multidimensional Bloom filters
enterprise information systems
IF
3.4
2015-12-01
36
OA
AI
Crainiceanu, Adina; Lemire, Daniel
Share
Save
A General SIMD-Based Approach to Accelerating Compression Algorithms
ACM TRANSACTIONS ON INFORMATION SYSTEMS
IF
9.1
2015-03-23
22
OA
AI
Zhao, Wayne Xin; Zhang, Xudong; Lemire, Daniel; Shan, Dongdong; Nie, Jian-Yun; Yan, Hongfei; Wen, Ji-Rong
Share
Save
Recursive n-gram hashing is pairwise independent, at best
COMPUTER SPEECH AND LANGUAGE
IF
3.4
2010-10-01
16
OA
AI
Lemire, Daniel; Kaser, Owen
Share
Save
Faster retrieval with a two-pass dynamic-time-warping lower bound
PATTERN RECOGNITION
IF
7.6
2009-09-01
133
OA
AI
Lemire, Daniel
Share
Save
Research Directions
The data has not been retrieved yet.
Co-authors
Cooperation Journals
J
Ji-Rong Wen
H-index: 73 · Papers: 777
赵
赵鑫
(Wayne Xin Zhao)
H-index: 56 · Papers: 466
Jian-Yun Nie
(Jian‐Yun Nie)
H-index: 55 · Papers: 480
Y
Yuhong Yan
H-index: 21 · Papers: 99
H
Hongfei Yan
H-index: 16 · Papers: 57
View more