Owen Kaser

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2012
j14		Daniel Lemire, Owen Kaser, Eduardo Gutarra: Reordering rows for better compression: Beyond the lexicographic order. ACM Trans. Database Syst. 37(3): 20 (2012)
i15		Owen Kaser, Daniel Lemire: Strongly universal string hashing is fast. CoRR abs/1202.4961 (2012)
i14		Daniel Lemire, Owen Kaser, Eduardo Gutarra: Reordering Rows for Better Compression: Beyond the Lexicographic Order. CoRR abs/1207.2189 (2012)
	2011
j13		Daniel Lemire, Owen Kaser: Reordering columns for smaller indexes. Inf. Sci. 181(12): 2550-2570 (2011)
	2010
j12		Daniel Lemire, Owen Kaser: Recursive n-gram hashing is pairwise independent, at best. Computer Speech & Language 24(4): 698-710 (2010)
j11		Daniel Lemire, Owen Kaser, Kamel Aouiche: Sorting improves word-aligned bitmap indexes. Data Knowl. Eng. 69(1): 3-28 (2010)
i13		Hazel Webb, Owen Kaser, Daniel Lemire: Evaluating Multidimensional Queries by Diamond Dicing. CoRR abs/1006.3726 (2010)
	2009
i12		Daniel Lemire, Owen Kaser, Kamel Aouiche: Sorting improves word-aligned bitmap indexes. CoRR abs/0901.3751 (2009)
i11		Daniel Lemire, Owen Kaser: Reordering Columns for Smaller Indexes. CoRR abs/0909.1346 (2009)
	2008
j10		Daniel Lemire, Owen Kaser: Hierarchical bin buffering: Online local moments for dynamic external memory arrays. ACM Transactions on Algorithms 4(1) (2008)
c7		Owen Kaser, Daniel Lemire, Kamel Aouiche: Histogram-aware sorting for enhanced word-aligned compression in bitmap indexes. DOLAP 2008: 1-8
c6		Hazel Webb, Owen Kaser, Daniel Lemire: Pruning attribute values from data cubes with diamond dicing. IDEAS 2008: 121-129
i10		Hazel Webb, Owen Kaser, Daniel Lemire: Pruning Attribute Values From Data Cubes with Diamond Dicing. CoRR abs/0805.0747 (2008)
i9		Kamel Aouiche, Daniel Lemire, Owen Kaser: Tri de la table de faits et compression des index bitmaps avec alignement sur les mots. CoRR abs/0805.3339 (2008)
i8		Owen Kaser, Daniel Lemire, Kamel Aouiche: Histogram-Aware Sorting for Enhanced Word-Aligned Compression in Bitmap Indexes. CoRR abs/0808.2083 (2008)
	2007
c5		Owen Kaser, Daniel Lemire: Removing manually generated boilerplate from electronic texts: experiments with project Gutenberg e-books. CASCON 2007: 272-275
i7		Daniel Lemire, Owen Kaser: Recursive Hashing and One-Pass, One-Hash n-Gram Count Estimation. CoRR abs/0705.4676 (2007)
i6		Owen Kaser, Daniel Lemire: Removing Manually-Generated Boilerplate from Electronic Texts: Experiments with Project Gutenberg e-Books. CoRR abs/0707.1913 (2007)
i5		Owen Kaser, Daniel Lemire: Attribute Value Reordering For Efficient Hybrid OLAP. CoRR abs/cs/0702143 (2007)
i4		Owen Kaser, Daniel Lemire: Tag-Cloud Drawing: Algorithms for Cloud Visualization. CoRR abs/cs/0703109 (2007)
	2006
j9		Owen Kaser, Daniel Lemire: Attribute value reordering for efficient hybrid OLAP. Inf. Sci. 176(16): 2304-2336 (2006)
i3		Steven Keith, Owen Kaser, Daniel Lemire: Analyzing Large Collections of Electronic Text Using OLAP. CoRR abs/cs/0605127 (2006)
i2		Daniel Lemire, Owen Kaser: One-Pass, One-Hash n-Gram Statistics Estimation. CoRR abs/cs/0610010 (2006)
i1		Daniel Lemire, Owen Kaser: Hierarchical Bin Buffering: Online Local Moments for Dynamic External Memory Arrays. CoRR abs/cs/0610128 (2006)
	2004
j8		Owen Kaser: Compressing arrays by ordering attribute values. Inf. Process. Lett. 92(5): 253-256 (2004)
	2003
c4		Owen Kaser, Daniel Lemire: Attribute value reordering for efficient hybrid OLAP. DOLAP 2003: 1-8
	2001
c3		Owen Kaser: State Generation in the PARMC Model Checker. PADL 2001: 337-352
	1998
j7		Owen Kaser, C. R. Ramakrishnan: Evaluating Inlining Techniques. Comput. Lang. 24(2): 55-72 (1998)
	1997
j6		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): 183-217 (1997)
j5		Owen Kaser: Optimal Height Reduction Problems for Tree-Structured Hierarchies. Nord. J. Comput. 4(4): 357-379 (1997)
j4		Ting Yu, Owen Kaser: A Note on "On the Conversion of Indirect to Direct Recursion". ACM Trans. Program. Lang. Syst. 19(6): 1085-1087 (1997)
	1995
j3		Owen Kaser: On squashing hierarchical designs [VLSI]. IEEE Trans. on CAD of Integrated Circuits and Systems 14(11): 1398-1402 (1995)
	1993
j2		Shaunak Pawagi, Owen Kaser: Optimal Parallel Algorithms for Multiple Updates of Minimum Spanning Trees. Algorithmica 9(4): 357-381 (1993)
j1		Owen Kaser, C. R. Ramakrishnan, Shaunak Pawagi: On the Conversion of Indirect to Direct Recursion. LOPLAS 2(1-4): 151-164 (1993)
c2		Owen Kaser: Inlining to Reduce Stack Space. PLILP 1993: 262-274
	1992
c1		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: 335-344

Coauthor Index

1	Kamel Aouiche	[j11] [i12] [c7] [i9] [i8]
2	Eduardo Gutarra	[j14] [i14]
3	Steven Keith	[i3]
4	Daniel Lemire	[j14] [i15] [i14] [j13] [j12] [j11] [i13] [i12] [i11] [j10] [c7] [c6] [i10] [i9] [i8] [c5] [i7] [i6] [i5] [i4] [j9] [i3] [i2] [i1] [c4]
5	Shaunak Pawagi	[j2] [j1] [c1]
6	C. R. Ramakrishnan	[j7] [j6] [j1] [c1]
7	I. V. Ramakrishnan	[j6] [c1]
8	R. C. Sekar	[j6] [c1]
9	Hazel Webb	[i13] [c6] [i10]
10	Ting Yu	[j4]

Colors in the list of coauthors

Last update Wed May 22 07:07:53 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page