Name
Papers
Collaborators
OWEN KASER
35
19
Citations 
PageRank 
Referers 
325
24.02
771
Referees 
References 
837
628
Search Limit
100837
Title
Citations
PageRank
Year
Faster Remainder by Direct Computation: Applications to Compilers and Software Libraries.40.462019
Roaring Bitmaps: Implementation of an Optimized Software Library.40.432018
Compressed bitmap indexes: beyond unions and intersections00.342016
Consistently faster and smaller compressed bitmaps with Roaring.100.572016
Better bitmap performance with Roaring bitmaps311.042016
Faster 64-bit universal hashing using carry-less multiplications.50.502015
Roaring bitmap : nouveau modèle de compression bitmap.00.342014
Threshold and Symmetric Functions over Bitmaps.00.342014
Strongly Universal String Hashing is Fast.00.342014
Diamond dicing.00.342013
Reordering rows for better compression: Beyond the lexicographic order160.762012
Strongly universal string hashing is fast60.462012
Sorting improves word-aligned bitmap indexes521.602010
Recursive n-gram hashing is pairwise independent, at best80.562010
Evaluating Multidimensional Queries by Diamond Dicing00.342010
Reordering columns for smaller indexes130.652009
Histogram-aware sorting for enhanced word-aligned compression in bitmap indexes80.552008
Tri de la table de faits et compression des index bitmaps avec alignement sur les mots00.342008
Pruning attribute values from data cubes with diamond dicing30.392008
Tag-Cloud Drawing: Algorithms for Cloud Visualization885.112007
Attribute value reordering for efficient hybrid OLAP110.652007
Removing manually generated boilerplate from electronic texts: experiments with project Gutenberg e-books10.372007
Recursive Hashing and One-Pass, One-Hash n-Gram Count Estimation00.342007
Analyzing Large Collections of Electronic Text Using OLAP140.882006
Hierarchical bin buffering: Online local moments for dynamic external memory arrays20.362006
One-Pass, One-Hash n-Gram Statistics Estimation00.342006
Compressing arrays by ordering attribute values10.372004
State Generation in the PARMC Model Checker00.342001
Evaluating inlining techniques130.811998
EQUALS – a fast parallel implementation of a lazy language30.491997
Optimal height reduction problems for tree-structured hierarchies00.341997
A note on “On the conversion of indirect to direct recursion”20.521997
Optimal Parallel Algorithms for Multiple Updates of Minimum Spanning Trees120.801993
On the conversion of indirect to direct recursion141.361993
Inlining to Reduce Stack Space40.611993