24 citations · 82 across the 26 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.GT2018★ 1 cited
Fast Algorithms for Knapsack via Convolution and Prediction
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin +1
The \Problem{knapsack} problem is a fundamental problem in combinatorial optimization. It has been studied extensively from theoretical as well as practical perspectives as it is o…
cs.DS2018★ 1 cited
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce
Mahdi Boroujeni, Soheil Ehsani, Mohammad Ghodsi +2
The edit distance between two strings is defined as the smallest number of insertions, deletions, and substitutions that need to be made to transform one of the strings to another…