| Publication | Date of Publication | Type |
|---|
| Adaptive succinctness | 2024-04-19 | Paper |
scientific article; zbMATH DE number 7695994 (Why is no real title available?)
(available as arXiv preprint) | 2023-06-14 | Paper |
| Fast and simple compact hashing via bucketing | 2023-02-07 | Paper |
Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract)
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Engineering practical Lempel-Ziv tries
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
Fast and simple compact hashing via bucketing
Algorithmica | 2022-08-18 | Paper |
Adaptive succinctness
Algorithmica | 2022-03-22 | Paper |
LZ78 compression in low main memory space
String Processing and Information Retrieval | 2021-02-16 | Paper |
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
Theoretical Computer Science | 2020-10-12 | Paper |
Compact dynamic rewritable (CDRW) arrays
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
m-Bonsai: a practical compact dynamic trie
International Journal of Foundations of Computer Science | 2019-06-24 | Paper |
Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Asymptotically optimal encodings of range data structures for selection and top-\(k\) queries
ACM Transactions on Algorithms | 2018-11-05 | Paper |
| scientific article; zbMATH DE number 6876090 (Why is no real title available?) | 2018-05-29 | Paper |
Priority queues: small, monotone and trans-dichotomous
Algorithms — ESA '96 | 2017-12-05 | Paper |
Converting to and from Dilated Integers
IEEE Transactions on Computers | 2017-11-10 | Paper |
| Random access to grammar-compressed strings | 2017-09-29 | Paper |
On succinct representations of binary trees
Mathematics in Computer Science | 2017-07-17 | Paper |
| Asymptotically optimal encodings for range selection | 2017-04-25 | Paper |
Encoding range minima and range top-2 queries
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2017-01-13 | Paper |
Two dimensional range minimum queries and Fibonacci lattices
Theoretical Computer Science | 2016-06-16 | Paper |
Space efficient data structures for nearest larger neighbor
Journal of Discrete Algorithms | 2016-02-18 | Paper |
Encoding 2D range maximum queries
Theoretical Computer Science | 2015-12-08 | Paper |
SEPIA: search for proofs using inferred automata
Automated Deduction - CADE-25 | 2015-12-02 | Paper |
Succinct ordinal trees with level-ancestor queries
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Encoding Nearest Larger Values
Combinatorial Pattern Matching | 2015-08-20 | Paper |
| Succinct ordinal trees with level-ancestor queries | 2015-08-03 | Paper |
Random access to grammar-compressed strings and trees
SIAM Journal on Computing | 2015-06-11 | Paper |
Compact encodings and indexes for the nearest larger neighbor problem
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
Encoding data structures
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
Optimal indexes for sparse bit vectors
Algorithmica | 2014-11-19 | Paper |
Range extremum queries
Lecture Notes in Computer Science | 2014-08-19 | Paper |
Mining state-based models from proof corpora
Lecture Notes in Computer Science | 2014-08-07 | Paper |
Encodings for range selection and top-\(k\) queries
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Succinct representations of ordinal trees
Lecture Notes in Computer Science | 2013-09-13 | Paper |
Succinct indices for range queries with applications to orthogonal range maxima
Automata, Languages, and Programming | 2013-08-12 | Paper |
Dynamic Compressed Strings with Random Access
Automata, Languages, and Programming | 2013-08-06 | Paper |
Succinct representations of binary trees for range minimum queries
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Two Dimensional Range Minimum Queries and Fibonacci Lattices
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Succinct representations of permutations and functions
Theoretical Computer Science | 2012-08-08 | Paper |
| More haste, less waste: lowering the redundancy in fully indexable dictionaries | 2012-04-24 | Paper |
Encoding 2D range maximum queries
Lecture Notes in Computer Science | 2011-12-16 | Paper |
Optimal trade-offs for succinct string indexes
Automata, Languages and Programming | 2010-09-07 | Paper |
Universal Succinct Representations of Trees?
Automata, Languages and Programming | 2009-07-14 | Paper |
On the Size of Succinct Indices
Algorithms – ESA 2007 | 2008-09-25 | Paper |
On the Redundancy of Succinct Data Structures
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Compressed Prefix Sums
Lecture Notes in Computer Science | 2008-03-07 | Paper |
Engineering the LOUDS Succinct Tree Representation
Experimental Algorithms | 2007-09-14 | Paper |
A simple optimal representation for balanced parentheses
Theoretical Computer Science | 2007-01-22 | Paper |
Representing trees of higher degree
Algorithmica | 2006-03-21 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Analysing cache effects in distribution sorting
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
Adapting Radix Sort to the Memory Hierarchy
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
Compact routing schemes for dynamic ring networks
Theory of Computing Systems | 2005-01-25 | Paper |
Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees, Prefix Sums and Multisets
(available as arXiv preprint) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2089203 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2086622 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2038723 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 2038722 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 1848393 (Why is no real title available?) | 2003-01-05 | Paper |
| scientific article; zbMATH DE number 1830754 (Why is no real title available?) | 2002-11-18 | Paper |
| scientific article; zbMATH DE number 1256701 (Why is no real title available?) | 2002-01-17 | Paper |
| scientific article; zbMATH DE number 1670675 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1419212 (Why is no real title available?) | 2000-03-21 | Paper |
Small-Rank Selection in Parallel, with Applications to Heap Construction
Journal of Algorithms | 1999-02-02 | Paper |
Randomized Data Structures for the Dynamic Closest-Pair Problem
SIAM Journal on Computing | 1998-09-20 | Paper |
| scientific article; zbMATH DE number 1003294 (Why is no real title available?) | 1997-08-04 | Paper |
Fast deterministic selection on mesh-connected processor arrays
Algorithmica | 1996-04-28 | Paper |
A constant update time finger search tree
Information Processing Letters | 1996-02-26 | Paper |
Lower bounds for set intersection queries
Algorithmica | 1995-10-09 | Paper |
| scientific article; zbMATH DE number 437555 (Why is no real title available?) | 1994-11-29 | Paper |
| scientific article; zbMATH DE number 437544 (Why is no real title available?) | 1993-12-15 | Paper |
| scientific article; zbMATH DE number 432808 (Why is no real title available?) | 1993-10-20 | Paper |
| scientific article; zbMATH DE number 88943 (Why is no real title available?) | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 4215352 (Why is no real title available?) | 1990-01-01 | Paper |
