Owen Kaser

Publication Activity (10 Years)

Years Active: 1992-2020
Publications (10 Years): 10

Top Topics

Nearest Neighbor Search

Top Venues

Softw. Pract. Exp.

Data Knowl. Eng.

Publications

Daniel Lemire, Colin Bartlett, Owen Kaser
Integer Division by Constants: Optimal Bounds. CoRR (2020)
Daniel Lemire, Owen Kaser, Nathan Kurz
Faster Remainder by Direct Computation: Applications to Compilers and Software Libraries. 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, 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)
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)
Samy Chambi, Daniel Lemire, Owen Kaser, Robert Godin
Better bitmap performance with Roaring bitmaps. Softw. Pract. Exp. 46 (5) (2016)
Daniel Lemire, Gregory Ssi Yan Kai, Owen Kaser
Consistently faster and smaller compressed bitmaps with Roaring. Softw. Pract. Exp. 46 (11) (2016)
Owen Kaser, Daniel Lemire
Compressed bitmap indexes: beyond unions and intersections. Softw. Pract. Exp. 46 (2) (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)
Daniel Lemire, Owen Kaser
Faster 64-bit universal hashing using carry-less multiplications. CoRR (2015)
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)
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)
Hazel Webb, Daniel Lemire, Owen Kaser
Diamond dicing. Data Knowl. Eng. 86 (2013)
Daniel Lemire, Owen Kaser, Eduardo Gutarra
Reordering rows for better compression: Beyond the lexicographic order. ACM Trans. Database Syst. 37 (3) (2012)
Daniel Lemire, Owen Kaser, Eduardo Gutarra
Reordering Rows for Better Compression: Beyond the Lexicographic Order CoRR (2012)
Owen Kaser, Daniel Lemire
Strongly universal string hashing is fast CoRR (2012)
Daniel Lemire, Owen Kaser
Reordering columns for smaller indexes. Inf. Sci. 181 (12) (2011)
Hazel Webb, Owen Kaser, Daniel Lemire
Evaluating Multidimensional Queries by Diamond Dicing CoRR (2010)
Daniel Lemire, Owen Kaser, Kamel Aouiche
Sorting improves word-aligned bitmap indexes. Data Knowl. Eng. 69 (1) (2010)
Daniel Lemire, Owen Kaser
Recursive n-gram hashing is pairwise independent, at best. Comput. Speech Lang. 24 (4) (2010)
Daniel Lemire, Owen Kaser
Reordering Columns for Smaller Indexes CoRR (2009)
Daniel Lemire, Owen Kaser, Kamel Aouiche
Sorting improves word-aligned bitmap indexes CoRR (2009)
Hazel Webb, Owen Kaser, Daniel Lemire
Pruning attribute values from data cubes with diamond dicing. IDEAS (2008)
Hazel Webb, Owen Kaser, Daniel Lemire
Pruning Attribute Values From Data Cubes with Diamond Dicing CoRR (2008)
Daniel Lemire, Owen Kaser
Hierarchical bin buffering: Online local moments for dynamic external memory arrays. ACM Trans. Algorithms 4 (1) (2008)
Owen Kaser, Daniel Lemire, Kamel Aouiche
Histogram-Aware Sorting for Enhanced Word-Aligned Compression in Bitmap Indexes CoRR (2008)
Owen Kaser, Daniel Lemire, Kamel Aouiche
Histogram-aware sorting for enhanced word-aligned compression in bitmap indexes. DOLAP (2008)
Kamel Aouiche, Daniel Lemire, Owen Kaser
Tri de la table de faits et compression des index bitmaps avec alignement sur les mots CoRR (2008)
Owen Kaser, Daniel Lemire
Removing Manually-Generated Boilerplate from Electronic Texts: Experiments with Project Gutenberg e-Books CoRR (2007)
Owen Kaser, Daniel Lemire
Tag-Cloud Drawing: Algorithms for Cloud Visualization CoRR (2007)
Daniel Lemire, Owen Kaser
Recursive Hashing and One-Pass, One-Hash n-Gram Count Estimation CoRR (2007)
Owen Kaser, Daniel Lemire
Attribute Value Reordering For Efficient Hybrid OLAP CoRR (2007)
Owen Kaser, Daniel Lemire
Removing manually generated boilerplate from electronic texts: experiments with project Gutenberg e-books. CASCON (2007)
Owen Kaser, Daniel Lemire
Attribute value reordering for efficient hybrid OLAP. Inf. Sci. 176 (16) (2006)
Steven Keith, Owen Kaser, Daniel Lemire
Analyzing Large Collections of Electronic Text Using OLAP CoRR (2006)
Daniel Lemire, Owen Kaser
One-Pass, One-Hash n-Gram Statistics Estimation CoRR (2006)
Daniel Lemire, Owen Kaser
Hierarchical Bin Buffering: Online Local Moments for Dynamic External Memory Arrays CoRR (2006)
Owen Kaser
Compressing arrays by ordering attribute values. Inf. Process. Lett. 92 (5) (2004)
Owen Kaser, Daniel Lemire
Attribute value reordering for efficient hybrid OLAP. DOLAP (2003)
Owen Kaser
State Generation in the PARMC Model Checker. PADL (2001)
Owen Kaser, C. R. Ramakrishnan
Evaluating Inlining Techniques. Comput. Lang. 24 (2) (1998)
Owen Kaser
Optimal Height Reduction Problems for Tree-Structured Hierarchies. Nord. J. Comput. 4 (4) (1997)
Ting Yu, Owen Kaser
A Note on "On the Conversion of Indirect to Direct Recursion". ACM Trans. Program. Lang. Syst. 19 (6) (1997)
Owen Kaser, C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar
EQUALS - A Fast Parallel Implementation of a Lazy Language. J. Funct. Program. 7 (2) (1997)
Owen Kaser
On squashing hierarchical designs [VLSI]. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14 (11) (1995)
Owen Kaser, C. R. Ramakrishnan, R. C. Sekar
A High Performance Runtime System for Parallel Evaluation of Lazy Languages. PASCO (1994)
Owen Kaser
Inlining to Reduce Stack Space. PLILP (1993)
Shaunak Pawagi, Owen Kaser
Optimal Parallel Algorithms for Multiple Updates of Minimum Spanning Trees. Algorithmica 9 (4) (1993)
Owen Kaser, C. R. Ramakrishnan, Shaunak Pawagi
On the Conversion of Indirect to Direct Recursion. LOPLAS 2 (1-4) (1993)
Owen Kaser, Shaunak Pawagi, C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar
Fast Parallel Implementation of Lazy Languages - The EQUALS Experience. LISP and Functional Programming (1992)