S. Muthukrishnan

most citedOptimal cache-aware suffix selection

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

collaborators

2 papers

cs.DS2009★ 1 cited

Optimal cache-aware suffix selection

Gianni Franceschini, Roberto Grossi, S. Muthukrishnan

Given string $S [1.. N]$ and integer $k$ , the {\em suffix selection} problem is to determine the $k$ th lexicographically smallest amongst the suffixes $S [i ... N]$ , $1 \leq i \leq N$ .…

cs.DS2008

Range Medians

Sariel Har-Peled, S. Muthukrishnan

We study a generalization of the classical median finding problem to batched query case: given an array of unsorted $n$ items and $k$ (not necessarily disjoint) intervals in the ar…