[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/3087604acmotherconferencesBook PagePublication PagesissacConference Proceedingsconference-collections
ISSAC '17: Proceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation
ACM2017 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
ISSAC '17: International Symposium on Symbolic and Algebraic Computation Kaiserslautern Germany July 23 - 28, 2017
ISBN:
978-1-4503-5064-8
Published:
23 July 2017
In-Cooperation:

Reflects downloads up to 18 Dec 2024Bibliometrics
Skip Abstract Section
Abstract

The 2017 International Symposium on Symbolic and Algebraic Computation (ISSAC) is the premier conference for research in symbolic computation and computer algebra. ISSAC 2017, held at the University of Kaiserslautern, Kaiserslautern, Rheinland-Pfalz, Germany, is the 42nd meeting in the series. The meeting has alternated between North America and Europe, started in 1966 with the seminal ACM Symposium on Symbolic and Algebraic Manipulation and has been held annually since 1981. ISSAC is sponsored by the Association for Computer Machinery (ACM) and its Special Interest Group on Symbolic Manipulation (ACM SIGSAM).

The meeting took place from the 25th to the 28th of July 2017 and several other satellite events were organized around it.

The ISSAC meeting is a showcase for original research contributions on all aspects of computer algebra and symbolic mathematical computation, including:

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.

The conference presents a range of invited speakers, tutorials, poster sessions, software demonstrations and vendor exhibits with a center-piece of contributed research papers.

The ISSAC program committee adhered to the highest standards and practices in the evaluation of submitted papers including two or more referee reports per submission. All papers submitted to ISSAC were judged, and accepted or rejected, solely according to their scientific novelty and excellence. The program committee selected 55 papers appearing in these Proceedings. We gratefully acknowledge the thorough and important work of the Program Committee Members and external reviewers, whose names appear on the following pages, and thank all the authors of all submitted papers, tutorial and invited speakers for their contributions.

Running a large conference such as ISSAC 2017 requires the work force of many volunteers and hopefully all of them are listed on the following pages. Without their contributions, the conference would not have been possible.

We also want to remember two colleagues who recently passed away. Professor Wen-tsun Wu received his B.S. degree in mathematics from Communications University at Shanghai in 1940 and completed his National Doctor Thesis from University of Strasbourg under the direction of Charles Ehresmann. The Wu class and the Wu formula are named after him in the field of algebraic topology. In the field of automated reasoning, he is known for Wu's method of geometry theorem proving. In the field of symbolic computation, he is known for the Ritt-Wu characteristic set method for solving multivariate equations. Professor Wu was a plenary speaker at EUROCAL'87, Leipzig, GDR and ISSAC'05, Beijing, China.

Marc Rybowicz was a specialist of exact computations on curves and had a keen interest in applications such as resolution of polynomial systems, design of computer algebra languages, and cryptography. A talented researcher as well as a much-appreciated teacher, Marc had a kind, generous spirit and an ever- present willingness to help.

We will greatly miss them.

We anticipate an exciting scientific event and an impressive demonstration of the vigorous community of symbolic and algebraic computation.

Contributors
  • Clemson University
  • Sorbonne University
Please enable JavaScript to view thecomments powered by Disqus.

Recommendations

Acceptance Rates

Overall Acceptance Rate 395 of 838 submissions, 47%
YearSubmittedAcceptedRate
ISSAC '201025857%
ISSAC '15714361%
ISSAC '14965153%
ISSAC '12864653%
ISSAC '101104541%
ISSAC '03683653%
ISSAC '02863541%
ISSAC '00984041%
ISSAC '961214134%
Overall83839547%