Last update:
Sat Jun 8 15:04:10 MDT 2024
Lee E. Heindel and
Paul W. Purdom, Jr. The automatic optimization of SLIP
routines . . . . . . . . . . . . . . . . 21--30
F. H. Sage and
D. V. Smith The introduction of a paging technique
into the symmetric list processor, SLIP 34--46
S. James Clark Symbolic solution of a system of first
order linear differential equations . . 13--18
G. E. Collins Algorithmic approaches to symbolic
integration and simplification: summary
of the panel session sponsored by SIGSAM
at the FJCC in San Francisco, December
10, 1968 . . . . . . . . . . . . . . . . 5--16
Joachim Neubüser From the SIGSAM Subcommittee on
Computation of Algebraic Structures . . 17--17
John J. Cannon A critique of algebraic programming
languages . . . . . . . . . . . . . . . 18--27
Robert J. Plemmons A survey of computer applications to
semigroups and related structures . . . 28--39
J. Nievergelt and
F. Fischer and
M. I. Irland and
J. R. Sidlo NUCLEOL --- a minimal list processor . . 40--52
M. M. Ludeman PL/I utility programs for Formac
applications . . . . . . . . . . . . . . 53--58
K. Bahr A smaller FORTRAN--FORMAC system . . . . 59--60
Joel Moses The integration of a class of special
functions with the Risch algorithm . . . 14--27
Anthony C. Hearn Standard LISP (reprint) . . . . . . . . 28--49
Joel Moses Summary of the 1969 FJCC SIGSAM--SIGART
technical session . . . . . . . . . . . 4--10
J. Nievergelt Software for graph processing . . . . . 11--12
A. R. LeSchack Response from A. R. LeSchack . . . . . . 13--16
F. W. Blair and
J. H. Griesmer and
R. D. Jenks An interactive facility for symbolic
mathematics . . . . . . . . . . . . . . 17--18
Herbert J. Bernstein Ludeman's PL/I FORMAC gradient problem
as handled by FORTRAN SYMBOLANG . . . . 19--34
R. G. Tobey Historical note on gradient evaluation 35--35
Harry Eisenpress and
Abel Bomberault Practical symbolic differentiation of
large expressions using PL/I Formac . . 36--61
Joel Moses The function of FUNCTION in LISP or why
the FUNARG problem should be called the
environment problem . . . . . . . . . . 13--27
Stig Flodmark and
Esko Blokker Use of computers in treating
nonnumerical mathematics and group
theoretical problems in physics . . . . 28--63
James C. Howard Relativistic applications of symbolic
mathematical computation . . . . . . . . 64--83
Lee E. Heindel Algorithms for exact polynomial root
calculation . . . . . . . . . . . . . . 9--9
R. D. Jenks META/LISP: an interactive translator
writing system . . . . . . . . . . . . . 10--18
Joyce Friedman Fortran implementation of the Kay
context-free parser . . . . . . . . . . 19--45
Peter Schnupp Practical formula manipulation for
theoretical chemistry . . . . . . . . . 27--29
Erik Sandewall A proposed solution to the FUNARG
problem . . . . . . . . . . . . . . . . 29--42
Knut Bahr An algebraic simplification program in
PL/I . . . . . . . . . . . . . . . . . . 43--50
W. Morven Gentleman Optimal multiplication chains for
computing a power of a symbolic
polynomial . . . . . . . . . . . . . . . 23--30
Lucien A. Dimino A graphical approach to coset
enumeration . . . . . . . . . . . . . . 8--43
L. D. Neidleman A user's examination of the formula
manipulation language --- SYMBAL . . . . 8--24
T. E. Cheatham, Jr. and
Ben Wegbreit A laboratory for the study of automating
programming . . . . . . . . . . . . . . 8--26
E. M. Greenawalt An overlay facility for LISP programs 27--31
Rüdiger Loos Analytic treatment of three similar
Fredholm integral equations of the
second kind with Reduce 2 . . . . . . . 32--40
J. A. Campbell Problem #2 --- the Y$_{2n}$ functions 8--9
André M. L. LaPlace PL/I list processing used as interactive
system support . . . . . . . . . . . . . 10--24
Richard J. Fateman Rationally simplifying non-rational
expressions . . . . . . . . . . . . . . 8--9
Anthony C. Hearn An Improved Non-Modular Polynomial GCD
Algorithm . . . . . . . . . . . . . . . 10--15
Rüdiger Loos Algebraic algorithm descriptions as
programs . . . . . . . . . . . . . . . . 16--24
B. F. Caviness and
G. E. Collins Symbolic mathematical computation in a
Ph.D. Computer Science program . . . . . 25--28
W. S. Brown and
A. D. Hall ALTRAN . . . . . . . . . . . . . . . . . 4--7
S. R. Bourne CAMAL . . . . . . . . . . . . . . . . . 8--11
R. J. Fateman MACSYMA . . . . . . . . . . . . . . . . 12--13
A. C. Hearn REDUCE . . . . . . . . . . . . . . . . . 14--15
R. D. Jenks SCRATCHPAD . . . . . . . . . . . . . . . 16--17
Y. Sundblad SYMBAL . . . . . . . . . . . . . . . . . 18--19
W. H. Jeffreys TRIGMAN . . . . . . . . . . . . . . . . 20--21
E. Horowitz SAC-1 . . . . . . . . . . . . . . . . . 22--24
Anthony C. Hearn A REDUCE Solution of Problem #2 --- The
$ Y_{2n} $ Functions . . . . . . . . . . 14
David Barton and
Anthony C. Hearn Comment on Problem #2 --- The $ Y_{2n} $
Functions . . . . . . . . . . . . . . . ??
R. J. Fateman Reply to an editorial . . . . . . . . . 9--11
David Barton Problem #4: the Lie transform . . . . . 12--13
J. A. Campbell Problem #5: a problem in differentiation
arising from the Runge--Kutta--Nyström
method . . . . . . . . . . . . . . . . . 13--14
Knut Bahr An interesting bug in FORMAC . . . . . . 23--24
John Fitch and
Arthur Norman An idea for comparing data structures 17--18
David Y. Y. Yun On algorithms for solving systems of
polynomial equations . . . . . . . . . . 19--25
Knut A. Bahr A speed-up of FORMAC . . . . . . . . . . 26--29
John Fitch Problems #3 and #4 in REDUCE and MACSYMA 10--11
D. P. McCarthy Problem #6 --- the Kiang problem . . . . 12--12
W. Tuttens Solution to problem #2: with ``a
subroutine package for polynomial
manipulation'' (Polman) . . . . . . . . 13--13
Yngve Sundblad One user's one-algorithm comparison of
six algebraic systems on the
Y$_{2n}$-problem . . . . . . . . . . . . 14--20
Paul S. Wang and
L. Preiss Rothschild Factoring multivariate polynomials over
the integers . . . . . . . . . . . . . . 21--29
Richard J. Fateman A case history in interactive
problem-solving . . . . . . . . . . . . 30--32
R. P. van de Riet The automatic solution of partial
differential equations by means of
Taylor series using formula-manipulation
methods . . . . . . . . . . . . . . . . 33--36
J. Denbigh Starkey A solution to Kiang's problem #6 . . . . 2--3
S. C. Johnson and
R. L. Graham Problem #7 . . . . . . . . . . . . . . . 4--4
J. A. van Hulzen FORMAC today, or what can happen to an
orphan . . . . . . . . . . . . . . . . . 5--7
D. Barton and
J. P. Fitch Algebraic manipulation in Cambridge . . 8--9
Knut A. Bahr Toward a revision of FORMAC . . . . . . 10--16
A. D. Hall and
S. C. Johnson ALTRAN programs for SIGSAM problem #6 12--36
R. Fateman and
J. Moses and
P. Wang Solution to problem #7 using MACSYMA . . 14--16
G. E. Collins and
D. R. Musser and
M. Rothstein SAC-1 solution of problem #7 . . . . . . 17--19
R. D. Jenks The SCRATCHPAD language . . . . . . . . 20--30
Jaap Smit Introduction to NETFORM . . . . . . . . 31--36
Yngve Sundblad Symbolic mathematical systems now and in
the future . . . . . . . . . . . . . . . 1--8
Ruediger G. K. Loos Toward a formal implementation of
computer algebra . . . . . . . . . . . . 9--16
Knut Bahr and
Jaap Smit Tuning an algebraic manipulation system
through measurements . . . . . . . . . . 17--23
Nisse Husberg and
Jouko Seppänen ANALITIK: principal features of the
language and its implementation . . . . 24--25
W. S. Brown On computing with factored rational
expressions . . . . . . . . . . . . . . 26--34
Andrew D. Hall, Jr. Factored rational expressions in ALTRAN 35--45
Alfonso Miola and
David Y. Y. Yun Computational aspects of Hensel-type
univariate polynomial greatest common
divisor algorithms . . . . . . . . . . . 46--54
H. Strubbe Presentation of the SCHOONSCHIP system 55--60
W. Morven Gentleman Experience with truncated power series 61--62
Stephen C. Johnson Sparse polynomial arithmetic . . . . . . 63--71
Dorothea A. Klip Different polynomial representations and
their interaction in the portable
algebra system PORT-ALG . . . . . . . . 72--73
Jacques Calmet Computer Recognition of Divergences in
Feynman Diagrams . . . . . . . . . . . . 74--75
I. Frick A non-numerical computation involving
sums of many products of finite rotation
matrices for spin $ 3 / 2 $ . . . . . . 76--77
H. Ian Cohen A perturbation calculation in general
relativity . . . . . . . . . . . . . . . 78--79
George E. Collins Quantifier elimination for real closed
fields by cylindrical algebraic
decomposition--preliminary report . . . 80--90
Dennis Weeks Formal representations for algebraic
numbers . . . . . . . . . . . . . . . . 91--95
P. Verbaeten The automatic construction of pure
recurrence relations . . . . . . . . . . 96--98
Edward W. Ng Symbolic integration of a class of
algebraic functions . . . . . . . . . . 99--102
Alfonso Miola The use of symbolic computation in
solving free boundary problems by the
Ritz--Galerkin method . . . . . . . . . 103--104
Joel Moses MACSYMA --- the fifth year . . . . . . . 105--110
John Fitch Problem #8: random walk . . . . . . . . 11--11
James H. Griesmer and
Richard D. Jenks A solution to problem #4: the lie
transform . . . . . . . . . . . . . . . 12--13
John Fitch A solution of problem #3 using CAMAL . . 14--25
John Fitch A simple method of taking $n$ th roots
of integers . . . . . . . . . . . . . . 26--26
David Y. Y. Yun A $p$-adic division with remainder
algorithm . . . . . . . . . . . . . . . 27--32
A. C. Norman Solutions to problem 8 . . . . . . . . . 7--9
Richard Zippel A MACSYMA solution to problem 8 . . . . 10--12
Arthur C. Norman The SCRATCHPAD power series package . . 13--20
Knut Bahr Utilizing the FORMAC novelties . . . . . 21--24
Knut Bahr Solution to problem 8 . . . . . . . . . 6--6
John Fitch and
Arthur Norman Double by single length division . . . . 7--7
P. Verbaeten Computing real zeros of polynomials with
SAC-1 . . . . . . . . . . . . . . . . . 8--10
J. A. Campbell Automatic programming in LISP . . . . . 11--13
J. A. van Hulzen Special purpose differentiation
algorithms . . . . . . . . . . . . . . . 14--18
Stuart I. Feldman An application of symbolic computation
to crystal physics . . . . . . . . . . . 19--24
John Fitch Course notes . . . . . . . . . . . . . . 4--8
Richard D. Jenks Course outline: Yale University, New
Haven . . . . . . . . . . . . . . . . . 9--10
W. Kahan Problem #9: an ellipse problem . . . . . 11--12
Rudiger Loos Problem #10: the cattle problem of
Archimedes . . . . . . . . . . . . . . . 11--12
J. H. Griesmer and
R. D. Jenks and
D. Y. Y. Yun A SCRATCHPAD solution to problem #7 . . 13--17
B. F. Caviness More on computing roots of integers . . 18--20
Paul S. Wang Factoring multivariate polynomials over
algebraic number fields in MACSYMA . . . 21--23
J. H. Griesmer and
R. D. Jenks and
David Y. Y. Yun A FORMAT statement in SCRATCHPAD . . . . 24--25
J. T. Schwartz What programmers should know . . . . . . 26--27
S. C. Johnson A note on abnormal polynomial remainder
sequences . . . . . . . . . . . . . . . 28--29
Bauke Hiemstra A pre-editor for CAMAL . . . . . . . . . 30--34
Donald E. Knuth Son of Seminumerical Algorithms . . . . 10--11
J. Heintz and
R. Wüthrich An efficient quantifier elimination
algorithm for algebraically closed
fields of any characteristic . . . . . . 11--11
Stuart I. Feldman A brief description of Altran . . . . . 12--20
Max Engeli An enhanced SYMBAL system . . . . . . . 21--29
M. Rochon and
H. Strubbe Solution to SIGSAM problem no. 5 using
SCHOONSCHIP . . . . . . . . . . . . . . 30--38
A. D. Hall ALTRAN solution to problem #8 . . . . . 39--40
James H. Griesmer Symbolic mathematical computation --- a
survey . . . . . . . . . . . . . . . . . 30--32
Richard J. Fateman Final problem set excerpts . . . . . . . 14--14
Paul S. Wang Implications of symbolic computation for
the teaching of mathematics . . . . . . 15--18
B. Buchberger A theoretical basis for the reduction of
polynomials to canonical forms . . . . . 19--29
Jukka Korpela General characteristics of the ANALITIK
language . . . . . . . . . . . . . . . . 30--48
Rüdiger Loos and
J. Neubüser Group theoretical computations in
mathematical crystallography . . . . . . 11--18
B. Buchberger Some properties of Gröbner-bases for
polynomial ideals . . . . . . . . . . . 19--24
Michael Rothstein and
B. F. Caviness A structure theorem for exponential and
primitive functions a preliminary report 25--28
Henry Kanoui Some aspects of symbolic integration via
predicate logic programming . . . . . . 29--42
Paul S. Wang Factoring larger multivariate
polynomials . . . . . . . . . . . . . . 42--42
Horst G. Zimmer Factorization of polynomials according
to a method of Zassenhaus' . . . . . . . 43--45
J. A. Campbell Compact storage for computations
involving partitions . . . . . . . . . . 46--47
David R. Stoutemyer Automatic simplification for the
absolute-value function and its
relatives . . . . . . . . . . . . . . . 48--49
Gianna Cioni and
Alfonso Miola Using minicomputers for algebraic
computations . . . . . . . . . . . . . . 50--52
Rüdiger Loos Abstracts . . . . . . . . . . . . . . . 3--7
Rüdiger Loos Author's solution of Archimedes' cattle
problem . . . . . . . . . . . . . . . . 4--7
Kenneth L. Manders The impact of complexity theory on
algorithms for sparse polynomials . . . 8--15
Richard D. Jenks On the design of a mode-based symbolic
system . . . . . . . . . . . . . . . . . 16--19
R. Shtokhamer Attempts in local simplification of non
nested radicals . . . . . . . . . . . . 20--40
Siegfried M. Rump Real root isolation for algebraic
polynomials . . . . . . . . . . . . . . 2--3
Paul S. Wang An efficient squarefree decomposition
algorithm . . . . . . . . . . . . . . . 4--6
Rüdiger Loos 1977 MACSYMA users' conference . . . . . 7--13
Markus Lauer A solution to Kahan's problem (SIGSAM
problem No. 9) . . . . . . . . . . . . . 16--20
G. Tim Hagen A simple problem . . . . . . . . . . . . 20--21
H. J. Gawlik The further development of MIRA . . . . 22--28
B. F. Caviness and
H. I. Epstein A note on the complexity of algebraic
differentiation . . . . . . . . . . . . 4--6
Jukka Korpela Some problems connected with ambiguous
expressions . . . . . . . . . . . . . . 7--9
Rüdiger Loos ABSTRACTS (Amsterdam 78) . . . . . . . . 3--6
K. A. Bahr New Release of FORMAC 73 Available . . . 6--6
S. J. Harrington REDUCE Solution to Problem #8 . . . . . 7--8
Maurice Mignotte How to find algebraic integers whose
conjugates lie near the unit circle? . . 9--10
F. Teixeira de Queiroz The use of formula manipulation systems
to compute asymptotic expansions . . . . 11--15
F. T. de Queroz The Use of Formula Manipulation Systems
to Compute Asymptotic Expansions . . . . 11--16
David L. Hall and
B. Craig Meyers A Method for Determining the
Coefficients of a Reversed Power Series 16--19
R. Shtokhamer The use of ``LET'' statements in
producing short comprehensible outputs 20--22
V. Felsch A KWIC Indexed Bibliography on the Use
of Computers in Group Theory and Related
Topics . . . . . . . . . . . . . . . . . 23--86
Rüdiger Loos Abstracts (REDUCE newsletter 1.1978) . . 86--88
Paul S. Wang Abstracts . . . . . . . . . . . . . . . 8--9
Paul S. Wang Seminar on Introduction to Symbolic and
Algebraic Manipulation . . . . . . . . . 10--12
Paul S. Wang Abstracts . . . . . . . . . . . . . . . 13--17
B. F. Caviness and
M. J. Prelle A note on algebraic independence of
logarithmic and exponential constants 18--20
Morton A. Hirschberg The evaluation, manipulation and
identification of nondimensional numbers 21--26
C. Kollreider and
B. Buchberger An improved algorithmic construction of
Gröbner-bases for polynomial ideals . . . 27--36
Paul S. Wang SIAM 1978 national meeting: invited
lectures . . . . . . . . . . . . . . . . 6--7
Richard J. Fateman Is a LISP Machine Different from a
FORTRAN Machine? . . . . . . . . . . . . 8--11
Dorothea A. Klip A comparative study of algorithms for
sparse polynomial multiplication . . . . 12--24
Robert Moenck Is a linked list the best storage
structure for an algebra system? . . . . 20--24
J. H. Griesmer and
R. D. Jenks and
D. Y. Y. Yun A taxonomy for algebraic computation . . 25--28
Alkiviadis G. Akritas A short note on a new method for
polynomial real root isolation . . . . . 12--13
Arthur Norman Towards a REDUCE solution to SIGSAM
Problem 7 . . . . . . . . . . . . . . . 14--18
F. Teixeira de Queiroz Advanced tests for algorithms of
differentiation . . . . . . . . . . . . 19--22
Jon L. White LISP/370: a short technical description
of the implementation . . . . . . . . . 23--27
Paul S. Wang Abstracts . . . . . . . . . . . . . . . 12--13
H. James Gawlik Comments on the open letter from Fateman
to Veltman . . . . . . . . . . . . . . . 14--15
R. D. Jenks SCRATCHPAD/360: reflections on a
language design . . . . . . . . . . . . 16--26
Steven J. Harrington A Symbolic Limit Evaluation Program in
REDUCE . . . . . . . . . . . . . . . . . 27--31
Jarl Jensen On the formulation and solution of shell
problems by means of computerized
algebraic manipulation . . . . . . . . . 13--13
P. Raulefs and
J. Siekmann and
P. Szabó and
E. Unvericht A short survey on the state of the art
in matching and unification problems . . 14--20
F. D. Gakhov Review of ``Calculus of Integrals of
Higher Transcendental Functions (The
Theory and Tables of Formulas), by O. I.
Marichev'', Minsk, Nauka i Tekhnika,
1978 . . . . . . . . . . . . . . . . . . 7--7
David R. Stoutemyer Computer symbolic math & education: a
radical proposal . . . . . . . . . . . . 8--24
James H. Griesmer The state of symbolic computation . . . 25--28
Anonymous Book review . . . . . . . . . . . . . . ??
Paul S. Wang EUROSAM'79 conference proceedings . . . 8--15
J. H. Davenport Anatomy of an integral . . . . . . . . . 16--18
A. C. Norman Testing word-sized numbers for primality 19--20
Lawrence A. Weber and
Gerhard Rayna Problem #11 Solved in REDUCE: a Case
Study in Program Translation . . . . . . 21--24
Paul S. Wang Titles and abstracts: mathematical
symbolic manipulation on the computer
and applications . . . . . . . . . . . . 6--7
Ned Anderson and
Paul S. Wang MACSYMA experiments with a modified
Khachian-type algorithm in linear
programming . . . . . . . . . . . . . . 8--13
Jim Purtilo On implementing arbitrary precision
arithmetic in NIL: an exercise in data
abstraction . . . . . . . . . . . . . . 14--18
J. Neubüser Some remarks on a proposed taxonomy for
algebraic computation . . . . . . . . . 19--20
Maurice Mignotte Tests for polynomials . . . . . . . . . 21--22
J. Marti and
A. C. Hearn and
M. L. Griss and
C. Griss Standard Lisp Report . . . . . . . . . . 23--43
Paul S. Wang Titles and abstracts: mathematical
symbolic manipulation on the computer 20--22
James C. Frauenthal Change in applied mathematics is
revolutionary . . . . . . . . . . . . . 23--23
Alkiviadis G. Akritas A remark on the proposed syllabus for an
AMS short course on computer algebra . . 24--25
D. Lazard Problem 7 and systems of algebraic
equations . . . . . . . . . . . . . . . 26--29
Lewis M. Norton A Note About Laplace Transform Tables
for Computer Use . . . . . . . . . . . . 30--31
Navaratna S. Rajaram Random oscillations arising in the
MACSYMA implementation of Khachian-type
algorithms in linear programming . . . . 32--35
J. A. van Hulzen Computational Problems in Producing
Taylor Coefficients for the Rotating
Disk Problem . . . . . . . . . . . . . . 36--49
Paul S. Wang The EEZ-GCD algorithm . . . . . . . . . 50--60
David R. Stoutemyer PICOMATH-80: an even smaller computer
algebra package . . . . . . . . . . . . 5--7
A. Voros Symbol calculus by symbolic computation
and semi-classical expansions . . . . . 7--7
Alkiviadis G. Akritas A complete list of references for the
paper: ``A remark on the proposed
syllabus for an AMS short course on
computer algebra'' . . . . . . . . . . . 32--32
Toni Kasper Integration in finite terms: the
Liouville theory . . . . . . . . . . . . 2--8
B. David Saunders A survey of available systems . . . . . 12--28
L. Bachmair and
B. Buchberger A simplified proof of the
characterization theorem for
Gröbner-bases . . . . . . . . . . . . . . 29--34
A. Bossi and
L. Colussi and
C. Cobelli and
G. Romanin Jacur Identifiability of compartmental models:
algorithms to solve an actual problem by
means of symbolic calculus . . . . . . . 35--40
Maurice Mignotte Factorization of univariate polynomials:
a statistical study . . . . . . . . . . 41--44
A. M. Miola A bibliography of Soviet works in
algebraic manipulations . . . . . . . . 5--7
Alkiviadis G. Akritas On the Budan--Fourier controversy . . . 8--10
James H. Davenport and
Richard D. Jenks MODLISP . . . . . . . . . . . . . . . . 11--20
Richard J. Fateman Symbolic and algebraic computer
programming systems . . . . . . . . . . 21--32
Victor Köfalusi and
Edit Halmay State-space sets, state-space graphs and
$n$-prefix expressions . . . . . . . . . 33--36
Michael Pohst On the computation of lattice vectors of
minimal length, successive minima and
reduced bases with applications . . . . 37--44
B. David Saunders Abstracts . . . . . . . . . . . . . . . 6--7
Luciana Bordoni and
Attilio Colagrossi An Application of REDUCE to Industrial
Mechanics . . . . . . . . . . . . . . . 8--12
Yasumasa Kanada and
Tateaki Sasaki LISP-based ``big-float'' system is not
slow . . . . . . . . . . . . . . . . . . 13--19
D. Mordukhai-Boltovskoi and
Boris Korenblum and
Myra Prelle A general investigation of integration
in finite form of differential equations
of the first order article 1 . . . . . . 20--32
Woon Cheung Chan A novel symbolic ordinary differential
equation solver . . . . . . . . . . . . 9--14
A. K. Lenstra Lattices and factorization of
polynomials . . . . . . . . . . . . . . 15--16
William H. Rowan Efficient polynomial substitutions of a
sparse argument . . . . . . . . . . . . 17--23
B. David Saunders Algebra made mechanical . . . . . . . . 23--25
Lynn Arthur Steen Computer calculus: long perceived as
merely `number crunchers,' computers are
now moving into the realm of elegant
mathematics . . . . . . . . . . . . . . 26--27
Dennis S. Arnon Automatic analysis of real algebraic
curves . . . . . . . . . . . . . . . . . 3--9
Helmut Kempelmann Recursive algorithm for the fast
calculation of the limit of derivatives
at points of indeterminateness . . . . . 10--11
M. D. Atkinson Saving space in coset enumeration . . . 12--14
P. D. Pearce and
R. J. Hicks The Application of Algebraic
Optimisation Techniques to Algebraic
Mode Programs for REDUCE . . . . . . . . 15--22
J. Smit and
J. A. van Hulzen and
B. J. A. Hulshof NETFORM and Code Optimizer Manual . . . 23--32
James H. Davenport Fast REDUCE: The trade-off between
efficiency and generality . . . . . . . 8--11
George E. Collins and
Rüdiger G. K. Loos The Jacobi symbol algorithm . . . . . . 12--16
Timothy S. Norfolk Symbolic computation of residues at
poles and essential singularities . . . 17--23
Paul S. Wang and
M. J. T. Guy and
J. H. Davenport $P$-adic reconstruction of rational
numbers . . . . . . . . . . . . . . . . 2--3
Zdenêk Kalina Running REDUCE and Lisp/360
interactively under a Time Sharing
Option . . . . . . . . . . . . . . . . . 3--3
G. Üçoluk and
A. Hacìnlìyan and
E. Karabudak A Proposal for Extensions to REDUCE . . 4--14
Anonymous KWIC Index of SIGSAM Bulletin Abstracts
(1978--1981) . . . . . . . . . . . . . . 15--36
Anonymous EUROCAL '83 Call for Papers . . . . . . 37--37
Anonymous SAME Created . . . . . . . . . . . . . . 38--38
James H. Davenport On the parallel Risch algorithm (III):
use of tangents . . . . . . . . . . . . 3--6
R.-M. di Scala SYPAC: a Pascal based computer algebra
system for micro-computers . . . . . . . 7--10
Stanly Steinberg Mathematics and Symbol Manipulation . . 11--15
David D. Shochat Experience with the muSIMP/muMATH-80
symbolic mathematics system . . . . . . 16--23
Hale F. Trotter Statistics on factoring polynomials $
\bmod p $ and $p$-adically . . . . . . . 24--29
Zhong Renbao An algorithm for avoiding complex
numbers in rational function integration 30--32
R. Zhong An algorithm for avoiding complex
numbers in rational function integration 30--32
Erich Kaltofen Polynomial reduction from multivariate
to bivariate integral polynomial
factorization . . . . . . . . . . . . . 4--4
B. Buchberger and
G. E. Collins and
R. Loos and
R. Albrecht Computer algebra symbolic and algebraic
computation . . . . . . . . . . . . . . 5--5
James H. Davenport What do we want from a high-level
language? . . . . . . . . . . . . . . . 6--9, 23
Rabbe Fogelholm and
Inge B. Frick Standard LISP for the VAX: a Provisional
Implementation . . . . . . . . . . . . . 10--12
Wolfgang Küchlin Some reduction strategies for algebraic
term rewriting . . . . . . . . . . . . . 13--23
Alfonso M. Miola The conversion of Hensel codes to their
rational equivalents (or how to solve
the Gregory's open problem) . . . . . . 24--26
E. Schrüfer An Implementation of the Exterior
Calculus in REDUCE: a Status Report . . 27--31
J. A. van Hulzen and
B. J. A. Hulshof An Expression Analysis Package for
REDUCE . . . . . . . . . . . . . . . . . 32--44
Florian Bundschuh Global data flow analysis in Aldes . . . 6--11
Attilio Colagrossi and
Alfonso M. Miola Computing real zeros of polynomials with
parametric coefficients . . . . . . . . 12--15
B. J. A. Hulshof and
J. A. van Hulzen Some REDUCE Facilities for Pretty
Printing Subscripts and Formal
Derivatives . . . . . . . . . . . . . . 16--20
Hans-Guenther Kruse and
Karin Ohlsen About the Realization of an Extended,
but Really Interactive REDUCE by
Integration of a Small Editing and
Executing System . . . . . . . . . . . . 21--25
Jed Marti and
John Fitch REDUCE 2 for CP/M . . . . . . . . . . . 26--27, 37
Arthur C. Norman and
Paul S. Wang A comparison of the Vaxima and Reduce
factorization packages . . . . . . . . . 28--30
P. D. Pearce and
R. J. Hicks Data structures and execution times of
Algebraic mode programs for REDUCE . . . 31--37
Fritz Schwarz A REDUCE Package for Series Analysis by
Hadamard's Theorem and QD Schemes . . . 38--44
James H. Davenport Chairman's column . . . . . . . . . . . 1--5
G. Belovari Complex analysis in symbolic computing
of some definite integrals . . . . . . . 6--11
T. G. Berry On Coates algorithm . . . . . . . . . . 12--17
Jacques Calmet and
Ian Cohen Synthesizing recurrence relations. I.
Analysis of the problems . . . . . . . . 18--25
Dongyue Chen Symbol manipulation and formula
manipulation . . . . . . . . . . . . . . 26--27
Chen Dongyue Symbol manipulation and formula
manipulation . . . . . . . . . . . . . . 26--27
G. L. Ebert Some comments on the modular approach to
Gröbner-bases . . . . . . . . . . . . . . 28--32
Andrzej Krasi\'nski ORTOCARTAN: a program for algebraic
calculations in general relativity . . . 12--18
Mark E. Stickel A note on leftmost innermost term
reduction . . . . . . . . . . . . . . . 19--20
F. Winkler and
B. Buchberger A criterion for eliminating unnecessary
reductions in the Knuth-Bendix algorithm
(Abstract) . . . . . . . . . . . . . . . 20--20
Paul Smith and
Leon Sterling Of integration by man and machine . . . 21--24
Michael Wester and
Stanly Steinberg An extension to MACSYMA's concept of
functional differentiation . . . . . . . 25--30
Bruce Char and
Keith Geddes and
Gaston Gonnet The Maple symbolic computation system 31--42
Salim S. Abi-Ezzi Clarifications to the symbolic mode in
REDUCE . . . . . . . . . . . . . . . . . 43--47
Gaston H. Gonnet and
Bruce W. Char and
Keith O. Geddes Solution of a general system of
equations (problem) . . . . . . . . . . 48--49
S. Kamal Abdali and
Bruno Buchberger Abstracts . . . . . . . . . . . . . . . 2--7
Patrick C. McGeer A discussion and implementation of
Brown's REX simplification algorithm . . 10--19
C. J. Smith Implementation of a package of tools for
manipulation of sums . . . . . . . . . . 20--24
Clifton Williamson, Jr. Taylor series solutions of explicit
ODE's in a strongly typed algebra system 25--29
Ken Rimey Problem section (rotating fluids): a
system of polynomial equations and a
solution by an unusual method . . . . . 30--32
Gérard Huet The future of symbolic computation:
mathematics versus languages . . . . . . 2--5
Richard Zippel The future of computer algebra . . . . . 6--7
H. Zassenhaus Position statement for EUROCAL 85: the
efficiency of mathematical models . . . 8--9
Richard J. Fateman My view of the future of symbolic and
algebraic computation . . . . . . . . . 10--11
Regina Llopis de Trias A new generation of symbolic and
algebraic computation systems . . . . . 12--14
R. Llopis de Trias A new generation of symbolic and
algebraic computation systems . . . . . 12--14
Ferdinando Mora and
Lorenzo Robbiano The interplay between commutative
algebra and computer algebra . . . . . . 15--15
Arjen K. Lenstra Factorization of polynomials . . . . . . 16--18
J. Nievergelt Computing with geometric objects . . . . 19, 18
James Davenport Integration in finite terms . . . . . . 20--21
W. Trinks Comments from number theory on computer
algebra . . . . . . . . . . . . . . . . 22--23
E. V. Krishnamurthy Functional programming with combinators
for symbolic computation . . . . . . . . 24--24
Horst G. Zimmer Algorithms in algebraic number theory 25--26
Wolfgang Bibel Logic and algebraic computation . . . . 26--26
J. A. van Hulzen The symbolic-numeric interface . . . . . 27--28
Alexandru T. Balaban Numerical and non-numerical methods in
chemistry: present and future . . . . . 29--30
N. K. Bose Symbolic and algebraic computations in
multidimensional systems theory . . . . 31--32
T. Legendi Cellular hardware and symbolic
computation . . . . . . . . . . . . . . 33--33
Heinz Lüneburg Write a book! . . . . . . . . . . . . . 34--34
Carolyn J. Smith Procedures for polynomial and rational
function recognition . . . . . . . . . . 2--4
R. Gebauer and
H. Kredel Note on ``solution of a general system
of equations'' . . . . . . . . . . . . . 5--6
W. Trinks On improving approximate results of
Buchberger's algorithm by Newton's
method . . . . . . . . . . . . . . . . . 7--11
A. P. Kryukov An Antitranslator of the RLISP Language 12--15
A. Ya. Rodionov Work with non-commutative variables in
the Reduce-2 system for analytical
calculations . . . . . . . . . . . . . . 16--19
Daniel Zwillinger Completing the $L$-th power in $ Z[x]$ 20--22
Franz Winkler The Church--Rosser property in computer
algebra and special theorem proving: an
investigation of
critical-pair/completion algorithms
(Ph.D. thesis) . . . . . . . . . . . . . 22--22
W. Lassner Report on a national computer algebra
workshop in Leipzig . . . . . . . . . . 22--23
David S. Wise Representing matrices as quadtrees for
parallel processors: extended abstract 24--25
S. Kamal Abdali Abstracts of computer algebra papers
from 1984 national meeting of American
Chemical Society . . . . . . . . . . . . 26--30
Tuncer I. Ören A forum for the synergy of ACM special
interest groups . . . . . . . . . . . . 31--32
Anonymous Papers from Symbolic Mathematical
Systems and Their Effects on the
Curriculum --- International Congress on
Mathematical Education . . . . . . . . . 1--62
K. Aspetsberger and
G. Funk Experiments with MuMath in Austrian high
schools . . . . . . . . . . . . . . . . 4--7
B. Buchberger CAMP: a teaching project in symbolic
computation at the University of Linz 8--9
Jacques Calmet Introducing computer algebra to users
and to students . . . . . . . . . . . . 10--14
John J. Cannon and
Jim Richardson Cayley: teaching group theory by
computer . . . . . . . . . . . . . . . . 15--18
John Hosack and
Kenneth Lane and
Donald Small Report on the use of a symbolic
mathematics system in undergraduate
instruction . . . . . . . . . . . . . . 19--22
F. Lichtenberger Self-explanatory symbolic computation
for math education . . . . . . . . . . . 23--24
Pertti Lounesto A computer-aided vector algebra system
for use in high schools . . . . . . . . 25--25
Alfonso Miola Complexity issues in algebraic
algorithms: relevant topics for
mathematical education . . . . . . . . . 26--30
Alexander Ollongren Classroom experience with interactive
formula manipulation . . . . . . . . . . 31--37
P. D. Pearce The introduction of a computer-based
tool for solving mathematical problems
analytically to an undergraduate course 38--39
David R. Stoutemyer A radical proposal for computer algebra
in education . . . . . . . . . . . . . . 40--53
H. G. Zimmer Congruent numbers --- from elementary to
algebraic number theory . . . . . . . . 54--62
R. Gebauer and
H. Kredel Real Solution System for Algebraic
Equations. An algorithm system for
constructing finite inclusions of zero
sets of algebraic equations . . . . . . 2--2
Kevin McIsaac Pattern matching algebraic identities 4--13
Gregory Butler An improvement to the centralizer
algorithm for permutation groups . . . . 14--18
Jeffrey P. Golden Differentiation of unknown functions in
Macsyma . . . . . . . . . . . . . . . . 19--24
Richard J. Fateman Eleven proofs of $ \sin^2 x + \cos^2 x =
1 $ . . . . . . . . . . . . . . . . . . 25--28
Giuseppe Mazzarella Improved simplification of odd and even
functions in REDUCE . . . . . . . . . . 29--30
J. A. Abbott and
R. J. Bradford and
J. H. Davenport A remark on factorisation . . . . . . . 31--33, 37
A. P. Kryukov and
A. Ya. Rodionov Dynamic-debugging system for the REDUCE
programs . . . . . . . . . . . . . . . . 34--37
Richard J. Fateman Comments on SMP . . . . . . . . . . . . 5--7
Jed B. Marti and
Anthony C. Hearn REDUCE as a Lisp benchmark . . . . . . . 8--16
Wm Leler and
Neil Soiffer An interactive graphical interface for
Reduce . . . . . . . . . . . . . . . . . 17--23
Barbara L. Gates GENTRAN: an automatic code generation
facility for REDUCE . . . . . . . . . . 24--42
A. P. Kryukov and
A. Ya. Rodinov Interactive REDUCE . . . . . . . . . . . 43--45
H. Caprasse and
M. Hans A new use of operators in the algebraic
mode of REDUCE . . . . . . . . . . . . . 46--52
Pim van den Heuvel Adding statements to REDUCE . . . . . . 8--14
J. H. Davenport A ``Piano Movers'' Problem . . . . . . . 15--17
H. Caprasse A complete simplification package for
the absolute value function in the real
domain . . . . . . . . . . . . . . . . . 18--21
B. Gleyse Symbolic computation and number of zeros
of a real parameter polynomial in the
unit disk . . . . . . . . . . . . . . . 22--28
K. Namba Some improvements on Utah standard LISP 29--36
Dieter W. Ebner GOEDEL: a computer language for symbolic
algebraic calculations --- an
introduction by examples . . . . . . . . 16--19
H. Caprasse Description of an extension of the
Matrix package of ``Reduce'' . . . . . . 7--10
Lars Langemyr Converting SAC-2 code to Lisp . . . . . 11--13
Jacques Calmet and
Denis Lugiez A knowledge-based system for computer
algebra . . . . . . . . . . . . . . . . 7--13
P. van den Heuvel and
B. J. A. Hulshof and
J. A. van Hulzen Some simple pretty-print facilities for
REDUCE . . . . . . . . . . . . . . . . . 14--17
Gilles Labonté Report on a program for solving
polynomial equations in non-commuting
variables . . . . . . . . . . . . . . . 4--7
P. Gianni and
A. Miola and
T. Mora Symbolic and algebraic computation
research in Italy . . . . . . . . . . . 8--15
Volker Weispfenning Admissible orders and linear forms . . . 16--18
Alan Katz Issues in defining an equations
representation standard . . . . . . . . 19--24
Erwin Engeler Goals and design considerations for a
mathematical laboratory . . . . . . . . 7--8
John W. Gray The symbolic computation laboratory at
UIUC . . . . . . . . . . . . . . . . . . 9--11
Roman E. Maeder A collection of projects for the
mathematical laboratory . . . . . . . . 12--94
R. E. Maeder Solving boundary-value problems with
perturbations . . . . . . . . . . . . . 16--18
D. Binger Burnside's theorem . . . . . . . . . . . 19--23
R. Peikert Formal power series . . . . . . . . . . 24--32
O. Knill and
R. E. Mäder The rotation group of Rubik's cube . . . 33--43
F. S. Wheeler Bell polynomials . . . . . . . . . . . . 44--53
D. Binger Optimization on networks . . . . . . . . 54--60
R. Peikert Automated theorem proving: the
resolution method . . . . . . . . . . . 61--68
W. Küchlin Public key encryption . . . . . . . . . 69--73
Richard J. Fateman \TeX output from MACSYMA-like systems 1--5
Deepak Kapur and
Paliath Narendran Matching, unification and complexity . . 6--9
Carl D. Ponder Applications of hashing in algebraic
manipulation (an annotated bibliography) 10--13
S. Moritsugu On the power series solution of a system
of algebraic equations . . . . . . . . . 14--23
Alkiviadis G. Akritas A note on a paper by M. Mignotte . . . . 23--23
Maurice Mignotte Inequalities about factors of integer
polynomials . . . . . . . . . . . . . . 24--24
Dennis S. Arnon Report of the workshop on environments
for computational mathematics . . . . . 42--48
Birger Nielsen and
Hendrik Pedersen A note on Einstein metrics --- a simple
application of a symbolic algebra system 7--11
Aarno Hohti Computational algebra with APL . . . . . 12--20
Terry Flaherty Symbolic manipulation in an extended $
\lambda $-calculus . . . . . . . . . . . 21--24
Graham H. Campbell Symbolic integration of expressions
involving unspecified functions . . . . 25--27
Heinz Kredel Admissible term orderings used in
computer algebra systems . . . . . . . . 28--31
A. Miola Report on previous activities at AAECC 32--43
Gaston H. Gonnet Examples of Maple applied to problems
from the American Mathematical Monthly 8--16
G. M. Piacentini Cattaneo and
M. Pittaluga Nonassociative polynomial identities,
Young tableaux and computers . . . . . . 17--26
Richard Fateman and
Alan Bundy and
Richard O'Keefe and
Leon Sterling Commentary on: solving symbolic
equations with PRESS . . . . . . . . . . 27--40
Brent Gregory and
Erich Kaltofen Analysis of the binary complexity of
asymptotically fast algorithms for
linear system solving . . . . . . . . . 41--49
R. M. Corless and
D. J. Jeffrey A comparison of three computer algebra
systems for the solution of a problem in
hydrodynamic lubrication . . . . . . . . 50--62
Carl G. Ponder Parallelism and algorithms for algebraic
manipulation: current work . . . . . . . 7--14
Carl G. Ponder Parallel processors and systems for
algebraic manipulation: current work . . 15--21
Eberhard Schrüfer A comment on ``A note on Einstein
metrics'' . . . . . . . . . . . . . . . 22--26
A. Ronveaux and
G. Thiry Polynomial solution of recurrence
relation and differential equation . . . 9--19
Shuichi Moritsugu and
Eiichi Goto A note on the preconditioning for
factorization of homogeneous polynomials 9--12
T. F. Havel and
B. Sturmfels and
N. White Proposal for a geometric algebra
software package . . . . . . . . . . . . 13--15
Jean-Louis Roch and
Pascale Senechaud and
Françoise Siebert-Roch and
Gilles Villard Computer algebra on MIMD machine . . . . 16--32
M. Clarkson MACSYMA's inverse Laplace transform . . 33--38
K. T. Rowney and
R. D. Silverman Finite field manipulations in Macsyma 39--48
R. J. Fateman and
C. G. Ponder Speed and data structures in computer
algebra systems . . . . . . . . . . . . 8--11
J. C. Piquette Special function integration . . . . . . 11--21
Malcolm A. H. MacCallum Comments on the performance of algebra
systems in general relativity and a
recent paper by Nielsen and Pedersen . . 22--25
Werner Antweiler and
Andreas Strotmann and
Volker Winkelmann A \TeX-REDUCE Interface . . . . . . . . 26--33
W. Y. Sit Some comments on term-ordering in Gröbner
basis computations . . . . . . . . . . . 34--38
Shuichi Moritsugu and
Makoto Matsumoto A note on the numerical evaluation of
arctangent function . . . . . . . . . . 8--12
M. P. Barnett Using partial fraction formulas to sum
some slowly convergent series
analytically for molecular integral
calculations . . . . . . . . . . . . . . 13--18
W. C. Schou and
K. A. Broughan The Risch algorithms of MACSYMA and
SENAC . . . . . . . . . . . . . . . . . 19--22
B. Wall On the computation of syzygies . . . . . 5--14
V. A. Ilyin and
A. P. Kryukov and
A. Ya. Rodioniov and
A. Yu. Taranov Fast algorithm for calculation of
Dirac's gamma-matrices traces . . . . . 15--24
D. Wang A program for computing the Liapunov
functions and Liapunov constants in
Scratchpad II . . . . . . . . . . . . . 25--31
Bruno Buchberger Should Students Learn Integration Rules? 10--17
Bruce W. Char Report on the 7th Annual Maple Workshop 18--18
Ronald E. Prather The Relation of Lorenzen Calculus to
Formal Language Theory . . . . . . . . . 9--18
Richard J. Fateman A Lisp-Language Mathematica-to-Lisp
Translator . . . . . . . . . . . . . . . 19--21
Ken Weber An Experiment in High-precision
Arithmetic on Shared Memory
Multiprocessors . . . . . . . . . . . . 22--40
Pasqualina Conti Hermite Canonical Form and Smith
Canonical Form of a Matrix over a
Principal Ideal Domain . . . . . . . . . 8--16
Juan R. Sendra Hankel Matrices and Computer Algebra . . 17--26
Jean C. Pigquette Table of special function integrals . . 8--21
Jean C. Piquette Table of Special Function Integrals . . 8--21
R. P. dos Santos and
W. L. Roque On the Design of an Expert Help System
for Computer Algebra Systems . . . . . . 22--25
Vilmar Trevisan Recognition of Hurwitz Polynomials . . . 26--32
V. Baladi and
J. P. Guillement A Program for Computing Puiseux
expansions . . . . . . . . . . . . . . . 33--41
J. P. Dedieu and
G. Norton Stewart Varieties: a Direct Algebraic
Model for Stewart Platforms . . . . . . 42--59
Fritz Schwarz Monomial Orderings and Gröbner Bases . . 10--23
Bruce W. Char Report on the 8th Annual Maple Workshop 24--24
Anonymous Proceedings of the Third CAYLEY Users
Conference, November 17--19, 1988,
Universität Essen . . . . . . . . . . . . 25--81
Kris Dockx and
Paul Igodt Character tables and commutativity of
normal subgroups . . . . . . . . . . . . 28--31
S. P. Glasby Extensions of groups defined by
power-commutator presentations . . . . . 32--35
Holger W. Gollan The $2$-modular representation of $ J_1$
in the principal block . . . . . . . . . 36--39
Gerhard Grams Special generators and relations for
some orthogonal and symplectic groups
over GF(2) . . . . . . . . . . . . . . . 39--45
A. R. Jamali and
E. F. Robertson A library of simple groups:
permutations, presentations, conjugacy
classes, maximal subgroups and Sylow
subgroups . . . . . . . . . . . . . . . 46--49
M. F. Newman and
E. A. O'Brien The Wielandt length of some $3$-groups 50--51
E. A. O'Brien Providing electronic access to group
descriptions . . . . . . . . . . . . . . 52--56
Gordon F. Royle Constructing the vertex-transitive
graphs on 24 vertices . . . . . . . . . 56--59
Robert Sandling A group ring package for Cayley . . . . 60--64
Gerhard J. A. Schneider Representation theory in CAYLEY: tools
and algorithms . . . . . . . . . . . . . 64--70
Michael C. Slattery Character degrees of $p$-groups: a case
study . . . . . . . . . . . . . . . . . 71--74
John Cannon A bibliography of Cayley citations . . . 75--81
Bruno Salvy Examples of automatic asymptotic
expansions . . . . . . . . . . . . . . . 4--17
Gerhard Jank and
Lutz H. Tack Conformal mapping using Bergman's method
and the Maple system . . . . . . . . . . 18--23
S. Alasdair Buchanan Some Theoretical Problems When Solving
Systems of Polynomial Equations Using
Gröbner Bases . . . . . . . . . . . . . . 24--27
Michael P. Barnett Some Simple Ways to Construct and to Use
Formulas Mechanically . . . . . . . . . 28--36
Doron Zeilberger A Maple program for proving
hypergeometric identities . . . . . . . 4--13
Gert Almkvist and
Doron Zeilberger A Maple program that finds, and proves,
recurrences and differential equations
satisfied by hyperexponential definite
integrals . . . . . . . . . . . . . . . 14--17
Dongming Wang A toolkit for manipulating indefinite
summations with application to neural
networks . . . . . . . . . . . . . . . . 18--27
K. A. Broughan and
G. Keady and
T. D. Robb and
M. G. Richardson and
M. C. Dewar Some Symbolic Computing Links to the NAG
Numeric Library . . . . . . . . . . . . 28--37
Anonymous Symbolic computation research in Italy 38--48
Richard J. Fateman and
Derek T. Lai A Simple Display Package for Polynomials
and Rational Functions in Common Lisp 1--3
Tak W. Yan A Rational Function Arithmetic and
Simplification System in Common Lisp . . 4--6
Greg Bulter and
Sridhar S. Iyer Towards a deductive database for small
simple groups . . . . . . . . . . . . . 7--17
G. Butler and
S. S. Iyer Towards a Deductive Database for Small
Simple Groups . . . . . . . . . . . . . 7--17
Alyson A. Reeves The Worst Order Is Not Always the
Lexicographic Order . . . . . . . . . . 18--19
Julio Rubio and
Francis Sergeraert A Program Computing the Homology Groups
of Loop Spaces . . . . . . . . . . . . . 20--24
Wei Li Nonexistence of Degree Bounds of Various
Bases for Ideals of Polynomials Over the
Integers . . . . . . . . . . . . . . . . 4--9
Manfred Hollenhorst The Design of Digital Filters Using
REDUCE . . . . . . . . . . . . . . . . . 10--12
A. A. Reeves Erratum: ``The Worst Order Is Not Always
The Lexicographic Order'' . . . . . . . 13--13
Greg Butler An analysis of Atkinson's algorithms . . 1--9
S. Kamal Abdali and
Guy W. Cherry and
Neil Soiffer Spreadsheet computations in computer
algebra . . . . . . . . . . . . . . . . 10--18
T. Sasaki and
M. Sasaki On integer-to-rational conversion
algorithm . . . . . . . . . . . . . . . 19--21
Joachim von zur Gathen A polynomial factorization challenge . . 22--24
Robert M. Corless and
David J. Jeffrey Well \ldots It Isn't Quite That Simple 2--6
Blair F. Madore Report on the 10th Annual Maple Retreat,
June 13--17, 1992 . . . . . . . . . . . 7--8
Jean-Michel Nataf Algorithm of simplification of nonlinear
equations systems . . . . . . . . . . . 9--16
M. Kolár and
T. Sasaki Multivariate Quotient by Power-series
Division . . . . . . . . . . . . . . . . 17--20
Andrew H. Gleibman SAMPLE: New Programming Technology and
AI Language . . . . . . . . . . . . . . 21--29
Hoon Hong and
Wolfgang Schreiner Programming in PACLIB . . . . . . . . . 1--6
B. Lacolle Spinor analysis and symbolic computation
of partition functions . . . . . . . . . 7--14
Diane M. Koorey Willcock Tlisp: A Concurrent Lisp for the
Transputers . . . . . . . . . . . . . . 15--23
Ivan I. Shevchenko and
Nikolay N. Vasiliev Algorithms of Numeric Deduction of
Analytical Expressions . . . . . . . . . 1--3
Jeffrey Shallit and
Jonathan Sorenson A binary algorithm for the Jacobi symbol 4--11
Antonio Montes Numerical Conditioning of a System of
Algebraic Equations with a Finite Number
of Solutions Using Gröbner Bases . . . . 12--19
Wolfram Koepf Examples for the Algorithmic Calculation
of Formal Puisieux, Laurent and Power
Series . . . . . . . . . . . . . . . . . 20--32
Bruno Salvy Efficient programming in Maple: a case
study . . . . . . . . . . . . . . . . . 1--12
Michael B. Monagan von zur Gathen's Factorization Challenge 13--18
Albrecht Beutelspacher and
Johannes Ueberberg Symbolic Incidence Geometry: Proposal
for Doing Geometry with a Computer (Part
1 of 2) . . . . . . . . . . . . . . . . 19--29
Erich Kaltofen Message from the Chair . . . . . . . . . 1
Gene Cooperman Letter from the Information Director . . 3
Susan Landau Finding Maximal Subfields . . . . . . . 4--8
Albrecht Beutelspacher and
Johannes Ueberberg Symbolic Incidence Geometry: Proposal
for Doing Geometry with a Computer (Part
2 of 2) . . . . . . . . . . . . . . . . 9--24
Anonymous SymbMath 2.2: a Symbolic Calculator with
Learning . . . . . . . . . . . . . . . . 25
Erich Kaltofen Direct Proof of a Theorem by Kalkbrener,
Sweedler, and Taylor . . . . . . . . . . 2--2
Manfred Göbel Using Buchberger's algorithm in
invariant theory . . . . . . . . . . . . 3--9
Henry G. Baker Sparse Polynomials and Linear Logic . . 10--14
Robert M. Corless What is a solution of an ODE? . . . . . 15--19
André Heck Report on the HISC workshop . . . . . . 2--8
Fritz Schwarz Efficient factorization of linear ODE's 9--17
Norbert Kajler and
Neil Soiffer Some human interaction issues in
computer algebra . . . . . . . . . . . . 18--28
D. Gruntz and
M. Monagan Introduction to Gauss . . . . . . . . . 3--19
Zhuojun Liu and
Paul S. Wang Height as a coefficient bound for
univariate polynomial factors (Part I) 20--27
Zhuojun Liu and
Paul S. Wang Height as a coefficient bound for
univariate polynomial factors (Part II) 1--9
Wolfram Koepf On families of iterated derivatives . . 10--26
Antonio Montes and
Jordi Castro Solving the load flow problem using the
Gröbner basis . . . . . . . . . . . . . . 1--13
Wolfram Koepf REDUCE package for the indefinite and
definite summation . . . . . . . . . . . 14--30
Erich Kaltofen Message from the Chair . . . . . . . . . 1--1
Felix Ulmer and
Jacques-Arthur Weil Note on Kovacic's Algorithm . . . . . . 10--11
Pedro A. García-Sánchez Gröbner and Involutive Bases for
Zero-dimensional Ideals . . . . . . . . 12--15
Thomas Wolf and
Andreas Brand Investigating DEs with CRACK and Related
Programs . . . . . . . . . . . . . . . . 1--8
Aldo Volpi $p$-th Roots for Integers Modulo $ p^n$
and for $p$-Adic Integers . . . . . . . 9--15
Andrej G. Sokolsky and
Akmal A. Vakhidov and
Nickolay N. Vasiliev Generating a New Recurrence Relations
System for Elliptic Hansen Coefficients
by Means of Computer Algebra . . . . . . 16--18
Anonymous SAC '96: ACM Symposium on Applied
Computing . . . . . . . . . . . . . . . 19--20
Anonymous ECCAD '95 . . . . . . . . . . . . . . . 21--28
Robert Grossman Message from the Editor . . . . . . . . 1--1
Liwei Li and
Paul S. Wang The CL--PVM package . . . . . . . . . . 2--8
Robert Grossman 1st International IMACS Conference on
Applications of Computer Algebra . . . . 9--12
Anonymous Abstracts of Closing Sessions of the
Special Year in Computational
Differential Algebra and Algebraic
Geometry . . . . . . . . . . . . . . . . 13--18
Anonymous ISSAC '96: International Symposium on
Symbolic and Algebraic Computation . . . 19--19
Anonymous Maple in the Mathematical Sciences . . . 20--20
Anonymous ECCAD '96: East Coast Computer Algebra
Day . . . . . . . . . . . . . . . . . . 21--21
S. M. Watt Message from the Chair . . . . . . . . . 1--1
R. M. Corless Message from the Editor . . . . . . . . 2--3
Takahiro Sado and
Tomohiro Halaikawa and
Tateaki Sasaki Pseudo-Parallel Execution of Modular
Computation . . . . . . . . . . . . . . 4--8
Laurent Bernardin A Review of Symbolic Solvers . . . . . . 9--20
John Abbott and
Angel Díaz and
Robert S. Sutor A report on OpenMath. A protocol for the
exchange of mathematical information . . 21--24
Richard J. Fateman and
Mark Hayden Speeding Up Lisp-Based Symbolic
Mathematics . . . . . . . . . . . . . . 25--30
E. Kaltofen ISSAC Steering Committee Bylaws . . . . 31--33
Robert M. Corless Cofactor Iteration . . . . . . . . . . . 34--38
S. Dooley and
A. Lobo ECCAD '96 . . . . . . . . . . . . . . . 39--49
M-T Noda RIMS '94 . . . . . . . . . . . . . . . . 50--56
R. M. Corless Abell and Braselton's \em Differential
Equations with Maple V . . . . . . . . . 57--60
H. Hong IMACS-ACA '96 . . . . . . . . . . . . . 61--61
I. Emiris SNAP '96 . . . . . . . . . . . . . . . . 62--62
M. Monagan MapleTech Special Issue . . . . . . . . 63--63
Robert M. Corless Message from the Editor . . . . . . . . 1--1
Jonathan Borwein and
David Bradley Searching Symbolically for Apéry-like
Formulae for Values of the Riemann Zeta
Function . . . . . . . . . . . . . . . . 2--7
Richard J. Fateman Why computer algebra systems sometimes
can't solve simple equations . . . . . . 8--11
Helmer Aslaksen Multiple-Valued Complex Functions and
Computer Algebra . . . . . . . . . . . . 12--20
Charles M. Patton A Representation of Branch-Cut
Information . . . . . . . . . . . . . . 21--24
Albert D. Rich and
David J. Jeffrey Function evaluation on branch cuts . . . 25--27
Robert M. Corless and
David J. Jeffrey Editor's corner: The unwinding number 28--35
Matu-Tarow Noda Abstracts of Japanese computer algebra
meeting in Kyoto . . . . . . . . . . . . 36--43
Bruce Char First Announcement and Call for Papers:
ISSAC '97: International Symposium on
Symbolic and Algebraic Computation . . . 44--46
Hoon Hong PASCO '97: Second International
Symposium on Parallel Symbolic
Computation . . . . . . . . . . . . . . 47--48
Cetin Cetinkaya Message from the Book Review Editor . . 1--1
Robert M. Corless Message from the Editor . . . . . . . . 1--1
Austin Lobo Formal Review of Articles in the \sc
Bulletin . . . . . . . . . . . . . . . . 2--3
J. Della Dora and
F. Jung Resolvent and rational canonical forms
of matrices . . . . . . . . . . . . . . 4--10
Andreas Weber Computing Radical Expressions for Roots
of Unity . . . . . . . . . . . . . . . . 11--20
I. Z. Emiris and
A. Galligo Bini and Pan's Polynomial and Matrix
Computations . . . . . . . . . . . . . . 21--23
Chris Adami Gaylord and Nishidate's Modelling Nature
with Cellular Automata using Mathematica 24--25
Emil Volcheck Technical Report Column: INRIA and
RISC-Linz . . . . . . . . . . . . . . . 26--28
Michael Wester ACA '97 . . . . . . . . . . . . . . . . 29--29
Bruce Char ISSAC '97 . . . . . . . . . . . . . . . 30--30
Hoon Hong PASCO '97 . . . . . . . . . . . . . . . 31--31
Hans J. Stetter and
Stephen M. Watt JSC Special Issue CFP . . . . . . . . . 32--32
Anonymous Calendar . . . . . . . . . . . . . . . . ??
Gene Cooperman SIGSAM Business Meeting Minutes . . . . 1--2
Gene Cooperman ISSAC Business Meeting Minutes . . . . . 2--3
Dinesh Manocha and
Shankar Krishnan Solving algebraic systems using matrix
computations . . . . . . . . . . . . . . 4--21
Hans J. Stetter Matrix eigenproblems are at the Heart of
Polynomial System Solving . . . . . . . 22--25
Robert M. Corless Editor's Corner: Gröbner bases and matrix
eigenproblems . . . . . . . . . . . . . 26--32
R. M. Corless Message from the Editor . . . . . . . . 1--1
Siamack Bondari and
Irvin Roy Hentzel The McCrimmon Radical for Identities of
Degree 3 . . . . . . . . . . . . . . . . 2--5
S. I. Tertychniy and
I. G. Obukhova GRGEC: Computer Algebra System for
Applications to Gravity Theory . . . . . 6--14
Olaf Bachmann MPCR: An Efficient and Flexible Chains
of Recurrences Server . . . . . . . . . 15--21
G. J. Fee and
M. B. Monagan Problems, Puzzles, Challenges . . . . . 22--23
Emil Volcheck Technical Report Column: INRIA and
RISC-Linz . . . . . . . . . . . . . . . 24--25
Cetin Cetinkaya Book Reviews . . . . . . . . . . . . . . 26--26
D. Dane Quinn Book Review: \em Topics in Nonlinear
Dynamics with Computer Algebra, by
Richard H. Rand, Gordon and Breach
Scientific Publishers, 1994, ISBN
2-8849-113-9 (hardcover), 2-8849-114-7
(softcover) . . . . . . . . . . . . . . 27--28
S. M. Watt SIGSAM Executive Elections . . . . . . . 28--28
G. Cooperman The Fourther East Coast Computer Algebra
Day: a one day meeting to stimulate
activity in Computer Algebra . . . . . . 29--29
H. J. Stetter and
S. M. Watt Journal of Symbolic Computation Special
Issue on Symbolic-Numeric Algebra for
Polynomials . . . . . . . . . . . . . . 30--30
M. Kalkbrener and
D. Wang Journal of Symbolic Computation Special
Issue on Polynomial Elimination:
Algorithms and Applications . . . . . . 31--31
W. Sit and
M. Bronstein Journal of Symbolic Computation Special
Issue on Differential Equations and
Differential Algebra . . . . . . . . . . 32--32
M. J. Encarnacion Call for Posters: ISSAC '97:
International Symposium on Symbolic and
Algebraic Computation . . . . . . . . . 33--33
A. Reeves PetaFLOPS Workshop . . . . . . . . . . . 1--1
Andreas Dolzmann and
Thomas Sturm REDLOG: Computer algebra meets computer
logic . . . . . . . . . . . . . . . . . 2--9
Horst G. Zimmer Three examples of $S$-integral points on
Elliptic Curves over $Q$ . . . . . . . . 10--21
Emil Volcheck Technical Report Column:
INRIA-Rocquencourt, Research Institute
for Symbolic Computation, University of
Passau, Germany . . . . . . . . . . . . 22--31
Tomas Recio A Course on Computer Algebra
Applications . . . . . . . . . . . . . . 32--32
Robert M. Corless Message from the Editor . . . . . . . . 1--1
Stephen M. Watt Message from the Past Chair . . . . . . 2--2
Bruce Char SIGSAM Chair's message . . . . . . . . . 2--3
Austin Lobo Computer Linear Algebra . . . . . . . . 3--3
Tateaki Sasaki and
Mutsuko Sasaki Polynomial Remainder Sequence and
Approximate GCD . . . . . . . . . . . . 4--10
George C. Nakos and
Peter R. Turner and
Robert M. Williams Fraction-Free Algorithms for Linear and
Polynomial Equations . . . . . . . . . . 11--19
R. M. Corless and
D. J. Jeffrey The Turing Factorization of a
Rectangular Matrix . . . . . . . . . . . 20--28
Bogdan A. Popov A System for Function Approximation
Properties Investigation . . . . . . . . 29--30
M. J. Encarnación ISSAC '97 Poster Abstracts . . . . . . . 29--61
Fujio Kako and
Tateaki Sasaki Proposal of ``effective floating-point
number'' for approximate algebraic
computation . . . . . . . . . . . . . . 31--31
Tateaki Sasaki and
Kousuke Shiihara and
Akira Terui and
Yuichi Ozaki and
Fujio Kako Approximate Algebraic Computation:
Practice and Problems . . . . . . . . . 32--32
Scott McCallum Factors of Iterated Resultants and
Discriminants . . . . . . . . . . . . . 33--34
Valerie Piehl and
Jonathan Sorenson and
Neil Tiedeman Genetic Algorithms for the Extended GCD
Problem (work in progress) . . . . . . . 34--35
Michio Sakakihara Iterative Blow-up Time Approximation for
Initial Value Problems . . . . . . . . . 36--36
Michio Sakakihara and
Shigekazu Nakagawa Symbolic Newton Method for Two-Parameter
Eigenvalue Problem . . . . . . . . . . . 36--36
Hiroshi Kai and
Matu-Tarow Noda Cauchy Principal Value Integral Using
Hybrid Integral . . . . . . . . . . . . 37--38
Arnold Knopfmacher Distinct Degree Factorizations for
Polynomials over a Finite Field . . . . 38--39
Mark Giesbrecht and
Austin Lobo and
David Saunders Certifying Inconsistency of Sparse
Linear Systems . . . . . . . . . . . . . 40--40
Mark Giesbrecht and
David Saunders Parametric Linear Systems: The
Two-Parameter Case . . . . . . . . . . . 40--40
Yosuke Sato Set Constraint Solver --- Gröbner Bases
for Non-numerical Domains . . . . . . . 41--42
Kenny Hunt and
James Cremer Refiner: a Problem Solving Environment
for ODE/DAE Simulations . . . . . . . . 42--43
Vladimir P. Gerdt and
Yuri A. Blinkov Minimal Involutive Bases . . . . . . . . 44--44
Neil Soiffer MathML: a Proposal for Representing
Mathematics in HTML . . . . . . . . . . 44--45
Andreas Sorgatz Dynamic Modules: Software Integration in
MuPAD . . . . . . . . . . . . . . . . . 45--47
Christian Heckler and
Oliver Kluge and
Torsten Metzner and
Andreas Sorgatz and
Paul Zimmermann Parallelism in MuPAD . . . . . . . . . . 48--48
G.-M. Greuel and
G. Pfister and
H. Schönemann Singular 1.0: a Computer Algebra System
for Singularity Theory, Algebraic
Geometry and Commutative Algebra . . . . 48--50
Olaf Bachmann and
Simon Gray A Demonstration of Exchanging
Mathematical Expressions using MP . . . 50--50
Matu-Tarow Noda and
Isao Makino and
Toshiaki Saito Algebraic Methods for Computing a
Generalized Inverse . . . . . . . . . . 51--52
Heinz Kredel and
Michael Pesch MAS, the Modula-2 Algebra System,
Version 1.00 . . . . . . . . . . . . . . 52--54
Markus Maurer and
Thomas Pfahler and
Susanne Wetzel LiDIA --- a Library for Computational
Number Theory . . . . . . . . . . . . . 54--57
Bruce Char and
Tom Hewett and
Jeremy Johnson and
Lakshman Yagati and
Ron Perline and
Raji Venkatesan and
Hoi Man Chang and
Michael Miller and
Clint Hepner Symbolic Computation Tools in Scientific
Problem Solving Environments . . . . . . 58--58
V. A. Mitrofanov and
E. V. Zima Standalone MCR-Based Numerical Engine 59--60
Kohshi Okumura An Application of Gröbner Bases to the
Classification of Nonlinear Circuits . . 61--61
Volker Weispfenning ISSAC '98 Rostock . . . . . . . . . . . 62--63
Franz Winkler 33 Years of Gröbner Bases . . . . . . . . 64--64
M. Trott Mathematica solutions to the ISSAC
system challenge 1997 . . . . . . . . . 2--35
Philippe Flajolet and
Bruno Salvy The SIGSAM challenges: symbolic
asymptotics in practice . . . . . . . . 36--47
G. J. Fee and
M. B. Monagan Problems, puzzles, challenges . . . . . 48--49
Emil Volcheck Technical report column . . . . . . . . 50--53
Nelson H. F. Beebe Letters: Bibliography archive . . . . . 1--3
Jonathan Borwein Mathematical Publication on the Web . . 4--7
R. William Gosper, Jr. The solutions of $ y e^{y^2} = x $ and $
y e^y = x $ . . . . . . . . . . . . . . 8--10
Robert M. Corless and
David J. Jeffrey Graphing Elementary Riemann Surfaces . . 11--17
Technical Staff at Macsyma, Inc. Macsyma Solutions to the ISSAC '97
Challenge Problems . . . . . . . . . . . 18--37
David R. Stoutemyer A TI-92 Solution to the ISSAC '97
Challenge Problems . . . . . . . . . . . 38--55
Fujio Kako Abstracts of Japanese Computer Algebra
Meeting in Kyoto . . . . . . . . . . . . 56--63
Anonymous Preliminary Announcement: ISSAC '99
Vancouver: International Symposium on
Symbolic and Algebraic Computation, July
1999, Simon Fraser University, British
Columbia, Canada . . . . . . . . . . . . 64--64
Robert M. Corless Message from the Editor . . . . . . . . 1--2
L. Berggren Position at Simon Fraser University . . 2--2
Lakshman Y.N. SIGSAM/ISSAC Business Meeting Summary 3--4
D. J. Jeffrey Formally Reviewed Articles in the
Bulletin . . . . . . . . . . . . . . . . 5--6
Bernadette Bouchon-Meunier and
Vladik Kreinovich From Interval Computations to Modal
Mathematics: Applications and
Computational Complexity . . . . . . . . 7--11
Atanas Popov Symbolic Computation of Potential Energy
Functions . . . . . . . . . . . . . . . 12--18
David Joyner and
Roland Martin A Maple package for the decomposition of
certain tensor products and restrictions
of representations using crystal graphs 19--22
Stephen P. Braham NAOMI One: North American OpenMath
Initiative Goes Online . . . . . . . . . 23--29
Stéphane F\`evre Completeness of a Rewrite System for
Proving Geometric Theorems using
Clifford Algebra . . . . . . . . . . . . 30--34
Robert M. Corless and
Stephen M. Watt Report on the SNAP minisymposium at SIAM
'98 . . . . . . . . . . . . . . . . . . 35--37
B. Buchberger and
F. Winkler Intensive Course on Gröbner Bases . . . . 38--38
F. Winkler 33 Years of Gröbner Bases . . . . . . . . 38--39
W. Gröbner On Elimination Theory . . . . . . . . . 40--46
Paul Gordan A new proof of Hilbert's theorem on
homogeneous functions . . . . . . . . . 47--48
George Labahn and
Mohamed Omar Rayes Poster Session Abstracts of the 1998
International Symposium on Symbolic and
Algebraic Computation, ISSAC '98,
Rostock, German, August 13--15, 1998 . . 49--51
L. M. Berkovich Factorization of some Classes of
Nonlinear Ordinary Differential
Equations: Methods and Algorithms . . . 52--52
Thomas Decker and
Werner Krandick Parallel Real Root Isolation: poster
abstract . . . . . . . . . . . . . . . . 53--54
Vladimir P. Gerdt Involutive Systems of Linear PDEs . . . 55--56
Peter E. Glotov On the greatest common right divisor of
Ore polynomials with polynomial
coefficients which depend on a parameter 57--57
Mark Heiligman and
Emil Volcheck On Computing the Weierstrass Points of a
Plane Algebraic Curve . . . . . . . . . 58--58
Hiroshi Kai and
Matu-Tarow Noda Hybrid Computation of Cauchy-type
Singular Integral Equations . . . . . . 59--60
F. Leon Pritchard and
William Y. Sit On Initial Value Problems for Ordinary
Differential-Algebraic Equations . . . . 61--61
Jörn Müller-Quade and
Thomas Beth Computing the Intersection of Finitely
Generated Fields . . . . . . . . . . . . 62--62
D. J. Jeffrey ISSAC '99 Vancouver Call for Papers:
International Symposium on Symbolic and
Algebraic Computation, 28--31 July 1999,
Simon Fraser University, British
Columbia, Canada . . . . . . . . . . . . 63--64
E. Kaltofen ECCAD '99: East Coast Computer Algebra
Day . . . . . . . . . . . . . . . . . . 64--64
Robert M. Corless Editor's Message . . . . . . . . . . . . 1--1
Stephen M. Watt Positions in Symbolic Mathematical
Computation at the University of Western
Ontario . . . . . . . . . . . . . . . . 1--1
Richard Fateman A short note on short differentiation
programs in Lisp, and a comment on
logarithmic differentiation . . . . . . 2--7
Michael Abramson Historical Background: ``The Question of
Finitely Many Steps in Polynomial Ideal
Theory'' . . . . . . . . . . . . . . . . 8--8
Grete Hermann The Question of Finitely Many Steps in
Polynomial Ideal Theory . . . . . . . . 8--30
Shu Lin Announcements: Applied Algebra Algebraic
Algorithms Error-Correcting Codes,
Honolulu, Hawaii (USA) --- 14--19
November 1999 . . . . . . . . . . . . . 31--31
E. Roanes-Lozano Announcements: 1999 IMACS Applications
of Computer Algebra Conference
(IMACS-ACA '99), Euroforum, El Escorial,
Madrid, Spain, 24--27 June 1999
(Scientific Program 25--27 June 1999) 31--31
Eugene Zima Announcements: Call for Posters: ISSAC
'99 Vancouver . . . . . . . . . . . . . 32--32
Rob Corless Message from the Editor . . . . . . . . 1--1
Stephen Watt Report of the SIGSAM Nominating
Committee . . . . . . . . . . . . . . . 1--1
Dongming Wang Unmixed and Prime Decomposition of
Radicals of Polynomial Ideals . . . . . 2--9
Gilles Villard Block solution of sparse linear systems
over $ {\rm GF}(q) $: the singular case 10--12
Tateaki Sasaki and
Tomoyuki Sato Cancellation Errors in Multivariate
Resultant Computation with
Floating-point Numbers . . . . . . . . . 13--20
S. P. Tsarev Factorization of linear partial
differential operators and Darboux
integrability of nonlinear PDEs
(ISSAC'98 Poster) . . . . . . . . . . . 21--28
E. Volcheck Parallel Symbolic Computing Workshop,
October 1--3, 1998, Mathematical
Sciences Research Institute, Berkeley,
CA, USA . . . . . . . . . . . . . . . . 29--30
Shu Lin Announcements: Applied Algebra Algebraic
Algorithms Error-Correcting Codes,
Honolulu, Hawaii (USA) --- 14--19
November 1999 . . . . . . . . . . . . . 31--31
Eugene Zima Announcements: Call for Posters: ISSAC
'99 Vancouver . . . . . . . . . . . . . 32--32
Stephen M. Watt and
Xuehong Li Examples of MathML . . . . . . . . . . . 1--4
A. Ostrowski On the Significance of the Theory of
Convex Polyhedra for Formal Algebra . . 5--5
J. M. de Olazábal Unified method for determining canonical
forms of a matrix . . . . . . . . . . . 6--20
S. Yu. Slavyanov and
A. B. Pirozhnikov and
A. M. Akopyan and
W. Lay and
Z. B. Yazik Database of the special functions of
mathematical physics . . . . . . . . . . 21--27
Anonymous First Announcement and Call for Papers:
ISSAC 2000: International Symposium on
Symbolic and Algebraic Computation,
University of St. Andrews, Scotland,
August 7--9, 2000 . . . . . . . . . . . 28--28
Anonymous Second Announcement and Call for Papers:
RWCA'00: Seventh Rhine Workshop on
Computer Algebra, March 22 -- March 24,
2000, Bregenz, Austria . . . . . . . . . 29--29
Anonymous First Announcement and Call for Papers:
MEGA 2000: The Sixth International
Symposium on Effective Methods in
Algebraic Geometry, Bath University
(United Kingdom), June 20--24, 2000 . . 30--30
Anonymous The Third International Workshop on
Computer Algebra in Scientific
Computing, CASC-2000, October 5--9,
2000, Samarkand State University,
Samarkand, Uzbekistan . . . . . . . . . 31--31
Wen-tsün Wu Asian Technology Conference in
Mathematics: Applications of Technology
in Mathematics Research and Teaching for
the 21st Century, December 17--21, 1999,
Guangzhou Normal University (GNU),
Guangzhou, P. R. China . . . . . . . . . 32--32
Rob Corless Message from the Outgoing Editor and
SIGSAM Chair . . . . . . . . . . . . . . 1--2
Mark Giesbrecht Message from the Incoming Editor . . . . 2--2
A. I. Shirshov Certain algorithmic problems for Lie
algebras . . . . . . . . . . . . . . . . 3--6
W. Kahan and
Richard J. Fateman Symbolic Computation of Divided
Differences . . . . . . . . . . . . . . 7--28
K. O. Geddes Generating Numerical ODE Formulas via a
Symbolic Calculus of Divided Differences 29--42
Hoon Hong and
Erich Kaltofen and
Michael Singer East Coast Computer Algebra Day '99
(April 24, 1999): Abstracts of Invited
Talks and Presented Papers . . . . . . . 43--52
Michael Wester and
Eugenio Roanes-Lozano IMACS Applications of Computer Algebra
Conference 1999: Summary . . . . . . . . 53--57
Anonymous IMACS-ACA'2000: International
Association for Mathematics and
Computers in Simulation: 6th
International Conference on Applications
of Computer Algebra, June 25--28, 2000,
Saint Petersburg, Russia . . . . . . . . 58--58
Anonymous East Coast Computer Algebra Day 2000:
Joint meeting with Southern Ontario
Numerical Analysis Day 2000 and the 70th
Birthday Celebration for Professor Hans
J. Stetter; Announcement and Call for
Participation . . . . . . . . . . . . . 59--59
Anonymous First Announcement and Call for Papers:
ISSAC 2000: International Symposium on
Symbolic and Algebraic Computation,
University of St. Andrews, Scotland,
August 7--9, 2000 . . . . . . . . . . . 60--60
Anonymous Second Announcement and Call for Papers:
MEGA 2000: The Sixth International
Symposium on Effective Methods in
Algebraic Geometry, Bath University
(United Kingdom), June 20--24, 2000 . . 61--61
Anonymous First Announcement and Call for Papers:
ASCM'2000: The 4th Asian Symposium on
Computer Mathematics, Chiang Mai,
Thailand, December 17--21, 2000 . . . . 62--62
Anonymous Southern Ontario Numerical Analysis Day
2000: Joint meeting with East Coast
Computer Algebra Day 2000 and the 70th
Birthday Celebration for Professor Hans
J. Stetter; Announcement and Call for
Participation . . . . . . . . . . . . . 63--63
Anonymous Transactions on Computational Logic
(TOCL): Call for Papers . . . . . . . . 64--64
Mark Giesbrecht Message from the Editor . . . . . . . . 1--1
Xavier Dousson Effective homology of a classifying
space . . . . . . . . . . . . . . . . . 2--9
Michael Moeller Good non-zeros of polynomials . . . . . 10--11
M. Lejeune Jalabert On the ubiquity of Newton polyhedra . . 12--12
T. Recio Computing Weil's descente variety . . . 12--12
Isabel Bermejo Abstracts of the fifth Spanish meeting
on computer algebra and applications
EACA-99 . . . . . . . . . . . . . . . . 12--19
J. Schicho The parameterization problem for
algebraic surfaces . . . . . . . . . . . 13--13
F. Sergeraert Constructive algebraic topology . . . . 13--13
W. V. Vasconcelos Bounds in the computation of the
integral closure . . . . . . . . . . . . 13--13
S. Xambó Using OMEGA for the effective
construction, coding and decoding of
block error-correcting codes . . . . . . 13--13
L. Álvarez and
J. Sánchez On some real problems in computer vision
which yield to algebraic system of
equations . . . . . . . . . . . . . . . 13--14
C. Andradas and
M. P. Vélez Convex polytopes over ordered fields . . 14--14
M. Barile and
M. Morales and
A. Thoma On equations defining monomial varieties 14--14
I. Bermejo and
Ph. Gimenez and
M. Morales On Castelnuovo--Mumford regularity of
codimension two monomial varieties . . . 14--14
J. L. Bueso and
J. Gómez Torrecillas and
F. J. Lobillo When is a finitely generated algebra of
Poincaré--Birkhoff--Witt type? . . . . . 14--15
E. Cattani and
A. Dickenstein and
B. Sturmfels The search for rational A-hypergeometric
functions . . . . . . . . . . . . . . . 15--15
R. M. Corless Open problems in computer algebra . . . 15--15
C. D'Andrea and
A. Dickenstein Bezoutian formulas \`a la Macaulay for
the multivariate resultant . . . . . . . 15--15
F. Gaeta New non recursive formulas for
irreducible representations of GL$
(\mathbb {C}^{m + 1}) $ and systems of
equations for the symmetric powers $
{\rm Sym}^n \mathbb {P}_m $ . . . . . . 15--15
G. Fleitas Morales Algorithms to compute the eigenvalues of
a $p$-adic matrix . . . . . . . . . . . 15--15
E. García Barroso Polar invariants and topology . . . . . 16--16
J. I. García-García and
P. A. García Sánchez and
J. C. Rosales Commutative ideal extensions of Abelian
groups . . . . . . . . . . . . . . . . . 16--16
J. Gutierrez and
R. Rubio Subfields in pure transcendental
extensions . . . . . . . . . . . . . . . 16--16
X. Hernández and
J. M. Miret Using Schubert to enumerate conics in $
\mathbb {P}^3 $ . . . . . . . . . . . . 16--16
P. D. González Pérez A Newton--Puiseux algorithm for the ring
$ C \{ X_1, \ldots {}, X_d \} [Y] $ . . 16--16
M. T. Iglesias and
C. Vidal and
A. Verschoren Computing epistasis through Walsh
transforms . . . . . . . . . . . . . . . 16--17
T. Krick and
L. M. Pardo and
M. Sombra Arithmetic Nullstellensätze . . . . . . . 17--17
L. Lambán and
V. Pascual and
J. Rubío Simplicial sets in the EAT system . . . 17--17
A. Maignan Real solving of ill-conditioned
sine-polynomials equations . . . . . . . 17--17
A. Marcelo and
F. Marcelo and
C. Rodríguez Radicals of primary submodules . . . . . 17--17
I. Ojeda Martínez de Castilla and
R. Piedra Sánchez Index of nilpotency of binomial ideals 18--18
A. Montes Basic algorithms for specialization in
Gröbner bases . . . . . . . . . . . . . . 18--18
F. Orecchia Implicitization of a general union of
parametric varieties . . . . . . . . . . 18--18
J. Peralta and
B. Torrecillas Graded codes by G-sets . . . . . . . . . 18--18
J. F. San Juan and
A. Abad and
S. Serrano and
A. Gavín Solving problems symbolically by using
Poisson Series Processors . . . . . . . 18--19
J. R. Sendra and
C. Villarino Optimal reparameterization of polynomial
algebraic curves . . . . . . . . . . . . 19--19
Peter Berman Computing the Galois group of $ y^{(3)}
+ a y' + b y = 0, a, b \in \mathcal
{C}[x] $ . . . . . . . . . . . . . . . . 20--20
Rao F. H. Khan and
N. Ahmad A comparison of symbolic solution of
radioactive decay chains using
Mathematica . . . . . . . . . . . . . . 20--20
Laurent Bernardin A Java framework for massively
distributed symbolic computing . . . . . 20--21
Eugene Zima ISSAC'99 Poster Abstracts: Session I . . 20--27
Lemme Group CtCoq: an environment for mathematical
reasoning . . . . . . . . . . . . . . . 21--22
Bruce W. Char and
Anthony Harrison and
Thomas Hewett and
Ron Perline and
Muksim Rakhimov Developing the Soliton Explorer: a
problem solving environment for soliton
surface investigation . . . . . . . . . 22--23
Edgardo S. Cheb-Terrab and
Theodore Kolokolnikov and
Austin D. Roche The search for and classification of
integrable Abel ODE classes . . . . . . 23--24
David Clark and
James McCarron Modules for Maple . . . . . . . . . . . 24--25
David De Wit Automatic construction of an R Matrix 25--25
Richard J. Fateman Symbolic execution and NaNs: diagnostic
tools for tracking scientific
computation . . . . . . . . . . . . . . 25--26
Richard J. Fateman and
Eylon Caspi Parsing \TeX into mathematics . . . . . 26--26
Greg Fee Gauss--Legendre quadrature . . . . . . . 26--26
Cassidy Gentle Computing greatest common divisors of
polynomial matrices . . . . . . . . . . 26--27
P. Gordan Invariants of Binary Forms . . . . . . . 28--32
Mark Giesbrecht Message from the Editor . . . . . . . . 1--1
Hans J. Stetter The Nearest Polynomial with a Given
Zero, and Similar Problems . . . . . . . 2--4
Robert H. Lewis and
Michael Wester Comparison of polynomial-oriented
computer algebra systems . . . . . . . . 5--13
Elisabetta Fortuna and
Patrizia Gianni Square-Free Decomposition in Finite
Characteristic: an Application to Jordan
Form Computation . . . . . . . . . . . . 14--32
M.-J. Gonzalez-Lopez and
L. Gonzalez-Vega and
C. Traverso and
A. Zanoni Gröbner Bases Specialization through
Hilbert Functions: The Homogeneous Case 1--8
Tateaki Sasaki and
Daiju Inaba Hensel Construction of $ {F}(x, u_1,
\ldots {}, u_\ell), \ell \geq 2 $, at a
Singular Point and Its Applications . . 9--17
K. Hare Rapid computation of Bernoulli and
related numbers . . . . . . . . . . . . 18--19
Eugene Zima ISSAC'99 Poster Abstracts: Session II 18--31
Birkett Huber Computing Gröbner fans of toric ideals 19--20
Hiroshi Kai and
Matu-Tarow Noda Hybrid computation of bivariate rational
interpolation . . . . . . . . . . . . . 20--21
Nainn-Ping Ke Symbolic and algebraic computation in
robust stability analysis . . . . . . . 21--21
Robert H. Lewis Comparison of polynomial-oriented
computer algebra systems . . . . . . . . 24--24
Hirokazu Murao $ 2 W $-ary algorithm for extended
problem of integer GCD . . . . . . . . . 25--25
Bogdan A. Popov Optimal starting approximation and
iterative algorithm for inverse error
function . . . . . . . . . . . . . . . . 25--26
Yosuke Sato Parallel computation of Boolean Gröbner
bases . . . . . . . . . . . . . . . . . 27--28
Nicolas M. Thiéry Algebraic invariants of graphs: a
computer aided study . . . . . . . . . . 29--29
Harrison Tsai Weyl closure of a $D$-ideal . . . . . . 29--30
Volker Weispfenning Deciding linear-exponential problems . . 30--31
Greg Reid ISSAC'2001: International Symposium on
Symbolic and Algebraic Computation . . . 32--32
Mike Dewar Special Issue on OpenMath: Message from
the Guest Editor . . . . . . . . . . . . 1--1
Mike Dewar OpenMath: An Overview . . . . . . . . . 2--5
David Carlisle OpenMath, MathML, and XSL . . . . . . . 6--11
James H. Davenport On Writing OpenMath Content Dictionaries 12--15
James H. Davenport A Small OpenMath Type System . . . . . . 16--21
Hél\`ene Prieto and
Stéphane Dalmas and
Yves Papegay Mathematica as an OpenMath application 22--26
Arrigo Triulzi OpenMath support under CSL-hosted \sc
Reduce . . . . . . . . . . . . . . . . . 27--30
Luis Alvarez Sobreviela A Reduce-based OpenMath $
\leftrightarrow $ MathML Translator . . 31--32
Olga Caprotti and
Arjeh M. Cohen and
Manfred Riem JAVA Phrasebooks for Computer Algebra
and Automated Deduction . . . . . . . . 33--37
Laurent Dirat JOME, a Software Component for
Interactive and Distributed Mathematics 38--42
Michael Kohlhase OMDoc: An Infrastructure for OpenMath
Content Dictionary Information . . . . . 43--48
Francis J. Wright Interactive Mathematics via the Web
using MathML . . . . . . . . . . . . . . 49--57
Robert M. Corless and
James H. Davenport and
David J. Jeffrey and
Stephen M. Watt ``According to Abramowitz and Stegun''
or $ \arccoth $ needn't be uncouth . . . 58--65
Andreas Strotmann and
Ladislav Kohout OpenMath: compositionality achieved at
last . . . . . . . . . . . . . . . . . . 66--72
Christian Schulzky and
Astrid Franz and
Karl Heinz Hoffmann Resistance Scaling and Random Walk
Dimensions for Finitely Ramified
Sierpinski Carpets . . . . . . . . . . . 1--8
Nicolas M. Thiéry Algebraic invariants of graphs; a study
based on computer exploration . . . . . 9--20
Anonymous East Coast Computer Algebra Day: May 13,
2000, Ontario Research Centre for
Computer Algebra, University of Western
Ontario, London, Ontario, Canada:
Abstracts of Invited Talks . . . . . . . 21--21
Anonymous East Coast Computer Algebra Day: May 13,
2000, Ontario Research Centre for
Computer Algebra, University of Western
Ontario, London, Ontario, Canada:
Abstracts of Posters . . . . . . . . . . 22--27
Anonymous Southern Ontario Numerical Analysis Day:
May 12, 2000, Ontario Research Centre
for Computer Algebra, University of
Western Ontario, London, Ontario,
Canada: Abstracts of Invited Talks . . . 28--28
Anonymous Southern Ontario Numerical Analysis Day:
May 12, 2000, Ontario Research Centre
for Computer Algebra, University of
Western Ontario, London, Ontario,
Canada: Abstracts of Invited Talks . . . 29--31
S. A. Abramov A Note on the Number of Division Steps
in the Euclidean Algorithm . . . . . . . 1--2
Rainer Steinwandt On computing a separating transcendence
basis . . . . . . . . . . . . . . . . . 3--6
Robert M. Corless An Elementary Solution of a Minimax
Problem Arising in Algorithms for
Automatic Mesh Selection . . . . . . . . 7--15
Christopher Essex and
Matt Davison and
Christian Schulzky Numerical Monsters . . . . . . . . . . . 16--32
Robert M. Corless Message from the SIGSAM Chair . . . . . 1--2
Barton L. Willis An Extensible Differential Equation
Solver . . . . . . . . . . . . . . . . . 3--7
Robert M. Corless Review of \em Modern Computer Algebra,
by Joachim von zu Gathen and Jügen
Gerhard . . . . . . . . . . . . . . . . 8--13
Mark Daley Review of \em Quantum Computing and
Quantum Information, by Michael A.
Nielson and Issac L. Chuang . . . . . . 14--15
Olaf Bonorden and
Joachim von zur Gathen and
Jürgen Gerhard and
Olaf Müller and
Michael Nöcker Factoring a binary polynomial of degree
over one million . . . . . . . . . . . . 16--18
Ilias S. Kotsireas Homotopies and polynomial system solving
I: Basic principles . . . . . . . . . . 19--32
S. Egner and
J. Johnson and
D. Padua and
M. Püschel and
J. Xiong Automatic Derivation and Implementation
of Signal Processing Algorithms . . . . 1--19
G. P. Egorychev and
V. M. Levchuk Enumeration in the Chevalley algorithm 20--34
Anonymous Announcements: AAECC-14 Applied Algebra,
Algebraic Algorithms and Error
Correcting Codes . . . . . . . . . . . . 35--35
Anonymous Call for Papers: Latin American
Theoretical INformatics --- LATIN '2002 36--36
H. Q. Le Computing the Minimal Telescoper for
Sums of Hypergeometric Terms . . . . . . 2--10
D. Lazard Solving Systems of Algebraic Equations 11--37
H. Kredel Announcement: Rhine Workshop on Computer
Algebra . . . . . . . . . . . . . . . . 38--38
J. Calmet Announcement: Workshop on Under- and
Over-Determined Systems of Algebraic or
Differential Equations . . . . . . . . . 39--39
M. Giusti Announcement: International Symposium on
Symbolic and Algebraic Computation . . . 40--40
Jeffrey M. Dambacher and
Philippe A. Rossignol The Golden Rule of Complementary
Feedback . . . . . . . . . . . . . . . . 1--9
Antonio Montes Abstracts of the Sixth Spanish Meeting
on Computer Algebra and Applications:
EACA-2000 [Barcelona, Spain, September
6--8, 2001] . . . . . . . . . . . . . . 10--23
Julio Robino Abstracts of the Seventh Spanish Meeting
on Computer Algebra and Applications:
EACA-2001 [Ezcaray, La Rioja, Spain,
September 12--14, 2001] . . . . . . . . 24--39
Anonymous East Coast Computer Algebra Day 2002:
Announcement and Call for Participation 40--40
Robert M. Corless Message from the SIGSAM Chair . . . . . 1--2
Bruno Buchberger Computer Algebra: The End of
Mathematics? . . . . . . . . . . . . . . 3--9
Mhenni Benghorbal and
Robert M. Corless The $n$ th Derivative . . . . . . . . . 10--14
W. John Braun and
Hao Yu Review: \em Weighing the Odds, by D.
Williams . . . . . . . . . . . . . . . . 15--17
D. J. Jeffrey and
Ilias S. Kotsireas Table of Conferences and Events . . . . 17--17
V. M. Babich and
Yu. N. Bibikov and
S. Yu. Slavyanov and
N. V. Svanidze and
T. F. Pankratova and
V. Novikova Workshop on Differential Equations:
Dedicated to the memory of Vladimir
Lazutkin, St.Petersburg, Russia, August
18--20, 2002 . . . . . . . . . . . . . . 18--18
William Sit East Coast Computer Algebra Day . . . . 19--21
Ilias S. Kotsireas ACA 2002 8th International Conference on
Applications of Computer Algebra June
25--28, 2002, Volos, Greece . . . . . . 22--22
H. Schenck CBMS Lecture Series at Texas A&M
University: Solving Systems of
Polynomial Equations, May 20--24, 2002,
by Bernd Sturmfels (UC Berkeley) . . . . 23--23
Daniel Duparc and
Bernard Mourrain and
Bernard Parisse and
Fabrice Rouillier and
Marie-Françoise Roy and
Nicolas Thiéry and
Paul Zimmermann Workshop on Open Source Computer
Algebra, Tuesday 21st -- Thursday 23rd
of May 2002, Lyon, France . . . . . . . 24--27
Tim Daly Axiom as Open Source . . . . . . . . . . 28--28
L. Padovani MathML International Conference 2002:
MathML and Technologies for Math on the
Web June 28--30, 2002 Hickory Ridge
Conference Center, Chicago, Illinois . . 29--30
G. J. Reid Symbolic Computational Algebra 2002:
Fields Institute special meeting on
Symbolic and Numeric Computation in
Geometry, Algebra and Analysis, July
15--19, 2002, The University of Western
Ontario, London, Ontario, Canada \tt
http://www.orcca.on.ca/sca2002 . . . . . 31--31
Drumi Bainov Thirteenth International Colloquium on
Differential Equations . . . . . . . . . 32--32
Greg Reid and
Chris Smith and
Jan Verschelde Geometric completion of differential
systems using numeric-symbolic
continuation . . . . . . . . . . . . . . 1--17
Astrid Franz and
Christian Schulzky and
Karl Heinz Hoffmann Using computer algebra methods to
determine the chemical dimension of
finitely ramified Sierpinski carpets . . 18--30
William Y. Sit East Coast Computer Algebra day: ECCAD
2002 poster and demonstration abstracts 1--1
Tateaki Sasaki and
Akira Terui A formula for separating small roots of
a polynomial . . . . . . . . . . . . . . 19--23
Gene Cooperman and
Xiaoqin Ma Overcoming the memory wall in symbolic
algebra: a faster permutation
multiplication . . . . . . . . . . . . . 1--4
Michael P. Barnett Computer algebra in the life sciences 5--32
Ehrenfried Walter von Tschirnhaus and
R. F. Green A method for removing all intermediate
terms from a given equation . . . . . . 1--3
Richard Fateman Comparing the speed of programs for
sparse polynomial multiplication . . . . 4--15
Philippe Gimenez Abstracts of the eighth Spanish meeting
on computer algebra and applications:
EACA-2002 . . . . . . . . . . . . . . . 16--27
Matt Davison Book Review: Review of risk management:
value at risk and beyond, edited by M.
A. H. Dempster. Cambridge University
Press 2002 . . . . . . . . . . . . . . . 28--29
Michael Abramson Historical Background for B. Renschuch's
papers . . . . . . . . . . . . . . . . . 33--34
Bodo Renschuch and
Hartmut Roloff and
Georgij G. Rasputin and
Michael Abramson Contributions to constructive polynomial
ideal theory XXIII: forgotten works of
Leningrad mathematician N. M. Gjunter on
polynomial ideal theory . . . . . . . . 35--48
Michael P. Barnett Symbolic computation of integrals by
recurrence . . . . . . . . . . . . . . . 49--63
David J. Jeffrey Message from the Editor . . . . . . . . 63--63
Anonymous Call for Participation: ASCM 2003: The
Sixth Asian Symposium on Computer
Mathematics, October 23--25, 2003
Beijing, China . . . . . . . . . . . . . 64--64
Olga Caprotti International Symposium on Symbolic and
Algebraic Computation: poster abstracts
2003 . . . . . . . . . . . . . . . . . . 65--65
B. Jüttler and
J. Schicho and
M. Shalaby $ C^1 $ spline implicitization of planar
curves . . . . . . . . . . . . . . . . . 65--65
Fabrizio Caruso Interpolation in symbolic summation . . 66--66
Arthur D. Chtcherba and
Deepak Kapur On the relationship between the
Dixon-based resultant construction and
the supports of polynomial systems . . . 66--67
Robert M. Corless and
Hiroshi Kai and
Stephen M. Watt Approximate computation of
pseudovarieties . . . . . . . . . . . . 67--71
Ruyong Feng and
Xiao-Shan Gao Polynomial solutions for first order
ODEs with constant coefficients . . . . 71--72
Masaaki Kanno and
Malcolm C. Smith Validated numerical methods for systems
and control engineering . . . . . . . . 72--73
Manuel Kauers Computing limits of sequences . . . . . 74--77
Viktor Levandovskyy and
Hans Schönemann Using computer algebra system
SINGULAR:PLURAL for computations in
noncommutative polynomial algebras . . . 77--78
Ilias Kotsireas and
Edmond Lau and
Richard Voino Exact implicitization of polynomial
curves and surfaces . . . . . . . . . . 78--78
Ludovic Meunier MAD: a flexible system for authoring
mathematical documents . . . . . . . . . 79--81
Masayuki Noro and
Kazuhiro Yokoyama Implementation of prime decomposition of
polynomial ideals over small finite
fields . . . . . . . . . . . . . . . . . 81--82
Clément Pernet and
Zhendong Wan LU based algorithms for characteristic
polynomial over a finite field . . . . . 83--84
Wu Tian-Jiao On optimization problems . . . . . . . . 87--88
Burkhard Zimmermann A Sister Celine type algorithm for
definite summation and integration . . . 89--89
Victor S. Adamchik and
David J. Jeffrey Polynomial transformations of
Tschirnhaus, Bring and Jerrard . . . . . 90--94
Christopher W. Brown QEPCAD B: a program for computing with
semi-algebraic sets using CADs . . . . . 97--108
Richard Fateman Memory cache and Lisp: faster list
processing via automatically rearranging
memory . . . . . . . . . . . . . . . . . 109--116
Tanush Shaska Computational algebra and algebraic
curves . . . . . . . . . . . . . . . . . 117--124
Alex Buchel Review of \em D-Branes by Clifford V.
Johnson. Cambridge University Press 2002 125--127
John Michael McNamee A comparison of methods for accurate
summation . . . . . . . . . . . . . . . 1--7
Martine Ceberio and
Vladik Kreinovich Greedy algorithms for optimizing
multivariate Horner schemes . . . . . . 8--15
Gene Cooperman The TOP-C parallel model and symbolic
algebra . . . . . . . . . . . . . . . . 16--17
John Abbott CoCoA: a laboratory for computations in
commutative algebra . . . . . . . . . . 18--19
Michael McGettrick Online Gröbner Basis [OGB] . . . . . . . 19--21
A. Dhooge and
W. Govaerts and
Yu. A. Kuznetsov MATCONT: a Matlab package for numerical
bifurcation analysis of ODEs . . . . . . 21--22
Christopher W. Brown QEPCAD B: a system for computing with
semi-algebraic sets via cylindrical
algebraic decomposition . . . . . . . . 23--24
Joris van der Hoeven GNU TeXmacs . . . . . . . . . . . . . . 24--25
Manfred Minimair MR: Macaulay Resultant package for Maple 26--27
Robert H. Lewis Using Fermat to solve large polynomial
and matrix problems . . . . . . . . . . 27--28
Zhonggang Zeng A Matlab package computing polynomial
roots and multiplicities . . . . . . . . 28--29
Bob Caviness and
Barbara Gatje and
James H. Griesmer and
Tony Hearn and
Manual Bronstein and
Erich Kaltofen In Memoriam: Richard Dimick Jenks: Axiom
Developer and Computer Algebra Pioneer 30--30
Clemens Ballarin and
Manuel Kauers Solving parametric linear systems: an
experiment with constraint algebraic
programming . . . . . . . . . . . . . . 33--46
William M. Farmer MKM: a new interdisciplinary field of
research . . . . . . . . . . . . . . . . 47--52
Laureano González-Vega and
Tomás Recio Review of ``Computational Commutative
Algebra I'' by Martin Kreuzer and
Lorenzo Robbiano, Springer-Verlag, 2000,
ISBN 3-540-67733-X . . . . . . . . . . . 53--55
D. J. Jeffrey and
A. C. Norman Not seeing the roots for the branches:
multivalued functions in computer
algebra . . . . . . . . . . . . . . . . 57--66
J. De Beule and
A. Hoogewijs and
L. Storme On the size of minimal blocking sets of
$ Q(4; q), \mathrm { for } q = 5, 7 $ 67--84
Tateaki Sasaki A theorem for separating close roots of
a polynomial and its derivatives . . . . 85--92
Ilias Kotsireas and
Emil Volcheck ANTS VI: algorithmic number theory
symposium poster abstracts . . . . . . . 93--107
Joshua Holden Distribution of the error in estimated
numbers of fixed points of the discrete
logarithm . . . . . . . . . . . . . . . 111--118
Kosaku Nagasaka Towards more accurate separation bounds
of empirical polynomials . . . . . . . . 119--129
Daiju Inaba Factorization of multivariate
polynomials by extended Hensel
construction . . . . . . . . . . . . . . 2--14
Iyad Ajwa East Coast Computer Algebra Day 2005:
poster abstracts . . . . . . . . . . . . 15--25
David Joyner Conjectural permutation decoding of some
AG codes . . . . . . . . . . . . . . . . 26--32
Howard Cheng and
Barry Gergel and
Ethan Kim and
Eugene Zima Space-efficient evaluation of
hypergeometric series . . . . . . . . . 41--52
Stef Graillat A note on a nearest polynomial with a
given root . . . . . . . . . . . . . . . 53--60
William Stein and
David Joyner SAGE: System for Algebra and Geometry
Experimentation . . . . . . . . . . . . 61--64
David Joyner GUAVA: an error-correcting codes package 65--68
Tetsuo Ida In memoriam: Professor Eiichi Goto . . . 71--72
Nargol Rezvani and
Robert M. Corless The nearest polynomial with a given
zero, revisited . . . . . . . . . . . . 73--79
Jin-San Cheng and
Xiao-Shan Gao and
Ming Li Intrinsic topological representation of
real algebraic surfaces . . . . . . . . 80--81
Howard Cheng and
Barry Gergel and
Ethan Kim and
Eugene Zima Space-efficient evaluation of
hypergeometric series . . . . . . . . . 81--83
Ziming Li and
Dabin Zheng Computation with hyperexponential
functions . . . . . . . . . . . . . . . 84--85
Evelyne Hubert and
Irina Kogan Rational and replacement invariants of a
group action . . . . . . . . . . . . . . 85--87
Victor Pan Polynomial root-finding with matrix
eigen-solving . . . . . . . . . . . . . 87--87
F. San Segundo and
J. R. Sendra and
Juana Sendra Offsets from the perspective of
computational algebraic geometry . . . . 87--90
Sonia L. Rueda Finite fans, actions of tori and
$D$-modules . . . . . . . . . . . . . . 90--92
Xiao-Shan Gao and
Gui-Fang Zhang $2$D and $3$D generalized Stewart
Platforms . . . . . . . . . . . . . . . 92--93
Stephen M. Watt Algebraic generalization . . . . . . . . 93--94
Werner Krandick and
Kurt Mehlhorn New bounds for the Descartes method . . 94--94
Tateaki Sasaki and
Daiju Inaba and
Kentaro Katamachi An approach to singularity from the
extended Hensel construction . . . . . . 94--95
Thomas Wolf The package CRACK for solving large
overdetermined systems . . . . . . . . . 95--96
F. Lemaire and
M. Moreno Maza and
Y. Xie The RegularChains library in MAPLE . . . 96--97
X. Dahan and
É. Schost and
M. Moreno Maza and
W. Wu and
Y. Xie On the complexity of the D5 principle 97--98
Nadya Belov and
Colin Koeck and
Werner Krandick and
Joshua Shaffer Mobile mathematics communication . . . . 99--99
Shuhong Gao and
Mingfu Zhu Irreducible decomposition of monomial
ideals . . . . . . . . . . . . . . . . . 99--99
Murray R. Bremner Jordan algebras arising from
intermolecular recombination . . . . . . 106--117
M. G. Epitropakis and
M. N. Vrahatis Root finding and approximation
approaches through neural networks . . . 118--121
Maki Iwami Extension of expansion base algorithm
for multivariate analytic factorization
including the case of singular leading
coefficient . . . . . . . . . . . . . . 122--126
E. C. Laskari and
G. C. Meletiou and
D. K. Tasoulis and
M. N. Vrahatis Transformations of two cryptographic
problems in terms of matrices . . . . . 127--130
Aleksandr Mylläri and
Tapio Salakoski and
Alexey Pasechnik On the visualization of the DNA sequence
and its nucleotide content . . . . . . . 131--135
Aleksandr Mylläri Stability of expanding homographic
configurations: $3$D case . . . . . . . 136--138
Vasily Shapeev Application of CAS to constructing
schemes of superhigh order of accuracy
for heat conduction equation . . . . . . 139--142
George M. Tzoumas and
Ioannis Z. Emiris Apollonius circle conflict . . . . . . . 143--146
Wayne Eberly Letter from the Treasurer . . . . . . . 1--1
Yasushi Umeda and
Tateaki Sasaki Computing determinants of rational
functions . . . . . . . . . . . . . . . 2--8
Zhendong Wan ISSAC 2005 poster abstracts . . . . . . 9--14
Agnes Szanto and
Jan Verschelde and
Zhonggang Zeng Symbolic-numeric computation and
applications: list of abstracts . . . . 15--17
Heinz H. Bauschke and
Martin v. Mohrenschildt Symbolic computation of Fenchel
conjugates . . . . . . . . . . . . . . . 18--28
Ekaterina Shemyakova and
Franz Winkler Approximate factorization of linear
partial differential operators: full
system of invariants for order three . . 34--35
L. M. Berkovich Factorization of self-conjugated and
reducible linear differential operators 35--37
Oleg Golubitsky Construction of rankings on partial
derivatives . . . . . . . . . . . . . . 38--42
Alin Bostan and
Claude-Pierre Jeannerod and
Éric Schost Solving structured linear systems of
large displacement rank . . . . . . . . 42--44
Daiju Inaba and
Takeshi Osoekawa and
Tateaki Sasaki Visualization of extended Hensel factors 44--45
Peter Ullrich Closed-form formulas for projecting
constructible sets in the theory of
algebraically closed fields . . . . . . 45--48
Takeshi Osoekawa and
Tateaki Sasaki Hensel fan . . . . . . . . . . . . . . . 48--49
Werner Krandick and
Shawn S. Pierce and
Zhendong Wan Towards collaboration across display
diversity . . . . . . . . . . . . . . . 49--50
Claudia Fassino A robust monomial quotient basis for
approximate points . . . . . . . . . . . 50--51
Ilias S. Kotsireas and
Eugene A. Zima WWCA 2006 abstracts . . . . . . . . . . 52--59
Xiao-shan Gao Wen-Tsun Wu's academic career . . . . . 60--64
Winfried Just and
Brandilyn Stigler Computing Gröbner bases of ideals of few
points in high dimensions . . . . . . . 67--78
Hans J. Stetter ``Approximate Commutative Algebra'': an
ill-chosen name for an important
discipline . . . . . . . . . . . . . . . 79--81
Zhendong Wan ISSAC 2006 poster abstracts . . . . . . 86--87
William Sit Abstracts of special session on
differential algebra: American
Mathematical Society, Eastern Section
Spring Meeting: Stevens Institute of
Technology, April 14-15, 2007 . . . . . 88--107
David Joyner OSCAS: \tt maxima . . . . . . . . . . . 108--111
Ziming Li and
Min Wu and
Dabin Zheng Testing linear dependence of
hyperexponential elements . . . . . . . 3--11
Markus A. Hitz ECCAD 2007 poster abstracts . . . . . . 12--24
Mark W. Giesbrecht and
Ilias Kotsireas and
Austin Lobo ISSAC 2007 poster abstracts . . . . . . 38--72
David R. Stoutemyer Useful Computations Need Useful Numbers 75--99
Ekaterina Shemyakova Symbolic-algebraic methods for linear
partial differential operators . . . . . 100--100
Yuzhen Xie Fast algorithms, modular methods,
parallel approaches and software
engineering for solving polynomial
systems symbolically . . . . . . . . . . 101--101
Bican Xia DISCOVERER: a tool for solving
semi-algebraic systems . . . . . . . . . 102--103
Katsusuke Nabeshima PGB: a package for computing parametric
Gröbner and related objects . . . . . . . 104--105
Kosaku Nagasaka SNAP package for Mathematica . . . . . . 105--106
Akira Suzuki and
Yosuke Sato Implementation of CGS and CGB on
Risa/Asir and other computer algebra
systems using Suzuki--Sato algorithm . . 107--108
Steve Linton GAP: groups, algorithms, programming . . 108--109
Fritz Schwarz ALLTYPES in the web . . . . . . . . . . 109--110
Roman Pearce and
Michael Monagan A Maple library for high performance
sparse polynomial arithmetic . . . . . . 110--111
John Abbott and
Anna Bigatti and
Massimo Caboara and
Lorenzo Robbiano CoCoA: computations in commutative
algebra . . . . . . . . . . . . . . . . 111--112
Hitoshi Yanami and
Hirokazu Anai SyNRAC: a Maple toolbox for solving real
algebraic constraints . . . . . . . . . 112--113
William S. Page Axiom: open source computer algebra
system . . . . . . . . . . . . . . . . . 114--114
Peter Borwein and
Erich Kaltofen and
Michael J. Mossinghoff Irreducible polynomials and Barker
sequences . . . . . . . . . . . . . . . 118--121
Adrian Dumitrescu and
Guangwu Xu On a query algorithm for a divisibility
problem . . . . . . . . . . . . . . . . 122--124
Wenqin Zhou Symbolic computation techniques for
solving large expression problems from
mathematics and engineering . . . . . . 125--126
Michael P. Barnett Reasoning in symbolic computation . . . 1--17
George E. Andrews and
Peter Paule Further developments in MacMahon's
partition analysis (abstract only) . . . 18--18
Lara K. Pudwell How to cleverly count pattern-avoiding
words (abstract only) . . . . . . . . . 18--18
Marko Petkovsek Solving multivariate linear recurrences
in wedges (abstract only) . . . . . . . 18--19
Sara C. Billey and
Stephen A. Mitchell Affine colored partitions (abstract
only) . . . . . . . . . . . . . . . . . 19--19
William Y. C. Chen and
Ernest X. W. Xia The $q$-WZ method for infinite sums
(abstract only) . . . . . . . . . . . . 19--19
Carsten Schneider Multi-summation in difference fields
(abstract only) . . . . . . . . . . . . 19--19
Doron Zeilberger and
Thotsaporn Aek Thanatipanonda Computer-generated conjectures(!) and
proofs(!!) in combinatorial game theory
(abstract only) . . . . . . . . . . . . 19--20
Thotsaporn Aek Thanatipanonda Computer-generated conjectures(!) and
proofs(!!) in combinatorial game theory
(II) (abstract only) . . . . . . . . . . 20--20
Nicolas M. Thiery Implementing Algebraic Combinatorics:
Some feedback from the development of
MuPAD--Combinat (abstract only) . . . . 20--20
Mikael Vejdemo-Johansson Enumerating the Saneblidze--Umble
diagonal in Haskell (abstract only) . . 20--20
Ana Romero Ibáñez Ibáñez Homologa efectiva y sucesiones
espectrales (abstract only) . . . . . . 21--21
Silvana Ilie Computational complexity of numerical
solutions of initial value problems for
differential algebraic equations
(abstract only) . . . . . . . . . . . . 21--22
Elias P. Tsigaridas Algebraic computations and applications
to geometry (abstract only) . . . . . . 22--22
Anonymous In Memoriam Eugeny Pankratiev: Faculty
of Mechanics and Mathematics, Moscow
State University, Moscow, Russia . . . . 23--26
Mark Giesbrecht ACM 2007 Kanellakis Award Honours Bruno
Buchberger, Innovator of Automated Tools
for Mathematics . . . . . . . . . . . . 37--38
David Joyner Open source computer algebra systems:
Axiom . . . . . . . . . . . . . . . . . 39--47
Andrew Arnold and
Michael Monagan Calculating really big cyclotomic
polynomials (abstract only) . . . . . . 48--49
Kevin Doerksen Genus 2 curves with split Jacobians
(abstract only) . . . . . . . . . . . . 49--50
Andrej Dujella A variant of Wiener's attack on RSA with
small secret exponent . . . . . . . . . 50--51
Frédéric A. B. Edoukou Computing the 2-distribution of points
on Hermitian surfaces (abstract only) 52--53
Noam D. Elkies Curves of genus 2 with many rational
points via K3 surfaces (abstract only) 53--55
Felix Fontein Abstract Infrastructures of Unit Rank
Two (abstract only) . . . . . . . . . . 55--56
Steven Galbraith and
Raminder S. Ruprai Computing $L$-polynomials of
non-hyperelliptic genus 4 and 5 curves
(abstract only) . . . . . . . . . . . . 56--57
Joshua Holden and
Nathan Lindle A statistical look at maps of the
discrete logarithm (abstract only) . . . 57--59
Sonal Jain Minimal heights and regulators for
elliptic surfaces (abstract only) . . . 59--61
Ahmad Lavasani and
Reza Mohammadi Implementing a feasible attack against
ECC2K-130 Certicom Challenge (abstract
only) . . . . . . . . . . . . . . . . . 61--62
Sidi Mohamed Sedjelmaci A straight line program computing the
integer greatest common divisor
(abstract only) . . . . . . . . . . . . 62--64
Masaya Yasuda The discrete logarithm problem on
elliptic curves defined over $Q$
(abstract only) . . . . . . . . . . . . 64--66
Saleh Al-shomrani and
Paul Wang DMAS: a Web-based distributed
mathematics assessment system (abstract
only) . . . . . . . . . . . . . . . . . 67--68
Amine Benkiran Brouwer's fixed point theorem (abstract
only) . . . . . . . . . . . . . . . . . 68--69
Brandon Burkhart Models of population dynamics (abstract
only) . . . . . . . . . . . . . . . . . 69--69
Elena S. Dimitrova and
Brandilyn Stigler and
Abdul Salam Jarrah and
Reinhard Laubenbacher Applications of the Gröbner fan to gene
network reconstruction (abstract only) 69--69
Caroline Ebersole The population biology of infectious
diseases (abstract only) . . . . . . . . 70--70
Shuhong Gao and
Mingfu Zhu An incremental algorithm for irreducible
decompositions of monomial ideals
(abstract only) . . . . . . . . . . . . 70--70
Osman Guzide and
Kenneth May and
James Getz and
Adam Edgeson New algebraic design for better P2P
features (abstract only) . . . . . . . . 70--71
Maki Iwami An attack on improved algebraic surface
public-key cryptosystem (abstract only) 71--74
Josh Jones The RSA algorithm (abstract only) . . . 74--74
David Joyner and
Robert Miller SAGE and coding theory (abstract only) 74--78
Michael A. Kelsey Dethroning Fibonacci Sequence (abstract
only) . . . . . . . . . . . . . . . . . 78--78
Xun Lai and
Paul S. Wang GeometryEditor: a Web-based interactive
geometry manipulative authoring system
(abstract only) . . . . . . . . . . . . 78--79
Robert Lewis Comparing acceleration techniques for
the Dixon and Macaulay resultants
(abstract only) . . . . . . . . . . . . 79--81
Dongmei Li and
Jinwang Liu and
Shuhong Gao The $w$-Gröbner bases and monomial ideal
under polynomial composition (abstract
only) . . . . . . . . . . . . . . . . . 81--82
John P. May and
Mark Giesbrecht and
Daniel Roche and
Marc Moreno Maza and
Yuzhen Xie Automatic variable order selection for
polynomial system solving (abstract
only) . . . . . . . . . . . . . . . . . 83--83
Robert W. McGrail and
Mary Sharac Tricoloring as a corrective measure
(abstract only) . . . . . . . . . . . . 83--85
Andrew Novocin Factoring univariate polynomials over
the rationals (abstract only) . . . . . 85--85
Matthew Prince The concept of derivatives using
abstract algebra (abstract only) . . . . 85--86
Robert Quinn and
Hoon Hong Connectivity in semialgebraic sets
(abstract only) . . . . . . . . . . . . 86--86
Sean Riley Origami and mathematics (abstract only) 86--86
Daniel Roche and
Mark Giesbrecht Detecting polynomial perfect powers
(abstract only) . . . . . . . . . . . . 87--87
Wei Su and
Chuan Cai and
Paul S. Wang and
Lian Li A solution for online entering and
editing mathematical formulas (abstract
only) . . . . . . . . . . . . . . . . . 87--88
Mingsheng Wang and
Jinwang Liu Factorization problems on $n$-D
polynomial matrices (abstract only) . . 88--89
Stephen M. Watt On the functional decomposition of
multivariate Laurent polynomials
(abstract only) . . . . . . . . . . . . 89--90
Randall Wolfe Divisibility tests (abstract only) . . . 90--90
George Yuhasz and
Erich Kaltofen Computing minimal generators of integer
matrix sequences (abstract only) . . . . 91--91
Dean Zeller An introduction to programming
curriculum including elements of
mathematics, art, and creative writing
(abstract only) . . . . . . . . . . . . 91--91
Wei Zhou Efficient order basis computation
(abstract only) . . . . . . . . . . . . 91--91
Mack Giesbrecht The MICA 2008 Conference, Preface and
Abstracts . . . . . . . . . . . . . . . 92--102
Ilias S. Kotsireas Mathematical Methods in Computer Science
2008: MMICS 2008, December 17--19, 2008,
Karlsruhe, Germany . . . . . . . . . . . 103--103
Anonymous 10th International Symposium on Symbolic
and Numeric Algorithms for Scientific
Computing, Timisoara, Romania, September
26--29, 2008 . . . . . . . . . . . . . . 104--104
Benno Fuchssteiner Modified Gauss algorithm for matrices
with symbolic entries . . . . . . . . . 108--121
Kosaku Nagasaka Approximate polynomial GCD over integers 124--126
Tateaki Sasaki and
Daiju Inaba Convergence domain of series expansions
of multivariate algebraic functions . . 127--128
Howard Cheng and
George Labahn and
Wei Zhou Computing polynomial LCM and GCD in
Lagrange basis . . . . . . . . . . . . . 129--130
Thomas Wolf On solving large systems of polynomial
equations appearing in discrete
differential geometry . . . . . . . . . 131--134
Bruno Buchberger and
Georg Regensburger and
Markus Rosenkranz and
Loredana Tec General polynomial reduction with TH 9
OREM 8 functors: applications to
integro-differential operators and
polynomials . . . . . . . . . . . . . . 135--137
Massimo Caboara and
Fabrizio Caruso Group actions on Gröbner bases of
saturated zero-dimensional binomial
ideals . . . . . . . . . . . . . . . . . 138--139
Shutaro Inoue and
Kohei Mukaida and
Akira Suzuki and
Yosuke Sato Computation of inverses in residue class
rings with parameters . . . . . . . . . 140--141
Ivan Morel and
Damien Stehlé and
Gilles Villard From an LLL-reduced basis to another . . 142--143
Masaaki Kanno and
Kazuhiro Yokoyama and
Hirokazu Anai Solution of the algebraic Riccati
equation using the sum of roots . . . . 144--145
Lim Yohanes Stefanus De Boor--Fix dual functionals for
transformation from polynomial basis to
convolution basis . . . . . . . . . . . 146--148
Xiao-Shan Gao and
Zhenyu Huang A characteristic set method for equation
solving over finite fields . . . . . . . 149--150
G. Ch\`eze and
M. Elkadi and
A. Galligo and
M. Weimann Absolute factoring of bidegree bivariate
polynomials . . . . . . . . . . . . . . 151--153
Annie Cuyt and
Wen-shin Lee Sparse multivariate polynomial
interpolation via the
quotient-difference algorithm . . . . . 154--155
Mhenni M. Benghorbal Unified formulas for arbitrary order
symbolic derivatives and
anti-derivatives of the power-inverse
hyperbolic class 1 . . . . . . . . . . . 156--156
Andy Novocin and
Mark van Hoeij Factoring univariate polynomials over
the rationals . . . . . . . . . . . . . 157--157
Shuichi Moritsugu and
Chisato Arai Geometry theorem proving by Gröbner
bases: using ideal decompositions . . . 158--159
Ioannis Emiris and
Bernard Mourrain and
Elias Tsigaridas Computing a rational in between . . . . 160--161
Changbo Chen and
Liyun Li and
Marc Moreno Maza and
Wei Pan and
Yuzhen Xie On the representation of constructible
sets . . . . . . . . . . . . . . . . . . 162--163
Ziming Li and
Martin Ondera and
Huaifu Wang Simplifying skew fractions modulo
differential and difference relations 164--165
Andrey V. Banshchikov Analysis of dynamics of
large-dimensional mechanical systems by
the tools of computer algebra . . . . . 166--166
Kelly Roach Solving integrals with the quantum
computer algebra system . . . . . . . . 167--168
Alberto Arri The F5 criterion revised . . . . . . . . 169--170
Xin Li and
Marc Moreno Maza and
Raqeeb Rasheed and
Éric Schost The modpn library: bringing fast
polynomial arithmetic into MAPLE . . . . 172--174
Tatsuyoshi Hamada and
KNOPPIX/Math committers KNOPPIX/Math: a live system for enjoying
mathematics with computer . . . . . . . 175--176
Zhonggang Zeng ApaTools: a software toolbox for
approximate polynomial algebra . . . . . 177--179
G. M. Greuel and
G. Pfister and
H. Schönemann SINGULAR: a computer algebra system for
polynomial computations . . . . . . . . 180--181
Changbo Chen and
Marc Moreno Maza and
François Lemaire and
Wei Pan and
Liyun Li and
Yuzhen Xie The ConstructibleSetTools and
ParametricSystemTools modules of the
RegularChains library in Maple . . . . . 182--184
Fritz Schwarz ALLTYPES in the Web . . . . . . . . . . 185--187
Emanuel Sperner On a combinatorial theorem of Macaulay
and its applications to the theory of
polynomial ideals . . . . . . . . . . . 192--201
Giuliano Casale An application of exact linear algebra
to capacity planning models . . . . . . 202--205
David R. Stoutemyer Multivariate partial fraction expansion 206--210
Kevin A. Broughan An algorithm for the explicit evaluation
of $ \hbox {GL}(n R) $ Kloosterman sums 1--10
Emmanuel Thomé Abstracts of the CADO workshop on
integer factorization . . . . . . . . . 11--14
Anthony C. Hearn REDUCE is free software as of January
2009 . . . . . . . . . . . . . . . . . . 15--16
Anonymous Conference announcements . . . . . . . . 17--20
Michael P. Abramson Historical background to Gröbner's paper 22--23
Wolfgang Gröbner On the algebraic properties of integrals
of linear differential equations with
constant coefficients . . . . . . . . . 24--46
David Joyner AMS special session on SAGE and
mathematical research using open source
software . . . . . . . . . . . . . . . . 49--54
Jürgen Gerhard and
D. J. Jeffrey and
Guillaume Moroz A package for solving parametric
polynomial systems . . . . . . . . . . . 61--72
David R. Stoutemyer Unit normalization of multinomials over
Gaussian integers . . . . . . . . . . . 73--76
C. Bertone and
G. Chéze and
A. Galligo Probabilistic algorithms for polynomial
absolute factorization . . . . . . . . . 77--78
Howard Cheng and
George Labahn Applying linear algebra routines to
modular ore polynomial matrix algorithms 78--79
Annie Cuyt and
Wen-shin Lee Symbolic-numeric sparse interpolation of
multivariate rational functions . . . . 79--80
Javier Esparza and
Andreas Gaiser and
Stefan Kiefer On least fixed points of systems of
positive polynomials . . . . . . . . . . 81--83
Shutaro Inoue and
Yosuke Sato Implementation of Boolean Gröbner bases
in Risa/Asir . . . . . . . . . . . . . . 83--84
Claude-Pierre Jeannerod and
Christophe Mouilleron and
Gilles Villard Extending Cardinal's algorithm to a
broader class of structured matrices . . 84--85
Marc Moreno Maza and
Yuzhen Xie Balanced dense polynomial multiplication
on multi-cores . . . . . . . . . . . . . 85--87
Hiroshi Murakami A continued fraction type method to find
a rational number in a given closed
interval whose denominator is minimal 88--90
Hiroki Nakayama and
Hiroshi Sekigawa Determining divisibility between
polynomials with inexact coefficients 91--94
Moshe Porat A vector-quantization approach to coding
systems . . . . . . . . . . . . . . . . 94--96
Bjarke Hammersholt Roune A slice algorithm for Koszul simplicial
complexes on the LCM lattice of monomial
ideals . . . . . . . . . . . . . . . . . 96--98
Eduardo Sáenz de Cabezón and
Henry P. Wynn Efficient algorithms for the algebraic
analysis of system reliability . . . . . 98--99
Tateaki Sasaki and
Yasutaka Ookura Approximate factorization of polynomials
in $ Z[x] $ . . . . . . . . . . . . . . 99--101
Nikta Shayanfar and
Mahmoud Hadizadeh Computer algebraic efficiency of matrix
polynomials for a system of integral
equations . . . . . . . . . . . . . . . 101--102
Kiyoshi Shirayanagi and
Hiroshi Sekigawa A new method of reducing exact
computations to obtain exact results . . 102--104
Akira Suzuki Computing Gröbner bases within linear
algebra and its implementation . . . . . 104--105
David Joyner Open source computer algebra systems:
GAP . . . . . . . . . . . . . . . . . . 110--118
Christoph Koutschan Advanced applications of the holonomic
systems approach . . . . . . . . . . . . 119--119
Xin Li Toward high-performance polynomial
system solvers based on triangular
decompositions . . . . . . . . . . . . . 120--120
David Richardson Efficient programming techniques for the
SACLIB computer algebra library . . . . 120--120
Hui Ding Numerical and symbolic computation of
the Lambert $W$ function in $ C^{n
\times n}$ . . . . . . . . . . . . . . . 121--121
D. J. Jeffrey LU factoring of non-invertible matrices 1--8
Alin Bostan and
Shaoshi Chen and
Frédéric Chyzak and
Ziming Li Rational-functions telescopers: blending
creative telescoping with Hermite
reduction . . . . . . . . . . . . . . . 9--10
Montserrat Manubens Abstract only: Parametric polynomial
system discussion: canonical
comprehensive Gröbner systems . . . . . . 11--12
Silviu Radu Abstract only: An algorithmic approach
to Ramanujan's congruences and related
problems . . . . . . . . . . . . . . . . 11--12
Anonymous In memoriam: Chionh Eng Wee . . . . . . 18--19
Wolfgang Gröbner On the Macaulay inverse system and its
importance for the theory of linear
differential equations with constant
coefficients . . . . . . . . . . . . . . 20--23
Anton Leykin Abstract only: Certified numerical
solving of systems of polynomial
equations . . . . . . . . . . . . . . . 24--24
David Saunders Abstract only: Exact linear algebra . . 24--24
Mark van Hoeij Abstract only: The complexity of
factoring univariate polynomials over
the rationals . . . . . . . . . . . . . 24--24
Gregory V. Bard Abstract only: DEMOCRACY: a heuristic
for polynomial systems of equations over
finite fields . . . . . . . . . . . . . 25--25
Mark Giesbrecht and
Daniel S. Roche and
Hrushikesh Tilak Abstract only: Complexity of sparsest
multiple computation . . . . . . . . . . 25--25
Deborah Mathews Abstract only: An empirical study of
parallel big number arithmetic . . . . . 25--25
Lingchuan Meng and
Jeremy Johnson and
Franz Franchetti and
Yevgen Voronenko and
Marc Moreno Maza and
Yuzhen Xie Abstract only: SPIRAL-generated modular
FFTs . . . . . . . . . . . . . . . . . . 25--26
Yongjae Cha and
Mark van Hoeij and
Giles Levy Abstract only: Solving linear recurrence
relations . . . . . . . . . . . . . . . 26--26
Tingting Fang and
Mark van Hoeij Abstract only: Solving linear
differential equations by using descent 26--26
Bryan Youse and
B. David Saunders Abstract only: Bitslicing with matrix
algorithms oblivious to the data
compression . . . . . . . . . . . . . . 26--26
Florian Haftmann and
Cezary Kaliszyk and
Walther Neuper CTP-based programming languages?:
considerations about an experimental
design . . . . . . . . . . . . . . . . . 27--41
Vincent Lefévre and
Philippe Théveny and
Florent de Dinechin and
Claude-Pierre Jeannerod and
Christophe Mouilleron and
David Pfannholzer and
Nathalie Revol LEMA: towards a language for reliable
arithmetic . . . . . . . . . . . . . . . 41--52
Serge Autexier and
Dominik Dietrich Recent developments in Mega's proof
search programming language . . . . . . 52--59
Luca De Feo and
Eric Schost \tt transalpyne: a language for
automatic transposition . . . . . . . . 59--71
Stanislav Bulygin Abstract only: Polynomial system solving
for decoding linear codes and algebraic
cryptanalysis parametric polynomial
system discussion: canonical
comprehensive . . . . . . . . . . . . . 72--72
Anonymous Abstracts of invited talks, contributed
posters, and software demos at the East
Coast Computer Algebra Day 2010 . . . . ??
Anonymous Abstracts of recent doctoral
dissertations in computer algebra . . . ??
Anonymous Abstracts of recent doctoral
dissertations in computer algebra . . . ??
Anonymous Emerging trends papers accepted for
PLMMS 2010 . . . . . . . . . . . . . . . ??
Anonymous Issue 172 number 2, June 2010 . . . . . ??
Anonymous Issue 171 number 1, March 2010 . . . . . ??
A. Gheffar Linear differential, difference and
$q$-difference homogeneous equations
having no rational solutions . . . . . . 78--83
Felix Antritter and
Johannes Middeke An efficient algorithm for checking
hyper-regularity of matrices . . . . . . 84--86
Dennis S. Arnon A product information management system
as a workbench for quantifier
elimination computations with QEPCAD . . 87--88
Andrew Arnold and
Michael Monagan A fast recursive algorithm for computing
cyclotomic polynomials . . . . . . . . . 89--90
Thomas Bächler and
Vladimir Gerdt and
Markus Lange-Hegermann and
Wilhelm Plesken and
Daniel Robertz Thomas decomposition and its
applications . . . . . . . . . . . . . . 91--92
Isabel Bermejo and
Ignacio García-Marco An algorithm for checking whether a
simplicial toric ideal is a complete
intersection . . . . . . . . . . . . . . 93--94
Johannes Blümlein and
Sebastian Klein and
Carsten Schneider and
Flavia Stan A symbolic summation approach to Feynman
integrals . . . . . . . . . . . . . . . 95--96
Changno Chen and
Marc Moreno Maza and
Yuzhen Xie Cache complexity and multicore
implementation for univariate real root
isolation . . . . . . . . . . . . . . . 97--98
Muhammad F. I. Chowdhury and
Marc Moreno Maza and
Wei Pan and
Éric Schost Complexity and performance results for
non FFT-based univariate polynomial
multiplication . . . . . . . . . . . . . 99--100
Annie Cuyt and
Wen-shin Lee Reconstructing sparse trigonometric
functions . . . . . . . . . . . . . . . 101--102
Xavier Dahan and
Marc Moreno Maza and
Éric Schost and
Adrien Poteaux Almost linear time operations with
triangular sets . . . . . . . . . . . . 103--104
Luca De Feo and
Éric Schost \tt transalpyne: a language for
automatic transposition . . . . . . . . 105--106
Charles Éric Drevet and
Md. Nazrul Islam and
Éric Schost Optimization techniques for small matrix
multiplication . . . . . . . . . . . . . 107--108
Burçin Eröcal and
Arne Storjohann Nullspace computation over rational
function fields for symbolic summation 109--110
Sardar Anisul Haque and
Shahadat Hossain and
M. Moreno Maza Cache friendly sparse matrix-vector
multiplication . . . . . . . . . . . . . 111--112
Albert Heinle and
Viktor Levandovskyy Factorization of polynomials in
$Z$-graded skew polynomial rings . . . . 113--114
Christian Hellström VarInt: variational integrator design
with Maple . . . . . . . . . . . . . . . 115--115
Seyed Mohammad Mahdi Javadi and
Michael Monagan On sparse interpolation over finite
fields . . . . . . . . . . . . . . . . . 116--117
Karen T. Kohl An implementation of the method of
brackets for symbolic integration . . . 118--119
Anja Korporal and
Georg Regensburger and
Markus Rosenkranz A Maple package for integro-differential
operators and boundary problems . . . . 120--122
Jae Hee Lee Cylindrical algebraic decomposition for
reasoning about qualitative spatial
knowledge . . . . . . . . . . . . . . . 123--124
Viktor Levandovskyy Non-commutative subsystems of \sc
Singular . . . . . . . . . . . . . . . . 125--126
Shuichi Moritsugu Radius computation for an inscribed
pentagon in Sanpou-Hakki (1690) . . . . 127--128
Hiroshi Murakami Sturm root counting using Chebyshev
expansion . . . . . . . . . . . . . . . 129--131
Nalina Phisanbut and
Russell J. Bradford and
James H. Davenport Geometry of branch cuts . . . . . . . . 132--135
Sonia L. Rueda Linear differential implicitization and
differential resultants . . . . . . . . 136--137
Yannick Saouter Heuristics for Cannon's algorithm with
an application to Lyons sporadic group 138--139
Yannick Saouter and
Gérald Le Mestre A FPGA implementation of Chen's
algorithm . . . . . . . . . . . . . . . 140--141
Tateaki Sasaki and
Fujio Kako Computing floating-point Gröbner bases
accurately . . . . . . . . . . . . . . . 142--143
Dana Schlomiuk and
Nicolae Vulpe Invariants and symbolic calculations in
the theory of quadratic differential
systems . . . . . . . . . . . . . . . . 144--146
Hiroshi Sekigawa and
Kiyoshi Shirayanagi Solvability of bivariate polynomial
systems under perturbation . . . . . . . 147--148
Ekaterina Shemyakova $X$- and $Y$-invariants for Darboux
transformations . . . . . . . . . . . . 149--150
Grischa Studzinski Computation of dimensions of
non-commutative algebras . . . . . . . . 151--152
Akira Terui GPGCD, an iterative method for
calculating approximate GCD, for
multiple univariate polynomials . . . . 153--155
Jeremy Johnson Abstracts of recent doctoral
dissertations in computer algebra . . . 155--155
Flavia Stan Algorithms for special functions:
computer algebra and analytical aspects 156--157
Colas Bardavid Differential schemes: geometric approach
and functorial approach . . . . . . . . 157--159
Daniel E. Steffy Exact solutions to linear systems of
equations using output sensitive lifting 160--182
Yongjae Cha and
Mark van Hoeij and
Giles Levy Solving linear recurrence equations . . 183--185
Felix Effenberger and
Jonathan Spreer \tt simpcomp: a GAP toolbox for
simplicial complexes . . . . . . . . . . 186--189
Burçin Eröcal Summation in finite terms using \tt sage 190--193
Mickaël Gastineau and
Jacques Laskar TRIP: a computer algebra system
dedicated to celestial mechanics and
perturbation series . . . . . . . . . . 194--197
M\uad\ualina Hodorog and
Bernard Mourrain and
Josef Schicho GENOM3CK: a library for genus
computation of plane complex algebraic
curves using knot theory . . . . . . . . 198--200
Mohamed Barakat and
Markus Lange-Hegermann LocalizeRingForHomalg: localize
commutative rings at maximal ideals . . 201--204
Michael Monagan and
Roman Pearce Sparse polynomial multiplication and
division in Maple 14 . . . . . . . . . . 205--209
The SCIEnce project Symbolic computation software
composability protocol and its
implementations . . . . . . . . . . . . 210--212
The SCIEnce project SymGrid-Par: parallel orchestration of
symbolic computation systems . . . . . . 213--216
Jan Verschelde Polynomial homotopy continuation with
PHCpack . . . . . . . . . . . . . . . . 217--220
Daniel Lichtblau Symbolic definite (and indefinite)
integration: methods and open issues . . 1--16
Robert Corless and
Erik Postma and
David R. Stoutemyer Rounding coefficients and artificially
underflowing terms in non-numeric
expressions . . . . . . . . . . . . . . 17--48
Aaron Robertson and
Vince Vatter and
Gizel Maimon and
Qing-Hu Hou Abstracts of conferences in honor of
Doron Zeilberger's 60th birthday . . . . 49--61
Jeremy Johnson Abstracts of recent doctoral
dissertations in computer algebra . . . 62--62
Christian Eder and
Justin Gash and
John Perry Modifying Faug\`ere's F5 algorithm to
ensure termination . . . . . . . . . . . 70--89
Bruno Salvy and
Bob Sedgewick and
Michele Soria and
Wojciech Szpankowski and
Brigitte Vallee Philippe Flajolet: the father of
analytic combinatorics . . . . . . . . . 90--91
Gert Almkvist Ramanujan-like formulas for $ 1 / \pi^2
$ and String Theory [abstract only] . . 92--92
Ilias Kotsireas and
Eugene Zima Abstracts of WWCA 2011 in honor of Herb
Wilf's 80th birthday . . . . . . . . . . 92--99
John May East Coast Computer Algebra Day 2011
abstracts . . . . . . . . . . . . . . . 100--106
Fatima K. Abu Salem Parallel and cache-efficient Hensel
lifting . . . . . . . . . . . . . . . . 107--108
Mark Boady and
Pavel Grinfeld and
Jeremy Johnson A symbolic computation system for the
calculus of moving surfaces . . . . . . 109--110
Alin Bostan and
Frédéric Chyzak and
Ziming Li and
Bruno Salvy Fast computation of common left
multiples of linear ordinary
differential operators . . . . . . . . . 111--112
Muhammad F. I. Chowdhury and
Romain Lebreton Root lifting techniques and applications
to list decoding . . . . . . . . . . . . 113--114
Samaresh Chatterji and
Ratnik Gandhi Computing equilibria with group actions 115--116
Md. Nazrul Islam and
A. Poteaux Connectivity queries on curves in $ R_n
$ . . . . . . . . . . . . . . . . . . . 117--118
Hiroshi Kai and
Shigenobu Inoue Cheater identification on a secret
sharing scheme using GCD . . . . . . . . 119--120
Deepanjan Kesh and
Shashank K. Mehta A saturation algorithm for homogeneous
binomial ideals . . . . . . . . . . . . 121--122
Christos Koukouvinos and
Dimitris E. Simos and
Zafeirakis Zafeirakopoulos An algebraic framework for extending
orthogonal designs . . . . . . . . . . . 123--124
Yue Li and
Gabriel Dos Reis An automatic parallelization framework
for OpenAxiom . . . . . . . . . . . . . 125--126
Marc Moreno Maza and
Wei Pan Solving bivariate polynomial systems on
a GPU . . . . . . . . . . . . . . . . . 127--128
Marc Moreno Maza and
Paul Vrbik Inverting matrices modulo regular chains 129--130
Hiroshi Sekigawa and
Kiyoshi Shirayanagi Isolated real zero of a real polynomial
system under perturbation . . . . . . . 131--132
Clemens G. Raab Integration in finite terms of
non-Liouvillian functions . . . . . . . 133--134
Hamid Rahkooy and
Zafeirakis Zafeirakopoulos Using resultants for inductive Gröbner
bases computation . . . . . . . . . . . 135--136
Manuela Wiesinger-Widi Gröbner bases and generalized Sylvester
matrices . . . . . . . . . . . . . . . . 137--138
Christoph Zengler and
Andreas Kübler and
Wolfgang Küchlin New approaches to Boolean quantifier
elimination . . . . . . . . . . . . . . 139--140
Christoph Zengler and
Wolfgang Küchlin Boolean Gröbner bases in SAT solving . . 141--142
Jeremy Johnson Abstracts of recent doctoral
dissertations in computer algebra . . . 143--145
Wolfgang Trinks On Buchberger's method of solving
systems of algebraic equations . . . . . 150--161
Akira Terui Abstracts from RIMS workshop on
developments in computer algebra
research . . . . . . . . . . . . . . . . 162--165
Changbo Chen and
James H. Davenport and
François Lemaire and
Marc Moreno Maza and
Bican Xia and
Rong Xiao and
Yuzhen Xie Computing the real solutions of
polynomial systems with the
RegularChains library in Maple . . . . . 166--168
J. A. De Loera and
B. Dutra and
M. Köppe and
S. Moreinis and
G. Pinto and
J. Wu Software for exact integration of
polynomials over polyhedra . . . . . . . 169--172
Felix Effenberger and
Jonathan Spreer Simplicial blowups and discrete normal
surfaces in simpcomp . . . . . . . . . . 173--176
Michael Joswig and
Andreas Paffenholz Defect polytopes and counter-examples
with polymake . . . . . . . . . . . . . 177--179
Antonio Montes Software for computing the Gröbner cover
of a parametric ideal . . . . . . . . . 180--182
Alexander Raichev New software for computing asymptotics
of multivariate generating functions . . 183--185
Joris van der Hoeven and
Grégoire Lecerf and
Bernard Mourrain and
Philippe Trébuchet and
Jérémy Berthomieu and
Daouda Niang Diatta and
Angelos Mantzaflaris Mathemagix: the quest of modularity and
efficiency for symbolic and certified
numeric computation? . . . . . . . . . . 186--188
Loredana Tec A symbolic framework for general
polynomial domains in Theorema:
applications to boundary problems . . . 189--189
Johannes Middeke A computational view on normal forms of
matrices of Ore polynomials . . . . . . 190--191
David R. Stoutemyer Ways to implement computer algebra
compactly . . . . . . . . . . . . . . . 199--224
David Joyner and
Ond\vrej \vCertík and
Aaron Meurer and
Brian E. Granger Open source computer algebra systems:
SymPy . . . . . . . . . . . . . . . . . 225--234
David Joyner and
Ondrej Certík and
Aaron Meurer and
Brian E. Granger Richard Dimick Jenks Memorial Prize 2011 235--235
Jónathan Heras Mathematical knowledge management in
algebraic topology . . . . . . . . . . . 236--237
Angelos Mantzaflaris Robust algebraic methods for geometric
computing . . . . . . . . . . . . . . . 237--237
L. X. Châu Ngô Rational general solutions of
first-order algebraic ODEs . . . . . . . 238--238
Nils Lubbes Minimal families of curves on surfaces 238--239
Madalina Hodorog Symbolic-numeric algorithms for plane
algebraic curves . . . . . . . . . . . . 239--240
James H. Davenport Small algorithms for small systems . . . 1--9
John Fitch James Griesmer 1929--2011 . . . . . . . 10--11
Doron Zeilberger Farewell to ``W'' (Herbert Saul Wilf), a
true VISIONARY for whom EVERYTHING was
INTERTWINED . . . . . . . . . . . . . . 12--13
Jeremy Johnson Abstracts of recent doctoral
dissertations in computer algebra . . . 14--16
David R. Stoutemyer Series crimes . . . . . . . . . . . . . 19--52
Jeremy Johnson In Memoriam: Werner Krandick . . . . . . 52--54
Tony Shaska and
Daniel E. Steffy East Coast Computer Algebra Day 2012
abstracts . . . . . . . . . . . . . . . 55--59
Jeremy Johnson Abstracts of recent doctoral
dissertations in computer algebra . . . 60--63
David J. Wilson and
Russell J. Bradford and
James H. Davenport A repository for CAD examples . . . . . 67--69
Anonymous Stefan Dodunekov 1945--2012 . . . . . . 70--71
Fatima K. Abu Salem A cache-oblivious engineering of the G2V
algorithm for computing Gröbner bases . . 72--73
Skander Belhaj and
Ha\"\ithem Ben Kahla On the complexity of computing the GCD
of two polynomials via Hankel matrices 74--75
Felix Breuer and
Zafeirakis Zafeirakopoulos Partition analysis via polyhedral
geometry . . . . . . . . . . . . . . . . 76--77
Nader H. Bshouty Testers . . . . . . . . . . . . . . . . 78--79
Yongjae Cha and
Veronika Pillwein Closed form solutions of linear
difference equations in terms of
symmetric products . . . . . . . . . . . 80--81
Xavier Dahan On the structure of lexicographic Gröbner
bases in dimension zero . . . . . . . . 82--83
Max Demenkov Estimating region of attraction for
polynomial vector fields by homotopy
methods . . . . . . . . . . . . . . . . 84--85
G\`aérard H. E. Duchamp and
Vincel Hoang Ngoc Minh Dual families in enveloping algebras . . 86--87
Ioannis Z. Emiris and
Tatjana Kalinka Sparse implicitization using support
prediction . . . . . . . . . . . . . . . 88--89
C. Fassino and
M. Torrente Zero-dimensional ideals of limited
precision points . . . . . . . . . . . . 90--91
Jean-Charles Faug\`are and
Pierrick Gaudry and
Louise Huot and
Guénaël Renault Fast change of ordering with exponent $
\omega $ . . . . . . . . . . . . . . . . 92--93
Laurent Hascoët and
Shahadat Hossain and
Trond Steihaug Structured computation in optimization
and algorithmic differentiation . . . . 94--95
Mark van Hoeij and
Vijay Jung Kunwar Finding $_2 F_1$ type solutions of
differential equations with $5$
singularities . . . . . . . . . . . . . 96--97
V. D. Irtegov and
T. N. Titorenko Symbolic analysis of dynamic systems . . 98--99
Maximilian Jaroschek Improved polynomial remainder sequences
for ore polynomials . . . . . . . . . . 100--101
Hao Jiang and
Stef Graillat and
Roberto Barrio Accurate computing elementary symmetric
functions . . . . . . . . . . . . . . . 102--103
Dejan Jovanovi\'c and
Leonardo de Moura Solving non-linear arithmetic . . . . . 104--105
George Labahn and
Johannes Middeke Gröbner walk for computing matrix normal
forms over Ore polynomials . . . . . . . 106--107
Romain Lebreton and
Esmaeil Mehrabi and
Éric Schost On the complexity of computing certain
resultants . . . . . . . . . . . . . . . 108--109
Wei Li and
Chun-Ming Yuan and
Xiao-Shan Gao Sparse differential resultant for
Laurent differential polynomials . . . . 110--111
Alberto Llorente and
Jorge Mozo-Fernández Numeric-symbolic methods for computing
the Liouvillian solutions of
differential equations and systems . . . 112--113
Thang Luu Ba The matrix based representations of the
intersection curves . . . . . . . . . . 114--115
Kosaku Nagasaka Backward error analysis of approximate
Gröbner basis . . . . . . . . . . . . . . 116--117
Esteban Segura Ugalde Polynomial root-finding via structured
matrices . . . . . . . . . . . . . . . . 118--119
Hiroshi Sekigawa and
Kiyoshi Shirayanagi Maximal perturbation for preserving the
number of solutions of a polynomial
system . . . . . . . . . . . . . . . . . 120--121
Konstantin Usevich and
Ivan Markovsky Variable projection methods for
approximate GCD computations . . . . . . 122--124
Wenyuan Wu and
Jingwei Chen and
Yong Feng An efficient algorithm to factorize
sparse bivariate polynomials over the
rationals . . . . . . . . . . . . . . . 125--126
Jeremy Johnson Abstracts of recent doctoral
dissertations in computer algebra . . . 127--129
David R. Stoutemyer Series misdemeanors . . . . . . . . . . 134--153
Anja Korporal and
Georg Regensburger and
Markus Rosenkranz ISSAC 2012 software demonstrations:
Symbolic computation for ordinary
boundary problems in Maple . . . . . . . 154--156
Moulay A. Barkatou and
Eckhard Pflügel and
Flavia Stan ISOLDE: a Maple package for systems of
linear functional equations . . . . . . 157--159
I. Bermejo and
E. García-Llorente and
Ph. Gimenez \tt monomialideal.lib . . . . . . . . . 160--161
The HPC-GAP project Parallel programming support in GAP . . 161--163
Michael Monagan and
Roman Pearce POLY: a new polynomial data structure
for Maple 17 . . . . . . . . . . . . . . 164--167
Guillaume Quintin The decoding Library for list decoding 168--170
Xiaoyu Chen and
Dongming Wang and
Ting Zhao GeoText: an intelligent dynamic geometry
textbook . . . . . . . . . . . . . . . . 171--175
Jeremy Johnson Abstracts of recent doctoral
dissertations in computer algebra . . . 176--179
Christian Eder Improving incremental signature-based
Gröbner basis algorithms . . . . . . . . 1--13
Stephen Wolfram Remembering Richard Crandall
(1947--2012) . . . . . . . . . . . . . . 14--15
Manuel Bronstein Manuel Bronstein's codes . . . . . . . . 16--16
Anonymous ISSAC 2015: call for bids . . . . . . . 17--17
Anonymous Richard D. Jenks prize 2013: call for
nominations . . . . . . . . . . . . . . 18--18
Jeremy Johnson Abstracts of recent doctoral
dissertations in computer algebra . . . 19--23
Anonymous Recent and upcoming events . . . . . . . 24--25
David R. Stoutemyer Simplifying products of fractional
powers of powers . . . . . . . . . . . . 26--58
Joris van der Hoeven and
Andrey Grozin and
Massimiliano Gubinelli and
Grégoire Lecerf and
François Poulain and
Denis Raux GNU TEXmacs: a scientific editing
platform . . . . . . . . . . . . . . . . 59--61
Albert Heinle Review of ``A first course in
computational algebraic geometry'' by W.
Decker and G. Pfister . . . . . . . . . 62--63
Dan Roche Abstracts of the 2013 East Coast
Computer Algebra Day . . . . . . . . . . 64--70
Anonymous Recent and upcoming events . . . . . . . 71--72
Tony C. Scott and
Greg Fee and
Johannes Grotendorst Asymptotic series of generalized Lambert
$W$ function . . . . . . . . . . . . . . 75--83
Erich Kaltofen and
Alexey Ovchinnikov NSF funding opportunities for symbolic
computation . . . . . . . . . . . . . . 84--84
Efi Fogel and
Monique Teillaud The Computational Geometry Algorithms
Library CGAL . . . . . . . . . . . . . . 85--87
Kosaku Nagasaka and
Takaaki Masui Revisiting QRGCD and comparison with
ExQRGCD . . . . . . . . . . . . . . . . 88--89
C. Bui and
G. H. E. Duchamp and
Hoang Ngoc Minh Schützenberger's factorization on
$q$-stuffle Hopf algebra . . . . . . . . 90--91
Sidi M. Sedjelmaci Fast parallel GCD algorithm of many
integers . . . . . . . . . . . . . . . . 92--93
Xiangui Zhao Gelfand--Kirillov dimensions of
differential difference modules via
Gröbner bases . . . . . . . . . . . . . . 94--95
Éric Schost and
Pierre-Jean Spaenlehauer Newton-like iteration for determinantal
systems and structured low rank
approximation . . . . . . . . . . . . . 96--97
Muhammad Taimoor Khan and
Wolfgang Schreiner A verification framework for MiniMaple
programs . . . . . . . . . . . . . . . . 98--99
Pascal Giorgi and
Romain Lebreton Relaxing order basis computation . . . . 100--101
Bastien Vialla Block Wiedemann algorithm on multicore
architectures . . . . . . . . . . . . . 102--103
Andrew Arnold and
Mark Giesbrecht and
Dan Roche Recursive sparse interpolation . . . . . 104--105
Lingchuan Meng and
Jeremy Johnson Towards parallel general-size library
generation for polynomial multiplication 106--107
Jiaxiong Hu and
Michael Monagan A parallel algorithm to compute the
greatest common divisor of sparse
multivariate polynomials . . . . . . . . 108--109
Akira Terui Calculating approximate GCD of multiple
univariate polynomials using approximate
syzygies . . . . . . . . . . . . . . . . 110--111
Yong Feng and
Jingwei Chen and
Wenyuan Wu Incremental PSLQ with application to
algebraic number reconstruction . . . . 112--113
James G. Wan Hypergeometric generating functions and
series for $ 1 / \pi $ . . . . . . . . . 114--115
Johannes Middeke Annihilating monomials with the
integro-differential Weyl algebra . . . 116--117
Gavin Harrison and
Jeremy Johnson and
B. David Saunders Probabilistic analysis of Wiedemann's
algorithm for minimal polynomial
computation . . . . . . . . . . . . . . 118--119
James Belk and
Nabil Hossain and
Francesco Matucci and
Robert McGrail Implementation of a solution to the
conjugacy problem in Thompson's group
$F$ . . . . . . . . . . . . . . . . . . 120--121
Thomas Wolf and
Eberhard Schrüfer and
Kenneth Webster A linear sparse systems solver (LSSS)
applied to the classification of
integrable non-abelian Laurent ODEs . . 122--123
CCA Editors Abstracts of recent doctoral
dissertations in computer algebra . . . 124--125
David R. Stoutemyer A computer algebra user interface
manifesto . . . . . . . . . . . . . . . 130--165
Fredrik Johansson Arb: a C library for ball arithmetic . . 166--169
Zhonggang Zeng and
Tien-Yien Li NAClab: a Matlab toolbox for numerical
algebraic computation . . . . . . . . . 170--173
E. J. Postma The new group theory package in Maple 17 174--178
Christoph Koutschan Holonomic functions in Mathematica . . . 179--182
Anton Betten Classifying discrete objects with
Orbiter . . . . . . . . . . . . . . . . 183--186
Erich Kaltofen Jenks Prize 2013 award citation . . . . 187--187
Anonymous Mark Giesbrecht ACM distinguished
scientist . . . . . . . . . . . . . . . 188--188
CCA Editors Abstracts of recent doctoral
dissertations in computer algebra . . . 189--190
Anonymous Message from the SIGSAM chair . . . . . 1--2
John Abbott Quadratic interval refinement for real
roots . . . . . . . . . . . . . . . . . 3--12
Raoul Blankertz A polynomial time algorithm for
computing all minimal decompositions of
a polynomial . . . . . . . . . . . . . . 13--23
M. England and
E. Cheb-Terrab and
R. Bradford and
J. H. Davenport and
D. Wilson Branch cuts in Maple 17 . . . . . . . . 24--27
CCA Editors Abstracts of recent doctoral
dissertations in computer algebra . . . 28--28
Ilias S. Kotsireas Message from the SIGSAM Chair . . . . . 32--32
Robert M. Corless and
Junrui Hu and
D. J. Jeffrey Some definite integrals containing the
Tree T function . . . . . . . . . . . . 33--41
Tony C. Scott and
Greg Fee and
Johannes Grotendorst and
W. Z. Zhang Numerics of the generalized Lambert $W$
function . . . . . . . . . . . . . . . . 42--56
Wolfram Decker Review of ``Numerically Solving
Polynomial Systems with Bertini'' by
Daniel J. Bates, Jonathan D. Hauenstein,
Andrew J. Sommese, and Charles W.
Wampler . . . . . . . . . . . . . . . . 57--58
Anonymous Abstracts of the 2014 East Coast
Computer Algebra Day: Communicated by
Xiaobai Sun, Nikos P. Pitsianis, and
Alexandros-Stavros Iliopoulos . . . . . 59--63
CCA Editors Abstracts of recent doctoral
dissertations in computer algebra . . . 64--66
Alexey Ovchinnikov Kolchin seminar in differential algebra 67--69
William Sit The Kolchin seminar in differential
algebra at the Graduate Center of the
City University of New York: Summer ---
2014 . . . . . . . . . . . . . . . . . . 70--73
Anonymous Message from the SIGSAM chair . . . . . 77--77
Richard Fateman Algorithm Differentiation in Lisp: ADIL 78--89
Amal Gheffar Detecting Nonexistence of Rational
Solutions of Linear Difference Equations
in Early Stages of Computation . . . . . 90--97
Andrew Arnold and
Éric Schost A Truncated Fourier Transform middle
product . . . . . . . . . . . . . . . . 98--99
Brice Boyer and
Jean-Guillaume Dumas Matrix Multiplication over Word-size
Modular Fields Using Bini's Approximate
Formula . . . . . . . . . . . . . . . . 100--102
Brice Boyer and
Erich L. Kaltofen Numerical Linear System Solving with
Parametric Entries by Error Correction 103--105
Shaoshi Chen and
Hui Huang and
Ziming Li Improved Abramov--Petkovsek's Reduction
and Creative Telescoping for
Hypergeometric Terms . . . . . . . . . . 106--108
Robert M. Corless and
Marc Moreno Maza and
Steven E. Thornton Zigzag Form over Families of Parametric
Matrices . . . . . . . . . . . . . . . . 109--112
José Gómez-Torrecillas and
F. J. Lobillo and
Gabriel Navarro Generating Idempotents in Ideal Codes 113--115
Tatsuyoshi Hamada MathLibre: Personalizable Computer
Environment for Mathematical Research 116--117
Takayuki Hibi and
Kenta Nishiyama and
Nobuki Takayama Computing Bases of Twisted Cohomology
Groups for Sparse Polynomials . . . . . 118--120
Zongyan Huang and
Matthew England and
David Wilson and
James H. Davenport and
Lawrence C. Paulson A Comparison of Three Heuristics to
Choose the Variable Ordering for
Cylindrical Algebraic Decomposition . . 121--123
Hiroshi Kai and
Keita Ueda Fake Shares Detection on a Visual Secret
Sharing Scheme by Rational Interpolation 124--126
Yasuhito Kawano and
Hiroshi Sekigawa Quantum Fourier Transform over Symmetric
Groups: Improved Result . . . . . . . . 127--129
Johannes Middeke and
David J. Jeffrey Fraction-Free Factoring Revisited . . . 130--132
Daniel J. Bates and
Andrew J. Newell and
Matthew E. Niemerg Decoupling Highly Structured Polynomial
Systems . . . . . . . . . . . . . . . . 133--133
Hiroshi Murakami Calculation of Rational Numbers in an
Interval Whose Denominator is the
Smallest by using FP Interval Arithmetic 134--136
Tateaki Sasaki and
Daiju Inaba and
Fujio Kako Solving Parametric Sparse Linear Systems
by Local Blocking . . . . . . . . . . . 137--139
Arne Storjohann and
Shiyun Yang A Relaxed Algorithm for Online Matrix
Inversion . . . . . . . . . . . . . . . 140--142
Mark van Hoeij and
Erdal Imamoglu ${}_2 F_1 $-type Solutions of Second
Order Differential Equations . . . . . . 143--144
Eugene V. Zima Direct Indefinite Summation . . . . . . 145--147
CCA Editors Abstracts of recent doctoral
dissertations in computer algebra . . . 148--150
Ilias S. Kotsireas Message from the SIGSAM Chair . . . . . 154--154
Sergei A. Abramov and
Moulay A. Barkatou On Solution Spaces of Products of Linear
Differential or Difference Operators . . 155--165
Michael Monagan and
Roman Pearce The Design of Maple's Sum-of-Products
and POLY Data Structures for
Representing Mathematical Objects . . . 166--186
Joris van der Hoeven and
Grégoire Lecerf Sparse Polynomial Interpolation in
Practice . . . . . . . . . . . . . . . . 187--191
Hideaki Izumi Maple Package \tt itsol for Formal
Solutions of Iterative Functional
Equations . . . . . . . . . . . . . . . 192--196
Changbo Chen and
Svyatoslav Covanov and
Farnam Mansouri and
Marc Moreno Maza and
Ning Xie and
Yuzhen Xie Basic Polynomial Algebra Subprograms . . 197--201
CCA Editors Abstracts of recent doctoral
dissertations in computer algebra . . . 202--202
Albert Heinle and
Viktor Levandovskyy The SDeval benchmarking toolkit . . . . 1--9
Efi Fogel and
Monique Teillaud The computational geometry algorithms
library CGAL . . . . . . . . . . . . . . 10--12
Nuh Aydin Computer algebra challenges for
constructing skew cyclic codes . . . . . 13--13
Kadijeh Bagheri and
Mohammad-Reza Sadeghi A new non-associative cryptosystem based
on NTOW public key cryptosystem and
octonions algebra . . . . . . . . . . . 13--13
Nabil Bennenni and
Kenza Guenda and
Aaron Gulliver Construction of codes for DNA computing
by the greedy algorithm . . . . . . . . 14--14
Ahmed Cherchem and
André Leroy Exponents of skew polynomials . . . . . 14--14
Steven T. Dougherty and
Esengül Salturk Codes over local rings of order $ 16 $
and their gray maps . . . . . . . . . . 14--14
Iuliana Cioc\uanea Teodorescu The module isomorphism problem for
finite rings and related results . . . . 14--14
Steven Dougherty and
Esengül Saltürk and
Steve Szabo Codes over rings of order $ 16 $ . . . . 15--15
Felice Manganiello Network coding via skew polynomials . . 15--15
Edgar Martínez-Moro and
Alejandro P. Nicolás and
Ignacio F. Rúa Multivariable codes in principal ideal
polynomial quotient rings . . . . . . . 15--15
Malihe Aliasgari and
Mohammad-Reza Sadeghi and
Daniel Panario A Johnson-type bound for group codes and
lattices . . . . . . . . . . . . . . . . 16--16
Edgar Martínez-Moro and
Steve Szabo and
Bahattin Yildiz Linear codes over $ Z_4 [x] / \langle
x^2 - 2 x \rangle $: dual preserving
maps and images as codes over $ Z_4 $ 16--16
Malihe Aliasgari and
Daniel Panario and
Mohammad-Reza Sadeghi Binomial ideal associated to a lattice
and its label code . . . . . . . . . . . 16--17
K. T. Arasu Stickelberger's congruences and perfect
sequence constructions . . . . . . . . . 17--17
Ankita Bakshi and
Deeksha On a class of difference set pairs . . . 17--17
Gregory V. Bard and
Theodore McDonnough Plaintext recovery for one-time pads
used twice . . . . . . . . . . . . . . . 17--18
José Joaquín Bernal and
Juan Jacobo Simón and
Diana H. Bueno-Carreño A notion of multivariate BCH bounds and
codes . . . . . . . . . . . . . . . . . 18--18
Akshay Degwekar and
Kenza Guenda and
T. Aaron Gulliver Extending construction $X$ for quantum
error-correcting codes . . . . . . . . . 18--18
Natalia Dück and
Irene Márquez-Corbella and
Edgar Martínez-Moro The degree compatible Gröbner fan for
linear codes . . . . . . . . . . . . . . 18--19
Mariana Durcheva Some applications of idempotent
semirings in public key cryptography . . 19--19
Oscar García-Morchón and
Ronald Rietman and
Ludo Tolhuizen and
Domingo Gómez and
Jaime Gutiérrez HIMMO: a collusion-resistant
identity-based scheme for symmetric key
generation . . . . . . . . . . . . . . . 19--19
Manuel González Sarabia An overview on algebraic invariants and
the main parameters of some
parameterized codes . . . . . . . . . . 19--20
James Hufford Some results on finite fields . . . . . 20--20
David Joyner Edge-weighted Cayley graphs,
monotonicity and bent functions . . . . 20--21
Relinde Jurrius and
Ruud Pellikaan The extended and generalized rank weight
enumerator of a code . . . . . . . . . . 21--21
Irene Márquez-Corbella and
Ruud Pellikaan Error-correcting pairs: a new approach
to code-based cryptography . . . . . . . 21--21
Hamza Moufek and
Kenza Guenda McEliece cryptosystem based on punctured
convolutional codes and the
pseudo-random generators . . . . . . . . 21--21
Bo Phillips and
Jace Robinson Some new almost difference sets via
finite fields . . . . . . . . . . . . . 21--22
Emma Previato Evaluation codes and Weierstrass
semigroups . . . . . . . . . . . . . . . 22--22
Ana Lucila Sandoval Orozco and
Luis Javier García Villalba and
Mario Blaum Optimum shortened cyclic codes for
multiple burst-error correction . . . . 22--23
Carlos E. Arreche Computing differential Galois groups of
parameterized second-order linear
differential equations . . . . . . . . . 23--23
Moulay A. Barkatou A direct algorithm for computing
$k$-simple forms of first-order linear
differential systems . . . . . . . . . . 23--23
James Freitag Bounding the size of a finite
differential algebraic variety . . . . . 23--24
Xiao-Shan Gao Binomial difference ideal and toric
difference variety . . . . . . . . . . . 24--24
Florian Heiderich Towards a non-commutative
Picard--Vessiot theory . . . . . . . . . 24--24
Maximilian Jaroschek Radicals of Ore polynomials . . . . . . 24--24
Gabriela Jeronimo Effective differential Lüroth theorem . . 24--25
Lourdes Juan On the integration of algebraic
functions: computing the logarithmic
part . . . . . . . . . . . . . . . . . . 25--25
Irina A. Kogan Differential algebra of invariants and
invariant variational calculus . . . . . 25--25
George Labahn Dynamical systems and scaling invariants 25--25
Markus Lange-Hegermann Counting solutions of differential
equations . . . . . . . . . . . . . . . 25--26
François Lemaire New development and application of
integration of differential fractions 26--26
Alexander Levin Generalized Gröbner bases and dimension
polynomials of modules over some
finitely generated noncommutative
algebras . . . . . . . . . . . . . . . . 26--26
Omar León Sánchez Parametrized logarithmic equations and
their Galois theory . . . . . . . . . . 26--26
Suzy S. Maddah Formal solutions of completely
integrable Pfaffian systems with normal
crossings . . . . . . . . . . . . . . . 26--27
Annette Maier Parameterized differential equations and
patching . . . . . . . . . . . . . . . . 27--27
Alice Medvedev Dimensions of difference-algebraic
groups . . . . . . . . . . . . . . . . . 27--27
Sergey Paramonov Undecidability of the uniqueness testing
problem for analytic solutions of PLDE
with boundary conditions . . . . . . . . 27--27
Julien Roques Galois groups of difference equations on
elliptic curves . . . . . . . . . . . . 27--28
Guanli Huang and
Meng Zhou On the termination of algorithm for
computing relative Gröbner bases . . . . 28--28
Michael Wibmer A Jordan--Hölder theorem for difference
algebraic groups . . . . . . . . . . . . 28--28
Laurent Poinsot Differential (Lie) algebras from a
functorial point of view . . . . . . . . 28--29
Dahira Dali and
Jugurta Mahrez Local stability of cubic differential
systems . . . . . . . . . . . . . . . . 29--29
Sonia L. Rueda Differential elimination by differential
specialization of Sylvester style
matrices . . . . . . . . . . . . . . . . 29--29
Emma Previato Differential algebraic aspect of
orthogonal polynomials and modular forms 29--30
William F. Keigher and
V. Ravi Srinivasan Differential equations and Hurwitz
series . . . . . . . . . . . . . . . . . 31--31
Stephane Launois Endomorphisms of quantum generalized
Weyl algebras . . . . . . . . . . . . . 31--31
Suzy S. Maddah On the formal reduction of
singularly-perturbed linear differential
systems . . . . . . . . . . . . . . . . 31--31
George Labahn Rational invariants of finite abelian
groups . . . . . . . . . . . . . . . . . 31--32
Minvydas Ragulskis The generalized multiplicative operator
of differentiation for the construction
of analytic solitary solutions to
nonlinear differential equations . . . . 32--32
Yang Zhang and
Xiangui Zhao Gelfand--Kirillov dimension of
differential difference algebras . . . . 32--32
Mark Giesbrecht and
Albert Heinle and
Viktor Levandovskyy On factoring differential and difference
operators in $n$ variables . . . . . . . 33--33
Li Guo and
William Sit and
Xing Gao and
Shanghua Zheng Rota--Baxter type operators, rewriting
systems and Gröbner--Shirshov bases . . . 33--33
Christoph Koutschan and
Erwin Suazo and
Sergei K. Suslov Multi-parameter laser modes in paraxial
optics . . . . . . . . . . . . . . . . . 33--33
Michel Beaudin and
Frédéric Henri Piecewise functions and convolution
integrals (part I, part II) . . . . . . 34--34
David Jeffrey and
Albert Rich and
Junrui Hu RUBI and integration as term re-writing:
integrals containing tangent . . . . . . 34--34
Alexander Levin Method of generalized characteristic
sets and multivariate dimension
polynomials of differential field
extensions with a group action . . . . . 34--34
Clemens G. Raab Rewrite rules for nested integrals . . . 34--34
Gilbert Labelle Combinatorial integration (part I, part
II) . . . . . . . . . . . . . . . . . . 35--35
Daniel Lichtblau The hazards of symbolic definite
integration (a continuing saga) . . . . 35--35
Robert H. C. Moir and
Robert M. Corless and
David J. Jeffrey Unwinding paths on the Riemann sphere
for continuous integrals of rational
functions . . . . . . . . . . . . . . . 35--35
CCA Editors Abstracts of recent doctoral
dissertations in computer algebra . . . 36--36
Richard Fateman Partitioning of algebraic subexpressions
in computer algebra systems: an
alternative to matching with an
application to symbolic integration . . 38--47
Michel Beaudin Same courses, new questions . . . . . . 48--48
Elena Varbanova CAS in the context of methodology of
mathematics education . . . . . . . . . 48--48
Alfonsa García and
Francisco García and
Ángel Martín del Rey and
Gerardo Rodríguez and
Agustín de la Villa Using technology in mathematical
courses: some possibilities . . . . . . 49--49
Patrice Geary Tiffany Effectively melding computer algebra
systems into the calculus curriculum . . 49--50
Rosemary Carroll Farley Student undergraduate research projects
in linear algebra using a computer
algebra system . . . . . . . . . . . . . 50--50
Andrew Toon Investigating complex data and dynamics
via computer algebra . . . . . . . . . . 50--50
Michael Xue Prove inequalities by solving
maximum/minimum problems using a
computer algebra system . . . . . . . . 50--50
Juan G. Alcázar and
Carlos Hermoso and
Georg Muntingh Symmetry detection of rational space
curves . . . . . . . . . . . . . . . . . 51--51
Yacine Bouzidi Computing separating linear forms for
bivariate systems . . . . . . . . . . . 51--52
Juan G. Alcázar and
Carlos Hermoso and
Jorge Caravantes and
Gema M. Díaz-Toca Iterative computation of the convex hull
of a rational plane curve . . . . . . . 52--52
L. Beshaj and
T. Shaska and
C. Shor On Jacobians of curves with
superelliptic components . . . . . . . . 52--52
Carlos D'Andrea The Rees algebra of some monomial
parametrizations . . . . . . . . . . . . 52--53
Mario Fioravanti and
Laureano Gonzalez-Vega and
Jorge Caravantes Computing the topology of an arrangement
of parametric or implicit algebraic
curves in the Lagrange basis . . . . . . 53--53
Niels Lubbes Circles on surfaces . . . . . . . . . . 53--54
Marc Moreno Maza Doing algebraic geometry with the
RegularChains library . . . . . . . . . 54--54
S. L. Rueda and
J. Sendra and
J. R. Sendra An approximate algorithm to parametrize
algebraic curves . . . . . . . . . . . . 54--55
Tony Shaska Genus $3$ hyperelliptic curves with $
(2, 4, 4)$-split Jacobians . . . . . . . 55--55
Martin Weimann Computing gonal maps of algebraic curves 55--55
Evangelos A. Coutsias Bricard flexible octahedra and the
canonical cyclohexane . . . . . . . . . 56--56
Martin Helmer Algorithms to compute
Chern--Schwartz--Macpherson and Segr\`e
classes and the Euler characteristic . . 56--56
Manfred Minimair Collaborative computer algebra systems 56--57
Robert H. Lewis and
Bela Paláncz and
Joseph Awange Application of Dixon resultant to
maximization of the likelihood function
of Gaussian mixture distribution . . . . 57--57
Jonathan Tot Spinning double pendulum: equilibria and
bifurcations . . . . . . . . . . . . . . 57--57
L. Beshaj Heights on hyperelliptic and
superelliptic curves . . . . . . . . . . 58--58
A. Elezi Quantum computing, error correcting
quantum codes and algebraic curves . . . 58--58
J. Gutierrez Recovering zeroes of hyperelliptic
curves over finite fields . . . . . . . 58--58
T. Shaska Minimal models for superelliptic curves
over their minimal field of definition 58--58
C. Shor On the $q$-Weierstrass weights of branch
points of superelliptic curves . . . . . 58--58
Barry Trager Good reduction of plane curves . . . . . 58--58
Federico Galetto An algorithm for determining actions of
semisimple Lie groups on free
resolutions . . . . . . . . . . . . . . 59--59
Tyler Kelly An algorithm for computing Picard ranks
of certain K3 surfaces . . . . . . . . . 59--59
Chris Manon Horospherical contraction and
Hamiltonian functions on an algebraic
group . . . . . . . . . . . . . . . . . 59--59
Jennifer Paulhus Decomposing Jacobian varieties . . . . . 59--59
Gora Adj and
Alfred Menezes and
Thomaz Oliveira and
Francisco Rodríguez-Henríquez Computing discrete logarithms using
Joux's algorithm . . . . . . . . . . . . 60--60
David Jensen Brill--Noether theory for metric graphs 60--60
Amy Ksir Automorphisms of tropical curves and
Berkovich analytic curves and their
skeletons . . . . . . . . . . . . . . . 60--60
Ambedkar Dukkipati and
Nithish Pai and
Maria Francis and
Abhishek Dubey On Gröbner bases over rings and residue
class polynomial rings with torsion . . 60--61
Christian Eder and
Jean-Charles Faug\`ere A survey on signature-based Gröbner basis
computations . . . . . . . . . . . . . . 61--61
Jean-Charles Faug\`ere and
Pierre-Jean Spaenlehauer and
Jules Svartz Sparse Gröbner bases: algorithms and
complexity . . . . . . . . . . . . . . . 61--62
Martin R. Albrecht and
Carlos Cid and
Jean-Charles Faug\`ere and
Robert Fitzpatrick and
Ludovic Perret Algebraic algorithms for LWE problems 62--62
John Perry The skeletons you find when you order
your ideal's closet . . . . . . . . . . 62--63
Matthew Tamayo Algebraic full homomorphic encryption
and resisting Gröbner basis cryptanalysis 63--63
Yao Sun and
Dongdai Lin and
Dingkang Wang On implementing signature-based Gröbner
basis algorithms using linear algebraic
routines from M4RI . . . . . . . . . . . 63--64
Thierry N. Dana-Picard Review of ``Pavel Pech:
\booktitleSelected topics in geometry
with classical vs. computer proving'',
World Scientific 2007 ISBN-10:
981-270-942-8, ISBN-13:
978-981-270-942-4 . . . . . . . . . . . 65--66
Konstantin Ziegler Abstracts of recent doctoral
dissertations in computer algebra . . . 67--67
Matthew England Report on the 40th International
Symposium on Symbolic and Algebraic
Computation . . . . . . . . . . . . . . 69--69
Gérard H. E. Duchamp and
Hoang Ngoc Minh and
Ngo Quoc Hoan Harmonic sums and polylogarithms at
negative multi-indices . . . . . . . . . 70--73
Dong-il Lee Standard monomials for the Weyl group $
F_4 $ . . . . . . . . . . . . . . . . . 74--76
A. A. Kytmanov and
A. M. Kytmanov and
E. K. Myshkina On finding residue integrals for a class
of systems of non-algebraic equations 77--79
Takuya Hirata and
Kazuya Yamaguchi and
Ichijo Hodaka A symbolic equation modeler for electric
circuits . . . . . . . . . . . . . . . . 80--82
Ryan McCleeary and
Martin Brain and
Aaron Stump A lazy approach to adaptive exact real
arithmetic using floating-point
operations . . . . . . . . . . . . . . . 83--86
Luca De Feo and
Christophe Petit and
Michaël Quisquater Deterministic root finding in finite
fields . . . . . . . . . . . . . . . . . 87--89
Veronika Pillwein and
Miriam Schussler An efficient procedure deciding
positivity for a class of holonomic
functions . . . . . . . . . . . . . . . 90--93
Michael Monagan and
Baris Tuncer Using sparse interpolation to solve
multivariate diophantine equations . . . 94--97
Waldemar Hebisch Integration in terms of exponential
integrals and incomplete gamma functions 98--100
Massimo Caboara and
Carla Mascia On the Hilbert quasi-polynomials for
non-standard graded rings . . . . . . . 101--104
Takanori Yasuda and
Xavier Dahan and
Yun-Ju Huang and
Tsuyoshi Takagi and
Kouichi Sakurai A multivariate quadratic challenge
toward post-quantum generation
cryptography . . . . . . . . . . . . . . 105--107
Yue Liu Research on Gröbner basis of the defining
ideal of polynomial ring in quaternionic
variables . . . . . . . . . . . . . . . 108--108
Yinghong Li Theories and algorithms for difference
and differential Chow form . . . . . . . 108--109
Jie Zhou The computations and applications based
on comprehensive Groebner system . . . . 109--110
Wei Zhu The computations and applications based
on comprehensive Groebner system . . . . 110--110
Erich Kaltofen Jenks Prize 2015 award citation . . . . 112--112
John Abbott and
Anna Maria Bigatti What is new in CoCoALib and CoCoA-5? . . 113--116
Bui Van Chien and
G. H. E. Duchamp and
Hoang Ngoc Minh Computation tool for the $q$-deformed
quasi-shuffle algebras and
representations of structure of MZVs . . 117--120
Bruno Grenet Lacunaryx: computing bounded-degree
factors of lacunary polynomials . . . . 121--124
Achim Hornecker CloudMath: mathematical collaboration
within the cloud . . . . . . . . . . . . 125--126
Yue Ren Computing tropical varieties over fields
with valuation using classical standard
basis techniques . . . . . . . . . . . . 127--129
Jan Verschelde and
Xiangcheng Yu Polynomial homotopy continuation on GPUs 130--133
Ioannis Emiris Research workshop on algebraic
representations in computer-aided design
for complex shapes . . . . . . . . . . . 134--134
Grégoire Lecerf and
Joelle Saadé A short survey on Kantorovich: like
theorems for Newton's method . . . . . . 1--11
M. Delgado and
P. A. García-Sánchez numericalsgps, a GAP package for
numerical semigroups . . . . . . . . . . 12--24
George Labahn and
Stephen Watt Thematic program in computer algebra:
July 1--Dec 31, 2015 . . . . . . . . . . 25--26
Manuel Kauers and
Peter Paule and
Greg Reid Workshop on symbolic combinatorics and
algorithmic differential algebra . . . . 27--34
Silvana Ilie and
Arne Storjohann Abstracts of the 2015 East Coast
Computer Algebra Day . . . . . . . . . . 35--39
Lingchuan Meng Abstracts of recent doctoral
dissertations in computer algebra . . . 40--42
Aude Maignan and
Tony C. Scott Fleshing out the generalized Lambert $W$
function . . . . . . . . . . . . . . . . 45--60
Sergei A. Abramov and
Leonid A. Sevastianov The conference ``computer algebra'' in
Moscow . . . . . . . . . . . . . . . . . 61--68
Tateaki Sasaki and
Hiroshi Kai Memories on Professor Matu-tarow Noda 69--69
Fritz Schwarz Decomposing and solving quasilinear
second-order differential equations . . 73--82
Miguel Abánades and
Francisco Botana and
Zoltán Kovács and
Tomás Recio and
Csilla Sólyom-Gecse Development of automatic reasoning tools
in GeoGebra . . . . . . . . . . . . . . 85--88
Erhard Aichinger and
Rika Yatchak Sonata: a GAP tool for nearring
computations . . . . . . . . . . . . . . 89--92
Parisa Alvandi and
Mahsa Kazemi and
Marc Moreno Maza Computing limits with the regular chains
and power series libraries: from
rational functions to Zariski closure 93--96
Changbo Chen and
Svyatoslav Covanov and
Farnam Mansouri and
Robert H. C. Moir and
Marc Moreno Maza and
Ning Xie and
Yuzhen Xie The basic polynomial algebra subprograms 97--100
Ryoya Fukasaku and
Hidenao Iwane and
Yosuke Sato CGSQE/SyNRAC: a real quantifier
elimination package based on the
computation of comprehensive Gröbner
systems . . . . . . . . . . . . . . . . 101--104
A. Whitman Groves and
Daniel S. Roche Sparse polynomials in FLINT . . . . . . 105--108
Christoph Koutschan Motion polynomials and planar linkages 109--112
Anton Leykin Polynomial homotopy continuation in
Macaulay2 . . . . . . . . . . . . . . . 113--116
Elias Tsigaridas SLV: a software for real root isolation 117--120
Anonymous Jonathan M. Borwein, former CMS
President, dies at 65 . . . . . . . . . 121--122
Andreas Maurischat Non-free iterative differential modules 126--135
Fei Wang Proof of a series solution for Euler's
trinomial equation . . . . . . . . . . . 136--144
E. Ábrahám and
J. Abbott and
B. Becker and
A. M. Bigatti and
M. Brain and
B. Buchberger and
A. Cimatti and
J. H. Davenport and
M. England and
P. Fontaine and
S. Forrest and
A. Griggio and
D. Kroening and
W. M. Seiler and
T. Sturm Satisfiability checking and symbolic
computation . . . . . . . . . . . . . . 145--147
Parisa Alvandi and
Marc Moreno Maza Real limit points of quasi-componenets
of regular chains . . . . . . . . . . . 148--150
Richard G. Carter and
Shahadat Hossain and
Marzia Sultana Efficient detection of Hessian matrix
sparsity pattern . . . . . . . . . . . . 151--154
Eunice Y. S. Chan and
Robert M. Corless Fibonacci--Mandelbrot polynomials and
matrices . . . . . . . . . . . . . . . . 155--157
Robert M. Corless and
Steven E. Thornton The Bohemian eigenvalue project . . . . 158--160
Evans Doe Ocansey and
Carsten Schneider Representation of hypergeometric
products in difference rings . . . . . . 161--163
Wayne Eberly Black box linear algebra: extending
Wiedemann's analysis of a sparse matrix
preconditioner for computations over
small fields . . . . . . . . . . . . . . 164--166
Heike Fassbender and
Javier Pérez and
Nikta Shayanfar Constructing symmetric
structure-preserving strong
linearizations . . . . . . . . . . . . . 167--169
Majid Gazor and
Mahsa Kazemi $ Z2 $-equivariant standard bases for
submodules associated with $ Z2
$-equivariant singularities . . . . . . 170--172
Gavin Harrison and
Jeremy Johnson and
B. David Saunders Probabilistic analysis of block
Wiedemann for leading invariant factors 173--175
Akiyuki Katayama and
Kiyoshi Shirayanagi A new idea on the interval-symbol method
with correct zero rewriting for reducing
exact computations . . . . . . . . . . . 176--178
SungSoon Kim and
Dong-il Lee Standard monomials for Temperley--Lieb
algebras . . . . . . . . . . . . . . . . 179--181
Marshall Law and
Michael Monagan Computing characteristic polynomials of
matrices of structured polynomials . . . 182--184
Johannes Middeke and
Carsten Schneider Denominator bounds for higher order
systems of linear recurrence equations 185--187
Michael Monagan and
Roman Pearce Fermat benchmarks for rational
expressionals in Maple . . . . . . . . . 188--190
Dominique Duval and
Adrien Poteaux Death of Marc Rybowicz, aged 52 . . . . 191--191
Albert Heinle and
Wolfram Koepf and
Wolfram Sperber Some steps to improve software
information . . . . . . . . . . . . . . 1--11
Michael Monagan and
Alan Wong Fast parallel multi-point evaluation of
sparse polynomials . . . . . . . . . . . 12--14
Kosaku Nagasaka Seeking better algorithms for
approximate GCD . . . . . . . . . . . . 15--17
Dai Numahata and
Hiroshi Sekigawa An algorithm for symbolic--numeric
sparse interpolation of multivariate
polynomials whose degree bounds are
unknown . . . . . . . . . . . . . . . . 18--20
Leili Rafiee Sevyeri and
Robert M. Corless Linearization of a specific family of
Bézout matrices . . . . . . . . . . . . . 21--22
Omar León Sánchez An upper bound for the order of a
differential algebraic variety . . . . . 23--25
Tateaki Sasaki and
Daiju Inaba Enhancing the extended Hensel
construction by using Gröbner basis . . . 26--28
S. Yu. Slavyanov and
O. L. Stesik Antiquantization of deformed Heun class
equations as a tool for symbolic
generation of Painlevé equations . . . . 29--31
David R. Stoutemyer AskConstants proposes concise non-floats
close to floats . . . . . . . . . . . . 32--34
Fei Wang and
Greg Reid and
Henry Wolkowicz Finding maximum rank moment matrices by
facial reduction on primal form and
Douglas--Rachford iteration . . . . . . 35--37
Juan D. Velez and
Juan P. Hernandez and
Carlos A. Cadavid Limits of quotients of polynomial
functions in three variables . . . . . . 42--56
Wen-shin Lee Milestones in Computer Algebra (MICA
2016): a workshop celebrating the
research of Erick Kaltofen . . . . . . . 57--65
Daniel Lichtblau East Coast Computer Algebra Day 2017 . . 66--69
Anonymous Abstracts of recent doctoral
dissertations in computer algebra . . . 70--72
Xiao-Shan Gao Wen-Tsun Wu: His Life and Legacy . . . . 73--79
Nicole Sutherland A demonstration of computing Galois
groups of polynomials in Magma . . . . . 81--82
Yue Ren Computing tropical varieties using
Newton's polygon method . . . . . . . . 83--85
Rui-Juan Jing and
Marc Moreno Maza The polyhedra library in Maple . . . . . 86--88
S. Anisul Haque and
X. Li and
F. Mansouri and
M. Moreno Maza and
D. Mohajerani and
W. Pan CUMODP: a CUDA library for modular
polynomial computation . . . . . . . . . 89--91
Lars Kastner and
Benjamin Lorenz and
Andreas Paffenholz and
Anna-Lena Winz Toric geometry in polymake . . . . . . . 92--94
John Abbott and
Anna M. Bigatti CoCoA-5.2.2 and CoCoALib . . . . . . . . 95--97
Yusuf Baris Tuncer Abstracts of recent doctoral
dissertations in computer algebra . . . 98--98
Christopher W. Brown Message from the SIGSAM chair . . . . . 101--102
Sergei A. Abramov and
Anna A. Ryabenko and
Timur M. Sadykov The second conference . . . . . . . . . 103--110
Anonymous The 2017 Richard D. Jenks Memorial Award 111--111
Anonymous Dongming Wang elected member of the
Academia Europaea . . . . . . . . . . . 112--112
Anonymous George E. Collins (1928--2017) . . . . . 113--113
Robert M. Corless and
Julia E. Jankowski Revisiting the discharge time of a
cylindrical leaking bucket: or, ``one
does not simply call dsolve into
mordor.'' . . . . . . . . . . . . . . . 1--10
Germán A. G. Combariza A few conjectures about the multiple
zeta values . . . . . . . . . . . . . . 11--20
Hiroki Nagashima and
Kiyoshi Shirayanagi Effect of the interval-symbol method
with correct zero rewriting on the $
\delta $-LLL algorithm . . . . . . . . . 24--31
Robert M. Corless and
David J. Jeffrey and
David R. Stoutemyer Comprehensive anti-derivatives and
parametric continuity . . . . . . . . . 32--33
Victor Magron and
Mohab Safey El Din \pkgRealCertify: a Maple package for
certifying non-negativity . . . . . . . 34--37
Luca De Feo and
Hugues Randriambololona and
Édouard Rousseau Lattices of compatibly embedded finite
fields in Nemo/Flint . . . . . . . . . . 38--41
Hans-Gert Gräbe 20 Years SymbolicData . . . . . . . . . 45--54
Joris van der Hoeven and
Robin Larrieu Fast Gröbner basis computation and
polynomial reduction for generic
bivariate ideals . . . . . . . . . . . . 55--58
Joel Nagloo and
Alexey Ovchinnikov and
Peter Thompson Commuting planar polynomial vector
fields for conservative Newton systems 59--62
Alessandro Budroni and
Federico Pintore Hashing to G2 on BLS pairing-friendly
curves . . . . . . . . . . . . . . . . . 63--66
François Boulier and
François Fages and
Ovidiu Radulescu and
Satya Swarup Samal and
Andreas Schuppert and
Werner Seiler and
Thomas Sturm and
Sebastian Walcher and
Andreas Weber The SYMBIONT project: symbolic methods
for biological networks . . . . . . . . 67--70
José Gómez-Torrecillas and
F. J. Lobillo and
Gabriel Navarro Minimum distance computation of linear
codes via genetic algorithms with
permutation encoding . . . . . . . . . . 71--74
Annie Cuyt and
Wen-shin Lee A scale and shift paradigm for sparse
interpolation in one and more dimensions 75--77
Simon Telen and
Bernard Mourrain and
Marc Van Barel Truncated normal forms for solving
polynomial systems . . . . . . . . . . . 78--81
Curtis Bright and
Ilias Kotsireas and
Vijay Ganesh The SAT+CAS paradigm and the Williamson
conjecture . . . . . . . . . . . . . . . 82--84
Jorge Caravantes and
Mario Fioravanti and
Laureano Gonzalez-Vega and
Gema Diaz-Toca Offsets to conics and quadrics: a new
determinantal representation for their
implicit equation . . . . . . . . . . . 85--88
Johannes Middeke and
Carsten Schneider Towards a direct method for finding
hypergeometric solutions of linear first
order recurrence systems . . . . . . . . 89--91
Tudor Jebelean Techniques for natural-style proofs in
elementary analysis . . . . . . . . . . 92--95
Eugene V. Zima Accelerating indefinite hypergeometric
summation algorithms . . . . . . . . . . 96--99
Seung Gyu Hyun and
Stephen Melczer and
Catherine St-Pierre A fast algorithm for solving linearly
recurrent sequences . . . . . . . . . . 100--103
Ranjana Mehta and
Joydip Saha and
Indranath Sengupta Unboundedness of Betti numbers of curves 104--107
Cameron Farnsworth and
Jose Israel Rodriguez Homogenized funtf varieties and
algebraic frame completion . . . . . . . 108--111
I. Bermejo and
E. García-Llorente and
I. García-Marco and
M. Morales Noether resolutions in dimension 2 . . . 114--116
Ludovic Brieulle and
Luca De Feo and
Javad Doliskani and
Jean Pierre Flori and
Éric Schost Computing isomorphisms and embeddings of
finite fields . . . . . . . . . . . . . 117--119
Majid Gazor and
Amir Hashemi and
Mahsa Kazemi Gröbner bases and multi-dimensional
persistent bifurcation diagram
classifications . . . . . . . . . . . . 120--122
Seung Gyu Hyun and
Vincent Neiger and
Hamid Rahkooy and
Éric Schost Sparse FGLM using the block Wiedemann
algorithm . . . . . . . . . . . . . . . 123--125
Rui-Juan Jing and
Marc Moreno Maza Computing the integer points of a
polyhedron . . . . . . . . . . . . . . . 126--129
Jean Kieffer and
Luca De Feo Isogeny-based cryptography in
Julia/Nemo: a case study . . . . . . . . 130--132
A. A. Kytmanov and
A. M. Kytmanov and
E. K. Myshkina On computing residue integrals for a
class of nonlinear transcendental
systems . . . . . . . . . . . . . . . . 133--135
Roberto La Scala and
Sharwan K. Tiwari Computing noncommutative Hilbert series 136--138
Florian Lauster and
D. Russell Luke and
Matthew K. Tam Symbolic computation with monotone
operators . . . . . . . . . . . . . . . 139--141
Chenqi Mou and
Dongming Wang On $W$-characteristic sets of
lexicographic Gröbner bases . . . . . . . 142--144
Dai Numahata and
Hiroshi Sekigawa Robust algorithms for sparse
interpolation of multivariate
polynomials . . . . . . . . . . . . . . 145--147
Masaru Sanuki Improvement of EZ-GCD algorithm based on
extended Hensel construction . . . . . . 148--150
Nicole Sutherland Computation of geometric Galois groups
and absolute factorizations . . . . . . 151--153
Jiaxiong (Lucas) Hu and
Anton Panferov Abstracts of recent doctoral
dissertations in computer algebra . . . 154--155
Ao Li and
Robert M. Corless Revisiting Gilbert Strang's ``a chaotic
search for $i$'' . . . . . . . . . . . . 1--22
Sergei A. Abramov and
Moulay A. Barkatou Row reduction process for matrices of
scalar operators: storing the
intermediate results of row
transformation . . . . . . . . . . . . . 23--30
Shanshan Yao and
Yifei Feng and
Xiaohong Jia and
Li-Yong Shen ISSAC 2019 software presentations
communicated by Yue Ren: a package to
compute implicit equations for rational
curves and surfaces . . . . . . . . . . 33--36
Hoon Hong and
Alexey Ovchinnikov and
Gleb Pogudin and
Chee Yap SIAN: a tool for assessing structural
identifiability of parametric ODEs . . . 37--40
Robin Larrieu Computing generic bivariate Gröbner bases
with Mathemagix . . . . . . . . . . . . 41--44
Kisun Lee Certifying approximate solutions to
polynomial systems on Macaulay2 . . . . 45--48
Clemens Hofstadler and
Clemens G. Raab and
Georg Regensburger Certifying operator identities via
noncommutative Gröbner bases . . . . . . 49--52
Antonio Jiménez-Pastor A Sage implementation for DD-finite
functions . . . . . . . . . . . . . . . 53--56
Manuel Kauers and
Marc Mezzarobba Multivariate Ore polynomials in SageMath 57--60
Julián Cuevas-Rozo and
Jose Divasón and
Miguel Marco-Buzunáriz and
Ana Romero A Kenzo interface for algebraic topology
computations in SageMath . . . . . . . . 61--64
Sergei A. Abramov and
Anna Ryabenko and
Leonid A. Sevastianov and
Min Wu and
Yvette Zonn The conference ``Computer Algebra'' in
Moscow . . . . . . . . . . . . . . . . . 65--77
Kosuke Sakata An efficient reduction strategy for
signature-based algorithms to compute
Gröbner basis . . . . . . . . . . . . . . 81--92
Shayea Aldossari and
Mark van Hoeij Methods for simplifying differential
equations . . . . . . . . . . . . . . . 93--95
Shaoshi Chen and
Jing Guo Additive Ore--Sato theorem . . . . . . . 96--98
Boming Chi and
Akira Terui The GPGCD algorithm with the Bézout
matrix . . . . . . . . . . . . . . . . . 99--102
Robert M. Corless and
Leili Rafiee Sevyeri Approximate GCD in Bernstein basis . . . 103--106
Mawunyo Kofi Darkey-Mensah and
Przemys\law Koprowski Intrinsic factorization of ideals in
Dedekind domains . . . . . . . . . . . . 107--109
Hao Du and
Jing Guo and
Ziming Li An additive decomposition in multiple
logarithmic extensions . . . . . . . . . 110--113
Jesse Elliott and
Éric Schost Bit complexity for critical point
computation in smooth and compact real
hypersurfaces . . . . . . . . . . . . . 114--117
Marijn Heule and
Manuel Kauers and
Martina Seidl A family of schemes for multiplying $ 3
\times 3 $ matrices with 23 coefficient
multiplications . . . . . . . . . . . . 118--121
Bo Huang and
Wei Niu Algebraic approach to chaos induced by
snapback repeller . . . . . . . . . . . 122--125
Manuel Kauers and
Thibaut Verron Why you should remove zeros from data
before guessing . . . . . . . . . . . . 126--129
Kazuki Kondo and
Hiroshi Sekigawa Robust computation methods for sparse
interpolation of multivariate
polynomials . . . . . . . . . . . . . . 130--133
Jiang Liu Block distance invariant method for
monoterm canonicalization of Riemann
tensor polynomials . . . . . . . . . . . 134--137
Akshar Nair and
James Davenport and
Gregory Sankaran and
Scott McCallum Lazard's CAD exploiting equality
constraints . . . . . . . . . . . . . . 138--141
Garrett Paluck and
Michael Monagan New bivariate Hensel lifting algorithm
for $n$ factors . . . . . . . . . . . . 142--145
Patricia Pascual-Ortigosa and
Eduardo Sáenz-de-Cabezón and
Henry P. Wynn Algebraic algorithms for the reliability
analysis of multi-state $k$-out-of-$n$
systems . . . . . . . . . . . . . . . . 146--149
Yi Zhou and
Mark van Hoeij Fast algorithm for factoring difference
operators . . . . . . . . . . . . . . . 150--152
Academy of Mathematics and
Systems Science International Symposium on Wen-Tsun Wu's
Academic Thought and Mathematics
Mechanization . . . . . . . . . . . . . 155--181
Jürgen Gerhard and
Ilias S. Kotsireas Maple Conference 2019 . . . . . . . . . 182--182
CCA editors Abstracts of recent doctoral
dissertations in computer algebra . . . 183--188
Ioannis Emiris 15 PhD positions in GRAPES: learning,
processing & optimising shapes . . . . . 189--189
Joris van der Hoeven and
Grégoire Lecerf Ultimate complexity for numerical
algorithms . . . . . . . . . . . . . . . 1--13
Werner M. Seiler Jacques Calmet dies at 77 . . . . . . . 14--15
Sergei A. Abramov and
Denis E. Khmelnov and
Anna A. Ryabenko Checkpoints in searching for rational
solutions of linear ordinary difference
and differential systems . . . . . . . . 18--29
Antonio Jiménez-Pastor and
Alin Bostan and
Frédéric Chyzak and
Pierre Lairez The Sage package \tt comb\_walks for
walks in the quarter plane . . . . . . . 30--38
Colin Crowley and
Jose Israel Rodriguez and
Jacob Weiker and
Jacob Zoromski MultiRegeneration for polynomial system
solving . . . . . . . . . . . . . . . . 39--43
Marc Härkönen and
Benjamin Hollering and
Fatemeh Tarashi Kashani and
Jose Israel Rodriguez Algebraic optimization degree . . . . . 44--48
Christina Katsamaki and
Fabrice Rouillier and
Elias Tsigaridas and
Zafeirakis Zafeirakopoulos PTOPO: a MAPLE package for the topology
of parametric curves . . . . . . . . . . 49--52
Przemys\law Koprowski CQF Magma package . . . . . . . . . . . 53--56
Ana Romero and
Julio Rubio and
Francis Sergeraert and
Markus Szymik A new Kenzo module for computing the
Eilenberg--Moore spectral sequence . . . 57--60
Michael Monagan The 2019 Richard D. Jenks memorial prize 61--61
Staff Recent and upcoming events . . . . . . . 62--64
Joris van der Hoeven and
Michael Monagan Computing one billion roots using the
tangent Graeffe method . . . . . . . . . 65--85
J. Maurice Rojas and
Yuyu Zhu A complexity chasm for solving sparse
polynomial equations over $p$-adic
fields: extended abstract . . . . . . . 86--90
Jiayue Qi A calculus for monomials in Chow group
of zero cycles in the moduli space of
stable curves . . . . . . . . . . . . . 91--94
Sebastian Lindner and
Laurent Imbert and
Michael J. Jacobson Improved divisor arithmetic on generic
hyperelliptic curves . . . . . . . . . . 95--99
Julia Lindberg and
Nigel Boston and
Bernard C. Lesieutre Exploiting symmetry in the power flow
equations using monodromy . . . . . . . 100--104
Katherine Harris and
Jonathan D. Hauenstein and
Agnes Szanto Smooth points on semi-algebraic sets . . 105--108
Jérémy Berthomieu and
Andrew Ferguson and
Mohab Safey El Din Towards fast one-block quantifier
elimination through generalised critical
values . . . . . . . . . . . . . . . . . 109--113
Apostolos Chalkis and
Vissarion Fisikopoulos and
Panagiotis Repouskos and
Elias Tsigaridas Sampling the feasible sets of SDPs and
volume approximation . . . . . . . . . . 114--118
Andrey Bychkov and
Gleb Pogudin Optimal monomial quadratization for ODE
systems: extended abstract . . . . . . . 119--123
Erdal Imamoglu and
Erich L. Kaltofen A note on sparse polynomial
interpolation in Dickson polynomial
basis . . . . . . . . . . . . . . . . . 125--128
Maheswara Rao Valluri Combinatorial primality test . . . . . . 129--133
Miao-jung Yvonne Ou Teaching multivariable calculus and
tensor calculus with computer algebra
software . . . . . . . . . . . . . . . . 134--135
Ernst W. Mayr and
Werner M. Seiler and
Evgenii V. Vorozhtsov Vladimir Gerdt dies at 73 . . . . . . . 1--2
Joris van der Hoeven and
Grégoire Lecerf On sparse interpolation of rational
functions and gcds . . . . . . . . . . . 1--12
Sergei A. Abramov and
Alla Bogolubskaya 22nd Workshop on Computer Algebra in
Memory of Professor Vladimir Gerdt in
Dubna . . . . . . . . . . . . . . . . . 21--29
Sergei A. Abramov and
Anna Ryabenko and
Leonid A. Sevastianov and
Yvette Zonn and
Min Wu The fourth conference ``computer
algebra'' in Moscow . . . . . . . . . . 30--38
Zoltán Kovács and
Tomás Recio and
M. Pilar Vélez Automated reasoning tools in GeoGebra
discovery . . . . . . . . . . . . . . . 39--43
Alexandre Goyer A Sage package for the symbolic-numeric
factorization of linear differential
operators . . . . . . . . . . . . . . . 44--48
Ilia Ilmer and
Alexey Ovchinnikov and
Gleb Pogudin Maple application for structural
identifiability analysis of ODE models 49--53
Philippe Elbaz-Vincent and
Etienne Marcatel An extension of the fpLLL library to
Hermitian lattices . . . . . . . . . . . 54--58
Michael Monagan A call to build a publicly accessible
library of lecture recordings in
computer algebra . . . . . . . . . . . . 65--67
Mawunyo Kofi Darkey-Mensah Algorithms for quadratic forms over
global function fields of odd
characteristic . . . . . . . . . . . . . 68--72
J. I. García-García and
D. Marín-Aragón and
A. Vigneron-Tenorio Computing the ideals of sumset
semigroups . . . . . . . . . . . . . . . 73--76
Skander Belhaj and
Abdulrahman Alsulami Approximate greatest common divisor of
several polynomials from Hankel matrices 77--81
Julian Pfeifle Large final polynomials from integer
programming . . . . . . . . . . . . . . 82--86
Daniel Miguel and
Andrea Guidolin and
Ana Romero and
Julio Rubio Constructing new spectral systems from
simplicial fibrations . . . . . . . . . 87--91
Shashi Gowda and
Yingbo Ma and
Alessandro Cheli and
Maja Gwó'zzd'z and
Viral B. Shah and
Alan Edelman and
Christopher Rackauckas High-performance symbolic-numerics via
multiple dispatch . . . . . . . . . . . 92--96
Kosaku Nagasaka Approximate GCD by relaxed NewtonSLRA
algorithm . . . . . . . . . . . . . . . 97--101
Rodrigo Iglesias and
Eduardo Sáenz de Cabezón Cellular reductions of the
Pommaret--Seiler resolution for
Quasi-stable ideals . . . . . . . . . . 102--106
R. Bradford and
J. H. Davenport and
M. England and
A. Sadeghimanesh and
A. Uncu The DEWCAD project: pushing back the
doubly exponential wall of cylindrical
algebraic decomposition . . . . . . . . 107--111
Andrei Matveiakin Discovering multiple polylogarithm
equations via symbolic computations . . 112--116
CCA editors Abstracts of recent doctoral
dissertations in computer algebra . . . 117--124
Aaron E. Naiman Automated vector space proofs using
Mathematica . . . . . . . . . . . . . . 1--13
Ignacio García-Marco and
Irene Márquez-Corbella and
Edgar Martínez-Moro and
Yuriko Pitones Computing generalized Hamming weights of
binary linear codes via free resolutions 19--24
Antonio Jiménez-Pastor and
Gleb Pogudin Computing exact nonlinear reductions of
dynamical models . . . . . . . . . . . . 25--31
Jakob Steininger and
Sergey Yurkevich Extended abstract for: Solving Rupert's
problem algorithmically . . . . . . . . 32--35
Jorge García Fontán and
Alessandro Colotti and
Sébastien Briot and
Alexandre Goldsztejn and
Mohab Safey El Din Computer algebra methods for polynomial
system solving at the service of
image-based visual servoing . . . . . . 36--40
Christian Eder and
Pierre Lairez and
Rafael Mohr and
Mohab Safey El Din Towards signature-based Gröbner basis
algorithms for computing the
nondegenerate locus of a polynomial
system . . . . . . . . . . . . . . . . . 41--45
Bertrand Teguia Tabuguia and
Wolfram Koepf FPS in action: an easy way to find
explicit formulas for interlaced
hypergeometric sequences . . . . . . . . 46--50
François Lemaire and
Louis Roussel Integral equation modelling and deep
learning . . . . . . . . . . . . . . . . 51--55
Jazz G. Suchen and
Josué Tonelli-Cueto Ultrametric Smale's $ \alpha $-theory 56--59
Raphaël Pag\`es Factoring differential operators over
algebraic curves in positive
characteristic . . . . . . . . . . . . . 60--63
Juan Pablo González Trochez and
Marc Moreno Maza and
Matt Calder and
Erik Postma Algorithms for multivariate Laurent
series . . . . . . . . . . . . . . . . . 64--67
Jiayue Qi An identity on multinomial coefficients 68--71
Evelyne Hubert and
Tobias Metzlaff and
Philippe Moustrou and
Cordian Riener $T$-orbit spaces of multiplicative
actions and applications . . . . . . . . 72--75
AmirHosein Sadeghimanesh and
Matthew England An SMT solver for non-linear real
arithmetic inside Maple . . . . . . . . 76--79
Tian Chen and
Michael Monagan Factoring non-monic polynomials
represented by black boxes . . . . . . . 80--83
Shahriar Iravanian and
Carl Julius Martensen and
Alessandro Cheli and
Shashi Gowda and
Anand Jain and
Yingbo Ma and
Chris Rackauckas Symbolic-numeric integration of
univariate expressions based on sparse
regression . . . . . . . . . . . . . . . 84--87
Ayoola Jinadu and
Michael Monagan A new interpolation algorithm for
computing Dixon resultants . . . . . . . 88--91
Henri Cohen and
Bill Allombert and
Karim Belabas Jenks Prize announcement . . . . . . . . 92--94
Tateaki Sasaki A Bridge between Euclid and Buchberger:
(An Attempt to Enhance Gröbner Basis
Algorithm by PRSs and GCDs) . . . . . . 97--124
Oliver Salazar Celis Adaptive Thiele interpolation . . . . . 125--132
Sergei Abramov and
Gleb Pogudin Linear Difference Operators with
Sequence Coefficients Having
Infinite-Dimentional Solution Spaces . . 1--4
Shalosh B. Ekhad and
Doron Zeilberger Counting Clean Words According to the
Number of Their Clean Neighbors . . . . 5--9
Eva U. Petkovsek Marko Petkovsek 1955--2023 . . . . . . . 10--18
Kazuki Okuda and
Kiyoshi Shirayanagi Using the Interval-Symbol Method with
Zero Rewriting to Factor Polynomials
over Algebraic Number Fields . . . . . . 21--30
Johannes Blümlein and
Nikolai Fadeev and
Carsten Schneider Computing Mellin Representations and
Asymptotics of Nested Binomial Sums in a
Symbolic Way: The RICA Package . . . . . 31--34
Jérémy Berthomieu and
Stef Graillat and
Dimitri Lesnoff and
Theo Mary Modular Matrix Multiplication on GPU for
Polynomial System Solving . . . . . . . 35--38
Yang-Hui He and
Vishnu Jejjala and
Brent D. Nelson and
Hal Schenck and
Michael Stillman MSSM: a Macaulay2 Package for the Vacuum
Moduli Space . . . . . . . . . . . . . . 39--42
Christopher Brown and
Zoltán Kovács and
Tomás Recio Faithful Real-Time Animation of
Parametrized (Semi-) Algebraic
Expressions via Cylindrical Algebraic
Decomposition . . . . . . . . . . . . . 43--46
Miguel A. Marco-Buzunáriz and
Ana Romero and
Jose Divasón Effective Homology of Universal Covers 47--50
Bertrand Teguia Tabuguia Operations for $D$-Algebraic Functions 51--56
Nusa Zidaric and
Guang Gong and
Mark Aagaard and
Aleksandar Jurisi\'c and
Olexandr Konovalov FFCSA --- Finite Field Constructions,
Search, and Algorithms . . . . . . . . . 57--64
David Ayotte and
Xavier Caruso and
Antoine Leudi\`ere and
Joseph Musleh Drinfeld Modules in SageMath . . . . . . 65--71
Sergei A. Abramov and
Alexander B. Batkhin and
Anna Ryabenko and
Leonid A. Sevastianov and
Yvette Zonn and
Min Wu The Fifth Conference ``Computer
Algebra'' in Moscow . . . . . . . . . . 72--84
Ross McPhedran and
Tony C. Scott and
Aude Maignan The Keiper--Li Criterion for the Riemann
Hypothesis and Generalized Lambert
Functions . . . . . . . . . . . . . . . 85--110
Antonio Jiménez-Pastor and
Sonia L. Rueda and
Maria-Angeles Zurro Computing Almost-Commuting Basis of
Ordinary Differential Operators . . . . 111--118
Hiroshi Sekigawa An Approximation Algorithm for the
Nearest Decomposable Polynomial in the
Hamming Distance . . . . . . . . . . . . 119--125
Tereso del Río and
AmirHosein Sadeghimanesh and
Matthew England Clustering in the Lazard method for
Cylindrical Algebraic Decomposition . . 126--132
Benjamin Chen and
Yu Li and
Eugene Zima On a Two-Layer Modular Arithmetic . . . 133--136
Tobias Metzlaff Symmetry Adapted Bases for Trigonometric
Optimization . . . . . . . . . . . . . . 137--140
Nusa Zidaric How to use a CAS for Hardware Design
Automation . . . . . . . . . . . . . . . 141--147
Snehal Bhayani and
Praneeth Susarla and
S. S. Krishna Chaitanya Bulusu and
Olli Silven and
Markku Juntti and
Janne Heikkila A Novel Application of Polynomial
Solvers in mmWave Analog Radio
Beamforming . . . . . . . . . . . . . . 148--151
Frédéric Bihan and
Erika Croy and
Weixun Deng and
Kaitlyn Phillipson and
Robert J. Rennie and
J. Maurice Rojas Quickly Computing Isotopy Type for
Exponential Sums over Circuits (Extended
Abstract) . . . . . . . . . . . . . . . 152--155
Katarína Studenicová Arithmetics in Generalised Cantor Base
Systems . . . . . . . . . . . . . . . . 156--159
Kosaku Nagasaka and
Ryo Oshimatani Conditional Gröbner Basis: Gröbner Basis
Detection with Parameters . . . . . . . 160--164
M. Levent Dogan and
Alperen A. Ergür and
Elias Tsigaridas On the Complexity of Chow and Hurwitz
Forms . . . . . . . . . . . . . . . . . 167--199
Elena Berardini and
Alain Couvreur and
Grégoire Lecerf A Proof of the Brill--Noether Method
from Scratch . . . . . . . . . . . . . . 200--229
J. M. Shearer and
M. A. Wolfe ALGLIB, a simple symbol-manipulation
package . . . . . . . . . . . . . . . . 820--825