14 citations · 71 across the 21 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014★ 2 cited
Efficient Algorithms for the Closest Pair Problem and Applications
Sanguthevar Rajasekaran, Sudipta Pathak
The closest pair problem (CPP) is one of the well studied and fundamental problems in computing. Given a set of points in a metric space, the problem is to identify the pair of clo…
cs.DS2014★ 8 cited
An error correcting parser for context free grammars that takes less than cubic time
Sanguthevar Rajasekaran, Marius Nicolae
The problem of parsing has been studied extensively for various formal grammars. Given an input string and a grammar, the parsing problem is to check if the input string belongs to…