Call for Papers: Journal of Symbolic Computation Special Issue
on the theme of the Milestones in Computer Algebra (MICA
Following the success of the Milestones in
Computer Algebra (MICA 2016) workshop, as well as the
discussions and developments afterwards, we are soliciting papers for a
special issue of the Journal
of Symbolic Computation on the theme of the
This invitation is extended to any researcher interested in the theme of
MICA 2016, which includes but is not limited to:
The MICA 2016 acknowledged the research achievements of Erich L. Kaltofen
(North Carolina State University, USA), who has played a crucial role in
the formation and development of many of the key computer algebra
sub-disciplines presented in the workshop.
- Hybrid symbolic-numeric computation
- Exact linear algebra
- Algebraic complexity
- Polynomial factorization
- Sparse interpolation
- Papers (in pdf format) must be submitted by email to
firstname.lastname@example.org before April 30 2018.
- To facilitate a timely referee procedure, we would appreciate an
or a letter of intent to submit a paper (including author information,
tentative title and abstract, estimated page number, etc.) as early as
- Notification: Summer 2018 (expected).
- Please prepare your paper by using the JSC style files, which can be
obtained from http://www.math.ncsu.edu/~hong/jsc/JSC_LaTex.zip.
- Submitted papers should follow the guideline (see the instruction at
- All the papers will be refereed according to the JSC standards.
Instruction of the paper
Must explicitly address the following questions in succinct and informal
Make it complete (since there is no page limit):
- What is the problem?
- Why is the problem important?
- What has been done so far on the problem?
- What is the main contribution of the paper on the problem?
- Why is the contribution original?
- Why is the contribution non-trivial?
- All the related works and issues must be completely and carefully
- All the previous relevant JSC papers must be properly cited and
- All the theorem must be rigorously proved (no sketch allowed).
- All the important definitions/theorems/algorithms must be illustrated
by well chosen examples.