- [BCS97] Algebraic Complexity Theory
- [Bur98] Completeness and Reductions in Algebraic Complexity Theory
- [AS09] Classifying Polynomials and Identity Testing
- [Sax09] Progress on Polynomial Identity Testing
- [SY10] Arithmetic Circuits: A Survey of Recent Results and Open Questions
- [CKW11] Partial Derivatives in Arithmetic Complexity and Beyond
- [Mah13] Algebraic Complexity Classes
- [Sax13] Progress on Polynomial Identity Testing - II
- [Sar14] Recent Progress on Lower Bounds for Arithmetic Circuits
- [Arv14] Noncommutative Arithmetic Circuits meet Finite Automata
- [Sap15] A Selection of Lower Bounds in Arithmetic Circuit Complexity
- [KS19] Hardness-Randomness Tradeoffs for Algebraic Computation
- [Ram20] Recent Progress on Matrix Rigidity
- [Vol22] Algebraic Natural Proofs

- WACT 2023
- WACT 2019
- WACT 2018
- NMI Workshop on Arithmetic Complexity 2017
- WACT 2016
- WACT 2015
- WACT 2014

- Dagstuhl Seminar Series
- Algebraic Methods in Computational Complexity
- TIFR Workshop on Recent Progress in Arithmetic Complexity (2014)
- Workshop on Matrix Rigidity (2020)
- School and Conference on Geometric Complexity Theory (2022)
- Algebraic Complexity Theory Workshop at ICALP 2023
- Workshop on Algebra and Computation (2023)