ISSAC

International Symposium on Symbolic and Algebraic Computation

• Home
• Special Issue
• Program
• Invited Talks
• Tutorials
• Papers
• Posters
• Awards
• Registration
• Committees

• About ISSAC
• Past Conferences

Sponsored by:

ISSAC 2023

The International Symposium on Symbolic and Algebraic Computation (ISSAC) is the premier conference for research in symbolic computation and computer algebra. ISSAC 2023 will be the 48th 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.

 

Group Photo

The original group photo can be found here.

 

Satellite Workshops

Category Theory at Work in Computational Mathematics and Theoretical Informatics will be held on June 26-30, 2023 at Bergen, Norway.

The 8th International Workshop on Satisfiability Checking and Symbolic Computation will be held on July 28, 2023 at Tromsø, Norway.

 

Latest News

• 1/7/2023: Registration was closed on June 30th, 2023
• 9/5/2023: Registration is open (see the registration tab in the menu for details.)
• 13/4/23: Last call for software presentations was sent
• 18/3/23: Second call for posters and software presentations was sent
• 6/3/23: First call for posters and software presentations was sent
• 22/1/23: Final call for papers was sent
• 6/1/23: Third call for papers was sent
• 26/11/22: Second call for papers was sent
• 17/10/22: First call for papers was sent

 

Important dates

Conference topics

All areas of computer algebra and symbolic computation are of interest at ISSAC 2023. 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.

 

Invited speakers

The conference features three invited talks by the following speakers:

• Nikhil Srivastava, UC Berkeley, USA
  The Complexity of Diagonalization
• Rekha R. Thomas, University of Washington, USA
  Classical Invariant Theory in Computer Vision
• Frank Vallentin, Universität zu Köln, Germany
  Least Distortion Euclidean Embeddings of Flat Tori

 

Tutorials

The conference will have three tutorials:

• Paola Boito, Università di Pisa, Italy
  Matrix Structures and Matrix Functions
• Irina Kogan, North Carolina State University, USA
  Invariants: Computation and Applications
• Laura Kovács, TU Wien, Austria
  Algebra-Based Loop Analysis

Previous editions of ISSAC

• Main website
• All past editions