| Publication | Date of Publication | Type |
|---|
| Fully functional parameterized suffix trees in compact space | 2024-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187828 | 2024-01-15 | Paper |
| Ranked Document Retrieval in External Memory | 2023-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091119 | 2022-07-21 | Paper |
| I/O-optimal categorical 3-sided skyline queries | 2021-11-18 | Paper |
| A framework for designing space-efficient dictionaries for parameterized and order-preserving matching | 2021-01-25 | Paper |
| Structural Pattern Matching - Succinctly. | 2020-11-25 | Paper |
| A linear-space data structure for range-LCP queries in poly-logarithmic time | 2020-05-23 | Paper |
| Ranked document selection | 2020-02-20 | Paper |
| Succinct non-overlapping indexing | 2020-01-16 | Paper |
| A Linear Space Data Structure for Range LCP Queries* | 2019-01-17 | Paper |
| Space-efficient indexes for forbidden extension queries | 2018-12-14 | Paper |
| A linear-space data structure for range-LCP queries in poly-logarithmic time | 2018-10-04 | Paper |
| Ranked document retrieval for multiple patterns | 2018-09-27 | Paper |
| pBWT: Achieving Succinct Data Structures for Parameterized Pattern Matching and Related Problems | 2018-07-16 | Paper |
| Space-Time Trade-Offs for the Shortest Unique Substring Problem. | 2018-04-19 | Paper |
| Dictionary matching with a bounded gap in pattern or in text | 2018-04-06 | Paper |
| Position-restricted substring searching over small alphabets | 2017-11-09 | Paper |
| Space-time trade-offs for finding shortest unique substrings and maximal unique matches | 2017-10-17 | Paper |
| A Framework for Dynamic Parameterized Dictionary Matching | 2017-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369534 | 2017-10-17 | Paper |
| Forbidden Extension Queries | 2017-07-13 | Paper |
| Top-\(k\) term-proximity in succinct space | 2017-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5738940 | 2017-06-13 | Paper |
| Linear-space data structures for range frequency queries on arrays and trees | 2016-03-23 | Paper |
| Succinct indexes for reporting discriminating and generic words | 2015-10-08 | Paper |
| Top-$$k$$ Term-Proximity in Succinct Space | 2015-09-11 | Paper |
| Succinct Non-overlapping Indexing | 2015-08-20 | Paper |
| Dictionary Matching with Uneven Gaps | 2015-08-20 | Paper |
| Ranked Document Retrieval with Forbidden Pattern | 2015-08-20 | Paper |
| Visibility graphs and deformations of associahedra | 2015-08-05 | Paper |
| Compressing dictionary matching index via sparsification technique | 2015-07-10 | Paper |
| Geometric BWT: compressed text indexing via sparse suffixes and range searching | 2015-05-26 | Paper |
| Succinct indexes for reporting discriminating and generic words | 2015-02-10 | Paper |
| Space-efficient frameworks for top-\(k\) string retrieval | 2014-09-12 | Paper |
| Ranked document selection | 2014-09-02 | Paper |
| Space-Efficient Framework for Top-k String Retrieval Problems | 2014-07-25 | Paper |
| Compressed text indexing with wildcards | 2014-02-03 | Paper |
| Compressed property suffix trees | 2013-12-13 | Paper |
| Faster range LCP queries | 2013-10-29 | Paper |
| Linear-space data structures for range frequency queries on arrays and trees | 2013-09-20 | Paper |
| Top-\(k\) document retrieval in external memory | 2013-09-17 | Paper |
| Indexes for document retrieval with relevance | 2013-09-13 | Paper |
| Succinct representations of weighted trees supporting path queries | 2013-06-24 | Paper |
| On position restricted substring searching in succinct space | 2013-06-24 | Paper |
| Space-efficient construction algorithm for the circular suffix tree | 2013-06-14 | Paper |
| Faster compressed dictionary matching | 2013-03-04 | Paper |
| Document listing for queries with excluded pattern | 2012-08-14 | Paper |
| Towards an optimal space-and-query-time index for top-\(k\) document retrieval | 2012-08-14 | Paper |
| Efficient algorithm for circular Burrows-Wheeler transform | 2012-08-14 | Paper |
| On the complexity of ordinal clustering | 2012-05-30 | Paper |
| Succinct indexes for circular patterns | 2011-12-16 | Paper |
| Cache-oblivious index for approximate string matching | 2011-07-14 | Paper |
| Efficient index for retrieving top-\(k\) most frequent documents | 2011-01-20 | Paper |
| Compression, indexing, and retrieval for massive string data | 2010-07-26 | Paper |
| Cache-Oblivious Index for Approximate String Matching | 2008-06-17 | Paper |
| Compressed data structures: Dictionaries and data-aware measures | 2007-12-19 | Paper |
| A Framework for Dynamizing Succinct Data Structures | 2007-11-28 | Paper |
| Compressed Dictionaries: Space Measures, Data Sets, and Experiments | 2007-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828922 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796193 | 2003-03-02 | Paper |
| On the midpath tree conjecture: A counter-example | 2002-01-30 | Paper |
