R. Shah

most citedOn Optimal Top-K String Retrieval

6 citations · 6 across the 1 of their papers we have counts for

collaborators

2 papers

cs.DS2016

Parameterized Pattern Matching -- Succinctly

Arnab Ganguly, Rahul Shah, Sharma V. Thankachan

We consider the $P a r am e t er i z e d$ $P a tt er n$ $M a t c hin g$ problem, where a pattern $P$ matches some location in a text $T$ iff there is a one-to-one correspondence between the…

cs.DS2012★ 6 cited

On Optimal Top-K String Retrieval

Rahul Shah, Cheng Sheng, Sharma V. Thankachan +1

Let $D$ = ${d_{1}, d_{2}, d_{3}, ..., d_{D}}$ be a given set of $D$ (string) documents of total length $n$ . The top- $k$ document retrieval problem is to index $D$ such that…