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

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
  • 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 proceedingConference contributionpeer-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).

    Weizmann Institute of Science

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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).

    Weizmann Institute of Science

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    File
  • From Donkeys to Kings in Tournaments

    Abboud, A., Grossman, T., Naor, M. & Solomon, T., 23 Sep 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).

    Weizmann Institute of Science, Tel Aviv University

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • 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).

    Weizmann Institute of Science

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access