Fast Parallel Implementation of Lazy Languages - The EQUALS Experience. - Owen Kaser; Shaunak Pawagi; C. R. Ramakrishnan 001; I. V. Ramakrishnan; R. C. Sekar 001 (LISP and Functional Programming, 1992)

Inlining to Reduce Stack Space. - Owen Kaser (PLILP, 1993)

Optimal Parallel Algorithms for Multiple Updates of Minimum Spanning Trees. - Shaunak Pawagi; Owen Kaser (Algorithmica, 1993)

On the Conversion of Indirect to Direct Recursion. - Owen Kaser; C. R. Ramakrishnan 001; Shaunak Pawagi (LOPLAS, 1993)

A High Performance Runtime System for Parallel Evaluation of Lazy Languages. - Owen Kaser; C. R. Ramakrishnan 001; R. C. Sekar 001 (PASCO, 1994)

On squashing hierarchical designs [VLSI]. - Owen Kaser (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1995)

EQUALS - A Fast Parallel Implementation of a Lazy Language. - Owen Kaser; C. R. Ramakrishnan 001; I. V. Ramakrishnan; R. C. Sekar 001 (J. Funct. Program., 1997)

Optimal Height Reduction Problems for Tree-Structured Hierarchies. - Owen Kaser (Nord. J. Comput., 1997)

A Note on "On the Conversion of Indirect to Direct Recursion". - Ting Yu; Owen Kaser (ACM Trans. Program. Lang. Syst., 1997)

Evaluating Inlining Techniques. - Owen Kaser; C. R. Ramakrishnan 001 (Comput. Lang., 1998)

State Generation in the PARMC Model Checker. - Owen Kaser (PADL, 2001)

Compressing arrays by ordering attribute values. - Owen Kaser (Inf. Process. Lett., 2004)

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)

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

Recursive Hashing and One-Pass, One-Hash n-Gram Count Estimation - Daniel Lemire; Owen Kaser (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)

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

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

Evaluating Multidimensional Queries by Diamond Dicing - Hazel Webb; Owen Kaser; Daniel Lemire (CoRR, 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)

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

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)

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)

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)

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

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)

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

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