Owen Kaser - RankMe

54 papers C 4Journal 45Unranked 5

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