| 2009 |
|---|
| 28 | EE | Daniel Lemire,
Owen Kaser,
Kamel Aouiche:
Sorting improves word-aligned bitmap indexes
CoRR abs/0901.3751: (2009) |
| 2008 |
|---|
| 27 | EE | Owen Kaser,
Daniel Lemire,
Kamel Aouiche:
Histogram-aware sorting for enhanced word-aligned compression in bitmap indexes.
DOLAP 2008: 1-8 |
| 26 | EE | Hazel Webb,
Owen Kaser,
Daniel Lemire:
Pruning attribute values from data cubes with diamond dicing.
IDEAS 2008: 121-129 |
| 25 | EE | Daniel Lemire,
Owen Kaser:
Hierarchical bin buffering: Online local moments for dynamic external memory arrays.
ACM Transactions on Algorithms 4(1): (2008) |
| 24 | EE | Hazel Webb,
Owen Kaser,
Daniel Lemire:
Pruning Attribute Values From Data Cubes with Diamond Dicing
CoRR abs/0805.0747: (2008) |
| 23 | EE | 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) |
| 22 | EE | Owen Kaser,
Daniel Lemire,
Kamel Aouiche:
Histogram-Aware Sorting for Enhanced Word-Aligned Compression in Bitmap Indexes
CoRR abs/0808.2083: (2008) |
| 2007 |
|---|
| 21 | EE | Owen Kaser,
Daniel Lemire:
Removing manually generated boilerplate from electronic texts: experiments with project Gutenberg e-books.
CASCON 2007: 272-275 |
| 20 | EE | Daniel Lemire,
Owen Kaser:
Recursive Hashing and One-Pass, One-Hash n-Gram Count Estimation
CoRR abs/0705.4676: (2007) |
| 19 | EE | Owen Kaser,
Daniel Lemire:
Removing Manually-Generated Boilerplate from Electronic Texts: Experiments with Project Gutenberg e-Books
CoRR abs/0707.1913: (2007) |
| 18 | EE | Owen Kaser,
Daniel Lemire:
Attribute Value Reordering For Efficient Hybrid OLAP
CoRR abs/cs/0702143: (2007) |
| 17 | EE | Owen Kaser,
Daniel Lemire:
Tag-Cloud Drawing: Algorithms for Cloud Visualization
CoRR abs/cs/0703109: (2007) |
| 2006 |
|---|
| 16 | EE | Steven Keith,
Owen Kaser,
Daniel Lemire:
Analyzing Large Collections of Electronic Text Using OLAP
CoRR abs/cs/0605127: (2006) |
| 15 | EE | Daniel Lemire,
Owen Kaser:
One-Pass, One-Hash n-Gram Statistics Estimation
CoRR abs/cs/0610010: (2006) |
| 14 | EE | Daniel Lemire,
Owen Kaser:
Hierarchical Bin Buffering: Online Local Moments for Dynamic External Memory Arrays
CoRR abs/cs/0610128: (2006) |
| 13 | EE | Owen Kaser,
Daniel Lemire:
Attribute value reordering for efficient hybrid OLAP.
Inf. Sci. 176(16): 2304-2336 (2006) |
| 2004 |
|---|
| 12 | EE | Owen Kaser:
Compressing arrays by ordering attribute values.
Inf. Process. Lett. 92(5): 253-256 (2004) |
| 2003 |
|---|
| 11 | EE | Owen Kaser,
Daniel Lemire:
Attribute value reordering for efficient hybrid OLAP.
DOLAP 2003: 1-8 |
| 2001 |
|---|
| 10 | EE | Owen Kaser:
State Generation in the PARMC Model Checker.
PADL 2001: 337-352 |
| 1998 |
|---|
| 9 | | Owen Kaser,
C. R. Ramakrishnan:
Evaluating Inlining Techniques.
Comput. Lang. 24(2): 55-72 (1998) |
| 1997 |
|---|
| 8 | EE | 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) |
| 7 | | 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) |
| 6 | | Owen Kaser:
Optimal Height Reduction Problems for Tree-Structured Hierarchies.
Nord. J. Comput. 4(4): 357-379 (1997) |
| 1995 |
|---|
| 5 | EE | Owen Kaser:
On squashing hierarchical designs [VLSI].
IEEE Trans. on CAD of Integrated Circuits and Systems 14(11): 1398-1402 (1995) |
| 1993 |
|---|
| 4 | | Owen Kaser:
Inlining to Reduce Stack Space.
PLILP 1993: 262-274 |
| 3 | | Shaunak Pawagi,
Owen Kaser:
Optimal Parallel Algorithms for Multiple Updates of Minimum Spanning Trees.
Algorithmica 9(4): 357-381 (1993) |
| 2 | EE | Owen Kaser,
C. R. Ramakrishnan,
Shaunak Pawagi:
On the Conversion of Indirect to Direct Recursion.
LOPLAS 2(1-4): 151-164 (1993) |
| 1992 |
|---|
| 1 | EE | 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 |
