ISSAC 2022 – International Symposium on Symbolic and Algebraic Computation
ISSAC
International Symposium on Symbolic and Algebraic Computation
ISSAC 2022
The International Symposium on Symbolic and Algebraic Computation (ISSAC) is the premier conference for research in symbolic computation and computer algebra. ISSAC 2022 will be the 47th meeting in the series, which started in 1966 and has been held annually since 1981. The conference presents a range of invited speakers, tutorials, poster sessions, software demonstrations and vendor exhibits with a center-piece of contributed research papers.
Please do not respond any mail coming from [email protected].
They are not affiliated to us in any way and are clearly fraudulent.
Quick link to easychair for posters and software presentations submission:
https://easychair.org/conferences/?conf=issac2022posterandso
Latest News
Important dates
Regular papers
Abstract submission:
January 31, 2022, 23:59 (anywhere on Earth)
Extended: February 7, 2022, 23:59 (anywhere on Earth)
Paper submission:
February 7, 2022, 23:59 (anywhere on Earth)
Extended: February 11, 2022, 23:59 (anywhere on Earth)
First notification of acceptance/rejection:
April 17, 2022
End of rebuttal phase:
May 1, 2022
Final notification after rebuttal phase:
May 8, 2022
Camera-ready copy due:
May 15, 2022
Short communications (posters) and Software presentations
Extended abstract submission (.pdf):
Monday, May 16, 2022, 23:59 (anywhere on Earth)
Extended: Friday, May 20, 2022, 23h59 (anywhere on Earth)
Extended: Sunday, May 22, 2022, 23h59 (anywhere on Earth)
Notification of acceptance/rejection:
Monday, May 23, 2022
Extended: Friday, May 27, 2022
Final version (.tex) due:
Friday, June 3, 2022
Conference topics
All areas of computer algebra and symbolic computation are of
interest at ISSAC 2022. 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, 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 for, e.g., 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.
Invited speakers
The conference features three invited talks by the following speakers:
-
Mioara Joldes, CNRS, LAAS, France.
Validated numerics: algorithms and practical applications in aerospace -
Joris van der Hoeven, CNRS, LIX, France.
On the complexity of symbolic computation -
Avi Wigderson, Institute for Advance Study, Princeton, USA.
Non-commutative Optimization: where algebra, analysis and algorithms meet
Tutorials
The conference will have three tutorials:
-
Matías Bender, TU Berlin, Germany
Solving sparse polynomial systems using Gröbner bases and resultants -
Aydın Buluç, EECS Berkeley, USA
Sparse matrices powering three pillars of science: simulation, data, and learning -
Nathalie Verdière, Université du Havre, France
Applications of computer algebra to parameter analysis of dynamical systems
Previous editions of ISSAC