Amir Abboud

View Scopus Profile

Amir Abboud

Professor

Former affiliations
 https://orcid.org/0000-0002-0502-4517

  • Rehovot

    Israel

Calculated based on number of publications stored in Pure and citations from Scopus
20192025

Research activity per year

Fingerprint

Dive into the research topics where Amir Abboud is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
  • 1 Similar Profiles
View full fingerprint

Collaborations and top research areas from the last five years

Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
Explore network further
  • 24 Conference contribution
  • 6 Article

  • On Beating 2n for the Closest Vector Problem

    Abboud, A. & Kumar, R., 2025, 8th SIAM Symposium on Simplicity of Algorithms, SOSA 2025. Bercea, I.-O. & Pagh, R. (eds.). p. 517-532 16 p. (8th SIAM Symposium on Simplicity of Algorithms, SOSA 2025).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Recognizing Sumsets is NP-Complete

    Abboud, A., Fischer, N., Safier, R. & Wallheimer, N., Jan 2025, Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025. p. 4484-4506 23 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Vol. 7).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Faster Combinatorial k-Clique Algorithms

    Abboud, A., Fischer, N. & Shechter, Y., 6 Mar 2024, (Published Online) LATIN 2024: Theoretical Informatics - 16th Latin American Symposium, 2024, Proceedings. Soto, J. A. & Wiese, A. (eds.). Springer Science and Business Media B.V., Vol. 14578. p. 193-206 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 14578 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    File
    1 Citation (Scopus)

  • From Donkeys to Kings in Tournaments

    Abboud, A., Grossman, T., Naor, M. & Solomon, T., 23 Sept 2024, 32nd Annual European Symposium on Algorithms, ESA 2024. Chan, T., Fischer, J., Iacono, J. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 14 p. 3. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 308).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    File
    10 Downloads (Pure)

  • New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms

    Abboud, A., Fischer, N., Kelley, Z., Lovett, S. & Meka, R., 10 Jun 2024, STOC 2024 - Proceedings of the 56th Annual ACM Symposium on Theory of Computing. Mohar, B., Shinkar, I. & O�Donnell, R. (eds.). p. 935-943 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    File
    1 Citation (Scopus)
    6 Downloads (Pure)
View all 30 research outputs