Advanced Search
Now showing items 1-10 of 11
Fast in-memory XPath search using compressed indexes
(Wiley-Blackwell, 2015)
Fast compressed self-indexes with deterministic linear-Time construction
(Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017)
Optimal Encodings for Range Majority Queries
(Springer, 2016)
Ranked document selection
(Elsevier, 2020)
Tree path majority data structures
(Elsevier, 2020)
Simple and efficient fully-functional succinct trees
(Elsevier, 2016-12-20)
Top-k Term-Proximity in Succinct Space
(Springer, 2017)
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)