Owen Kaser

According to our database, Owen Kaser authored at least 38 papers between 1992 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2020

Integer Division by Constants: Optimal Bounds.

Daniel Lemire, Colin Bartlett, Owen Kaser

CoRR, 2020

2019

Faster remainder by direct computation: Applications to compilers and software libraries.

Daniel Lemire, Owen Kaser, Nathan Kurz

Softw. Pract. Exp., 2019

2018

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

2016

Consistently faster and smaller compressed bitmaps with Roaring.

Daniel Lemire, Gregory Ssi Yan Kai, Owen Kaser

Softw. Pract. Exp., 2016

Compressed bitmap indexes: beyond unions and intersections.

Owen Kaser, Daniel Lemire

Softw. Pract. Exp., 2016

Better bitmap performance with Roaring bitmaps.

Samy Chambi, Daniel Lemire, Owen Kaser, Robert Godin

Softw. Pract. Exp., 2016

Faster 64-bit universal hashing using carry-less multiplications.

Daniel Lemire, Owen Kaser

J. Cryptogr. Eng., 2016

2014

Threshold and Symmetric Functions over Bitmaps.

Owen Kaser, Daniel Lemire

CoRR, 2014

Strongly Universal String Hashing is Fast.

Daniel Lemire, Owen Kaser

Comput. J., 2014

Roaring bitmap : nouveau modèle de compression bitmap.

Samy Chambi, Daniel Lemire, Robert Godin, Owen Kaser

Proceedings of the Actes des 10e journées francophones sur les Entrepôts de Données et l'Analyse en Ligne, 2014

2013

Diamond dicing.

Hazel Webb, Daniel Lemire, Owen Kaser

Data Knowl. Eng., 2013

2012

Reordering rows for better compression: Beyond the lexicographic order.

Daniel Lemire, Owen Kaser, Eduardo Gutarra

ACM Trans. Database Syst., 2012

2011

Reordering columns for smaller indexes.

Daniel Lemire, Owen Kaser

Inf. Sci., 2011

2010

Sorting improves word-aligned bitmap indexes.

Daniel Lemire, Owen Kaser, Kamel Aouiche

Data Knowl. Eng., 2010

Recursive n-gram hashing is pairwise independent, at best.

Daniel Lemire, Owen Kaser

Comput. Speech Lang., 2010

Evaluating Multidimensional Queries by Diamond Dicing

Hazel Webb, Owen Kaser, Daniel Lemire

CoRR, 2010

2008

Hierarchical bin buffering: Online local moments for dynamic external memory arrays.

Daniel Lemire, Owen Kaser

ACM Trans. Algorithms, 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

Pruning attribute values from data cubes with diamond dicing.

Hazel Webb, Owen Kaser, Daniel Lemire

Proceedings of the 12th International Database Engineering and Applications Symposium (IDEAS 2008), 2008

Histogram-aware sorting for enhanced word-aligned compression in bitmap indexes.

Owen Kaser, Daniel Lemire, Kamel Aouiche

Proceedings of the DOLAP 2008, 2008

2007

Tag-Cloud Drawing: Algorithms for Cloud Visualization

Owen Kaser, Daniel Lemire

CoRR, 2007

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

Daniel Lemire, Owen Kaser

CoRR, 2007

Removing manually generated boilerplate from electronic texts: experiments with project Gutenberg e-books.

Owen Kaser, Daniel Lemire

Proceedings of the 2007 conference of the Centre for Advanced Studies on Collaborative Research, 2007

2006

Attribute value reordering for efficient hybrid OLAP.

Owen Kaser, Daniel Lemire

Inf. Sci., 2006

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

Daniel Lemire, Owen Kaser

CoRR, 2006

Analyzing Large Collections of Electronic Text Using OLAP

Steven Keith, Owen Kaser, Daniel Lemire

CoRR, 2006

2004

Compressing arrays by ordering attribute values.

Owen Kaser

Inf. Process. Lett., 2004

2001

State Generation in the PARMC Model Checker.

Owen Kaser

Proceedings of the Practical Aspects of Declarative Languages, 2001

1998

Evaluating Inlining Techniques.

Owen Kaser, C. R. Ramakrishnan

Comput. Lang., 1998

1997

A Note on "On the Conversion of Indirect to Direct Recursion".

Ting Yu, Owen Kaser

ACM Trans. Program. Lang. Syst., 1997

Optimal Height Reduction Problems for Tree-Structured Hierarchies.

Owen Kaser

Nord. J. Comput., 1997

EQUALS - A Fast Parallel Implementation of a Lazy Language.

Owen Kaser, C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar

J. Funct. Program., 1997

1995

On squashing hierarchical designs [VLSI].

Owen Kaser

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1995

1994

A High Performance Runtime System for Parallel Evaluation of Lazy Languages.

Owen Kaser, C. R. Ramakrishnan, R. C. Sekar

Proceedings of the First International Symposium on Parallel Symbolic Computation, 1994

1993

On the Conversion of Indirect to Direct Recursion.

Owen Kaser, C. R. Ramakrishnan, Shaunak Pawagi

LOPLAS, 1993

Optimal Parallel Algorithms for Multiple Updates of Minimum Spanning Trees.

Shaunak Pawagi, Owen Kaser

Algorithmica, 1993

Inlining to Reduce Stack Space.

Owen Kaser

Proceedings of the Programming Language Implementation and Logic Programming, 1993

1992

Fast Parallel Implementation of Lazy Languages - The EQUALS Experience.

Owen Kaser, Shaunak Pawagi, C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar

Proceedings of the Conference on Lisp and Functional Programming, 1992