Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Barbay, Jérémy - School of Computer Science, University of Waterloo
Alternation and Redundancy Analysis of the Intersection Problem
Faster Adaptive Set Intersections for Text Searching
Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured
Adaptive Intersection and tThreshold Problems Jeremy Barbay # Claire Kenyon #
Alphabet Partitioning for Compressed Rank/Select and Applications
1 t k t
Instance-Optimal Geometric Algorithms Peyman Afshani
P n P n
Succinct Representation of Labeled Graphs Jrmy Barbay1
Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents
On the Use of a Computer, to Teach More and Better, in a Collective Jrmy Barbay
Deterministic Algorithm for the t-Threshold Set Jeremy Barbay1
On the discrete Bak-Sneppen model of self-organized criticality Jrmy Barbay1
Numro d'ordre : UNIVERSIT PARIS XI
n 2n + o(n) n /(n + 1)
Jrmy Barbay Curriculum Vitae
Adaptive Intersection and t-Threshold Problems Jeremy Barbay
Adaptive Searching in Succinctly Encoded Binary Relations and TreeStructured Documents #
Computational Intersection,
On the discrete BakSneppen model of selforganized criticality Jrmy Barbay 1 Claire Kenyon 1
Jrmy Barbay Curriculum Vitae
n (i)
Compressed Representations of Permutations, and Applications Jrmy Barbay and Gonzalo Navarro #
Succinct Encoding of Permutations and its Applications to Text Indexing
Faster Set Intersection Algorithms for Text Searching
Numro d'ordre : 6971 UNIVERSIT PARIS XI
Faster Set Intersection Algorithms for Text Searching #
Succinct Encoding of Permutations and its Applications to Text Indexing
educational eteaching.
Jrmy Barbay Curriculum Vitae
Adaptive Searching in Succinctly Encoded Binary Relations and TreeStructured
Optimality of Randomized Algorithms
Quick Intro to use the Database of Solved Problems $Date: 2005/03/02 20:59:58 Revision: 1.9 $
ADatabaseofSolvedProblems April15,2005
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
Deterministic Algorithm for the tThreshold Set Jeremy Barbay 1 and Claire Kenyon 2
Optimality of Randomized Algorithms
Adaptive (Analysis of) Algorithms for Convex Hulls and Related Problems.
Efficient Algorithms for Context Query Evaluation over a Tagged Corpus
Alternation and Redundancy Analysis of the Intersection Problem