| Tag-cloud drawing: Algorithms for cloud visualization O Kaser, D Lemire arXiv preprint cs/0703109, 2007 | 344 | 2007 |
| Better bitmap performance with roaring bitmaps S Chambi, D Lemire, O Kaser, R Godin Software: practice and experience 46 (5), 709-719, 2016 | 261 | 2016 |
| Sorting improves word-aligned bitmap indexes D Lemire, O Kaser, K Aouiche Data & Knowledge Engineering 69 (1), 3-28, 2010 | 184 | 2010 |
| Roaring bitmaps: Implementation of an optimized software library D Lemire, O Kaser, N Kurz, L Deri, C O'Hara, F Saint‐Jacques, ... Software: Practice and Experience 48 (4), 867-895, 2018 | 87 | 2018 |
| Consistently faster and smaller compressed bitmaps with roaring D Lemire, G Ssi‐Yan‐Kai, O Kaser Software: Practice and Experience 46 (11), 1547-1569, 2016 | 79 | 2016 |
| Evaluating inlining techniques O Kaser, CR Ramakrishnan Computer Languages 24 (2), 55-72, 1998 | 54* | 1998 |
| Reordering columns for smaller indexes D Lemire, O Kaser Information Sciences 181 (12), 2550-2570, 2011 | 49 | 2011 |
| Optimal parallel algorithms for multiple updates of minimum spanning trees S Pawagi, O Kaser Algorithmica 9, 357-381, 1993 | 49 | 1993 |
| On the conversion of indirect to direct recursion O Kaser, CR Ramakrishnan, S Pawagi ACM Letters on Programming Languages and Systems (LOPLAS) 2 (1-4), 151-164, 1993 | 49 | 1993 |
| Reordering rows for better compression: Beyond the lexicographic order D Lemire, O Kaser, E Gutarra ACM Transactions on Database Systems (TODS) 37 (3), 1-29, 2012 | 46 | 2012 |
| Analyzing large collections of electronic text using OLAP S Keith, O Kaser, D Lemire arXiv preprint cs/0605127, 2006 | 46* | 2006 |
| Strongly universal string hashing is fast D Lemire, O Kaser The Computer Journal 57 (11), 1624-1638, 2014 | 39 | 2014 |
| Recursive n-gram hashing is pairwise independent, at best D Lemire, O Kaser Computer Speech & Language 24 (4), 698-710, 2010 | 39 | 2010 |
| Attribute value reordering for efficient hybrid OLAP O Kaser, D Lemire Proceedings of the 6th ACM international workshop on Data warehousing and …, 2003 | 34 | 2003 |
| Fast parallel implementation of lazy languages—the EQUALS experience O Kaser, S Pawagi, CR Ramakrishnan, IV Ramakrishnan, RC Sekar Proceedings of the 1992 ACM conference on LISP and functional programming …, 1992 | 34 | 1992 |
| Faster 64-bit universal hashing using carry-less multiplications D Lemire, O Kaser Journal of Cryptographic Engineering 6, 171-185, 2016 | 28 | 2016 |
| Compressed bitmap indexes: beyond unions and intersections O Kaser, D Lemire Software: Practice and Experience 46 (2), 167-198, 2016 | 27 | 2016 |
| Faster remainder by direct computation: Applications to compilers and software libraries D Lemire, O Kaser, N Kurz Software: Practice and Experience 49 (6), 953-970, 2019 | 23 | 2019 |
| Histogram-aware sorting for enhanced word-aligned compression in bitmap indexes O Kaser, D Lemire, K Aouiche Proceedings of the ACM 11th international workshop on Data warehousing and …, 2008 | 18 | 2008 |
| EQUALS–a fast parallel implementation of a lazy language O Kaser, CR Ramakrishnan, IV Ramakrishnan, RC Sekar Journal of Functional Programming 7 (2), 183-217, 1997 | 14 | 1997 |
Daniel LemireProfessor of Computer Science, Data Science Laboratory, Université du Québec (TELUQ)Verified email at uqam.ca
