---
title: "SODA (A*): papers and universities"
description: "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)."
url: https://scholar4ai.com/proceedings/soda
markdown_url: https://scholar4ai.com/proceedings/soda.md
license: CC BY-NC 4.0 (https://creativecommons.org/licenses/by-nc/4.0/)
share_text: "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). (as of 2026-11-02)"
data_url: https://scholar4ai.com/data/rankings.json
updated: 2026-11-02T12:20:52+09:00
window: 2026-10-04 to 2026-11-02
source: OpenAlex (CC0)
---

# 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.

All conferences: https://scholar4ai.com/proceedings.md

## 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)*

| Year | Papers | With affiliations |
|---|---:|---:|
| 2024 | 193 | 190 |
| 2025 | 193 | 189 |
| 2026 | 245 | 242 |

## Sources

*Where OpenAlex lists the papers*

| OpenAlex source | Which papers |
|---|---|
| [S4306463922](https://openalex.org/S4306463922) | Papers 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*

| # | Institution | Papers |
|---:|---|---:|
| 1 | Massachusetts Institute of Technology | 40 |
| 2 | Carnegie Mellon University | 39 |
| 3 | [Tel Aviv University](https://scholar4ai.com/institutions/tel-aviv-university.md) | 33 |
| 4 | [Stanford University](https://scholar4ai.com/institutions/stanford-university.md) | 32 |
| 5 | [Centre National de la Recherche Scientifique](https://scholar4ai.com/institutions/centre-national-de-la-recherche-scientifique.md) | 27 |
| 6 | University of Michigan | 27 |
| 7 | ETH Zurich | 26 |
| 8 | Google (United States) | 25 |
| 9 | Max Planck Institute for Informatics | 25 |
| 10 | University of California, Berkeley | 25 |

*Countries with the most SODA papers, 2024–2026*

| # | Country | Papers |
|---:|---|---:|
| 1 | United States | 357 |
| 2 | Germany | 90 |
| 3 | Israel | 78 |
| 4 | United Kingdom | 56 |
| 5 | Switzerland | 50 |
| 6 | France | 48 |
| 7 | China | 46 |
| 8 | Denmark | 33 |
| 9 | Poland | 32 |
| 10 | Austria | 31 |

*Keywords with the most SODA papers, 2024–2026*

| # | Keyword | Papers |
|---:|---|---:|
| 1 | approximation algorithms | 92 |
| 2 | lower bounds | 47 |
| 3 | randomized algorithms | 35 |
| 4 | computational complexity | 26 |
| 5 | online algorithms | 25 |
| 6 | graph partitioning | 21 |
| 7 | mechanism design | 21 |
| 8 | NP-hardness | 20 |
| 9 | competitive ratio | 20 |
| 10 | time complexity | 20 |

## Most-cited papers

*Most-cited SODA papers of 2024–2026 (citations counted by OpenAlex)*

| # | Citations | Title | Published | Authors |
|---:|---:|---|---|---|
| 1 | 100 | [New Bounds for Matrix Multiplication: from Alpha to Omega](https://doi.org/10.1137/1.9781611977912.134) | 2024-01-01 | Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu et al. |
| 2 | 36 | [More Asymmetry Yields Faster Matrix Multiplication](https://doi.org/10.1137/1.9781611978322.63) | 2025-01-01 | Josh Alman, Ran Duan, Virginia Vassilevska Williams et al. |
| 3 | 26 | [Breaking the 3/4 Barrier for Approximate Maximin Share](https://doi.org/10.1137/1.9781611977912.4) | 2024-01-01 | Hannaneh Akrami, Jugal Garg |
| 4 | 23 | [Dynamic Dynamic Time Warping](https://doi.org/10.1137/1.9781611977912.10) | 2024-01-01 | Karl Bringmann, Nick Fischer, Ivor van der Hoog et al. |
| 5 | 14 | [An Improved Classical Singular Value Transformation for Quantum Machine Learning](https://doi.org/10.1137/1.9781611977912.86) | 2024-01-01 | Ainesh Bakshi, Ewin Tang |
| 6 | 12 | [Breaking the Metric Voting Distortion Barrier](https://doi.org/10.1137/1.9781611977912.65) | 2024-01-01 | Moses Charikar, Prasanna Ramakrishnan, Kangning Wang et al. |
| 7 | 11 | [Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results](https://doi.org/10.1137/1.9781611977912.171) | 2024-01-01 | Lin Chen, Jiayi Lian, Yuchen Mao et al. |
| 8 | 11 | [Bandit Algorithms for Prophet Inequality and Pandora's Box](https://doi.org/10.1137/1.9781611977912.18) | 2024-01-01 | Khashayar Gatmiry, Thomas Keßelheim, Sahil Singla et al. |
| 9 | 10 | [Quantum Locally Recoverable Codes](https://doi.org/10.1137/1.9781611978322.188) | 2025-01-01 | Louis Golowich, Venkatesan Guruswami |
| 10 | 9 | [Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition](https://doi.org/10.1137/1.9781611977912.188) | 2024-01-01 | Tuukka Korhonen, Daniel Lokshtanov |

## 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

```bibtex
@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}
}
```

License: CC BY-NC 4.0 (https://creativecommons.org/licenses/by-nc/4.0/).