Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Amir
    Last name: Abboud
    DBLP: 129/1654
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 25 of 36  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Amir Abboud, Gregory Bodwin, Seth Pettie.
    A Hierarchy of Lower Bounds for Sublinear Additive Spanners.
    Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19 2017 (0) 2017
    Conference paper
    Amir Abboud, Pawel Gawrychowski, Shay Mozes, Oren Weimann.
    Near-Optimal Compression for the Planar Graph Metric.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay.
    SETH-Based Lower Bounds for Subset Sum and Bicriteria Path.
    CoRR 2017, Volume 0 (0) 2017
    Journal article
    Amir Abboud, Aviad Rubinstein.
    Distributed PCP Theorems for Hardness of Approximation in P.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Amir Abboud, Gregory Bodwin.
    The 4/3 Additive Spanner Exponent Is Tight.
    J. ACM 2017, Volume 64 (0) 2017
    Conference paper
    Amir Abboud, Virginia Vassilevska Williams, Joshua R. Wang.
    Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs.
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Conference paper
    Amir Abboud, Gregory Bodwin.
    Error Amplification for Pairwise Spanner Lower Bounds.
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Conference paper
    Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir.
    Subtree Isomorphism Revisited.
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Conference paper
    Amir Abboud, Søren Dahlgaard.
    Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Amir Abboud, Keren Censor-Hillel, Seri Khoury.
    Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Amir Abboud, Thomas Dueholm Hansen, Virginia Vassilevska Williams, R. Ryan Williams.
    Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made.
    Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016 2016 (0) 2016
    Conference paper
    Amir Abboud, Gregory Bodwin.
    The 4/3 additive spanner exponent is tight.
    Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016 2016 (0) 2016
    Conference paper
    Amir Abboud, Gregory Bodwin, Seth Pettie.
    A Hierarchy of Lower Bounds for Sublinear Additive Spanners.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Amir Abboud, Keren Censor-Hillel, Seri Khoury.
    Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks.
    Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings 2016 (0) 2016
    Conference paper
    Amir Abboud, Søren Dahlgaard.
    Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms.
    IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA 2016 (0) 2016
    Conference paper
    Amir Abboud, R. Ryan Williams, Huacheng Yu.
    More Applications of the Polynomial Method to Algorithm Design.
    Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015 2015 (0) 2015
    Conference paper
    Amir Abboud, Fabrizio Grandoni, Virginia Vassilevska Williams.
    Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter.
    Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015 2015 (0) 2015
    Conference paper
    Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams.
    Quadratic-Time Hardness of LCS and other Sequence Similarity Measures.
    CoRR 2015, Volume 0 (0) 2015
    Journal article
    Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams.
    If the Current Clique Algorithms are Optimal, so is Valiant's Parser.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Amir Abboud, Virginia Vassilevska Williams, Huacheng Yu.
    Matching Triangles and Basing Hardness on an Extremely Popular Conjecture.
    Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015 2015 (0) 2015
    Journal article
    Amir Abboud, Virginia Vassilevska Williams, Joshua R. Wang.
    Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir.
    Subtree Isomorphism Revisited.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Amir Abboud, Thomas Dueholm Hansen, Virginia Vassilevska Williams, R. Ryan Williams.
    Simulating Branching Programs with Edit Distance and Friends or: A Polylog Shaved is a Lower Bound Made.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Amir Abboud, Gregory Bodwin.
    The 4/3 Additive Spanner Exponent is Tight.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams.
    Tight Hardness Results for LCS and Other Sequence Similarity Measures.
    IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015 2015 (0) 2015
    Show item 1 to 25 of 36  

    Your query returned 36 matches in the database.