The following pages link to Sharma V. Thankachan (Q261368):
Displaying 50 items.
- Linear-space data structures for range frequency queries on arrays and trees (Q261369) (← links)
- Optimal encodings for range majority queries (Q270016) (← links)
- Document retrieval with one wildcard (Q287451) (← links)
- Reporting consecutive substring occurrences under bounded gap constraints (Q294948) (← links)
- Less space: indexing for queries with wildcards (Q300263) (← links)
- Compressed property suffix trees (Q386003) (← links)
- Succinct indexes for reporting discriminating and generic words (Q501011) (← links)
- Space-efficient indexes for forbidden extension queries (Q1632508) (← links)
- Position-restricted substring searching over small alphabets (Q1679612) (← links)
- Dictionary matching with a bounded gap in pattern or in text (Q1709592) (← links)
- Ranked document retrieval for multiple patterns (Q1784746) (← links)
- Faster compressed dictionary matching (Q1939285) (← links)
- New space/time tradeoffs for top-\(k\) document retrieval on sequences (Q2015136) (← links)
- On the complexity of recognizing Wheeler graphs (Q2118211) (← links)
- The heaviest induced ancestors problem: better data structures and applications (Q2149106) (← links)
- Co-linear chaining with overlaps and gap costs (Q2170153) (← links)
- The complexity of approximate pattern matching on de Bruijn graphs (Q2170154) (← links)
- I/O-efficient data structures for non-overlapping indexing (Q2220773) (← links)
- A framework for designing space-efficient dictionaries for parameterized and order-preserving matching (Q2220859) (← links)
- Succinct non-overlapping indexing (Q2285052) (← links)
- A brief history of parameterized matching problems (Q2295633) (← links)
- Ranked document selection (Q2297857) (← links)
- On hardness of several string indexing problems (Q2342674) (← links)
- Bottom-\(k\) document retrieval (Q2343302) (← links)
- Low space data structures for geometric range mode query (Q2345452) (← links)
- Geometric BWT: compressed text indexing via sparse suffixes and range searching (Q2346957) (← links)
- Compressing dictionary matching index via sparsification technique (Q2354027) (← links)
- Top-\(k\) term-proximity in succinct space (Q2362352) (← links)
- Succinct representations of weighted trees supporting path queries (Q2376795) (← links)
- On position restricted substring searching in succinct space (Q2376796) (← links)
- Range selection and predecessor queries in data aware space and time (Q2397147) (← links)
- In-place algorithms for exact and approximate shortest unique substring problems (Q2399613) (← links)
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches (Q2410365) (← links)
- Compressed text indexing with wildcards (Q2434928) (← links)
- I/O-optimal categorical 3-sided skyline queries (Q2664953) (← links)
- Efficient Alignment Free Sequence Comparison with Bounded Mismatches (Q2814576) (← links)
- Indexes for Document Retrieval with Relevance (Q2848984) (← links)
- Top-k Document Retrieval in External Memory (Q2849367) (← links)
- Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees (Q2849921) (← links)
- Faster Range LCP Queries (Q2856589) (← links)
- Less Space: Indexing for Queries with Wildcards (Q2872074) (← links)
- Top-k Document Retrieval in Compact Space and Near-Optimal Time (Q2872103) (← links)
- Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval (Q2904490) (← links)
- Document Listing for Queries with Excluded Pattern (Q2904491) (← links)
- Efficient Algorithm for Circular Burrows-Wheeler Transform (Q2904499) (← links)
- Document Retrieval with One Wildcard (Q2922639) (← links)
- Ranked Document Retrieval with Forbidden Pattern (Q2942247) (← links)
- Succinct Non-overlapping Indexing (Q2942256) (← links)
- Dictionary Matching with Uneven Gaps (Q2942261) (← links)
- Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints (Q2942274) (← links)
