Looking down the Charles river with Cambridge on the left and Boston on the right. Photo courtesy of Fran Gardino.
ISSAC 2013
The International Symposium on Symbolic and Algebraic Computation is the premier conference for research in symbolic computation and computer algebra. ISSAC 2013 is the 38th meeting in the series. The conference traditionally presents a range of invited speakers, tutorials, poster sessions and software demonstrations with a centre-piece of contributed research papers.
ISSAC 2013 will be held June 26-29, 2013 at Northeastern University, Boston, Massachusetts, USA
For a map of the campus showing the buildings where the conference sessions will be held see VENUE
Important dates
Registration
| Early Registration deadline: | Monday May 20, 2013 (CLOSED) |
| Late Registration Deadline: | Sunday June 23, 2013 (CLOSED) |
| On-site Registration Opens: | Wednesday June 26, 2013 |
Regular paper
| Full paper submission deadline: | |
| Notification of acceptance/rejection: | |
| Camera-ready copy due: |
Details in the call for papers
Poster session
| Abstract submission deadline: | |
| Notification of acceptance/rejection: | |
| Camera-ready copy due: |
Full details in the call for posters
Software presentation session
| Abstract submission deadline: | |
| Notification of acceptance/rejection: | |
| Camera-ready copy due: |
Detailed submission instructions can be found in the call for software demonstrations.
Conference topics
ISSAC 2013 invites the submission of original research contributions to be considered for publication and presentation at the conference. All areas of computer algebra and symbolic mathematical computation are of interest. 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
- 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
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
- Solving equations with size constraints for the solutions, Henry Cohn, Microsoft Research, Boston, Massachussets
- Lattices with symmetry, Hendrik Lenstra, Universiteit Leiden, The Netherlands
- Critical Point Methods and Effective Real Algebraic Geometry: New Results and Trends, Mohab Safey El Din, Université Pierre et Marie Curie, Paris, France
Invited Software Speaker
- Computer Algebra: A 32-Year Update, Stephen Wolfram, Wolfram Research Inc., USA.
Tutorials
- Exact linear and integer programming, Dan Steffy, Oakland University
- The complexity of factoring univariate polynomials over the rationals., Mark van Hoeij, Florida State University
- Convex algebraic geometry and semidefinite optimization, Pablo Parrilo, Massachusetts Institute of Technology