6 citations · 17 across the 6 of their papers we have counts for
7 papers
ZigZag Trie: A Novel Index for Contextual Queries
Ling Li, Daniel Gibney, Sharma V. Thankachan +3
There is increasing interest in queries about the context of a string in a longer text , i.e., the set of all string pairs , with , for a given , such t…
Parameterized Pattern Matching -- Succinctly
Arnab Ganguly, Rahul Shah, Sharma V. Thankachan
We consider the problem, where a pattern matches some location in a text iff there is a one-to-one correspondence between the…
Probabilistic Threshold Indexing for Uncertain Strings
Sharma V. Thankachan, Manish Patil, Rahul Shah +1
Strings form a fundamental data type in computer systems. String searching has been extensively studied since the inception of computer science. Increasingly many applications have…
On Optimal Top-K String Retrieval
Rahul Shah, Cheng Sheng, Sharma V. Thankachan +1
Let = be a given set of (string) documents of total length . The top- document retrieval problem is to index such that…
Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval
Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan
Let $\D = $ be a given set of string documents of total length , our task is to index $\D$, such that the most relevant documents for an online quer…
Fully Dynamic Data Structure for Top-k Queries on Uncertain Data
Manish Patil, Rahul Shah, Sharma V. Thankachan
Top- queries allow end-users to focus on the most important (top-) answers amongst those which satisfy the query. In traditional databases, a user defined score function assi…
Visibility graphs and deformations of associahedra
Satyan L. Devadoss, Rahul Shah, Xuancheng Shao +1
The associahedron is a convex polytope whose face poset is based on nonintersecting diagonals of a convex polygon. In this paper, given an arbitrary simple polygon P, we construct…