Sharma V. Thankachan

From MaRDI portal
Person:261368

Available identifiers

zbMath Open thankachan.sharma-vMaRDI QIDQ261368

List of research outcomes

PublicationDate of PublicationType
Ranked Document Retrieval in External Memory2023-10-23Paper
Quantum time complexity and algorithms for pattern matching on labeled graphs2023-08-04Paper
Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis2023-03-09Paper
https://portal.mardi4nfdi.de/entity/Q58744412023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q58744812023-02-07Paper
The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance2023-02-07Paper
Co-linear chaining with overlaps and gap costs2022-08-30Paper
The complexity of approximate pattern matching on de Bruijn graphs2022-08-30Paper
https://portal.mardi4nfdi.de/entity/Q50911192022-07-21Paper
The heaviest induced ancestors problem: better data structures and applications2022-06-28Paper
On the Hardness and Inapproximability of Recognizing Wheeler Graphs2022-05-11Paper
On the complexity of recognizing Wheeler graphs2022-03-22Paper
I/O-optimal categorical 3-sided skyline queries2021-11-18Paper
I/O-efficient data structures for non-overlapping indexing2021-01-25Paper
A framework for designing space-efficient dictionaries for parameterized and order-preserving matching2021-01-25Paper
Non-Overlapping Indexing - Cache Obliviously2020-12-16Paper
The Heaviest Induced Ancestors Problem Revisited2020-12-16Paper
Structural Pattern Matching - Succinctly.2020-11-25Paper
A linear-space data structure for range-LCP queries in poly-logarithmic time2020-05-23Paper
Ranked document selection2020-02-20Paper
A brief history of parameterized matching problems2020-02-14Paper
Succinct non-overlapping indexing2020-01-16Paper
A Linear Space Data Structure for Range LCP Queries*2019-01-17Paper
On Computing Average Common Substring Over Run Length Encoded Sequences2019-01-17Paper
Space-efficient indexes for forbidden extension queries2018-12-14Paper
A linear-space data structure for range-LCP queries in poly-logarithmic time2018-10-04Paper
Ranked document retrieval for multiple patterns2018-09-27Paper
pBWT: Achieving Succinct Data Structures for Parameterized Pattern Matching and Related Problems2018-07-16Paper
Space-Time Trade-Offs for the Shortest Unique Substring Problem.2018-04-19Paper
Dictionary matching with a bounded gap in pattern or in text2018-04-06Paper
Position-restricted substring searching over small alphabets2017-11-09Paper
Space-time trade-offs for finding shortest unique substrings and maximal unique matches2017-10-17Paper
https://portal.mardi4nfdi.de/entity/Q53695342017-10-17Paper
In-place algorithms for exact and approximate shortest unique substring problems2017-08-24Paper
Forbidden Extension Queries2017-07-13Paper
Top-\(k\) term-proximity in succinct space2017-07-07Paper
https://portal.mardi4nfdi.de/entity/Q57389402017-06-13Paper
Range selection and predecessor queries in data aware space and time2017-05-29Paper
Less space: indexing for queries with wildcards2016-06-27Paper
Efficient Alignment Free Sequence Comparison with Bounded Mismatches2016-06-22Paper
Reporting consecutive substring occurrences under bounded gap constraints2016-06-16Paper
Document retrieval with one wildcard2016-05-26Paper
Optimal encodings for range majority queries2016-04-06Paper
Linear-space data structures for range frequency queries on arrays and trees2016-03-23Paper
In-place algorithms for exact and approximate shortest unique substring problems2016-01-11Paper
Succinct indexes for reporting discriminating and generic words2015-10-08Paper
Top-$$k$$ Term-Proximity in Succinct Space2015-09-11Paper
Ranked Document Retrieval with Forbidden Pattern2015-08-20Paper
Succinct Non-overlapping Indexing2015-08-20Paper
Dictionary Matching with Uneven Gaps2015-08-20Paper
Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints2015-08-20Paper
Compressing dictionary matching index via sparsification technique2015-07-10Paper
Geometric BWT: compressed text indexing via sparse suffixes and range searching2015-05-26Paper
Low space data structures for geometric range mode query2015-05-22Paper
Bottom-\(k\) document retrieval2015-05-04Paper
On hardness of several string indexing problems2015-04-29Paper
Succinct Indexes for Reporting Discriminating and Generic Words2015-02-10Paper
Document Retrieval with One Wildcard2014-10-14Paper
Space-Efficient Frameworks for Top- k String Retrieval2014-09-12Paper
Ranked Document Selection2014-09-02Paper
Indexed Geometric Jumbled Pattern Matching2014-06-30Paper
On Hardness of Several String Indexing Problems2014-06-30Paper
Encodings for Range Majority Queries2014-06-30Paper
New space/time tradeoffs for top-\(k\) document retrieval on sequences2014-06-23Paper
Compressed text indexing with wildcards2014-02-03Paper
Less Space: Indexing for Queries with Wildcards2014-01-14Paper
Top-k Document Retrieval in Compact Space and Near-Optimal Time2014-01-14Paper
Compressed property suffix trees2013-12-13Paper
Faster Range LCP Queries2013-10-29Paper
Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees2013-09-20Paper
Top-k Document Retrieval in External Memory2013-09-17Paper
Indexes for Document Retrieval with Relevance2013-09-13Paper
Succinct representations of weighted trees supporting path queries2013-06-24Paper
On position restricted substring searching in succinct space2013-06-24Paper
Space-Efficient Construction Algorithm for the Circular Suffix Tree2013-06-14Paper
Faster compressed dictionary matching2013-03-04Paper
Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval2012-08-14Paper
Document Listing for Queries with Excluded Pattern2012-08-14Paper
Efficient Algorithm for Circular Burrows-Wheeler Transform2012-08-14Paper
Succinct Indexes for Circular Patterns2011-12-16Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Sharma V. Thankachan