1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.CC2019★ 1 cited
Subcubic Equivalences Between Graph Centrality Measures and Complementary Problems
Mahdi Boroujeni, Sina Dehghani, Soheil Ehsani +2
Despite persistent efforts, there is no known technique for obtaining unconditional super-linear lower bounds for the computational complexity of the problems in P. Vassilevska Wil…
cs.DS2018
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…