Scholar4AI Updated 2026-11-02 12:20 UTC+09:00

SODA: ACM/SIAM Symposium on Discrete Algorithms — papers and institutions, 2024–2026

Papers of SODA, ACM/SIAM Symposium on Discrete Algorithms (CORE rank A*; field: Theory of computation), 2024–2026: per year, the institutions, countries and topics, and the most-cited papers. Ranks are those of the CORE Conference Rankings, edition ICORE2026 (portal.core.edu.au), applied to every year shown. Papers are the works OpenAlex lists for the conference's proceedings, or for the issues of a conference-linked journal that publishes its papers (such as PACMPL, PVLDB or ACM TOG), by publication year; workshops, companion volumes, posters and Findings are left out. A paper counts once for each institution and country among its authors' affiliations as OpenAlex assigns them; papers without affiliations in OpenAlex count for none. For conferences published in book series that OpenAlex files as one source (LNCS, LIPIcs, SIAM and IOS Press proceedings), the papers are found by DOI: those of the volumes with the conference's title in Crossref, or LIPIcs DOIs, which name the conference. Conferences without DOIs (PMLR, USENIX, OpenReview) are listed without counts. A dash (–) for a year means OpenAlex has no papers of the conference for it yet: the proceedings are not published or indexed yet, or the conference did not meet that year (some meet every other year). 2026 counts what OpenAlex had indexed by 2026-11-02. Also as Markdown.

Share: X LinkedIn Bluesky Threads Facebook Reddit Hacker News Hatena LINE Email
Copy:

← All conferences

Key findings#

  • SODA (ACM/SIAM Symposium on Discrete Algorithms) is rated A* by the CORE Conference Rankings (ICORE2026); OpenAlex lists 631 of its papers from 2024–2026 (193 in 2024, 193 in 2025, 245 in 2026).
  • By the countries of the authors' institutions, the most papers come from the United States (357), Germany (90) and Israel (78).
  • The institutions with the most papers are Massachusetts Institute of Technology (40), Carnegie Mellon University (39) and Tel Aviv University (33).
  • Its most-cited paper of these years is “New Bounds for Matrix Multiplication: from Alpha to Omega” (2024), with 100 citations.

Papers per year#

SODA papers per publication year in OpenAlex (–: not in OpenAlex yet)
YearPapersWith affiliations
2024193190
2025193189
2026245242

Sources#

Where OpenAlex lists the papers
OpenAlex sourceWhich papers
S4306463922Papers of the volumes titled “Proceedings of the <year> Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)” (SIAM), found by DOI through Crossref

Who publishes there#

Institutions with the most SODA papers, 2024–2026
#InstitutionPapers
1Massachusetts Institute of Technology40
2Carnegie Mellon University39
3Tel Aviv University33
4Stanford University32
5Centre National de la Recherche Scientifique27
6University of Michigan27
7ETH Zurich26
8Google (United States)25
9Max Planck Institute for Informatics25
10University of California, Berkeley25
Countries with the most SODA papers, 2024–2026
#CountryPapers
1United States357
2Germany90
3Israel78
4United Kingdom56
5Switzerland50
6France48
7China46
8Denmark33
9Poland32
10Austria31
Keywords with the most SODA papers, 2024–2026
#KeywordPapers
1approximation algorithms92
2lower bounds47
3randomized algorithms35
4computational complexity26
5online algorithms25
6graph partitioning21
7mechanism design21
8NP-hardness20
9competitive ratio20
10time complexity20

Most-cited papers#

Most-cited SODA papers of 2024–2026 (citations counted by OpenAlex)
#CitationsTitlePublishedAuthors
1100New Bounds for Matrix Multiplication: from Alpha to Omega2024-01-01Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu et al.
236More Asymmetry Yields Faster Matrix Multiplication2025-01-01Josh Alman, Ran Duan, Virginia Vassilevska Williams et al.
326Breaking the 3/4 Barrier for Approximate Maximin Share2024-01-01Hannaneh Akrami, Jugal Garg
423Dynamic Dynamic Time Warping2024-01-01Karl Bringmann, Nick Fischer, Ivor van der Hoog et al.
514An Improved Classical Singular Value Transformation for Quantum Machine Learning2024-01-01Ainesh Bakshi, Ewin Tang
612Breaking the Metric Voting Distortion Barrier2024-01-01Moses Charikar, Prasanna Ramakrishnan, Kangning Wang et al.
711Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results2024-01-01Lin Chen, Jiayi Lian, Yuchen Mao et al.
811Bandit Algorithms for Prophet Inequality and Pandora's Box2024-01-01Khashayar Gatmiry, Thomas Keßelheim, Sahil Singla et al.
910Quantum Locally Recoverable Codes2025-01-01Louis Golowich, Venkatesan Guruswami
109Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition2024-01-01Tuukka Korhonen, Daniel Lokshtanov

Conferences in the same field#

STOC · ICALP · EC · KR · FOCS · SoCG · CAV · LICS · ESA · ITCS · APPROX/RANDOM · STACS · IJCAR · CCC · GD · SAT · ALENEX

Cite this page

Scholar4AI. (2026). SODA: ACM/SIAM Symposium on Discrete Algorithms — papers and institutions, 2024–2026. Journal and Conference Research Rankings. Retrieved November 2, 2026, from https://scholar4ai.com/proceedings/soda

@misc{scholar4ai-proceedings-soda,
  author = {{Scholar4AI}},
  title = {SODA: ACM/SIAM Symposium on Discrete Algorithms — papers and institutions, 2024–2026},
  year = {2026},
  howpublished = {\url{https://scholar4ai.com/proceedings/soda}},
  urldate = {2026-11-02},
  note = {Journal and Conference Research Rankings; data from OpenAlex (CC0); licensed CC BY-NC 4.0}
}

Free to reuse for non-commercial purposes with attribution (CC BY-NC 4.0).