ACM Transactions on Algorithms
10 papers10 directions
ACM Transactions on Algorithms is a research venue focused on the design and analysis of algorithms, with a publication history extending from 2007 to 2025. Within the fields of machine learning and artificial intelligence, the journal provides a foundation for theoretical research into optimization and decision-making. Its contributions often center on online scheduling and resource allocation, particularly in environments characterized by uncertainty or adversarial conditions.
The venue publishes research on topics such as hierarchical scheduling for distributed task orchestration, online throughput maximization, and the intersection of continuous dynamics with discrete optimization. Specific areas of inquiry include the development of algorithms for unrelated machines and the analysis of slack and commitment in scheduling. These works frequently address the mathematical bounds and optimality of various algorithmic approaches, such as greedy algorithms in assignment problems and checkpointing strategies.
Research in this venue also explores graph theory and reconfiguration problems, including studies on sparse induced subgraphs and gap amplification. Prolific contributors include researchers such as Marcin Pilipczuk, Maria Chudnovsky, and Kevin Schewior. By focusing on the formal properties of algorithms, the journal supports the development of robust computational methods applicable to complex AI systems and resource management tasks.
Papers by Year
| 2025 | 2 |
| 2022 | 1 |
| 2020 | 1 |
| 2019 | 1 |
| 2018 | 2 |
| 2014 | 1 |
| 2012 | 1 |
| 2011 | 1 |
| 2007 | 2 |
Top Research Directions
Research directions most represented by papers from this venue.
Top Authors
| Author | Papers |
|---|---|
| Aravind Srinivasan | 1 |
| Rose McCarty | 1 |
Impactful Papers
Papers from this venue that shaped research clusters.
Influential
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden
influential
Online Scheduling with Processing Slack
2022