Popular conjectures imply strong lower bounds for dynamic problems A Abboud, VV Williams 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 434-443, 2014 | 291 | 2014 |

Tight hardness results for LCS and other sequence similarity measures A Abboud, A Backurs, VV Williams 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 59-78, 2015 | 193* | 2015 |

Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs A Abboud, VV Williams, J Wang Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 127 | 2016 |

Subcubic equivalences between graph centrality problems, APSP and diameter A Abboud, F Grandoni, VV Williams Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 124 | 2014 |

More applications of the polynomial method to algorithm design A Abboud, R Williams, H Yu Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 124 | 2014 |

Consequences of faster alignment of sequences A Abboud, VV Williams, O Weimann International Colloquium on Automata, Languages, and Programming, 39-51, 2014 | 123 | 2014 |

Matching triangles and basing hardness on an extremely popular conjecture A Abboud, VV Williams, H Yu SIAM Journal on Computing 47 (3), 1098-1122, 2018 | 102 | 2018 |

Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made A Abboud, TD Hansen, VV Williams, R Williams Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 86 | 2016 |

If the current clique algorithms are optimal, so is Valiant's parser A Abboud, A Backurs, VV Williams SIAM Journal on Computing 47 (6), 2527-2555, 2018 | 75 | 2018 |

Distributed PCP theorems for hardness of approximation in P A Abboud, A Rubinstein, R Williams 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 25-36, 2017 | 66 | 2017 |

The 4/3 additive spanner exponent is tight A Abboud, G Bodwin Journal of the ACM (JACM) 64 (4), 1-20, 2017 | 63 | 2017 |

Near-linear lower bounds for distributed distance computations, even in sparse networks A Abboud, K Censor-Hillel, S Khoury International Symposium on Distributed Computing, 29-42, 2016 | 61 | 2016 |

A hierarchy of lower bounds for sublinear additive spanners A Abboud, G Bodwin, S Pettie SIAM Journal on Computing 47 (6), 2203-2236, 2018 | 49 | 2018 |

Popular conjectures as a barrier for dynamic planar graph algorithms A Abboud, S Dahlgaard 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 49 | 2016 |

Geometric monitoring of heterogeneous streams D Keren, G Sagy, A Abboud, D Ben-David, A Schuster, I Sharfman, ... IEEE Transactions on Knowledge and Data Engineering 26 (8), 1890-1903, 2013 | 46 | 2013 |

SETH-based lower bounds for subset sum and bicriteria path A Abboud, K Bringmann, D Hermelin, D Shabtay Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 43 | 2019 |

Losing weight by gaining edges A Abboud, K Lewi, R Williams European Symposium on Algorithms, 1-12, 2014 | 43 | 2014 |

Exact weight subgraphs and the k-sum conjecture A Abboud, K Lewi International Colloquium on Automata, Languages, and Programming, 1-12, 2013 | 41 | 2013 |

Subtree isomorphism revisited A Abboud, A Backurs, TD Hansen, V Vassilevska Williams, O Zamir ACM Transactions on Algorithms (TALG) 14 (3), 1-23, 2018 | 31 | 2018 |

More consequences of falsifying SETH and the orthogonal vectors conjecture A Abboud, K Bringmann, H Dell, J Nederlof Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 24 | 2018 |