Diego Arroyuelo

Available identifiers

Publication	Date of Publication	Type
Trie-compressed adaptive set intersection	2024-10-21	Paper
Evaluating regular path queries on compressed adjacency matrices	2024-05-29	Paper
The ring: worst-case optimal joins in graph databases using (almost) no extra space	2024-04-30	Paper
Faster dynamic compressed \(d\)-ary relations	2024-04-19	Paper
A practical alphabet-partitioning rank/select data structure	2024-04-19	Paper
Adaptive succinctness	2024-04-19	Paper
Engineering Practical Lempel-Ziv Tries	2022-09-06	Paper
Adaptive succinctness	2022-03-22	Paper
LZ78 Compression in Low Main Memory Space	2021-02-16	Paper
Succinct Trees in Practice	2019-09-11	Paper
Succinct dynamic cardinal trees	2016-03-29	Paper
Practical approaches to reduce the space requirement of lempel-ziv--based compressed text indices	2014-04-01	Paper
Stronger Lempel-Ziv based compressed text indexing	2012-04-26	Paper
Untangled monotonic chains and adaptive range search	2011-07-27	Paper
Space-efficient construction of Lempel-Ziv compressed text indexes	2011-07-18	Paper
String Processing and Information Retrieval	2010-02-09	Paper
Untangled monotonic chains and adaptive range search	2009-12-17	Paper
An Improved Succinct Representation for Dynamic k-ary Trees	2008-06-17	Paper
A Lempel-Ziv Text Index on Secondary Storage	2008-06-17	Paper
Reducing the Space Requirement of LZ-Index	2007-09-14	Paper
Algorithms and Computation	2006-11-14	Paper

This page was built for person: Diego Arroyuelo