ISSAC 2026
The International Symposium on Symbolic and Algebraic Computation (ISSAC) is the premier conference for research in symbolic computation and computer algebra. ISSAC 2026 will be the 51st meeting in the series, which started in 1966 and has been held annually since 1981. The conference presents a range of invited speakers, tutorials, short communications, software demonstrations and vendor exhibits with a center-piece of contributed research papers.
ISSAC 2026 will be held from July 13th to 17th, 2026, at Oldenburg, Germany. (Wiki)
News
- November 19, 2025: First call for papers sent
- November 18, 2025: the conference website appeared online.
Important dates
Conference
| ISSAC conference: | July 13 — 17, 2026 |
Regular papers
| Abstract submission deadline: | January 23, 2026, 23:59 (anywhere on Earth) |
| Paper submission deadline: | January 30, 2026, 23:59 (anywhere on Earth) |
| First notification of acceptance/rejection: | April 17, 2026 |
| End of rebuttal phase: | April 24, 2026 |
| Final notification after rebuttal phase: | May 1, 2026 |
| Camera-ready copy due: | May 8, 2026 |
Short communications (posters)
| Abstract submission (.pdf) deadline: | May 8, 2026, 23:59 (anywhere on Earth) |
| Notification of acceptance/rejection: | May 25, 2026 |
Software presentations
| Submission software presentations: | April 24, 2026, 23:59 (anywhere on Earth) |
| Notification of acceptance/rejection: | May 25, 2026 |
Conference topics
All areas of computer algebra and symbolic computation are of interest at ISSAC 2026. These include, but are not limited to:
Algorithmic aspects:
- Exact and symbolic linear, polynomial and differential algebra
- Symbolic-numeric, homotopy, perturbation and series methods
- Computational algebraic geometry, polynomial and semialgebraic optimization
- Computational group theory and number theory, quantifier elimination and logic
- Computer arithmetic
- Summation, recurrence equations, integration, solution of ODEs & PDEs
- Symbolic methods in other areas of pure and applied mathematics
- Complexity of algebraic algorithms and algebraic complexity
Software aspects:
- Design of symbolic computation packages and systems
- Language design and type systems for symbolic computation
- Data representation
- Considerations for modern hardware
- Algorithm implementation and performance tuning
- Mathematical user interfaces
- Use with systems such as digital libraries, courseware, simulation and optimization, automated theorem-proving, computer-aided design, and automatic differentiation.
Application aspects:
- Applications that stretch the current limits of computer algebra algorithms or systems, use computer algebra in new areas or new ways, or apply it in situations with broad impact.