default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOwen Kaser
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[i23]Daniel Lemire, Colin Bartlett, Owen Kaser:
Integer Division by Constants: Optimal Bounds. CoRR abs/2012.12369 (2020)
2010 – 2019
- 2019
- [j22]Daniel Lemire
, Owen Kaser, Nathan Kurz:
Faster remainder by direct computation: Applications to compilers and software libraries. Softw. Pract. Exp. 49(6): 953-970 (2019) - [i22]Daniel Lemire, Owen Kaser, Nathan Kurz:
Faster Remainder by Direct Computation: Applications to Compilers and Software Libraries. CoRR abs/1902.01961 (2019) - 2018
- [j21]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): 867-895 (2018) - 2017
- [i21]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 abs/1709.07821 (2017) - 2016
- [j20]Daniel Lemire, Owen Kaser:
Faster 64-bit universal hashing using carry-less multiplications. J. Cryptogr. Eng. 6(3): 171-185 (2016) - [j19]Owen Kaser, Daniel Lemire:
Compressed bitmap indexes: beyond unions and intersections. Softw. Pract. Exp. 46(2): 167-198 (2016) - [j18]Samy Chambi, Daniel Lemire, Owen Kaser, Robert Godin:
Better bitmap performance with Roaring bitmaps. Softw. Pract. Exp. 46(5): 709-719 (2016) - [j17]Daniel Lemire, Gregory Ssi Yan Kai, Owen Kaser:
Consistently faster and smaller compressed bitmaps with Roaring. Softw. Pract. Exp. 46(11): 1547-1569 (2016) - [i20]Daniel Lemire, Gregory Ssi Yan Kai, Owen Kaser:
Consistently faster and smaller compressed bitmaps with Roaring. CoRR abs/1603.06549 (2016) - 2015
- [i19]Daniel Lemire, Owen Kaser:
Faster 64-bit universal hashing using carry-less multiplications. CoRR abs/1503.03465 (2015) - 2014
- [j16]Daniel Lemire, Owen Kaser:
Strongly Universal String Hashing is Fast. Comput. J. 57(11): 1624-1638 (2014) - [c9]Samy Chambi, Daniel Lemire, Robert Godin, Owen Kaser:
Roaring bitmap : nouveau modèle de compression bitmap. EDA 2014: 37-50 - [i18]Owen Kaser, Daniel Lemire:
Threshold and Symmetric Functions over Bitmaps. CoRR abs/1402.4073 (2014) - [i17]Owen Kaser, Daniel Lemire:
Compressed bitmap indexes: beyond unions and intersections. CoRR abs/1402.4466 (2014) - [i16]Samy Chambi, Daniel Lemire, Owen Kaser, Robert Godin:
Better bitmap performance with Roaring bitmaps. CoRR abs/1402.6407 (2014) - 2013
- [j15]Hazel Webb, Daniel Lemire, Owen Kaser:
Diamond dicing. Data Knowl. Eng. 86: 1-18 (2013) - 2012
- [j14]Daniel Lemire, Owen Kaser, Eduardo Gutarra:
Reordering rows for better compression: Beyond the lexicographic order. ACM Trans. Database Syst. 37(3): 20:1-20:29 (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. Comput. Speech Lang. 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)
2000 – 2009
- 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 Trans. Algorithms 4(1): 14:1-14:31 (2008) - [c8]Owen Kaser, Daniel Lemire, Kamel Aouiche:
Histogram-aware sorting for enhanced word-aligned compression in bitmap indexes. DOLAP 2008: 1-8 - [c7]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
- [c6]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
- [c5]Owen Kaser, Daniel Lemire:
Attribute value reordering for efficient hybrid OLAP. DOLAP 2003: 1-8 - 2001
- [c4]Owen Kaser:
State Generation in the PARMC Model Checker. PADL 2001: 337-352
1990 – 1999
- 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. Comput. Aided Des. Integr. Circuits Syst. 14(11): 1398-1402 (1995) - 1994
- [c3]Owen Kaser, C. R. Ramakrishnan, R. C. Sekar:
A High Performance Runtime System for Parallel Evaluation of Lazy Languages. PASCO 1994: 234-243 - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
