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 10 of 44  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Amir Abboud, Gregory Bodwin.
    Reachability Preservers: New Extremal Bounds and Approximation Algorithms.
    Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018 2018 (0) 2018
    Conference paper
    Amir Abboud, Pawel Gawrychowski, Shay Mozes, Oren Weimann.
    Near-Optimal Compression for the Planar Graph Metric.
    Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018 2018 (0) 2018
    Conference paper
    Amir Abboud, Aviad Rubinstein.
    Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds.
    9th Innovations in Theoretical Computer Science Conference, ITCS 2018, January 11-14, 2018, Cambridge, MA, USA 2018 (0) 2018
    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, Gregory Bodwin.
    Reachability Preservers: New Extremal Bounds and Approximation Algorithms.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann.
    Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-and-Solve.
    58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017 2017 (0) 2017
    Show item 1 to 10 of 44  

    Your query returned 44 matches in the database.