Advanced Search
Now showing items 1-10 of 11
Asymptotically optimal encodings of range data structures for selection and Top-K queries
(Association for Computing Machinery, 2017)
Fast in-memory XPath search using compressed indexes
(Wiley-Blackwell, 2015)
Top-k Term-Proximity in Succinct Space
(Springer, 2017)
Simple and efficient fully-functional succinct trees
(Elsevier, 2016-12-20)
Path queries on functions
(Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017)
Document listing on repetitive collections with guaranteed performance
(Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017)
Fast compressed self-indexes with deterministic linear-Time construction
(Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017)
Ranked document selection
(Elsevier, 2020)
Tree path majority data structures
(Elsevier, 2020)