@Preamble{"\input bibnames.sty " #
"\input path.sty " #
"\ifx \undefined \arccoth \def \arccoth {\mathop{\rm arccoth}\nolimits} \fi" #
"\ifx \undefined \booktitle \def \booktitle #1{{{\em #1}}} \fi" #
"\ifx \undefined \mathbb \def \mathbb #1{{\bf #1}}\fi" #
"\ifx \undefined \mathcal \def \mathcal #1{{\cal #1}}\fi" #
"\ifx \undefined \mathrm \def \mathrm #1{{\rm #1}}\fi" #
"\ifx \undefined \pkg \def \pkg #1{{{\tt #1}}} \fi" #
"\hyphenation{
brems-strah-lung
Fried-rich
Kalt-of-en
Ne-cha-ev-sky
SIG-SAM
Sho-u-i-chi
}"
}
@String{ack-nhfb = "Nelson H. F. Beebe,
University of Utah,
Department of Mathematics, 110 LCB,
155 S 1400 E RM 233,
Salt Lake City, UT 84112-0090, USA,
Tel: +1 801 581 5254,
FAX: +1 801 581 4148,
e-mail: \path|beebe@math.utah.edu|,
\path|beebe@acm.org|,
\path|beebe@computer.org| (Internet),
URL: \path|https://www.math.utah.edu/~beebe/|"}
@String{j-ACM-COMM-COMP-ALGEBRA = "ACM Communications in Computer Algebra"}
@String{j-CACM = "Communications of the ACM"}
@String{j-SIGSAM = "SIGSAM Bulletin (ACM Special Interest Group
on Symbolic and Algebraic Manipulation)"}
@String{pub-ACM = "ACM Press"}
@String{pub-ACM:adr = "New York, NY, USA"}
@String{pub-AW = "Ad{\-d}i{\-s}on-Wes{\-l}ey"}
@String{pub-AW:adr = "Reading, MA, USA"}
@String{pub-CAMBRIDGE = "Cambridge University Press"}
@String{pub-CAMBRIDGE:adr = "Cambridge, UK"}
@String{pub-SIAM = "Society for Industrial and Applied
Mathematics"}
@String{pub-SIAM:adr = "Philadelphia, PA, USA"}
@String{pub-SV = "Spring{\-}er-Ver{\-}lag"}
@String{pub-SV:adr = "Berlin, Germany~/ Heidelberg, Germany~/
London, UK~/ etc."}
@String{pub-WORLD-SCI = "World Scientific Publishing Co."}
@String{pub-WORLD-SCI:adr = "Singapore; Philadelphia, PA, USA; River
Edge, NJ, USA"}
@String{ser-LNCS = "Lecture Notes in Computer Science"}
@Article{Heindel:1967:AOS,
author = "Lee E. Heindel and Paul W. {Purdom, Jr.}",
title = "The automatic optimization of {SLIP} routines",
journal = j-SIGSAM,
volume = "??",
number = "8",
pages = "21--30",
month = dec,
year = "1967",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1316548.1316549",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:15:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "8",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
remark = "ACM Portal PDF file is missing pages 21--22.",
}
@Article{Sage:1968:IPT,
author = "F. H. Sage and D. V. Smith",
title = "The introduction of a paging technique into the
symmetric list processor, {SLIP}",
journal = j-SIGSAM,
volume = "??",
number = "9",
pages = "34--46",
month = apr,
year = "1968",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1093532.1093533",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:15:39 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "When the computing community turned its attention back
to the problem of 'pure' symbol manipulation, a large
and ever-growing family of 'list-processing' ('LP')
computer languages resulted. SLIP, which is one of
these, was primarily written in FORTRAN, making it easy
to use, understand and debug. The widespread use of
SLIP, however, has been severely hampered by the
restriction of available space in the system. Guided by
the desire for more available space, we imposed upon
our study the conditions that as few changes as
possible should be made to the SLIP system, and
additions to the system should be automatic functions
of the system and not of the user. This report shows
how a paging technique incorporated into the SLIP
system accomplished our goal.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "9",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Clark:1969:SSS,
author = "S. James Clark",
title = "Symbolic solution of a system of first order linear
differential equations",
journal = j-SIGSAM,
volume = "??",
number = "11",
pages = "13--18",
month = apr,
year = "1969",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1093407.1093408",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:13:49 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "PL/I FORMAC is used to find the symbolic solution to a
system of first order simultaneous linear differential
equations with alphanumeric coefficients by applying
the Laplace transform. The program incorporates
routines to solve systems of linear equations with
alphanumeric coefficients, Nth order determinants with
alphanumeric elements, and divisions of one polynomial
by another.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "11",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Collins:1969:AAS,
author = "G. E. Collins",
title = "Algorithmic approaches to symbolic integration and
simplification: summary of the panel session sponsored
by {SIGSAM} at the {FJCC} in {San Francisco}, {December
10, 1968}",
journal = j-SIGSAM,
volume = "??",
number = "12",
pages = "5--16",
month = jul,
year = "1969",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1241706.1241707",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:13:52 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This panel session followed the format announced by
SIGSAM Chairman Carl Engelman in the announcement
published in SIGSAM Bulletin No. 10 (October 1968).
Carl gave a brief (five or ten minutes) introduction to
the subject and introduced Professor Joel Moses (M. I.
T.). Joel presented an excellent exposition of the
recent research accomplishments of the other panel
members, synthesizing their work into a single large
comprehensible picture. His presentation was greatly
enhanced by a series of 27 carefully prepared slides
containing critical examples and basic formulas, and
was certainly the feature of the show. A panel
discussion followed, with some audience participation.
Panel members were Dr. W. S. Brown (Bell Telephone
Laboratories), Professor B. F. Caviness (Duke
University), Dr. Daniel Richardson and Dr. R. H. Risch
(IBM).",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "12",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Neubuser:1969:SSC,
author = "Joachim Neub{\"u}ser",
title = "From the {SIGSAM Subcommittee on Computation of
Algebraic Structures}",
journal = j-SIGSAM,
volume = "??",
number = "12",
pages = "17--17",
month = jul,
year = "1969",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1241706.1241708",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:13:52 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "So far, the following colleagues have agreed to act as
members of the subcommittee:\par
John J. Cannon, Department of Pure Mathematics, The
University of Sydney, Sydney, N.S.W. 2006,
Australia.\par
(Programs for the investigation of groups, Lie rings,
etc.; symbol manipulation languages.)\par
Stig Flodmark, Institutionen f{\"o}r Teoretisk Fysik,
Stockholms Universitet, Vanadisv{\'a}gen 9, Stockholm
VA, Sweden.\par
(Programs for non-numerical mathematics for application
in physics.)\par
John Mc Kay, Atlas Computer Laboratory, Chilton,
Didcot, Berkshire, England.\par
(Programs for the investigation of groups.)\par
Robert J. Plemmons, Mathematics Department, The
University of Tennessee, Knoxville, Tennessee 37916,
USA.\par
(Programs for the investigation of semigroups and
related structures.)",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "12",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cannon:1969:CAP,
author = "John J. Cannon",
title = "A critique of algebraic programming languages",
journal = j-SIGSAM,
volume = "??",
number = "12",
pages = "18--27",
month = jul,
year = "1969",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1241706.1241709",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:13:52 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The newly emerging area of computation of algebraic
structures has forcibly illustrated serious
shortcomings in existing higher-level languages. If an
algebraic structure program is written in a high level
language it is so inefficient in its utilization of
store as to be of little practical use. If, on the
other hand, such a program is written in assembly
language, although now it has considerable practical
application, the cost of developing it is high and the
program cannot be run on a different type of machine
without recoding.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "12",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Plemmons:1969:SCA,
author = "Robert J. Plemmons",
title = "A survey of computer applications to semigroups and
related structures",
journal = j-SIGSAM,
volume = "??",
number = "12",
pages = "28--39",
month = jul,
year = "1969",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1241706.1241710",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:13:52 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Although most of the applications of computers to
abstract algebra have been made in group theory [4],
there have been several applications to finite
semigroups and related structures. Most of the work in
this area has been concentrated on enumerative type
problems and backtrack methods [11] in searching for
examples of specific types of structures. Recently
however, several papers have appeared that describe
computer applications to the analysis of specific
structures and to the investigation of word problems in
semigroups.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "12",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Nievergelt:1969:NML,
author = "J. Nievergelt and F. Fischer and M. I. Irland and J.
R. Sidlo",
title = "{NUCLEOL} --- a minimal list processor",
journal = j-SIGSAM,
volume = "??",
number = "12",
pages = "40--52",
month = jul,
year = "1969",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1241706.1241711",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:13:52 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "NUCLEOL is a low-level list processor designed as a
basis in terms of which higher-level list- and
string-processing languages could be implemented easily
and efficiently. Hence its design aims at:\par
(a) Simplicity\par
(b) Complete and concise description\par
(c) General data structures and a small, well-chosen
set of primitive operations\par
(d) A scheme for implementation which makes it easy to
transfer the system from one computer to
another.\par
The system is currently implemented as a PL/1
program.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "12",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ludeman:1969:PUP,
author = "M. M. Ludeman",
title = "{PL/I} utility programs for {Formac} applications",
journal = j-SIGSAM,
volume = "??",
number = "12",
pages = "53--58",
month = jul,
year = "1969",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1241706.1241712",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:13:52 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The new PL/I FORMAC Compiler released by IBM as a Type
III program earlier this year has the potential to be a
useful addition to the tools of an applied programmer
and researcher alike. It also presents a problem to
these same users in that it is based on PL/I, a new
language which, despite all the promotion by IBM, has
yet to become universally accepted in the programming
world. This unfamiliarity with PL/I makes difficult
many tasks which would be trivial if they were done in
FORTRAN IV. This note describes one application of
FORMAC and the PL/I utility programs required to
utilize the FORMAC results. It is hoped this will save
other users time and effort in their use of FORMAC.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "12",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bahr:1969:SFF,
author = "K. Bahr",
title = "A smaller {FORTRAN--FORMAC} system",
journal = j-SIGSAM,
volume = "??",
number = "12",
pages = "59--60",
month = jul,
year = "1969",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1241706.1241713",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:13:52 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We have available a modified 7090-FORTRAN-FORMAC
system and would like to offer this system to everybody
who is still using the 7090/94. We know about
PL/I-FORMAC and we use it, but we still have several
programs which we don't want to rewrite and which run
absolutely satisfactorily with our FORTRAN-FORMAC.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "12",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Moses:1969:ICS,
author = "Joel Moses",
title = "The integration of a class of special functions with
the {Risch} algorithm",
journal = j-SIGSAM,
volume = "??",
number = "13",
pages = "14--27",
month = dec,
year = "1969",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:53 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "13",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hearn:1969:SLR,
author = "Anthony C. Hearn",
title = "{Standard LISP} (reprint)",
journal = j-SIGSAM,
volume = "??",
number = "13",
pages = "28--49",
month = dec,
year = "1969",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086780.1086782",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:53 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "13",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Moses:1970:SFS,
author = "Joel Moses",
title = "Summary of the {1969 FJCC SIGSAM--SIGART} technical
session",
journal = j-SIGSAM,
volume = "??",
number = "14",
pages = "4--10",
month = jan,
year = "1970",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:53 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "14",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Nievergelt:1970:SGP,
author = "J. Nievergelt",
title = "Software for graph processing",
journal = j-SIGSAM,
volume = "??",
number = "14",
pages = "11--12",
month = jan,
year = "1970",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:53 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "14",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{LeSchack:1970:RRL,
author = "A. R. LeSchack",
title = "Response from {A. R. LeSchack}",
journal = j-SIGSAM,
volume = "??",
number = "14",
pages = "13--16",
month = jan,
year = "1970",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:53 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "14",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Blair:1970:IFS,
author = "F. W. Blair and J. H. Griesmer and R. D. Jenks",
title = "An interactive facility for symbolic mathematics",
journal = j-SIGSAM,
volume = "??",
number = "14",
pages = "17--18",
month = jan,
year = "1970",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:53 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "14",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bernstein:1970:LPF,
author = "Herbert J. Bernstein",
title = "{Ludeman}'s {PL\slash I FORMAC} gradient problem as
handled by {FORTRAN SYMBOLANG}",
journal = j-SIGSAM,
volume = "??",
number = "14",
pages = "19--34",
month = jan,
year = "1970",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:53 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "14",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Tobey:1970:HNG,
author = "R. G. Tobey",
title = "Historical note on gradient evaluation",
journal = j-SIGSAM,
volume = "??",
number = "14",
pages = "35--35",
month = jan,
year = "1970",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:53 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "14",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Eisenpress:1970:PSD,
author = "Harry Eisenpress and Abel Bomberault",
title = "Practical symbolic differentiation of large
expressions using {PL\slash I Formac}",
journal = j-SIGSAM,
volume = "??",
number = "14",
pages = "36--61",
month = jan,
year = "1970",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:53 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "14",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Moses:1970:FFL,
author = "Joel Moses",
title = "The function of {FUNCTION} in {LISP} or why the
{FUNARG} problem should be called the environment
problem",
journal = j-SIGSAM,
volume = "??",
number = "15",
pages = "13--27",
month = jul,
year = "1970",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1093410.1093411",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:06 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "A problem common to many powerful programming
languages arises when one has to determine what values
to assign to free variables in functions. Different
implementational approaches which attempt to solve the
problem are considered. The discussion concentrates on
LISP implementations and points out why most current
LISP systems are not as general as the original LISP
1.5 system. Readers not familiar with LISP should be
able to read this paper without difficulty since we
have tried to couch the argument in ALGOL-like terms as
much as possible.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "15",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Flodmark:1970:UCT,
author = "Stig Flodmark and Esko Blokker",
title = "Use of computers in treating nonnumerical mathematics
and group theoretical problems in physics",
journal = j-SIGSAM,
volume = "??",
number = "15",
pages = "28--63",
month = jul,
year = "1970",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1093410.1093412",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:06 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We give a short discussion of the use of group theory
in physics, with references in order to introduce
mathematicians to this subject; further, a simplified
explanation of symmetry adaptation of wave functions.
The main part of the paper forms a survey of algebraic
and group theoretical programs used by or useful to
physicists.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "15",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Howard:1970:RAS,
author = "James C. Howard",
title = "Relativistic applications of symbolic mathematical
computation",
journal = j-SIGSAM,
volume = "??",
number = "15",
pages = "64--83",
month = jul,
year = "1970",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1093410.1093413",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:06 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The formulation of problems in relativistic mechanics
requires a vast amount of tedious algebraic
manipulation and symbolic differentiation. Such
problems are well suited to symbolic mathematical
computation, using one of the computer languages
designed for this purpose. A method is described
whereby a digital computer can be used to derive the
field equations and the equations of the geodesics that
describe the trajectories of bodies in space. The
effectiveness of the method is demonstrated by using it
to derive the field equations and the equations of the
trajectory of a body which is moving in a spherically
symmetric static field. It should be understood,
however, that the method is not restricted to the study
of gravitational models of this type. Indeed, the full
advantage of the method will only be realized in
applications to more complex cosmological situations.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "15",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Heindel:1970:AEP,
author = "Lee E. Heindel",
title = "Algorithms for exact polynomial root calculation",
journal = j-SIGSAM,
volume = "??",
number = "16",
pages = "9--9",
month = oct,
year = "1970",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1093415.1093416",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:13 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This thesis discusses two sets of fully specified
algorithms which, given a univariate polynomial with
integer coefficients (with possible multiple roots) and
a positive rational error bound, uses
infinite-precision arithmetic and Sturm's Theorem to
compute intervals containing the real roots of the
polynomial and whose lengths are less than the given
error bound, The algorithms also provide a simple means
of determining the number of real roots in any
interval.The first set of algorithms uses
infinite-precision integer arithmetic to compute the
sequence of polynomials required by Sturm's Theorem and
also to do all the required polynomial evaluations. The
second set uses congruence arithmetic to compute the
images of the sequence of polynomials over the finite
fields GF(p
i) for several primes pi and then uses the natural
homomorphisms from the integers onto the finite fields
GF(pi) and the Chinese Remainder Theorem to do the
evaluations. The primary advantage of the use of
congruence arithmetic in the second set of algorithms
is that the computing time to multiply any two elements
of GF(pi) is a constant whereas the time to multiply
any two integers is proportional to the square of their
lengths.The computing times of both sets of algorithms
are analyzed in detail using the techniques of
computing time analysis developed in the past few years
by G. E. Collins and D. Knuth. It is shown that if P is
a primitive, positive, univariate polynomial over the
integers of positive degree, m, whose coefficients are
bounded in magnitude by d, and which has L real roots,
and {\epsilon} is some positive rational number, 0 <
{\epsilon} \leq 1, then the computing time to
approximate the roots of P to within is:[EQUATION]using
either set of algorithms.The empirical results of
applying the two sets of algorithms to random
polynomials and the first ten Legendre and Chebyshev
polynomials are reported. Neither set of algorithms
proved to be faster for all the polynomials tested.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "16",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jenks:1970:MLI,
author = "R. D. Jenks",
title = "{META\slash LISP}: an interactive translator writing
system",
journal = j-SIGSAM,
volume = "??",
number = "16",
pages = "10--18",
month = oct,
year = "1970",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1093415.1093417",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:13 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "META/LISP is a general purpose translator writing
system for IBM System/360 currently running on TSS,
CP/CMS, and OS/360. The input to the system is a source
program which simultaneously describes (1) the syntax
of some input data to be translated and (2) algorithms
which operate on the input data and a pushdown stack to
accomplish a desired translation; the output of the
system is a compiled program for translating that input
data. In particular when the input data are statements
of a higher-level language to be translated into
assembly language, META/LISP serves as a
compiler-compiler. META/LISP uses the top-down
syntax-directed approach which makes the system
extremely attractive for the design and implementation
of experimental languages; using META/LISP such
compilers are easy to write, easy to check out, and ---
most importantly --- easy to modify interactively. The
appendices which follow a rather complete description
of the system include a self-description of the
META/LISP compiler.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "16",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Friedman:1970:FIK,
author = "Joyce Friedman",
title = "{Fortran} implementation of the {Kay} context-free
parser",
journal = j-SIGSAM,
volume = "??",
number = "16",
pages = "19--45",
month = oct,
year = "1970",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1093415.1093418",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:13 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "A parsing program for context-free grammars based on
an algorithm due to Martin Kay has been combined with a
phrase-structure grammar preprocessor. The result is an
efficient context-free parsing package. Implementation
is in FORTRAN G under MTS.The paper contains first a
user's guide to the programs. Then the parsing strategy
as well as the functions of the major subroutines are
described.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "16",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Schnupp:1971:PFM,
author = "Peter Schnupp",
title = "Practical formula manipulation for theoretical
chemistry",
journal = j-SIGSAM,
volume = "??",
number = "17",
pages = "27--29",
month = jan,
year = "1971",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1093420.1093421",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:18 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "It is not always easy to give a paper on the
applications of certain computing techniques to a
highly specialized branch of science. On the other
hand, theoretical chemistry is already one of the
biggest 'customers' of numerical computing in science
and offers a wide potential of nonnumerical problems to
be solved as well. Being an independent software house
eager to gain practical experience in this rather new
field of computing, we were very glad that wie could
start on some real-world scientific problems rather
than implementing yet another formula manipulation
system of doubtful practical use. The purpose of this
paper is to present a rough overview of theoretical
chemistry and the kind of formula manipulation the
practical worker encounters in this field of science.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "17",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sandewall:1971:PSF,
author = "Erik Sandewall",
title = "A proposed solution to the {FUNARG} problem",
journal = j-SIGSAM,
volume = "??",
number = "17",
pages = "29--42",
month = jan,
year = "1971",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1093420.1093422",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:18 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This paper is a response to Joel Moses's recent paper,
'The Function of FUNCTION in LISP, or \ldots{}'. We
give some examples where the FUNARG feature of LISP 1.5
is relative useful, and suggest a computationally
efficient implementation of FUNARG. The idea in the
proposal is to let a FUNARG-expression create
indirect-addressing type bindings on the push-list for
variables.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "17",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bahr:1971:ASP,
author = "Knut Bahr",
title = "An algebraic simplification program in {PL/I}",
journal = j-SIGSAM,
volume = "??",
number = "17",
pages = "43--50",
month = jan,
year = "1971",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1093420.1093423",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:18 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "One of the objectives of the project reported on was
to explore the usability of PL/I for the purpose of
writing a symbolic formula manipulation program in a
higher level language. The first step along this line
is writing an algebraic simplification program.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "17",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gentleman:1971:OMC,
author = "W. Morven Gentleman",
title = "Optimal multiplication chains for computing a power of
a symbolic polynomial",
journal = j-SIGSAM,
volume = "??",
number = "18",
pages = "23--30",
month = apr,
year = "1971",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1093425.1093426",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:25 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This paper shows that in a certain model of symbolic
manipulation of algebraic formulae, the simple method
of computing a power of a symbolic polynomial by
repeated multiplication by the original polynomial is,
in essence, the optimal method.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "18",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Dimino:1971:GAC,
author = "Lucien A. Dimino",
title = "A graphical approach to coset enumeration",
journal = j-SIGSAM,
volume = "??",
number = "19",
pages = "8--43",
month = jul,
year = "1971",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1093428.1093429",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:27 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In 1936, J. A. Todd and H. S. M. Coxeter published a
paper [13] in which they described a technique for
enumerating the cosets of a finite group given only a
presentation for the group and the generators of the
sub-group written in terms of the generators of the
group. This process has an interesting interpretation
in terms of directed graphs which is described below.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "19",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Neidleman:1971:UEF,
author = "L. D. Neidleman",
title = "A user's examination of the formula manipulation
language --- {SYMBAL}",
journal = j-SIGSAM,
volume = "??",
number = "20",
pages = "8--24",
month = oct,
year = "1971",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1093431.1093432",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The highlights of the SYMBAL system and language are
reviewed in this paper. The main strengths and
weaknesses of SYMBAL are discussed. Three examples are
included to illustrate the language. Several
recommendations are made for improving the language.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "20",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cheatham:1972:LSA,
author = "T. E. {Cheatham, Jr.} and Ben Wegbreit",
title = "A laboratory for the study of automating programming",
journal = j-SIGSAM,
volume = "??",
number = "21",
pages = "8--26",
month = jan,
year = "1972",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086784.1086785",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In this paper we describe a facility which we
characterize as a laboratory for the study of
automating programming. The considerable body of work
which is related to programming automation is surveyed
briefly, and, following this, the basic components of
the laboratory and approach to be employed in utilizing
it are discussed.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "21",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Greenawalt:1972:OFL,
author = "E. M. Greenawalt",
title = "An overlay facility for {LISP} programs",
journal = j-SIGSAM,
volume = "??",
number = "21",
pages = "27--31",
month = jan,
year = "1972",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086784.1086786",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "An overlay facility is described which enables large
LISP programs such as are frequently encountered in
symbolic algebraic manipulation to be used in a memory
environment considerably smaller than required for the
entire program. This facility has been implemented in
the University of Texas LISP for CDC 6000 series
machines, and has been so far applied to Joel Moses'
integration package with good results.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "21",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Loos:1972:ATT,
author = "R{\"u}diger Loos",
title = "Analytic treatment of three similar {Fredholm}
integral equations of the second kind with {Reduce 2}",
journal = j-SIGSAM,
volume = "??",
number = "21",
pages = "32--40",
month = jan,
year = "1972",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086784.1086787",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This paper presents a solution to the following
problem proposed by W. Morven Gentleman [1]: For each
of the following three integral equations, find the
largest eigenvalue and the corresponding eigenfunction
f(x). Note that in equations (a) and (b) these are
functions of \alpha; in equation (a) we are actually
interested in the limit for large $ \alpha $, and in
equation (b) as \alpha approaches zero. In each case
$m$ is used as abbreviation for $ \max (x, y)$.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "21",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Campbell:1972:PF,
author = "J. A. Campbell",
title = "Problem \#2 --- the {Y$_{2n}$} functions",
journal = j-SIGSAM,
volume = "??",
number = "22",
pages = "8--9",
month = mar,
year = "1972",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086789.1086790",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:39 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Many branches of mathematical physics use equations of
the form[EQUATION]where \lambda is a small quantity,
and the primes denote differentiation with respect to
x. In the absence of a general solution, one tries to
write f(x) as an expansion in powers of \lambda. More
neatly, if[EQUATION]is tried, to fit the structure of
(1), then the work reduces to the derivation of a
series expansion for q(x). The solution is
[1][EQUATION]where N signifies the order of
approximation to which one wishes to go, and Y
2n represents the member of order \lambda$^{2n}$ of a
family of functions obtained by substitution of (3)
into (1) and \1. The problem is to compute Y2n for as
many values of n as possible.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "22",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{LaPlace:1972:PLP,
author = "Andr{\'e} M. L. LaPlace",
title = "{PL/I} list processing used as interactive system
support",
journal = j-SIGSAM,
volume = "??",
number = "22",
pages = "10--24",
month = mar,
year = "1972",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086789.1086791",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:39 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The various existing interactive systems use generally
the possibilities offered by a host language: REDUCE
(Hearn) based on LISP, SAC (Collins) based on FORTRAN,
FINSTER (KFA) based on PL/1-FORMAC, and by the system
under which they are working. [1, 2, 3]",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "22",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fateman:1972:RSN,
author = "Richard J. Fateman",
title = "Rationally simplifying non-rational expressions",
journal = j-SIGSAM,
volume = "??",
number = "23",
pages = "8--9",
month = jul,
year = "1972",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1093522.1093523",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:43 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Rational simplification programs can be generalized to
simplify larger classes of expressions. This paper
describes some of the additional capabilities of
MACSYMA's [6] rational simplification programs. In
section 2 we describe the results of a test of these
features.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "23",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hearn:1972:INM,
author = "Anthony C. Hearn",
title = "An Improved Non-Modular Polynomial {GCD} Algorithm",
journal = j-SIGSAM,
volume = "??",
number = "23",
pages = "10--15",
month = jul,
year = "1972",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1093522.1093524",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:43 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "An improved non-modular algorithm for the calculation
of the greatest common divisor of two multivariate
polynomials is presented.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "23",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Loos:1972:AAD,
author = "R{\"u}diger Loos",
title = "Algebraic algorithm descriptions as programs",
journal = j-SIGSAM,
volume = "??",
number = "23",
pages = "16--24",
month = jul,
year = "1972",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1093522.1093525",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:43 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We propose methods for writing algebraic programs in
an algebraic notation. We discuss the advantages of
this approach and a specific example.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "23",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Caviness:1972:SMC,
author = "B. F. Caviness and G. E. Collins",
title = "Symbolic mathematical computation in a {Ph.D. Computer
Science} program",
journal = j-SIGSAM,
volume = "??",
number = "23",
pages = "25--28",
month = jul,
year = "1972",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1093522.1093526",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:43 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Considering how many fools can calculate, it is
surprising that it should be thought either a difficult
or a tedious task for any other fool to learn how to
master the same tricks\ldots{}. Being myself a
remarkably stupid fellow,\ldots{} [I] now beg to
present to my fellow fools the parts that are not hard.
Master these thoroughly and the rest will follow. What
one fool can do, another can.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "23",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Brown:1972:A,
author = "W. S. Brown and A. D. Hall",
title = "{ALTRAN}",
journal = j-SIGSAM,
volume = "??",
number = "24",
pages = "4--7",
month = oct,
year = "1972",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086793.1086794",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:51 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib",
abstract = "J. A. Campbell [1] has proposed the computation of his
$ Y_{2n} $ polynomials as a challenging problem for
symbolic algebra systems. These polynomials are defined
by a recurrence formula involving summations over two
and four indices, and a special differentiation rule.
Since the number of terms in $ Y_{2n} $ grows almost
exponentially, large amounts of time and memory are
required for large values of $n$.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "24",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bourne:1972:C,
author = "S. R. Bourne",
title = "{CAMAL}",
journal = j-SIGSAM,
volume = "??",
number = "24",
pages = "8--11",
month = oct,
year = "1972",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086793.1086795",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:51 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Various methods for constructing a series solution of
the equation [EQUATION] are presented. The form of the
solution is similar to the JWKB approximation and is
discussed by Froman [1]. Each method has been
programmed for the CAMAL system and comparisons of
performance are made. The resource requirements are
compared with theoretical expectations.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "24",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fateman:1972:M,
author = "R. J. Fateman",
title = "{MACSYMA}",
journal = j-SIGSAM,
volume = "??",
number = "24",
pages = "12--13",
month = oct,
year = "1972",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086793.1086796",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:51 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Approach 1: The problem description, as given, was
programmed. The time for computing the firs few terms
(in seconds): input: 5.9, Y[2]: 2.2, Y[4]: 5.9, Y[6]:
13.6, Y[8]: 37.5, Y[10]: 90.5. These times are on a
standard MACSYMA system running on a PDP-10 with
2-microsecond core. This version used only about 50k
36-bit words of the 120k programs available through
MACSYMA. (Note that in the output, E(X+N) represents
epsilon[n])",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "24",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hearn:1972:R,
author = "A. C. Hearn",
title = "{REDUCE}",
journal = j-SIGSAM,
volume = "??",
number = "24",
pages = "14--15",
month = oct,
year = "1972",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086793.1086797",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:51 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We present here a REDUCE 2 [1] solution of the problem
proposed by Campbell [2] for the computation of a class
of functions useful in the phase-integral
approximation. The program follows closely the
published method \1. An alternative solution to the
problem is given elsewhere in this issue [4].",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "24",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jenks:1972:S,
author = "R. D. Jenks",
title = "{SCRATCHPAD}",
journal = j-SIGSAM,
volume = "??",
number = "24",
pages = "16--17",
month = oct,
year = "1972",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086793.1086798",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:51 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The following SCRATCHPAD solution of Problem \#2 was
run on a 1280K virtual machine under CP/CMS time
sharing system on a System/360 model 67. The
conversation below is a modification of a program
originally written by Yngve Sundblad, August 1972. The
program uses symmetrised formulae, saves certain
intermediate results, but does not eliminate numerical
factors in denominators.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "24",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sundblad:1972:S,
author = "Y. Sundblad",
title = "{SYMBAL}",
journal = j-SIGSAM,
volume = "??",
number = "24",
pages = "18--19",
month = oct,
year = "1972",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086793.1086799",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:51 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The program has been written in SYMBAL for the CDC
6600 computer in V{\"a}stberga, Stockholm. This is a
standard configuration with a 6613 central processor,
ten peripheral processors and a 131072 60-bit word core
memory with 0.1 ps access time. About 3 machine
instructions / $ \mu $ s can be performed. SYMBAL
version 1. OK (3/3/70).",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "24",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jeffreys:1972:T,
author = "W. H. Jeffreys",
title = "{TRIGMAN}",
journal = j-SIGSAM,
volume = "??",
number = "24",
pages = "20--21",
month = oct,
year = "1972",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086793.1086800",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:51 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The TRIGMAN system, manipulates Poisson Series
(trigonometric series with polynomial coefficients). It
consists of a set of FORTRAN preprocessor written in
SNOBOL and a set of FORTRAN subroutine for elementary
symbolic operations. The TRIGMAN source language
resembles FORTRAN but with additional declarations.
Programs are translated into legal FORTRAN then
compiled.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "24",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Horowitz:1972:S,
author = "E. Horowitz",
title = "{SAC}-1",
journal = j-SIGSAM,
volume = "??",
number = "24",
pages = "22--24",
month = oct,
year = "1972",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086793.1086801",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:14:51 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The SAC-1 program was compiled with the IBM FORTRAN-G
Compiler on the IBM 360/65, running under OS-MVT. The
amount of core used was 110K words. (Not all this space
was used for $ n = 1, \ldots {}, 11 $, since available
space was exhausted while computing $ n = 12 $.)",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "24",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hearn:1972:RSP,
author = "Anthony C. Hearn",
title = "A {REDUCE} Solution of Problem \#2 --- The {$ Y_{2n}
$} Functions",
journal = j-SIGSAM,
volume = "14",
number = "??",
pages = "14--??",
month = "????",
year = "1972",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "A {REDUCE} solution to {SIGSAM} Problem \#2 is
described.",
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Barton:1972:CPF,
author = "David Barton and Anthony C. Hearn",
title = "Comment on Problem \#2 --- The {$ Y_{2n} $}
Functions",
journal = j-SIGSAM,
volume = "15",
number = "??",
pages = "??--??",
month = "????",
year = "1972",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "A compact program for the solution of {SIGSAM} Problem
\#2 is presented.",
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
xxnote = "Cannot find in volume 15.",
}
@Article{Fateman:1973:RE,
author = "R. J. Fateman",
title = "Reply to an editorial",
journal = j-SIGSAM,
volume = "??",
number = "25",
pages = "9--11",
month = mar,
year = "1973",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086803.1086804",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:15:08 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The comparison of algebraic manipulation systems is a
difficult task. Nevertheless, I think that some of the
conclusions stated in 'Solutions of Problem \# 2' in
the last SIGSAM Bulletin are not entirely valid. I
would like to voice some specific objections,
especially as they concern LISP and MACSYNA.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "25",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Barton:1973:PLT,
author = "David Barton",
title = "Problem \#4: the {Lie} transform",
journal = j-SIGSAM,
volume = "??",
number = "25",
pages = "12--13",
month = mar,
year = "1973",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086803.1086805",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:15:08 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The problem proposed here is that of performing a Lie
transformation. The Lie transform as described by
Deprit (1969) is a means of solving certain sets of
ordinary differential equations by repeated
approximation and he has applied the technique to the
problems of predicting the motion of the Moon and also
of artificial satellites. Deprit's work contains a
remarkable application of symbolic techniques to real
problems and it is for this reason that the Lie
transform is an interesting calculation.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "25",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Campbell:1973:PPD,
author = "J. A. Campbell",
title = "Problem \#5: a problem in differentiation arising from
the {Runge--Kutta--Nystr{\"o}m} method",
journal = j-SIGSAM,
volume = "??",
number = "25",
pages = "13--14",
month = mar,
year = "1973",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086803.1086806",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:15:08 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "I wish to express a few informal doubts about the
effectiveness of a problem which I have previously
proposed [1] here as a benchmark exercise for symbolic
computing systems. In brief, that problem concerned the
generation of functions Y
2n to provide successive approximations to the
solutions[EQUATION]of the
equation[EQUATION]where[EQUATION]I suggested the use of
a recurrence in Y2n obtained by direct substitution of
(1) and (3) into \1. This recurrence contained
rational-number coefficients, and one term was
quadrilinear in the Y functions. However, Yngve
Sundblad (KTH, Stockholm) has demonstrated to me that
execution times in this computation can be reduced
greatly (in SYMBAL on a CDC 6600) merely if the
recurrence is rewritten to remove the numerical
denominators, while there is at least one method of
finding a recurrence for Y2n, known to the Uppsala
group which has made the most extensive studies [2] of
(2), that contains only bilinear terms. No doubt that
method must require much less time (and space!) to
compute. Thus we should agree on a common algorithm
before we can compare benchmark runs directly.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "25",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bahr:1973:IBF,
author = "Knut Bahr",
title = "An interesting bug in {FORMAC}",
journal = j-SIGSAM,
volume = "??",
number = "25",
pages = "23--24",
month = mar,
year = "1973",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086803.1086807",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:15:08 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The zoology of bugs allows us to classify the species
of programming bugs into two subspecies: those that are
unwholesome to a program's results; and those that lead
a peaceful symbiosis, not affecting the results but
living on time and space. We are going to describe one
of the latter kind.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "25",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fitch:1973:ICD,
author = "John Fitch and Arthur Norman",
title = "An idea for comparing data structures",
journal = j-SIGSAM,
volume = "??",
number = "27",
pages = "17--18",
month = sep,
year = "1973",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086809.1086810",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:15:15 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This short note describes an idea we had one coffee
time, after reading Richard Fateman's thesis. In that
document a number of comparative figures are given for
various algebra systems calculating the $f$ and $g$
series, to order 10. Next to the entry for CAMAL, which
incidentally has the time wrong by a factor of five, he
has a note to the effect that CAMAL has a packed
representation of polynomials, resulting in a low
number of pointers.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "27",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Yun:1973:ASS,
author = "David Y. Y. Yun",
title = "On algorithms for solving systems of polynomial
equations",
journal = j-SIGSAM,
volume = "??",
number = "27",
pages = "19--25",
month = sep,
year = "1973",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086809.1086811",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:15:15 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Methods for finding numerical solutions of nonlinear
algebraic systems of equations have been given
considerable attention since the birth of the field of
numerical analysis. The fact that these methods find
many applications to problems in physics, engineering,
economics, and mathematical theory of optimization
cannot be overstressed. However, a significant number
of these problems contain indeterminates or parameters,
which should only be given numerical values at the very
end of the computational processes. Sometimes numerical
results simply cannot provide enough insight for the
analysis of the problem. Furthermore, symbolic
solutions via elimination theory provide not only all
solutions to a given system of equations but also a
classification of solutions into solution surfaces or
parametrized solutions. Thus, the symbolic method can
provide an infinite number of solutions where this feat
is clearly impossible for the numerical methods.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "27",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bahr:1973:SF,
author = "Knut A. Bahr",
title = "A speed-up of {FORMAC}",
journal = j-SIGSAM,
volume = "??",
number = "27",
pages = "26--29",
month = sep,
year = "1973",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086809.1086812",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:15:15 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The following note reports on a speed-up that is due
to a modification in the central part of FORMAC. Since
this part is always and heavily used, the overall speed
of the system has been increased, typically by a factor
of 2, sometimes more, depending on the particular
problem. Sigsam problem \#2 is used as an example. This
report does not make reference to or rely on a
previously reported special-case speed-up [5].",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "27",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fitch:1973:PRM,
author = "John Fitch",
title = "Problems \#3 and \#4 in {REDUCE} and {MACSYMA}",
journal = j-SIGSAM,
volume = "??",
number = "28",
pages = "10--11",
month = dec,
year = "1973",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086814.1086815",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:15:20 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The algebra systems REDUCE and MACSYMA are used to
solve SIGSAM Problem \#3, the Reversion of a Double
Series, and SIGSAM Problem \#4, the Lie Transform
Solution of the Harmonic Oscillator. All the algorithms
used have been previously published, so the times may
be used to compare both systems and algorithms
independently.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "28",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{McCarthy:1973:PKP,
author = "D. P. McCarthy",
title = "Problem \#6 --- the {Kiang} problem",
journal = j-SIGSAM,
volume = "??",
number = "28",
pages = "12--12",
month = dec,
year = "1973",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086814.1086816",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:15:20 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Dr. T. Kiang of the Dublin Institute for Advanced
Studies originated the following problem in partial
fractions from some astronomical investigations.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "28",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Tuttens:1973:SPS,
author = "W. Tuttens",
title = "Solution to problem \#2: with ``a subroutine package
for polynomial manipulation'' ({Polman})",
journal = j-SIGSAM,
volume = "??",
number = "28",
pages = "13--13",
month = dec,
year = "1973",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086814.1086817",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:15:20 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "J. A. Campbell [1] has proposed the computation of his
$ Y_{2n} $ polynomials as a benchmark problem for
algebraic manipulation systems. Eight solutions to
problem \#2 (SIGSAM Bulletin No. 22, March 1972) have
been provided in SIGSAM Bulletin No. 24, October 1972.
Here is a summary of a POLMAN [2,3] program which
solves this problem. Using the POLMAN system installed
on an IBM 370/155 at K.U.L., Computing Centre, these
polynomials were computed through n = 8 in 16 sec.,
through n = 10 in 45 sec., through n = 12 in 2 min., 51
sec. The memory requirements for the POLMAN system
together with the program (24,5 K bytes) and a
workspace of approximately 34,5 K bytes occupied a
total of 190 K bytes for the case of n = 10. The
workspace has an overflow to a secondary store (disk)
[2,3].",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "28",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sundblad:1973:OUO,
author = "Yngve Sundblad",
title = "One user's one-algorithm comparison of six algebraic
systems on the {Y$_{2n}$}-problem",
journal = j-SIGSAM,
volume = "??",
number = "28",
pages = "14--20",
month = dec,
year = "1973",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086814.1086818",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:15:20 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In last October's issue (no. 24) of the SIGSAM
Bulletin several reports of performance of different
algebraic systems on SIGSAM Problem no. 2, described in
[1], were published. The timings are somewhat
incompatible for the following reasons.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "28",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wang:1973:FMP,
author = "Paul S. Wang and L. Preiss Rothschild",
title = "Factoring multivariate polynomials over the integers",
journal = j-SIGSAM,
volume = "??",
number = "28",
pages = "21--29",
month = dec,
year = "1973",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086814.1086819",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:15:20 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This paper gives an algorithm for finding the
irreducible factors of any multivariate polynomial with
integer coefficients. The algorithm begins by making
substitutions for all but one of the variable. This
univariate polynomial is then factored by a known
method, which uses an algorithm of Berlekamp for
factoring univariate polynomials over finite fields.
After this factorization is done, the multivariate
factors are recovered from the univariate ones by a
kind of Hensel algorithm. A number of ideas are given
which greatly speed the computation in some special
cases.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "28",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fateman:1973:CHI,
author = "Richard J. Fateman",
title = "A case history in interactive problem-solving",
journal = j-SIGSAM,
volume = "??",
number = "28",
pages = "30--32",
month = dec,
year = "1973",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086814.1086820",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:15:20 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "MACSYMA [1], a computer program for algebraic
manipulation, is used to solve, symbolically and
exactly, a problem involving integration and the
solution of an infinite set of linear equations. This
is a tutorial in the use of MACSYMA, and illustrates
some of the choices available to the interactive user
which aid in solving a mathematical problem.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "28",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{vandeRiet:1973:ASP,
author = "R. P. van de Riet",
title = "The automatic solution of partial differential
equations by means of {Taylor} series using
formula-manipulation methods",
journal = j-SIGSAM,
volume = "??",
number = "28",
pages = "33--36",
month = dec,
year = "1973",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086814.1086821",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jun 17 19:15:20 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Some five years ago the author published a study on
formula manipulation in ALGOL 60 [1,2] containing,
among others, a 160 paged chapter on the problem of
obtaining automatically solutions of partial
differential equations. The publication was in the form
of two Mathematical Centre Tracts, which does not seem
to have become widely distributed. This turned out
somewhat embarrassingly a few months ago when the
author invited a reputed formula manipulator for giving
a lecture on the subject of this note. The speaker was
not aware that a substantial part of his lecture,
covering recent results, was contained in the authors
tract [2].",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "28",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Starkey:1974:SKP,
author = "J. Denbigh Starkey",
title = "A solution to {Kiang}'s problem \#6",
journal = j-SIGSAM,
volume = "8",
number = "1",
pages = "2--3",
month = feb,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Johnson:1974:P,
author = "S. C. Johnson and R. L. Graham",
title = "Problem \#7",
journal = j-SIGSAM,
volume = "8",
number = "1",
pages = "4--4",
month = feb,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{vanHulzen:1974:FTW,
author = "J. A. van Hulzen",
title = "{FORMAC} today, or what can happen to an orphan",
journal = j-SIGSAM,
volume = "8",
number = "1",
pages = "5--7",
month = feb,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Barton:1974:AMC,
author = "D. Barton and J. P. Fitch",
title = "Algebraic manipulation in {Cambridge}",
journal = j-SIGSAM,
volume = "8",
number = "1",
pages = "8--9",
month = feb,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bahr:1974:TRF,
author = "Knut A. Bahr",
title = "Toward a revision of {FORMAC}",
journal = j-SIGSAM,
volume = "8",
number = "1",
pages = "10--16",
month = feb,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hall:1974:APS,
author = "A. D. Hall and S. C. Johnson",
title = "{ALTRAN} programs for {SIGSAM} problem \#6",
journal = j-SIGSAM,
volume = "8",
number = "2",
pages = "12--36",
month = may,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fateman:1974:SPU,
author = "R. Fateman and J. Moses and P. Wang",
title = "Solution to problem \#7 using {MACSYMA}",
journal = j-SIGSAM,
volume = "8",
number = "2",
pages = "14--16",
month = may,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Collins:1974:SSP,
author = "G. E. Collins and D. R. Musser and M. Rothstein",
title = "{SAC-1} solution of problem \#7",
journal = j-SIGSAM,
volume = "8",
number = "2",
pages = "17--19",
month = may,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jenks:1974:SL,
author = "R. D. Jenks",
title = "The {SCRATCHPAD} language",
journal = j-SIGSAM,
volume = "8",
number = "2",
pages = "20--30",
month = may,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Smit:1974:IN,
author = "Jaap Smit",
title = "Introduction to {NETFORM}",
journal = j-SIGSAM,
volume = "8",
number = "2",
pages = "31--36",
month = may,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sundblad:1974:SMS,
author = "Yngve Sundblad",
title = "Symbolic mathematical systems now and in the future",
journal = j-SIGSAM,
volume = "8",
number = "3",
pages = "1--8",
month = aug,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Loos:1974:TFI,
author = "Ruediger G. K. Loos",
title = "Toward a formal implementation of computer algebra",
journal = j-SIGSAM,
volume = "8",
number = "3",
pages = "9--16",
month = aug,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bahr:1974:TAM,
author = "Knut Bahr and Jaap Smit",
title = "Tuning an algebraic manipulation system through
measurements",
journal = j-SIGSAM,
volume = "8",
number = "3",
pages = "17--23",
month = aug,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Husberg:1974:APF,
author = "Nisse Husberg and Jouko Sepp{\"a}nen",
title = "{ANALITIK}: principal features of the language and its
implementation",
journal = j-SIGSAM,
volume = "8",
number = "3",
pages = "24--25",
month = aug,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Brown:1974:CFR,
author = "W. S. Brown",
title = "On computing with factored rational expressions",
journal = j-SIGSAM,
volume = "8",
number = "3",
pages = "26--34",
month = aug,
year = "1974",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1086837.1086842",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hall:1974:FRE,
author = "Andrew D. {Hall, Jr.}",
title = "Factored rational expressions in {ALTRAN}",
journal = j-SIGSAM,
volume = "8",
number = "3",
pages = "35--45",
month = aug,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Miola:1974:CAH,
author = "Alfonso Miola and David Y. Y. Yun",
title = "Computational aspects of {Hensel}-type univariate
polynomial greatest common divisor algorithms",
journal = j-SIGSAM,
volume = "8",
number = "3",
pages = "46--54",
month = aug,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Strubbe:1974:PSS,
author = "H. Strubbe",
title = "Presentation of the {SCHOONSCHIP} system",
journal = j-SIGSAM,
volume = "8",
number = "3",
pages = "55--60",
month = aug,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gentleman:1974:ETP,
author = "W. Morven Gentleman",
title = "Experience with truncated power series",
journal = j-SIGSAM,
volume = "8",
number = "3",
pages = "61--62",
month = aug,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Johnson:1974:SPA,
author = "Stephen C. Johnson",
title = "Sparse polynomial arithmetic",
journal = j-SIGSAM,
volume = "8",
number = "3",
pages = "63--71",
month = aug,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Klip:1974:DPR,
author = "Dorothea A. Klip",
title = "Different polynomial representations and their
interaction in the portable algebra system {PORT-ALG}",
journal = j-SIGSAM,
volume = "8",
number = "3",
pages = "72--73",
month = aug,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Calmet:1974:CRD,
author = "Jacques Calmet",
title = "Computer Recognition of Divergences in {Feynman}
Diagrams",
journal = j-SIGSAM,
volume = "8",
number = "3",
pages = "74--75",
month = aug,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "A description of a program for the recognition of
divergences in {Feynman} graphs is given.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Frick:1974:NNC,
author = "I. Frick",
title = "A non-numerical computation involving sums of many
products of finite rotation matrices for spin $ 3 / 2
$",
journal = j-SIGSAM,
volume = "8",
number = "3",
pages = "76--77",
month = aug,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cohen:1974:PCG,
author = "H. Ian Cohen",
title = "A perturbation calculation in general relativity",
journal = j-SIGSAM,
volume = "8",
number = "3",
pages = "78--79",
month = aug,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Collins:1974:QER,
author = "George E. Collins",
title = "Quantifier elimination for real closed fields by
cylindrical algebraic decomposition--preliminary
report",
journal = j-SIGSAM,
volume = "8",
number = "3",
pages = "80--90",
month = aug,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Weeks:1974:FRA,
author = "Dennis Weeks",
title = "Formal representations for algebraic numbers",
journal = j-SIGSAM,
volume = "8",
number = "3",
pages = "91--95",
month = aug,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Verbaeten:1974:ACP,
author = "P. Verbaeten",
title = "The automatic construction of pure recurrence
relations",
journal = j-SIGSAM,
volume = "8",
number = "3",
pages = "96--98",
month = aug,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ng:1974:SIC,
author = "Edward W. Ng",
title = "Symbolic integration of a class of algebraic
functions",
journal = j-SIGSAM,
volume = "8",
number = "3",
pages = "99--102",
month = aug,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Miola:1974:USC,
author = "Alfonso Miola",
title = "The use of symbolic computation in solving free
boundary problems by the {Ritz--Galerkin} method",
journal = j-SIGSAM,
volume = "8",
number = "3",
pages = "103--104",
month = aug,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Moses:1974:MFY,
author = "Joel Moses",
title = "{MACSYMA} --- the fifth year",
journal = j-SIGSAM,
volume = "8",
number = "3",
pages = "105--110",
month = aug,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fitch:1974:PRW,
author = "John Fitch",
title = "Problem \#8: random walk",
journal = j-SIGSAM,
volume = "8",
number = "4",
pages = "11--11",
month = nov,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Griesmer:1974:SPL,
author = "James H. Griesmer and Richard D. Jenks",
title = "A solution to problem \#4: the lie transform",
journal = j-SIGSAM,
volume = "8",
number = "4",
pages = "12--13",
month = nov,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fitch:1974:SPU,
author = "John Fitch",
title = "A solution of problem \#3 using {CAMAL}",
journal = j-SIGSAM,
volume = "8",
number = "4",
pages = "14--25",
month = nov,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fitch:1974:SMT,
author = "John Fitch",
title = "A simple method of taking $n$ th roots of integers",
journal = j-SIGSAM,
volume = "8",
number = "4",
pages = "26--26",
month = nov,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Yun:1974:ADR,
author = "David Y. Y. Yun",
title = "A $p$-adic division with remainder algorithm",
journal = j-SIGSAM,
volume = "8",
number = "4",
pages = "27--32",
month = nov,
year = "1974",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Norman:1975:SP,
author = "A. C. Norman",
title = "Solutions to problem 8",
journal = j-SIGSAM,
volume = "9",
number = "1",
pages = "7--9",
month = feb,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Zippel:1975:MSP,
author = "Richard Zippel",
title = "A {MACSYMA} solution to problem 8",
journal = j-SIGSAM,
volume = "9",
number = "1",
pages = "10--12",
month = feb,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Norman:1975:SPS,
author = "Arthur C. Norman",
title = "The {SCRATCHPAD} power series package",
journal = j-SIGSAM,
volume = "9",
number = "1",
pages = "13--20",
month = feb,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bahr:1975:UFN,
author = "Knut Bahr",
title = "Utilizing the {FORMAC} novelties",
journal = j-SIGSAM,
volume = "9",
number = "1",
pages = "21--24",
month = feb,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bahr:1975:SP,
author = "Knut Bahr",
title = "Solution to problem 8",
journal = j-SIGSAM,
volume = "9",
number = "2",
pages = "6--6",
month = may,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fitch:1975:DSL,
author = "John Fitch and Arthur Norman",
title = "Double by single length division",
journal = j-SIGSAM,
volume = "9",
number = "2",
pages = "7--7",
month = may,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Verbaeten:1975:CRZ,
author = "P. Verbaeten",
title = "Computing real zeros of polynomials with {SAC-1}",
journal = j-SIGSAM,
volume = "9",
number = "2",
pages = "8--10",
month = may,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Campbell:1975:APL,
author = "J. A. Campbell",
title = "Automatic programming in {LISP}",
journal = j-SIGSAM,
volume = "9",
number = "2",
pages = "11--13",
month = may,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{vanHulzen:1975:SPD,
author = "J. A. van Hulzen",
title = "Special purpose differentiation algorithms",
journal = j-SIGSAM,
volume = "9",
number = "2",
pages = "14--18",
month = may,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Feldman:1975:ASC,
author = "Stuart I. Feldman",
title = "An application of symbolic computation to crystal
physics",
journal = j-SIGSAM,
volume = "9",
number = "2",
pages = "19--24",
month = may,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fitch:1975:CN,
author = "John Fitch",
title = "Course notes",
journal = j-SIGSAM,
volume = "9",
number = "3",
pages = "4--8",
month = aug,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jenks:1975:COY,
author = "Richard D. Jenks",
title = "Course outline: {Yale University}, {New Haven}",
journal = j-SIGSAM,
volume = "9",
number = "3",
pages = "9--10",
month = aug,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kahan:1975:PEP,
author = "W. Kahan",
title = "Problem \#9: an ellipse problem",
journal = j-SIGSAM,
volume = "9",
number = "3",
pages = "11--12",
month = aug,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Loos:1975:PCP,
author = "Rudiger Loos",
title = "Problem \#10: the cattle problem of {Archimedes}",
journal = j-SIGSAM,
volume = "9",
number = "3",
pages = "11--12",
month = aug,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Griesmer:1975:SSP,
author = "J. H. Griesmer and R. D. Jenks and D. Y. Y. Yun",
title = "A {SCRATCHPAD} solution to problem \#7",
journal = j-SIGSAM,
volume = "9",
number = "3",
pages = "13--17",
month = aug,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Caviness:1975:MCR,
author = "B. F. Caviness",
title = "More on computing roots of integers",
journal = j-SIGSAM,
volume = "9",
number = "3",
pages = "18--20",
month = aug,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wang:1975:FMP,
author = "Paul S. Wang",
title = "Factoring multivariate polynomials over algebraic
number fields in {MACSYMA}",
journal = j-SIGSAM,
volume = "9",
number = "3",
pages = "21--23",
month = aug,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Griesmer:1975:FSS,
author = "J. H. Griesmer and R. D. Jenks and David Y. Y. Yun",
title = "A {FORMAT} statement in {SCRATCHPAD}",
journal = j-SIGSAM,
volume = "9",
number = "3",
pages = "24--25",
month = aug,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Schwartz:1975:WPS,
author = "J. T. Schwartz",
title = "What programmers should know",
journal = j-SIGSAM,
volume = "9",
number = "3",
pages = "26--27",
month = aug,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Johnson:1975:NAP,
author = "S. C. Johnson",
title = "A note on abnormal polynomial remainder sequences",
journal = j-SIGSAM,
volume = "9",
number = "3",
pages = "28--29",
month = aug,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hiemstra:1975:PEC,
author = "Bauke Hiemstra",
title = "A pre-editor for {CAMAL}",
journal = j-SIGSAM,
volume = "9",
number = "3",
pages = "30--34",
month = aug,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Jul 04 08:11:58 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Knuth:1975:SSA,
author = "Donald E. Knuth",
title = "Son of Seminumerical Algorithms",
journal = j-SIGSAM,
volume = "9",
number = "4",
pages = "10--11",
month = nov,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Heintz:1975:EQE,
author = "J. Heintz and R. W{\"u}thrich",
title = "An efficient quantifier elimination algorithm for
algebraically closed fields of any characteristic",
journal = j-SIGSAM,
volume = "9",
number = "4",
pages = "11--11",
month = nov,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Feldman:1975:BDA,
author = "Stuart I. Feldman",
title = "A brief description of {Altran}",
journal = j-SIGSAM,
volume = "9",
number = "4",
pages = "12--20",
month = nov,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Engeli:1975:ESS,
author = "Max Engeli",
title = "An enhanced {SYMBAL} system",
journal = j-SIGSAM,
volume = "9",
number = "4",
pages = "21--29",
month = nov,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Rochon:1975:SSP,
author = "M. Rochon and H. Strubbe",
title = "Solution to {SIGSAM} problem no. 5 using
{SCHOONSCHIP}",
journal = j-SIGSAM,
volume = "9",
number = "4",
pages = "30--38",
month = nov,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hall:1975:ASP,
author = "A. D. Hall",
title = "{ALTRAN} solution to problem \#8",
journal = j-SIGSAM,
volume = "9",
number = "4",
pages = "39--40",
month = nov,
year = "1975",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Griesmer:1976:SMC,
author = "James H. Griesmer",
title = "Symbolic mathematical computation --- a survey",
journal = j-SIGSAM,
volume = "10",
number = "2",
pages = "30--32",
month = "????",
year = "1976",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
MRclass = "68A15",
bibdate = "Thu Dec 14 17:56:11 1995",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
reviewer = "Herbert J. Bernstein",
}
@Article{Fateman:1976:FPS,
author = "Richard J. Fateman",
title = "Final problem set excerpts",
journal = j-SIGSAM,
volume = "10",
number = "3",
pages = "14--14",
month = aug,
year = "1976",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wang:1976:ISC,
author = "Paul S. Wang",
title = "Implications of symbolic computation for the teaching
of mathematics",
journal = j-SIGSAM,
volume = "10",
number = "3",
pages = "15--18",
month = aug,
year = "1976",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Buchberger:1976:TBR,
author = "B. Buchberger",
title = "A theoretical basis for the reduction of polynomials
to canonical forms",
journal = j-SIGSAM,
volume = "10",
number = "3",
pages = "19--29",
month = aug,
year = "1976",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
MRclass = "12-04 (68A10)",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
reviewer = "J.-C. Herz",
}
@Article{Korpela:1976:GCA,
author = "Jukka Korpela",
title = "General characteristics of the {ANALITIK} language",
journal = j-SIGSAM,
volume = "10",
number = "3",
pages = "30--48",
month = aug,
year = "1976",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Loos:1976:GTC,
author = "R{\"u}diger Loos and J. Neub{\"u}ser",
title = "Group theoretical computations in mathematical
crystallography",
journal = j-SIGSAM,
volume = "10",
number = "4",
pages = "11--18",
month = nov,
year = "1976",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Buchberger:1976:SPG,
author = "B. Buchberger",
title = "Some properties of {Gr{\"o}bner-bases} for polynomial
ideals",
journal = j-SIGSAM,
volume = "10",
number = "4",
pages = "19--24",
month = nov,
year = "1976",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Rothstein:1976:STE,
author = "Michael Rothstein and B. F. Caviness",
title = "A structure theorem for exponential and primitive
functions a preliminary report",
journal = j-SIGSAM,
volume = "10",
number = "4",
pages = "25--28",
month = nov,
year = "1976",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kanoui:1976:SAS,
author = "Henry Kanoui",
title = "Some aspects of symbolic integration via predicate
logic programming",
journal = j-SIGSAM,
volume = "10",
number = "4",
pages = "29--42",
month = nov,
year = "1976",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wang:1976:FLM,
author = "Paul S. Wang",
title = "Factoring larger multivariate polynomials",
journal = j-SIGSAM,
volume = "10",
number = "4",
pages = "42--42",
month = nov,
year = "1976",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Zimmer:1976:FPA,
author = "Horst G. Zimmer",
title = "Factorization of polynomials according to a method of
{Zassenhaus}'",
journal = j-SIGSAM,
volume = "10",
number = "4",
pages = "43--45",
month = nov,
year = "1976",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Campbell:1976:CSC,
author = "J. A. Campbell",
title = "Compact storage for computations involving
partitions",
journal = j-SIGSAM,
volume = "10",
number = "4",
pages = "46--47",
month = nov,
year = "1976",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Stoutemyer:1976:ASA,
author = "David R. Stoutemyer",
title = "Automatic simplification for the absolute-value
function and its relatives",
journal = j-SIGSAM,
volume = "10",
number = "4",
pages = "48--49",
month = nov,
year = "1976",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cioni:1976:UMA,
author = "Gianna Cioni and Alfonso Miola",
title = "Using minicomputers for algebraic computations",
journal = j-SIGSAM,
volume = "10",
number = "4",
pages = "50--52",
month = nov,
year = "1976",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Loos:1977:A,
author = "R{\"u}diger Loos",
title = "Abstracts",
journal = j-SIGSAM,
volume = "11",
number = "1",
pages = "3--7",
month = feb,
year = "1977",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Loos:1977:ASA,
author = "R{\"u}diger Loos",
title = "Author's solution of {Archimedes}' cattle problem",
journal = j-SIGSAM,
volume = "11",
number = "1",
pages = "4--7",
month = feb,
year = "1977",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Manders:1977:ICT,
author = "Kenneth L. Manders",
title = "The impact of complexity theory on algorithms for
sparse polynomials",
journal = j-SIGSAM,
volume = "11",
number = "1",
pages = "8--15",
month = feb,
year = "1977",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jenks:1977:DMB,
author = "Richard D. Jenks",
title = "On the design of a mode-based symbolic system",
journal = j-SIGSAM,
volume = "11",
number = "1",
pages = "16--19",
month = feb,
year = "1977",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Shtokhamer:1977:ALS,
author = "R. Shtokhamer",
title = "Attempts in local simplification of non nested
radicals",
journal = j-SIGSAM,
volume = "11",
number = "1",
pages = "20--40",
month = feb,
year = "1977",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Rump:1977:RRI,
author = "Siegfried M. Rump",
title = "Real root isolation for algebraic polynomials",
journal = j-SIGSAM,
volume = "11",
number = "2",
pages = "2--3",
month = may,
year = "1977",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wang:1977:ESD,
author = "Paul S. Wang",
title = "An efficient squarefree decomposition algorithm",
journal = j-SIGSAM,
volume = "11",
number = "2",
pages = "4--6",
month = may,
year = "1977",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Loos:1977:MUC,
author = "R{\"u}diger Loos",
title = "1977 {MACSYMA} users' conference",
journal = j-SIGSAM,
volume = "11",
number = "2",
pages = "7--13",
month = may,
year = "1977",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lauer:1977:SKP,
author = "Markus Lauer",
title = "A solution to {Kahan}'s problem ({SIGSAM} problem No.
9)",
journal = j-SIGSAM,
volume = "11",
number = "2",
pages = "16--20",
month = may,
year = "1977",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hagen:1977:SP,
author = "G. Tim Hagen",
title = "A simple problem",
journal = j-SIGSAM,
volume = "11",
number = "2",
pages = "20--21",
month = may,
year = "1977",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gawlik:1977:FDM,
author = "H. J. Gawlik",
title = "The further development of {MIRA}",
journal = j-SIGSAM,
volume = "11",
number = "2",
pages = "22--28",
month = may,
year = "1977",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Caviness:1977:NCA,
author = "B. F. Caviness and H. I. Epstein",
title = "A note on the complexity of algebraic
differentiation",
journal = j-SIGSAM,
volume = "11",
number = "3",
pages = "4--6",
month = aug,
year = "1977",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Korpela:1977:SPC,
author = "Jukka Korpela",
title = "Some problems connected with ambiguous expressions",
journal = j-SIGSAM,
volume = "11",
number = "3",
pages = "7--9",
month = aug,
year = "1977",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Loos:1977:AA,
author = "R{\"u}diger Loos",
title = "{ABSTRACTS} ({Amsterdam 78})",
journal = j-SIGSAM,
volume = "11--12",
number = "4--1",
pages = "3--6",
month = nov # " and " # feb,
year = "1977",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
remark = "Issue labeled vol. 11, no. 4, November 1977 (issue
\#44) and vol. 12, no. 1, February 1978 (issue \#45).",
}
@Article{Bahr:1977:NRF,
author = "K. A. Bahr",
title = "New Release of {FORMAC 73} Available",
journal = j-SIGSAM,
volume = "11--12",
number = "4--1",
pages = "6--6",
month = nov # " and " # feb,
year = "1977",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Dec 23 10:41:23 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Issue labeled vol. 11, no. 4, November 1977 (issue
\#44) and vol. 12, no. 1, February 1978 (issue \#45).",
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "44/45",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Harrington:1977:RSP,
author = "S. J. Harrington",
title = "{REDUCE} Solution to Problem \#8",
journal = j-SIGSAM,
volume = "11--12",
number = "4--1",
pages = "7--8",
month = nov # " and " # feb,
year = "1977",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "44/45",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
remark = "Issue labeled vol. 11, no. 4, November 1977 (issue
\#44) and vol. 12, no. 1, February 1978 (issue \#45).",
}
@Article{Mignotte:1977:HFA,
author = "Maurice Mignotte",
title = "How to find algebraic integers whose conjugates lie
near the unit circle?",
journal = j-SIGSAM,
volume = "11--12",
number = "4--1",
pages = "9--10",
month = nov # " and " # feb,
year = "1977",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "44/45",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
remark = "Issue labeled vol. 11, no. 4, November 1977 (issue
\#44) and vol. 12, no. 1, February 1978 (issue \#45).",
}
@Article{deQueiroz:1977:UFM,
author = "F. Teixeira de Queiroz",
title = "The use of formula manipulation systems to compute
asymptotic expansions",
journal = j-SIGSAM,
volume = "11--12",
number = "4--1",
pages = "11--15",
month = nov # " and " # feb,
year = "1977",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
remark = "Issue labeled vol. 11, no. 4, November 1977 (issue
\#44) and vol. 12, no. 1, February 1978 (issue \#45).",
}
@Article{deQueroz:1977:UFM,
author = "F. T. de Queroz",
title = "The Use of Formula Manipulation Systems to Compute
Asymptotic Expansions",
journal = j-SIGSAM,
volume = "11--12",
number = "4--1",
pages = "11--16",
month = nov # " and " # feb,
year = "1977",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Dec 23 10:41:23 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "44/45",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
remark = "Issue labeled vol. 11, no. 4, November 1977 (issue
\#44) and vol. 12, no. 1, February 1978 (issue \#45).",
}
@Article{Hall:1977:MDC,
author = "David L. Hall and B. Craig Meyers",
title = "A Method for Determining the Coefficients of a
Reversed Power Series",
journal = j-SIGSAM,
volume = "11--12",
number = "4--1",
pages = "16--19",
month = nov # " and " # feb,
year = "1977",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "44/45",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
remark = "Issue labeled vol. 11, no. 4, November 1977 (issue
\#44) and vol. 12, no. 1, February 1978 (issue \#45).",
}
@Article{Shtokhamer:1977:ULS,
author = "R. Shtokhamer",
title = "The use of {``LET''} statements in producing short
comprehensible outputs",
journal = j-SIGSAM,
volume = "11--12",
number = "4--1",
pages = "20--22",
month = nov # " and " # feb,
year = "1977",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "44/45",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
remark = "Issue labeled vol. 11, no. 4, November 1977 (issue
\#44) and vol. 12, no. 1, February 1978 (issue \#45).",
}
@Article{Felsch:1977:KIB,
author = "V. Felsch",
title = "A {KWIC} Indexed Bibliography on the Use of Computers
in Group Theory and Related Topics",
journal = j-SIGSAM,
volume = "11--12",
number = "4--1",
pages = "23--86",
month = nov # " and " # feb,
year = "1977",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Dec 23 10:41:23 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "44/45",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
remark = "Issue labeled vol. 11, no. 4, November 1977 (issue
\#44) and vol. 12, no. 1, February 1978 (issue \#45).",
}
@Article{Loos:1977:ARN,
author = "R{\"u}diger Loos",
title = "Abstracts {(REDUCE newsletter 1.1978)}",
journal = j-SIGSAM,
volume = "11--12",
number = "4--1",
pages = "86--88",
month = nov # " and " # feb,
year = "1977",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:55 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
remark = "Issue labeled vol. 11, no. 4, November 1977 (issue
\#44) and vol. 12, no. 1, February 1978 (issue \#45).",
}
@Article{Wang:1978:Aa,
author = "Paul S. Wang",
title = "Abstracts",
journal = j-SIGSAM,
volume = "12",
number = "2",
pages = "8--9",
month = may,
year = "1978",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wang:1978:SIS,
author = "Paul S. Wang",
title = "Seminar on {Introduction to Symbolic and Algebraic
Manipulation}",
journal = j-SIGSAM,
volume = "12",
number = "2",
pages = "10--12",
month = may,
year = "1978",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wang:1978:Ab,
author = "Paul S. Wang",
title = "Abstracts",
journal = j-SIGSAM,
volume = "12",
number = "2",
pages = "13--17",
month = may,
year = "1978",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Caviness:1978:NAI,
author = "B. F. Caviness and M. J. Prelle",
title = "A note on algebraic independence of logarithmic and
exponential constants",
journal = j-SIGSAM,
volume = "12",
number = "2",
pages = "18--20",
month = may,
year = "1978",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hirschberg:1978:EMI,
author = "Morton A. Hirschberg",
title = "The evaluation, manipulation and identification of
nondimensional numbers",
journal = j-SIGSAM,
volume = "12",
number = "2",
pages = "21--26",
month = may,
year = "1978",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kollreider:1978:IAC,
author = "C. Kollreider and B. Buchberger",
title = "An improved algorithmic construction of
{Gr{\"o}bner-bases} for polynomial ideals",
journal = j-SIGSAM,
volume = "12",
number = "2",
pages = "27--36",
month = may,
year = "1978",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wang:1978:SNM,
author = "Paul S. Wang",
title = "{SIAM 1978} national meeting: invited lectures",
journal = j-SIGSAM,
volume = "12",
number = "3",
pages = "6--7",
month = aug,
year = "1978",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fateman:1978:LMD,
author = "Richard J. Fateman",
title = "Is a {LISP} Machine Different from a {FORTRAN}
Machine?",
journal = j-SIGSAM,
volume = "12",
number = "3",
pages = "8--11",
month = aug,
year = "1978",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "48",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "LISP",
}
@Article{Klip:1978:CSA,
author = "Dorothea A. Klip",
title = "A comparative study of algorithms for sparse
polynomial multiplication",
journal = j-SIGSAM,
volume = "12",
number = "3",
pages = "12--24",
month = aug,
year = "1978",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Moenck:1978:LLB,
author = "Robert Moenck",
title = "Is a linked list the best storage structure for an
algebra system?",
journal = j-SIGSAM,
volume = "12",
number = "3",
pages = "20--24",
month = aug,
year = "1978",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Griesmer:1978:TAC,
author = "J. H. Griesmer and R. D. Jenks and D. Y. Y. Yun",
title = "A taxonomy for algebraic computation",
journal = j-SIGSAM,
volume = "12",
number = "3",
pages = "25--28",
month = aug,
year = "1978",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Akritas:1978:SNN,
author = "Alkiviadis G. Akritas",
title = "A short note on a new method for polynomial real root
isolation",
journal = j-SIGSAM,
volume = "12",
number = "4",
pages = "12--13",
month = aug,
year = "1978",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Norman:1978:TRS,
author = "Arthur Norman",
title = "Towards a {REDUCE} solution to {SIGSAM} Problem 7",
journal = j-SIGSAM,
volume = "12",
number = "4",
pages = "14--18",
month = nov,
year = "1978",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "48",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{deQueiroz:1978:ATA,
author = "F. Teixeira de Queiroz",
title = "Advanced tests for algorithms of differentiation",
journal = j-SIGSAM,
volume = "12",
number = "4",
pages = "19--22",
month = aug,
year = "1978",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{White:1978:LST,
author = "Jon L. White",
title = "{LISP\slash 370}: a short technical description of the
implementation",
journal = j-SIGSAM,
volume = "12",
number = "4",
pages = "23--27",
month = aug,
year = "1978",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wang:1979:A,
author = "Paul S. Wang",
title = "Abstracts",
journal = j-SIGSAM,
volume = "13",
number = "1",
pages = "12--13",
month = feb,
year = "1979",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gawlik:1979:COL,
author = "H. James Gawlik",
title = "Comments on the open letter from {Fateman} to
{Veltman}",
journal = j-SIGSAM,
volume = "13",
number = "1",
pages = "14--15",
month = feb,
year = "1979",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jenks:1979:SRL,
author = "R. D. Jenks",
title = "{SCRATCHPAD\slash 360}: reflections on a language
design",
journal = j-SIGSAM,
volume = "13",
number = "1",
pages = "16--26",
month = feb,
year = "1979",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Harrington:1979:SLE,
author = "Steven J. Harrington",
title = "A Symbolic Limit Evaluation Program in {REDUCE}",
journal = j-SIGSAM,
volume = "13",
number = "1",
pages = "27--31",
month = feb,
year = "1979",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "49",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jensen:1979:FSS,
author = "Jarl Jensen",
title = "On the formulation and solution of shell problems by
means of computerized algebraic manipulation",
journal = j-SIGSAM,
volume = "13",
number = "2",
pages = "13--13",
month = may,
year = "1979",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Raulefs:1979:SSS,
author = "P. Raulefs and J. Siekmann and P. Szab{\'o} and E.
Unvericht",
title = "A short survey on the state of the art in matching and
unification problems",
journal = j-SIGSAM,
volume = "13",
number = "2",
pages = "14--20",
month = may,
year = "1979",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6130 (Data handling techniques)",
corpsource = "Univ. Bonn, Bonn, West Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "50",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "databases; information retrieval; matching; reviews;
symbol manipulation; unification",
treatment = "B Bibliography",
}
@Article{Gakhov:1979:RCI,
author = "F. D. Gakhov",
title = "Review of {``Calculus of Integrals of Higher
Transcendental Functions (The Theory and Tables of
Formulas), by O. I. Marichev'', Minsk, Nauka i
Tekhnika, 1978}",
journal = j-SIGSAM,
volume = "13",
number = "3",
pages = "7--7",
month = aug,
year = "1979",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Stoutemyer:1979:CSM,
author = "David R. Stoutemyer",
title = "Computer symbolic math {\&} education: a radical
proposal",
journal = j-SIGSAM,
volume = "13",
number = "3",
pages = "8--24",
month = aug,
year = "1979",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Griesmer:1979:SSC,
author = "James H. Griesmer",
title = "The state of symbolic computation",
journal = j-SIGSAM,
volume = "13",
number = "3",
pages = "25--28",
month = aug,
year = "1979",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:1979:BR,
author = "Anonymous",
title = "Book review",
journal = j-SIGSAM,
volume = "13",
number = "3",
pages = "??--??",
month = aug,
year = "1979",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wang:1979:ECP,
author = "Paul S. Wang",
title = "{EUROSAM'79} conference proceedings",
journal = j-SIGSAM,
volume = "13",
number = "4",
pages = "8--15",
month = nov,
year = "1979",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Jul 04 08:11:55 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Davenport:1979:AI,
author = "J. H. Davenport",
title = "Anatomy of an integral",
journal = j-SIGSAM,
volume = "13",
number = "4",
pages = "16--18",
month = nov,
year = "1979",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Norman:1979:TWS,
author = "A. C. Norman",
title = "Testing word-sized numbers for primality",
journal = j-SIGSAM,
volume = "13",
number = "4",
pages = "19--20",
month = nov,
year = "1979",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Weber:1979:PSR,
author = "Lawrence A. Weber and Gerhard Rayna",
title = "Problem \#11 Solved in {REDUCE}: a Case Study in
Program Translation",
journal = j-SIGSAM,
volume = "13",
number = "4",
pages = "21--24",
month = nov,
year = "1979",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "52",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wang:1980:TAMa,
author = "Paul S. Wang",
title = "Titles and abstracts: mathematical symbolic
manipulation on the computer and applications",
journal = j-SIGSAM,
volume = "14",
number = "1",
pages = "6--7",
month = feb,
year = "1980",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anderson:1980:MEM,
author = "Ned Anderson and Paul S. Wang",
title = "{MACSYMA} experiments with a modified {Khachian-type}
algorithm in linear programming",
journal = j-SIGSAM,
volume = "14",
number = "1",
pages = "8--13",
month = feb,
year = "1980",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Purtilo:1980:IAP,
author = "Jim Purtilo",
title = "On implementing arbitrary precision arithmetic in
{NIL}: an exercise in data abstraction",
journal = j-SIGSAM,
volume = "14",
number = "1",
pages = "14--18",
month = feb,
year = "1980",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Neubuser:1980:SRP,
author = "J. Neub{\"u}ser",
title = "Some remarks on a proposed taxonomy for algebraic
computation",
journal = j-SIGSAM,
volume = "14",
number = "1",
pages = "19--20",
month = feb,
year = "1980",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Mignotte:1980:TP,
author = "Maurice Mignotte",
title = "Tests for polynomials",
journal = j-SIGSAM,
volume = "14",
number = "1",
pages = "21--22",
month = feb,
year = "1980",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Marti:1980:SLR,
author = "J. Marti and A. C. Hearn and M. L. Griss and C.
Griss",
title = "{Standard Lisp} Report",
journal = j-SIGSAM,
volume = "14",
number = "1",
pages = "23--43",
month = feb,
year = "1980",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "53",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wang:1980:TAMb,
author = "Paul S. Wang",
title = "Titles and abstracts: mathematical symbolic
manipulation on the computer",
journal = j-SIGSAM,
volume = "14",
number = "2",
pages = "20--22",
month = may,
year = "1980",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Frauenthal:1980:CAM,
author = "James C. Frauenthal",
title = "Change in applied mathematics is revolutionary",
journal = j-SIGSAM,
volume = "14",
number = "2",
pages = "23--23",
month = may,
year = "1980",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Akritas:1980:RPS,
author = "Alkiviadis G. Akritas",
title = "A remark on the proposed syllabus for an {AMS} short
course on computer algebra",
journal = j-SIGSAM,
volume = "14",
number = "2",
pages = "24--25",
month = may,
year = "1980",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C0220 (Computing education and training)",
corpsource = "Univ. of Kansas, Lawrence, KS, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "54",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "AMS course; computer algebra; computer science
education; Descartes; educational courses; proposed
syllabus; theorem; Uspensky's method",
treatment = "G General Review; T Theoretical or Mathematical",
}
@Article{Lazard:1980:PSA,
author = "D. Lazard",
title = "Problem 7 and systems of algebraic equations",
journal = j-SIGSAM,
volume = "14",
number = "2",
pages = "26--29",
month = may,
year = "1980",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra)",
corpsource = "Math. Informatique, Univ. de Poitiers, Poitiers,
France",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "54",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; algebraic equations; minimal polynomial;
problem 7",
treatment = "T Theoretical or Mathematical",
}
@Article{Norton:1980:NAL,
author = "Lewis M. Norton",
title = "A Note About {Laplace} Transform Tables for Computer
Use",
journal = j-SIGSAM,
volume = "14",
number = "2",
pages = "30--31",
month = may,
year = "1980",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1130 (Integral transforms); C6130 (Data handling
techniques)",
corpsource = "Lab. of Statistical and Math. Methodology, Nat. Inst.
of Health, Bethesda, MD, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "54",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "inverse Laplace transforms; language; Laplace
transform tables; Laplace transforms; manipulation;
REDUCE; symbol; symbol manipulation; symbolic algebraic
manipulation",
treatment = "T Theoretical or Mathematical",
}
@Article{Rajaram:1980:ROA,
author = "Navaratna S. Rajaram",
title = "Random oscillations arising in the {MACSYMA}
implementation of {Khachian-type} algorithms in linear
programming",
journal = j-SIGSAM,
volume = "14",
number = "2",
pages = "32--35",
month = may,
year = "1980",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1180 (Optimisation techniques)",
corpsource = "Dept. of Math., Kent State Univ., Kent, OH, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "54",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "Anderson; Khachian algorithm; linear programming;
MACSYMA; Wang modified algorithm",
treatment = "T Theoretical or Mathematical",
}
@Article{vanHulzen:1980:CPP,
author = "J. A. {van Hulzen}",
title = "Computational Problems in Producing {Taylor}
Coefficients for the Rotating Disk Problem",
journal = j-SIGSAM,
volume = "14",
number = "2",
pages = "36--49",
month = may,
year = "1980",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "A4730 (Rotational flow, vortices, buoyancy and other
flows involving body forces); C7320 (Physics and
chemistry computing)",
corpsource = "Dept. of Appl. Math., Twente Univ. of Technol.,
Enschede, Netherlands",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "54",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "computer models; physics computing; rotating disc
problem; rotating fluid; rotational flow; Taylor
coefficients",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Wang:1980:EGA,
author = "Paul S. Wang",
title = "The {EEZ-GCD} algorithm",
journal = j-SIGSAM,
volume = "14",
number = "2",
pages = "50--60",
month = may,
year = "1980",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra); C7310 (Mathematics computing)",
corpsource = "Dept. of Math., Kent State Univ., Kent, OH, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "54",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; common divisor problem; enhanced gcd
algorithm; EZ GCD algorithm; polynomials; sparse
multivariate polynomials",
treatment = "T Theoretical or Mathematical",
}
@Article{Stoutemyer:1980:PES,
author = "David R. Stoutemyer",
title = "{PICOMATH-80}: an even smaller computer algebra
package",
journal = j-SIGSAM,
volume = "14",
number = "3",
pages = "5--7",
month = aug,
year = "1980",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6130 (Data handling techniques)",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "55",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra package; array; BASIC; computer algebra; data
handling; PICOMATH-80; primitive",
treatment = "A Application",
}
@Article{Voros:1980:SCS,
author = "A. Voros",
title = "Symbol calculus by symbolic computation and
semi-classical expansions",
journal = j-SIGSAM,
volume = "14",
number = "3",
pages = "7--7",
month = aug,
year = "1980",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Akritas:1980:CLR,
author = "Alkiviadis G. Akritas",
title = "A complete list of references for the paper: {``A
remark on the proposed syllabus for an AMS short course
on computer algebra''}",
journal = j-SIGSAM,
volume = "14",
number = "3",
pages = "32--32",
month = aug,
year = "1980",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kasper:1980:IFT,
author = "Toni Kasper",
title = "Integration in finite terms: the {Liouville} theory",
journal = j-SIGSAM,
volume = "14",
number = "4",
pages = "2--8",
month = nov,
year = "1980",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Saunders:1980:SAS,
author = "B. David Saunders",
title = "A survey of available systems",
journal = j-SIGSAM,
volume = "14",
number = "4",
pages = "12--28",
month = nov,
year = "1980",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bachmair:1980:SPC,
author = "L. Bachmair and B. Buchberger",
title = "A simplified proof of the characterization theorem for
{Gr{\"o}bner-bases}",
journal = j-SIGSAM,
volume = "14",
number = "4",
pages = "29--34",
month = nov,
year = "1980",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "B0210 (Algebra); C1110 (Algebra)",
corpsource = "Johannes Kepler Univ., Linz, Austria",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "56",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "polynomials; characterization theorem;
Gr{\"o}bner-bases; polynomial ideals; congruence
relation modulo a polynomial; M-reduction; reduction
relations",
treatment = "T Theoretical or Mathematical",
}
@Article{Bossi:1980:ICM,
author = "A. Bossi and L. Colussi and C. Cobelli and G. {Romanin
Jacur}",
title = "Identifiability of compartmental models: algorithms to
solve an actual problem by means of symbolic calculus",
journal = j-SIGSAM,
volume = "14",
number = "4",
pages = "35--40",
month = nov,
year = "1980",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra); C1220 (Simulation, modelling and
identification)",
corpsource = "Univ. of Padova, Padova, Italy",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "56",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "compartmental models; identifiability test;
identification; mathematical models; polynomials;
structural; symbolic calculus",
treatment = "T Theoretical or Mathematical",
}
@Article{Mignotte:1980:FUP,
author = "Maurice Mignotte",
title = "Factorization of univariate polynomials: a statistical
study",
journal = j-SIGSAM,
volume = "14",
number = "4",
pages = "41--44",
month = nov,
year = "1980",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "B0210 (Algebra); C1110 (Algebra)",
corpsource = "Univ. Louis Pasteur, Strasbourg, France",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "56",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "average cost; factorize; finite fields; polynomials;
statistical analysis; statistical behaviour; univariate
integral polynomials",
treatment = "T Theoretical or Mathematical",
}
@Article{Miola:1981:BSW,
author = "A. M. Miola",
title = "A bibliography of {Soviet} works in algebraic
manipulations",
journal = j-SIGSAM,
volume = "15",
number = "1",
pages = "5--7",
month = feb,
year = "1981",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Thu Mar 20 16:02:15 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra); C4140 (Linear algebra)",
corpsource = "Istituto di Analisi dei Sistemi e Informatica, Roma,
Italy",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "57",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; algebraic manipulations; bibliography; Soviet
works",
treatment = "B Bibliography",
}
@Article{Akritas:1981:BFC,
author = "Alkiviadis G. Akritas",
title = "On the {Budan--Fourier} controversy",
journal = j-SIGSAM,
volume = "15",
number = "1",
pages = "8--10",
month = feb,
year = "1981",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Davenport:1981:M,
author = "James H. Davenport and Richard D. Jenks",
title = "{MODLISP}",
journal = j-SIGSAM,
volume = "15",
number = "1",
pages = "11--20",
month = feb,
year = "1981",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6140D (High level languages)",
corpsource = "Math. Sci. Dept., IBM Thomas J. Watson, Res. Center,
Yorktown Heights, NY, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "57",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "high level languages; LISP-like language; MODLISP",
treatment = "A Application",
}
@Article{Fateman:1981:SAC,
author = "Richard J. Fateman",
title = "Symbolic and algebraic computer programming systems",
journal = j-SIGSAM,
volume = "15",
number = "1",
pages = "21--32",
month = feb,
year = "1981",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4140 (Linear algebra)",
corpsource = "Dept. of Electrical Engng. and Computer Sci., Univ. of
California, Berkeley, CA, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "57",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; algebraic systems; computer programming
systems; integers; mathematical systems; polynomials;
rational functions; ring of; symbolic systems",
treatment = "A Application",
}
@Article{Kofalusi:1981:SSS,
author = "Victor K{\"o}falusi and Edit Halmay",
title = "State-space sets, state-space graphs and $n$-prefix
expressions",
journal = j-SIGSAM,
volume = "15",
number = "1",
pages = "33--36",
month = feb,
year = "1981",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1160 (Combinatorial mathematics); C1310 (Control
system analysis and synthesis methods); C4210 (Formal
logic); C6120 (File organisation); C6140D (High level
languages)",
corpsource = "CSO Internat. Computer Education and Information
Centre, Budapest, Hungary",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "57",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "combinatorial explosion; data structure; data
structures; formula; graph theory; high level
languages; manipulation; N-prefix expressions;
programming language; PROLOG; set; set theory;
state-space graphs; state-space methods; state-space
sets; storage requirement; theory; tree; trees
(mathematics)",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Pohst:1981:CLV,
author = "Michael Pohst",
title = "On the computation of lattice vectors of minimal
length, successive minima and reduced bases with
applications",
journal = j-SIGSAM,
volume = "15",
number = "1",
pages = "37--44",
month = feb,
year = "1981",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra); C1120 (Mathematical analysis); C1160
(Combinatorial mathematics); C4140 (Linear algebra)",
corpsource = "Math. Inst., Koln Univ., Koln, West Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "57",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; computational methods; lattice vectors;
number theory; reduced bases; vectors",
treatment = "T Theoretical or Mathematical",
}
@Article{Saunders:1981:A,
author = "B. David Saunders",
title = "Abstracts",
journal = j-SIGSAM,
volume = "15",
number = "2",
pages = "6--7",
month = may,
year = "1981",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bordoni:1981:ARI,
author = "Luciana Bordoni and Attilio Colagrossi",
title = "An Application of {REDUCE} to Industrial Mechanics",
journal = j-SIGSAM,
volume = "15",
number = "2",
pages = "8--12",
month = may,
year = "1981",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7440 (Civil and mechanical engineering computing)",
corpsource = "Istituto di Analisi dei Sistemi ed Informatica,
IASI-CNR, Roma, Italy",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "58",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "dynamical equations; industrial mechanics; Lagrange
dynamical equations; large; mechanical engineering
computing; mechanical systems; motion; REDUCE
implementation",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Kanada:1981:LBB,
author = "Yasumasa Kanada and Tateaki Sasaki",
title = "{LISP}-based ``big-float'' system is not slow",
journal = j-SIGSAM,
volume = "15",
number = "2",
pages = "13--19",
month = may,
year = "1981",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Thu Mar 20 16:02:15 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C5230 (Digital arithmetic methods)",
corpsource = "Inst. of Plasma Phys., Nagoya Univ., Chikusaku,
Nagoya, Japan",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "58",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "digital arithmetic; e; exp(x); FORTRAN-compiler-based
system; LISP; LISP based big float system;
LISP-interpreter-based system; pi; sqrt(x)",
treatment = "P Practical",
xxpages = "123--119",
}
@Article{Mordukhai-Boltovskoi:1981:GII,
author = "D. Mordukhai-Boltovskoi and Boris Korenblum and Myra
Prelle",
title = "A general investigation of integration in finite form
of differential equations of the first order article
1",
journal = j-SIGSAM,
volume = "15",
number = "2",
pages = "20--32",
month = may,
year = "1981",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Chan:1981:NSO,
author = "Woon Cheung Chan",
title = "A novel symbolic ordinary differential equation
solver",
journal = j-SIGSAM,
volume = "15",
number = "3",
pages = "9--14",
month = aug,
year = "1981",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4170 (Differential equations); C7310 (Mathematics
computing)",
corpsource = "Electrical Engng. Dept., Univ. of Hawaii, Manoa, HI,
USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "59",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "differential equations; muMATH computer algebra
system; package; symbolic ordinary differential
equation solver",
treatment = "T Theoretical or Mathematical",
}
@Article{Lenstra:1981:LFP,
author = "A. K. Lenstra",
title = "Lattices and factorization of polynomials",
journal = j-SIGSAM,
volume = "15",
number = "3",
pages = "15--16",
month = aug,
year = "1981",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4130 (Interpolation and function approximation);
C7310 (Mathematics computing)",
corpsource = "Dept. of Computer Sci., Math. Centrum, Amsterdam,
Netherlands",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "59",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "ALGOL 68; Algol-68; CDC-Cyber 170-750 computer;
factorization; lattices; polynomials",
treatment = "T Theoretical or Mathematical",
}
@Article{Rowan:1981:EPS,
author = "William H. Rowan",
title = "Efficient polynomial substitutions of a sparse
argument",
journal = j-SIGSAM,
volume = "15",
number = "3",
pages = "17--23",
month = aug,
year = "1981",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "B0290F (Interpolation and function approximation);
C4130 (Interpolation and function approximation)",
corpsource = "Dept. of Math., Univ. of California, Berkeley, CA,
USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "59",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "bound; optimality; polynomial substitutions;
polynomials; sharp lower; sparse argument",
treatment = "T Theoretical or Mathematical",
}
@Article{Saunders:1981:AMM,
author = "B. David Saunders",
title = "Algebra made mechanical",
journal = j-SIGSAM,
volume = "15",
number = "3",
pages = "23--25",
month = aug,
year = "1981",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Steen:1981:CCL,
author = "Lynn Arthur Steen",
title = "Computer calculus: long perceived as merely `number
crunchers,' computers are now moving into the realm of
elegant mathematics",
journal = j-SIGSAM,
volume = "15",
number = "3",
pages = "26--27",
month = aug,
year = "1981",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Arnon:1981:AAR,
author = "Dennis S. Arnon",
title = "Automatic analysis of real algebraic curves",
journal = j-SIGSAM,
volume = "15",
number = "4",
pages = "3--9",
month = nov,
year = "1981",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4130 (Interpolation and function approximation);
C7310 (Mathematics computing)",
corpsource = "Computer Sci. Dept., Purdue Univ., West Lafayette, IN,
USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "60",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebraic curves; bivariate integral; CAA; clustering
cylindrical algebraic; computer aided analysis;
computer program; decomposition algorithm; picture;
polynomial; polynomials",
treatment = "T Theoretical or Mathematical",
}
@Article{Kempelmann:1981:RAF,
author = "Helmut Kempelmann",
title = "Recursive algorithm for the fast calculation of the
limit of derivatives at points of indeterminateness",
journal = j-SIGSAM,
volume = "15",
number = "4",
pages = "10--11",
month = nov,
year = "1981",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "B0290F (Interpolation and function approximation);
C4130 (Interpolation and function approximation)",
corpsource = "Lehrstuhl fur Allgemeine Elektrotechnik und
Datenfernverarbeitung, RWTH Aachen, Aachen, West
Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "60",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "denominator; derivatives; function evaluation;
indeterminateness; Laplace; numerator; probability;
queueing theory; recursive algorithm; REDUCE;
transform",
treatment = "T Theoretical or Mathematical",
}
@Article{Atkinson:1981:SSC,
author = "M. D. Atkinson",
title = "Saving space in coset enumeration",
journal = j-SIGSAM,
volume = "15",
number = "4",
pages = "12--14",
month = nov,
year = "1981",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1160 (Combinatorial mathematics); C4240 (Programming
and algorithm theory)",
corpsource = "Dept. of Computing Math., Univ. Coll., Cardiff, UK",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "60",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "computational complexity; computational group theory;
coset enumeration; execution; group theory; time;
Todd--Coxeter process",
treatment = "T Theoretical or Mathematical",
}
@Article{Pearce:1981:AAO,
author = "P. D. Pearce and R. J. Hicks",
title = "The Application of Algebraic Optimisation Techniques
to Algebraic Mode Programs for {REDUCE}",
journal = j-SIGSAM,
volume = "15",
number = "4",
pages = "15--22",
month = nov,
year = "1981",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4240 (Programming and algorithm theory)",
corpsource = "School of Electronic Engng. and Computer Sci.,
Kingston Polytech., Kingston upon Thames, UK",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "60",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebraic manipulator; algebraic mode programs;
algebraic optimisation techniques; optimisation;
programming theory; REDUCE",
treatment = "T Theoretical or Mathematical",
}
@Article{Smit:1981:NCO,
author = "J. Smit and J. A. {van Hulzen} and B. J. A. Hulshof",
title = "{NETFORM} and Code Optimizer Manual",
journal = j-SIGSAM,
volume = "15",
number = "4",
pages = "23--32",
month = nov,
year = "1981",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7410D (Electronic engineering computing)",
corpsource = "Twente Univ. of Technol., Enschede, Netherlands",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "60",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebraic form; circuit analysis computing; code
optimizer manual; electrical networks; linear
equations; NETFORM",
treatment = "G General Review; P Practical",
}
@Article{Davenport:1982:FRT,
author = "James H. Davenport",
title = "Fast {REDUCE}: The trade-off between efficiency and
generality",
journal = j-SIGSAM,
volume = "16",
number = "1",
pages = "8--11",
month = feb,
year = "1982",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "61",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Collins:1982:JSA,
author = "George E. Collins and R{\"u}diger G. K. Loos",
title = "The {Jacobi} symbol algorithm",
journal = j-SIGSAM,
volume = "16",
number = "1",
pages = "12--16",
month = feb,
year = "1982",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Norfolk:1982:SCR,
author = "Timothy S. Norfolk",
title = "Symbolic computation of residues at poles and
essential singularities",
journal = j-SIGSAM,
volume = "16",
number = "1",
pages = "17--23",
month = feb,
year = "1982",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:57 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wang:1982:ARR,
author = "Paul S. Wang and M. J. T. Guy and J. H. Davenport",
title = "{$P$}-adic reconstruction of rational numbers",
journal = j-SIGSAM,
volume = "16",
number = "2",
pages = "2--3",
month = may,
year = "1982",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6130 (Data handling techniques)",
corpsource = "Dept. of Math. Sci., Kent State Univ., Kent, OH, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "62",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "data handling; p-adic reconstruction; partial fraction
decompositions; RATCONVERT; rational numbers",
treatment = "P Practical",
}
@Article{Kalina:1982:RRL,
author = "Zden{\^e}k Kalina",
title = "Running {REDUCE} and {Lisp\slash 360} interactively
under a {Time Sharing Option}",
journal = j-SIGSAM,
volume = "16",
number = "2",
pages = "3--3",
month = may,
year = "1982",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "62",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ucoluk:1982:PER,
author = "G. {\"U}{\c{c}}oluk and A. Hac{\i}nl{\i}yan and E.
Karabudak",
title = "A Proposal for Extensions to {REDUCE}",
journal = j-SIGSAM,
volume = "16",
number = "2",
pages = "4--14",
month = may,
year = "1982",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Three classes of extensions are proposed for {REDUCE}:
A facility for evaluating arbitrary functions of
matrices; a facility for grouping, modifying or
restoring the status of various flags in {REDUCE};
further extensions and modifications for separating
terms, coefficients of expressions, concatenation, and
non-commuting algebra.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6140D (High level languages)",
corpsource = "Bogazici Univ., Instanbul, Turkey",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "62",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "arbitrary; flags; functions; grouping; high level
languages; matrices; modifying; REDUCE; restoring;
symbol manipulation; UNIVAC 1100",
treatment = "P Practical",
}
@Article{Anonymous:1982:KIS,
author = "Anonymous",
title = "{KWIC} Index of {SIGSAM Bulletin} Abstracts
(1978--1981)",
journal = j-SIGSAM,
volume = "16",
number = "2",
pages = "15--36",
month = may,
year = "1982",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Feb 09 06:39:03 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:1982:ECP,
author = "Anonymous",
title = "{EUROCAL '83} Call for Papers",
journal = j-SIGSAM,
volume = "16",
number = "2",
pages = "37--37",
month = may,
year = "1982",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Feb 09 06:39:03 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:1982:SC,
author = "Anonymous",
title = "{SAME} Created",
journal = j-SIGSAM,
volume = "16",
number = "2",
pages = "38--38",
month = may,
year = "1982",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Feb 09 06:39:03 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "{Symbolic and Algebraic Computation in Europe
(SAME)}",
}
@Article{Davenport:1982:PRA,
author = "James H. Davenport",
title = "On the parallel {Risch} algorithm {(III)}: use of
tangents",
journal = j-SIGSAM,
volume = "16",
number = "3",
pages = "3--6",
month = aug,
year = "1982",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4240 (Programming and algorithm theory)",
corpsource = "Emmanuel Coll., Cambridge, UK",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "63",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithm theory; parallel processing; parallel Risch
algorithm; tangents; trigonometric functions",
treatment = "T Theoretical or Mathematical",
}
@Article{diScala:1982:SPB,
author = "R.-M. {di Scala}",
title = "{SYPAC}: a {Pascal} based computer algebra system for
micro-computers",
journal = j-SIGSAM,
volume = "16",
number = "3",
pages = "7--10",
month = aug,
year = "1982",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6130 (Data handling techniques); C6140D (High level
languages)",
corpsource = "IMAG, Grenoble, France",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "63",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "computers; data handling; integer; manipulating
infinite precision integers; micro-; minimal PASCAL;
Pascal; PASCAL based computer algebra system;
polynomials; SYPAC; UCSD; Wirth's standard",
treatment = "P Practical",
}
@Article{Steinberg:1982:MSM,
author = "Stanly Steinberg",
title = "Mathematics and Symbol Manipulation",
journal = j-SIGSAM,
volume = "16",
number = "3",
pages = "11--15",
month = aug,
year = "1982",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6130 (Data handling techniques)",
corpsource = "Dept. of Maths. and Statistics, Univ. of New Mexico,
Albuquerque, NM, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "63",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "MACSYMA; mathematics; symbol manipulation",
treatment = "P Practical",
}
@Article{Shochat:1982:EMM,
author = "David D. Shochat",
title = "Experience with the {muSIMP\slash muMATH-80} symbolic
mathematics system",
journal = j-SIGSAM,
volume = "16",
number = "3",
pages = "16--23",
month = aug,
year = "1982",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6130 (Data handling techniques); C7310 (Mathematics
computing)",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "63",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "interpreter; mathematics; muMath symbolic calculus
system; muSimp; muSIMP/muMATH-80; symbol manipulation;
symbolic mathematics system",
treatment = "G General Review; P Practical",
}
@Article{Trotter:1982:SFP,
author = "Hale F. Trotter",
title = "Statistics on factoring polynomials $ \bmod p $ and
$p$-adically",
journal = j-SIGSAM,
volume = "16",
number = "3",
pages = "24--29",
month = aug,
year = "1982",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Maths., Princeton Univ., Princeton, NJ, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "63",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithm theory; factoring polynomials; Mod P; p-adic
factoring; polynomials; statistics",
treatment = "T Theoretical or Mathematical",
}
@Article{Renbao:1982:AAC,
author = "Zhong Renbao",
title = "An algorithm for avoiding complex numbers in rational
function integration",
journal = j-SIGSAM,
volume = "16",
number = "3",
pages = "30--32",
month = aug,
year = "1982",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Zhong:1982:AAC,
author = "R. Zhong",
title = "An algorithm for avoiding complex numbers in rational
function integration",
journal = j-SIGSAM,
volume = "16",
number = "3",
pages = "30--32",
month = aug,
year = "1982",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Thu Mar 20 16:02:15 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "B0290M (Numerical integration and differentiation);
C4160 (Numerical integration and differentiation)",
corpsource = "Central-South Inst. of Mining and Metall., Changsha,
Hunan, China",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "63",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "complex numbers; integration; rational function
integration",
treatment = "T Theoretical or Mathematical",
}
@Article{Kaltofen:1982:PRM,
author = "Erich Kaltofen",
title = "Polynomial reduction from multivariate to bivariate
integral polynomial factorization",
journal = j-SIGSAM,
volume = "16",
number = "4",
pages = "4--4",
month = nov,
year = "1982",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Buchberger:1982:CAS,
author = "B. Buchberger and G. E. Collins and R. Loos and R.
Albrecht",
title = "Computer algebra symbolic and algebraic computation",
journal = j-SIGSAM,
volume = "16",
number = "4",
pages = "5--5",
month = nov,
year = "1982",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Davenport:1982:WDW,
author = "James H. Davenport",
title = "What do we want from a high-level language?",
journal = j-SIGSAM,
volume = "16",
number = "4",
pages = "6--9, 23",
month = nov,
year = "1982",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra); C6140D (High level languages)",
corpsource = "Emmanuel Coll., Cambridge, UK",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "64",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; computer algebra; high level languages;
high-level language; symbol manipulation",
treatment = "G General Review; T Theoretical or Mathematical",
}
@Article{Fogelholm:1982:SLV,
author = "Rabbe Fogelholm and Inge B. Frick",
title = "Standard {LISP} for the {VAX}: a Provisional
Implementation",
journal = j-SIGSAM,
volume = "16",
number = "4",
pages = "10--12",
month = nov,
year = "1982",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6140D (High level languages)",
corpsource = "Dept. of Solid State Phys., Royal Inst. of Technol.,
Stockholm, Sweden",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "64",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "LISP; REDUCE; SHEEP; Standard LISP; symbol
manipulation; VAX-11 large-address-space computer",
treatment = "P Practical",
}
@Article{Kuchlin:1982:SRS,
author = "Wolfgang K{\"u}chlin",
title = "Some reduction strategies for algebraic term
rewriting",
journal = j-SIGSAM,
volume = "16",
number = "4",
pages = "13--23",
month = nov,
year = "1982",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "B0210 (Algebra); C1110 (Algebra); C6130 (Data handling
techniques)",
corpsource = "Inst. fur Informatik I, Univ. Karlsruhe, Karlsruhe,
West Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "64",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; algebraic term rewriting; completion
algorithm; Knuth--Bendix; reduction strategies; symbol
manipulation",
treatment = "T Theoretical or Mathematical",
}
@Article{Miola:1982:CHC,
author = "Alfonso M. Miola",
title = "The conversion of {Hensel} codes to their rational
equivalents (or how to solve the {Gregory}'s open
problem)",
journal = j-SIGSAM,
volume = "16",
number = "4",
pages = "24--26",
month = nov,
year = "1982",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Istituto di Analisi dei Sistemi ed Informatica, Roma,
Italy",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "64",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "finite-; Hensel codes; number theory; p-adic
arithmetic; rational number; segment p-adic number",
treatment = "T Theoretical or Mathematical",
}
@Article{Schrufer:1982:IEC,
author = "E. Schr{\"u}fer",
title = "An Implementation of the Exterior Calculus in
{REDUCE}: a Status Report",
journal = j-SIGSAM,
volume = "16",
number = "4",
pages = "27--31",
month = nov,
year = "1982",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "B0210 (Algebra); C1120 (Mathematical analysis); C6130
(Data handling techniques); C7310 (Mathematics
computing)",
corpsource = "Inst. fur Astrophys. und Extraterrestrische Forschung,
Univ. Bonn, Bonn, West Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "64",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "binary infix; calculus; differentiation; exterior;
exterior differentiation; Hodge star; inner product
differentiation; Lie; multiplication; nary infix
operator; REDUCE; symbol manipulation; unary prefix;
variational calculus",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{vanHulzen:1982:EAP,
author = "J. A. {van Hulzen} and B. J. A. Hulshof",
title = "An Expression Analysis Package for {REDUCE}",
journal = j-SIGSAM,
volume = "16",
number = "4",
pages = "32--44",
month = nov,
year = "1982",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1120 (Mathematical analysis); C6130 (Data handling
techniques); C7310 (Mathematics computing)",
corpsource = "Dept. of Computer Sci., Twente Univ. of Technol.,
Enschede, Netherlands",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "64",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; Code Optimiser; expression analysis package;
interactive use; REDUCE; Standard LISP; symbol
manipulation",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Bundschuh:1983:GDF,
author = "Florian Bundschuh",
title = "Global data flow analysis in {Aldes}",
journal = j-SIGSAM,
volume = "17",
number = "1",
pages = "6--11",
month = feb,
year = "1983",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6150C (Compilers, interpreters and other
processors)",
corpsource = "Univ. Karlsruhe, Karlsruhe, West Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "65",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "2; ALDES; attribute grammar; code; compilers;
gathering information; global data-flow analysis;
grammars; improvement; program compilers; programming
errors; programming language; SAC-",
treatment = "P Practical",
}
@Article{Colagrossi:1983:CRZ,
author = "Attilio Colagrossi and Alfonso M. Miola",
title = "Computing real zeros of polynomials with parametric
coefficients",
journal = j-SIGSAM,
volume = "17",
number = "1",
pages = "12--15",
month = feb,
year = "1983",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "B0290F (Interpolation and function approximation);
C4130 (Interpolation and function approximation)",
corpsource = "Istituto di Analisi dei Sistemi ed Informatica, Roma,
Italy",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "65",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "method; parametric coefficients; poles and zeros;
polynomials; real zeros; Sturm's; univariate
polynomials",
treatment = "T Theoretical or Mathematical",
}
@Article{Hulshof:1983:SRF,
author = "B. J. A. Hulshof and J. A. {van Hulzen}",
title = "Some {REDUCE} Facilities for Pretty Printing
Subscripts and Formal Derivatives",
journal = j-SIGSAM,
volume = "17",
number = "1",
pages = "16--20",
month = feb,
year = "1983",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6130 (Data handling techniques)",
corpsource = "Dept. of Computer Sci. Twente Univ. of Technol.,
Enschede, Netherlands",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "65",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "array subscripts; formal derivatives; matrix
subscripts; pretty; printing subscripts; REDUCE
facilities; Standard LISP; text editing",
treatment = "P Practical",
}
@Article{Kruse:1983:ARE,
author = "Hans-Guenther Kruse and Karin Ohlsen",
title = "About the Realization of an Extended, but Really
Interactive {REDUCE} by Integration of a Small Editing
and Executing System",
journal = j-SIGSAM,
volume = "17",
number = "1",
pages = "21--25",
month = feb,
year = "1983",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6130 (Data handling techniques); C6150J (Operating
systems)",
corpsource = "Univ. Mannheim, Mannheim, West Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "65",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "data handling; editing; executing system; IBM-like;
interactive REDUCE; machines; operating systems;
operating systems (computers); symbolic calculations;
text editing",
treatment = "P Practical",
}
@Article{Marti:1983:RCM,
author = "Jed Marti and John Fitch",
title = "{REDUCE 2} for {CP/M}",
journal = j-SIGSAM,
volume = "17",
number = "1",
pages = "26--27, 37",
month = feb,
year = "1983",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6150C (Compilers, interpreters and other processors);
C6150J (Operating systems)",
corpsource = "Univ. of Bath, Bath, UK",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "65",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "64K; byte Z80 CP/M microcomputer systems; compilers;
computer algebra; CP/M; interpreters; NLARGE; operating
systems (computers); OS; parsers; program; program
compilers; REDUCE 2; system; UOLISP compiler",
treatment = "P Practical",
}
@Article{Norman:1983:CVR,
author = "Arthur C. Norman and Paul S. Wang",
title = "A comparison of the {Vaxima} and {Reduce}
factorization packages",
journal = j-SIGSAM,
volume = "17",
number = "1",
pages = "28--30",
month = feb,
year = "1983",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6150C (Compilers, interpreters and other processors);
C7310 (Mathematics computing)",
corpsource = "Computer Lab., Univ. of Cambridge, Cambridge, UK",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "65",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "compilers; factorization packages; Macsyma;
mathematics; program compilers; program interpreters;
Reduce; REDUCE; Vaxima",
treatment = "P Practical",
}
@Article{Pearce:1983:DSE,
author = "P. D. Pearce and R. J. Hicks",
title = "Data structures and execution times of {Algebraic}
mode programs for {REDUCE}",
journal = j-SIGSAM,
volume = "17",
number = "1",
pages = "31--37",
month = feb,
year = "1983",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6130 (Data handling techniques)",
corpsource = "School of Electronic Engng. and Computer Sci.,
Kingston Polytech., Kingston, UK",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "65",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebraic mode programs; data handling; data
structures; execution times; ordering of identifiers;
REDUCE",
treatment = "P Practical",
}
@Article{Schwarz:1983:RPS,
author = "Fritz Schwarz",
title = "A {REDUCE} Package for Series Analysis by {Hadamard}'s
Theorem and {QD} Schemes",
journal = j-SIGSAM,
volume = "17",
number = "1",
pages = "38--44",
month = feb,
year = "1983",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4120 (Functional analysis); C7310 (Mathematics
computing)",
corpsource = "Fachbereich Phys., Univ. Kaiserslautern,
Kaiserslautern, West Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "65",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "analytic; branch points; functional analysis;
functions; Hadamard's; infinite; lattice gauge
theories; mathematics; poles; power series; precision
integer arithmetic; QD schemes; REDUCE package; series
analysis; statistical physics; theorem",
treatment = "T Theoretical or Mathematical",
}
@Article{Davenport:1983:CC,
author = "James H. Davenport",
title = "Chairman's column",
journal = j-SIGSAM,
volume = "17",
number = "2",
pages = "1--5",
month = may,
year = "1983",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Jul 04 08:13:05 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Belovari:1983:CAS,
author = "G. Belovari",
title = "Complex analysis in symbolic computing of some
definite integrals",
journal = j-SIGSAM,
volume = "17",
number = "2",
pages = "6--11",
month = may,
year = "1983",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1120 (Mathematical analysis)",
corpsource = "Dept. of Math. Sci., Kent State Univ., Kent, OH, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "66",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "complex analysis; contour integration; definite
integrals; integral equations; residue technique;
symbolic computing",
treatment = "T Theoretical or Mathematical",
}
@Article{Berry:1983:CA,
author = "T. G. Berry",
title = "On {Coates} algorithm",
journal = j-SIGSAM,
volume = "17",
number = "2",
pages = "12--17",
month = may,
year = "1983",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra)",
corpsource = "Dept. de Matematicas y Ciencia de la Computacion,
Univ. Simon Bolivar, Caracas, Venezuela",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "66",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; algebraic curve; algebro-geometric structure;
Coates algorithm; rational functions",
treatment = "T Theoretical or Mathematical",
}
@Article{Calmet:1983:SRR,
author = "Jacques Calmet and Ian Cohen",
title = "Synthesizing recurrence relations. {I}. Analysis of
the problems",
journal = j-SIGSAM,
volume = "17",
number = "2",
pages = "18--25",
month = may,
year = "1983",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra); C1320 (Stability in control theory)",
corpsource = "IMAG, Grenoble, France",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "66",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; determinant; Hamiltonian systems; Hankel;
perturbation; physics; polynomials; recurrence
relations; stability criteria; stability criterion;
stochasticity",
treatment = "T Theoretical or Mathematical",
}
@Article{Chen:1983:SMF,
author = "Dongyue Chen",
title = "Symbol manipulation and formula manipulation",
journal = j-SIGSAM,
volume = "17",
number = "2",
pages = "26--27",
month = may,
year = "1983",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Thu Mar 20 16:02:15 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra); C4130 (Interpolation and function
approximation)",
corpsource = "Inst. of Math., Acad. Sinica, Peking, China",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "66",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "addition; algebra; determinants; differentiation;
division; elementary; expansion; exponentiation;
formula manipulation; functional; functions; highest
common factor; multiplication; polynomials;
pseudo-division; rational functions; subtraction;
symbol manipulation; transformation; variables",
treatment = "T Theoretical or Mathematical",
}
@Article{Dongyue:1983:SMF,
author = "Chen Dongyue",
title = "Symbol manipulation and formula manipulation",
journal = j-SIGSAM,
volume = "17",
number = "2",
pages = "26--27",
month = may,
year = "1983",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ebert:1983:SCM,
author = "G. L. Ebert",
title = "Some comments on the modular approach to
{Gr{\"o}bner-bases}",
journal = j-SIGSAM,
volume = "17",
number = "2",
pages = "28--32",
month = may,
year = "1983",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4130 (Interpolation and function approximation);
C4140 (Linear algebra)",
corpsource = "Univ. of Delaware, Newark, DE, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "66",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; polynomials; multivariate polynomials;
modular approach; Gr{\"o}bner-bases; computer
algebraists; integer coefficients; basis; polynomials;
luckiness; primes; binomial case",
treatment = "T Theoretical or Mathematical",
}
@Article{Krasinski:1983:OPA,
author = "Andrzej Krasi{\'n}ski",
title = "{ORTOCARTAN}: a program for algebraic calculations in
general relativity",
journal = j-SIGSAM,
volume = "17",
number = "3--4",
pages = "12--18",
month = aug # "\slash " # nov,
year = "1983",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7320 (Physics and chemistry computing)",
corpsource = "N. Copernicus Astron. Center, Polish Acad. of Sci.,
Warszawa, Poland",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "67/68",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "additions; algebraic calculations; algorithms; CARTAN
forms; computer programs; design; differentiations;
documentation; Einstein; Einstein's; field equations;
general relativity; languages; metric tensor;
multiplications; ORThOnormal set; ORTOCARTAN; physics
computing; polynomials; Reimann; Ricci; tensors; Weyl",
subject = "I.1.3 Computing Methodologies, ALGEBRAIC MANIPULATION,
Languages and Systems, Special-purpose algebraic
systems \\ F.3.3 Theory of Computation, LOGICS AND
MEANINGS OF PROGRAMS, Studies of Program Constructs,
Program and recursion schemes \\ I.1.1 Computing
Methodologies, ALGEBRAIC MANIPULATION, Expressions and
Their Representation, Simplification of expressions \\
J.2 Computer Applications, PHYSICAL SCIENCES AND
ENGINEERING, Physics",
treatment = "A Application; P Practical",
}
@Article{Stickel:1983:NLI,
author = "Mark E. Stickel",
title = "A note on leftmost innermost term reduction",
journal = j-SIGSAM,
volume = "17",
number = "3--4",
pages = "19--20",
month = aug # "\slash " # nov,
year = "1983",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4240 (Programming and algorithm theory)",
corpsource = "Artificial Intelligence Center, SRI Internat., Menlo
Park, CA, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "67/68",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithm theory; algorithms; experimentation;
explicit labeling; indeterministic abstract; leftmost
innermost term reduction; leftmost outermost reduction;
nodes; reduction algorithms; term reduction algorithm",
subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Graph algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Winkler:1983:CEU,
author = "F. Winkler and B. Buchberger",
title = "A criterion for eliminating unnecessary reductions in
the {Knuth}-{Bendix} algorithm (Abstract)",
journal = j-SIGSAM,
volume = "17",
number = "3--4",
pages = "20--20",
month = aug # "\slash " # nov,
year = "1983",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "67/68",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithms",
subject = "F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Numerical Algorithms and
Problems, Computations on polynomials \\ D.2.4
Software, SOFTWARE ENGINEERING, Program Verification,
Correctness proofs",
}
@Article{Smith:1983:IMM,
author = "Paul Smith and Leon Sterling",
title = "Of integration by man and machine",
journal = j-SIGSAM,
volume = "17",
number = "3--4",
pages = "21--24",
month = aug # "\slash " # nov,
year = "1983",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4160 (Numerical integration and differentiation)",
corpsource = "Dept. of Math., Univ. of Dundee, Dundee, UK",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "67/68",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithms; engineering; integration; integration
package; machine; man; nontrivial symbol manipulation;
REDUCE; simplification; symbolic",
subject = "J.2 Computer Applications, PHYSICAL SCIENCES AND
ENGINEERING, Engineering \\ G.1.0 Mathematics of
Computing, NUMERICAL ANALYSIS, General, Computer
arithmetic \\ G.1.4 Mathematics of Computing, NUMERICAL
ANALYSIS, Quadrature and Numerical Differentiation,
Equal interval integration",
treatment = "T Theoretical or Mathematical",
}
@Article{Wester:1983:EMC,
author = "Michael Wester and Stanly Steinberg",
title = "An extension to {MACSYMA}'s concept of functional
differentiation",
journal = j-SIGSAM,
volume = "17",
number = "3--4",
pages = "25--30",
month = aug # "\slash " # nov,
year = "1983",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4160 (Numerical integration and differentiation)",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "67/68",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "arbitrary arguments; arbitrary function; dependencies;
design; DIFF function; differentiation; functional;
functional differentiation; languages; MACSYMA; simple
modification; symbolic mathematics program",
subject = "I.1.3 Computing Methodologies, ALGEBRAIC MANIPULATION,
Languages and Systems, MACSYMA \\ D.2.5 Software,
SOFTWARE ENGINEERING, Testing and Debugging, Symbolic
execution \\ F.3.3 Theory of Computation, LOGICS AND
MEANINGS OF PROGRAMS, Studies of Program Constructs,
Functional constructs \\ G.1 Mathematics of Computing,
NUMERICAL ANALYSIS, Partial Differential Equations",
treatment = "T Theoretical or Mathematical",
}
@Article{Char:1983:MSC,
author = "Bruce Char and Keith Geddes and Gaston Gonnet",
title = "The {Maple} symbolic computation system",
journal = j-SIGSAM,
volume = "17",
number = "3--4",
pages = "31--42",
month = aug # "\slash " # nov,
year = "1983",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4140 (Linear algebra)",
corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo,
Ont., Canada",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "67/68",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; algebraic computation; design; human factors;
interactive systems; languages; Maple; Maple
programming; symbolic computation; user/system
interaction",
subject = "D.4.7 Software, OPERATING SYSTEMS, Organization and
Design, Interactive systems \\ H.1.2 Information
Systems, MODELS AND PRINCIPLES, User/Machine Systems,
Human factors \\ G.1.0 Mathematics of Computing,
NUMERICAL ANALYSIS, General, Computer arithmetic \\
G.1.5 Mathematics of Computing, NUMERICAL ANALYSIS,
Roots of Nonlinear Equations, Systems of equations \\
F.3.3 Theory of Computation, LOGICS AND MEANINGS OF
PROGRAMS, Studies of Program Constructs, Program and
recursion schemes \\ D.3.2 Software, PROGRAMMING
LANGUAGES, Language Classifications, Extensible
languages \\ D.3.3 Software, PROGRAMMING LANGUAGES,
Language Constructs, Data types and structures",
treatment = "T Theoretical or Mathematical",
}
@Article{Abi-Ezzi:1983:CSM,
author = "Salim S. Abi-Ezzi",
title = "Clarifications to the symbolic mode in {REDUCE}",
journal = j-SIGSAM,
volume = "17",
number = "3--4",
pages = "43--47",
month = aug # "\slash " # nov,
year = "1983",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4140 (Linear algebra)",
corpsource = "Dept. of Sci., Rensselaer Polytech. Inst., Troy, NY,
USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "67/68",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; algebraic mode; building; design; fundamental
data; languages; LISP; PASCAL like form; REDUCE; source
code; structures; symbolic expressions; symbolic mode;
system",
subject = "D.3.3 Software, PROGRAMMING LANGUAGES, Language
Constructs, Data types and structures \\ D.3.2
Software, PROGRAMMING LANGUAGES, Language
Classifications, Extensible languages \\ F.2.1 Theory
of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Numerical Algorithms and Problems,
Computations on polynomials \\ D.2.5 Software, SOFTWARE
ENGINEERING, Testing and Debugging, Debugging aids",
treatment = "T Theoretical or Mathematical",
xxtitle = "Clarifications to the symbolic mode in {REDUCE}",
}
@Article{Gonnet:1983:SGS,
author = "Gaston H. Gonnet and Bruce W. Char and Keith O.
Geddes",
title = "Solution of a general system of equations (problem)",
journal = j-SIGSAM,
volume = "17",
number = "3--4",
pages = "48--49",
month = aug # "\slash " # nov,
year = "1983",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4130 (Interpolation and function approximation)",
corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo,
Ont., Canada",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "67/68",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "design; equations; general solver; general system;
inverse; iteration formula; iterative methods; number;
performance; proving; reliability",
subject = "G.1.5 Mathematics of Computing, NUMERICAL ANALYSIS,
Roots of Nonlinear Equations, Iterative methods \\
G.1.5 Mathematics of Computing, NUMERICAL ANALYSIS,
Roots of Nonlinear Equations, Systems of equations",
treatment = "T Theoretical or Mathematical",
}
@Article{Abdali:1984:A,
author = "S. Kamal Abdali and Bruno Buchberger",
title = "Abstracts",
journal = j-SIGSAM,
volume = "18",
number = "1",
pages = "2--7",
month = feb,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{McGeer:1984:DIB,
author = "Patrick C. McGeer",
title = "A discussion and implementation of {Brown}'s {REX}
simplification algorithm",
journal = j-SIGSAM,
volume = "18",
number = "1",
pages = "10--19",
month = feb,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Electrical Engng. and Computer Sci., Univ. of
California, Berkeley, CA, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "69",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "Computation System; exponential expressions;
expressions; Maple Symbolic; normal form algorithm;
programming theory; rational; simplification algorithm;
University of Waterloo",
treatment = "T Theoretical or Mathematical",
}
@Article{Smith:1984:IPT,
author = "C. J. Smith",
title = "Implementation of a package of tools for manipulation
of sums",
journal = j-SIGSAM,
volume = "18",
number = "1",
pages = "20--24",
month = feb,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4240 (Programming and algorithm theory); C6100
(Software techniques and systems); C7310 (Mathematics
computing)",
corpsource = "Univ. of California, Berkeley, CA, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "69",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "computation system; formal mathematics; formal sums;
graphics; integer intervals; interactive computation;
mathematics; programming theory; prototype package;
software engineering; symbolic; transformations",
treatment = "A Application; P Practical",
}
@Article{Williamson:1984:TSS,
author = "Clifton {Williamson, Jr.}",
title = "{Taylor} series solutions of explicit {ODE}'s in a
strongly typed algebra system",
journal = j-SIGSAM,
volume = "18",
number = "1",
pages = "25--29",
month = feb,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4240 (Programming and algorithm theory)",
corpsource = "Univ. of California, Berkeley, CA, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "69",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra system; algebraic; explicit ODEs; hierarchical
typing; programming theory; strongly typed; system
building; Taylor series solutions; UC Berkeley",
treatment = "T Theoretical or Mathematical",
}
@Article{Rimey:1984:PSR,
author = "Ken Rimey",
title = "Problem section (rotating fluids): a system of
polynomial equations and a solution by an unusual
method",
journal = j-SIGSAM,
volume = "18",
number = "1",
pages = "30--32",
month = feb,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "B0290F (Interpolation and function approximation);
C4130 (Interpolation and function approximation)",
corpsource = "Univ. of California, Berkeley, CA, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "69",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebraic equations; determinant; equations;
polynomials; rotating fluids; third order polynomial",
treatment = "T Theoretical or Mathematical",
}
@Article{Huet:1984:FSC,
author = "G{\'e}rard Huet",
title = "The future of symbolic computation: mathematics versus
languages",
journal = j-SIGSAM,
volume = "18",
number = "2",
pages = "2--5",
month = may,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4240 (Programming and algorithm theory)",
corpsource = "INRIA, Le Chesnay, France",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "70",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithm theory; classical algorithm; computer
science; Inria projects; mathematical; mathematical
formulae; programming languages; programming theory;
proof theory; proofs; symbol manipulation; symbolic
computation; theory",
treatment = "G General Review",
}
@Article{Zippel:1984:FCA,
author = "Richard Zippel",
title = "The future of computer algebra",
journal = j-SIGSAM,
volume = "18",
number = "2",
pages = "6--7",
month = may,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C0200 (General computer topics); C1230 (Artificial
intelligence)",
corpsource = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "70",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "abstract language; algebraic algorithms; algebraic
manipulation; artificial intelligence; capturing domain
specific knowledge; computer algebra; engineering
problem solving systems; forecasting; problem solving;
strategies; symbol manipulation; technological; user
interface",
treatment = "G General Review",
}
@Article{Zassenhaus:1984:PSE,
author = "H. Zassenhaus",
title = "Position statement for {EUROCAL 85}: the efficiency of
mathematical models",
journal = j-SIGSAM,
volume = "18",
number = "2",
pages = "8--9",
month = may,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fateman:1984:MVF,
author = "Richard J. Fateman",
title = "My view of the future of symbolic and algebraic
computation",
journal = j-SIGSAM,
volume = "18",
number = "2",
pages = "10--11",
month = may,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C0200 (General computer topics); C6130 (Data handling
techniques)",
corpsource = "California Univ., Berkeley, CA, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "70",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebraic manipulation systems; artificial
intelligence; MACSYMA; symbol manipulation; symbolic
computation",
treatment = "G General Review",
}
@Article{deTrias:1984:NGS,
author = "Regina Llopis de Trias",
title = "A new generation of symbolic and algebraic computation
systems",
journal = j-SIGSAM,
volume = "18",
number = "2",
pages = "12--14",
month = may,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{LlopisdeTrias:1984:NGS,
author = "R. {Llopis de Trias}",
title = "A new generation of symbolic and algebraic computation
systems",
journal = j-SIGSAM,
volume = "18",
number = "2",
pages = "12--14",
month = may,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Thu Mar 20 16:02:15 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6130 (Data handling techniques)",
corpsource = "Simon Bolivar Univ., Caracas, Venezuela",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "70",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "artificial intelligence; standard specifications;
symbol manipulation; symbolic and algebraic
computation; symbolic computation; systems",
treatment = "G General Review",
}
@Article{Mora:1984:IBC,
author = "Ferdinando Mora and Lorenzo Robbiano",
title = "The interplay between commutative algebra and computer
algebra",
journal = j-SIGSAM,
volume = "18",
number = "2",
pages = "15--15",
month = may,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. of Math., Genova Univ., Italy",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "70",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; computational complexity; G-base; Buchberger;
algorithm; commutative algebra; computer; algebra;
Gr{\"o}bner bases",
treatment = "G General Review",
}
@Article{Lenstra:1984:FP,
author = "Arjen K. Lenstra",
title = "Factorization of polynomials",
journal = j-SIGSAM,
volume = "18",
number = "2",
pages = "16--18",
month = may,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra); C4130 (Interpolation and function
approximation); C4240 (Programming and algorithm
theory); C6130 (Data handling techniques)",
corpsource = "Centrum voor Wiskunde en Inf., Amsterdam,
Netherlands",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "70",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebraic computation; basis reduction algorithm;
computer algebra; factorization of polynomials;
polynomial-time algorithm; polynomial-time basis;
polynomials; reduction algorithm; symbol manipulation;
symbolic and",
treatment = "G General Review; T Theoretical or Mathematical",
}
@Article{Nievergelt:1984:CGO,
author = "J. Nievergelt",
title = "Computing with geometric objects",
journal = j-SIGSAM,
volume = "18",
number = "2",
pages = "19, 18",
month = may,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4240 (Programming and algorithm theory); C6130B
(Graphics techniques)",
corpsource = "ETH, Zurich, Switzerland",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "70",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithms analysis; CAD; computational complexity;
computational geometry; computer; computer graphics;
geometric objects; geometry; graphics",
treatment = "G General Review",
}
@Article{Davenport:1984:IFT,
author = "James Davenport",
title = "Integration in finite terms",
journal = j-SIGSAM,
volume = "18",
number = "2",
pages = "20--21",
month = may,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Trinks:1984:CNT,
author = "W. Trinks",
title = "Comments from number theory on computer algebra",
journal = j-SIGSAM,
volume = "18",
number = "2",
pages = "22--23",
month = may,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C0200 (General computer topics); C1110 (Algebra);
C1160 (Combinatorial mathematics)",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "70",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; computer algebra; number theory; numerical
calculations",
treatment = "G General Review",
}
@Article{Krishnamurthy:1984:FPC,
author = "E. V. Krishnamurthy",
title = "Functional programming with combinators for symbolic
computation",
journal = j-SIGSAM,
volume = "18",
number = "2",
pages = "24--24",
month = may,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C0200 (General computer topics); C6130 (Data handling
techniques)",
corpsource = "Indian Inst. of Sci., Bangalore, India",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "70",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "abstract algebraic; algebraic computation; artificial
intelligence; mathematical; reasoning; symbol
manipulation",
treatment = "G General Review",
}
@Article{Zimmer:1984:AAN,
author = "Horst G. Zimmer",
title = "Algorithms in algebraic number theory",
journal = j-SIGSAM,
volume = "18",
number = "2",
pages = "25--26",
month = may,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1160 (Combinatorial mathematics); C6130 (Data
handling techniques)",
corpsource = "Saarlandes Univ., Saarbrucken, West Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "70",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; algebraic computation; algebraic geometry;
algebraic number theory; algorithms; examples;
geometry; high speed computers; large scale; number
theory; symbol manipulation",
treatment = "G General Review",
}
@Article{Bibel:1984:LAC,
author = "Wolfgang Bibel",
title = "Logic and algebraic computation",
journal = j-SIGSAM,
volume = "18",
number = "2",
pages = "26--26",
month = may,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra); C4210 (Formal logic); C6130 (Data
handling techniques)",
corpsource = "Tech. Univ. Munchen, West Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "70",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; algebraic computation; computational logic;
formal logic; symbol manipulation",
treatment = "G General Review",
}
@Article{vanHulzen:1984:SNI,
author = "J. A. van Hulzen",
title = "The symbolic-numeric interface",
journal = j-SIGSAM,
volume = "18",
number = "2",
pages = "27--28",
month = may,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6130 (Data handling techniques)",
corpsource = "Dept. of Comput. Sci., Twente Univ. of Technol.,
Enschede, Netherlands",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "70",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; algebraic; computation; computer algebra;
human factors; symbol manipulation; symbolic
computation",
treatment = "G General Review",
}
@Article{Balaban:1984:NNN,
author = "Alexandru T. Balaban",
title = "Numerical and non-numerical methods in chemistry:
present and future",
journal = j-SIGSAM,
volume = "18",
number = "2",
pages = "29--30",
month = may,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1160 (Combinatorial mathematics); C4100 (Numerical
analysis)C7320 (Physics and chemistry computing)",
corpsource = "Dept. of Organic Chem., Polytech. Inst., Bucharest,
Romania",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "70",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "calculating properties of molecules; chemistry;
chemistry computing; graph theoretical; graph theory;
methods; molecular mechanics; nonnumerical; numerical;
numerical computations; theoretical chemistry",
treatment = "G General Review",
}
@Article{Bose:1984:SAC,
author = "N. K. Bose",
title = "Symbolic and algebraic computations in
multidimensional systems theory",
journal = j-SIGSAM,
volume = "18",
number = "2",
pages = "31--32",
month = may,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1340J (Distributed parameter control systems)",
corpsource = "Pittsburgh Univ., PA, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "70",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; algebraic computations; multidimensional
systems; multidimensional systems theory; symbol
manipulation; symbolic computations; system theory;
temporal variable",
treatment = "G General Review",
}
@Article{Legendi:1984:CHS,
author = "T. Legendi",
title = "Cellular hardware and symbolic computation",
journal = j-SIGSAM,
volume = "18",
number = "2",
pages = "33--33",
month = may,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Luneburg:1984:WB,
author = "Heinz L{\"u}neburg",
title = "Write a book!",
journal = j-SIGSAM,
volume = "18",
number = "2",
pages = "34--34",
month = may,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Smith:1984:PPR,
author = "Carolyn J. Smith",
title = "Procedures for polynomial and rational function
recognition",
journal = j-SIGSAM,
volume = "18",
number = "3",
pages = "2--4",
month = aug,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "B0290D (Functional analysis); B0290F (Interpolation
and function approximation); C4120 (Functional
analysis); C4130 (Interpolation and function
approximation)",
corpsource = "California Univ., Berkeley, CA, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "71",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "functional analysis; iterative methods; polynomial;
polynomials; rational function recognition",
treatment = "T Theoretical or Mathematical",
}
@Article{Gebauer:1984:NSG,
author = "R. Gebauer and H. Kredel",
title = "Note on ``solution of a general system of
equations''",
journal = j-SIGSAM,
volume = "18",
number = "3",
pages = "5--6",
month = aug,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Trinks:1984:IAR,
author = "W. Trinks",
title = "On improving approximate results of {Buchberger}'s
algorithm by {Newton}'s method",
journal = j-SIGSAM,
volume = "18",
number = "3",
pages = "7--11",
month = aug,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "B0290F (Interpolation and function approximation);
C4130 (Interpolation and function approximation)",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "71",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "arithmetics; Buchberger's algorithm; function
approximation; iterative methods; multiple precision;
Newton's method",
treatment = "T Theoretical or Mathematical",
}
@Article{Kryukov:1984:ARL,
author = "A. P. Kryukov",
title = "An Antitranslator of the {RLISP} Language",
journal = j-SIGSAM,
volume = "18",
number = "3",
pages = "12--15",
month = aug,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6140D (High level languages); C6150C (Compilers,
interpreters and other processors)",
corpsource = "Inst. of Nucl. Phys., Moscow State Univ., USSR",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "71",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "antitranslator; language; LISP; program interpreters;
RECONSTRUCTOR program; REDUCE system language; RLISP
language",
treatment = "P Practical",
}
@Article{Rodionov:1984:WNC,
author = "A. Ya. Rodionov",
title = "Work with non-commutative variables in the {Reduce-2}
system for analytical calculations",
journal = j-SIGSAM,
volume = "18",
number = "3",
pages = "16--19",
month = aug,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6140D (High level languages); C7310 (Mathematics
computing)",
corpsource = "Inst. of Nucl. Phys., Moscow State Univ., USSR",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "71",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "analytical calculations; commutation rules; delta
functions; high level languages; Kronecker symbols;
mathematics; program package; Reduce-2 system",
treatment = "P Practical",
}
@Article{Zwillinger:1984:CP,
author = "Daniel Zwillinger",
title = "Completing the {$L$-th} power in {$ Z[x]$}",
journal = j-SIGSAM,
volume = "18",
number = "3",
pages = "20--22",
month = aug,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Winkler:1984:CRP,
author = "Franz Winkler",
title = "The {Church--Rosser} property in computer algebra and
special theorem proving: an investigation of
critical-pair\slash completion algorithms ({Ph.D.}
thesis)",
journal = j-SIGSAM,
volume = "18",
number = "3",
pages = "22--22",
month = aug,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lassner:1984:RNC,
author = "W. Lassner",
title = "Report on a national computer algebra workshop in
{Leipzig}",
journal = j-SIGSAM,
volume = "18",
number = "3",
pages = "22--23",
month = aug,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wise:1984:RMQ,
author = "David S. Wise",
title = "Representing matrices as quadtrees for parallel
processors: extended abstract",
journal = j-SIGSAM,
volume = "18",
number = "3",
pages = "24--25",
month = aug,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Abdali:1984:ACA,
author = "S. Kamal Abdali",
title = "Abstracts of computer algebra papers from 1984
national meeting of {American Chemical Society}",
journal = j-SIGSAM,
volume = "18",
number = "3",
pages = "26--30",
month = aug,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Oren:1984:FSA,
author = "Tuncer I. {\"O}ren",
title = "A forum for the synergy of {ACM} special interest
groups",
journal = j-SIGSAM,
volume = "18",
number = "3",
pages = "31--32",
month = aug,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "??",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:1984:PSM,
author = "Anonymous",
title = "Papers from {Symbolic Mathematical Systems and Their
Effects on the Curriculum --- International Congress on
Mathematical Education}",
journal = j-SIGSAM,
volume = "18",
number = "4",
pages = "1--62",
month = nov # "\slash " # feb,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Jan 6 12:34:09 MST 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/magma.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Issue labeled vol. 18, no. 4, November 1984 (issue
\#72) and vol. 19, no. 1, February 1985 (issue \#73).",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classification = "C0220 (Computing education and training); C7310
(Mathematics computing); C7810C (Computer-aided
instruction)",
conflocation = "Adelaide, SA, Australia; 24-30 Aug. 1984",
conftitle = "Papers from Symbolic Mathematical Systems and Their
Effects on the Curriculum --- International Congress on
Mathematical Education",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "72/73",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebraic; algebraic algorithms; algorithms; Austrian
schools; CAMP; Cayley; classroom experiences;
complexity issues; computation; computer aided
instruction; computer aided vector algebra; computer
aided vector algebra system; computer algebra;
computer-based-tools; congruent number; education; high
schools; interactive formula; interactive formula
manipulation; manipulation; maths education; muMath;
self explanatory symbolic; self explanatory symbolic
computation; symbol manipulation; symbolic computation;
symbolic mathematics; system; teaching; teaching group
theory; teaching project; undergraduate studies;
University of Linz",
}
@Article{Aspetsberger:1984:EMA,
author = "K. Aspetsberger and G. Funk",
title = "Experiments with {MuMath} in {Austrian} high schools",
journal = j-SIGSAM,
volume = "18--19",
number = "4--1",
pages = "4--7",
month = nov # "\slash " # feb,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6130 (Data handling techniques); C7310 (Mathematics
computing); C7810C (Computer-aided instruction)",
conflocation = "Adelaide, SA, Australia; 24-30 Aug. 1984",
conftitle = "Papers from Symbolic Mathematical Systems and Their
Effects on the Curriculum --- International Congress on
Mathematical Education",
corpsource = "Inst. fur Math., Johannes Kepler Univ., Linz,
Austria",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "72/73",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithms; analytic geometry; Austrian high schools;
computer aided instruction; computer algebra systems;
education; experimentation; functional programming
style; geometry; microcomputer applications; muMATH;
programming; secondary; symbol manipulation; symbolic;
transformations",
remark = "Issue labeled vol. 18, no. 4, November 1984 (issue
\#72) and vol. 19, no. 1, February 1985 (issue \#73).",
subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS,
General, Computer arithmetic \\ D.1 Software,
PROGRAMMING TECHNIQUES, Applicative (Functional)
Programming \\ K.3.2 Computing Milieux, COMPUTERS AND
EDUCATION, Computer and Information Science Education,
Curriculum \\ F.3.3 Theory of Computation, LOGICS AND
MEANINGS OF PROGRAMS, Studies of Program Constructs,
Program and recursion schemes",
treatment = "X Experimental",
}
@Article{Buchberger:1984:CTP,
author = "B. Buchberger",
title = "{CAMP}: a teaching project in symbolic computation at
the {University of Linz}",
journal = j-SIGSAM,
volume = "18--19",
number = "4--1",
pages = "8--9",
month = nov # "\slash " # feb,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C0220 (Computing education and training); C7310
(Mathematics computing); C7810C (Computer-aided
instruction)",
conflocation = "Adelaide, SA, Australia; 24-30 Aug. 1984",
conftitle = "Papers from Symbolic Mathematical Systems and Their
Effects on the Curriculum --- International Congress on
Mathematical Education",
corpsource = "Inst. for Math., Linz Univ., Austria",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "72/73",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithms; automatic programming; CAMP; computational
logic; computer algebra; computer science; computer
science education; Computer-Aided; design; educational
courses; graduate; manipulation; Mathematical Problem
Solving; mathematics; students; symbol; symbolic
computation; teaching project; verification",
remark = "Issue labeled vol. 18, no. 4, November 1984 (issue
\#72) and vol. 19, no. 1, February 1985 (issue \#73).",
subject = "K.3.2 Computing Milieux, COMPUTERS AND EDUCATION,
Computer and Information Science Education, Curriculum
\\ F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND
FORMAL LANGUAGES, Mathematical Logic, Computational
logic",
treatment = "G General Review",
}
@Article{Calmet:1984:ICA,
author = "Jacques Calmet",
title = "Introducing computer algebra to users and to
students",
journal = j-SIGSAM,
volume = "18--19",
number = "4--1",
pages = "10--14",
month = nov # "\slash " # feb,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6130 (Data handling techniques); C7310 (Mathematics
computing); C7320 (Physics and chemistry computing)",
classification = "C6130 (Data handling techniques); C7310 (Mathematics
computing); C7320 (Physics and chemistry computing)",
conflocation = "Adelaide, SA, Australia; 24-30 Aug. 1984",
conftitle = "Papers from Symbolic Mathematical Systems and Their
Effects on the Curriculum --- International Congress on
Mathematical Education",
corpsource = "LIFIA/ENSIMAG, Grenoble, France",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "72/73",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "computational tool; computer aided instruction;
Computer Algebra; design; education; educational aids;
mathematical systems; physics computing; symbol
manipulation; symbolic; symbolic mathematical systems;
teaching aid; theoretical physicists; undergraduate
level",
pubcountry = "USA A03",
remark = "Issue labeled vol. 18, no. 4, November 1984 (issue
\#72) and vol. 19, no. 1, February 1985 (issue \#73).",
subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS,
General, Computer arithmetic \\ K.3.2 Computing
Milieux, COMPUTERS AND EDUCATION, Computer and
Information Science Education, Curriculum",
treatment = "G General Review",
}
@Article{Cannon:1984:CTG,
author = "John J. Cannon and Jim Richardson",
title = "{Cayley}: teaching group theory by computer",
journal = j-SIGSAM,
volume = "18--19",
number = "4--1",
pages = "15--18",
month = nov # "\slash " # feb,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/magma.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra); C1160 (Combinatorial mathematics);
C7310 (Mathematics computing); C7810C (Computer-aided
instruction)",
classification = "C1110 (Algebra); C1160 (Combinatorial mathematics);
C7310 (Mathematics computing); C7810C (Computer-aided
instruction)",
conflocation = "Adelaide, SA, Australia; 24-30 Aug. 1984",
conftitle = "Papers from Symbolic Mathematical Systems and Their
Effects on the Curriculum --- International Congress on
Mathematical Education",
corpsource = "Dept of Pure Math., Sydney Univ., NSW, Australia",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "72/73",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "CAI; calculator; computer aided instruction;
courseware; design; group theory; manipulation;
mathematical objects; problem library; problems file;
Pure Mathematics; routine calculation; symbol; symbol
manipulation; teaching; theory; tutorial computer
programs",
pubcountry = "USA A04",
remark = "Issue labeled vol. 18, no. 4, November 1984 (issue
\#72) and vol. 19, no. 1, February 1985 (issue \#73).",
subject = "G.2 Mathematics of Computing, DISCRETE MATHEMATICS,
Miscellaneous \\ J.2 Computer Applications, PHYSICAL
SCIENCES AND ENGINEERING, Mathematics and statistics
\\
K.3.2 Computing Milieux, COMPUTERS AND EDUCATION,
Computer and Information Science Education,
Curriculum",
treatment = "G General Review",
}
@Article{Hosack:1984:RUS,
author = "John Hosack and Kenneth Lane and Donald Small",
title = "Report on the use of a symbolic mathematics system in
undergraduate instruction",
journal = j-SIGSAM,
volume = "18--19",
number = "4--1",
pages = "19--22",
month = nov # "\slash " # feb,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics computing); C7810C (Computer-aided
instruction)",
classification = "C7310 (Mathematics computing); C7810C
(Computer-aided instruction)",
conflocation = "Adelaide, SA, Australia; 24-30 Aug. 1984",
conftitle = "Papers from Symbolic Mathematical Systems and Their
Effects on the Curriculum --- International Congress on
Mathematical Education",
corpsource = "Colby Coll., Waterville, ME, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "72/73",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "advantages; algorithms; calculus; complex variables;
computer aided instruction; experimentation; MACSYMA;
numerical analysis; symbol manipulation; symbolic
mathematics system; undergraduate instruction",
pubcountry = "USA A05",
remark = "Issue labeled vol. 18, no. 4, November 1984 (issue
\#72) and vol. 19, no. 1, February 1985 (issue \#73).",
subject = "J.2 Computer Applications, PHYSICAL SCIENCES AND
ENGINEERING, Mathematics and statistics \\ D.4.0
Software, OPERATING SYSTEMS, General, UNIX",
treatment = "G General Review",
}
@Article{Lichtenberger:1984:SES,
author = "F. Lichtenberger",
title = "Self-explanatory symbolic computation for math
education",
journal = j-SIGSAM,
volume = "18--19",
number = "4--1",
pages = "23--24",
month = nov # "\slash " # feb,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6130 (Data handling techniques); C7810C
(Computer-aided instruction)",
classification = "C6130 (Data handling techniques); C7810C
(Computer-aided instruction)",
conflocation = "Adelaide, SA, Australia; 24-30 Aug. 1984",
conftitle = "Papers from Symbolic Mathematical Systems and Their
Effects on the Curriculum --- International Congress on
Mathematical Education",
corpsource = "Inst. fur Math., Johannes Kepler Univ., Linz,
Austria",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "72/73",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "computer aided instruction; computer algebra; computer
algebra systems; design; expert systems; manipulation;
math education; mathematics education; methods; self
explanatory; solution; solution methods; symbol; symbol
manipulation; symbolic computation; systems",
pubcountry = "USA A06",
remark = "Issue labeled vol. 18, no. 4, November 1984 (issue
\#72) and vol. 19, no. 1, February 1985 (issue \#73).",
subject = "J.2 Computer Applications, PHYSICAL SCIENCES AND
ENGINEERING, Mathematics and statistics \\ K.3.1
Computing Milieux, COMPUTERS AND EDUCATION, Computer
Uses in Education, Computer-assisted instruction
(CAI)",
treatment = "G General Review",
}
@Article{Lounesto:1984:CAV,
author = "Pertti Lounesto",
title = "A computer-aided vector algebra system for use in high
schools",
journal = j-SIGSAM,
volume = "18--19",
number = "4--1",
pages = "25--25",
month = nov # "\slash " # feb,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6130 (Data handling techniques); C7310 (Mathematics
computing); C7810C (Computer-aided instruction)",
classification = "C6130 (Data handling techniques); C7310 (Mathematics
computing); C7810C (Computer-aided instruction)",
conflocation = "Adelaide, SA, Australia; 24-30 Aug. 1984",
conftitle = "Papers from Symbolic Mathematical Systems and Their
Effects on the Curriculum --- International Congress on
Mathematical Education",
corpsource = "Inst. of Math., Helsinki Univ. of Technol., Espoo,
Finland",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "72/73",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "CLICAL; complex numbers; computer; computer aided
instruction; computer program; computer-aided vector
algebra system; design; formulas; high schools;
program; symbol manipulation",
pubcountry = "USA A07",
remark = "Issue labeled vol. 18, no. 4, November 1984 (issue
\#72) and vol. 19, no. 1, February 1985 (issue \#73).",
subject = "J.2 Computer Applications, PHYSICAL SCIENCES AND
ENGINEERING, Mathematics and statistics \\ K.3.1
Computing Milieux, COMPUTERS AND EDUCATION, Computer
Uses in Education, Computer-assisted instruction
(CAI)",
treatment = "P Practical",
}
@Article{Miola:1984:CIA,
author = "Alfonso Miola",
title = "Complexity issues in algebraic algorithms: relevant
topics for mathematical education",
journal = j-SIGSAM,
volume = "18--19",
number = "4--1",
pages = "26--30",
month = nov # "\slash " # feb,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4240 (Programming and algorithm theory); C6130 (Data
handling techniques); C7310 (Mathematics computing);
C7810C (Computer-aided instruction)",
classification = "C4240 (Programming and algorithm theory); C6130
(Data handling techniques); C7310 (Mathematics
computing); C7810C (Computer-aided instruction)",
conflocation = "Adelaide, SA, Australia; 24-30 Aug. 1984",
conftitle = "Papers from Symbolic Mathematical Systems and Their
Effects on the Curriculum --- International Congress on
Mathematical Education",
corpsource = "Istituto di Analisi dei Sistemi ed Inf., Roma, Italy",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "72/73",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "abstraction; algebraic algorithms; algorithm;
algorithm design methodology; algorithms; complexity
analysis; computation; computation complexity analysis;
computational analysis; computational complexity;
computer aided instruction; design methodology;
manipulation; mathematical education; symbol; symbol
manipulation",
pubcountry = "USA A08",
remark = "Issue labeled vol. 18, no. 4, November 1984 (issue
\#72) and vol. 19, no. 1, February 1985 (issue \#73).",
subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION,
Algorithms, Algebraic algorithms \\ K.3.1 Computing
Milieux, COMPUTERS AND EDUCATION, Computer Uses in
Education, Computer-assisted instruction (CAI)",
treatment = "G General Review; P Practical",
}
@Article{Ollongren:1984:CEI,
author = "Alexander Ollongren",
title = "Classroom experience with interactive formula
manipulation",
journal = j-SIGSAM,
volume = "18--19",
number = "4--1",
pages = "31--37",
month = nov # "\slash " # feb,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6130 (Data handling techniques); C7310 (Mathematics
computing); C7810C (Computer-aided instruction)",
classification = "C6130 (Data handling techniques); C7310 (Mathematics
computing); C7810C (Computer-aided instruction)",
conflocation = "Adelaide, SA, Australia; 24-30 Aug. 1984",
conftitle = "Papers from Symbolic Mathematical Systems and Their
Effects on the Curriculum --- International Congress on
Mathematical Education",
corpsource = "Inst. of Appl. Math. and Comput. Sci., Leiden Univ.,
Netherlands",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "72/73",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "73; classroom situations; computer aided instruction;
design; FORMAC-; FORMAC- 73; high level languages;
interactive formula manipulator; languages;
manipulation; multivariate polynomials; symbol; symbol
manipulation; truncated Poisson-series",
pubcountry = "USA A09",
remark = "Issue labeled vol. 18, no. 4, November 1984 (issue
\#72) and vol. 19, no. 1, February 1985 (issue \#73).",
subject = "D.3.2 Software, PROGRAMMING LANGUAGES, Language
Classifications, ALGOL-68 \\ G.1.5 Mathematics of
Computing, NUMERICAL ANALYSIS, Roots of Nonlinear
Equations, Polynomials, methods for \\ K.3.1 Computing
Milieux, COMPUTERS AND EDUCATION, Computer Uses in
Education, Computer-assisted instruction (CAI)",
treatment = "P Practical",
}
@Article{Pearce:1984:ICB,
author = "P. D. Pearce",
title = "The introduction of a computer-based tool for solving
mathematical problems analytically to an undergraduate
course",
journal = j-SIGSAM,
volume = "18--19",
number = "4--1",
pages = "38--39",
month = nov # "\slash " # feb,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C0220 (Computing education and training); C7310
(Mathematics computing); C7810C (Computer-aided
instruction)",
classification = "C0220 (Computing education and training); C7310
(Mathematics computing); C7810C (Computer-aided
instruction)",
conflocation = "Adelaide, SA, Australia; 24-30 Aug. 1984",
conftitle = "Papers from Symbolic Mathematical Systems and Their
Effects on the Curriculum --- International Congress on
Mathematical Education",
corpsource = "Dept. of Inf. Syst. Design., Kingston Polytech., UK",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "72/73",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "computer aided instruction; computer science
education; design; Information Systems Design; symbol
manipulation",
pubcountry = "USA A10",
remark = "Issue labeled vol. 18, no. 4, November 1984 (issue
\#72) and vol. 19, no. 1, February 1985 (issue \#73).",
subject = "K.3.1 Computing Milieux, COMPUTERS AND EDUCATION,
Computer Uses in Education, Computer-assisted
instruction (CAI) \\ J.2 Computer Applications,
PHYSICAL SCIENCES AND ENGINEERING, Mathematics and
statistics \\ I.1.3 Computing Methodologies, ALGEBRAIC
MANIPULATION, Languages and Systems, Special-purpose
algebraic systems",
treatment = "G General Review",
}
@Article{Stoutemyer:1984:RPC,
author = "David R. Stoutemyer",
title = "A radical proposal for computer algebra in education",
journal = j-SIGSAM,
volume = "18--19",
number = "4--1",
pages = "40--53",
month = nov # "\slash " # feb,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7810C (Computer-aided instruction)",
classification = "C7810C (Computer-aided instruction)",
conflocation = "Adelaide, SA, Australia; 24-30 Aug. 1984",
conftitle = "Papers from Symbolic Mathematical Systems and Their
Effects on the Curriculum --- International Congress on
Mathematical Education",
corpsource = "Dept. of Electr. Eng., Hawaii Univ., Honolulu, HI,
USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "72/73",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "computer aided instruction; computer algebra; design;
differentiating; education; factoring; integrating;
math curriculum; mathematical operations; nonnumeric;
nonnumeric mathematical operations; rational
arithmetic; symbol manipulation; symbolically;
symbolically integrating",
pubcountry = "USA A11",
remark = "Issue labeled vol. 18, no. 4, November 1984 (issue
\#72) and vol. 19, no. 1, February 1985 (issue \#73).",
subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS,
General, Computer arithmetic \\ K.3.1 Computing
Milieux, COMPUTERS AND EDUCATION, Computer Uses in
Education, Computer-assisted instruction (CAI) \\ K.3.2
Computing Milieux, COMPUTERS AND EDUCATION, Computer
and Information Science Education, Curriculum",
treatment = "G General Review; P Practical",
}
@Article{Zimmer:1984:CNE,
author = "H. G. Zimmer",
title = "Congruent numbers --- from elementary to algebraic
number theory",
journal = j-SIGSAM,
volume = "18--19",
number = "4--1",
pages = "54--62",
month = nov # "\slash " # feb,
year = "1984",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1160 (Combinatorial mathematics); C7310 (Mathematics
computing); C7810C (Computer-aided instruction)",
classification = "C1160 (Combinatorial mathematics); C7310
(Mathematics computing); C7810C (Computer-aided
instruction)",
conflocation = "Adelaide, SA, Australia; 24-30 Aug. 1984",
conftitle = "Papers from Symbolic Mathematical Systems and Their
Effects on the Curriculum --- International Congress on
Mathematical Education",
corpsource = "Saarlandes Univ., Saarbrucken, West Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "72/73",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebraic number theory; congruent numbers; education;
number theory; theory; verification",
pubcountry = "USA A12",
remark = "Issue labeled vol. 18, no. 4, November 1984 (issue
\#72) and vol. 19, no. 1, February 1985 (issue \#73).",
subject = "J.2 Computer Applications, PHYSICAL SCIENCES AND
ENGINEERING, Mathematics and statistics \\ G.1
Mathematics of Computing, NUMERICAL ANALYSIS,
Miscellaneous",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Gebauer:1985:RSS,
author = "R. Gebauer and H. Kredel",
title = "Real Solution System for Algebraic Equations. An
algorithm system for constructing finite inclusions of
zero sets of algebraic equations",
journal = j-SIGSAM,
volume = "19",
number = "2",
pages = "2--2",
month = may,
year = "1985",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Thu Mar 20 16:02:15 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra); C7310 (Mathematics computing)",
corpsource = "Inst. fur Angewandte Math., Heidelberg Univ., West
Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "74",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "ALDES; algebra; algorithm description language;
algorithm system; BAS; Buchberger; equations;
polynomials; real solution system for algebraic
equations; RS",
treatment = "P Practical",
}
@Article{McIsaac:1985:PMA,
author = "Kevin McIsaac",
title = "Pattern matching algebraic identities",
journal = j-SIGSAM,
volume = "19",
number = "2",
pages = "4--13",
month = may,
year = "1985",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4240 (Programming and algorithm theory); C6140
(Programming languages)",
corpsource = "Western Australia Univ., Crawley, WA, Australia",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "74",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebraic identities; algorithmic languages;
algorithms; function; identity; matching process;
notational extension; pattern matching; programming
theory; scaling behaviour; theory",
subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Pattern matching \\ I.5.1 Computing
Methodologies, PATTERN RECOGNITION, Models,
Deterministic \\ D.3.3 Software, PROGRAMMING LANGUAGES,
Language Constructs, Coroutines",
treatment = "P Practical",
}
@Article{Butler:1985:ICA,
author = "Gregory Butler",
title = "An improvement to the centralizer algorithm for
permutation groups",
journal = j-SIGSAM,
volume = "19",
number = "2",
pages = "14--18",
month = may,
year = "1985",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4240 (Programming and algorithm theory)",
corpsource = "Basser Dept. of Comput. Sci., Sydney Univ., NSW,
Australia",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "74",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithm; algorithm theory; algorithms; centralizer
algorithm; centralizer of an; element; permutation
group; Sims",
subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sorting and searching \\ F.2.1 Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Numerical Algorithms and Problems,
Computations on matrices",
treatment = "P Practical",
}
@Article{Golden:1985:DUF,
author = "Jeffrey P. Golden",
title = "Differentiation of unknown functions in {Macsyma}",
journal = j-SIGSAM,
volume = "19",
number = "2",
pages = "19--24",
month = may,
year = "1985",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4160 (Numerical integration and differentiation)",
corpsource = "GTE Labs. Inc., Waltham, MA, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "74",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithms; differentiation; functions; MACSYMA;
unknown functions",
subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sorting and searching \\ G.2.1 Mathematics of
Computing, DISCRETE MATHEMATICS, Combinatorics,
Generating functions",
treatment = "T Theoretical or Mathematical",
}
@Article{Fateman:1985:EPS,
author = "Richard J. Fateman",
title = "Eleven proofs of $ \sin^2 x + \cos^2 x = 1 $",
journal = j-SIGSAM,
volume = "19",
number = "2",
pages = "25--28",
month = may,
year = "1985",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6130 (Data handling techniques)",
corpsource = "California Univ., Berkeley, CA, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "74",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; algebraic; algebraic manipulation;
algorithms; general substitution problem; identity;
MACSYMA; manipulation system; programming theory;
proofs; sin/sup 2/; symbol manipulation; x+cos/sup 2/
x",
subject = "F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Numerical Algorithms and
Problems, Number-theoretic computations",
treatment = "T Theoretical or Mathematical",
}
@Article{Mazzarella:1985:ISO,
author = "Giuseppe Mazzarella",
title = "Improved simplification of odd and even functions in
{REDUCE}",
journal = j-SIGSAM,
volume = "19",
number = "2",
pages = "29--30",
month = may,
year = "1985",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6150C (Compilers, interpreters and other
processors)",
corpsource = "Dipartiments Ingegneria Elettronica, Napoli, Italy",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "74",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; argument; design; even functions; functions;
interpreters; odd functions; program; program
interpreters; REDUCE; simplification; standard form;
symmetry of functions",
subject = "I.1.1 Computing Methodologies, ALGEBRAIC MANIPULATION,
Expressions and Their Representation, Simplification of
expressions \\ I.1 Computing Methodologies, ALGEBRAIC
MANIPULATION, Languages and Systems",
treatment = "P Practical",
}
@Article{Abbott:1985:RF,
author = "J. A. Abbott and R. J. Bradford and J. H. Davenport",
title = "A remark on factorisation",
journal = j-SIGSAM,
volume = "19",
number = "2",
pages = "31--33, 37",
month = may,
year = "1985",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4130 (Interpolation and function approximation);
C4240 (Programming and algorithm theory)",
corpsource = "Sch. of Math., Bath Univ., UK",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "74",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; algebraic extensions; algorithm theory;
algorithms; combinatorial explosion; divisibility
tests; experimentation; factoring polynomials;
factorisation; integers; norm polynomial; polynomials;
prime; profusely modulo; rationals; trial divisions",
subject = "F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Numerical Algorithms and
Problems, Computations on polynomials \\ G.2.1
Mathematics of Computing, DISCRETE MATHEMATICS,
Combinatorics, Combinatorial algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Kryukov:1985:DDS,
author = "A. P. Kryukov and A. Ya. Rodionov",
title = "Dynamic-debugging system for the {REDUCE} programs",
journal = j-SIGSAM,
volume = "19",
number = "2",
pages = "34--37",
month = may,
year = "1985",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6140D (High level languages); C6150G (Diagnostic,
testing, debugging and evaluating systems)",
corpsource = "Inst. of Nucl. Phys., Moscow State Univ., USSR",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "74",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "debugger; design; dynamic-debugging system;
evaluation; high level languages; input language;
languages; LISP; operational experience; program
debugging; RLISP",
subject = "D.2.5 Software, SOFTWARE ENGINEERING, Testing and
Debugging, Debugging aids \\ D.3.3 Software,
PROGRAMMING LANGUAGES, Language Constructs,
Input/Output \\ D.3.2 Software, PROGRAMMING LANGUAGES,
Language Classifications, LISP",
treatment = "P Practical",
}
@Article{Fateman:1985:CS,
author = "Richard J. Fateman",
title = "Comments on {SMP}",
journal = j-SIGSAM,
volume = "19",
number = "3",
pages = "5--7",
month = aug,
year = "1985",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics computing)",
corpsource = "California Univ., Berkeley, CA, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "75",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; algorithms; bugs; design; indefinite;
integration; limits; polynomial; power series; program
debugging; singularities; SMP algebra system; software
packages; version 1.3.7",
subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS,
General, Computer arithmetic \\ F.2.1 Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Numerical Algorithms and Problems,
Computations on polynomials",
treatment = "P Practical",
}
@Article{Marti:1985:RLB,
author = "Jed B. Marti and Anthony C. Hearn",
title = "{REDUCE} as a {Lisp} benchmark",
journal = j-SIGSAM,
volume = "19",
number = "3",
pages = "8--16",
month = aug,
year = "1985",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C5470 (Performance evaluation and testing); C6150G
(Diagnostic, testing, debugging and evaluating
systems); C7310 (Mathematics computing)",
corpsource = "Rand Corp., Santa Monica, CA, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "75",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; computer testing; execution times; languages;
LISP; LISP benchmark; LISP systems; machine
architectures; performance; processor performance;
program testing; REDUCE test program",
subject = "G.1.3 Mathematics of Computing, NUMERICAL ANALYSIS,
Numerical Linear Algebra, Matrix inversion \\ C.0
Computer Systems Organization, GENERAL, System
architectures \\ D.3.2 Software, PROGRAMMING LANGUAGES,
Language Classifications, LISP \\ G.1.0 Mathematics of
Computing, NUMERICAL ANALYSIS, General, Computer
arithmetic \\ F.3.3 Theory of Computation, LOGICS AND
MEANINGS OF PROGRAMS, Studies of Program Constructs,
Program and recursion schemes",
treatment = "P Practical",
}
@Article{Leler:1985:IGI,
author = "Wm Leler and Neil Soiffer",
title = "An interactive graphical interface for {Reduce}",
journal = j-SIGSAM,
volume = "19",
number = "3",
pages = "17--23",
month = aug,
year = "1985",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6130B (Graphics techniques); C7310 (Mathematics
computing)",
corpsource = "Comput. Res. Lab., Tektronix Inc., Beaverton, OR,
USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "75",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; algebra systems; bit-mapped displays;
computer graphics; design; economics; human factors;
interactive graphical interface; interactive systems;
mathematical expressions; REDUCE; workstation",
subject = "I.3.6 Computing Methodologies, COMPUTER GRAPHICS,
Methodology and Techniques, Interaction techniques \\
I.3.1 Computing Methodologies, COMPUTER GRAPHICS,
Hardware architecture, Input devices \\ D.2.3 Software,
SOFTWARE ENGINEERING, Coding, Pretty printers \\ D.3.2
Software, PROGRAMMING LANGUAGES, Language
Classifications, Very high-level languages",
treatment = "P Practical",
}
@Article{Gates:1985:GAC,
author = "Barbara L. Gates",
title = "{GENTRAN}: an automatic code generation facility for
{REDUCE}",
journal = j-SIGSAM,
volume = "19",
number = "3",
pages = "24--42",
month = aug,
year = "1985",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/redextra.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib;
Theory/reduce.bib; Theory/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6115 (Programming support); C6150C (Compilers,
interpreters and other processors); C7310 (Mathematics
computing)",
corpsource = "Dept. of Comput. Sci., Twente Univ. of Technol.,
Enschede, Netherlands",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "75",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; algebra package; algorithms; application
generators; assignment; automatic code generation; code
optimizer; design; expression; file handling; GENTRAN;
languages; numerical programs; program interpreters;
REDUCE; RLISP; segmentation facility; statements;
template files; translation package",
subject = "D.3.4 Software, PROGRAMMING LANGUAGES, Processors,
Code generation \\ D.3.3 Software, PROGRAMMING
LANGUAGES, Language Constructs, Control structures \\
D.3.3 Software, PROGRAMMING LANGUAGES, Language
Constructs, Procedures, functions, and subroutines \\
D.3.2 Software, PROGRAMMING LANGUAGES, Language
Classifications, FORTRAN \\ G.1 Mathematics of
Computing, NUMERICAL ANALYSIS, Optimization",
treatment = "P Practical",
}
@Article{Kryukov:1985:IR,
author = "A. P. Kryukov and A. Ya. Rodinov",
title = "Interactive {REDUCE}",
journal = j-SIGSAM,
volume = "19",
number = "3",
pages = "43--45",
month = aug,
year = "1985",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics computing)",
corpsource = "Inst. of Nucl. Phys., Moscow State Univ., USSR",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "75",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; algebra system; design; interactive mode;
interactive systems; REDUCE-2; reliability; software
packages",
subject = "D.4.7 Software, OPERATING SYSTEMS, Organization and
Design, Interactive systems \\ G.1.0 Mathematics of
Computing, NUMERICAL ANALYSIS, General, Computer
arithmetic \\ D.2.5 Software, SOFTWARE ENGINEERING,
Testing and Debugging, Diagnostics \\ D.4.2 Software,
OPERATING SYSTEMS, Storage Management, Main memory",
treatment = "P Practical",
}
@Article{Caprasse:1985:NUO,
author = "H. Caprasse and M. Hans",
title = "A new use of operators in the algebraic mode of
{REDUCE}",
journal = j-SIGSAM,
volume = "19",
number = "3",
pages = "46--52",
month = aug,
year = "1985",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics computing)",
corpsource = "Inst. de Phys. au Sart Tilman, Liege Univ., Belgium",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "75",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; algebraic language; bag; calculus; design;
IBM 4341/2; languages; performance; property; REDUCE
algebra system; software packages; tensor calculus;
version 3.0; version 3.1",
subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND
FORMAL LANGUAGES, Formal Languages, Algebraic language
theory \\ D.4.7 Software, OPERATING SYSTEMS,
Organization and Design, Interactive systems",
treatment = "P Practical",
}
@Article{vandenHeuvel:1986:ASR,
author = "Pim {van den Heuvel}",
title = "Adding statements to {REDUCE}",
journal = j-SIGSAM,
volume = "20",
number = "1--2",
pages = "8--14",
month = feb # "\slash " # may,
year = "1986",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:58 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6140D (High level languages)",
corpsource = "Dept. of Comput. Sci., Twente Univ. of Technol.,
Enschede, Netherlands",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "76",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "high level languages; languages; REDUCE; REDUCE
packages; REDUCE parsing tools; REDUCE syntax",
subject = "D.3.4 Software, PROGRAMMING LANGUAGES, Processors,
Parsing \\ I.1.3 Computing Methodologies, ALGEBRAIC
MANIPULATION, Languages and Systems, REDUCE",
treatment = "P Practical",
}
@Article{Davenport:1986:PMP,
author = "J. H. Davenport",
title = "A ``Piano Movers'' Problem",
journal = j-SIGSAM,
volume = "20",
number = "1--2",
pages = "15--17",
month = feb # "\slash " # may,
year = "1986",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:58 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra)",
corpsource = "Sch. of Math., Bath Univ., UK",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "76",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; algorithms; cylindrical algebraic
decompositions; decomposition; languages",
subject = "I.1.3 Computing Methodologies, ALGEBRAIC MANIPULATION,
Languages and Systems, REDUCE \\ F.2.1 Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Numerical Algorithms and Problems,
Computations on polynomials",
treatment = "T Theoretical or Mathematical",
}
@Article{Caprasse:1986:CSP,
author = "H. Caprasse",
title = "A complete simplification package for the absolute
value function in the real domain",
journal = j-SIGSAM,
volume = "20",
number = "1--2",
pages = "18--21",
month = feb # "\slash " # may,
year = "1986",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:58 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Implementation for {REDUCE} 3.2 of the function
{ABS}.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra)",
corpsource = "Inst. de Phys. au Sart Tilman, Liege Univ., Belgium",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "76",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "ABS; absolute value function; algebra; algebraic mode;
arbitrary real; complex variable; default assumption;
domain; languages; real; real numbers; REDUCE;
semi-definite positive; simplification package",
subject = "I.1.3 Computing Methodologies, ALGEBRAIC MANIPULATION,
Languages and Systems, REDUCE",
treatment = "P Practical",
}
@Article{Gleyse:1986:SCN,
author = "B. Gleyse",
title = "Symbolic computation and number of zeros of a real
parameter polynomial in the unit disk",
journal = j-SIGSAM,
volume = "20",
number = "1--2",
pages = "22--28",
month = feb # "\slash " # may,
year = "1986",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:58 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra); C4130 (Interpolation and function
approximation)",
corpsource = "Equipe d'Algorithmique Math. IMAG, St-Martin-d'Heres,
France",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "76",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebraic computation; algorithms; coefficients;
polynomial; polynomials; real parameter; real parameter
polynomial; Rouche theorem; Schur transformation;
symbolic computation; theoretical background; unit
disk",
subject = "F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Numerical Algorithms and
Problems, Computations on polynomials",
treatment = "P Practical",
}
@Article{Namba:1986:SIU,
author = "K. Namba",
title = "Some improvements on {Utah} standard {LISP}",
journal = j-SIGSAM,
volume = "20",
number = "1--2",
pages = "29--36",
month = feb # "\slash " # may,
year = "1986",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:58 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6140D (High level languages)",
corpsource = "Audio Technol. Center, Sony Corp., Tokyo, Japan",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "76",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "bit/byte strings; bug-fixings; compiler interface;
datatypes; execution-time inefficiency; hash tables;
languages; LISP; process flows; stack operation;
standard LISP; vectors",
subject = "D.2.7 Software, SOFTWARE ENGINEERING, Distribution and
Maintenance \\ D.2.5 Software, SOFTWARE ENGINEERING,
Testing and Debugging, Debugging aids \\ D.4.3
Software, OPERATING SYSTEMS, File Systems Management,
File organization",
treatment = "P Practical",
}
@Article{Ebner:1986:GCL,
author = "Dieter W. Ebner",
title = "{GOEDEL}: a computer language for symbolic algebraic
calculations --- an introduction by examples",
journal = j-SIGSAM,
volume = "20",
number = "3",
pages = "16--19",
month = sep,
year = "1986",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:58 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6130 (Data handling techniques); C6140D (High level
languages); C7310 (Mathematics)",
corpsource = "Konstanz Univ., West Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "77",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "computer language; GOEDEL; high level languages;
languages; manipulation; mathematics computing; symbol;
symbolic algebraic calculations; symbolic
manipulations; theory",
subject = "I.1.1 Computing Methodologies, ALGEBRAIC MANIPULATION,
Expressions and Their Representation \\ D.3.4 Software,
PROGRAMMING LANGUAGES, Processors, Translator writing
systems and compiler generators \\ F.4.1 Theory of
Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
Mathematical Logic, Recursive function theory",
treatment = "P Practical",
}
@Article{Caprasse:1986:DEM,
author = "H. Caprasse",
title = "Description of an extension of the {Matrix} package of
{``Reduce''}",
journal = j-SIGSAM,
volume = "20",
number = "4",
pages = "7--10",
month = dec,
year = "1986",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:58 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra); C4140 (Linear algebra)",
corpsource = "Inst. de Phys. au Sart Tilman, Liege Univ., Belgium",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "78",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebraic; algorithms; Hearn; languages; matrix;
matrix algebra; matrix package; matrix subprogram;
mode; reduce",
subject = "I.1.3 Computing Methodologies, ALGEBRAIC MANIPULATION,
Languages and Systems, REDUCE \\ F.2.1 Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Numerical Algorithms and Problems,
Computations on matrices",
treatment = "P Practical",
}
@Article{Langemyr:1986:CSC,
author = "Lars Langemyr",
title = "Converting {SAC-2} code to {Lisp}",
journal = j-SIGSAM,
volume = "20",
number = "4",
pages = "11--13",
month = dec,
year = "1986",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:58 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra); C6140D (High level languages); C6150C
(Compilers, interpreters and other processors)",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "78",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "ALDES; algebra; algorithm description; algorithms;
Common LISP; language; languages; LISP; Lisp; program
interpreters; SAC-2 code; SAC-2 computer algebra
system; translator",
subject = "D.3.2 Software, PROGRAMMING LANGUAGES, Language
Classifications, LISP \\ D.3.4 Software, PROGRAMMING
LANGUAGES, Processors, Translator writing systems and
compiler generators \\ F.2.1 Theory of Computation,
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
Numerical Algorithms and Problems, Computations on
polynomials",
treatment = "P Practical",
}
@Article{Calmet:1987:KBS,
author = "Jacques Calmet and Denis Lugiez",
title = "A knowledge-based system for computer algebra",
journal = j-SIGSAM,
volume = "21",
number = "1",
pages = "7--13",
month = feb,
year = "1987",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6110 (Systems analysis and programming); C6130 (Data
handling techniques); C7310 (Mathematics)",
corpsource = "LIFIA, St. Martin d'Heres, France",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "79",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "AI; algebra; algebraic algorithms; algorithms;
artificial intelligence; computer algebra; design;
expert systems; knowledge; knowledge-based system;
languages; manipulation; mathematical; mathematics
computing; software engineering; symbol; theory",
subject = "F.0 Theory of Computation, GENERAL \\ D.1.m Software,
PROGRAMMING TECHNIQUES, Miscellaneous \\ I.2.1
Computing Methodologies, ARTIFICIAL INTELLIGENCE,
Applications and Expert Systems",
treatment = "P Practical",
}
@Article{vandenHeuvel:1987:SSP,
author = "P. {van den Heuvel} and B. J. A. Hulshof and J. A. van
Hulzen",
title = "Some simple pretty-print facilities for {REDUCE}",
journal = j-SIGSAM,
volume = "21",
number = "1",
pages = "14--17",
month = feb,
year = "1987",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6130 (Data handling techniques)",
corpsource = "Dept. of Comput. Sci., Twente Univ., Enschede,
Netherlands",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "79",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "Algebraic Mode; computer graphics; documentation;
formal derivatives; pretty-print facilities; REDUCE;
RLisp; subscripted variables; symbol manipulation;
theory",
subject = "I.1.3 Computing Methodologies, ALGEBRAIC MANIPULATION,
Languages and Systems, REDUCE \\ D.3.3 Software,
PROGRAMMING LANGUAGES, Language Constructs, Procedures,
functions, and subroutines \\ D.2.3 Software, SOFTWARE
ENGINEERING, Coding, Pretty printers",
treatment = "P Practical",
}
@Article{Labonte:1987:RPS,
author = "Gilles Labont{\'e}",
title = "Report on a program for solving polynomial equations
in non-commuting variables",
journal = j-SIGSAM,
volume = "21",
number = "2",
pages = "4--7",
month = feb,
year = "1987",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4130 (Interpolation and function approximation);
C7310 (Mathematics)",
corpsource = "Dept. of Math. and Comput. Sci., R. Mil. Coll. of
Canada, Kingston, Ont., Canada",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "80",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebraic; algebraic computation; algorithm;
algorithms; coefficient fields; computer algebra
program; equations; generating vector; identity
element; LISP; mathematics computing; noncommuting;
polynomial equations; polynomials; problems; symbol
manipulation; symbol manipulation program; test;
theory; variables",
subject = "G.1.5 Mathematics of Computing, NUMERICAL ANALYSIS,
Roots of Nonlinear Equations, Polynomials, methods for
\\ F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Numerical Algorithms and
Problems, Computations on polynomials",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Gianni:1987:SAC,
author = "P. Gianni and A. Miola and T. Mora",
title = "Symbolic and algebraic computation research in
{Italy}",
journal = j-SIGSAM,
volume = "21",
number = "2",
pages = "8--15",
month = feb,
year = "1987",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "80",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithms; theory",
subject = "F.0 Theory of Computation, GENERAL",
}
@Article{Weispfenning:1987:AOL,
author = "Volker Weispfenning",
title = "Admissible orders and linear forms",
journal = j-SIGSAM,
volume = "21",
number = "2",
pages = "16--18",
month = feb,
year = "1987",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra); C7310 (Mathematics)",
corpsource = "Math. Inst., Heidelberg Univ., West Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "80",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "admissible orders; algebraic terms; alternative
characterization; complete characterization;
definition; extended sense; field; finite number;
finitely generated ordered; Galligo; Goebner bases;
ideals; indeterminates; linear forms; polynomial;
polynomials; power products; real coefficients;
Robbiano; symbol manipulation; theory; verification",
subject = "F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Numerical Algorithms and
Problems, Computations on polynomials \\ G.1.5
Mathematics of Computing, NUMERICAL ANALYSIS, Roots of
Nonlinear Equations, Polynomials, methods for",
treatment = "T Theoretical or Mathematical",
}
@Article{Katz:1987:IDE,
author = "Alan Katz",
title = "Issues in defining an equations representation
standard",
journal = j-SIGSAM,
volume = "21",
number = "2",
pages = "19--24",
month = feb,
year = "1987",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6130 (Data handling techniques); C7310
(Mathematics)",
corpsource = "Univ. of Southern California, Los Angeles, CA, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "80",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "directive; electronic; electronic mail; equation
handling systems; equation transferral; equations;
existing incompatible; full display systems; internal
representations; mail; mathematical equations;
mathematics computing; representation standard;
standardisation; standardization; standards; symbol
manipulation; symbolic language; theory",
subject = "K.1 Computing Milieux, THE COMPUTER INDUSTRY,
Standards \\ F.0 Theory of Computation, GENERAL",
treatment = "P Practical",
}
@Article{Engeler:1987:GDC,
author = "Erwin Engeler",
title = "Goals and design considerations for a mathematical
laboratory",
journal = j-SIGSAM,
volume = "21",
number = "3",
pages = "7--8",
month = aug,
year = "1987",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "81",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "design; theory",
subject = "J.2 Computer Applications, PHYSICAL SCIENCES AND
ENGINEERING, Mathematics and statistics \\ G.0
Mathematics of Computing, GENERAL",
}
@Article{Gray:1987:SCL,
author = "John W. Gray",
title = "The symbolic computation laboratory at {UIUC}",
journal = j-SIGSAM,
volume = "21",
number = "3",
pages = "9--11",
month = aug,
year = "1987",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "81",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "design; theory",
subject = "J.2 Computer Applications, PHYSICAL SCIENCES AND
ENGINEERING, Mathematics and statistics \\ G.0
Mathematics of Computing, GENERAL",
}
@Article{Maeder:1987:CPM,
author = "Roman E. Maeder",
title = "A collection of projects for the mathematical
laboratory",
journal = j-SIGSAM,
volume = "21",
number = "3",
pages = "12--94",
month = aug,
year = "1987",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "81",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "design; theory",
subject = "J.2 Computer Applications, PHYSICAL SCIENCES AND
ENGINEERING, Mathematics and statistics \\ G.0
Mathematics of Computing, GENERAL",
}
@Article{Maeder:1987:SBV,
author = "R. E. Maeder",
title = "Solving boundary-value problems with perturbations",
journal = j-SIGSAM,
volume = "21",
number = "3",
pages = "16--18",
month = aug,
year = "1987",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "81",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "theory",
subject = "G.1.7 Mathematics of Computing, NUMERICAL ANALYSIS,
Ordinary Differential Equations, Boundary value
problems \\ F.2.2 Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, MACSYMA",
}
@Article{Binger:1987:BT,
author = "D. Binger",
title = "{Burnside}'s theorem",
journal = j-SIGSAM,
volume = "21",
number = "3",
pages = "19--23",
month = aug,
year = "1987",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "81",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "theory",
subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS,
Miscellaneous",
}
@Article{Peikert:1987:FPS,
author = "R. Peikert",
title = "Formal power series",
journal = j-SIGSAM,
volume = "21",
number = "3",
pages = "24--32",
month = aug,
year = "1987",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "81",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "languages; theory",
subject = "D.3.2 Software, PROGRAMMING LANGUAGES, Language
Classifications, Prolog",
}
@Article{Knill:1987:RGR,
author = "O. Knill and R. E. M{\"a}der",
title = "The rotation group of {Rubik}'s cube",
journal = j-SIGSAM,
volume = "21",
number = "3",
pages = "33--43",
month = aug,
year = "1987",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "81",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithms; theory",
subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS,
Miscellaneous",
}
@Article{Wheeler:1987:BP,
author = "F. S. Wheeler",
title = "{Bell} polynomials",
journal = j-SIGSAM,
volume = "21",
number = "3",
pages = "44--53",
month = aug,
year = "1987",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "81",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "theory; verification",
subject = "G.2.1 Mathematics of Computing, DISCRETE MATHEMATICS,
Combinatorics \\ F.2.1 Theory of Computation, ANALYSIS
OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical
Algorithms and Problems, Computations on polynomials",
}
@Article{Binger:1987:ON,
author = "D. Binger",
title = "Optimization on networks",
journal = j-SIGSAM,
volume = "21",
number = "3",
pages = "54--60",
month = aug,
year = "1987",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "81",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithms; languages; theory",
subject = "D.3.2 Software, PROGRAMMING LANGUAGES, Language
Classifications, Prolog \\ G.2.2 Mathematics of
Computing, DISCRETE MATHEMATICS, Graph Theory, Network
problems",
}
@Article{Peikert:1987:ATP,
author = "R. Peikert",
title = "Automated theorem proving: the resolution method",
journal = j-SIGSAM,
volume = "21",
number = "3",
pages = "61--68",
month = aug,
year = "1987",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "81",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "theory; verification",
subject = "I.2.3 Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Deduction and Theorem Proving",
}
@Article{Kuchlin:1987:PKE,
author = "W. K{\"u}chlin",
title = "Public key encryption",
journal = j-SIGSAM,
volume = "21",
number = "3",
pages = "69--73",
month = aug,
year = "1987",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "81",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "theory",
subject = "E.3 Data, DATA ENCRYPTION, Public key cryptosystems",
}
@Article{Fateman:1987:TOM,
author = "Richard J. Fateman",
title = "{{\TeX}} output from {MACSYMA}-like systems",
journal = j-SIGSAM,
volume = "21",
number = "4",
pages = "1--5",
month = nov,
year = "1987",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "82",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "design; theory",
subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, MACSYMA \\ I.1.3 Computing Methodologies,
ALGEBRAIC MANIPULATION, Languages and Systems,
MACSYMA",
}
@Article{Kapur:1987:MUC,
author = "Deepak Kapur and Paliath Narendran",
title = "Matching, unification and complexity",
journal = j-SIGSAM,
volume = "21",
number = "4",
pages = "6--9",
month = nov,
year = "1987",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "82",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "theory",
subject = "I.2.3 Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Deduction and Theorem Proving \\ I.1.3
Computing Methodologies, ALGEBRAIC MANIPULATION,
Languages and Systems",
}
@Article{Ponder:1987:AHA,
author = "Carl D. Ponder",
title = "Applications of hashing in algebraic manipulation (an
annotated bibliography)",
journal = j-SIGSAM,
volume = "21",
number = "4",
pages = "10--13",
month = nov,
year = "1987",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "82",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "theory",
subject = "E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table
representations \\ I.1.3 Computing Methodologies,
ALGEBRAIC MANIPULATION, Languages and Systems \\ A.2
General Literature, REFERENCE",
}
@Article{Moritsugu:1987:PSS,
author = "S. Moritsugu",
title = "On the power series solution of a system of algebraic
equations",
journal = j-SIGSAM,
volume = "21",
number = "4",
pages = "14--23",
month = nov,
year = "1987",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "82",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithms; theory",
subject = "I.1.3 Computing Methodologies, ALGEBRAIC MANIPULATION,
Languages and Systems",
}
@Article{Akritas:1987:NPM,
author = "Alkiviadis G. Akritas",
title = "A note on a paper by {M}. {Mignotte}",
journal = j-SIGSAM,
volume = "21",
number = "4",
pages = "23--23",
month = nov,
year = "1987",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "82",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "theory",
subject = "I.1.m Computing Methodologies, ALGEBRAIC MANIPULATION,
Miscellaneous \\ F.2.1 Theory of Computation, ANALYSIS
OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical
Algorithms and Problems, Computations on polynomials",
}
@Article{Mignotte:1987:IAF,
author = "Maurice Mignotte",
title = "Inequalities about factors of integer polynomials",
journal = j-SIGSAM,
volume = "21",
number = "4",
pages = "24--24",
month = nov,
year = "1987",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "82",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "theory",
subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, MACSYMA \\ F.2.1 Theory of Computation,
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
Numerical Algorithms and Problems, Number-theoretic
computations",
}
@Article{Arnon:1987:RWE,
author = "Dennis S. Arnon",
title = "Report of the workshop on environments for
computational mathematics",
journal = j-SIGSAM,
volume = "21",
number = "4",
pages = "42--48",
month = nov,
year = "1987",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "82",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "theory",
subject = "F.0 Theory of Computation, GENERAL \\ G.0 Mathematics
of Computing, GENERAL \\ I.0 Computing Methodologies,
GENERAL \\ A.0 General Literature, GENERAL, Conference
proceedings",
}
@Article{Nielsen:1988:NEM,
author = "Birger Nielsen and Hendrik Pedersen",
title = "A note on {Einstein} metrics --- a simple application
of a symbolic algebra system",
journal = j-SIGSAM,
volume = "22",
number = "1",
pages = "7--11",
month = jan,
year = "1988",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "83",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "measurement; theory; verification",
subject = "G.1.m Mathematics of Computing, NUMERICAL ANALYSIS,
Miscellaneous",
}
@Article{Hohti:1988:CAA,
author = "Aarno Hohti",
title = "Computational algebra with {APL}",
journal = j-SIGSAM,
volume = "22",
number = "1",
pages = "12--20",
month = jan,
year = "1988",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "83",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithms; languages; performance; theory",
subject = "G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE
\\
D.3.2 Software, PROGRAMMING LANGUAGES, Language
Classifications, APL",
}
@Article{Flaherty:1988:SME,
author = "Terry Flaherty",
title = "Symbolic manipulation in an extended $ \lambda
$-calculus",
journal = j-SIGSAM,
volume = "22",
number = "1",
pages = "21--24",
month = jan,
year = "1988",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "83",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "languages; theory",
subject = "F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND
FORMAL LANGUAGES, Mathematical Logic, Lambda calculus
and related systems \\ G.2.m Mathematics of Computing,
DISCRETE MATHEMATICS, Miscellaneous",
}
@Article{Campbell:1988:SIE,
author = "Graham H. Campbell",
title = "Symbolic integration of expressions involving
unspecified functions",
journal = j-SIGSAM,
volume = "22",
number = "1",
pages = "25--27",
month = jan,
year = "1988",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "83",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithms; performance; theory",
subject = "I.1.1 Computing Methodologies, ALGEBRAIC MANIPULATION,
Expressions and Their Representation",
}
@Article{Kredel:1988:ATO,
author = "Heinz Kredel",
title = "Admissible term orderings used in computer algebra
systems",
journal = j-SIGSAM,
volume = "22",
number = "1",
pages = "28--31",
month = jan,
year = "1988",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "83",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithms; performance; theory",
subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS,
Miscellaneous",
}
@Article{Miola:1988:RPA,
author = "A. Miola",
title = "Report on previous activities at {AAECC}",
journal = j-SIGSAM,
volume = "22",
number = "1",
pages = "32--43",
month = jan,
year = "1988",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "83",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "theory",
subject = "A.0 General Literature, GENERAL, Conference
proceedings \\ G.0 Mathematics of Computing, GENERAL",
}
@Article{Gonnet:1988:EMA,
author = "Gaston H. Gonnet",
title = "Examples of {Maple} applied to problems from the
{American Mathematical Monthly}",
journal = j-SIGSAM,
volume = "22",
number = "2",
pages = "8--16",
month = apr,
year = "1988",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra); C4140 (Linear algebra); C7310
(Mathematics)",
corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "84",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; algorithms; American; computer algebra
system; linear algebra; Maple system; Mathematical
Monthly; mathematics computing; Problem Section;
problems; selected problems; theory",
subject = "I.1.3 Computing Methodologies, ALGEBRAIC MANIPULATION,
Languages and Systems, Maple",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Cattaneo:1988:NPI,
author = "G. M. Piacentini Cattaneo and M. Pittaluga",
title = "Nonassociative polynomial identities, {Young} tableaux
and computers",
journal = j-SIGSAM,
volume = "22",
number = "2",
pages = "17--26",
month = apr,
year = "1988",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra); C4130 (Interpolation and function
approximation); C4140 (Linear algebra)",
corpsource = "Dept. of Math., Second Univ., Rome, Italy",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "84",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "associative; computers; enumeration; identities;
linear algebra; minimal; nonassociative algebra;
particular degrees; PI algebras; polynomial identities;
polynomials; Regev; summands; symmetric groups; theory;
Young tableaux",
subject = "F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Numerical Algorithms and
Problems, Computations on polynomials \\ G.1.5
Mathematics of Computing, NUMERICAL ANALYSIS, Roots of
Nonlinear Equations, Polynomials, methods for",
treatment = "T Theoretical or Mathematical",
}
@Article{Fateman:1988:CSS,
author = "Richard Fateman and Alan Bundy and Richard O'Keefe and
Leon Sterling",
title = "Commentary on: solving symbolic equations with
{PRESS}",
journal = j-SIGSAM,
volume = "22",
number = "2",
pages = "27--40",
month = apr,
year = "1988",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra); C4140 (Linear algebra); C7310
(Mathematics)",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "84",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebraic; equation-solving modules; linear algebra;
manipulation; mathematical reasoning; mathematics
computing; MECHO system; meta-level; nondifferential
equations; performance; PRESS; PROLOG; PROLOG equation
solving; search strategies; solving; symbolic; symbolic
equations; system; theory; transcendental",
subject = "G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Gregory:1988:ABC,
author = "Brent Gregory and Erich Kaltofen",
title = "Analysis of the binary complexity of asymptotically
fast algorithms for linear system solving",
journal = j-SIGSAM,
volume = "22",
number = "2",
pages = "41--49",
month = apr,
year = "1988",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra); C4140 (Linear algebra); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Rensselaer Polytech. Inst.,
Troy, NY, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "84",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebraic algorithm design; algorithms; arithmetic;
asymptotically fast algorithms; asymptotically fast
matrix; augmented input matrix; binary complexity; bit
complexity; computational complexity; denominators;
design; Gaussian elimination; integral matrix; linear;
matrix algebra; matrix triangularization algorithm;
minors; multiplication; operations; rational numbers;
reduced rational numerators; size growth; system
solving; theory",
subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION,
Algorithms, Algebraic algorithms \\ I.1.2 Computing
Methodologies, ALGEBRAIC MANIPULATION, Algorithms,
Analysis of algorithms \\ G.1.3 Mathematics of
Computing, NUMERICAL ANALYSIS, Numerical Linear
Algebra, Matrix inversion",
treatment = "T Theoretical or Mathematical",
}
@Article{Corless:1988:CTC,
author = "R. M. Corless and D. J. Jeffrey",
title = "A comparison of three computer algebra systems for the
solution of a problem in hydrodynamic lubrication",
journal = j-SIGSAM,
volume = "22",
number = "2",
pages = "50--62",
month = apr,
year = "1988",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra); C4140 (Linear algebra); C7440 (Civil
and mechanical engineering)",
corpsource = "Dept. of Appl. Math., Western Ontario Univ., London,
Ont., Canada",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "84",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra languages; computer; computer algebra system;
computer algebra systems; design; hydrodynamic
lubrication; linear algebra; measurement; mechanical
engineering computing; performance; theory",
subject = "I.1.3 Computing Methodologies, ALGEBRAIC MANIPULATION,
Languages and Systems, Special-purpose algebraic
systems \\ J.2 Computer Applications, PHYSICAL SCIENCES
AND ENGINEERING, Engineering",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Ponder:1988:PAA,
author = "Carl G. Ponder",
title = "Parallelism and algorithms for algebraic manipulation:
current work",
journal = j-SIGSAM,
volume = "22",
number = "3",
pages = "7--14",
month = jul,
year = "1988",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4140 (Linear algebra); C4240 (Programming and
algorithm theory)",
corpsource = "Div. of Comput. Sci., California Univ., Berkeley, CA,
USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "85",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebraic manipulation; algorithms; linear algebra;
parallel algorithms; parallelism; theory",
subject = "F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT
DEVICES, Modes of Computation, Parallelism \\ I.1.m
Computing Methodologies, ALGEBRAIC MANIPULATION,
Miscellaneous \\ G.1.0 Mathematics of Computing,
NUMERICAL ANALYSIS, General, Parallel algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Ponder:1988:PPS,
author = "Carl G. Ponder",
title = "Parallel processors and systems for algebraic
manipulation: current work",
journal = j-SIGSAM,
volume = "22",
number = "3",
pages = "15--21",
month = jul,
year = "1988",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C5220 (Computer architecture)",
corpsource = "Div. of Comput. Sci., California Univ., Berkeley, CA,
USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "85",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebraic manipulation; architecture; architectures;
computer; design; general-; interconnection network;
multiprocessor interconnection networks; multiprocessor
systems; parallel; parallel symbolic; parallel system;
processing languages; special-purpose; theory",
subject = "F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT
DEVICES, Modes of Computation, Parallelism \\ I.1.3
Computing Methodologies, ALGEBRAIC MANIPULATION,
Languages and Systems, Special-purpose hardware",
treatment = "P Practical",
}
@Article{Schrufer:1988:CNE,
author = "Eberhard Schr{\"u}fer",
title = "A comment on {``A note on Einstein metrics''}",
journal = j-SIGSAM,
volume = "22",
number = "3",
pages = "22--26",
month = jul,
year = "1988",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:26:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4140 (Linear algebra)",
corpsource = "GMD, Inst. F1-P, St. Augustin, West Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "85",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "Cartan; coding; efficiency gains; Einstein Metrics;
EXCALC; exterior forms; field equations; matrix
algebra; measurement; performance; REDUCE testfile;
theory",
subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Geometrical problems and computations \\
I.1.3 Computing Methodologies, ALGEBRAIC MANIPULATION,
Languages and Systems, REDUCE",
treatment = "T Theoretical or Mathematical",
}
@Article{Ronveaux:1988:PSR,
author = "A. Ronveaux and G. Thiry",
title = "Polynomial solution of recurrence relation and
differential equation",
journal = j-SIGSAM,
volume = "22",
number = "4",
pages = "9--19",
month = oct,
year = "1988",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:00 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "B0290P (Differential equations); C4170 (Differential
equations)",
corpsource = "Fac. Univ. N-D de la Paix, Namur, Belgium",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "86",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithms; compatibility criterion; differential
equation; differential equations; homogeneous
differential equation; implementation; orthogonal
polynomials; polynomials; recurrence relation; REDUCE;
second order linear; symbolic matrix triangularization;
theory",
subject = "I.1.3 Computing Methodologies, ALGEBRAIC MANIPULATION,
Languages and Systems, REDUCE \\ F.2.1 Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Numerical Algorithms and Problems,
Computations on polynomials",
treatment = "P Practical",
}
@Article{Moritsugu:1989:NPF,
author = "Shuichi Moritsugu and Eiichi Goto",
title = "A note on the preconditioning for factorization of
homogeneous polynomials",
journal = j-SIGSAM,
volume = "23",
number = "1",
pages = "9--12",
month = jan,
year = "1989",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:00 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4130 (Interpolation and function approximation);
C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Inf. Sci., Tokyo Univ., Japan",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "87",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithms; computational complexity; experimental
implementation; experimentation; factorization;
homogeneous polynomials; polynomials; preconditioning;
theory",
subject = "F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Numerical Algorithms and
Problems, Computations on polynomials \\ F.2.1 Theory
of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Numerical Algorithms and Problems,
Number-theoretic computations",
treatment = "T Theoretical or Mathematical",
}
@Article{Havel:1989:PGA,
author = "T. F. Havel and B. Sturmfels and N. White",
title = "Proposal for a geometric algebra software package",
journal = j-SIGSAM,
volume = "23",
number = "1",
pages = "13--15",
month = jan,
year = "1989",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:00 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/magma.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4130 (Interpolation and function approximation);
C7310 (Mathematics)",
corpsource = "Dept. of Molecular Biol., Res. Inst. of Scripps
Clinic, La Jolla, CA, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "87",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; bracket; Cayley algebra; Cayley-Grassmann
algebra; computational geometry; computing;
coordinate-free algebra; design; geometric algebra
software package; linear algebra; mathematics; theory",
subject = "D.3.3 Software, PROGRAMMING LANGUAGES, Language
Constructs, Modules, packages \\ F.2.2 Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Geometrical problems and computations",
treatment = "P Practical",
}
@Article{Roch:1989:CAM,
author = "Jean-Louis Roch and Pascale Senechaud and
Fran{\c{c}}oise Siebert-Roch and Gilles Villard",
title = "Computer algebra on {MIMD} machine",
journal = j-SIGSAM,
volume = "23",
number = "1",
pages = "16--32",
month = jan,
year = "1989",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:00 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4140 (Linear algebra); C7310 (Mathematics); C5230
(Digital arithmetic methods); C5220 (Computer
architecture)",
corpsource = "Inst. Nat. Polytech. de Grenoble, France",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "87",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithms; computer algebra system; digital
arithmetic; Diophantine; equations; floating point
system hypercube Tesseract 20; infinite-precision
arithmetic; linear algebra; linear systems; MIMD
machine; PAC; parallel algorithms; parallel
architectures; parallelism; performance; theory",
subject = "C.1.2 Computer Systems Organization, PROCESSOR
ARCHITECTURES, Multiple Data Stream Architectures
(Multiprocessors), Multiple-instruction-stream,
multiple-data-stream processors (MIMD) \\ I.1.m
Computing Methodologies, ALGEBRAIC MANIPULATION,
Miscellaneous \\ F.1.2 Theory of Computation,
COMPUTATION BY ABSTRACT DEVICES, Modes of Computation,
Parallelism \\ G.1.0 Mathematics of Computing,
NUMERICAL ANALYSIS, General, Parallel algorithms",
treatment = "P Practical",
}
@Article{Clarkson:1989:MIL,
author = "M. Clarkson",
title = "{MACSYMA}'s inverse {Laplace} transform",
journal = j-SIGSAM,
volume = "23",
number = "1",
pages = "33--38",
month = jan,
year = "1989",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:00 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The inverse Laplace transform capability of MACSYMA
has been improved and extended. It has been extended to
evaluate certain limits, sums, derivatives and
integrals of Laplace transforms. It also takes
advantage of the inverse Laplace transform convolution
theorem, and can deal with a wider range of symbolic
parameters.",
acknowledgement = ack-nhfb,
affiliation = "Inst. for Space and Terrestrial Sci., York Univ.,
North York, Ont., Canada",
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C4190 (Other numerical methods)",
classification = "C4190 (Other numerical methods); C7310
(Mathematics)",
corpsource = "Inst. for Space and Terrestrial Sci., York Univ.,
North York, Ont., Canada",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "87",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "convolution theorem; Convolution theorem; derivatives;
Derivatives; integrals; Integrals; inverse Laplace
transform; Inverse Laplace transform; limits; Limits;
MACSYMA; mathematics computing; sums; Sums;
transforms",
subject = "I.1.3 Computing Methodologies, ALGEBRAIC MANIPULATION,
Languages and Systems, MACSYMA \\ F.2.1 Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Numerical Algorithms and Problems,
Computation of transforms",
thesaurus = "Mathematics computing; Transforms",
treatment = "P Practical",
}
@Article{Rowney:1989:FFM,
author = "K. T. Rowney and R. D. Silverman",
title = "Finite field manipulations in {Macsyma}",
journal = j-SIGSAM,
volume = "23",
number = "1",
pages = "39--48",
month = jan,
year = "1989",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:00 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics)",
corpsource = "California Univ., Los Angeles, CA, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "87",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithms; finite field arithmetic; Finite field
arithmetic; manipulation; Manipulation; mathematics
computing; symbolic objects; Symbolic objects; theory",
subject = "I.1.3 Computing Methodologies, ALGEBRAIC MANIPULATION,
Languages and Systems, MACSYMA",
thesaurus = "Mathematics computing",
treatment = "P Practical",
}
@Article{Fateman:1989:SDS,
author = "R. J. Fateman and C. G. Ponder",
title = "Speed and data structures in computer algebra
systems",
journal = j-SIGSAM,
volume = "23",
number = "2",
pages = "8--11",
month = apr,
year = "1989",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:00 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Comparing the speed of computation in algebra systems
is a perennial occupation of system designers and
algorithm implementors. However, for many problems, the
choice of a system makes much less difference that the
approach used to represent the problem. The mapping
from mathematics to a data representation and the
choice of algorithms can make significant, and
separate, contributions to efficiency. Systems which
have the flexibility to provide several data structures
and algorithms can provide an advantage in this
respect. Macsyma is probably the system with the
largest selection. On the other hand, Macsyma has not
taken advantage of recent advances such as the
extensive use of hash-coding incorporated in the
University of Waterloo's Maple system. For the one
somewhat artificial benchmark discussed, it appears
that the Maple system does considerably better than any
representation in Macsyma by precisely this
mechanism.",
acknowledgement = ack-nhfb,
affiliation = "Div. of Comput. Sci., California Univ., Berkeley, CA,
USA",
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C6130 (Data handling techniques);
C6120 (File organisation)",
classification = "C6120 (File organisation); C6130 (Data handling
techniques); C7310 (Mathematics)",
corpsource = "Div. of Comput. Sci., California Univ., Berkeley, CA,
USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "88",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; algorithm implementors; Algorithm
implementors; algorithms; benchmark; Benchmark;
computation speed; Computation speed; computer algebra
systems; Computer algebra systems; data; Data
representation; data structures; Data structures;
design; designers; hash-coding; Hash-coding; Macsyma;
Maple; Maple system; mathematics; Mathematics;
mathematics computing; performance; representation;
selection; software; symbol manipulation; system;
System designers",
subject = "I.3.1 Computing Methodologies, COMPUTER GRAPHICS,
Hardware architecture, Raster display devices \\ C.4
Computer Systems Organization, PERFORMANCE OF SYSTEMS
\\ E.1 Data, DATA STRUCTURES",
thesaurus = "Algebra; Data structures; Mathematics computing;
Software selection; Symbol manipulation",
treatment = "P Practical",
}
@Article{Piquette:1989:SFI,
author = "J. C. Piquette",
title = "Special function integration",
journal = j-SIGSAM,
volume = "23",
number = "2",
pages = "11--21",
month = apr,
year = "1989",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:00 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C4160 (Numerical integration and
differentiation); C4180 (Integral equations)",
corpsource = "Naval Res. Lab., Underwater Sound Reference
Detachment, Orlando, FL, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "88",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithms; anti-derivative; capabilities; design;
differential equation; inhomogeneous DE; integral
equations; integration; mathematics computing;
performance; special function integration; symbol
manipulation; symbolic-mathematics computer programs",
subject = "G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE
\\
G.1.9 Mathematics of Computing, NUMERICAL ANALYSIS,
Integral Equations \\ G.1.7 Mathematics of Computing,
NUMERICAL ANALYSIS, Ordinary Differential Equations \\
F.3.3 Theory of Computation, LOGICS AND MEANINGS OF
PROGRAMS, Studies of Program Constructs, Functional
constructs",
treatment = "P Practical",
}
@Article{MacCallum:1989:CPA,
author = "Malcolm A. H. MacCallum",
title = "Comments on the performance of algebra systems in
general relativity and a recent paper by {Nielsen} and
{Pedersen}",
journal = j-SIGSAM,
volume = "23",
number = "2",
pages = "22--25",
month = apr,
year = "1989",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:00 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C6130 (Data handling techniques);
C1110 (Algebra); C7320 (Physics and Chemistry)",
corpsource = "Sch. of Math. Sci., Queen Mary Coll., London, UK",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "88",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; algebra systems; computing; design; Einstein
equations; Euclidean four-dimensional space; general
relativity; mathematics computing; performance;
physics; symbol manipulation; verification",
subject = "D.2.8 Software, SOFTWARE ENGINEERING, Metrics \\ I.1.3
Computing Methodologies, ALGEBRAIC MANIPULATION,
Languages and Systems, Special-purpose algebraic
systems \\ C.4 Computer Systems Organization,
PERFORMANCE OF SYSTEMS \\ G.4 Mathematics of Computing,
MATHEMATICAL SOFTWARE",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Antweiler:1989:TRI,
author = "Werner Antweiler and Andreas Strotmann and Volker
Winkelmann",
title = "A {{\TeX}}-{REDUCE} Interface",
journal = j-SIGSAM,
volume = "23",
number = "2",
pages = "26--33",
month = apr,
year = "1989",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:00 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C6130 (Data handling techniques);
C7230 (Publishing and reproduction); C6140D (High level
languages); C6110 (Systems analysis and programming)",
corpsource = "Cologne Univ., Comput. Center, West Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "88",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; algebraic; algorithms; capabilities; computer
controlled typesetting; design; E/X-REDUCE-interface;
high level; high quality output; indentation;
languages; line breaking; manipulation; mathematics
computing; performance; programming; readability;
REDUCE formulas; REDUCE-Lisp; symbol; T/sub; T/sub E/X;
T/sub E/X output; typesetting language; verification;
well known computer algebra system",
subject = "I.3.1 Computing Methodologies, COMPUTER GRAPHICS,
Hardware architecture, Raster display devices \\ I.7.1
Computing Methodologies, TEXT PROCESSING, Text Editing,
TeX",
treatment = "P Practical",
}
@Article{Sit:1989:SCT,
author = "W. Y. Sit",
title = "Some comments on term-ordering in {Gr{\"o}bner} basis
computations",
journal = j-SIGSAM,
volume = "23",
number = "2",
pages = "34--38",
month = apr,
year = "1989",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:00 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C6130 (Data handling
techniques)",
corpsource = "Dept. of Math., City Coll. of New York, NY, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "88",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; mathematics computing; symbol manipulation;
computer algebra research; Gr{\"o}bner basis
computations; theoretical properties; admissible
term-orderings; computer; algebra systems; unified
terminology; SCRATCH-PAD II; algorithms; design;
performance; theory; verification",
subject = "I.1.3 Computing Methodologies, ALGEBRAIC MANIPULATION,
Languages and Systems, Special-purpose algebraic
systems \\ F.2.1 Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms
and Problems, Computations on polynomials",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Moritsugu:1989:NNE,
author = "Shuichi Moritsugu and Makoto Matsumoto",
title = "A note on the numerical evaluation of arctangent
function",
journal = j-SIGSAM,
volume = "23",
number = "3",
pages = "8--12",
month = jul,
year = "1989",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:00 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "B0290D (Functional analysis); C4120 (Functional
analysis); C7310 (Mathematics)",
corpsource = "Dept. of Inf. Sci., Tokyo Univ., Japan",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "89",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithms; arctangent; ATAN; ATAN2; computation;
computer algebra; design; function; function
evaluation; hybrid computation; languages;
manipulation; mathematics computing; multiple-valued
functions; numerical; numerical evaluation;
post-conditioning; real number; symbol; theory",
subject = "I.1.3 Computing Methodologies, ALGEBRAIC MANIPULATION,
Languages and Systems, Special-purpose algebraic
systems \\ G.1.0 Mathematics of Computing, NUMERICAL
ANALYSIS, General",
treatment = "P Practical",
}
@Article{Barnett:1989:UPF,
author = "M. P. Barnett",
title = "Using partial fraction formulas to sum some slowly
convergent series analytically for molecular integral
calculations",
journal = j-SIGSAM,
volume = "23",
number = "3",
pages = "13--18",
month = jul,
year = "1989",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:00 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "A3120 (Specific calculations and results); A0270
(Computational techniques); C7320 (Physics and
Chemistry); C7310 (Mathematics)",
corpsource = "Dept. of Comput. and Inf. Sci., Brooklyn Coll., City
Univ. of New York, NY, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "89",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebraic manipulation programs; algorithms; array;
chemical calculations; convergence; convergent series;
design; FORTRAN algorithms; manipulation; mathematics
computing; matrix algebra; molecular integral
calculations; molecular orbitals calculations; partial
fraction formulas; physics computing; polynomial
operations; polynomials; quantum; series (mathematics);
slowly; sum",
subject = "I.1.3 Computing Methodologies, ALGEBRAIC MANIPULATION,
Languages and Systems, Special-purpose algebraic
systems \\ G.1.9 Mathematics of Computing, NUMERICAL
ANALYSIS, Integral Equations \\ G.1.7 Mathematics of
Computing, NUMERICAL ANALYSIS, Ordinary Differential
Equations, Convergence and stability",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Schou:1989:RAM,
author = "W. C. Schou and K. A. Broughan",
title = "The {Risch} algorithms of {MACSYMA} and {SENAC}",
journal = j-SIGSAM,
volume = "23",
number = "3",
pages = "19--22",
month = jul,
year = "1989",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:00 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
affiliation = "Waikato Univ., Hamilton, New Zealand",
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics)",
classification = "C7310 (Mathematics)",
corpsource = "Waikato Univ., Hamilton, New Zealand",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "89",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithms; design; EUNICE MACSYMA release 305;
factorisation; Factorisation; integration; Integration
package; languages; mathematics computing; nested
exponential; Nested exponential; package; rational
functions; Rational functions; Risch algorithm; SENAC;
simplification; Simplification; symbol manipulation;
symbolic integration; Symbolic integration; symbolic
language; Symbolic language; symbolic/numeric system;
Symbolic/numeric system; theory; transcendental
integrals; Transcendental integrals; transcendental
integration; Transcendental integration;
zero-equivalence; Zero-equivalence",
subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION,
Algorithms, Algebraic algorithms \\ I.1.3 Computing
Methodologies, ALGEBRAIC MANIPULATION, Languages and
Systems, Special-purpose algebraic systems \\ G.1.9
Mathematics of Computing, NUMERICAL ANALYSIS, Integral
Equations",
thesaurus = "Integration; Mathematics computing; Symbol
manipulation",
treatment = "X Experimental",
}
@Article{Wall:1989:CS,
author = "B. Wall",
title = "On the computation of syzygies",
journal = j-SIGSAM,
volume = "23",
number = "4",
pages = "5--14",
month = oct,
year = "1989",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:00 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4130 (Interpolation and function approximation);
C4240 (Programming and algorithm theory)",
corpsource = "Res. Inst. for Symbolic Comput., Kepler Univ., Linz,
Austria",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "90",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithm theory; polynomials; syzygies; polynomials;
Gr{\"o}bner basis; algorithms; theory",
subject = "F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Numerical Algorithms and
Problems, Computations on polynomials \\ G.1.5
Mathematics of Computing, NUMERICAL ANALYSIS, Roots of
Nonlinear Equations",
treatment = "T Theoretical or Mathematical",
}
@Article{Ilyin:1989:FAC,
author = "V. A. Ilyin and A. P. Kryukov and A. Ya. Rodioniov and
A. Yu. Taranov",
title = "Fast algorithm for calculation of {Dirac}'s
gamma-matrices traces",
journal = j-SIGSAM,
volume = "23",
number = "4",
pages = "15--24",
month = oct,
year = "1989",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:00 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4140 (Linear algebra); C4240 (Programming and
algorithm theory)",
corpsource = "Inst. for Nucl. Phys., Moscow State Univ., USSR",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "90",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithm theory; algorithms; calculations; dimension;
Feynman diagrams; gamma-matrices; Kennedy-Cvitanovich
algorithm; matrix algebra; performance; REDUCE;
space-time; traces",
subject = "F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Numerical Algorithms and
Problems, Computations on matrices",
treatment = "T Theoretical or Mathematical",
}
@Article{Wang:1989:PCL,
author = "D. Wang",
title = "A program for computing the {Liapunov} functions and
{Liapunov} constants in {Scratchpad II}",
journal = j-SIGSAM,
volume = "23",
number = "4",
pages = "25--31",
month = oct,
year = "1989",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:00 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1320 (Stability); C7420 (Control engineering); C4170
(Differential equations)",
corpsource = "Res. Inst. for Symbolic Comput., Johannes Kepler
Univ., Linz, Austria",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "90",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "control system CAD; design; differential equations;
differential systems; Liapunov constants; Liapunov
functions; Lyapunov; methods; performance; polynomials;
Scratchpad II",
subject = "E.4 Data, CODING AND INFORMATION THEORY, Data
compaction and compression \\ G.2.0 Mathematics of
Computing, DISCRETE MATHEMATICS, General",
treatment = "P Practical",
}
@Article{Buchberger:1990:SSL,
author = "Bruno Buchberger",
title = "Should Students Learn Integration Rules?",
journal = j-SIGSAM,
volume = "24",
number = "1",
pages = "10--17",
month = jan,
year = "1990",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Thu Mar 20 16:02:15 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7810C (Computer-aided instruction); C7310
(Mathematics)",
corpsource = "Res. Inst. for Symbolic Comput., Johannes Kepler
Univ., Linz, Austria",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "91",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithms; black box phase; didactic principle;
educational computing; educational courses;
integration; integration rules; learning; mathematics
computing; mathematics courses; problem instances;
software systems; students; symbol manipulation;
symbolic computation; underlying theory; white box
phase",
treatment = "P Practical",
}
@Article{Char:1990:RAM,
author = "Bruce W. Char",
title = "Report on the {7th Annual Maple Workshop}",
journal = j-SIGSAM,
volume = "24",
number = "1",
pages = "18--18",
month = jan,
year = "1990",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:00 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Prather:1990:RLC,
author = "Ronald E. Prather",
title = "The Relation of {Lorenzen} Calculus to Formal Language
Theory",
journal = j-SIGSAM,
volume = "24",
number = "2",
pages = "9--18",
month = apr,
year = "1990",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4210 (Formal logic); C6110 (Systems analysis and
programming); C4240 (Programming and algorithm theory);
C1230 (Artificial intelligence)",
corpsource = "Dept. of Comput. Sci., Trinity Univ., San Antonio, TX,
USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "92",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithm; character strings; clauses; computational
basis; computational complexity; finite systems; formal
language theory; formal languages; formal notion;
logic; logic programming; Lorenzen calculus; multiple
antecedent canonical; programming; successively derived
word; systems",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Fateman:1990:LLM,
author = "Richard J. Fateman",
title = "A {Lisp}-Language {Mathematica-to-Lisp} Translator",
journal = j-SIGSAM,
volume = "24",
number = "2",
pages = "19--21",
month = apr,
year = "1990",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Thu Mar 20 16:02:15 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Wide distribution of the computer algebra system
Mathematica has encouraged numerous programmers,
researchers and educators to produce libraries of
programs in its special language, for incorporation as
'packages' into Mathematica systems. Some authors have
found that the Mathematica proprietary computer program
has problematical and difficult-to-alter semantics. An
initial step in opening up such user-written libraries
to re-use is an independent re-implementation of the
language via a non-proprietary parser. The author
describes a parser written in Common Lisp, a language
which is appropriate for three reasons: it is a
standard and has wide distribution; it supports
numerous useful features including automatic storage
allocation and garbage collection, arbitrary-precision
integers and tools for lexical scanning of languages;
and Lisp is the host language for several algebraic
manipulation systems whose subroutines may be of some
interest for programmers implementing alternative
semantics.",
acknowledgement = ack-nhfb,
affiliation = "California Univ., Berkeley, CA, USA",
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C6150C (Compilers, interpreters
and other processors); C6140D (High level languages);
C6110 (Systems analysis and programming); C6130 (Data
handling techniques)",
classification = "C6110 (Systems analysis and programming); C6130
(Data handling techniques); C6140D (High level
languages); C6150C (Compilers, interpreters and other
processors); C7310 (Mathematics)",
corpsource = "California Univ., Berkeley, CA, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "92",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra system Mathematica; algebraic manipulation
systems; Algebraic manipulation systems; Alternative
semantics; alternative semantics; arbitrary-precision
integers; Arbitrary-precision integers; automatic
storage allocation; Automatic storage allocation;
Common Lisp; computer; Computer algebra system
Mathematica; difficult-to-alter semantics;
Difficult-to-alter semantics; Educators; educators;
Garbage collection; garbage collection; host language;
Host language; implementation; independent re-;
Independent re-implementation; lexical; Lexical
scanning; libraries; Libraries; LISP; Lisp-language
Mathematica-to-Lisp translator; Mathematica;
Mathematica proprietary computer program; Mathematica
systems; non-proprietary parser; Non-proprietary
parser; program compilers; program interpreters;
programmers; Programmers; programming; proprietary
computer program; Re-use; re-use; researchers;
Researchers; scanning; Standard; standard; Subroutines;
subroutines; symbol manipulation; User-written
libraries; user-written libraries; wide distribution;
Wide distribution",
thesaurus = "LISP; Program compilers; Program interpreters;
Programming; Subroutines; Symbol manipulation",
treatment = "P Practical",
}
@Article{Weber:1990:EHP,
author = "Ken Weber",
title = "An Experiment in High-precision Arithmetic on Shared
Memory Multiprocessors",
journal = j-SIGSAM,
volume = "24",
number = "2",
pages = "22--40",
month = apr,
year = "1990",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C5440 (Multiprocessor systems and
techniques); C1160 (Combinatorial mathematics)",
corpsource = "Dept. of Math. Sci., Kent State Univ., OH, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "92",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "arbitrary-precision integer arithmetic; computational
number theory; high-precision arithmetic;
intelligently; mathematics computing; number theory;
package; parallel computation; parallel machines;
parallel programming; shared memory multiprocessors;
symbol manipulation",
treatment = "P Practical",
}
@Article{Conti:1990:HCF,
author = "Pasqualina Conti",
title = "{Hermite} Canonical Form and {Smith} Canonical Form of
a Matrix over a Principal Ideal Domain",
journal = j-SIGSAM,
volume = "24",
number = "3",
pages = "8--16",
month = jul,
year = "1990",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:00 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "B0290H (Linear algebra); C4140 (Linear algebra)",
corpsource = "Istituto di Matematiche Applicate, Pisa Univ., Italy",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "93",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "determinant; equivalence class; Hermite canonical
form; identity matrix; matrix; matrix algebra;
principal ideal domain; Smith canonical form; times",
treatment = "T Theoretical or Mathematical",
}
@Article{Sendra:1990:HMC,
author = "Juan R. Sendra",
title = "{Hankel} Matrices and Computer Algebra",
journal = j-SIGSAM,
volume = "24",
number = "3",
pages = "17--26",
month = jul,
year = "1990",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:00 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4140 (Linear algebra); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Math., Alcala Univ., Madrid, Spain",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "93",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "asymptotic complexity; computational complexity;
computations; computer algebra; computing time
analysis; extended polynomial gcd problem;
factorization; Hankel matrices; matrix algebra;
modular; multivariate polynomial resultants; polynomial
gcd; polynomials; real roots; symbolic manipulation",
treatment = "T Theoretical or Mathematical",
}
@Article{Pigquette:1990:TSF,
author = "Jean C. Pigquette",
title = "Table of special function integrals",
journal = j-SIGSAM,
volume = "24",
number = "4",
pages = "8--21",
month = oct,
year = "1990",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Piquette:1990:TSF,
author = "Jean C. Piquette",
title = "Table of Special Function Integrals",
journal = j-SIGSAM,
volume = "24",
number = "4",
pages = "8--21",
month = oct,
year = "1990",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Thu Mar 20 16:02:15 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4180 (Integral equations); C4160 (Numerical
integration and differentiation)",
corpsource = "Naval Res. Lab., Underwater Sound Reference
Detachment, Orlando, FL, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "94",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "arbitrary function; Bessel functions; Chebychev
polynomials; Gegenbauer; Hermite functions; integral
equations; integration; Jacobi polynomials; Laguerre
functions; Legendre functions; polynomials; special
function integrals; special function integration;
symbolic evaluation",
treatment = "T Theoretical or Mathematical",
}
@Article{dosSantos:1990:DEH,
author = "R. P. {dos Santos} and W. L. Roque",
title = "On the Design of an Expert Help System for Computer
Algebra Systems",
journal = j-SIGSAM,
volume = "24",
number = "4",
pages = "22--25",
month = oct,
year = "1990",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C6170 (Expert systems)",
corpsource = "Inst. fur Algorithmen und Kognitive Syst., Karlsruhe
Univ., West Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "94",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "computer algebra systems; domain knowledge base;
expert help system; expert systems; format reasoning;
hybrid knowledge; knowledge representation; MANTRA;
mathematics computing; REDUCE; representation system;
shell; Smart Help",
treatment = "P Practical",
}
@Article{Trevisan:1990:RHP,
author = "Vilmar Trevisan",
title = "Recognition of {Hurwitz} Polynomials",
journal = j-SIGSAM,
volume = "24",
number = "4",
pages = "26--32",
month = oct,
year = "1990",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4130 (Interpolation and function approximation);
C4240 (Programming and algorithm theory)",
corpsource = "Kent State Univ., Dept. of Math. and Comput. Sci., OH,
USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "94",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithm; algorithm theory; Euclidean; Hurwitz
polynomials; machine examples; polynomials; recognition
algorithm; timing",
treatment = "T Theoretical or Mathematical",
}
@Article{Baladi:1990:PCP,
author = "V. Baladi and J. P. Guillement",
title = "A Program for Computing {Puiseux} expansions",
journal = j-SIGSAM,
volume = "24",
number = "4",
pages = "33--41",
month = oct,
year = "1990",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C4130 (Interpolation and function
approximation)",
corpsource = "Section de Math., Geneve Univ., Switzerland",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "94",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebraic; algebraic subprograms; algorithm; curve
fitting; curves; expansions; extensions; finite
Puiseux; mathematics computing; Pascal implementation;
Pascal listings; plane algebraic; polynomials; rational
coefficients; singularities; two-variable polynomial
equation",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Dedieu:1990:SVD,
author = "J. P. Dedieu and G. Norton",
title = "{Stewart} Varieties: a Direct Algebraic Model for
{Stewart} Platforms",
journal = j-SIGSAM,
volume = "24",
number = "4",
pages = "42--59",
month = oct,
year = "1990",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4150 (Nonlinear and functional equations)",
corpsource = "Lab. d'Analyse Numerique Math., Univ. Paul Sabatier,
Toulouse, France",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "94",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "base plane; bounded solutions; classical determinant
identity; diagonals; equations; lines; method;
modelling; Newton; nonlinear algebraic; nonlinear
equations; octahedron; platform coordinates; squares;
Stewart varieties; symmetric; triangular Stewart
platform; unlinked articulation points",
treatment = "T Theoretical or Mathematical",
}
@Article{Schwarz:1991:MOG,
author = "Fritz Schwarz",
title = "Monomial Orderings and {Gr{\"o}bner} Bases",
journal = j-SIGSAM,
volume = "25",
number = "1",
pages = "10--23",
month = jan,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C1110 (Algebra); C4140 (Linear
algebra)",
corpsource = "GMD Inst., St. Augustin, Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "95",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; matrix algebra; polynomials; symbol
manipulation; computer algebra; Thomas theorem;
multivariate polynomial; Gr{\"o}bner bases; monomial
ordering; ordering relations; admissible ordering;
MACOT; matrix; cotes; Scratchpad",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Char:1991:RAM,
author = "Bruce W. Char",
title = "Report on the 8th {Annual Maple Workshop}",
journal = j-SIGSAM,
volume = "25",
number = "1",
pages = "24--24",
month = jan,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Sep 06 07:03:09 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "95",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:1991:PTC,
author = "Anonymous",
title = "Proceedings of the {Third CAYLEY Users Conference,
November 17--19, 1988, Universit{\"a}t Essen}",
journal = j-SIGSAM,
volume = "25",
number = "1",
pages = "25--81",
month = jan,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Thu Mar 20 16:02:15 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/magma.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C1110 (Algebra); C4140 (Linear
algebra)",
conflocation = "Essen, West Germany; 17-19 Nov. 1988",
conftitle = "Third CAYLEY Users Conference",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "95",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "2-modular representations; algebra; CAYLEY; character
degrees; character tables; common data; commutativity;
computer algebra system; conjugacy classes;
descriptions; group; group ring package; group theory;
high level language; mathematics computing; matrix;
maximal; normal subgroups; p-groups; permutations;
power-commutator; presentations; representation theory;
simple groups; structures; subgroups; Sylow subgroups;
symbol manipulation; symplectic groups;
vertex-transitive graphs; Wielandt length",
treatment = "P Practical; T Theoretical or Mathematical; X
Experimental",
}
@Article{Dockx:1991:CTC,
author = "Kris Dockx and Paul Igodt",
title = "Character tables and commutativity of normal
subgroups",
journal = j-SIGSAM,
volume = "25",
number = "1",
pages = "28--31",
month = jan,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/magma.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra); C7310 (Mathematics)",
conflocation = "Essen, West Germany; 17-19 Nov. 1988",
conftitle = "Third CAYLEY Users Conference",
corpsource = "Katholieke Univ. Leuven, Kortrijk, Belgium",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "95",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "abelian; CAYLEY; character table; conjugate classes;
finite groups; group theory; mathematics computing;
normal subgroup; permutation characters; symbol
manipulation",
treatment = "T Theoretical or Mathematical; X Experimental",
}
@Article{Glasby:1991:EGD,
author = "S. P. Glasby",
title = "Extensions of groups defined by power-commutator
presentations",
journal = j-SIGSAM,
volume = "25",
number = "1",
pages = "32--35",
month = jan,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/magma.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C1110 (Algebra)",
conflocation = "Essen, West Germany; 17-19 Nov. 1988",
conftitle = "Third CAYLEY Users Conference",
corpsource = "Dept. of Math., Victoria Univ. of Wellington, New
Zealand",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "95",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "AG-; algebra; Auflosbare Gruppen; CAYLEY; divisor;
finite soluble group; group theory; group-theory
language; manipulation; mathematics computing;
pc-presentation group; power-commutator presentations;
symbol; system",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Gollan:1991:MRP,
author = "Holger W. Gollan",
title = "The $2$-modular representation of {$ J_1$} in the
principal block",
journal = j-SIGSAM,
volume = "25",
number = "1",
pages = "36--39",
month = jan,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/magma.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C1110 (Algebra); C4140 (Linear
algebra)",
conflocation = "Essen, West Germany; 17-19 Nov. 1988",
conftitle = "Third CAYLEY Users Conference",
corpsource = "Inst. for Exp. Math., Essen Univ., West Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "95",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; CAYLEY-procedures; finite group;
Green-correspondents; group theory; mathematics
computing; matrix; modular irreducible modules; modular
representation theory; p-; prime; sources; symbol
manipulation; vertices",
treatment = "T Theoretical or Mathematical",
}
@Article{Grams:1991:SGR,
author = "Gerhard Grams",
title = "Special generators and relations for some orthogonal
and symplectic groups over {GF(2)}",
journal = j-SIGSAM,
volume = "25",
number = "1",
pages = "39--45",
month = jan,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/magma.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C1110 (Algebra); C4140 (Linear
algebra)",
conflocation = "Essen, West Germany; 17-19 Nov. 1988",
conftitle = "Third CAYLEY Users Conference",
corpsource = "Math. Inst., Giessen, Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "95",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; CAYLEY; Coxeter graph; Coxeter groups;
epimorphic images; group theory; infinite; isomorphism
classes; manipulation; mathematics computing; special
finite quotients; symbol; symplectic groups;
Todd--Coxeter-algorithm",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Jamali:1991:LSG,
author = "A. R. Jamali and E. F. Robertson",
title = "A library of simple groups: permutations,
presentations, conjugacy classes, maximal subgroups and
{Sylow} subgroups",
journal = j-SIGSAM,
volume = "25",
number = "1",
pages = "46--49",
month = jan,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/magma.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C1110 (Algebra); C4140 (Linear
algebra)",
conflocation = "Essen, West Germany; 17-19 Nov. 1988",
conftitle = "Third CAYLEY Users Conference",
corpsource = "Math. Inst., St. Andrews Univ., UK",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "95",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "conjugacy classes; group theory; mathematics
computing; maximal subgroups; Sylow subgroups; symbol
manipulation",
treatment = "P Practical",
}
@Article{Newman:1991:WLS,
author = "M. F. Newman and E. A. O'Brien",
title = "The {Wielandt} length of some $3$-groups",
journal = j-SIGSAM,
volume = "25",
number = "1",
pages = "50--51",
month = jan,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/magma.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C1110 (Algebra); C4140 (Linear
algebra)",
conflocation = "Essen, West Germany; 17-19 Nov. 1988",
conftitle = "Third CAYLEY Users Conference",
corpsource = "Sch. of Math. Sci., Australian Nat. Univ., Canberra,
ACT, Australia",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "95",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "CAYLEY; group theory; machine-aided computation;
mathematics computing; Nilpotent Quotient Program;
symbol manipulation; Wielandt length",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{OBrien:1991:PEA,
author = "E. A. O'Brien",
title = "Providing electronic access to group descriptions",
journal = j-SIGSAM,
volume = "25",
number = "1",
pages = "52--56",
month = jan,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/magma.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C1110 (Algebra); C4140 (Linear
algebra)",
conflocation = "Essen, West Germany; 17-19 Nov. 1988",
conftitle = "Third CAYLEY Users Conference",
corpsource = "Marquette Univ., Milwaukee, WI, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "95",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "CAYLEY; GPS256; group descriptions; group theory;
manipulation; mathematics computing; matrix algebra;
p-group generation algorithm; symbol; TWOGPS",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Royle:1991:CVT,
author = "Gordon F. Royle",
title = "Constructing the vertex-transitive graphs on 24
vertices",
journal = j-SIGSAM,
volume = "25",
number = "1",
pages = "56--59",
month = jan,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/magma.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C1110 (Algebra); C4140 (Linear
algebra); C1160 (Combinatorial mathematics)",
conflocation = "Essen, West Germany; 17-19 Nov. 1988",
conftitle = "Third CAYLEY Users Conference",
corpsource = "Dept. of Math., Univ. of Western Australia, Nedlands,
WA, Australia",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "95",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "doubly; graph theory; group theory; manipulation;
mathematics computing; smallest non-trivial block
system; symbol; transitive; twenty-four vertices;
vertex-transitive graphs",
treatment = "T Theoretical or Mathematical; X Experimental",
}
@Article{Sandling:1991:GRP,
author = "Robert Sandling",
title = "A group ring package for {Cayley}",
journal = j-SIGSAM,
volume = "25",
number = "1",
pages = "60--64",
month = jan,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/magma.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C1110 (Algebra); C4140 (Linear
algebra)",
conflocation = "Essen, West Germany; 17-19 Nov. 1988",
conftitle = "Third CAYLEY Users Conference",
corpsource = "Dept. of Math., Manchester Univ., UK",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "95",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "arithmetic operations; CAYLEY; group ring facility;
group theory; mathematics computing; structural
investigations; symbol manipulation",
treatment = "T Theoretical or Mathematical",
}
@Article{Schneider:1991:RTC,
author = "Gerhard J. A. Schneider",
title = "Representation theory in {CAYLEY}: tools and
algorithms",
journal = j-SIGSAM,
volume = "25",
number = "1",
pages = "64--70",
month = jan,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/magma.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C1110 (Algebra); C4140 (Linear
algebra)",
conflocation = "Essen, West Germany; 17-19 Nov. 1988",
conftitle = "Third CAYLEY Users Conference",
corpsource = "Inst. fur Experimentelle Math., Essen Univ., Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "95",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "abstract; CAYLEY; computer algebra; field; group;
group theory; manipulation; mathematics computing;
matrix algebra; matrix group; representation theory;
symbol; vector space",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Slattery:1991:CDG,
author = "Michael C. Slattery",
title = "Character degrees of $p$-groups: a case study",
journal = j-SIGSAM,
volume = "25",
number = "1",
pages = "71--74",
month = jan,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/magma.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra); C7310 (Mathematics); C4140 (Linear
algebra)",
conflocation = "Essen, West Germany; 17-19 Nov. 1988",
conftitle = "Third CAYLEY Users Conference",
corpsource = "Marquette Univ., Milwaukee, WI, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "95",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; derived; finite p-group; group theory;
irreducible character degrees; length; mathematics
computing; matrix; symbol manipulation",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Cannon:1991:BCC,
author = "John Cannon",
title = "A bibliography of {Cayley} citations",
journal = j-SIGSAM,
volume = "25",
number = "1",
pages = "75--81",
month = jan,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/magma.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra); C7310 (Mathematics); C4140 (Linear
algebra)",
conflocation = "Essen, West Germany; 17-19 Nov. 1988",
conftitle = "Third CAYLEY Users Conference",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "95",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; CAYLEY; computational; computer algebra
system; group theory; mathematical research;
mathematics computing; matrix; symbol manipulation",
treatment = "B Bibliography",
}
@Article{Salvy:1991:EAA,
author = "Bruno Salvy",
title = "Examples of automatic asymptotic expansions",
journal = j-SIGSAM,
volume = "25",
number = "2",
pages = "4--17",
month = apr,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Describes the current state of a Maple library, gdev,
designed to perform asymptotic expansions for a large
class of expressions. Many examples are provided, along
with a short sketch of the underlying principles. At
the time when this report is written, a striking
feature of these examples is that none of them can be
computed directly with any of today's most widespread
symbolic computation systems (Macsyma, Mathematica,
Maple or Scratchpad II).",
acknowledgement = ack-nhfb,
affiliation = "LIX, Ecole Polytech., Palaiseau, France",
ajournal = "SIGSAM Bull.",
classcodes = "C6130 (Data handling techniques); C7310
(Mathematics)",
classification = "C6130 (Data handling techniques); C7310
(Mathematics)",
corpsource = "LIX, Ecole Polytech., Palaiseau, France",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "96",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "automatic asymptotic expansions; Automatic asymptotic
expansions; expressions; Expressions; gdev; Gdev; Maple
library; symbol manipulation; symbolic computation
systems; Symbolic computation systems",
thesaurus = "Symbol manipulation",
treatment = "T Theoretical or Mathematical",
}
@Article{Jank:1991:CMU,
author = "Gerhard Jank and Lutz H. Tack",
title = "Conformal mapping using {Bergman}'s method and the
{Maple} system",
journal = j-SIGSAM,
volume = "25",
number = "2",
pages = "18--23",
month = apr,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The paper uses the Bergman kernel method (BKM) for
solving conformal mapping problems. In contrast to most
conformal mapping techniques, the approximation of the
solution is an analytic function. The main drawback of
the method, however, is that it involves an
orthonormalization process and thus is numerically
unstable. This disadvantage can be overcome by using
the Maple system which makes no use of Gaussian
quadrature, so that approximation errors are almost
entirely avoided. It tested how some typical domains
can be treated. Using theorems of Walsh (1929) and
Simonenko (1978) it determines a number N such that the
error of the N-th approximation of the mapping function
remains under a desired value. It compares the obtained
results to the sharp asymptotic estimates of Gaier
(1988) and to numerical results of Levin, Papamichael
and Sideridis (1978) and Papamichael and Warby
(1986).",
acknowledgement = ack-nhfb,
affiliation = "RWTH Aachen, Germany",
ajournal = "SIGSAM Bull.",
classcodes = "C6130 (Data handling techniques); C7310 (Mathematics);
C4130 (Interpolation and function approximation)",
classification = "C4130 (Interpolation and function approximation);
C6130 (Data handling techniques); C7310 (Mathematics)",
corpsource = "RWTH Aachen, Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "96",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "analytic function; Analytic function; approximation;
Approximation; approximation theory; Bergman kernel
method; conformal mapping; Conformal mapping; error;
Error; function; Maple system; mapping; Mapping
function; numerically unstable; Numerically unstable;
orthonormalization; Orthonormalization; sharp
asymptotic estimates; Sharp asymptotic estimates;
Simonenko; symbol manipulation; Walsh",
thesaurus = "Approximation theory; Symbol manipulation",
treatment = "T Theoretical or Mathematical",
}
@Article{Buchanan:1991:STP,
author = "S. Alasdair Buchanan",
title = "Some Theoretical Problems When Solving Systems of
Polynomial Equations Using {Gr{\"o}bner} Bases",
journal = j-SIGSAM,
volume = "25",
number = "2",
pages = "24--27",
month = apr,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6130 (Data handling techniques); C7310 (Mathematics);
C1110 (Algebra); C4130 (Interpolation and function
approximation)",
corpsource = "Dept. of Mech. Eng., Leeds Univ., UK",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "96",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "polynomials; symbol manipulation; polynomial
equations; roots; zero dimensional Gr{\"o}bner bases;
rational field",
treatment = "T Theoretical or Mathematical",
}
@Article{Barnett:1991:SSW,
author = "Michael P. Barnett",
title = "Some Simple Ways to Construct and to Use Formulas
Mechanically",
journal = j-SIGSAM,
volume = "25",
number = "2",
pages = "28--36",
month = apr,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. and Inf. Sci., Brooklyn Coll., City
Univ., New York, NY, USA",
ajournal = "SIGSAM Bull.",
classcodes = "C6130 (Data handling techniques); C7310
(Mathematics)",
classification = "C6130 (Data handling techniques); C7310
(Mathematics)",
corpsource = "Dept. of Comput. and Inf. Sci., Brooklyn Coll., City
Univ., New York, NY, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "96",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "crules; Crules; grules; Grules; integrals;
interpretive manipulation; Interpretive manipulation;
Mathematica procedures; mechanical formula
construction; Mechanical formula construction;
molecular; Molecular integrals; quantum chemistry;
Quantum chemistry; string manipulation; String
manipulation; subexpressions; Subexpressions; symbol
manipulation; symbolic evaluation; Symbolic
evaluation",
thesaurus = "Symbol manipulation",
treatment = "T Theoretical or Mathematical",
}
@Article{Zeilberger:1991:MPP,
author = "Doron Zeilberger",
title = "A {Maple} program for proving hypergeometric
identities",
journal = j-SIGSAM,
volume = "25",
number = "3",
pages = "4--13",
month = jul,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Gives the listing of a MAPLE program for implementing
an algorithm for proving any terminating definite
hypergeometric identity, and more generally, for
finding the linear recurrence satisfied by any definite
hypergeometric sum R(n):= Sigma /sub k/F(n,k), where
F(n,k) has the form x/sup k/(Pi /sub i=1//sup m/( alpha
/sub i/n+ beta /sub i/k+c/sub i/)!/ Pi /sub i'=1//sup
m'/(alpha '/sub i'/n+ beta '/sub i'/k+c'/sub i'/)!).
The algorithm for definite hypergeometric summation
relies on Gosper's (1978) ingenious decision procedure
for indefinite summation, but not in the obvious
way!.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Math. and Comput. Sci., Drexel Univ.,
Philadelphia, PA, USA",
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics)",
classification = "C7310 (Mathematics)",
corpsource = "Dept. of Math. and Comput. Sci., Drexel Univ.,
Philadelphia, PA, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "97",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "definite; Definite hypergeometric summation;
hypergeometric identity; hypergeometric summation;
linear recurrence; Linear recurrence; manipulation;
MAPLE program; mathematics computing; proofs; Proofs;
public domain software; shareware; Shareware; symbol;
terminating definite; Terminating definite
hypergeometric identity; theorem proving",
thesaurus = "Mathematics computing; Public domain software; Symbol
manipulation; Theorem proving",
treatment = "P Practical",
}
@Article{Almkvist:1991:MPF,
author = "Gert Almkvist and Doron Zeilberger",
title = "A {Maple} program that finds, and proves, recurrences
and differential equations satisfied by
hyperexponential definite integrals",
journal = j-SIGSAM,
volume = "25",
number = "3",
pages = "14--17",
month = jul,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In {\em J. Symbolic Computation}, vol. 10, p. 571
(1990), the authors described an algorithm that given a
hyperexponential function of two variables $ F(x, y) $,
produces a differential equation satisfied by $ A(x) :=
\int_{- \infty }^{\infty } F(x, y) \! d y $. A function
$ F(x, y) $ is hyperexponential if both $ F_x(x, y) /
F(x, y) $ and $ F_y(x, y) / F(x, y) $ are rational
functions of $ (x, y) $. $ A(x) $ always satisfies a
linear differential equation with polynomial
coefficients. The authors give a MAPLE program that
implements that algorithm. The same algorithm, and
program also finds, and proves, linear recurrences
satisfied by expressions of the form $ A(n) := \int_{-
\infty }^{\infty } F(n, y) \! d y $, where $ F(n, y) $
is hyperexponential in $y$ and hypergeometric in $ n :
D_y F(n, y) / F(n, y)$ and $ F(n + 1, y) / F(n, y)$ are
both rational functions in $ (n, y)$. Since many
special function identities have one of the above
forms, the authors' program is able to prove many
non-trivial identities in the theory of special
functions.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Math., Lund Univ., Sweden",
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics)",
classification = "C7310 (Mathematics)",
corpsource = "Dept. of Math., Lund Univ., Sweden",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "97",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "computing; differential equations; Differential
equations; hyperexponential definite integrals;
Hyperexponential definite integrals; hypergeometric
function; Hypergeometric function; integral equations;
linear recurrences; Linear recurrences; MAPLE program;
mathematics; polynomial coefficients; Polynomial
coefficients; proofs; Proofs; rational functions;
Rational functions; special function identities;
Special function identities; symbol manipulation;
theorem proving",
thesaurus = "Differential equations; Integral equations;
Mathematics computing; Symbol manipulation; Theorem
proving",
treatment = "P Practical",
}
@Article{Wang:1991:TMI,
author = "Dongming Wang",
title = "A toolkit for manipulating indefinite summations with
application to neural networks",
journal = j-SIGSAM,
volume = "25",
number = "3",
pages = "18--27",
month = jul,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Presents the design and implementation of a toolkit in
MACSYMA for the manipulation of indefinite summations
which is of interest and commonly used in mathematical
derivations. The differentiation and integration of
indefinite summations with respect to indexed variables
are considered in particular. The development of this
toolkit was motivated by and has its major purpose for
the author's investigation in the computer aided
analysis and derivation of artificial neural networks.
The application of the toolkit to this subject is
briefly discussed.",
acknowledgement = ack-nhfb,
affiliation = "Res. Inst. for Symbolic Comput., Johannes Kepler
Univ., Linz, Austria",
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C1230 (Artificial intelligence);
C7430 (Computer engineering)",
classification = "C1230 (Artificial intelligence); C7310
(Mathematics); C7430 (Computer engineering)",
corpsource = "Res. Inst. for Symbolic Comput., Johannes Kepler
Univ., Linz, Austria",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "97",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "computer aided analysis; Computer aided analysis;
computer aided analysis; differentiation;
Differentiation; differentiation; Indefinite
summations; indefinite summations; indexed variables;
Indexed variables; Integration; integration; MACSYMA;
mathematical derivations; Mathematical derivations;
mathematics computing; neural nets; Neural networks;
neural networks; symbol manipulation; Toolkit;
toolkit",
thesaurus = "Computer aided analysis; Differentiation; Integration;
Mathematics computing; Neural nets; Symbol
manipulation",
treatment = "A Application; P Practical",
}
@Article{Broughan:1991:SSC,
author = "K. A. Broughan and G. Keady and T. D. Robb and M. G.
Richardson and M. C. Dewar",
title = "Some Symbolic Computing Links to the {NAG} Numeric
Library",
journal = j-SIGSAM,
volume = "25",
number = "3",
pages = "28--37",
month = jul,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This article intended to help readers compare the
three products, SENAC, InterCall and IRENA. Each of the
three is in the Numerical Algorithms Group (Fortran
77). SENAC is a package developed by the Mathematical
Software Project at the University of Waikato. SENAC
includes a symbolic manipulation interpreter (Sencore),
together with high level interfaces to the NAG Fortran
Library (Numlink) and NAG Graphics Library (Graflink).
The system evolved from an interface, Naglink, between
the NAG Library and the symbolic manipulation language
Macsyma. The Sensore interpreter is written in Common
LISP and belongs to the Macsyma/Maple/Reduce family of
languages. It is easy to load user-written files
written in Common LISP or in SENAC. InterCall is a
Mathematica package that enables its user to
interactively call external code, for example from an
external numeric library. It allows various default
settings to be defined for any arguments that need to
be passed to any routine in that code, and initial
default settings for all the routines in the IMSL and
NAG libraries are included with InterCall in the form
of a small defaults-database file. IRENA-an Interface
from Reduce to NAG-runs under the Reduce computer
algebra system and provides an interactive front end to
the NAG Library. It has been designed to make the use
of the NAG Library considerably simpler, in a number of
ways.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Math. and Stat., Waikato Univ., Hamilton, New
Zealand",
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C6180 (User interfaces)",
classification = "C6180 (User interfaces); C7310 (Mathematics)",
corpsource = "Dept. of Math. and Stat., Waikato Univ., Hamilton, New
Zealand",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "97",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra system; argument passing; Argument passing;
Common LISP; computer; Computer algebra system;
default; Default settings; defaults-database file;
Defaults-database file; external code; External code;
FORTRAN; Graflink; high level; High level interfaces;
IMSL; interactive front end; Interactive front end;
InterCall; interfaces; IRENA; Library; Macsyma;
Mathematica package; NAG Fortran Library; NAG Graphics;
NAG Graphics Library; Naglink; numeric library; Numeric
library; Numerical Algorithms Group; Numlink; Reduce;
SENAC; Sencore; settings; subroutines; symbol
manipulation; symbolic computing; Symbolic computing;
symbolic manipulation interpreter; Symbolic
manipulation interpreter; user interfaces; user-written
files; User-written files",
thesaurus = "FORTRAN; Subroutines; Symbol manipulation; User
interfaces",
treatment = "P Practical; R Product Review",
}
@Article{Anonymous:1991:SCR,
author = "Anonymous",
title = "Symbolic computation research in {Italy}",
journal = j-SIGSAM,
volume = "25",
number = "3",
pages = "38--48",
month = jul,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fateman:1991:SDP,
author = "Richard J. Fateman and Derek T. Lai",
title = "A Simple Display Package for Polynomials and Rational
Functions in {Common Lisp}",
journal = j-SIGSAM,
volume = "25",
number = "4",
pages = "1--3",
month = oct,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C6130 (Data handling techniques);
C6140D (High level languages)",
corpsource = "California Univ., Berkeley, CA, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "98",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "Common Lisp; Common Lisp environment; computer;
computer algebra systems; conventional notation;
fraction bars; internal notation; LISP; mathematical
computation; mathematics computing; raised
superscripts; scientists; simple mathematical display
package; symbol manipulation; systems developers",
treatment = "P Practical",
}
@Article{Yan:1991:RFA,
author = "Tak W. Yan",
title = "A Rational Function Arithmetic and Simplification
System in {Common Lisp}",
journal = j-SIGSAM,
volume = "25",
number = "4",
pages = "4--6",
month = oct,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C6140D (High level languages)",
corpsource = "California Univ., Berkeley, CA, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "98",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "arithmetic simplification; Common Lisp;
exponentiation; freely-distributed computer algebra;
LISP; Lisp prefix form; mathematics computing;
multiplication; multivariate rational function;
rational addition; rational expressions; symbol
manipulation; system",
treatment = "P Practical",
}
@Article{Bulter:1991:TDD,
author = "Greg Bulter and Sridhar S. Iyer",
title = "Towards a deductive database for small simple groups",
journal = j-SIGSAM,
volume = "25",
number = "4",
pages = "7--17",
month = oct,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "98",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Butler:1991:TDD,
author = "G. Butler and S. S. Iyer",
title = "Towards a Deductive Database for Small Simple Groups",
journal = j-SIGSAM,
volume = "25",
number = "4",
pages = "7--17",
month = oct,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Thu Mar 20 16:02:15 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C6160K (Deductive databases);
C6110L (Logic programming); C6170 (Expert systems);
C6140D (High level languages)",
corpsource = "Dept. of Comput. Sci., Sydney Univ., NSW, Australia",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "98",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "abelian simple groups; algebra; arbitrary; character
strings; computing; database technology; deductive
databases; feasibility study; formulae; infinite
precision numbers; irrational; lists; logic
programming; mathematics; modern algebra; non-;
numbers; precision integers; primitive data types;
PROLOG; Prolog deductive; tables",
treatment = "P Practical",
}
@Article{Reeves:1991:WOA,
author = "Alyson A. Reeves",
title = "The Worst Order Is Not Always the Lexicographic
Order",
journal = j-SIGSAM,
volume = "25",
number = "4",
pages = "18--19",
month = oct,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "98",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Rubio:1991:PCH,
author = "Julio Rubio and Francis Sergeraert",
title = "A Program Computing the Homology Groups of Loop
Spaces",
journal = j-SIGSAM,
volume = "25",
number = "4",
pages = "20--24",
month = oct,
year = "1991",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C6130 (Data handling techniques);
C4240 (Programming and algorithm theory)",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "98",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "computational complexity; homology groups;
hyper-exponential complexity; iterated loop spaces;
manipulation; mathematics computing; reduced
simplicial; set; symbol",
treatment = "P Practical",
}
@Article{Li:1992:NDB,
author = "Wei Li",
title = "Nonexistence of Degree Bounds of Various Bases for
Ideals of Polynomials Over the Integers",
journal = j-SIGSAM,
volume = "26",
number = "1",
pages = "4--9",
month = jan,
year = "1992",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4260 (Computational geometry)",
corpsource = "Dept. of Math. and Stat., McGill Univ., Montr{\'e}al,
Qu{\'e}., Canada",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "99",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "computational complexity; computational geometry;
polynomials; degree bounds; polynomials; integers;
Gr{\"o}bner bases; commutative algebra",
treatment = "T Theoretical or Mathematical",
}
@Article{Hollenhorst:1992:DDF,
author = "Manfred Hollenhorst",
title = "The Design of Digital Filters Using {REDUCE}",
journal = j-SIGSAM,
volume = "26",
number = "1",
pages = "10--12",
month = jan,
year = "1992",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:01 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C5240 (Digital filters); C5260 (Digital signal
processing); C7410F (Communications)",
corpsource = "Hochschulrechenzentrum der Justus-Liebig-Univ.,
Giessen, Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "99",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "analog filter; bilinear transform; computerised signal
processing; digital filters; manipulation; REDUCE;
symbol",
treatment = "T Theoretical or Mathematical",
}
@Article{Reeves:1992:EWO,
author = "A. A. Reeves",
title = "Erratum: ``{The Worst Order Is Not Always The
Lexicographic Order}''",
journal = j-SIGSAM,
volume = "26",
number = "1",
pages = "13--13",
month = jan,
year = "1992",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Sep 06 07:11:06 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "99",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Butler:1992:AAA,
author = "Greg Butler",
title = "An analysis of {Atkinson}'s algorithms",
journal = j-SIGSAM,
volume = "26",
number = "2",
pages = "1--9",
month = apr,
year = "1992",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C1160 (Combinatorial
mathematics)",
corpsource = "Dept. of Comput. Sci., Concordia Univ., Montr{\'e}al,
Qu{\'e}., Canada",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "100",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "group theory; linked lists; mathematics computing;
minimal invariant partition; path compression;
permutation group; primitivity; slow growing function;
speed-ups; trees; trees (mathematics); very",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Abdali:1992:SCC,
author = "S. Kamal Abdali and Guy W. Cherry and Neil Soiffer",
title = "Spreadsheet computations in computer algebra",
journal = j-SIGSAM,
volume = "26",
number = "2",
pages = "10--18",
month = apr,
year = "1992",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C6130B (Graphics techniques)",
corpsource = "Tektronix Labs., Beaverton, OR, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "100",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "clear semantics; computer graphics; intuitively;
MathScribe; spreadsheet computing; spreadsheet
programs; symbol manipulation; symbolic context;
symbolic expressions; visual computer algebra
environment",
treatment = "P Practical",
}
@Article{Sasaki:1992:IRC,
author = "T. Sasaki and M. Sasaki",
title = "On integer-to-rational conversion algorithm",
journal = j-SIGSAM,
volume = "26",
number = "2",
pages = "19--21",
month = apr,
year = "1992",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C5230 (Digital arithmetic
methods)",
corpsource = "Inst. of Math., Tsukuba Univ., Ibaraki, Japan",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "100",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "elementary proof; integer-to-rational conversion
algorithm; mathematics computing; number theory;
positive integer; rational number",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{vonzurGathen:1992:PFC,
author = "Joachim von zur Gathen",
title = "A polynomial factorization challenge",
journal = j-SIGSAM,
volume = "26",
number = "2",
pages = "22--24",
month = apr,
year = "1992",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "100",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:1992:WLI,
author = "Robert M. Corless and David J. Jeffrey",
title = "Well \ldots{} It Isn't Quite That Simple",
journal = j-SIGSAM,
volume = "26",
number = "3",
pages = "2--6",
month = aug,
year = "1992",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/141897.141901",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C6130 (Data handling techniques);
C6180 (User interfaces)",
corpsource = "Dept. of Appl. Math., Univ. of Western Ontario,
London, Ont., Canada",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "101",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "CAS results; computer algebra systems; discourse;
interactive sessions; interactive systems;
mathematical; mathematical expression; symbol
manipulation; user interfaces",
treatment = "P Practical",
}
@Article{Madore:1992:RAM,
author = "Blair F. Madore",
title = "Report on the {10th Annual Maple Retreat, June 13--17,
1992}",
journal = j-SIGSAM,
volume = "26",
number = "3",
pages = "7--8",
month = aug,
year = "1992",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "101",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Nataf:1992:ASN,
author = "Jean-Michel Nataf",
title = "Algorithm of simplification of nonlinear equations
systems",
journal = j-SIGSAM,
volume = "26",
number = "3",
pages = "9--16",
month = aug,
year = "1992",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "A simple, graph-theoretical algorithm is presented for
automatically reducing a nonlinear equation system
beforehand, by use of successive substitutions. The
algorithm treats the equation system as a graph, is
heuristic, and automatically chooses what substitutions
are likely to yield, at the end, the highest size
reduction. This system must not necessarily be
polynomial, can even be ill defined (then the algorithm
just performs reduction) and can be used even in the
presence of transcendental or a priori unknown
functions. Two implementations have been made, one for
FORTRAN, quicker but less efficient, and one in the
computer algebra language MACSYMA, slower but with
better reduction. The promises of computer algebra in
this field are investigated. Applications are then
presented to the reduction of equations systems
simulating the steady state behavior of HVAC systems in
buildings.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C6130 (Data handling techniques);
C4150 (Nonlinear and functional equations); C1160
(Combinatorial mathematics)",
classification = "C1160 (Combinatorial mathematics); C4150 (Nonlinear
and functional equations); C6130 (Data handling
techniques); C7310 (Mathematics)",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "101",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra language MACSYMA; behavior; buildings;
Buildings; computer; Computer algebra language MACSYMA;
equation system; Equation system; equations systems;
Equations systems; FORTRAN; graph theory;
graph-theoretical algorithm; Graph-theoretical
algorithm; HVAC systems; mathematics computing;
nonlinear equation system; Nonlinear equation system;
nonlinear equations; steady state; Steady state
behavior; successive substitutions; Successive
substitutions; symbol manipulation",
thesaurus = "Graph theory; Mathematics computing; Nonlinear
equations; Symbol manipulation",
treatment = "P Practical",
}
@Article{Kolar:1992:MQP,
author = "M. Kol{\'a}r and T. Sasaki",
title = "Multivariate Quotient by Power-series Division",
journal = j-SIGSAM,
volume = "26",
number = "3",
pages = "17--20",
month = aug,
year = "1992",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4130 (Interpolation and function approximation);
C7310 (Mathematics); C1110 (Algebra)",
corpsource = "Inst. of Phys. and Chem. Res. (RIKEN), Saitama,
Japan",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "101",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; degree bound; higher degree terms;
multivariate polynomials; polynomials; recursive
multivariate power-; series (mathematics); series
division",
treatment = "T Theoretical or Mathematical",
}
@Article{Gleibman:1992:SNP,
author = "Andrew H. Gleibman",
title = "{SAMPLE}: New Programming Technology and {AI}
Language",
journal = j-SIGSAM,
volume = "26",
number = "3",
pages = "21--29",
month = aug,
year = "1992",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6140D (High level languages); C6110L (Logic
programming); C6170 (Expert systems); C6130 (Data
handling techniques)",
corpsource = "Inst. of Theor. Astron., Russian Acad. of Sci., St.
Petersburg, Russia",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "101",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "AI languages family; algebraic programming; concepts;
data; examples; generalisation (artificial
intelligence); interpreter; logic programming; logic
programming languages; program examples; programming
language; programming technology; Sample language;
Sample programs; simple AI language; sophisticated
expert; symbol manipulation; systems",
treatment = "P Practical",
}
@Article{Hong:1992:PP,
author = "Hoon Hong and Wolfgang Schreiner",
title = "Programming in {PACLIB}",
journal = j-SIGSAM,
volume = "26",
number = "4",
pages = "1--6",
month = nov,
year = "1992",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C6110P (Parallel programming)",
corpsource = "Res. Inst. for Symbolic Comput., Johannes Kepler
Univ., Linz, Austria",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "102",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "computer algebra; computers; concurrency; mathematics
computing; multiprocessor; PACLIB; parallel; Parallel
Algebraic Computation; parallel algorithms;
parallelized garbage collection; pipelining;
programming; Sequent Symmetry; shared memory; shared
memory systems; speculative parallelism; storage
management; streams; symbol manipulation",
treatment = "P Practical",
}
@Article{Lacolle:1992:SAS,
author = "B. Lacolle",
title = "Spinor analysis and symbolic computation of partition
functions",
journal = j-SIGSAM,
volume = "26",
number = "4",
pages = "7--14",
month = nov,
year = "1992",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "A0550 (Lattice theory and statistics; Ising problems);
A0270 (Computational techniques); C4140 (Linear
algebra); C4240 (Programming and algorithm theory);
C7320 (Physics and Chemistry)",
corpsource = "Lab. LMC-IMAG, Grenoble, France",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "102",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "computational complexity; Ising model; Lenz-Ising
model; partition function; partition functions; physics
computing; polynomial time-complexity; spinors;
statistical mechanics; symbol manipulation; symbolic
computation; vectors",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Willcock:1992:TCL,
author = "Diane M. Koorey Willcock",
title = "{Tlisp}: {A Concurrent Lisp} for the {Transputers}",
journal = j-SIGSAM,
volume = "26",
number = "4",
pages = "15--23",
month = nov,
year = "1992",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6140D (High level languages); C6110P (Parallel
programming); C7310 (Mathematics); C4130 (Interpolation
and function approximation)",
corpsource = "Dept. of Math. and Stat., Waikato Univ., Hamilton, New
Zealand",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "102",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "computer algebra algorithms; concurrent LISP;
eval-server model; greatest common divisors; Helios
operating; interpolation; interpolation algorithm;
languages; LISP; mathematics computing; multivariate
polynomials; parallel; polynomials; symbol
manipulation; system; systems; Tlisp; transputer;
transputers; Xlisp",
treatment = "P Practical",
}
@Article{Shevchenko:1993:AND,
author = "Ivan I. Shevchenko and Nikolay N. Vasiliev",
title = "Algorithms of Numeric Deduction of Analytical
Expressions",
journal = j-SIGSAM,
volume = "27",
number = "1",
pages = "1--3",
month = jan,
year = "1993",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C6130 (Data handling techniques);
C4130 (Interpolation and function approximation)",
corpsource = "Inst. of Theor. Astron. Acad. of Sci., St. Petersburg,
Russia",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "103",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "deduction; elementary expressions; fixed exact numeric
values; homogeneous terms; interpolation; numeric;
Pade; restored expressions; statistical analysis;
statistical treatment; symbol manipulation; symbolic
parameters; verification",
treatment = "P Practical",
}
@Article{Shallit:1993:BAJ,
author = "Jeffrey Shallit and Jonathan Sorenson",
title = "A binary algorithm for the {Jacobi} symbol",
journal = j-SIGSAM,
volume = "27",
number = "1",
pages = "4--11",
month = jan,
year = "1993",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C6130 (Data handling techniques);
C1160 (Combinatorial mathematics)",
corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "103",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "binary algorithm; decimal digits; divisor; GCD;
greatest common; Jacobi symbol; number theory; symbol
manipulation; worst-case behavior",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Montes:1993:NCS,
author = "Antonio Montes",
title = "Numerical Conditioning of a System of Algebraic
Equations with a Finite Number of Solutions Using
{Gr{\"o}bner} Bases",
journal = j-SIGSAM,
volume = "27",
number = "1",
pages = "12--19",
month = jan,
year = "1993",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "It is known that Gr{\"o}bner bases approach can be
useful to solve systems of algebraic equations with a
finite number of solutions. Nevertheless, as stated by
B. Buchberger (1985), numerical accuracy attainable
when using floating point arithmetic is not yet
studied. The author discusses a numerical approach,
defining conveniently the condition number of every
root, and the numerical GCDs of Buchberger's algorithm.
With these instruments he is able to compute
confidence-intervals for the roots. He completes the
study with two illustrative examples. The author also
gives some insight about the best order of the
variables when pure lexicographical order is concerned.
(4 Refs.)",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Appl. Math., Univ. Politecnica de Catalunya,
Barcelona, Spain",
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C4130 (Interpolation and function
approximation); C5230 (Digital arithmetic methods)",
classification = "C4130 (Interpolation and function approximation);
C5230 (Digital arithmetic methods); C7310
(Mathematics)",
corpsource = "Dept. of Appl. Math., Univ. Politecnica de Catalunya,
Barcelona, Spain",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "103",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "Gr{\"o}bner bases approach; Algebraic equations;
Numerical accuracy; Floating point arithmetic;
Numerical approach; Numerical GCDs;
Confidence-intervals; Pure lexicographical order;
digital arithmetic; polynomials; symbol manipulation;
Gr{\"o}bner bases approach; algebraic equations;
numerical; accuracy; floating point arithmetic;
numerical approach; numerical GCDs;
confidence-intervals; pure lexicographical; order",
thesaurus = "Digital arithmetic; Polynomials; Symbol manipulation",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Koepf:1993:EAC,
author = "Wolfram Koepf",
title = "Examples for the Algorithmic Calculation of Formal
{Puisieux}, {Laurent} and Power Series",
journal = j-SIGSAM,
volume = "27",
number = "1",
pages = "20--32",
month = jan,
year = "1993",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Formal Laurent-Puisieux series (LPS) are important in
calculus and complex analysis. In some computer algebra
systems (CASs) it is possible to define an LPS by
direct or recursive definition of its coefficients.
Since some operations cannot be directly supported
within the LPS domain, some systems generally convert
LPS to finite truncated LPS for operations such as
addition, multiplication, division, inversion and
formal substitution. This results in a substantial loss
of information. Since a goal of computer algebra is to
work with formal objects and preserve such symbolic
information, CAS should be able to use LPS when
possible. There is a one-to-one correspondence between
formal power series with positive radius of convergence
and corresponding analytic functions. It should be
possible to automate conversion between these forms.
Among CASs only MACSYMA provides a procedure power
series to calculate LPS from analytic expressions in
certain special cases, but this is rather limited. W.
Koepf (1992) gave an algorithmic approach for computing
an LPS for a very rich family of functions. It covers
e.g. a high percentage of the power series that are
listed in the special series dictionary (E. R. Hansen,
1975). the algorithm has been implemented by W. Koepf
and A. Rennoch in the CAS Mathematica (1991). The
author presents some example results of the Mathematica
implementation which gives insight in the underlying
algorithmic procedure. (7 Refs.)",
acknowledgement = ack-nhfb,
affiliation = "Fachbereich Math., Freie Univ., Berlin, Germany",
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C6130 (Data handling
techniques)",
classification = "C6130 (Data handling techniques); C7310
(Mathematics)",
corpsource = "Fachbereich Math., Freie Univ., Berlin, Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "103",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithmic approach; Algorithmic approach;
algorithmic calculation; Algorithmic calculation;
calculus; Calculus; CAS Mathematica; complex analysis;
Complex analysis; computer algebra systems; Computer
algebra systems; convergence; Convergence;
corresponding analytic; Corresponding analytic
functions; dictionary; finite truncated LPS; Finite
truncated LPS; formal objects; Formal objects; Formal
power series; formal power series; functions;
Laurent-Puisieux series; LPS domain; MACSYMA;
Mathematica implementation; series (mathematics);
special series; Special series dictionary; symbol
manipulation; Symbolic information; symbolic
information; Underlying algorithmic procedure;
underlying algorithmic procedure",
thesaurus = "Series [mathematics]; Symbol manipulation",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Salvy:1993:EPM,
author = "Bruno Salvy",
title = "Efficient programming in {Maple}: a case study",
journal = j-SIGSAM,
volume = "27",
number = "2",
pages = "1--12",
month = apr,
year = "1993",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Studying the computation of orbits of some given group
acting on a set, the author shows how successive
refinements of a simple program provide a speedup
factor of up to 200. The initial program cannot solve
the problem at all, it is first converted into a
program which needs one c.p.u. week and after all the
optimizations have been performed, the computation
takes only four hours. Although the problem is
specific, he shows that many of the optimizations are
of interest for other problems as well. (4 Refs.)",
acknowledgement = ack-nhfb,
affiliation = "Algorithms Project, INRIA Rocquencourt, Le Chesnay,
France",
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C6110 (Systems analysis and
programming)C4140 (Linear algebra)",
classification = "C4140 (Linear algebra); C6110 (Systems analysis and
programming); C7310 (Mathematics)",
corpsource = "Algorithms Project, INRIA Rocquencourt, Le Chesnay,
France",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "104",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "Maple; mathematics computing; matrix algebra; Orbits;
orbits; programming; Programming; programming;
Successive refinements; successive refinements",
thesaurus = "Mathematics computing; Matrix algebra; Programming",
treatment = "P Practical",
}
@Article{Monagan:1993:GFC,
author = "Michael B. Monagan",
title = "{von zur Gathen}'s Factorization Challenge",
journal = j-SIGSAM,
volume = "27",
number = "2",
pages = "13--18",
month = apr,
year = "1993",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "J. von zur Gathen (ibid., vol.26, no.2, 1992) made a
polynomial factorization challenge to focus practical
efforts in the area of factorization over finite
fields. With more powerful machines and more time (the
longest factorization took 32 hours) this `brute-force'
approach will carry somewhat further, and probably
solve the first challenge: The author has factored
these polynomials on a DEC station 3100. (5 Refs.)",
acknowledgement = ack-nhfb,
affiliation = "Inst. fur Wissenschaftliches Rechnen, ETH Zentrum,
Zurich, Switzerland",
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics)",
classification = "C7310 (Mathematics)",
corpsource = "Inst. fur Wissenschaftliches Rechnen, ETH Zentrum,
Zurich, Switzerland",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "104",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "DEC; DEC station 3100; factorization; Factorization;
finite fields; Finite fields; Maple; mathematics
computing; polynomials; Polynomials; station 3100",
thesaurus = "Mathematics computing",
treatment = "P Practical",
}
@Article{Beutelspacher:1993:SIGa,
author = "Albrecht Beutelspacher and Johannes Ueberberg",
title = "{Symbolic Incidence Geometry}: Proposal for Doing
Geometry with a Computer (Part 1 of 2)",
journal = j-SIGSAM,
volume = "27",
number = "2",
pages = "19--29",
month = apr,
year = "1993",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C4260 (Computational geometry)",
corpsource = "Math. Inst., Giessen, Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "104",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "computational geometry; geometry; mathematics
computing; Symbolic Incidence Geometry",
treatment = "G General Review",
}
@Article{Kaltofen:1993:MC,
author = "Erich Kaltofen",
title = "Message from the Chair",
journal = j-SIGSAM,
volume = "27",
number = "3",
pages = "1--??",
month = sep,
year = "1993",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Sep 06 07:11:06 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "105",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cooperman:1993:LID,
author = "Gene Cooperman",
title = "Letter from the Information Director",
journal = j-SIGSAM,
volume = "27",
number = "3",
pages = "3--??",
month = sep,
year = "1993",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Sep 06 07:11:06 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "105",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Landau:1993:FMS,
author = "Susan Landau",
title = "Finding Maximal Subfields",
journal = j-SIGSAM,
volume = "27",
number = "3",
pages = "4--8",
month = sep,
year = "1993",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4130 (Interpolation and function approximation);
C1110 (Algebra)",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "105",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "computation; irreducible; maximal subfield computing;
minimal polynomial; polynomial solvability; polynomial
time; polynomials; symbol manipulation; symbolic",
treatment = "T Theoretical or Mathematical",
}
@Article{Beutelspacher:1993:SIGb,
author = "Albrecht Beutelspacher and Johannes Ueberberg",
title = "{Symbolic Incidence Geometry}: Proposal for Doing
Geometry with a Computer (Part 2 of 2)",
journal = j-SIGSAM,
volume = "27",
number = "3",
pages = "9--24",
month = sep,
year = "1993",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4260 (Computational geometry); C7310 (Mathematics)",
corpsource = "Math. Inst., Giessen, Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "105",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "affine plane; computational geometry; Extended SIG;
geometric; geometric algorithms; geometry; geometry
characterisation; geometry construction; geometry
transformation; isomorphisms; mathematics computing;
projective plane; structures; symbolic incidence
geometry; translation plane",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Anonymous:1993:SSC,
author = "Anonymous",
title = "{SymbMath} 2.2: a Symbolic Calculator with Learning",
journal = j-SIGSAM,
volume = "27",
number = "3",
pages = "25--??",
month = sep,
year = "1993",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Sep 06 07:11:06 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "105",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kaltofen:1993:DPT,
author = "Erich Kaltofen",
title = "Direct Proof of a Theorem by {Kalkbrener}, {Sweedler},
and {Taylor}",
journal = j-SIGSAM,
volume = "27",
number = "4",
pages = "2--2",
month = dec,
year = "1993",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4130 (Interpolation and function approximation);
C7310 (Mathematics); C6130 (Data handling techniques)",
corpsource = "Dept. of Comput. Sci., Rensselaer Polytech. Inst.,
Troy, NY, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "106",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "computer algebra; degree-bounds; direct proof; low
degree polynomials; polynomials; prime; symbol
manipulation; theorem proving",
treatment = "T Theoretical or Mathematical",
}
@Article{Gobel:1993:UBA,
author = "Manfred G{\"o}bel",
title = "Using {Buchberger}'s algorithm in invariant theory",
journal = j-SIGSAM,
volume = "27",
number = "4",
pages = "3--9",
month = dec,
year = "1993",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4130 (Interpolation and function approximation);
C6130 (Data handling techniques); C7310 (Mathematics)",
corpsource = "Tubingen Univ., Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "106",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "basis-construction; Buchberger's algorithm;
Gr{\"o}bner bases; invariant polynomials; invariant
theory; permutations; polynomials; symbol manipulation;
theory",
treatment = "T Theoretical or Mathematical",
}
@Article{Baker:1993:SPL,
author = "Henry G. Baker",
title = "Sparse Polynomials and Linear Logic",
journal = j-SIGSAM,
volume = "27",
number = "4",
pages = "10--14",
month = dec,
year = "1993",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C6130 (Data handling techniques);
C5230 (Digital arithmetic methods); C6140D (High level
languages); C6110 (Systems analysis and programming);
C4210 (Formal logic)",
corpsource = "Nimble Comput. Corp., Encino, CA, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "106",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "Common Lisp; conses; digital arithmetic;
exponentiation; formal logic; Gabriel FRPOLY benchmark;
garbage recovery; high water; linear; linear FRPOLY;
linear logic; linear programming; LISP; mark space
requirement; polynomials; sparse polynomials; squaring
FRPOLY; symbol manipulation",
treatment = "P Practical",
}
@Article{Corless:1993:WSO,
author = "Robert M. Corless",
title = "What is a solution of an {ODE}?",
journal = j-SIGSAM,
volume = "27",
number = "4",
pages = "15--19",
month = dec,
year = "1993",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C4170 (Differential equations);
C6130 (Data handling techniques)",
corpsource = "Dept. of Appl. Math., Univ. of Western Ontario,
London, Ont., Canada",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "106",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "complexity theory; computer algebra; controlled
numerical methods; defect-; differential equations;
downrating; error; European CATHODE project;
manipulation; nonstandard definition; numerical
analysis; ordinary differential equation; small global;
symbol",
treatment = "T Theoretical or Mathematical",
}
@Article{Heck:1994:RHW,
author = "Andr{\'e} Heck",
title = "Report on the {HISC} workshop",
journal = j-SIGSAM,
volume = "28",
number = "1",
pages = "2--8",
month = mar,
year = "1994",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:03 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Schwarz:1994:EFL,
author = "Fritz Schwarz",
title = "Efficient factorization of linear {ODE}'s",
journal = j-SIGSAM,
volume = "28",
number = "1",
pages = "9--17",
month = mar,
year = "1994",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:03 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C4240 (Programming and algorithm
theory)C4170 (Differential equations)",
corpsource = "GMD, Sankt Augustin, Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "107",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "candidates; complexity; computational complexity;
differential equations; efficient factorization;
factorization procedure; first order poles;
irreducibility; irreducible denominator; linear ODEs;
mathematics computing; Riccati equations; solution;
solution procedure; two-processor machine",
treatment = "T Theoretical or Mathematical",
}
@Article{Kajler:1994:SHI,
author = "Norbert Kajler and Neil Soiffer",
title = "Some human interaction issues in computer algebra",
journal = j-SIGSAM,
volume = "28",
number = "1",
pages = "18--28",
month = mar,
year = "1994",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/182130.182133",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:03 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics); C6130 (Data handling techniques);
C6180 (User interfaces)",
corpsource = "RIACA, Amsterdam, Netherlands",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "107",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "commercial software; computer algebra; directions;
human factors; human interaction issues; interactive
systems; research; research prototypes; state of the
art; symbol manipulation; user interfaces",
treatment = "P Practical",
}
@Article{Gruntz:1994:IG,
author = "D. Gruntz and M. Monagan",
title = "Introduction to {Gauss}",
journal = j-SIGSAM,
volume = "28",
number = "2",
pages = "3--19",
month = aug,
year = "1994",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:03 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The Gauss package offers Maple users a new approach to
programming based on the idea of parameterized types
(domains) which is central to the AXIOM system. This
approach to programming is now regarded by many as the
right way to go in computer algebra systems design. We
describe how Gauss is designed and show examples of
usage. We end with some comments about how Gauss is
being used in Maple.",
acknowledgement = ack-nhfb,
affiliation = "Inst. for Sci. Comput., Eidgenossische Tech.
Hochschule, Zurich, Switzerland",
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics computing); C6110 (Systems analysis
and programming); C6130 (Data handling techniques)",
classification = "C6110 (Systems analysis and programming); C6130
(Data handling techniques); C7310 (Mathematics
computing)",
corpsource = "Inst. for Sci. Comput., Eidgenossische Tech.
Hochschule, Zurich, Switzerland",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "108",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "AXIOM system; computer algebra systems design;
Computer algebra systems design; Gauss package;
manipulation; Maple users; parameterized; Parameterized
types; programming; Programming; programming
environments; software packages; symbol; systems
analysis; type theory; types",
thesaurus = "Programming environments; Software packages; Symbol
manipulation; Systems analysis; Type theory",
treatment = "P Practical; R Product Review",
}
@Article{Liu:1994:HCBa,
author = "Zhuojun Liu and Paul S. Wang",
title = "Height as a coefficient bound for univariate
polynomial factors ({Part I})",
journal = j-SIGSAM,
volume = "28",
number = "2",
pages = "20--27",
month = aug,
year = "1994",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:03 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4130 (Interpolation and function approximation);
C7310 (Mathematics computing); C6130 (Data handling
techniques)",
corpsource = "Inst. of Syst. Sci., Acad. Sinica, Beijing, China",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "108",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "coefficient bound; height; heuristic bound; maximum
coefficient size; polynomial factoring algorithms;
polynomials; symbol manipulation; univariate polynomial
factors",
treatment = "T Theoretical or Mathematical",
}
@Article{Liu:1994:HCBb,
author = "Zhuojun Liu and Paul S. Wang",
title = "Height as a coefficient bound for univariate
polynomial factors ({Part II})",
journal = j-SIGSAM,
volume = "28",
number = "3--4",
pages = "1--9",
month = dec,
year = "1994",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:03 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics computing); C4130 (Interpolation
and function approximation); C4240C (Computational
complexity)",
corpsource = "Inst. of Syst. Sci., Acad. Sinica, Beijing, China",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "109/110",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "coefficient bound; computational complexity; computing
techniques; efficient testing; numerical; ordinariness;
polynomials; procedures; symbol manipulation;
theoretical considerations; univariate polynomial
factors; valid",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Koepf:1994:FID,
author = "Wolfram Koepf",
title = "On families of iterated derivatives",
journal = j-SIGSAM,
volume = "28",
number = "3--4",
pages = "10--26",
month = dec,
year = "1994",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:03 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics computing); C4130 (Interpolation
and function approximation)",
corpsource = "Konrad-Zuse-Zentrum fur Inf., Berlin, Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "109/110",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithmic method; independent; iterated derivatives
family; iterative methods; mathematics computing;
special functions",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Montes:1995:SLF,
author = "Antonio Montes and Jordi Castro",
title = "Solving the load flow problem using the {Gr{\"o}bner}
basis",
journal = j-SIGSAM,
volume = "29",
number = "1",
pages = "1--13",
month = jan,
year = "1995",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:03 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "B8110 (Power systems); B8120 (Power transmission,
distribution and supply); B0210 (Algebra); B0290Z
(Other numerical methods)",
corpsource = "Dept. of Appl. Math., Univ. Politecnica de Catalunya,
Barcelona, Spain",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "111",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "load flow; matrix algebra; numerical analysis; power
systems; load flow problem; Gr{\"o}bner basis; power
networks; load flow; numerical solutions; algebraic
solution; simulation; algorithms",
treatment = "T Theoretical or Mathematical",
}
@Article{Koepf:1995:RPI,
author = "Wolfram Koepf",
title = "{REDUCE} package for the indefinite and definite
summation",
journal = j-SIGSAM,
volume = "29",
number = "1",
pages = "14--30",
month = jan,
year = "1995",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:03 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics computing); C4130 (Interpolation
and function approximation)",
corpsource = "Konrad-Zuse-Zentrum fur Inf., Berlin, Germany",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "111",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "binomial; coefficients; definite summation;
factorials; function terms; functions; hypergeometric
terms; indefinite summation; integer-; linear;
mathematics computing; packages; polynomials; rational
function; rational-linear; REDUCE package; shifted
factorials; software; ZEILBERG",
treatment = "T Theoretical or Mathematical",
}
@Article{Kaltofen:1995:MC,
author = "Erich Kaltofen",
title = "Message from the Chair",
journal = j-SIGSAM,
volume = "29",
number = "2",
pages = "1--1",
month = apr,
year = "1995",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Sep 06 07:11:07 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "112",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ulmer:1995:NKA,
author = "Felix Ulmer and Jacques-Arthur Weil",
title = "Note on {Kovacic}'s Algorithm",
journal = j-SIGSAM,
volume = "29",
number = "2",
pages = "10--11",
month = apr,
year = "1995",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:03 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "J. Kovacic (J. Symb. Comp., vol. 2, pp. 3-43, 1986)
gave an algorithm for solving second-order linear
homogeneous differential equations. This algorithm,
known as the Kovacic algorithm, computes the
Liouvillian solutions of L(y)=y'-ry=0 (with r in C(x)).
Since exponential solutions of linear differential
equations are in general more difficult to compute than
rational solutions, we propose an algorithm where
rational solutions of symmetric powers are used as much
as possible instead of exponential solutions. The
advantage of our approach is (1) to give a simple proof
of a Kovacic-like algorithm for arbitrary coefficient
fields and to give a complete overview of all the
possible polynomials; (2) to provide an
easy-to-implement algorithm using only rational
solutions for completely reducible groups G(L)
contained in SL(2,C); and (3) to avoid algebraic
extensions of the constant field by using rational
solutions instead of exponential solutions of symmetric
powers. The algorithm as been implemented in the Maple
system and should soon find its way into the Maple
share library. The new version is always faster than
the current Maple implementation of the Kovacic
algorithm, especially for example where G(L) is a
finite primitive subgroup of SL(2,C) and where the
current implementation fails to answer in most cases.",
acknowledgement = ack-nhfb,
affiliation = "Rennes I Univ., France",
ajournal = "SIGSAM Bull.",
classcodes = "C4170 (Differential equations); C7310 (Mathematics
computing)",
classification = "C4170 (Differential equations); C7310 (Mathematics
computing)",
corpsource = "Rennes I Univ., France",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "112",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "2nd-order linear homogeneous differential; 2Nd-order
linear homogeneous differential equations; arbitrary
coefficient; Arbitrary coefficient fields; Completely
reducible groups; completely reducible groups;
constant; Constant field algebraic extensions;
differential equations; equations; Exponential
solutions; exponential solutions; field algebraic
extensions; fields; finite; Finite primitive subgroup;
group theory; Kovacic algorithm; Liouvillian solutions;
Maple share library; mathematics computing;
polynomials; Polynomials; polynomials; primitive
subgroup; rational solutions; Rational solutions;
symbol manipulation; symmetric powers; Symmetric
powers",
thesaurus = "Differential equations; Group theory; Mathematics
computing; Polynomials; Symbol manipulation",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Garcia-Sanchez:1995:GIB,
author = "Pedro A. Garc{\'\i}a-S{\'a}nchez",
title = "{Gr{\"o}bner} and Involutive Bases for
Zero-dimensional Ideals",
journal = j-SIGSAM,
volume = "29",
number = "2",
pages = "12--15",
month = apr,
year = "1995",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:03 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "B0210 (Algebra); B0250 (Combinatorial mathematics);
C1110 (Algebra); C1160 (Combinatorial mathematics)",
corpsource = "Dept. de Algebra, Granada Univ., Spain",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "112",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "group theory; polynomials; symbol manipulation;
Gr{\"o}bner bases; involutive bases; zero-dimensional
ideals; involutive systems",
treatment = "T Theoretical or Mathematical",
}
@Article{Wolf:1995:ICR,
author = "Thomas Wolf and Andreas Brand",
title = "Investigating {DEs} with {CRACK} and Related
Programs",
journal = j-SIGSAM,
volume = "29",
number = "2S (special issue)",
pages = "1--8",
month = jun,
year = "1995",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics computing); C4170 (Differential
equations)",
corpsource = "Sch. of Math. Sci., Queen Mary and Westfield Coll.,
London, UK",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "CRACK; differential equations; differential factors;
equivalent Lagrangians; integrals; mathematics
computing; packages; polynomial; software; software
package; symmetry analysis",
treatment = "T Theoretical or Mathematical",
}
@Article{Volpi:1995:RIM,
author = "Aldo Volpi",
title = "$p$-th Roots for Integers Modulo $ p^n$ and for
{$p$-Adic} Integers",
journal = j-SIGSAM,
volume = "29",
number = "2S (special issue)",
pages = "9--15",
month = jun,
year = "1995",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4130 (Interpolation and function approximation)",
corpsource = "Accademia Navale, Livorno, Italy",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "first degree equation solving; p-adic integers;
polynomials; rings of integers; roots for integers;
roots of polynomial",
treatment = "T Theoretical or Mathematical",
}
@Article{Sokolsky:1995:GNR,
author = "Andrej G. Sokolsky and Akmal A. Vakhidov and Nickolay
N. Vasiliev",
title = "Generating a New Recurrence Relations System for
Elliptic {Hansen} Coefficients by Means of Computer
Algebra",
journal = j-SIGSAM,
volume = "29",
number = "2S (special issue)",
pages = "16--18",
month = jun,
year = "1995",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The problem of obtaining a new system of recurrence
relations for elliptic Hansen coefficients is solved by
means of a computer algebra system MAPLE. Possibilities
for the generation of new recurrence relations by means
of the MAPLE-package LINALG are shown for the case of
linear relations. As an example, advantages to use the
obtained recurrence relations in an artificial
satellite motion theory within elliptic functions are
described.",
acknowledgement = ack-nhfb,
affiliation = "Inst. of Theor. Astron., Acad. of Sci., St.
Petersburg, Russia",
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics computing); C4170 (Differential
equations)",
classification = "C4170 (Differential equations); C7310 (Mathematics
computing)",
corpsource = "Inst. of Theor. Astron., Acad. of Sci., St.
Petersburg, Russia",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "Artificial satellite motion theory; artificial
satellite motion theory; artificial satellites;
Computer algebra; computer algebra; elliptic equations;
Elliptic functions; elliptic functions; elliptic Hansen
coefficients; Elliptic Hansen coefficients; LINALG;
linear relations; Linear relations; MAPLE; packages;
recurrence relations system; Recurrence relations
system; software; symbol manipulation",
thesaurus = "Artificial satellites; Elliptic equations; Software
packages; Symbol manipulation",
treatment = "T Theoretical or Mathematical",
}
@Article{Anonymous:1995:SAS,
author = "Anonymous",
title = "{SAC '96}: {ACM} Symposium on Applied Computing",
journal = j-SIGSAM,
volume = "29",
number = "2S (special issue)",
pages = "19--20",
month = jun,
year = "1995",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Sep 06 07:11:07 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "2S (special issue)",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:1995:E,
author = "Anonymous",
title = "{ECCAD '95}",
journal = j-SIGSAM,
volume = "29",
number = "2S (special issue)",
pages = "21--28",
month = jun,
year = "1995",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Sep 06 07:11:07 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "2S (special issue)",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Grossman:1995:ME,
author = "Robert Grossman",
title = "Message from the {Editor}",
journal = j-SIGSAM,
volume = "29",
number = "3--4",
pages = "1--1",
month = dec,
year = "1995",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Sep 06 07:11:07 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "113/114",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Li:1995:CPP,
author = "Liwei Li and Paul S. Wang",
title = "The {CL--PVM} package",
journal = j-SIGSAM,
volume = "29",
number = "3--4",
pages = "2--8",
month = dec,
year = "1995",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:03 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C6150N (Distributed systems software); C6110P
(Parallel programming)",
corpsource = "Dept. of Math. and Comput. Sci., Kent State Univ., OH,
USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "113/114",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "artificial intelligence systems; C programs; CL-PVM
package; Common Lisp interface; console program; expert
systems; Fortran 77 interface; hostfile;
knowledge-based systems; library functions; LISP; Lisp
top level; Lisp-based; machines; open systems;
operating systems (computers); parallel; Parallel
Virtual Machine; parallel/concurrent computing
facility; programming; programs; PVM Library routines;
run-time server; software libraries; software package;
software packages; symbolic computation systems;
virtual",
treatment = "P Practical",
}
@Article{Grossman:1995:IIC,
author = "Robert Grossman",
title = "{1st International IMACS Conference on Applications of
Computer Algebra}",
journal = j-SIGSAM,
volume = "29",
number = "3--4",
pages = "9--12",
month = dec,
year = "1995",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/226186.570114",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Sep 06 07:11:07 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "113/114",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "MuPAD",
}
@Article{Anonymous:1995:ACS,
author = "Anonymous",
title = "Abstracts of Closing Sessions of the {Special Year in
Computational Differential Algebra and Algebraic
Geometry}",
journal = j-SIGSAM,
volume = "29",
number = "3--4",
pages = "13--18",
month = dec,
year = "1995",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Sep 06 07:11:07 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "113/114",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:1995:IIS,
author = "Anonymous",
title = "{ISSAC '96: International Symposium on Symbolic and
Algebraic Computation}",
journal = j-SIGSAM,
volume = "29",
number = "3--4",
pages = "19--19",
month = dec,
year = "1995",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Sep 06 07:11:07 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "113/114",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:1995:MMS,
author = "Anonymous",
title = "{Maple} in the Mathematical Sciences",
journal = j-SIGSAM,
volume = "29",
number = "3--4",
pages = "20--20",
month = dec,
year = "1995",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Sep 06 07:11:07 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "113/114",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:1995:EEC,
author = "Anonymous",
title = "{ECCAD '96}: {East Coast Computer Algebra Day}",
journal = j-SIGSAM,
volume = "29",
number = "3--4",
pages = "21--21",
month = dec,
year = "1995",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Sep 06 07:11:07 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "113/114",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Watt:1996:MC,
author = "S. M. Watt",
title = "Message from the Chair",
journal = j-SIGSAM,
volume = "30",
number = "1",
pages = "1--1",
month = mar,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Sep 06 07:11:07 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "115",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:1996:MEa,
author = "R. M. Corless",
title = "Message from the {Editor}",
journal = j-SIGSAM,
volume = "30",
number = "1",
pages = "2--3",
month = mar,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Mon Oct 07 12:05:10 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "115",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sado:1996:PPE,
author = "Takahiro Sado and Tomohiro Halaikawa and Tateaki
Sasaki",
title = "Pseudo-Parallel Execution of Modular Computation",
journal = j-SIGSAM,
volume = "30",
number = "1",
pages = "4--8",
month = mar,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C1110 (Algebra); C4240P (Parallel programming and
algorithm theory)",
corpsource = "Inst. of Math., Tsukuba Univ., Ibaraki, Japan",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "115",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "digital arithmetic; execution; integers; manipulation;
modular computation; parallel processing; polynomial
arithmetic modulo; polynomials; pseudo-parallel;
pseudo-parallel computation scheme; serial computation
machine; symbol",
treatment = "T Theoretical or Mathematical",
}
@Article{Bernardin:1996:RSS,
author = "Laurent Bernardin",
title = "A Review of Symbolic Solvers",
journal = j-SIGSAM,
volume = "30",
number = "1",
pages = "9--20",
month = mar,
year = "1996",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/231191.231193",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Solving equations and systems of equations
symbolically is a key feature of every Computer Algebra
System. This review examines the capabilities of the
six best known general purpose systems to date in the
area of general algebraic and transcendental equation
solving. Areas explicitly not covered by this review
are differential equations and numeric or polynomial
system solving as special purpose systems exist for
these kinds of problems.The aim is to provide a
benchmark for comparing Computer Algebra Systems in a
specific domain. We do not intend to give a rating of
overall capabilities as for example [8].",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics computing); C6130 (Data handling
techniques)",
corpsource = "Inst. for Sci. Comput., Eidgenossische Tech.
Hochschule, Zurich, Switzerland",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "115",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebraic; Axiom 2.0; computer algebra system; Derive
3.06; equation solving; general purpose systems;
Macsyma 420; Maple V R4; Mathematica 2.2; MuPAD; Reduce
3.6; review; software reviews; symbol manipulation;
symbolic solvers; transcendental equation solving",
treatment = "P Practical; R Product Review",
}
@Article{Abbott:1996:ROP,
author = "John Abbott and Angel D{\'\i}az and Robert S. Sutor",
title = "A report on {OpenMath}. {A} protocol for the exchange
of mathematical information",
journal = j-SIGSAM,
volume = "30",
number = "1",
pages = "21--24",
month = mar,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics computing)",
corpsource = "Fakulteit Wiskunde en Inf., Eindhoven Univ. of
Technol., Netherlands",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "115",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "computing resources; databases; electronically;
electronically published; engineers; expressions;
general purpose mathematical software; mathematical;
mathematical information exchange protocol;
mathematical libraries; mathematical objects;
mathematics computing; OpenMath; protocols; published
scientific documents; scientists; software tools;
specialized; students; technical documents",
treatment = "P Practical",
}
@Article{Fateman:1996:SLB,
author = "Richard J. Fateman and Mark Hayden",
title = "Speeding Up {Lisp}-Based Symbolic Mathematics",
journal = j-SIGSAM,
volume = "30",
number = "1",
pages = "25--30",
month = mar,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics computing); C6130 (Data handling
techniques)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., California
Univ., Berkeley, CA, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "115",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "equivalent kernel; expressions; hash tables; LISP;
Lisp-based; Lisp-based symbolic mathematics speed-up;
Macsyma; Mathematica; mathematics computing; symbol
manipulation; symbolic manipulation system; unordered
sum representation",
treatment = "T Theoretical or Mathematical",
}
@Article{Kaltofen:1996:ISC,
author = "E. Kaltofen",
title = "{ISSAC} Steering Committee Bylaws",
journal = j-SIGSAM,
volume = "30",
number = "1",
pages = "31--33",
month = mar,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Sep 06 07:11:07 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "115",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:1996:CI,
author = "Robert M. Corless",
title = "Cofactor Iteration",
journal = j-SIGSAM,
volume = "30",
number = "1",
pages = "34--38",
month = mar,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "115",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Dooley:1996:E,
author = "S. Dooley and A. Lobo",
title = "{ECCAD '96}",
journal = j-SIGSAM,
volume = "30",
number = "1",
pages = "39--49",
month = mar,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Sep 06 07:11:07 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "115",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Noda:1996:R,
author = "M-T Noda",
title = "{RIMS '94}",
journal = j-SIGSAM,
volume = "30",
number = "1",
pages = "50--56",
month = mar,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Sep 06 07:11:07 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "115",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:1996:ABD,
author = "R. M. Corless",
title = "{Abell and Braselton}'s {{\em Differential Equations
with Maple V}}",
journal = j-SIGSAM,
volume = "30",
number = "1",
pages = "57--60",
month = mar,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Sep 06 07:11:07 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "115",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hong:1996:IA,
author = "H. Hong",
title = "{IMACS-ACA '96}",
journal = j-SIGSAM,
volume = "30",
number = "1",
pages = "61--61",
month = mar,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Sep 06 07:11:07 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "115",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Emiris:1996:S,
author = "I. Emiris",
title = "{SNAP '96}",
journal = j-SIGSAM,
volume = "30",
number = "1",
pages = "62--62",
month = mar,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Sep 06 07:11:07 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "115",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Monagan:1996:MSI,
author = "M. Monagan",
title = "{MapleTech} Special Issue",
journal = j-SIGSAM,
volume = "30",
number = "1",
pages = "63--63",
month = mar,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Sep 06 07:11:07 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "115",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:1996:MEb,
author = "Robert M. Corless",
title = "Message from the {Editor}",
journal = j-SIGSAM,
volume = "30",
number = "2",
pages = "1--1",
month = jun,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Mon Oct 7 08:39:29 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "116",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Borwein:1996:SSA,
author = "Jonathan Borwein and David Bradley",
title = "Searching Symbolically for {Ap{\'e}ry}-like Formulae
for Values of the {Riemann} Zeta Function",
journal = j-SIGSAM,
volume = "30",
number = "2",
pages = "2--7",
month = jun,
year = "1996",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/235699.235700",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Aug 10 12:08:56 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/bibnet/authors/b/borwein-jonathan-m.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "http://doi.acm.org/10.1145/235699.235700",
acknowledgement = ack-nhfb,
acmid = "235700",
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics computing)",
corpsource = "Centre for Exp. and Constructive Math., Simon Fraser
Univ., Burnaby, BC, Canada",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "116",
issue-date = "June 1996",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; Apery-like formulae; computer; formal proof;
functions; Riemann Zeta function; special values;
symbol manipulation; symbolic methods",
numpages = "6",
treatment = "T Theoretical or Mathematical",
}
@Article{Fateman:1996:WCA,
author = "Richard J. Fateman",
title = "Why computer algebra systems sometimes can't solve
simple equations",
journal = j-SIGSAM,
volume = "30",
number = "2",
pages = "8--11",
month = jun,
year = "1996",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/235699.235701",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Among the basic equations one might wish a computer to
solve symbolically is the inverse of the power
function, solving $ y = z^w $ for $z$. (Note: $ z^w
\equiv \exp (w \ln z)$). While many special cases,
easily solved, abound, the general question is fraught
with implications: if this is so hard, how can we
expect success in other ventures? Having solved this,
we can naturally use it in a `composition' of solution
methods for expressions of the form $ y = f(z)^w$.
Can't we already do this? Is it not the case that the
solution of $ y = z^{a + bi}$ is trivially $ z = y^{1 /
(a + bi)}$ ? Not so. If this were the case, then a plot
of the function $ t(y) := y - (y^{1 / (1 + i)})^{1 +
i}$ would be indistinguishable from $ t(y) \equiv 0$.
For many values, $ t(y)$ is (allowing for round-off
error), zero. But if your computer system correctly
computes with values in the complex plane, then, (to
pick two complex points from a region described later),
$ t( - 10000 + 4000 i)$ is not zero, but about $ - 9981
+ 3993 i$ and $ t( - 0.01 + 0.002 i)$ is about $ 5.34 -
1.06 i$. These strange numbers are not the consequence
of round-off error or some other numerical phenomena.
The alleged solution is just not mathematically
correct. Computer algebra systems as usually programmed
lack the expressive capability to return the exact and
complete set of solutions, in general.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics computing)",
corpsource = "Div. of Comput. Sci., California Univ., Berkeley, CA,
USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "116",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "computer algebra systems; error analysis; function;
manipulation; mathematics computing; power function;
roundoff error; simple equation solving; symbol; symbol
manipulation",
treatment = "T Theoretical or Mathematical",
}
@Article{Aslaksen:1996:MVC,
author = "Helmer Aslaksen",
title = "Multiple-Valued Complex Functions and Computer
Algebra",
journal = j-SIGSAM,
volume = "30",
number = "2",
pages = "12--20",
month = jun,
year = "1996",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/235699.235702",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics computing)",
corpsource = "Dept. of Math., Nat. Univ. of Singapore, Singapore",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "116",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "branches; complex logarithm; computer algebra; Derive;
exponential functions; function; functions; Maple;
Mathematica; mathematics computing; multiple-valued
complex functions; Reduce; symbol manipulation;
transformation rules",
treatment = "T Theoretical or Mathematical",
}
@Article{Patton:1996:RBC,
author = "Charles M. Patton",
title = "A Representation of Branch-Cut Information",
journal = j-SIGSAM,
volume = "30",
number = "2",
pages = "21--24",
month = jun,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics computing)",
corpsource = "APCD Corvallis Design Centre, Hewlett--Packard Co.,
Corvallis, OR, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "116",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "assumption; branch cut tracking; branch-cut
information representation; computer algebra; domain
restriction; functions; mathematics computing;
multi-valued; recording; symbol manipulation",
treatment = "T Theoretical or Mathematical",
}
@Article{Rich:1996:FEB,
author = "Albert D. Rich and David J. Jeffrey",
title = "Function evaluation on branch cuts",
journal = j-SIGSAM,
volume = "30",
number = "2",
pages = "25--27",
month = jun,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics computing); C4120 (Functional
analysis)",
corpsource = "Soft Warehouse, Honolulu, HI, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "116",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "branch; branch cuts; computer algebra system;
definitions; function evaluation; manipulation;
mathematics computing; multivalued functions; numerical
libraries; principal branches; symbol",
treatment = "T Theoretical or Mathematical",
}
@Article{Corless:1996:ECU,
author = "Robert M. Corless and David J. Jeffrey",
title = "{Editor}'s corner: The unwinding number",
journal = j-SIGSAM,
volume = "30",
number = "2",
pages = "28--35",
month = jun,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C7310 (Mathematics computing)",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "116",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "complex values; computer algebra; formula
manipulation; functions; mathematical function;
mathematics computing; rules; symbol manipulation;
unwinding number",
treatment = "T Theoretical or Mathematical",
}
@Article{Noda:1996:AJC,
author = "Matu-Tarow Noda",
title = "Abstracts of {Japanese} computer algebra meeting in
{Kyoto}",
journal = j-SIGSAM,
volume = "30",
number = "2",
pages = "36--43",
month = jun,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "116",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Char:1996:FAC,
author = "Bruce Char",
title = "First Announcement and Call for Papers: {ISSAC '97:
International Symposium on Symbolic and Algebraic
Computation}",
journal = j-SIGSAM,
volume = "30",
number = "2",
pages = "44--46",
month = jun,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Mon Oct 7 08:39:29 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "116",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hong:1996:PSI,
author = "Hoon Hong",
title = "{PASCO '97: Second International Symposium on Parallel
Symbolic Computation}",
journal = j-SIGSAM,
volume = "30",
number = "2",
pages = "47--48",
month = jun,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Mon Oct 07 09:47:16 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "116",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cetinkaya:1996:MBR,
author = "Cetin Cetinkaya",
title = "Message from the {Book Review Editor}",
journal = j-SIGSAM,
volume = "30",
number = "3",
pages = "1--1",
month = sep,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sun Mar 9 08:22:57 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "117",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:1996:ME,
author = "Robert M. Corless",
title = "Message from the {Editor}",
journal = j-SIGSAM,
volume = "30",
number = "3",
pages = "1--1",
month = sep,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sun Mar 9 08:22:57 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "117",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lobo:1996:FRA,
author = "Austin Lobo",
title = "Formal Review of Articles in the {{\sc Bulletin}}",
journal = j-SIGSAM,
volume = "30",
number = "3",
pages = "2--3",
month = sep,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sun Mar 9 08:22:57 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "117",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Dora:1996:RRC,
author = "J. Della Dora and F. Jung",
title = "Resolvent and rational canonical forms of matrices",
journal = j-SIGSAM,
volume = "30",
number = "3",
pages = "4--10",
month = sep,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "117",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Weber:1996:CRE,
author = "Andreas Weber",
title = "Computing Radical Expressions for Roots of Unity",
journal = j-SIGSAM,
volume = "30",
number = "3",
pages = "11--20",
month = sep,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "117",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Emiris:1996:BPP,
author = "I. Z. Emiris and A. Galligo",
title = "{Bini} and {Pan}'s Polynomial and Matrix
Computations",
journal = j-SIGSAM,
volume = "30",
number = "3",
pages = "21--23",
month = sep,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sun Mar 9 08:22:57 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "117",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Adami:1996:GNM,
author = "Chris Adami",
title = "{Gaylord} and {Nishidate}'s Modelling Nature with
Cellular Automata using {Mathematica}",
journal = j-SIGSAM,
volume = "30",
number = "3",
pages = "24--25",
month = sep,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sun Mar 9 08:22:57 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "117",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Volcheck:1996:TRC,
author = "Emil Volcheck",
title = "Technical Report Column: {INRIA} and {RISC-Linz}",
journal = j-SIGSAM,
volume = "30",
number = "3",
pages = "26--28",
month = sep,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sun Mar 9 08:22:57 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "117",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wester:1996:A,
author = "Michael Wester",
title = "{ACA '97}",
journal = j-SIGSAM,
volume = "30",
number = "3",
pages = "29--29",
month = sep,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sun Mar 9 08:22:57 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "117",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Char:1996:I,
author = "Bruce Char",
title = "{ISSAC '97}",
journal = j-SIGSAM,
volume = "30",
number = "3",
pages = "30--30",
month = sep,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sun Mar 9 08:22:57 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "117",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hong:1996:P,
author = "Hoon Hong",
title = "{PASCO '97}",
journal = j-SIGSAM,
volume = "30",
number = "3",
pages = "31--31",
month = sep,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sun Mar 9 08:22:57 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "117",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Stetter:1996:JSI,
author = "Hans J. Stetter and Stephen M. Watt",
title = "{JSC} Special Issue {CFP}",
journal = j-SIGSAM,
volume = "30",
number = "3",
pages = "32--32",
month = sep,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sun Mar 9 08:22:57 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "117",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:1996:CIB,
author = "Anonymous",
title = "Calendar",
journal = j-SIGSAM,
volume = "30",
number = "3",
pages = "??--??",
month = sep,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sun Mar 9 08:22:57 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Inside back cover.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "117",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cooperman:1996:SBM,
author = "Gene Cooperman",
title = "{SIGSAM} Business Meeting Minutes",
journal = j-SIGSAM,
volume = "30",
number = "4",
pages = "1--2",
month = dec,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sun Mar 9 08:22:57 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "118",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cooperman:1996:IBM,
author = "Gene Cooperman",
title = "{ISSAC} Business Meeting Minutes",
journal = j-SIGSAM,
volume = "30",
number = "4",
pages = "2--3",
month = dec,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sun Mar 9 08:22:57 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "118",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Manocha:1996:SAS,
author = "Dinesh Manocha and Shankar Krishnan",
title = "Solving algebraic systems using matrix computations",
journal = j-SIGSAM,
volume = "30",
number = "4",
pages = "4--21",
month = dec,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4140 (Linear algebra); C4260 (Computational
geometry)",
corpsource = "Dept. of Comput. Sci., North Carolina Univ., Chapel
Hill, NC, USA",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "118",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebraic systems; computation; computational
geometry; decomposition; eigendecomposition;
elimination theory; Gaussian elimination; geometric;
inverse kinematics; manufacturing; matrix algebra;
matrix computations; molecular chains; one dimensional
algebraic; polynomial equations; polynomial matrices;
serial robots; sets; singular value; singular value
decomposition; solid modeling",
treatment = "T Theoretical or Mathematical",
}
@Article{Stetter:1996:MEH,
author = "Hans J. Stetter",
title = "Matrix eigenproblems are at the Heart of Polynomial
System Solving",
journal = j-SIGSAM,
volume = "30",
number = "4",
pages = "22--25",
month = dec,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4140 (Linear algebra)",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "118",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algebra; commutative algebra; eigenvalues and
eigenfunctions; linear; matrices; matrix algebra;
matrix eigenproblems; polynomial; weakly nonlinear
nucleus",
treatment = "T Theoretical or Mathematical",
}
@Article{Corless:1996:ECG,
author = "Robert M. Corless",
title = "{Editor}'s Corner: {Gr{\"o}bner} bases and matrix
eigenproblems",
journal = j-SIGSAM,
volume = "30",
number = "4",
pages = "26--32",
month = dec,
year = "1996",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
classcodes = "C4140 (Linear algebra)",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "118",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "eigenvalues and eigenfunctions; polynomial matrices;
Gr{\"o}bner bases; matrix eigenproblems; Maple routine;
multiplication matrices; residue class ring;
multivariate; polynomial equations; total degree
ordering; lexicographic; order case; lex order basis;
zero-dimensional case; Kronecker canonical forms",
treatment = "T Theoretical or Mathematical",
}
@Article{Corless:1997:MEa,
author = "R. M. Corless",
title = "Message from the {Editor}",
journal = j-SIGSAM,
volume = "31",
number = "1",
pages = "1--1",
month = mar,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Dec 16 11:39:28 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "119",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bondari:1997:MRI,
author = "Siamack Bondari and Irvin Roy Hentzel",
title = "The {McCrimmon} Radical for Identities of Degree 3",
journal = j-SIGSAM,
volume = "31",
number = "1",
pages = "2--5",
month = mar,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "119",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Tertychniy:1997:GCA,
author = "S. I. Tertychniy and I. G. Obukhova",
title = "{GRGEC}: Computer Algebra System for Applications to
Gravity Theory",
journal = j-SIGSAM,
volume = "31",
number = "1",
pages = "6--14",
month = mar,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "119",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bachmann:1997:MEF,
author = "Olaf Bachmann",
title = "{MPCR}: An Efficient and Flexible Chains of
Recurrences Server",
journal = j-SIGSAM,
volume = "31",
number = "1",
pages = "15--21",
month = mar,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "119",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fee:1997:PPCa,
author = "G. J. Fee and M. B. Monagan",
title = "Problems, Puzzles, Challenges",
journal = j-SIGSAM,
volume = "31",
number = "1",
pages = "22--23",
month = mar,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "119",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Volcheck:1997:TRCa,
author = "Emil Volcheck",
title = "Technical Report Column: {INRIA} and {RISC-Linz}",
journal = j-SIGSAM,
volume = "31",
number = "1",
pages = "24--25",
month = mar,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "119",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cetinkaya:1997:BR,
author = "Cetin Cetinkaya",
title = "Book Reviews",
journal = j-SIGSAM,
volume = "31",
number = "1",
pages = "26--26",
month = mar,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Apr 18 07:26:12 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "119",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Quinn:1997:BRT,
author = "D. Dane Quinn",
title = "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)}",
journal = j-SIGSAM,
volume = "31",
number = "1",
pages = "27--28",
month = mar,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Apr 18 07:26:12 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "119",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Watt:1997:SEE,
author = "S. M. Watt",
title = "{SIGSAM} Executive Elections",
journal = j-SIGSAM,
volume = "31",
number = "1",
pages = "28--28",
month = mar,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Apr 18 07:26:12 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "119",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cooperman:1997:FEC,
author = "G. Cooperman",
title = "{The Fourther East Coast Computer Algebra Day}: a one
day meeting to stimulate activity in Computer Algebra",
journal = j-SIGSAM,
volume = "31",
number = "1",
pages = "29--29",
month = mar,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Apr 18 07:26:12 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "119",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Stetter:1997:JSC,
author = "H. J. Stetter and S. M. Watt",
title = "{Journal of Symbolic Computation} Special Issue on
Symbolic-Numeric Algebra for Polynomials",
journal = j-SIGSAM,
volume = "31",
number = "1",
pages = "30--30",
month = mar,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Apr 18 07:26:12 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "119",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kalkbrener:1997:JSC,
author = "M. Kalkbrener and D. Wang",
title = "{Journal of Symbolic Computation} Special Issue on
Polynomial Elimination: Algorithms and Applications",
journal = j-SIGSAM,
volume = "31",
number = "1",
pages = "31--31",
month = mar,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Apr 18 07:26:12 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "119",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sit:1997:JSC,
author = "W. Sit and M. Bronstein",
title = "{Journal of Symbolic Computation} Special Issue on
Differential Equations and Differential Algebra",
journal = j-SIGSAM,
volume = "31",
number = "1",
pages = "32--32",
month = mar,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Apr 18 07:26:12 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "119",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Encarnacion:1997:CPI,
author = "M. J. Encarnacion",
title = "Call for Posters: {ISSAC '97}: International Symposium
on Symbolic and Algebraic Computation",
journal = j-SIGSAM,
volume = "31",
number = "1",
pages = "33--33",
month = mar,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Apr 18 07:26:12 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "119",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Reeves:1997:PW,
author = "A. Reeves",
title = "{PetaFLOPS} Workshop",
journal = j-SIGSAM,
volume = "31",
number = "2",
pages = "1--1",
month = jun,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Oct 21 14:42:00 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "120",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Dolzmann:1997:RCA,
author = "Andreas Dolzmann and Thomas Sturm",
title = "{REDLOG}: Computer algebra meets computer logic",
journal = j-SIGSAM,
volume = "31",
number = "2",
pages = "2--9",
month = jun,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "120",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "REDUCE",
}
@Article{Zimmer:1997:TEI,
author = "Horst G. Zimmer",
title = "Three examples of {$S$}-integral points on Elliptic
Curves over {$Q$}",
journal = j-SIGSAM,
volume = "31",
number = "2",
pages = "10--21",
month = jun,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "120",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Volcheck:1997:TRCb,
author = "Emil Volcheck",
title = "Technical Report Column: {INRIA-Rocquencourt},
{Research Institute for Symbolic Computation},
{University of Passau, Germany}",
journal = j-SIGSAM,
volume = "31",
number = "2",
pages = "22--31",
month = jun,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Oct 21 14:42:00 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "120",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Recio:1997:CCA,
author = "Tomas Recio",
title = "A Course on Computer Algebra Applications",
journal = j-SIGSAM,
volume = "31",
number = "2",
pages = "32--32",
month = jun,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Oct 21 14:42:00 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "120",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:1997:MEb,
author = "Robert M. Corless",
title = "Message from the {Editor}",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "1--1",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Dec 16 10:45:30 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Watt:1997:MPC,
author = "Stephen M. Watt",
title = "Message from the {Past Chair}",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "2--2",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Dec 16 10:45:30 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Char:1997:SCM,
author = "Bruce Char",
title = "{SIGSAM Chair}'s message",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "2--3",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Dec 16 10:45:30 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lobo:1997:CLA,
author = "Austin Lobo",
title = "Computer Linear Algebra",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "3--3",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Dec 16 10:45:30 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sasaki:1997:PRS,
author = "Tateaki Sasaki and Mutsuko Sasaki",
title = "Polynomial Remainder Sequence and Approximate {GCD}",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "4--10",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Nakos:1997:FFA,
author = "George C. Nakos and Peter R. Turner and Robert M.
Williams",
title = "Fraction-Free Algorithms for Linear and Polynomial
Equations",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "11--19",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:1997:TFR,
author = "R. M. Corless and D. J. Jeffrey",
title = "The {Turing} Factorization of a Rectangular Matrix",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "20--28",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Popov:1997:SFA,
author = "Bogdan A. Popov",
title = "A System for Function Approximation Properties
Investigation",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "29--30",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Dec 17 07:49:58 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Encarnacion:1997:IPA,
author = "M. J. Encarnaci{\'o}n",
title = "{ISSAC '97} Poster Abstracts",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "29--61",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Dec 16 10:45:30 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kako:1997:PEF,
author = "Fujio Kako and Tateaki Sasaki",
title = "Proposal of {``effective floating-point number''} for
approximate algebraic computation",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "31--31",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only. Discusses fuzzy and interval
floating-point arithmetic.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sasaki:1997:AAC,
author = "Tateaki Sasaki and Kousuke Shiihara and Akira Terui
and Yuichi Ozaki and Fujio Kako",
title = "Approximate Algebraic Computation: Practice and
Problems",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "32--32",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{McCallum:1997:FIR,
author = "Scott McCallum",
title = "Factors of Iterated Resultants and Discriminants",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "33--34",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Piehl:1997:GAE,
author = "Valerie Piehl and Jonathan Sorenson and Neil
Tiedeman",
title = "Genetic Algorithms for the Extended {GCD} Problem
(work in progress)",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "34--35",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sakakihara:1997:IBT,
author = "Michio Sakakihara",
title = "Iterative Blow-up Time Approximation for Initial Value
Problems",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "36--36",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sakakihara:1997:SNM,
author = "Michio Sakakihara and Shigekazu Nakagawa",
title = "Symbolic {Newton} Method for Two-Parameter Eigenvalue
Problem",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "36--36",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kai:1997:CPV,
author = "Hiroshi Kai and Matu-Tarow Noda",
title = "{Cauchy} Principal Value Integral Using Hybrid
Integral",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "37--38",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Knopfmacher:1997:DDF,
author = "Arnold Knopfmacher",
title = "Distinct Degree Factorizations for Polynomials over a
Finite Field",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "38--39",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Giesbrecht:1997:CIS,
author = "Mark Giesbrecht and Austin Lobo and David Saunders",
title = "Certifying Inconsistency of Sparse Linear Systems",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "40--40",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Giesbrecht:1997:PLS,
author = "Mark Giesbrecht and David Saunders",
title = "Parametric Linear Systems: The Two-Parameter Case",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "40--40",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sato:1997:SCS,
author = "Yosuke Sato",
title = "Set Constraint Solver --- {Gr{\"o}bner} Bases for
Non-numerical Domains",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "41--42",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hunt:1997:RPS,
author = "Kenny Hunt and James Cremer",
title = "{Refiner}: a Problem Solving Environment for
{ODE\slash DAE} Simulations",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "42--43",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gerdt:1997:MIB,
author = "Vladimir P. Gerdt and Yuri A. Blinkov",
title = "Minimal Involutive Bases",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "44--44",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/271130.271198",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Soiffer:1997:MPR,
author = "Neil Soiffer",
title = "{MathML}: a Proposal for Representing Mathematics in
{HTML}",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "44--45",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only. See
\path=http://www.w3.org/pub/WWW/TR/WD-math/= for the
proposal details.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sorgatz:1997:DMS,
author = "Andreas Sorgatz",
title = "Dynamic Modules: Software Integration in {MuPAD}",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "45--47",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/271130.271200",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Heckler:1997:PM,
author = "Christian Heckler and Oliver Kluge and Torsten Metzner
and Andreas Sorgatz and Paul Zimmermann",
title = "Parallelism in {MuPAD}",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "48--48",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Greuel:1997:SCA,
author = "G.-M. Greuel and G. Pfister and H. Sch{\"o}nemann",
title = "{Singular 1.0}: a Computer Algebra System for
Singularity Theory, Algebraic Geometry and Commutative
Algebra",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "48--50",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/271130.271202",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bachmann:1997:DEM,
author = "Olaf Bachmann and Simon Gray",
title = "A Demonstration of Exchanging Mathematical Expressions
using {MP}",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "50--50",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/271130.271203",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "MuPAD",
}
@Article{Noda:1997:AMC,
author = "Matu-Tarow Noda and Isao Makino and Toshiaki Saito",
title = "Algebraic Methods for Computing a Generalized
Inverse",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "51--52",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kredel:1997:MMA,
author = "Heinz Kredel and Michael Pesch",
title = "{MAS}, the {Modula-2 Algebra System}, Version 1.00",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "52--54",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Maurer:1997:LLC,
author = "Markus Maurer and Thomas Pfahler and Susanne Wetzel",
title = "{LiDIA} --- a Library for Computational Number
Theory",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "54--57",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Char:1997:SCT,
author = "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",
title = "Symbolic Computation Tools in Scientific Problem
Solving Environments",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "58--58",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Mitrofanov:1997:SMB,
author = "V. A. Mitrofanov and E. V. Zima",
title = "Standalone {MCR}-Based Numerical Engine",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "59--60",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Okumura:1997:AGB,
author = "Kohshi Okumura",
title = "An Application of {Gr{\"o}bner} Bases to the
Classification of Nonlinear Circuits",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "61--61",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Poster abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Weispfenning:1997:IR,
author = "Volker Weispfenning",
title = "{ISSAC '98 Rostock}",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "62--63",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Dec 16 10:45:30 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Winkler:1997:YGB,
author = "Franz Winkler",
title = "33 Years of {Gr{\"o}bner} Bases",
journal = j-SIGSAM,
volume = "31",
number = "3",
pages = "64--64",
month = sep,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Dec 16 10:45:30 MST 1997",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "122",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Trott:1997:MSI,
author = "M. Trott",
title = "{Mathematica} solutions to the {ISSAC} system
challenge 1997",
journal = j-SIGSAM,
volume = "31",
number = "4",
pages = "2--35",
month = dec,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Flajolet:1997:SCS,
author = "Philippe Flajolet and Bruno Salvy",
title = "The {SIGSAM} challenges: symbolic asymptotics in
practice",
journal = j-SIGSAM,
volume = "31",
number = "4",
pages = "36--47",
month = dec,
year = "1997",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fee:1997:PPCb,
author = "G. J. Fee and M. B. Monagan",
title = "Problems, puzzles, challenges",
journal = j-SIGSAM,
volume = "31",
number = "4",
pages = "48--49",
month = dec,
year = "1997",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/274888.274891",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "MuPAD",
}
@Article{Volcheck:1997:TRCc,
author = "Emil Volcheck",
title = "Technical report column",
journal = j-SIGSAM,
volume = "31",
number = "4",
pages = "50--53",
month = dec,
year = "1997",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/274888.570095",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Oct 18 05:41:50 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "MuPAD",
}
@Article{Beebe:1998:LBA,
author = "Nelson H. F. Beebe",
title = "Letters: Bibliography archive",
journal = j-SIGSAM,
volume = "32",
number = "1",
pages = "1--3",
month = mar,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "123",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Borwein:1998:MPW,
author = "Jonathan Borwein",
title = "Mathematical Publication on the {Web}",
journal = j-SIGSAM,
volume = "32",
number = "1",
pages = "4--7",
month = mar,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "123",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gosper:1998:S,
author = "R. William {Gosper, Jr.}",
title = "The solutions of $ y e^{y^2} = x $ and $ y e^y = x $",
journal = j-SIGSAM,
volume = "32",
number = "1",
pages = "8--10",
month = mar,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "123",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:1998:GER,
author = "Robert M. Corless and David J. Jeffrey",
title = "Graphing Elementary {Riemann} Surfaces",
journal = j-SIGSAM,
volume = "32",
number = "1",
pages = "11--17",
month = mar,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "123",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Macsyma:1998:MSI,
author = "{Technical Staff at Macsyma, Inc.}",
title = "{Macsyma} Solutions to the {ISSAC '97 Challenge
Problems}",
journal = j-SIGSAM,
volume = "32",
number = "1",
pages = "18--37",
month = mar,
year = "1998",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/294833.570093",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Mon Jul 27 17:01:40 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "123",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "MuPAD",
}
@Article{Stoutemyer:1998:TSI,
author = "David R. Stoutemyer",
title = "A {TI-92} Solution to the {ISSAC '97 Challenge
Problems}",
journal = j-SIGSAM,
volume = "32",
number = "1",
pages = "38--55",
month = mar,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Mon Jul 27 17:01:40 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "123",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kako:1998:AJC,
author = "Fujio Kako",
title = "Abstracts of {Japanese Computer Algebra Meeting} in
{Kyoto}",
journal = j-SIGSAM,
volume = "32",
number = "1",
pages = "56--63",
month = mar,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "123",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:1998:PAI,
author = "Anonymous",
title = "Preliminary Announcement: {ISSAC '99 Vancouver}:
{International Symposium on Symbolic and Algebraic
Computation, July 1999, Simon Fraser University,
British Columbia, Canada}",
journal = j-SIGSAM,
volume = "32",
number = "1",
pages = "64--64",
month = mar,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Mon Jul 27 17:01:40 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "http://www.cecm.sfu.ca/ISSAC99/",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "123",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:1998:MEa,
author = "Robert M. Corless",
title = "Message from the {Editor}",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "1--2",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Nov 10 14:40:31 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Berggren:1998:PSF,
author = "L. Berggren",
title = "Position at {Simon Fraser University}",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "2--2",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Nov 10 14:40:31 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{N:1998:SIB,
author = "{Lakshman Y.N.}",
title = "{SIGSAM\slash ISSAC} Business Meeting Summary",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "3--4",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Nov 10 14:40:31 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jeffrey:1998:FRA,
author = "D. J. Jeffrey",
title = "Formally Reviewed Articles in the {Bulletin}",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "5--6",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Nov 10 14:40:31 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bouchon-Meunier:1998:ICM,
author = "Bernadette Bouchon-Meunier and Vladik Kreinovich",
title = "From Interval Computations to Modal Mathematics:
Applications and Computational Complexity",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "7--11",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Popov:1998:SCP,
author = "Atanas Popov",
title = "Symbolic Computation of Potential Energy Functions",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "12--18",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Joyner:1998:MPD,
author = "David Joyner and Roland Martin",
title = "A {Maple} package for the decomposition of certain
tensor products and restrictions of representations
using crystal graphs",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "19--22",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Braham:1998:NON,
author = "Stephen P. Braham",
title = "{NAOMI One}: {North American OpenMath Initiative} Goes
Online",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "23--29",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fevre:1998:CRS,
author = "St{\'e}phane F{\`e}vre",
title = "Completeness of a Rewrite System for Proving Geometric
Theorems using {Clifford} Algebra",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "30--34",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:1998:RSM,
author = "Robert M. Corless and Stephen M. Watt",
title = "Report on the {SNAP} minisymposium at {SIAM '98}",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "35--37",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Buchberger:1998:ICG,
author = "B. Buchberger and F. Winkler",
title = "Intensive Course on {Gr{\"o}bner} Bases",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "38--38",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Nov 10 14:40:31 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Winkler:1998:YGB,
author = "F. Winkler",
title = "33 Years of {Gr{\"o}bner} Bases",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "38--39",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Nov 10 14:40:31 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Grobner:1998:ET,
author = "W. Gr{\"o}bner",
title = "On Elimination Theory",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "40--46",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Translation by Michael Abramson of the original German
article {{\em {\"U}ber die Eliminationstheorie},
Monatshefte f{\"u}r Mathematik {\bf 5} (1950),
71--78}.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gordan:1998:NPH,
author = "Paul Gordan",
title = "A new proof of {Hilbert}'s theorem on homogeneous
functions",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "47--48",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Translation by Michael Abramson of the original German
article {{\em Neure Beweis des Hilbertschen Satzes
{\"u}ber homogene Funktionen}. Nachr. der K{\"o}nigsl.
Ges. der Wiss. zu G{\"o}ttingen {\bf 3} (1899),
240--242}.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Labahn:1998:PSA,
author = "George Labahn and Mohamed Omar Rayes",
title = "Poster Session Abstracts of the {1998 International
Symposium on Symbolic and Algebraic Computation, ISSAC
'98, Rostock, German, August 13--15, 1998}",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "49--51",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Nov 10 14:40:31 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Berkovich:1998:FSC,
author = "L. M. Berkovich",
title = "Factorization of some Classes of Nonlinear Ordinary
Differential Equations: Methods and Algorithms",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "52--52",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Nov 10 14:40:31 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Decker:1998:PRR,
author = "Thomas Decker and Werner Krandick",
title = "Parallel Real Root Isolation: poster abstract",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "53--54",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Nov 10 14:40:31 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gerdt:1998:ISL,
author = "Vladimir P. Gerdt",
title = "Involutive Systems of Linear {PDEs}",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "55--56",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Nov 10 14:40:31 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Glotov:1998:GCR,
author = "Peter E. Glotov",
title = "On the greatest common right divisor of {Ore}
polynomials with polynomial coefficients which depend
on a parameter",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "57--57",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Nov 10 14:40:31 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Heiligman:1998:CWP,
author = "Mark Heiligman and Emil Volcheck",
title = "On Computing the {Weierstrass} Points of a Plane
Algebraic Curve",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "58--58",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Nov 10 14:40:31 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kai:1998:HCC,
author = "Hiroshi Kai and Matu-Tarow Noda",
title = "Hybrid Computation of {Cauchy}-type Singular Integral
Equations",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "59--60",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Nov 10 14:40:31 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Pritchard:1998:IVP,
author = "F. Leon Pritchard and William Y. Sit",
title = "On Initial Value Problems for Ordinary
Differential-Algebraic Equations",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "61--61",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Nov 10 14:40:31 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Muller-Quade:1998:CIF,
author = "J{\"o}rn M{\"u}ller-Quade and Thomas Beth",
title = "Computing the Intersection of Finitely Generated
Fields",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "62--62",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Nov 10 14:40:31 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Abstract only.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jeffrey:1998:IVC,
author = "D. J. Jeffrey",
title = "{ISSAC '99 Vancouver} Call for Papers: {International
Symposium on Symbolic and Algebraic Computation, 28--31
July 1999, Simon Fraser University, British Columbia,
Canada}",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "63--64",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Nov 10 14:40:31 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kaltofen:1998:EEC,
author = "E. Kaltofen",
title = "{ECCAD '99: East Coast Computer Algebra Day}",
journal = j-SIGSAM,
volume = "32",
number = "2",
pages = "64--64",
month = jun,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Nov 10 14:40:31 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "124",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:1998:EM,
author = "Robert M. Corless",
title = "{Editor}'s Message",
journal = j-SIGSAM,
volume = "32",
number = "3",
pages = "1--1",
month = sep,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Mar 09 12:05:49 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "125",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Watt:1998:PSM,
author = "Stephen M. Watt",
title = "Positions in Symbolic Mathematical Computation at the
{University of Western Ontario}",
journal = j-SIGSAM,
volume = "32",
number = "3",
pages = "1--1",
month = sep,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Mar 09 12:05:49 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "125",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fateman:1998:SNS,
author = "Richard Fateman",
title = "A short note on short differentiation programs in
{Lisp}, and a comment on logarithmic differentiation",
journal = j-SIGSAM,
volume = "32",
number = "3",
pages = "2--7",
month = sep,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "125",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Abramson:1998:HBQ,
author = "Michael Abramson",
title = "Historical Background: {``The Question of Finitely
Many Steps in Polynomial Ideal Theory''}",
journal = j-SIGSAM,
volume = "32",
number = "3",
pages = "8--8",
month = sep,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Mar 09 12:05:49 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "125",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hermann:1998:QFM,
author = "Grete Hermann",
title = "The Question of Finitely Many Steps in Polynomial
Ideal Theory",
journal = j-SIGSAM,
volume = "32",
number = "3",
pages = "8--30",
month = sep,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Translation by Michael Abramson of the article {\em
Die Frage der endlich vielen Schritte in der Theorie
der Polynomideale}, originally published in Math. Ann.
{\bf 95} (1926), 736--788 (Received 29 May 1925).",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "125",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lin:1998:AAAa,
author = "Shu Lin",
title = "Announcements: {Applied Algebra Algebraic Algorithms
Error-Correcting Codes, Honolulu, Hawaii (USA) ---
14--19 November 1999}",
journal = j-SIGSAM,
volume = "32",
number = "3",
pages = "31--31",
month = sep,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Mar 09 12:05:49 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "125",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Roanes-Lozano:1998:AIA,
author = "E. Roanes-Lozano",
title = "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)}",
journal = j-SIGSAM,
volume = "32",
number = "3",
pages = "31--31",
month = sep,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Mar 09 12:05:49 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "125",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Zima:1998:ACPa,
author = "Eugene Zima",
title = "Announcements: Call for Posters: {ISSAC '99
Vancouver}",
journal = j-SIGSAM,
volume = "32",
number = "3",
pages = "32--32",
month = sep,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Mar 09 12:05:49 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "125",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:1998:MEb,
author = "Rob Corless",
title = "Message from the {Editor}",
journal = j-SIGSAM,
volume = "32",
number = "4",
pages = "1--1",
month = dec,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 14 15:21:10 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "126",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Watt:1998:RSN,
author = "Stephen Watt",
title = "Report of the {SIGSAM Nominating Committee}",
journal = j-SIGSAM,
volume = "32",
number = "4",
pages = "1--1",
month = dec,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 14 15:21:10 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "126",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wang:1998:UPD,
author = "Dongming Wang",
title = "Unmixed and Prime Decomposition of Radicals of
Polynomial Ideals",
journal = j-SIGSAM,
volume = "32",
number = "4",
pages = "2--9",
month = dec,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "126",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Villard:1998:BSS,
author = "Gilles Villard",
title = "Block solution of sparse linear systems over {$ {\rm
GF}(q) $}: the singular case",
journal = j-SIGSAM,
volume = "32",
number = "4",
pages = "10--12",
month = dec,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "126",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sasaki:1998:CEM,
author = "Tateaki Sasaki and Tomoyuki Sato",
title = "Cancellation Errors in Multivariate Resultant
Computation with Floating-point Numbers",
journal = j-SIGSAM,
volume = "32",
number = "4",
pages = "13--20",
month = dec,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "126",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Tsarev:1998:FLP,
author = "S. P. Tsarev",
title = "Factorization of linear partial differential operators
and {Darboux} integrability of nonlinear {PDEs}
({ISSAC'98} Poster)",
journal = j-SIGSAM,
volume = "32",
number = "4",
pages = "21--28",
month = dec,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "126",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Volcheck:1998:PSC,
author = "E. Volcheck",
title = "{Parallel Symbolic Computing Workshop, October 1--3,
1998, Mathematical Sciences Research Institute,
Berkeley, CA, USA}",
journal = j-SIGSAM,
volume = "32",
number = "4",
pages = "29--30",
month = dec,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "126",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lin:1998:AAAb,
author = "Shu Lin",
title = "Announcements: {Applied Algebra Algebraic Algorithms
Error-Correcting Codes, Honolulu, Hawaii (USA) ---
14--19 November 1999}",
journal = j-SIGSAM,
volume = "32",
number = "4",
pages = "31--31",
month = dec,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 14 15:21:10 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "126",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Zima:1998:ACPb,
author = "Eugene Zima",
title = "Announcements: Call for Posters: {ISSAC '99
Vancouver}",
journal = j-SIGSAM,
volume = "32",
number = "4",
pages = "32--32",
month = dec,
year = "1998",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 14 15:21:10 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "126",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Watt:1999:EM,
author = "Stephen M. Watt and Xuehong Li",
title = "Examples of {MathML}",
journal = j-SIGSAM,
volume = "33",
number = "1",
pages = "1--4",
month = mar,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "127",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ostrowski:1999:STC,
author = "A. Ostrowski",
title = "On the Significance of the Theory of Convex Polyhedra
for Formal Algebra",
journal = j-SIGSAM,
volume = "33",
number = "1",
pages = "5--5",
month = mar,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "127",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{deOlazabal:1999:UMD,
author = "J. M. de Olaz{\'a}bal",
title = "Unified method for determining canonical forms of a
matrix",
journal = j-SIGSAM,
volume = "33",
number = "1",
pages = "6--20",
month = mar,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "127",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Slavyanov:1999:DSF,
author = "S. Yu. Slavyanov and A. B. Pirozhnikov and A. M.
Akopyan and W. Lay and Z. B. Yazik",
title = "Database of the special functions of mathematical
physics",
journal = j-SIGSAM,
volume = "33",
number = "1",
pages = "21--27",
month = mar,
year = "1999",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/329984.329988",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "127",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:1999:FACa,
author = "Anonymous",
title = "First Announcement and Call for Papers: {ISSAC 2000:
International Symposium on Symbolic and Algebraic
Computation, University of St. Andrews, Scotland,
August 7--9, 2000}",
journal = j-SIGSAM,
volume = "33",
number = "1",
pages = "28--28",
month = mar,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Oct 13 10:23:06 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "127",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:1999:SACa,
author = "Anonymous",
title = "Second Announcement and Call for Papers: {RWCA'00:
Seventh Rhine Workshop on Computer Algebra, March 22 --
March 24, 2000, Bregenz, Austria}",
journal = j-SIGSAM,
volume = "33",
number = "1",
pages = "29--29",
month = mar,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Oct 13 10:23:06 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "127",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:1999:FACb,
author = "Anonymous",
title = "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}",
journal = j-SIGSAM,
volume = "33",
number = "1",
pages = "30--30",
month = mar,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Oct 13 10:23:06 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "127",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:1999:TIW,
author = "Anonymous",
title = "{The Third International Workshop on Computer Algebra
in Scientific Computing, CASC-2000, October 5--9, 2000,
Samarkand State University, Samarkand, Uzbekistan}",
journal = j-SIGSAM,
volume = "33",
number = "1",
pages = "31--31",
month = mar,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Oct 13 10:23:06 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "127",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wu:1999:ATC,
author = "Wen-ts{\"u}n Wu",
title = "{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}",
journal = j-SIGSAM,
volume = "33",
number = "1",
pages = "32--32",
month = mar,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Oct 13 10:23:06 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "127",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:1999:MOE,
author = "Rob Corless",
title = "Message from the Outgoing {Editor} and {SIGSAM
Chair}",
journal = j-SIGSAM,
volume = "33",
number = "2",
pages = "1--2",
month = jun,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Oct 13 10:23:42 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "128",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Giesbrecht:1999:MIE,
author = "Mark Giesbrecht",
title = "Message from the Incoming {Editor}",
journal = j-SIGSAM,
volume = "33",
number = "2",
pages = "2--2",
month = jun,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Oct 13 10:23:42 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "128",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Shirshov:1999:CAP,
author = "A. I. Shirshov",
title = "Certain algorithmic problems for {Lie} algebras",
journal = j-SIGSAM,
volume = "33",
number = "2",
pages = "3--6",
month = jun,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "128",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kahan:1999:SCD,
author = "W. Kahan and Richard J. Fateman",
title = "Symbolic Computation of Divided Differences",
journal = j-SIGSAM,
volume = "33",
number = "2",
pages = "7--28",
month = jun,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "128",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Geddes:1999:GNO,
author = "K. O. Geddes",
title = "Generating Numerical {ODE} Formulas via a Symbolic
Calculus of Divided Differences",
journal = j-SIGSAM,
volume = "33",
number = "2",
pages = "29--42",
month = jun,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "128",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hong:1999:ECC,
author = "Hoon Hong and Erich Kaltofen and Michael Singer",
title = "{East Coast Computer Algebra Day '99 (April 24, 1999):
Abstracts of Invited Talks and Presented Papers}",
journal = j-SIGSAM,
volume = "33",
number = "2",
pages = "43--52",
month = jun,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Oct 13 10:23:42 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "128",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wester:1999:IAC,
author = "Michael Wester and Eugenio Roanes-Lozano",
title = "{IMACS Applications of Computer Algebra Conference
1999}: Summary",
journal = j-SIGSAM,
volume = "33",
number = "2",
pages = "53--57",
month = jun,
year = "1999",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/334714.570086",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Oct 13 10:23:42 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "128",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "MuPAD",
}
@Article{Anonymous:1999:IAI,
author = "Anonymous",
title = "{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}",
journal = j-SIGSAM,
volume = "33",
number = "2",
pages = "58--58",
month = jun,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Oct 13 10:23:42 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "128",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:1999:ECC,
author = "Anonymous",
title = "{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}",
journal = j-SIGSAM,
volume = "33",
number = "2",
pages = "59--59",
month = jun,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Oct 13 10:23:42 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "128",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:1999:FACc,
author = "Anonymous",
title = "First Announcement and Call for Papers: {ISSAC 2000:
International Symposium on Symbolic and Algebraic
Computation, University of St. Andrews, Scotland,
August 7--9, 2000}",
journal = j-SIGSAM,
volume = "33",
number = "2",
pages = "60--60",
month = jun,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Oct 13 10:23:42 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "128",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:1999:SACb,
author = "Anonymous",
title = "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}",
journal = j-SIGSAM,
volume = "33",
number = "2",
pages = "61--61",
month = jun,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Oct 13 10:23:42 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "128",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:1999:FACd,
author = "Anonymous",
title = "First Announcement and Call for Papers: {ASCM'2000:
The 4th Asian Symposium on Computer Mathematics, Chiang
Mai, Thailand, December 17--21, 2000}",
journal = j-SIGSAM,
volume = "33",
number = "2",
pages = "62--62",
month = jun,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Oct 13 10:23:42 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "http://ww.mmrc.iss.ac.cn/~ascm",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "128",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:1999:SON,
author = "Anonymous",
title = "{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}",
journal = j-SIGSAM,
volume = "33",
number = "2",
pages = "63--63",
month = jun,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Oct 13 10:23:42 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "128",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:1999:TCL,
author = "Anonymous",
title = "{Transactions on Computational Logic (TOCL)}: Call for
Papers",
journal = j-SIGSAM,
volume = "33",
number = "2",
pages = "64--64",
month = jun,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Oct 13 10:23:42 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "http://www.acm.org/tocl",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "128",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Giesbrecht:1999:MEa,
author = "Mark Giesbrecht",
title = "Message from the {Editor}",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "1--1",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Dec 23 09:29:23 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "129",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Dousson:1999:EHC,
author = "Xavier Dousson",
title = "Effective homology of a classifying space",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "2--9",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "129",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Moeller:1999:GNZ,
author = "Michael Moeller",
title = "Good non-zeros of polynomials",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "10--11",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "129",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jalabert:1999:UNP,
author = "M. Lejeune Jalabert",
title = "On the ubiquity of {Newton} polyhedra",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "12--12",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Recio:1999:CWD,
author = "T. Recio",
title = "Computing {Weil}'s descente variety",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "12--12",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bermejo:1999:AFS,
author = "Isabel Bermejo",
title = "Abstracts of the fifth {Spanish} meeting on computer
algebra and applications {EACA-99}",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "12--19",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "129",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Schicho:1999:PPA,
author = "J. Schicho",
title = "The parameterization problem for algebraic surfaces",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "13--13",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sergeraert:1999:CAT,
author = "F. Sergeraert",
title = "Constructive algebraic topology",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "13--13",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Vasconcelos:1999:BCI,
author = "W. V. Vasconcelos",
title = "Bounds in the computation of the integral closure",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "13--13",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Xambo:1999:UOE,
author = "S. Xamb{\'o}",
title = "Using {OMEGA} for the effective construction, coding
and decoding of block error-correcting codes",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "13--13",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Alvarez:1999:SRP,
author = "L. {\'A}lvarez and J. S{\'a}nchez",
title = "On some real problems in computer vision which yield
to algebraic system of equations",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "13--14",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Andradas:1999:CPO,
author = "C. Andradas and M. P. V{\'e}lez",
title = "Convex polytopes over ordered fields",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "14--14",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Barile:1999:EDM,
author = "M. Barile and M. Morales and A. Thoma",
title = "On equations defining monomial varieties",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "14--14",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bermejo:1999:CMR,
author = "I. Bermejo and Ph. Gimenez and M. Morales",
title = "On {Castelnuovo--Mumford} regularity of codimension
two monomial varieties",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "14--14",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bueso:1999:WFG,
author = "J. L. Bueso and J. G{\'o}mez Torrecillas and F. J.
Lobillo",
title = "When is a finitely generated algebra of
{Poincar{\'e}--Birkhoff--Witt} type?",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "14--15",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cattani:1999:SRH,
author = "E. Cattani and A. Dickenstein and B. Sturmfels",
title = "The search for rational {A-hypergeometric} functions",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "15--15",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:1999:OPC,
author = "R. M. Corless",
title = "Open problems in computer algebra",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "15--15",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{DAndrea:1999:BFM,
author = "C. D'Andrea and A. Dickenstein",
title = "{Bezoutian} formulas {\`a} la {Macaulay} for the
multivariate resultant",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "15--15",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gaeta:1999:NNR,
author = "F. Gaeta",
title = "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 $}",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "15--15",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Morales:1999:ACE,
author = "G. Fleitas Morales",
title = "Algorithms to compute the eigenvalues of a $p$-adic
matrix",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "15--15",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Barroso:1999:PIT,
author = "E. Garc{\'\i}a Barroso",
title = "Polar invariants and topology",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "16--16",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Garcia-Garcia:1999:CIE,
author = "J. I. Garc{\'\i}a-Garc{\'\i}a and P. A. Garc{\'\i}a
S{\'a}nchez and J. C. Rosales",
title = "Commutative ideal extensions of {Abelian} groups",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "16--16",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gutierrez:1999:SPT,
author = "J. Gutierrez and R. Rubio",
title = "Subfields in pure transcendental extensions",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "16--16",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hernandez:1999:USE,
author = "X. Hern{\'a}ndez and J. M. Miret",
title = "Using {Schubert} to enumerate conics in {$ \mathbb
{P}^3 $}",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "16--16",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Perez:1999:NPA,
author = "P. D. Gonz{\'a}lez P{\'e}rez",
title = "A {Newton--Puiseux} algorithm for the ring {$ C \{
X_1, \ldots {}, X_d \} [Y] $}",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "16--16",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Iglesias:1999:CET,
author = "M. T. Iglesias and C. Vidal and A. Verschoren",
title = "Computing epistasis through {Walsh} transforms",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "16--17",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Krick:1999:AN,
author = "T. Krick and L. M. Pardo and M. Sombra",
title = "Arithmetic {Nullstellens{\"a}tze}",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "17--17",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lamban:1999:SSE,
author = "L. Lamb{\'a}n and V. Pascual and J. Rub{\'\i}o",
title = "Simplicial sets in the {EAT} system",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "17--17",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Maignan:1999:RSI,
author = "A. Maignan",
title = "Real solving of ill-conditioned sine-polynomials
equations",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "17--17",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Marcelo:1999:RPS,
author = "A. Marcelo and F. Marcelo and C. Rodr{\'\i}guez",
title = "Radicals of primary submodules",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "17--17",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{deCastilla:1999:INB,
author = "I. Ojeda Mart{\'\i}nez de Castilla and R. Piedra
S{\'a}nchez",
title = "Index of nilpotency of binomial ideals",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "18--18",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Montes:1999:BAS,
author = "A. Montes",
title = "Basic algorithms for specialization in {Gr{\"o}bner}
bases",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "18--18",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Orecchia:1999:IGU,
author = "F. Orecchia",
title = "Implicitization of a general union of parametric
varieties",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "18--18",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Peralta:1999:GCG,
author = "J. Peralta and B. Torrecillas",
title = "Graded codes by {G-sets}",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "18--18",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{SanJuan:1999:SPS,
author = "J. F. {San Juan} and A. Abad and S. Serrano and A.
Gav{\'\i}n",
title = "Solving problems symbolically by using {Poisson Series
Processors}",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "18--19",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sendra:1999:ORP,
author = "J. R. Sendra and C. Villarino",
title = "Optimal reparameterization of polynomial algebraic
curves",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "19--19",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Berman:1999:CGG,
author = "Peter Berman",
title = "Computing the {Galois} group of {$ y^{(3)} + a y' + b
y = 0, a, b \in \mathcal {C}[x] $}",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "20--20",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Khan:1999:CSS,
author = "Rao F. H. Khan and N. Ahmad",
title = "A comparison of symbolic solution of radioactive decay
chains using {Mathematica}",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "20--20",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bernardin:1999:JFM,
author = "Laurent Bernardin",
title = "A {Java} framework for massively distributed symbolic
computing",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "20--21",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Zima:1999:IPA,
author = "Eugene Zima",
title = "{ISSAC'99} Poster Abstracts: Session {I}",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "20--27",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Dec 23 09:29:23 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "129",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Group:1999:CEM,
author = "Lemme Group",
title = "{CtCoq}: an environment for mathematical reasoning",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "21--22",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Char:1999:DSE,
author = "Bruce W. Char and Anthony Harrison and Thomas Hewett
and Ron Perline and Muksim Rakhimov",
title = "Developing the {Soliton Explorer}: a problem solving
environment for soliton surface investigation",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "22--23",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cheb-Terrab:1999:SCI,
author = "Edgardo S. Cheb-Terrab and Theodore Kolokolnikov and
Austin D. Roche",
title = "The search for and classification of integrable {Abel
ODE} classes",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "23--24",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Clark:1999:MM,
author = "David Clark and James McCarron",
title = "Modules for {Maple}",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "24--25",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{DeWit:1999:ACR,
author = "David {De Wit}",
title = "Automatic construction of an {R Matrix}",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "25--25",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fateman:1999:SEN,
author = "Richard J. Fateman",
title = "Symbolic execution and {NaNs}: diagnostic tools for
tracking scientific computation",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "25--26",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fateman:1999:PTM,
author = "Richard J. Fateman and Eylon Caspi",
title = "Parsing {{\TeX}} into mathematics",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "26--26",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fee:1999:GLQ,
author = "Greg Fee",
title = "{Gauss--Legendre} quadrature",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "26--26",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gentle:1999:CGC,
author = "Cassidy Gentle",
title = "Computing greatest common divisors of polynomial
matrices",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "26--27",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gordan:1999:IBF,
author = "P. Gordan",
title = "Invariants of Binary Forms",
journal = j-SIGSAM,
volume = "33",
number = "3",
pages = "28--32",
month = sep,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Translation by Michael Abramson of the article {\em
Les invariants des formes binaires}, originally
published in J. de Math{\'e}matiques Pures et
Appliqu{\'e}s, {\bf 6}, (1900), 141-156.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "129",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Giesbrecht:1999:MEb,
author = "Mark Giesbrecht",
title = "Message from the {Editor}",
journal = j-SIGSAM,
volume = "33",
number = "4",
pages = "1--1",
month = dec,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Dec 23 09:31:37 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "130",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Stetter:1999:NPG,
author = "Hans J. Stetter",
title = "The Nearest Polynomial with a Given Zero, and Similar
Problems",
journal = j-SIGSAM,
volume = "33",
number = "4",
pages = "2--4",
month = dec,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "130",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lewis:1999:CPO,
author = "Robert H. Lewis and Michael Wester",
title = "Comparison of polynomial-oriented computer algebra
systems",
journal = j-SIGSAM,
volume = "33",
number = "4",
pages = "5--13",
month = dec,
year = "1999",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/500457.500459",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Oct 18 05:08:13 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/magma.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Exact symbolic computation with polynomials and
matrices over polynomial rings has wide applicability
to many fields [Hereman96, Lewis99]. By ``exact
symbolic'', we mean computation with polynomials whose
coefficients are integers (of any size), rational
numbers, or from finite fields, as opposed to
coefficients that are ``floats'' of a certain
precision. Such computation is part of most computer
algebra (CA) systems. Over the last dozen years,
several large CA systems have become widely available,
such as Axiom, Derive, Macsyma, Maple, Mathematica and
Reduce. They tend to have great breadth, be produced by
profit-making companies, and be relatively expensive,
at least for a full blown non-student version. However,
most if not all of these systems have difficulty
computing with the polynomials and matrices that arise
in actual research. Real problems tend to produce large
polynomials and large matrices that the general CA
systems cannot handle [Lewis99].In the last few years,
several smaller CA systems focused on polynomials have
been produced at universities by individual researchers
or small teams. They run on Macs, PCs and workstations.
They are freeware or shareware. Several claim to be
much more efficient than the large systems at exact
polynomial computations. The list of these systems
includes CoCoA, Fermat, MuPAD, Pari-GP and Singular
[CoCoA, Fermat, MuPAD, Pari-GP, Singular].In this
paper, we compare these small systems to each other and
to two of the large systems (Magma and Maple) on a set
of problems involving exact symbolic computation with
polynomials and matrices. The problems here involve:
(*) the ground rings Z, Q, Z/p and other finite fields
(*) basic arithmetic of polynomials over the ground
ring (*) basic arithmetic of rational functions over
the ground ring (*) polynomial evaluation
(substitution) (*) matrix normal forms (*) determinants
and characteristic polynomials (*) GCDs of multivariate
polynomials (*) resultants.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "130",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fortuna:1999:SFD,
author = "Elisabetta Fortuna and Patrizia Gianni",
title = "Square-Free Decomposition in Finite Characteristic: an
Application to {Jordan} Form Computation",
journal = j-SIGSAM,
volume = "33",
number = "4",
pages = "14--32",
month = dec,
year = "1999",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:06 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "130",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gonzalez-Lopez:2000:GBS,
author = "M.-J. Gonzalez-Lopez and L. Gonzalez-Vega and C.
Traverso and A. Zanoni",
title = "{Gr{\"o}bner} Bases Specialization through {Hilbert}
Functions: The Homogeneous Case",
journal = j-SIGSAM,
volume = "34",
number = "1",
pages = "1--8",
month = mar,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "131",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sasaki:2000:HCS,
author = "Tateaki Sasaki and Daiju Inaba",
title = "{Hensel} Construction of $ {F}(x, u_1, \ldots {},
u_\ell), \ell \geq 2 $, at a Singular Point and Its
Applications",
journal = j-SIGSAM,
volume = "34",
number = "1",
pages = "9--17",
month = mar,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "131",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hare:2000:RCB,
author = "K. Hare",
title = "Rapid computation of {Bernoulli} and related numbers",
journal = j-SIGSAM,
volume = "34",
number = "1",
pages = "18--19",
month = mar,
year = "2000",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/373500.373504",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "131",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "MuPAD",
}
@Article{Zima:2000:IPA,
author = "Eugene Zima",
title = "{ISSAC'99} Poster Abstracts: Session {II}",
journal = j-SIGSAM,
volume = "34",
number = "1",
pages = "18--31",
month = mar,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Dec 23 09:31:56 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "131",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Huber:2000:CGF,
author = "Birkett Huber",
title = "Computing {Gr{\"o}bner} fans of toric ideals",
journal = j-SIGSAM,
volume = "34",
number = "1",
pages = "19--20",
month = mar,
year = "2000",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/373500.373503",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "131",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "MuPAD",
}
@Article{Kai:2000:HCB,
author = "Hiroshi Kai and Matu-Tarow Noda",
title = "Hybrid computation of bivariate rational
interpolation",
journal = j-SIGSAM,
volume = "34",
number = "1",
pages = "20--21",
month = mar,
year = "2000",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/373500.373505",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "131",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "MuPAD",
}
@Article{Ke:2000:SAC,
author = "Nainn-Ping Ke",
title = "Symbolic and algebraic computation in robust stability
analysis",
journal = j-SIGSAM,
volume = "34",
number = "1",
pages = "21--21",
month = mar,
year = "2000",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/373500.373506",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "131",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "MuPAD",
}
@Article{Lewis:2000:CPO,
author = "Robert H. Lewis",
title = "Comparison of polynomial-oriented computer algebra
systems",
journal = j-SIGSAM,
volume = "34",
number = "1",
pages = "24--24",
month = mar,
year = "2000",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/373500.373507",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "131",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Murao:2000:AAE,
author = "Hirokazu Murao",
title = "{$ 2 W $}-ary algorithm for extended problem of
integer {GCD}",
journal = j-SIGSAM,
volume = "34",
number = "1",
pages = "25--25",
month = mar,
year = "2000",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/373500.373508",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "131",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "MuPAD",
}
@Article{Popov:2000:OSA,
author = "Bogdan A. Popov",
title = "Optimal starting approximation and iterative algorithm
for inverse error function",
journal = j-SIGSAM,
volume = "34",
number = "1",
pages = "25--26",
month = mar,
year = "2000",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/373500.373510",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "131",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "MuPAD",
}
@Article{Sato:2000:PCB,
author = "Yosuke Sato",
title = "Parallel computation of {Boolean Gr{\"o}bner} bases",
journal = j-SIGSAM,
volume = "34",
number = "1",
pages = "27--28",
month = mar,
year = "2000",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/373500.373509",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "131",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "MuPAD",
}
@Article{Thiery:2000:AIGa,
author = "Nicolas M. Thi{\'e}ry",
title = "Algebraic invariants of graphs: a computer aided
study",
journal = j-SIGSAM,
volume = "34",
number = "1",
pages = "29--29",
month = mar,
year = "2000",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/373500.373511",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "131",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "MuPAD",
}
@Article{Tsai:2000:WCI,
author = "Harrison Tsai",
title = "{Weyl} closure of a {$D$}-ideal",
journal = j-SIGSAM,
volume = "34",
number = "1",
pages = "29--30",
month = mar,
year = "2000",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/373500.373512",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "131",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "MuPAD",
}
@Article{Weispfenning:2000:DLE,
author = "Volker Weispfenning",
title = "Deciding linear-exponential problems",
journal = j-SIGSAM,
volume = "34",
number = "1",
pages = "30--31",
month = mar,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "131",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Reid:2000:IIS,
author = "Greg Reid",
title = "{ISSAC'2001}: International Symposium on Symbolic and
Algebraic Computation",
journal = j-SIGSAM,
volume = "34",
number = "1",
pages = "32--32",
month = mar,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Dec 23 09:31:56 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "131",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Dewar:2000:SIO,
author = "Mike Dewar",
title = "Special Issue on {OpenMath}: Message from the {Guest
Editor}",
journal = j-SIGSAM,
volume = "34",
number = "2",
pages = "1--1",
month = jun,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Dec 23 09:32:29 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "132",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Dewar:2000:OO,
author = "Mike Dewar",
title = "{OpenMath}: An Overview",
journal = j-SIGSAM,
volume = "34",
number = "2",
pages = "2--5",
month = jun,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "132",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Carlisle:2000:OMX,
author = "David Carlisle",
title = "{OpenMath}, {MathML}, and {XSL}",
journal = j-SIGSAM,
volume = "34",
number = "2",
pages = "6--11",
month = jun,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "132",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Davenport:2000:WOC,
author = "James H. Davenport",
title = "On Writing {OpenMath} Content Dictionaries",
journal = j-SIGSAM,
volume = "34",
number = "2",
pages = "12--15",
month = jun,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "132",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Davenport:2000:SOT,
author = "James H. Davenport",
title = "A Small {OpenMath} Type System",
journal = j-SIGSAM,
volume = "34",
number = "2",
pages = "16--21",
month = jun,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "132",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Prieto:2000:MOA,
author = "H{\'e}l{\`e}ne Prieto and St{\'e}phane Dalmas and Yves
Papegay",
title = "{Mathematica} as an {OpenMath} application",
journal = j-SIGSAM,
volume = "34",
number = "2",
pages = "22--26",
month = jun,
year = "2000",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/362001.362016",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Several computer algebra teams around the world have
been working on OpenMath since 1994, but in spite of
more than six years of work (including a dedicated
three years European project), there are not yet any
widely available OpenMath applications. There is
obviously some sort of boot-strapping problem: people
developing mathematical software are not really ready
to invest in the OpenMath technology by making their
applications OpenMath compliant because there are no
interesting OpenMath programs which their own
applications can talk to.Our computer algebra team at
INRIA (formerly SAFIR and now CAFE) has been involved
with the international OpenMath effort since the very
first OpenMath meeting. We have produced several
prototypes at various stages. With the help of people
from Waterloo Maple we have demonstrated a development
version of Maple linked with our OpenMath C library in
December 1996. This prototype was able to exchange data
(including multivariate polynomials in a special
representation) with a Reduce OpenMath server (thanks
to people at ZIB) and a small Aldor ([11]) program
(linked with an Aldor OpenMath library). We have
produced a quite complete OpenMath version of Reduce at
the end of 1997 (during a sabbatical leave at ZIB). We
have used OpenMath in various projects: an algorithm
animation system for Aldor programs ([3]), a deductive
database for mathematical formulas ([5]), a software
component to display and edit formulas ([2]) and as the
output format of a system for optical formula
recognition. Despite all these efforts and the efforts
of the other teams involved in OpenMath which has shown
the interest of this technology the future of OpenMath
is still not clear. Many people in the mathematical
software community remain to be convinced.The advent of
MathML ([9]) has complicated the situation, since to
some people it seems like an alternative to OpenMath.
In practice those defining them see the two standards
as complementary rather than competing, but the
rationale for this is not always obvious to those
outside these communities. With an ever growing number
of MathML applications (the latest versions of
Mathematica and Reduce are already MathML capable), it
is desirable to have applications which demonstrate the
advantages of OpenMath. A natural choice for such an
application is a major computer algebra system. This
would provide a very convenient environment to test
OpenMath applications for any mathematical software
implementer.Currently the only major system that has a
reliable and well tested technology that can be used to
make it an OpenMath application without access to the
system internals is Mathematica (thanks to the MathLink
library, [13]). That is why we choose to build MOMOS,
an OpenMath-Mathematica translator. We also considered
MuPAD and Maple as possible candidates. MuPAD is a very
interesting system. Its ability to dynamically link
external libraries would have allowed us to use our C
library ([7]) to read and write OpenMath objects, but
there are far fewer MuPAD users than Maple or
Mathematica users. The last version of Maple also has
the same sort of capability but when started to write
MOMOS the current Maple version we had access to did
not.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "132",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Triulzi:2000:OSU,
author = "Arrigo Triulzi",
title = "{OpenMath} support under {CSL}-hosted {{\sc Reduce}}",
journal = j-SIGSAM,
volume = "34",
number = "2",
pages = "27--30",
month = jun,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "132",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{AlvarezSobreviela:2000:RBO,
author = "Luis {Alvarez Sobreviela}",
title = "A {Reduce}-based {OpenMath} $ \leftrightarrow $
{MathML} Translator",
journal = j-SIGSAM,
volume = "34",
number = "2",
pages = "31--32",
month = jun,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "132",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Caprotti:2000:JPC,
author = "Olga Caprotti and Arjeh M. Cohen and Manfred Riem",
title = "{JAVA} Phrasebooks for Computer Algebra and Automated
Deduction",
journal = j-SIGSAM,
volume = "34",
number = "2",
pages = "33--37",
month = jun,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "132",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Dirat:2000:JSC,
author = "Laurent Dirat",
title = "{JOME}, a Software Component for Interactive and
Distributed Mathematics",
journal = j-SIGSAM,
volume = "34",
number = "2",
pages = "38--42",
month = jun,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "132",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kohlhase:2000:OIO,
author = "Michael Kohlhase",
title = "{OMDoc}: An Infrastructure for {OpenMath} Content
Dictionary Information",
journal = j-SIGSAM,
volume = "34",
number = "2",
pages = "43--48",
month = jun,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "132",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wright:2000:IMW,
author = "Francis J. Wright",
title = "Interactive Mathematics via the {Web} using {MathML}",
journal = j-SIGSAM,
volume = "34",
number = "2",
pages = "49--57",
month = jun,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "132",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:2000:AAS,
author = "Robert M. Corless and James H. Davenport and David J.
Jeffrey and Stephen M. Watt",
title = "``According to {Abramowitz and Stegun}'' or $ \arccoth
$ needn't be uncouth",
journal = j-SIGSAM,
volume = "34",
number = "2",
pages = "58--65",
month = jun,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "132",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Strotmann:2000:OCA,
author = "Andreas Strotmann and Ladislav Kohout",
title = "{OpenMath}: compositionality achieved at last",
journal = j-SIGSAM,
volume = "34",
number = "2",
pages = "66--72",
month = jun,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "132",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Schulzky:2000:RSR,
author = "Christian Schulzky and Astrid Franz and Karl Heinz
Hoffmann",
title = "Resistance Scaling and Random Walk Dimensions for
Finitely Ramified {Sierpinski} Carpets",
journal = j-SIGSAM,
volume = "34",
number = "3",
pages = "1--8",
month = sep,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "133",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Thiery:2000:AIGb,
author = "Nicolas M. Thi{\'e}ry",
title = "Algebraic invariants of graphs; a study based on
computer exploration",
journal = j-SIGSAM,
volume = "34",
number = "3",
pages = "9--20",
month = sep,
year = "2000",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/377604.377612",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "133",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "MuPAD",
}
@Article{Anonymous:2000:ECCa,
author = "Anonymous",
title = "{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",
journal = j-SIGSAM,
volume = "34",
number = "3",
pages = "21--21",
month = sep,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue May 01 16:32:28 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "133",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2000:ECCb,
author = "Anonymous",
title = "{East Coast Computer Algebra Day: May 13, 2000,
Ontario Research Centre for Computer Algebra,
University of Western Ontario, London, Ontario,
Canada}: Abstracts of Posters",
journal = j-SIGSAM,
volume = "34",
number = "3",
pages = "22--27",
month = sep,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue May 01 16:32:28 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "133",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2000:SONa,
author = "Anonymous",
title = "{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",
journal = j-SIGSAM,
volume = "34",
number = "3",
pages = "28--28",
month = sep,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue May 01 16:32:28 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "133",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2000:SONb,
author = "Anonymous",
title = "{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",
journal = j-SIGSAM,
volume = "34",
number = "3",
pages = "29--31",
month = sep,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue May 01 16:32:28 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "133",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Abramov:2000:NND,
author = "S. A. Abramov",
title = "A Note on the Number of Division Steps in the
{Euclidean} Algorithm",
journal = j-SIGSAM,
volume = "34",
number = "4",
pages = "1--2",
month = dec,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "134",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Steinwandt:2000:CST,
author = "Rainer Steinwandt",
title = "On computing a separating transcendence basis",
journal = j-SIGSAM,
volume = "34",
number = "4",
pages = "3--6",
month = dec,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "134",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:2000:ESM,
author = "Robert M. Corless",
title = "An Elementary Solution of a Minimax Problem Arising in
Algorithms for Automatic Mesh Selection",
journal = j-SIGSAM,
volume = "34",
number = "4",
pages = "7--15",
month = dec,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "134",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Essex:2000:NM,
author = "Christopher Essex and Matt Davison and Christian
Schulzky",
title = "Numerical Monsters",
journal = j-SIGSAM,
volume = "34",
number = "4",
pages = "16--32",
month = dec,
year = "2000",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 8 18:27:07 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "134",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:2001:MSC,
author = "Robert M. Corless",
title = "Message from the {SIGSAM Chair}",
journal = j-SIGSAM,
volume = "35",
number = "1",
pages = "1--2",
month = mar,
year = "2001",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Mon Jul 16 18:20:26 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "135",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Willis:2001:EDE,
author = "Barton L. Willis",
title = "An Extensible Differential Equation Solver",
journal = j-SIGSAM,
volume = "35",
number = "1",
pages = "3--7",
month = mar,
year = "2001",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Mon Jul 16 18:20:26 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "135",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:2001:RMC,
author = "Robert M. Corless",
title = "Review of {{\em Modern Computer Algebra}}, by {Joachim
von zu Gathen} and {J{\"u}gen Gerhard}",
journal = j-SIGSAM,
volume = "35",
number = "1",
pages = "8--13",
month = mar,
year = "2001",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Mon Jul 16 18:20:26 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "135",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Daley:2001:RQC,
author = "Mark Daley",
title = "Review of {{\em Quantum Computing and Quantum
Information}}, by {Michael A. Nielson} and {Issac L.
Chuang}",
journal = j-SIGSAM,
volume = "35",
number = "1",
pages = "14--15",
month = mar,
year = "2001",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Mon Jul 16 18:20:26 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "135",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bonorden:2001:FBP,
author = "Olaf Bonorden and Joachim von zur Gathen and
J{\"u}rgen Gerhard and Olaf M{\"u}ller and Michael
N{\"o}cker",
title = "Factoring a binary polynomial of degree over one
million",
journal = j-SIGSAM,
volume = "35",
number = "1",
pages = "16--18",
month = mar,
year = "2001",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Mon Jul 16 18:20:26 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "135",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kotsireas:2001:HPS,
author = "Ilias S. Kotsireas",
title = "Homotopies and polynomial system solving {I}: Basic
principles",
journal = j-SIGSAM,
volume = "35",
number = "1",
pages = "19--32",
month = mar,
year = "2001",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Mon Jul 16 18:20:26 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "135",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Egner:2001:ADI,
author = "S. Egner and J. Johnson and D. Padua and M.
P{\"u}schel and J. Xiong",
title = "Automatic Derivation and Implementation of Signal
Processing Algorithms",
journal = j-SIGSAM,
volume = "35",
number = "2",
pages = "1--19",
month = jun,
year = "2001",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 08 17:54:13 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "136",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Egorychev:2001:ECA,
author = "G. P. Egorychev and V. M. Levchuk",
title = "Enumeration in the {Chevalley} algorithm",
journal = j-SIGSAM,
volume = "35",
number = "2",
pages = "20--34",
month = jun,
year = "2001",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 08 17:54:13 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "136",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2001:AAA,
author = "Anonymous",
title = "Announcements: {AAECC-14 Applied Algebra, Algebraic
Algorithms and Error Correcting Codes}",
journal = j-SIGSAM,
volume = "35",
number = "2",
pages = "35--35",
month = jun,
year = "2001",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 08 17:54:13 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "136",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2001:CPL,
author = "Anonymous",
title = "Call for Papers: {Latin American Theoretical
INformatics --- LATIN '2002}",
journal = j-SIGSAM,
volume = "35",
number = "2",
pages = "36--36",
month = jun,
year = "2001",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 08 17:54:13 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "136",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Le:2001:CMT,
author = "H. Q. Le",
title = "Computing the Minimal Telescoper for Sums of
Hypergeometric Terms",
journal = j-SIGSAM,
volume = "35",
number = "3",
pages = "2--10",
month = sep,
year = "2001",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 08 17:54:13 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "137",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "Maple",
}
@Article{Lazard:2001:SSA,
author = "D. Lazard",
title = "Solving Systems of Algebraic Equations",
journal = j-SIGSAM,
volume = "35",
number = "3",
pages = "11--37",
month = sep,
year = "2001",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 08 17:54:13 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Originally published as ``R{\'e}solution des
Syst{\'e}mes d'{\'E}quations Alg{\'e}braiques'', {\em
Theoretical Computer Science} {\bf 15} (1981), 77--110.
Translated by Michael Abramson.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "137",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kredel:2001:ARW,
author = "H. Kredel",
title = "Announcement: {Rhine Workshop on Computer Algebra}",
journal = j-SIGSAM,
volume = "35",
number = "3",
pages = "38--38",
month = sep,
year = "2001",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 08 17:54:13 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "137",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Calmet:2001:AWU,
author = "J. Calmet",
title = "Announcement: {Workshop on Under- and Over-Determined
Systems of Algebraic or Differential Equations}",
journal = j-SIGSAM,
volume = "35",
number = "3",
pages = "39--39",
month = sep,
year = "2001",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 08 17:54:13 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "137",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Giusti:2001:AIS,
author = "M. Giusti",
title = "Announcement: {International Symposium on Symbolic and
Algebraic Computation}",
journal = j-SIGSAM,
volume = "35",
number = "3",
pages = "40--40",
month = sep,
year = "2001",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Fri Feb 08 17:54:13 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "137",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Dambacher:2001:GRC,
author = "Jeffrey M. Dambacher and Philippe A. Rossignol",
title = "The Golden Rule of Complementary Feedback",
journal = j-SIGSAM,
volume = "35",
number = "4",
pages = "1--9",
month = dec,
year = "2001",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Mon Apr 01 16:06:19 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "138",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Montes:2001:ASS,
author = "Antonio Montes",
title = "Abstracts of the {Sixth Spanish Meeting on Computer
Algebra and Applications: EACA-2000 [Barcelona, Spain,
September 6--8, 2001]}",
journal = j-SIGSAM,
volume = "35",
number = "4",
pages = "10--23",
month = dec,
year = "2001",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Mon Apr 01 16:06:19 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "http://www.unirioja.es/dptos/dmc/eaca2000",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "138",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Robino:2001:ASS,
author = "Julio Robino",
title = "Abstracts of the {Seventh Spanish Meeting on Computer
Algebra and Applications: EACA-2001 [Ezcaray, La Rioja,
Spain, September 12--14, 2001]}",
journal = j-SIGSAM,
volume = "35",
number = "4",
pages = "24--39",
month = dec,
year = "2001",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Mon Apr 01 16:06:19 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "http://www.unirioja.es/dptos/dmc/eaca2001",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "138",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2001:ECC,
author = "Anonymous",
title = "{East Coast Computer Algebra Day 2002}: Announcement
and Call for Participation",
journal = j-SIGSAM,
volume = "35",
number = "4",
pages = "40--40",
month = dec,
year = "2001",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Mon Apr 01 16:06:19 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "138",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:2002:MSC,
author = "Robert M. Corless",
title = "Message from the {SIGSAM Chair}",
journal = j-SIGSAM,
volume = "36",
number = "1",
pages = "1--2",
month = mar,
year = "2002",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Apr 30 18:18:13 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "139",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Buchberger:2002:CAE,
author = "Bruno Buchberger",
title = "Computer Algebra: The End of Mathematics?",
journal = j-SIGSAM,
volume = "36",
number = "1",
pages = "3--9",
month = mar,
year = "2002",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/565145.565147",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Apr 30 18:18:14 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "139",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Benghorbal:2002:D,
author = "Mhenni Benghorbal and Robert M. Corless",
title = "The $n$ th Derivative",
journal = j-SIGSAM,
volume = "36",
number = "1",
pages = "10--14",
month = mar,
year = "2002",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Apr 30 18:18:30 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "139",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Braun:2002:RWO,
author = "W. John Braun and Hao Yu",
title = "Review: {{\em Weighing the Odds}}, by {D. Williams}",
journal = j-SIGSAM,
volume = "36",
number = "1",
pages = "15--17",
month = mar,
year = "2002",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Apr 30 18:33:15 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "139",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jeffrey:2002:TCE,
author = "D. J. Jeffrey and Ilias S. Kotsireas",
title = "Table of Conferences and Events",
journal = j-SIGSAM,
volume = "36",
number = "1",
pages = "17--17",
month = mar,
year = "2002",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Apr 30 18:33:14 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "139",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Babich:2002:WDE,
author = "V. M. Babich and Yu. N. Bibikov and S. Yu. Slavyanov
and N. V. Svanidze and T. F. Pankratova and V.
Novikova",
title = "{Workshop on Differential Equations: Dedicated to the
memory of Vladimir Lazutkin, St.Petersburg, Russia,
August 18--20, 2002}",
journal = j-SIGSAM,
volume = "36",
number = "1",
pages = "18--18",
month = mar,
year = "2002",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Apr 30 18:20:42 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "139",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sit:2002:ECCa,
author = "William Sit",
title = "{East Coast Computer Algebra Day}",
journal = j-SIGSAM,
volume = "36",
number = "1",
pages = "19--21",
month = mar,
year = "2002",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Apr 30 18:23:07 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "139",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kotsireas:2002:AIC,
author = "Ilias S. Kotsireas",
title = "{ACA 2002 8th International Conference on Applications
of Computer Algebra June 25--28, 2002, Volos, Greece}",
journal = j-SIGSAM,
volume = "36",
number = "1",
pages = "22--22",
month = mar,
year = "2002",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Apr 30 18:23:05 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "139",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Schenck:2002:CLS,
author = "H. Schenck",
title = "{CBMS} Lecture Series at {Texas A\&M University}:
Solving Systems of Polynomial Equations, {May 20--24,
2002}, by {Bernd Sturmfels (UC Berkeley)}",
journal = j-SIGSAM,
volume = "36",
number = "1",
pages = "23--23",
month = mar,
year = "2002",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Apr 30 18:24:01 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "139",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Duparc:2002:WOS,
author = "Daniel Duparc and Bernard Mourrain and Bernard Parisse
and Fabrice Rouillier and Marie-Fran{\c{c}}oise Roy and
Nicolas Thi{\'e}ry and Paul Zimmermann",
title = "{Workshop on Open Source Computer Algebra, Tuesday
21st -- Thursday 23rd of May 2002, Lyon, France}",
journal = j-SIGSAM,
volume = "36",
number = "1",
pages = "24--27",
month = mar,
year = "2002",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Apr 30 18:33:07 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "139",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Daly:2002:AOS,
author = "Tim Daly",
title = "{Axiom} as Open Source",
journal = j-SIGSAM,
volume = "36",
number = "1",
pages = "28--28",
month = mar,
year = "2002",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Apr 30 18:33:06 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "139",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Padovani:2002:MIC,
author = "L. Padovani",
title = "{MathML International Conference 2002: MathML and
Technologies for Math on the Web June 28--30, 2002
Hickory Ridge Conference Center, Chicago, Illinois}",
journal = j-SIGSAM,
volume = "36",
number = "1",
pages = "29--30",
month = mar,
year = "2002",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Apr 30 18:33:03 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "139",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Reid:2002:SCA,
author = "G. J. Reid",
title = "{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}}",
journal = j-SIGSAM,
volume = "36",
number = "1",
pages = "31--31",
month = mar,
year = "2002",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Apr 30 18:33:01 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "139",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bainov:2002:TIC,
author = "Drumi Bainov",
title = "{Thirteenth International Colloquium on Differential
Equations}",
journal = j-SIGSAM,
volume = "36",
number = "1",
pages = "32--32",
month = mar,
year = "2002",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Apr 30 18:32:59 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "139",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Reid:2002:GCD,
author = "Greg Reid and Chris Smith and Jan Verschelde",
title = "Geometric completion of differential systems using
numeric-symbolic continuation",
journal = j-SIGSAM,
volume = "36",
number = "2",
pages = "1--17",
month = jun,
year = "2002",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Thu Aug 7 07:11:52 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "140",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Franz:2002:UCA,
author = "Astrid Franz and Christian Schulzky and Karl Heinz
Hoffmann",
title = "Using computer algebra methods to determine the
chemical dimension of finitely ramified {Sierpinski}
carpets",
journal = j-SIGSAM,
volume = "36",
number = "2",
pages = "18--30",
month = jun,
year = "2002",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Thu Aug 7 07:11:52 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "140",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sit:2002:ECCb,
author = "William Y. Sit",
title = "{East Coast Computer Algebra} day: {ECCAD 2002} poster
and demonstration abstracts",
journal = j-SIGSAM,
volume = "36",
number = "3",
pages = "1--1",
month = sep,
year = "2002",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Thu Aug 7 07:11:52 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "141",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sasaki:2002:FSS,
author = "Tateaki Sasaki and Akira Terui",
title = "A formula for separating small roots of a polynomial",
journal = j-SIGSAM,
volume = "36",
number = "3",
pages = "19--23",
month = sep,
year = "2002",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Thu Aug 7 07:11:52 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "141",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cooperman:2002:OMW,
author = "Gene Cooperman and Xiaoqin Ma",
title = "Overcoming the memory wall in symbolic algebra: a
faster permutation multiplication",
journal = j-SIGSAM,
volume = "36",
number = "4",
pages = "1--4",
month = dec,
year = "2002",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Thu Aug 7 07:11:53 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "142",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Barnett:2002:CAL,
author = "Michael P. Barnett",
title = "Computer algebra in the life sciences",
journal = j-SIGSAM,
volume = "36",
number = "4",
pages = "5--32",
month = dec,
year = "2002",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Thu Aug 7 07:11:53 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "142",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{vonTschirnhaus:2003:MRA,
author = "Ehrenfried Walter von Tschirnhaus and R. F. Green",
title = "A method for removing all intermediate terms from a
given equation",
journal = j-SIGSAM,
volume = "37",
number = "1",
pages = "1--3",
month = mar,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Thu Aug 7 07:11:53 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "143",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fateman:2003:CSP,
author = "Richard Fateman",
title = "Comparing the speed of programs for sparse polynomial
multiplication",
journal = j-SIGSAM,
volume = "37",
number = "1",
pages = "4--15",
month = mar,
year = "2003",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/844076.844080",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Thu Aug 7 07:11:53 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "How should one design and implement a program for the
multiplication of sparse polynomials? This is a simple
question, necessarily addressed by the builders of any
computer algebra system (CAS). To examine a few options
we start with a single easily-stated computation which
we believe represents a useful benchmark of ``medium
difficulty'' for CAS designs. We describe a number of
design options and their effects on performance. We
also examine the performance of a variety of commercial
and freely-distributed systems. Important
considerations include the cost of high-precision
(exact) integer arithmetic and the effective use of
cache memory.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "143",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gimenez:2003:AES,
author = "Philippe Gimenez",
title = "Abstracts of the eighth {Spanish} meeting on computer
algebra and applications: {EACA-2002}",
journal = j-SIGSAM,
volume = "37",
number = "1",
pages = "16--27",
month = mar,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Thu Aug 7 07:11:53 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "143",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Davison:2003:BRR,
author = "Matt Davison",
title = "Book Review: Review of risk management: value at risk
and beyond, edited by {M. A. H. Dempster. Cambridge
University Press 2002}",
journal = j-SIGSAM,
volume = "37",
number = "1",
pages = "28--29",
month = mar,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Thu Aug 7 07:11:53 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "143",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Abramson:2003:HBB,
author = "Michael Abramson",
title = "Historical Background for {B. Renschuch}'s papers",
journal = j-SIGSAM,
volume = "37",
number = "2",
pages = "33--34",
month = jun,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Oct 4 11:31:37 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "144",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Renschuch:2003:CCP,
author = "Bodo Renschuch and Hartmut Roloff and Georgij G.
Rasputin and Michael Abramson",
title = "Contributions to constructive polynomial ideal theory
{XXIII}: forgotten works of {Leningrad} mathematician
{N. M. Gjunter} on polynomial ideal theory",
journal = j-SIGSAM,
volume = "37",
number = "2",
pages = "35--48",
month = jun,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Oct 4 11:31:37 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Translated by Michael Abramson. Originally appeared in
{\em Wiss. Z. d. P{\"a}dagogische Hochschule Potsdam
{\bf 31} (1987), 111---126.}",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "144",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Barnett:2003:SCI,
author = "Michael P. Barnett",
title = "Symbolic computation of integrals by recurrence",
journal = j-SIGSAM,
volume = "37",
number = "2",
pages = "49--63",
month = jun,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Oct 4 11:31:37 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "144",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jeffrey:2003:ME,
author = "David J. Jeffrey",
title = "Message from the {Editor}",
journal = j-SIGSAM,
volume = "37",
number = "2",
pages = "63--63",
month = jun,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Oct 4 11:31:37 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "144",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2003:CPA,
author = "Anonymous",
title = "Call for Participation: {ASCM 2003: The Sixth Asian
Symposium on Computer Mathematics, October 23--25, 2003
Beijing, China}",
journal = j-SIGSAM,
volume = "37",
number = "2",
pages = "64--64",
month = jun,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Oct 4 11:31:37 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "144",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Caprotti:2003:ISS,
author = "Olga Caprotti",
title = "{International Symposium on Symbolic and Algebraic
Computation}: poster abstracts 2003",
journal = j-SIGSAM,
volume = "37",
number = "3",
pages = "65--65",
month = sep,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:34 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "145",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Juttler:2003:SIP,
author = "B. J{\"u}ttler and J. Schicho and M. Shalaby",
title = "{$ C^1 $} spline implicitization of planar curves",
journal = j-SIGSAM,
volume = "37",
number = "3",
pages = "65--65",
month = sep,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:34 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "145",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Caruso:2003:ISS,
author = "Fabrizio Caruso",
title = "Interpolation in symbolic summation",
journal = j-SIGSAM,
volume = "37",
number = "3",
pages = "66--66",
month = sep,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:34 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "145",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Chtcherba:2003:RBD,
author = "Arthur D. Chtcherba and Deepak Kapur",
title = "On the relationship between the {Dixon}-based
resultant construction and the supports of polynomial
systems",
journal = j-SIGSAM,
volume = "37",
number = "3",
pages = "66--67",
month = sep,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:34 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "145",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:2003:ACP,
author = "Robert M. Corless and Hiroshi Kai and Stephen M.
Watt",
title = "Approximate computation of pseudovarieties",
journal = j-SIGSAM,
volume = "37",
number = "3",
pages = "67--71",
month = sep,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:34 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "145",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Feng:2003:PSF,
author = "Ruyong Feng and Xiao-Shan Gao",
title = "Polynomial solutions for first order {ODEs} with
constant coefficients",
journal = j-SIGSAM,
volume = "37",
number = "3",
pages = "71--72",
month = sep,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:34 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "145",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kanno:2003:VNM,
author = "Masaaki Kanno and Malcolm C. Smith",
title = "Validated numerical methods for systems and control
engineering",
journal = j-SIGSAM,
volume = "37",
number = "3",
pages = "72--73",
month = sep,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:34 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "145",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kauers:2003:CLS,
author = "Manuel Kauers",
title = "Computing limits of sequences",
journal = j-SIGSAM,
volume = "37",
number = "3",
pages = "74--77",
month = sep,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:34 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "145",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Levandovskyy:2003:UCA,
author = "Viktor Levandovskyy and Hans Sch{\"o}nemann",
title = "Using computer algebra system {SINGULAR:PLURAL} for
computations in noncommutative polynomial algebras",
journal = j-SIGSAM,
volume = "37",
number = "3",
pages = "77--78",
month = sep,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:34 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "145",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kotsireas:2003:EIP,
author = "Ilias Kotsireas and Edmond Lau and Richard Voino",
title = "Exact implicitization of polynomial curves and
surfaces",
journal = j-SIGSAM,
volume = "37",
number = "3",
pages = "78--78",
month = sep,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:34 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "145",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Meunier:2003:MFS,
author = "Ludovic Meunier",
title = "{MAD}: a flexible system for authoring mathematical
documents",
journal = j-SIGSAM,
volume = "37",
number = "3",
pages = "79--81",
month = sep,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:34 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "145",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Noro:2003:IPD,
author = "Masayuki Noro and Kazuhiro Yokoyama",
title = "Implementation of prime decomposition of polynomial
ideals over small finite fields",
journal = j-SIGSAM,
volume = "37",
number = "3",
pages = "81--82",
month = sep,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:34 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "145",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Pernet:2003:LBA,
author = "Cl{\'e}ment Pernet and Zhendong Wan",
title = "{LU} based algorithms for characteristic polynomial
over a finite field",
journal = j-SIGSAM,
volume = "37",
number = "3",
pages = "83--84",
month = sep,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:34 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "145",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Tian-Jiao:2003:OP,
author = "Wu Tian-Jiao",
title = "On optimization problems",
journal = j-SIGSAM,
volume = "37",
number = "3",
pages = "87--88",
month = sep,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:34 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "145",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Zimmermann:2003:SCT,
author = "Burkhard Zimmermann",
title = "A {Sister Celine} type algorithm for definite
summation and integration",
journal = j-SIGSAM,
volume = "37",
number = "3",
pages = "89--89",
month = sep,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:34 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "145",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Adamchik:2003:PTT,
author = "Victor S. Adamchik and David J. Jeffrey",
title = "Polynomial transformations of {Tschirnhaus}, {Bring}
and {Jerrard}",
journal = j-SIGSAM,
volume = "37",
number = "3",
pages = "90--94",
month = sep,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:34 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "145",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Brown:2003:QBP,
author = "Christopher W. Brown",
title = "{QEPCAD B}: a program for computing with
semi-algebraic sets using {CADs}",
journal = j-SIGSAM,
volume = "37",
number = "4",
pages = "97--108",
month = dec,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:34 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "146",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fateman:2003:MCL,
author = "Richard Fateman",
title = "Memory cache and {Lisp}: faster list processing via
automatically rearranging memory",
journal = j-SIGSAM,
volume = "37",
number = "4",
pages = "109--116",
month = dec,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:34 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "146",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Shaska:2003:CAA,
author = "Tanush Shaska",
title = "Computational algebra and algebraic curves",
journal = j-SIGSAM,
volume = "37",
number = "4",
pages = "117--124",
month = dec,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:34 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "146",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Buchel:2003:RDB,
author = "Alex Buchel",
title = "Review of {{\em D-Branes\/} by Clifford V. Johnson.
Cambridge University Press 2002}",
journal = j-SIGSAM,
volume = "37",
number = "4",
pages = "125--127",
month = dec,
year = "2003",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:34 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "146",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{McNamee:2004:CMA,
author = "John Michael McNamee",
title = "A comparison of methods for accurate summation",
journal = j-SIGSAM,
volume = "38",
number = "1",
pages = "1--7",
month = mar,
year = "2004",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/980175.980177",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Apr 17 11:49:58 MDT 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "http://www.acm.org/sigs/sigsam/bulletin/repository/issue147",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "147",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ceberio:2004:GAO,
author = "Martine Ceberio and Vladik Kreinovich",
title = "Greedy algorithms for optimizing multivariate {Horner}
schemes",
journal = j-SIGSAM,
volume = "38",
number = "1",
pages = "8--15",
month = mar,
year = "2004",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Apr 17 11:49:58 MDT 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "147",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cooperman:2004:TCP,
author = "Gene Cooperman",
title = "The {TOP-C} parallel model and symbolic algebra",
journal = j-SIGSAM,
volume = "38",
number = "1",
pages = "16--17",
month = mar,
year = "2004",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Apr 17 11:49:58 MDT 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "147",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Abbott:2004:CLC,
author = "John Abbott",
title = "{CoCoA}: a laboratory for computations in commutative
algebra",
journal = j-SIGSAM,
volume = "38",
number = "1",
pages = "18--19",
month = mar,
year = "2004",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Apr 17 11:49:58 MDT 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "147",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{McGettrick:2004:OGB,
author = "Michael McGettrick",
title = "Online {Gr{\"o}bner} Basis [{OGB}]",
journal = j-SIGSAM,
volume = "38",
number = "1",
pages = "19--21",
month = mar,
year = "2004",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Apr 17 11:49:58 MDT 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "147",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Dhooge:2004:MMP,
author = "A. Dhooge and W. Govaerts and Yu. A. Kuznetsov",
title = "{MATCONT}: a {Matlab} package for numerical
bifurcation analysis of {ODEs}",
journal = j-SIGSAM,
volume = "38",
number = "1",
pages = "21--22",
month = mar,
year = "2004",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Apr 17 11:49:58 MDT 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "147",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Brown:2004:QBS,
author = "Christopher W. Brown",
title = "{QEPCAD B}: a system for computing with semi-algebraic
sets via cylindrical algebraic decomposition",
journal = j-SIGSAM,
volume = "38",
number = "1",
pages = "23--24",
month = mar,
year = "2004",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Apr 17 11:49:58 MDT 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "147",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{vanderHoeven:2004:GT,
author = "Joris van der Hoeven",
title = "{GNU TeXmacs}",
journal = j-SIGSAM,
volume = "38",
number = "1",
pages = "24--25",
month = mar,
year = "2004",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Apr 17 11:49:58 MDT 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "147",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Minimair:2004:MMR,
author = "Manfred Minimair",
title = "{MR}: {Macaulay Resultant} package for {Maple}",
journal = j-SIGSAM,
volume = "38",
number = "1",
pages = "26--27",
month = mar,
year = "2004",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Apr 17 11:49:58 MDT 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "147",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lewis:2004:UFS,
author = "Robert H. Lewis",
title = "Using {Fermat} to solve large polynomial and matrix
problems",
journal = j-SIGSAM,
volume = "38",
number = "1",
pages = "27--28",
month = mar,
year = "2004",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Apr 17 11:49:58 MDT 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "147",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Zeng:2004:MPC,
author = "Zhonggang Zeng",
title = "A {Matlab} package computing polynomial roots and
multiplicities",
journal = j-SIGSAM,
volume = "38",
number = "1",
pages = "28--29",
month = mar,
year = "2004",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Apr 17 11:49:58 MDT 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "147",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Caviness:2004:MRD,
author = "Bob Caviness and Barbara Gatje and James H. Griesmer
and Tony Hearn and Manual Bronstein and Erich
Kaltofen",
title = "In Memoriam: {Richard Dimick Jenks}: {Axiom} Developer
and Computer Algebra Pioneer",
journal = j-SIGSAM,
volume = "38",
number = "1",
pages = "30--30",
month = mar,
year = "2004",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Apr 17 11:49:58 MDT 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "http://savannah.nongnu.org/projects/axiom/",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "147",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ballarin:2004:SPL,
author = "Clemens Ballarin and Manuel Kauers",
title = "Solving parametric linear systems: an experiment with
constraint algebraic programming",
journal = j-SIGSAM,
volume = "38",
number = "2",
pages = "33--46",
month = jun,
year = "2004",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1041791.1041793",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:35 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Algorithms in computer algebra are usually designed
for a fixed set of domains. For example, algorithms
over the domain of polynomials are not applicable to
parameters because the inherent assumption that the
indeterminate X bears no algebraic relation to other
objects is violated.We propose to use a technique from
model theory known as constraint programming to gain
more flexibility, and we show how it can be applied to
the Gaussian algorithm to be used for parametric
systems. Our experiments suggest that in practice this
leads to results comparable to the algorithm for
parametric linear systems by Sit [9] --- at least if
the parameters are sparse.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "148",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "MuPAD",
}
@Article{Farmer:2004:MNI,
author = "William M. Farmer",
title = "{MKM}: a new interdisciplinary field of research",
journal = j-SIGSAM,
volume = "38",
number = "2",
pages = "47--52",
month = jun,
year = "2004",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:35 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "148",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gonzalez-Vega:2004:RCC,
author = "Laureano Gonz{\'a}lez-Vega and Tom{\'a}s Recio",
title = "Review of {``Computational Commutative Algebra I'' by
Martin Kreuzer and Lorenzo Robbiano, Springer-Verlag,
2000, ISBN 3-540-67733-X}",
journal = j-SIGSAM,
volume = "38",
number = "2",
pages = "53--55",
month = jun,
year = "2004",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:35 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "148",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jeffrey:2004:SRB,
author = "D. J. Jeffrey and A. C. Norman",
title = "Not seeing the roots for the branches: multivalued
functions in computer algebra",
journal = j-SIGSAM,
volume = "38",
number = "3",
pages = "57--66",
month = sep,
year = "2004",
CODEN = "SIGSBZ",
DOI = "https://doi.org/10.1145/1040034.1040036",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:35 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "149",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{DeBeule:2004:SMB,
author = "J. {De Beule} and A. Hoogewijs and L. Storme",
title = "On the size of minimal blocking sets of {$ Q(4; q),
\mathrm { for } q = 5, 7 $}",
journal = j-SIGSAM,
volume = "38",
number = "3",
pages = "67--84",
month = sep,
year = "2004",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:35 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "149",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sasaki:2004:TSC,
author = "Tateaki Sasaki",
title = "A theorem for separating close roots of a polynomial
and its derivatives",
journal = j-SIGSAM,
volume = "38",
number = "3",
pages = "85--92",
month = sep,
year = "2004",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:35 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "149",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kotsireas:2004:AVA,
author = "Ilias Kotsireas and Emil Volcheck",
title = "{ANTS VI}: algorithmic number theory symposium poster
abstracts",
journal = j-SIGSAM,
volume = "38",
number = "3",
pages = "93--107",
month = sep,
year = "2004",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Apr 27 19:30:35 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "149",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Holden:2004:DEE,
author = "Joshua Holden",
title = "Distribution of the error in estimated numbers of
fixed points of the discrete logarithm",
journal = j-SIGSAM,
volume = "38",
number = "4",
pages = "111--118",
month = dec,
year = "2004",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat May 7 08:02:47 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "150",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Nagasaka:2004:TMA,
author = "Kosaku Nagasaka",
title = "Towards more accurate separation bounds of empirical
polynomials",
journal = j-SIGSAM,
volume = "38",
number = "4",
pages = "119--129",
month = dec,
year = "2004",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat May 7 08:02:47 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "150",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Inaba:2005:FMP,
author = "Daiju Inaba",
title = "Factorization of multivariate polynomials by extended
{Hensel} construction",
journal = j-SIGSAM,
volume = "39",
number = "1",
pages = "2--14",
month = mar,
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "151",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ajwa:2005:ECC,
author = "Iyad Ajwa",
title = "{East Coast Computer Algebra Day 2005}: poster
abstracts",
journal = j-SIGSAM,
volume = "39",
number = "1",
pages = "15--25",
month = mar,
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "151",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Joyner:2005:CPD,
author = "David Joyner",
title = "Conjectural permutation decoding of some {AG} codes",
journal = j-SIGSAM,
volume = "39",
number = "1",
pages = "26--32",
month = mar,
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Oct 5 08:31:59 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "151",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cheng:2005:SEEa,
author = "Howard Cheng and Barry Gergel and Ethan Kim and Eugene
Zima",
title = "Space-efficient evaluation of hypergeometric series",
journal = j-SIGSAM,
volume = "39",
number = "2",
pages = "41--52",
month = jun,
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Nov 29 06:11:40 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "152",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Graillat:2005:NNP,
author = "Stef Graillat",
title = "A note on a nearest polynomial with a given root",
journal = j-SIGSAM,
volume = "39",
number = "2",
pages = "53--60",
month = jun,
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Nov 29 06:11:40 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "152",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Stein:2005:SSA,
author = "William Stein and David Joyner",
title = "{SAGE: System for Algebra and Geometry
Experimentation}",
journal = j-SIGSAM,
volume = "39",
number = "2",
pages = "61--64",
month = jun,
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Nov 29 06:11:40 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "152",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Joyner:2005:GEC,
author = "David Joyner",
title = "{GUAVA}: an error-correcting codes package",
journal = j-SIGSAM,
volume = "39",
number = "2",
pages = "65--68",
month = jun,
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Tue Nov 29 06:11:40 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "152",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ida:2005:MPE,
author = "Tetsuo Ida",
title = "In memoriam: {Professor Eiichi Goto}",
journal = j-SIGSAM,
volume = "39",
number = "3",
pages = "71--72",
month = sep,
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Feb 4 09:52:36 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "153",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Rezvani:2005:NPG,
author = "Nargol Rezvani and Robert M. Corless",
title = "The nearest polynomial with a given zero, revisited",
journal = j-SIGSAM,
volume = "39",
number = "3",
pages = "73--79",
month = sep,
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Feb 4 09:52:36 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "153",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cheng:2005:ITR,
author = "Jin-San Cheng and Xiao-Shan Gao and Ming Li",
title = "Intrinsic topological representation of real algebraic
surfaces",
journal = j-SIGSAM,
volume = "39",
number = "3",
pages = "80--81",
month = sep,
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Feb 4 09:52:36 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ISSAC 2005 poster abstract.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "153",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cheng:2005:SEEb,
author = "Howard Cheng and Barry Gergel and Ethan Kim and Eugene
Zima",
title = "Space-efficient evaluation of hypergeometric series",
journal = j-SIGSAM,
volume = "39",
number = "3",
pages = "81--83",
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Feb 4 09:52:36 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ISSAC 2005 poster abstract.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "153",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Li:2005:CHF,
author = "Ziming Li and Dabin Zheng",
title = "Computation with hyperexponential functions",
journal = j-SIGSAM,
volume = "39",
number = "3",
pages = "84--85",
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Feb 4 09:52:36 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ISSAC 2005 poster abstract.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "153",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hubert:2005:RRI,
author = "Evelyne Hubert and Irina Kogan",
title = "Rational and replacement invariants of a group
action",
journal = j-SIGSAM,
volume = "39",
number = "3",
pages = "85--87",
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Feb 4 09:52:36 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ISSAC 2005 poster abstract.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "153",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Pan:2005:PRF,
author = "Victor Pan",
title = "Polynomial root-finding with matrix eigen-solving",
journal = j-SIGSAM,
volume = "39",
number = "3",
pages = "87--87",
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Feb 4 09:52:36 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ISSAC 2005 poster abstract.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "153",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{SanSegundo:2005:OPC,
author = "F. {San Segundo} and J. R. Sendra and Juana Sendra",
title = "Offsets from the perspective of computational
algebraic geometry",
journal = j-SIGSAM,
volume = "39",
number = "3",
pages = "87--90",
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Feb 4 09:52:36 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ISSAC 2005 poster abstract.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "153",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Rueda:2005:FFA,
author = "Sonia L. Rueda",
title = "Finite fans, actions of tori and {$D$}-modules",
journal = j-SIGSAM,
volume = "39",
number = "3",
pages = "90--92",
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Feb 4 09:52:36 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ISSAC 2005 poster abstract.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "153",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gao:2005:GSP,
author = "Xiao-Shan Gao and Gui-Fang Zhang",
title = "{$2$D} and {$3$D} generalized {Stewart Platforms}",
journal = j-SIGSAM,
volume = "39",
number = "3",
pages = "92--93",
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Feb 4 09:52:36 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ISSAC 2005 poster abstract.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "153",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Watt:2005:AG,
author = "Stephen M. Watt",
title = "Algebraic generalization",
journal = j-SIGSAM,
volume = "39",
number = "3",
pages = "93--94",
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Feb 4 09:52:36 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ISSAC 2005 poster abstract.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "153",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Krandick:2005:NBD,
author = "Werner Krandick and Kurt Mehlhorn",
title = "New bounds for the {Descartes} method",
journal = j-SIGSAM,
volume = "39",
number = "3",
pages = "94--94",
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Feb 4 09:52:36 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ISSAC 2005 poster abstract.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "153",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sasaki:2005:ASE,
author = "Tateaki Sasaki and Daiju Inaba and Kentaro Katamachi",
title = "An approach to singularity from the extended {Hensel}
construction",
journal = j-SIGSAM,
volume = "39",
number = "3",
pages = "94--95",
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Feb 4 09:52:36 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ISSAC 2005 poster abstract.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "153",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wolf:2005:PCS,
author = "Thomas Wolf",
title = "The package {CRACK} for solving large overdetermined
systems",
journal = j-SIGSAM,
volume = "39",
number = "3",
pages = "95--96",
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Feb 4 09:52:36 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ISSAC 2005 poster abstract.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "153",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lemaire:2005:RLM,
author = "F. Lemaire and M. Moreno Maza and Y. Xie",
title = "The {RegularChains} library in {MAPLE}",
journal = j-SIGSAM,
volume = "39",
number = "3",
pages = "96--97",
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Feb 4 09:52:36 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ISSAC 2005 poster abstract.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "153",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Dahan:2005:CDP,
author = "X. Dahan and {\'E}. Schost and M. Moreno Maza and W.
Wu and Y. Xie",
title = "On the complexity of the {D5} principle",
journal = j-SIGSAM,
volume = "39",
number = "3",
pages = "97--98",
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Feb 4 09:52:36 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ISSAC 2005 poster abstract.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "153",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Belov:2005:MMC,
author = "Nadya Belov and Colin Koeck and Werner Krandick and
Joshua Shaffer",
title = "Mobile mathematics communication",
journal = j-SIGSAM,
volume = "39",
number = "3",
pages = "99--99",
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Feb 4 09:52:36 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ISSAC 2005 poster abstract.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "153",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gao:2005:IDM,
author = "Shuhong Gao and Mingfu Zhu",
title = "Irreducible decomposition of monomial ideals",
journal = j-SIGSAM,
volume = "39",
number = "3",
pages = "99--99",
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Sat Feb 4 09:52:36 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ISSAC 2005 poster abstract.",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "153",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bremner:2005:JAA,
author = "Murray R. Bremner",
title = "{Jordan} algebras arising from intermolecular
recombination",
journal = j-SIGSAM,
volume = "39",
number = "4",
pages = "106--117",
month = dec,
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Aug 23 14:11:11 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "154",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Epitropakis:2005:RFA,
author = "M. G. Epitropakis and M. N. Vrahatis",
title = "Root finding and approximation approaches through
neural networks",
journal = j-SIGSAM,
volume = "39",
number = "4",
pages = "118--121",
month = dec,
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Aug 23 14:11:11 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "154",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Iwami:2005:EEB,
author = "Maki Iwami",
title = "Extension of expansion base algorithm for multivariate
analytic factorization including the case of singular
leading coefficient",
journal = j-SIGSAM,
volume = "39",
number = "4",
pages = "122--126",
month = dec,
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Aug 23 14:11:11 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "154",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Laskari:2005:TTC,
author = "E. C. Laskari and G. C. Meletiou and D. K. Tasoulis
and M. N. Vrahatis",
title = "Transformations of two cryptographic problems in terms
of matrices",
journal = j-SIGSAM,
volume = "39",
number = "4",
pages = "127--130",
month = dec,
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Aug 23 14:11:11 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "154",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Myllari:2005:VDS,
author = "Aleksandr Myll{\"a}ri and Tapio Salakoski and Alexey
Pasechnik",
title = "On the visualization of the {DNA} sequence and its
nucleotide content",
journal = j-SIGSAM,
volume = "39",
number = "4",
pages = "131--135",
month = dec,
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Aug 23 14:11:11 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "154",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Myllari:2005:SEH,
author = "Aleksandr Myll{\"a}ri",
title = "Stability of expanding homographic configurations:
{$3$D} case",
journal = j-SIGSAM,
volume = "39",
number = "4",
pages = "136--138",
month = dec,
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Aug 23 14:11:11 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "154",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Shapeev:2005:ACC,
author = "Vasily Shapeev",
title = "Application of {CAS} to constructing schemes of
superhigh order of accuracy for heat conduction
equation",
journal = j-SIGSAM,
volume = "39",
number = "4",
pages = "139--142",
month = dec,
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Aug 23 14:11:11 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "154",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Tzoumas:2005:ACC,
author = "George M. Tzoumas and Ioannis Z. Emiris",
title = "{Apollonius} circle conflict",
journal = j-SIGSAM,
volume = "39",
number = "4",
pages = "143--146",
month = dec,
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Aug 23 14:11:11 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "SIGSAM Bull.",
fjournal = "SIGSAM Bulletin (ACM Special Interest Group on
Symbolic and Algebraic Manipulation)",
issue = "154",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Eberly:2006:LT,
author = "Wayne Eberly",
title = "Letter from the {Treasurer}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "40",
number = "1",
pages = "1--1",
month = mar,
year = "2006",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Sep 7 16:27:55 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "155",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Umeda:2006:CDR,
author = "Yasushi Umeda and Tateaki Sasaki",
title = "Computing determinants of rational functions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "40",
number = "1",
pages = "2--8",
month = mar,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1151446.1151448",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:42:15 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Computation of determinants of rational functions
seems to be out of thought in computer algebra so far.
We first show that representing the rational function
by the sum of partial fractions is absolutely necessary
in the computation. We then propose a very simple
technique for efficient computation: replace every
distinct denominator of the rational functions in the
input matrix by the inverse of an independent variable,
and recover the denominators after computing the
determinant as a polynomial. Some experiments show that
the technique speeds up the computation by 3 to 6 times
for the samples tested.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "155",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wan:2006:IPAa,
author = "Zhendong Wan",
title = "{ISSAC} 2005 poster abstracts",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "40",
number = "1",
pages = "9--14",
month = mar,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1151446.1151450",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:42:15 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "155",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Szanto:2006:SNC,
author = "Agnes Szanto and Jan Verschelde and Zhonggang Zeng",
title = "Symbolic-numeric computation and applications: list of
abstracts",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "40",
number = "1",
pages = "15--17",
month = mar,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1151446.1151451",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:42:15 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "155",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bauschke:2006:SCF,
author = "Heinz H. Bauschke and Martin v. Mohrenschildt",
title = "Symbolic computation of {Fenchel} conjugates",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "40",
number = "1",
pages = "18--28",
month = mar,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1151446.1151453",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:42:15 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Convex optimization deals with certain classes of
mathematical optimization problems including
least-squares and linear programming problems. This
area has recently been the focus of considerable study
and interest due to the facts that convex optimization
problems can be solved efficiently by interior-point
methods and that convex optimization problems are
actually much more prevalent in practice that
previously thought.Key notions in convex optimization
are the Fenchel conjugate and the subdifferential of a
convex function. In this paper, we build a new bridge
between convex optimization and symbolic mathematics by
describing the Maple package fenchel, which allows for
the symbolic computation of these objects for numerous
convex functions defined on the real line. We are able
to symbolically reproduce computations for finding
Fenchel conjugates and subdifferentials for numerous
nontrivial examples found in the literature.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "155",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Shemyakova:2006:AFL,
author = "Ekaterina Shemyakova and Franz Winkler",
title = "Approximate factorization of linear partial
differential operators: full system of invariants for
order three",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "40",
number = "2",
pages = "34--35",
month = jun,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1182553.1182555",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:42:45 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We investigate the problem of the approximate
factorization of a linear partial differential operator
of arbitrary order and in arbitrarily many variables.
For such an operator, we define common obstacles and
the associated ring of obstacles to factorizations of
the operator, which extends some specified
factorization of its symbol. We derive some facts about
obstacles (for instance, they are stable, they cannot
be of certain order) and give an exhaustive enumeration
of obstacles for bivariate operators of order two and
three (also a short form was found for these huge
formulas).We notice that for a second-order strictly
hyperbolic operator, obstacles are exactly the
well-known invariants of Laplace. For operators of
order three a generalization (not straightforward) is
possible. It allows us to find a full system of
invariants (with respect to operation conjugation) for
operators of order three.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Berkovich:2006:FSC,
author = "L. M. Berkovich",
title = "Factorization of self-conjugated and reducible linear
differential operators",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "40",
number = "2",
pages = "35--37",
month = jun,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1182553.1182556",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:42:45 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Well-known methods of factorization of differential
operators are based on separating the first-order
operator from the differential operator of the $n$-th
order by left or by right. If the right-side
differential operator of the first order is separated,
we have generalized Riccati's equation of the $ (n -
1)$ th order (see [1]) for the 'root' of factorization.
If the left-side differential operator of the first
order is separated, it is necessary to consider
conjugate operator, for which generalized second kind
Riccati's equation of the $ (n - 1)$ th order.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Golubitsky:2006:CRP,
author = "Oleg Golubitsky",
title = "Construction of rankings on partial derivatives",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "40",
number = "2",
pages = "38--42",
month = jun,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1182553.1182557",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:42:45 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In differential algebra [1], rankings on partial
derivatives play the same role as admissible term
orders in the theory of Gr{\"o}bner bases. In fact, an
admissible term order is a particular case of a ranking
on partial derivatives of a single differential
indeterminate. The introduction of a ranking allows to
select leading derivatives in differential polynomials,
define a pseudo-reduction relation, and consider
autoreduced sets; the latter are the a tool for
representing differential ideals.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bostan:2006:SSL,
author = "Alin Bostan and Claude-Pierre Jeannerod and {\'E}ric
Schost",
title = "Solving structured linear systems of large
displacement rank",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "40",
number = "2",
pages = "42--44",
month = jun,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1182553.1182558",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:42:45 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Structured linear algebra techniques are a versatile
set of tools; they enable one to deal at once with
various types of matrices, with features such as
Toeplitz-, Hankel-, Vandermonde- or Cauchy-likeness.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Inaba:2006:VEH,
author = "Daiju Inaba and Takeshi Osoekawa and Tateaki Sasaki",
title = "Visualization of extended {Hensel} factors",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "40",
number = "2",
pages = "44--45",
month = jun,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1182553.1182559",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:42:45 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ullrich:2006:CFF,
author = "Peter Ullrich",
title = "Closed-form formulas for projecting constructible sets
in the theory of algebraically closed fields",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "40",
number = "2",
pages = "45--48",
month = jun,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1182553.1182560",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:42:45 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Osoekawa:2006:HF,
author = "Takeshi Osoekawa and Tateaki Sasaki",
title = "{Hensel} fan",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "40",
number = "2",
pages = "48--49",
month = jun,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1182553.1182561",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:42:45 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Krandick:2006:TCA,
author = "Werner Krandick and Shawn S. Pierce and Zhendong Wan",
title = "Towards collaboration across display diversity",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "40",
number = "2",
pages = "49--50",
month = jun,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1182553.1182562",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:42:45 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fassino:2006:RMQ,
author = "Claudia Fassino",
title = "A robust monomial quotient basis for approximate
points",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "40",
number = "2",
pages = "50--51",
month = jun,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1182553.1182563",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:42:45 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kotsireas:2006:WA,
author = "Ilias S. Kotsireas and Eugene A. Zima",
title = "{WWCA} 2006 abstracts",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "40",
number = "2",
pages = "52--59",
month = jun,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1182553.1182565",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:42:45 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The Waterloo Workshop on Computer Algebra (WWCA 2006)
\url{http://www.cargo.wlu.ca/wwca/} was held April
10--12, 2006 at Wilfrid Laurier University in Waterloo,
Canada. The workshop was intended to provide a forum
for researchers and practitioners in the area of
computer algebra. The workshop was devoted to the 60th
birthday of Sergei Abramov (Dorodnicyn Computing
Centre, Russian Academy of Sciences, Moscow, Russia)
whose influential contributions to symbolic methods are
highly acknowledged and adopted by many Computer
Algebra systems. The invited speakers
were\par
\begin{itemize} \item Moulay Barkatou, University of
Limoges, France \item Jacques Carette, McMaster
University, Canada \item J{\"u}rgen Gerhard, Maplesoft,
Canada \item Gaston Gonnet, ETH Zurich, Switzerland
\item Kevin Hare, University of Waterloo, Canada \item
Claude-Pierre Jeannerod, INRIA Rh{\^o}ne-Alpes, France
\item Askold Khovanskii, University of Toronto, Canada
\item George Labahn, University of Waterloo, Canada
\item Ziming Li, Academy of Mathematics and System
Sciences, China \item Luc Rebillard, France \item Bruno
Salvy, INRIA Rocquencourt, France \item Arne
Storjohann, University of Waterloo, Canada \item
Serguei Tsarev, Krasnoyarsk State Pedagogical
University, Russia \item Mark van Hoeij, Florida State
University, USA \item Stephen Watt, University of
Western Ontario, Canada \item Thomas Wolf, Brock
University, Canada \item Doron Zeilberger, Rutgers
University, USA \end{itemize}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gao:2006:WTW,
author = "Xiao-shan Gao",
title = "{Wen-Tsun Wu}'s academic career",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "40",
number = "2",
pages = "60--64",
month = jun,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1182553.1182567",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:42:45 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Just:2006:CGB,
author = "Winfried Just and Brandilyn Stigler",
title = "Computing {Gr{\"o}bner} bases of ideals of few points
in high dimensions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "40",
number = "3--4",
pages = "67--78",
month = sep # "--" # dec,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1279721.1279722",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:43:59 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "A contemporary and exciting application of Gr{\"o}bner
bases is their use in computational biology,
particularly in the reverse engineering of gene
regulatory networks from experimental data. In this
setting, the data are typically limited to tens of
points, while the number of genes or variables is
potentially in the thousands. As such data sets vastly
underdetermine the biological network, many models may
fit the same data and reverse engineering programs
often require the use of methods for choosing
parsimonious models. Gr{\"o}bner bases have recently
been employed as a selection tool for polynomial
dynamical systems that are characterized by maps in a
vector space over a finite field.\par
While there are numerous existing algorithms to compute
Gr{\"o}bner bases, to date none has been specifically
designed to cope with large numbers of variables and
few distinct data points. In this paper, we present an
algorithm for computing Gr{\"o}bner bases of
zero-dimensional ideals that is optimized for the case
when the number m of points is much smaller than the
number n of indeterminates. The algorithm identifies
those variables that are essential, that is, in the
support of the standard monomials associated to a
polynomial ideal, and computes the relations in the
Gr{\"o}bner basis in terms of these variables. When n
is much larger than m, the complexity is dominated by
nm$^3$. The algorithm has been implemented and tested
in the computer algebra system Macaulay 2. We provide a
comparison of its performance to the
Buchberger-M{\"o}ller algorithm, as built into the
system.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "bner bases; Buchberger-M{\"o} computational biology
applications; essential variables; Gr{\"o} ller
algorithm; run-time complexity",
}
@Article{Stetter:2006:ACA,
author = "Hans J. Stetter",
title = "{``Approximate Commutative Algebra''}: an ill-chosen
name for an important discipline",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "40",
number = "3--4",
pages = "79--81",
month = sep # "--" # dec,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1279721.1279723",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:43:59 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Classical algebra has always considered itself as a
discipline in Discrete Mathematics, even when it dealt
with objects over the real or complex numbers (R or C
), where the inherent topology of the number fields
would have invited the use of analytic tools. A first
change occurred only when the models of applied
mathematics required the treatment of larger and larger
systems of linear equations and the emerging electronic
computers permitted the implementation of algorithms
with huge data sets. In the rapidly growing 'Numerical
Linear Algebra', norms and distances, contractive
iterations etc. were used as standard tools: Classical
linear algebra over R and C became embedded into
Analysis. (As a consequence, in the 2000 Mathematics
Subject Classification of the AMS, 'Numerical Linear
Algebra' is not listed as a subdiscipline of Algebra
but of Numerical Analysis.)",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wan:2006:IPAb,
author = "Zhendong Wan",
title = "{ISSAC} 2006 poster abstracts",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "40",
number = "3--4",
pages = "86--87",
month = sep # "--" # dec,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1279721.1279724",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:43:59 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sit:2006:ASS,
author = "William Sit",
title = "Abstracts of special session on differential algebra:
{American Mathematical Society}, {Eastern Section
Spring Meeting}: {Stevens Institute} of {Technology},
{April} 14-15, 2007",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "40",
number = "3--4",
pages = "88--107",
month = sep # "--" # dec,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1279721.1279725",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:43:59 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The Special Session on Differential Algebra of the
American Mathematical Society (AMS) Eastern Section
Spring Meeting, will be held on April 14-15, 2007 at
Stevens Institute of Technology, New Jersey, USA. The
following abstracts of invited speakers at this Special
Session have been edited for reproduction by kind
permission of AMS. With some exceptions, they are
listed in alphabetical order by presenters. For all
abstracts, only the email contact information of the
presenter is given. The Special Session is jointly
organized by the Kolchin Seminar in Differential
Algebra of the City University of New York and the
Department of Mathematics and Computer Science at
Newark Campus of Rutgers, the State University of New
Jersey. For further information, please visit site
below.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Joyner:2006:OM,
author = "David Joyner",
title = "{OSCAS}: {\tt maxima}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "40",
number = "3--4",
pages = "108--111",
month = sep # "--" # dec,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1279721.1279726",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:43:59 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "At the kind invitation of ACM SIGSAM Chair Emil
Volcheck, this will start a series of regular columns
on open source computer algebra systems. I will
consider this series a success if it encourages one of
you to contribute in even a small way (submit a bug
report or just an encouraging email to the developers!)
to one of the systems listed below.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Li:2007:TLD,
author = "Ziming Li and Min Wu and Dabin Zheng",
title = "Testing linear dependence of hyperexponential
elements",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "41",
number = "1--2",
pages = "3--11",
month = mar # "--" # jun,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1296772.1296773",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:39:16 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "A Wronskian (resp. Casoratian) criterion is useful to
test linear dependence of elements in a differential
(resp. difference) field over constants. We generalize
this criterion for invertible hyperexponential elements
in a differential-difference ring extension over a
field $F$. The generalization also enables us to
connect similarity and $F$-linear dependence of
invertible hyperexponential elements.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hitz:2007:EPA,
author = "Markus A. Hitz",
title = "{ECCAD} 2007 poster abstracts",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "41",
number = "1--2",
pages = "12--24",
month = mar # "--" # jun,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1296772.1296774",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:39:16 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Giesbrecht:2007:IPA,
author = "Mark W. Giesbrecht and Ilias Kotsireas and Austin
Lobo",
title = "{ISSAC} 2007 poster abstracts",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "41",
number = "1--2",
pages = "38--72",
month = mar # "--" # jun,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1296772.1296775",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:39:16 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Stoutemyer:2007:UCN,
author = "David R. Stoutemyer",
title = "Useful Computations Need Useful Numbers",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "41",
number = "3",
pages = "75--99",
month = sep,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1358190.1358192",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:23:01 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Most of us have taken the exact rational and
approximate numbers in our computer algebra systems for
granted for a long time, not thinking to ask if they
could be significantly better. With exact rational
arithmetic and adjustable-precision floating-point
arithmetic to precision limited only by the total
computer memory or our patience, what more could we
want for such numbers? It turns out that there is much
more that can be done that permits us to obtain exact
results more often, more intelligible results,
approximate results guaranteed to have requested error
bounds, and recovery of exact results from approximate
ones.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "161",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "interval arithmetic",
}
@Article{Shemyakova:2007:SAM,
author = "Ekaterina Shemyakova",
title = "Symbolic-algebraic methods for linear partial
differential operators",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "41",
number = "3",
pages = "100--100",
month = sep,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1358190.1358194",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:23:01 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This thesis is devoted to the study of
symbolic-algebraic factorization, classification, and
integration methods for Linear Partial Differential
Operators (LPDOs).",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "161",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Xie:2007:FAM,
author = "Yuzhen Xie",
title = "Fast algorithms, modular methods, parallel approaches
and software engineering for solving polynomial systems
symbolically",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "41",
number = "3",
pages = "101--101",
month = sep,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1358190.1358195",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:23:01 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Symbolic methods are powerful tools in scientific
computing. The implementation of symbolic solvers is,
however, a highly difficult task due to the extremely
high time and space complexity of the problem. In this
thesis, we study and apply fast algorithms, modular
methods, parallel approaches and software engineering
techniques to improve the efficiency of symbolic
solvers for computing triangular decomposition, one of
the most promising methods for solving non-linear
systems of equations symbolically.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "161",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Xia:2007:DTS,
author = "Bican Xia",
title = "{DISCOVERER}: a tool for solving semi-algebraic
systems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "41",
number = "3",
pages = "102--103",
month = sep,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1358190.1358197",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:23:01 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "161",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Nabeshima:2007:PPC,
author = "Katsusuke Nabeshima",
title = "{PGB}: a package for computing parametric
{Gr{\"o}bner} and related objects",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "41",
number = "3",
pages = "104--105",
month = sep,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1358190.1358198",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:23:01 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We present a new software package in the computer
algebra system Risa/Asir [NT92], named PGB, for
computing parametric Gr{\"o}bner bases in various
domains and related objects. A parametric Gr{\"o}bner
basis is a Gr{\"o}bner basis for a polynomial ideal
with parametric coefficients. One can download the
package PGB from the following website.
http://www.risc.uni-linz.ac.at/research/compalg/software/",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "161",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Nagasaka:2007:SPM,
author = "Kosaku Nagasaka",
title = "{SNAP} package for {Mathematica}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "41",
number = "3",
pages = "105--106",
month = sep,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1358190.1358199",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:23:01 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "SNAP (Symbolic Numeric Algebra for Polynomials)
package for Mathematica provides various functions to
compute approximate algebraic properties including
approximate GCD and factorization of polynomials for
example. For practical situations, the package does not
have enough functionalities yet. However, the aim of
this package is showing how an unified tolerance
mechanism that we introduced for the package works.
With that, we can continue approximate calculations
under certified tolerances without special skills in
symbolic-numeric algebra.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "161",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Suzuki:2007:ICC,
author = "Akira Suzuki and Yosuke Sato",
title = "Implementation of {CGS} and {CGB} on {Risa\slash Asir}
and other computer algebra systems using {Suzuki--Sato}
algorithm",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "41",
number = "3",
pages = "107--108",
month = sep,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1358190.1358200",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:23:01 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In [5], we showed simple algorithms to compute
comprehensive Gr{\"o}bner systems (CGS) and
comprehensive Gr{\"o}bner bases (CGB). We call them
Suzuki--Sato algorithms in this paper. Other known
existing software packages to compute CGS or CGB are
CGB of Redlog (Weispfenning) [1], DISPGB, and MCCGS
(Montes) [2, 3].",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "161",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Linton:2007:GGA,
author = "Steve Linton",
title = "{GAP}: groups, algorithms, programming",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "41",
number = "3",
pages = "108--109",
month = sep,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1358190.1358201",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:23:01 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "GAP is a system for computational discrete algebra,
with particular emphasis on Computational Group Theory.
GAP provides a programming language, a library of
thousands of functions implementing algebraic
algorithms written in the GAP language, large data
libraries of algebraic objects and a growing collection
of user-contributed extension packages. GAP is widely
used in research and teaching for studying groups and
their representations, rings, vector spaces, algebras,
combinatorial structures, codes, Lie algebras and more.
It has been cited in over 800 published papers. The
system, including source, is distributed freely. You
can study and easily modify or extend it for your
special use.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "161",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Schwarz:2007:AW,
author = "Fritz Schwarz",
title = "{ALLTYPES} in the web",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "41",
number = "3",
pages = "109--110",
month = sep,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1358190.1358202",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:23:01 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "ALLTYPES which abbreviates ALgebraic Language and TYPe
System provides an interactive environment in the
internet that is particularly well suited for
performing symbolic computations in differential
algebra. Its novel design has been guided by the
following principles.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "161",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Pearce:2007:MLH,
author = "Roman Pearce and Michael Monagan",
title = "A {Maple} library for high performance sparse
polynomial arithmetic",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "41",
number = "3",
pages = "110--111",
month = sep,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1358190.1358203",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:23:01 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We have developed a library for sparse polynomial
arithmetic to supplement Maple's internal routines.
Along the way we identified three common sources of
inefficiency in existing implementations.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "161",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Abbott:2007:CCC,
author = "John Abbott and Anna Bigatti and Massimo Caboara and
Lorenzo Robbiano",
title = "{CoCoA}: computations in commutative algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "41",
number = "3",
pages = "111--112",
month = sep,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1358190.1358204",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:23:01 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "CoCoA is a special-purpose system for doing
Computations in Commutative Algebra. It runs on all
common platforms.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "161",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Yanami:2007:SMT,
author = "Hitoshi Yanami and Hirokazu Anai",
title = "{SyNRAC}: a {Maple} toolbox for solving real algebraic
constraints",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "41",
number = "3",
pages = "112--113",
month = sep,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1358190.1358205",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:23:01 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We introduce various aspects of design and
implementation of a symbolic computation toolbox,
called SyNRAC, handling first-order formulas on top of
Maple. SyNRAC provides us with a new set of tools for
solving real algebraic constraints derived from a broad
range of applications in science and engineering.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "161",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Page:2007:AOS,
author = "William S. Page",
title = "{Axiom}: open source computer algebra system",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "41",
number = "3",
pages = "114--114",
month = sep,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1358190.1358206",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jun 18 09:23:01 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Axiom has been in development since 1971. Originally
called Scratchpad II, it was developed by IBM under the
direction of Richard Jenks[1]. The project evolved over
a period of 20 years as a research platform for
developing new ideas in computational mathematics.
ScratchPad also attracted the interest and
contributions of a large number of mathematicians and
computer scientists outside of IBM. In the 1990s, the
Scratchpad project was renamed to Axiom, and sold to
the Numerical Algorithms Group (NAG) in England who
marketed it as a commercial system. NAG withdrew Axiom
from the market in October 2001 and agreed to release
Axiom as free software, under an open source
license.\par
Tim Daly (a former ScratchPad developer at IBM) setup a
pubic open source Axiom project[2] in October 2002 with
a primary goal to improve the documentation of Axiom
through the extensive use of literate programming[3].
The first free open source version of Axiom was
released in 2003. Since that time the project has
attracted a small but very active group of developers
and a growing number of users.\par
This exhibit includes a laptop computer running a
recent version of Axiom, Internet access (if available)
to the Axiom Wiki website[4], and CDs containing Axiom
software for free distribution[5].",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "161",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Borwein:2007:IPB,
author = "Peter Borwein and Erich Kaltofen and Michael J.
Mossinghoff",
title = "Irreducible polynomials and {Barker} sequences",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "41",
number = "4",
pages = "118--121",
month = dec,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1358183.1358185",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jun 17 19:16:18 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "A Barker sequence is a finite sequence $ a_o $,
\ldots{}, $ a_{n - 1} $, each term $ \pm 1 $, for which
every sum $ \Sigma_i a_i a_i + k $ with $ 0 (k n) $ is
either 0, 1, or -1. It is widely conjectured that no
Barker sequences of length $ n > 13 $ exist, and this
conjecture has been verified for the case when $n$ is
odd. We show that in this case the problem can in fact
be reduced to a question of irreducibility for a
certain family of univariate polynomials: No Barker
sequence of length $ 2 m + 1$ exists if a particular
integer polynomial of degree $ 4 m$ is irreducible over
$Q$. A proof of irreducibility for this family would
thus provide a short, alternative proof that long
Barker sequences of odd length do not exist. However,
we also prove that the polynomials in question are
always reducible modulo $p$, for every prime $p$.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "162",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Dumitrescu:2007:QAD,
author = "Adrian Dumitrescu and Guangwu Xu",
title = "On a query algorithm for a divisibility problem",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "41",
number = "4",
pages = "122--124",
month = dec,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1358183.1358186",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jun 17 19:16:18 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "According to an old result of Tur{\'a}n, any $ (n +
1)$-subset of $ \{ 1, 2, \ldots, 2^n \} $ contains a
pair of divisible numbers. Ciurea et al. have recently
considered a natural algorithmic variant of this
classic mathematical result: if the subset is not
known, and it is only accessible via a membership
oracle, what is the minimum number of questions
necessary to identify one such divisible pair? They
showed a $ 4 / 3 n - O(1)$ lower bound and also
designed an algorithm which they conjectured asks no
more than $ 4 / 3 n + O(1)$ queries, and therefore
would be optimal. We reanalyze the proposed algorithm
and prove that it comes close to the conjectured value,
in asking no more than $ (4 / 3 + 5 / 108) n + O(1)$
queries; this corrects an error in the old analysis.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "162",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Zhou:2007:SCT,
author = "Wenqin Zhou",
title = "Symbolic computation techniques for solving large
expression problems from mathematics and engineering",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "41",
number = "4",
pages = "125--126",
month = dec,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1358183.1358188",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jun 17 19:16:18 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "162",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Barnett:2008:RSC,
author = "Michael P. Barnett",
title = "Reasoning in symbolic computation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "1--17",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394043",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "I discuss notations for some styles of mathematical
reasoning that include analogy. These notations extend
the conventions of the mathematical package mathscape
that I reported recently in the Journal of Symbolic
Computation. The paper introduces the reasoning objects
that I call 'precursors' and 'consequences lists'.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Andrews:2008:FDM,
author = "George E. Andrews and Peter Paule",
title = "Further developments in {MacMahon}'s partition
analysis (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "18--18",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394048",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "P. A. MacMahon developed a calculus for producing
generating functions of partitions constrained by
linear inequalities relating the various parts of the
partitions. Recently we have used MacMahon's method to
find new classes of partitions whose generating
functions are modular forms (Acta Arith., 126(2007),
281--294), and we have retrieved MacMahon's original
project which was to prove his generating function
formula for plane partitions. We shall report briefly
on these topics and indicate new areas for exploration.
In particular, we shall consider the modification of
MacMahon's methods in which the inequalities relating
the various parts of the partition take into account
congruence constraints on the parts.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Pudwell:2008:HCC,
author = "Lara K. Pudwell",
title = "How to cleverly count pattern-avoiding words (abstract
only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "18--18",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394049",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "A word w contains a permutation p as a pattern if w
has a subsequence that is order-isomorphic to p;
otherwise, w avoids p. The study of pattern avoidance
in permutations is well-studied and has been
accomplished by many beautiful techniques. In 1998,
Doron Zeilberger introduced the notion of prefix
schemes for counting pattern-avoiding permutations.
This is a divide and conquer technique driven by the
pattern formed by the first few letters of the
permutation. I will discuss one way of extending the
method of prefix schemes to enumerate pattern-avoiding
words and detail its success rate.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Petkovsek:2008:SML,
author = "Marko Petkovsek",
title = "Solving multivariate linear recurrences in wedges
(abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "18--19",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394050",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Many problems of combinatorial enumeration can be
reduced to solving multivariate linear recurrences with
constant coefficients in wedge-like domains. We survey
some results on existence and uniqueness of solutions
to such recurrences, on the algebraic nature of their
generating functions, and on the methods for solving
the corresponding functional equations, in particular
the so-called kernel method. We also present a
prototype Mathematica package for obtaining explicit
solutions when these generating functions are algebraic
of low degree.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Billey:2008:ACP,
author = "Sara C. Billey and Stephen A. Mitchell",
title = "Affine colored partitions (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "19--19",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394053",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We give a bijection between certain colored partitions
and the elements in the quotient of an affine Weyl
group modulo its Weyl group. By Bott's formula these
colored partitions give rise to some partition
identities. In certain types, these identities have
previously appeared in the work of
Bousquet--Melou--Eriksson, Eriksson--Eriksson and
Reiner. In other types the identities appear to be new.
Our main application is to determine the rationally
smooth Schubert varieties in the affine Grassmannians.
Several of the proofs are computer assisted. This is
joint work with Steve Mitchell.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Chen:2008:WMI,
author = "William Y. C. Chen and Ernest X. W. Xia",
title = "The $q$-{WZ} method for infinite sums (abstract
only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "19--19",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394052",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We develop a $q$-WZ method for justifying
nonterminating basic hypergeometric summation formulas
by computing the WZ-pairs as certificates which may
involve some infinite $q$-shifted factorials. Using
this approach, we can verify a wide variety of
classical summation formulas, with typical examples
including the $q$-binomial theorem, the $q$-Gauss sum,
the 6$ \psi $5 sum, the Ramanujan 1$ \psi $1 sum, and
Bailey's 6$ \psi $6 sum. In many cases we can discover
the companion identities. This work is inspired by the
study of two elegant identities involving partial theta
functions due to Andrews and Warnaar from the
telescoping viewpoint. The key point lies in the fact
that the $q$-Gosper algorithm is effective to deal with
$q$-hypergeometric terms multiplied by the infinite
$q$-shifted factorials.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Schneider:2008:MSD,
author = "Carsten Schneider",
title = "Multi-summation in difference fields (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "19--19",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394051",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In this talk we present recent symbolic summation
tools based on difference field theory. The algorithmic
ideas are illustrated by concrete examples that arise
in the evaluation of Feynman integrals in perturbative
quantum field theory.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Zeilberger:2008:CGC,
author = "Doron Zeilberger and Thotsaporn Aek Thanatipanonda",
title = "Computer-generated conjectures(!) and proofs(!!) in
combinatorial game theory (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "19--20",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394054",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The rapidly growing activity of experimental
mathematics is still, to a large extent, a
straightforward (albeit far-reaching) extension of the
usual mode of paper-and-pencil research, where the
pencil just got so much quicker and sharper and the
paper so much larger. In order to take full advantage
of the great potential of computers, we should learn to
kick some old habits, like trying to 'understand' what
is going on. If we humans can 'understand' something,
then it can't be very deep. Rather than try to
understand mathematics, we should do our best to
meta-understand it, by designing algorithms (and
meta-algorithms!) for computers to do everything by
themselves: generating data, of course, but then going
on to formulate conjectures, followed by (fully
automated!) proofs. We admit that our computers can't
prove the Riemann Hypothesis yet, but they sure can
prove some intriguing conjectures of Jeff Erickson
about the game 'Toads and Frogs'. The only way our
computers can prove these simply stated (i.e.
'beautiful' to human eyes) conjectures, is by making
many other 'ugly' (to humans) conjectures, and then
proving them simultaneously. The full details are
available from
\url{http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/tf1.html}.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Thanatipanonda:2008:CGC,
author = "Thotsaporn Aek Thanatipanonda",
title = "Computer-generated conjectures(!) and proofs(!!) in
combinatorial game theory {(II)} (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "20--20",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394055",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This will be a follow up talk to my wonderful advisor
Doron Zeilberger. People like to make fun of me for
playing games. But playing games is fun and helps me do
math better. I will give more examples of games and
show how computers can make conjectures and prove
theorems about them. (Received September 19, 2007).",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Thiery:2008:IAC,
author = "Nicolas M. Thiery",
title = "Implementing Algebraic Combinatorics: Some feedback
from the development of {MuPAD--Combinat} (abstract
only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "20--20",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394057",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "MuPAD-Combinat is an open-source algebraic
combinatorics package for the computer algebra system
MuPAD. Its main purpose is to provide an extensible
toolbox for computer exploration, and to foster code
sharing between researchers in this area. The
development started in 2001, and it now contains
functions to deal with most usual combinatorial classes
(partitions, tableaux, decomposable classes, \ldots{}).
It also supplies the user with tools for constructing
new combinatorial classes and combinatorial (Hopf)
algebras. As an application, it provides well-known
combinatorial Hopf algebras like the algebra of
symmetric functions and many generalizations. There is
also experimental support for combinatorial Lie
algebras, operads, (affine) Weyl groups, crystals,
Schubert polynomials, invariant rings, \ldots{}
Altogether, MuPAD-Combinat played a central role in 25+
publications with more than a dozen contributors. In
this talk, we first demonstrate the main
functionalities of the package and present some typical
applications. Based on that, we discuss its design,
successes and flaws, and its future. Feel free to
contact the speaker if you would like to get some first
hand experience through an informal tutorial, and bring
your laptop if you have one.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Vejdemo-Johansson:2008:ESU,
author = "Mikael Vejdemo-Johansson",
title = "Enumerating the {Saneblidze--Umble} diagonal in
{Haskell} (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "20--20",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394056",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In 2004, Saneblidze and Umble gave a construction of a
diagonal on the permutahedron, thus providing important
tools to several disciplines using the permutahedra and
associated combinatorial polyhedra. There has since
been a few, mostly unpublished, attempts at writing
computer programs to perform the highly combinatorial
construction. The author presents an implementation of
the construction in the programming language Haskell: a
language which allows one to write computer code that
stays very close to the mathematical expression of the
construction itself. The author wishes to emphasize the
perceived naturality of translating mathematics into
Haskell code by giving examples from this program.
(Received July 25, 2007).",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ibanez:2008:HES,
author = "Ana Romero Ib{\'a}{\~n}ez Ib{\'a}{\~n}ez",
title = "Homologa efectiva y sucesiones espectrales (abstract
only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "21--21",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394059",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Effective homology and spectral sequences are two
different techniques of Algebraic Topology which can be
used for the computation of homology and homotopy
groups. In this work we try to relate both methods,
showing that the effective homology method can also be
used to produce algorithms computing some spectral
sequences. In the thesis we focus our attention on two
particular situations: spectral sequences associated
with filtered complexes and the Bousfield--Kan spectral
sequence.\par
The first part of the memoir is devoted to spectral
sequences of filtered complexes, which under some good
conditions converge to the homology groups of the
initial complex. Making use of the effective homology
method, we have developed several algorithms computing
the different components of these spectral sequences:
groups and differential maps in every stage,
convergence level and filtration of the homology groups
induced by the initial filtration. These algorithms
have been implemented as a new module for the Kenzo
system, a program of Symbolic Computation in Algebraic
Topology, and can be used to determine two classical
examples of spectral sequences, those of Serre and
Eilenberg--Moore.\par
Other spectral sequences are not defined by means of
filtered complexes. This is the case of the
Bousfield--Kan spectral sequence, related with the
computation of homotopy groups, which is studied in the
second part of the thesis. Our algorithms for the
computation of spectral sequences of filtered complexes
cannot be applied, but the effective homology method
can be useful again to develop a constructive version
of the Bousfield--Kan spectral sequence. As a first
necessary step, our main result is an algorithm
computing the effective homology of the free simplicial
Abelian group RX generated by a 1-reduced simplicial
set X. This algorithm allows the construction of the
levels 1 and 2 of the spectral sequence; for the
computation of the higher 'pages', we present a sketch
of a new algorithm which is not finished yet.
Furthermore, we include a proof of the convergence of
the spectral sequence.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ilie:2008:CCN,
author = "Silvana Ilie",
title = "Computational complexity of numerical solutions of
initial value problems for differential algebraic
equations (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "21--22",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394060",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We investigate the cost of solving initial value
problems for differential algebraic equations depending
on the number of digits of accuracy requested. A recent
result showed that the cost of solving initial value
problems (IVP) for ordinary differential equations
(ODE) is polynomial in the number of digits of
accuracy. This improves on the classical result of
information-based complexity, which predicts
exponential cost. The new theory is based on more
realistic assumptions.\par
The algorithm analyzed in this thesis is based on a
previously published Taylor series method for solving a
general class of differential algebraic equations. We
consider DAE of constant index to which the method
applies. The DAE is allowed to be of arbitrary index,
fully implicit and have derivatives of order higher
than one.\par
Similarly, by considering a realistic model, we show
that the cost of computing the solution of IVP for DAE
with the algorithm adopted and by using automatic
differentiation is polynomial in the number of digits
of accuracy. We also show that non-adaptation is more
expensive than adaptation, giving thus a theoretical
justification of the success of adaptivity in
practice.\par
A particular case frequently arising in practical
applications, the index-1 DAE, is treated separately,
in more depth. On the other hand, an analysis of the
higher-index DAE is significantly more complicated and
applies to a wider class of problems. In both cases,
continuous output is also given.\par
These results apply to many important problems arising
in practice. We present an interesting theoretical
application to polynomial system solving.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Tsigaridas:2008:ACA,
author = "Elias P. Tsigaridas",
title = "Algebraic computations and applications to geometry
(abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "22--22",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394061",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Real algebraic numbers are the real numbers that are
real roots of univariate polynomials with integer
coefficients. We study exact algorithms, from a
theoretical and an implementation point of view, based
on integer arithmetic of arbitrary precision, for
computations with real algebraic numbers and
applications of these algorithms on problems and
algorithms in non linear computational geometry.\par
In order to construct a real algebraic number we must
compute the real roots of a univariate polynomial with
integer cofficients. We unify and simplify the theory
behind the subdivision based algorithms for real root
isolation and we improve the complexity of the
algorithm that is based on the continued fraction
expansion of the real numbers. The best known
complexity bound up today is achieved using new
techniques. Moreover, we prove that the bound holds for
non square-free polynomials and that in the same
complexity bound we can compute the multiplicities of
the real roots. We prove a new bound for the expected
complexity of the algorithm based on continued
fractions. We generalize the real root isolation
algorithms to bivariate polynomial systems. Our
experimental analysis proves the effectiveness of our
methods.\par
The algorithms that we consider for computations with
real algebraic numbers are construction, comparison,
sign evaluation and quantifier elimination. If the
degree of the polynomial is small, i.e. $ \leq $ 4 in
the univariate case and $ \leq $ 2 in the bivariate
case, we propose special purpose algorithms that have
constant arithmetic complexity. For all the algorithms
we present a C++ implementation and an experimental
analysis.\par
In computational geometry we study the predicates
needed by the algorithms for the arrangement of
elliptic arcs in the plane and the computation of the
Voronoi diagram of ellipses, also in the plane.
Finally, given a convex lattice polygon we study
algorithms for decomposing it to two other convex
lattice polygons, such that their Minkowski sum is the
original polygon.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2008:MEP,
author = "Anonymous",
title = "In Memoriam {Eugeny Pankratiev}: {Faculty of Mechanics
and Mathematics, Moscow State University, Moscow,
Russia}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "23--26",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394044",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Giesbrecht:2008:AKA,
author = "Mark Giesbrecht",
title = "{ACM 2007 Kanellakis Award} Honours {Bruno
Buchberger}, Innovator of Automated Tools for
Mathematics",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "37--38",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394045",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "SIGSAM is pleased to announce that Bruno Buchberger of
the Research Institute for Symbolic Computation (RISC)
at Johannes Kepler University in Linz, Austria, has
been awarded the 2007 ACM Paris Kanellakis Theory and
Practice Award. This is one of the ACM's top prizes and
recognizes his role in developing Gr{\"o}bner bases. We
congratulate Bruno for this outstanding achievement and
honour!",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Joyner:2008:OSC,
author = "David Joyner",
title = "Open source computer algebra systems: {Axiom}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "39--47",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394046",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This survey will look at Axiom, a free and very
powerful computer algebra system available. It is a
general purpose CAS useful for symbolic computation,
research, and the development of new mathematical
algorithms. Axiom is similar in some ways to Maxima,
covered in the survey [J1], but different in many ways
as well. Axiom, Maxima, and SAGE [S], are the largest
of the general-purpose open-source CAS's. If you want
to 'take a test drive,' Axiom can be tested without
installation via the web interface [AS] or the SAGE
online interface [S].",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Arnold:2008:CRB,
author = "Andrew Arnold and Michael Monagan",
title = "Calculating really big cyclotomic polynomials
(abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "48--49",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394063",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Doerksen:2008:GCS,
author = "Kevin Doerksen",
title = "Genus 2 curves with split {Jacobians} (abstract
only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "49--50",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394064",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Dujella:2008:VWA,
author = "Andrej Dujella",
title = "A variant of {Wiener}'s attack on {RSA} with small
secret exponent",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "50--51",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394065",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "cryptography",
}
@Article{Edoukou:2008:CDP,
author = "Fr{\'e}d{\'e}ric A. B. Edoukou",
title = "Computing the 2-distribution of points on {Hermitian}
surfaces (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "52--53",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394066",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Elkies:2008:CGM,
author = "Noam D. Elkies",
title = "Curves of genus 2 with many rational points via {K3}
surfaces (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "53--55",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394067",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fontein:2008:AIU,
author = "Felix Fontein",
title = "Abstract Infrastructures of Unit Rank Two (abstract
only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "55--56",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394068",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Galbraith:2008:CPN,
author = "Steven Galbraith and Raminder S. Ruprai",
title = "Computing {$L$}-polynomials of non-hyperelliptic genus
4 and 5 curves (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "56--57",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394069",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Holden:2008:SLM,
author = "Joshua Holden and Nathan Lindle",
title = "A statistical look at maps of the discrete logarithm
(abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "57--59",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394070",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jain:2008:MHR,
author = "Sonal Jain",
title = "Minimal heights and regulators for elliptic surfaces
(abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "59--61",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394071",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lavasani:2008:IFA,
author = "Ahmad Lavasani and Reza Mohammadi",
title = "Implementing a feasible attack against {ECC2K-130}
{Certicom Challenge} (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "61--62",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394072",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "cryptography",
}
@Article{Sedjelmaci:2008:SLP,
author = "Sidi Mohamed Sedjelmaci",
title = "A straight line program computing the integer greatest
common divisor (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "62--64",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394073",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Yasuda:2008:DLP,
author = "Masaya Yasuda",
title = "The discrete logarithm problem on elliptic curves
defined over {$Q$} (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "64--66",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394074",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "cryptography",
}
@Article{Al-shomrani:2008:DWB,
author = "Saleh Al-shomrani and Paul Wang",
title = "{DMAS}: a {Web}-based distributed mathematics
assessment system (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "67--68",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394076",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Assessing student performance and understanding is
very important in education generally and in
Mathematics education in particular. DMAS is a
Web-based Distributed Mathematics Assessment system
that can be of great value to teachers and students of
Mathematics. Features of DMAS include: DMAD (the core
Distributed Mathematics Assessment database), test
authoring tool for teachers, online taking of tests,
grading and results administration, comprehension
diagnoses and linking to remedial materials. DMAS
supports many problem types and allows mathematical
formulas/expressions as well as geometry
drawings/graphs to be part of questions and answers.
Furthermore, DMAS supports the use of test taking as a
teaching method. A teacher can monitor all students
from the teacher terminal in real-time and either
verbally guide the whole class on certain points or
interact privately with one or more students via the
Teacher--Student Interaction Mechanism (TSIM), an
instant text-messaging provided by DMAS. A new
Assessment Markup Language, MAML, is designed to make
tests and test questions easy to share widely on the
Web. Although developed as a sub-system of WME
(Web-based Mathematics Education), DMAS is an
independent Web system easily interfaced to any Web
page through a well-defined API. The DMAS system
consists of local databases at individual school
websites. Teachers may publish new or improved
questions to their local DMAS database to be shared
with other teachers in the same school and in different
schools. Teachers can use the powerful search engine
(DMASEngine) to search for assessment questions. Search
can be narrowed by subject, topic, grade-level,
question type, keyword, and author. DMAD is designed to
work as one distributed database while providing power,
unity, and convenience at each participating school.
The system helps create, revise, administer, and grade
exams that can contain various types of questions:
multiple choices, true-or-false, extended (essay)
questions, short answers, two-columns matching, and
fill-the-blank. Questions use a well-designed
representation (encoding) allowing correct answers,
rubrics, formulas, images, geometrical objects (SVG),
and multimedia as well as interactive contents. DMAS
system provides different views (modes): teacher and
student modes. It also supports two types of testing:
online and paper testing. The teacher can set
Assessment test display options: display questions by a
given order, by random questions none-random options,
or by all questions/options are in random order. Tests
taken online can be graded automatically and stored for
teacher review, analysis, and printing. DMAS Assessment
system has been piloted into seventh grade students at
Kimpton Middle School, Stow, Ohio on 10/05/2007 for
real-life testing and apparently teacher and student's
feedback gave good impression and encouraging feedback
about the DMAS system. However, our goal is to put DMAS
system under extensive trial in schools and collecting
feedback and suggestions from teachers, students,
school administrators and education experts to help
evolve DMAS. As more schools adopt DMAS, the
distributed nature of DMAS will be demonstrated in
realistic situations. Because DMAS has been designed in
consultation with middle school teachers and education
experts, the underline DMAS system design and framework
is easy and flexible for future changes, requirements,
expansions, and customizations. DMAS provides features
to support real-life test giving such as loss of power
to a laptop and retaking of tests.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Benkiran:2008:BFP,
author = "Amine Benkiran",
title = "{Brouwer}'s fixed point theorem (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "68--69",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394077",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "`Brouwer's Fixed Point Theorem' was named after the
Dutch mathematician `L. E. J. Brouwer'. This theorem
states that for every continuous function $f$ mapped
onto itself at a given interval, has at least one fixed
point such that $ f(x_0) = x_0$. The proof of this
theorem uses what is called `Sperner's Lemma' (by
Emanuel Sperner), which would be the one focused on in
order to help understand `Brouwer's Fixed Point
Theorem'.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Burkhart:2008:MPD,
author = "Brandon Burkhart",
title = "Models of population dynamics (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "69--69",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394078",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This project explains the mathematical equations used
to approximate species populations. The equations used
are the exponential growth rate, logistic growth rate,
and the predator-prey systems. The purpose is to show
how the equations are taken from simple mathematical
principles and assumptions. Basic techniques in
Calculus and Linear Algebra are used to analyze the
quantitative properties of solutions to the
differential equation models.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Dimitrova:2008:AGF,
author = "Elena S. Dimitrova and Brandilyn Stigler and Abdul
Salam Jarrah and Reinhard Laubenbacher",
title = "Applications of the {Gr{\"o}bner} fan to gene network
reconstruction (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "69--69",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394079",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Gr{\"o}bner fans have gained popularity in
computational commutative algebra and algebraic
geometry with applications ranging from Gr{\"o}bner
basis conversion to the emerging field of tropical
mathematics. Recently Gr{\"o}bner fans have been
employed for the selection of minimal models that fit
measurement data from gene regulatory networks. The
model space is described as the sum of an interpolating
polynomial function f and the set of all polynomials
that vanish on the data, that is, the ideal of data
points. A minimal model can be chosen by computing the
reduction of f with respect to a fixed Gr{\"o}bner
basis, which is dependent on the choice of term order.
As Gr{\"o}bner fans partition the set of Gr{\"o}bner
bases into equivalence classes, they can be thought of
as parametrizations of the model space. This
characterization permits exploration of the model space
and discovery of 'most likely' models. In this poster
we show how Gr{\"o}bner fans are used to two
reconstruct gene regulatory networks: lactose
metabolism in the bacterium E. coli and tissue
development in the roundworm C. elegans.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ebersole:2008:PBI,
author = "Caroline Ebersole",
title = "The population biology of infectious diseases
(abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "70--70",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394080",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In this poster, we are looking at differential
equations that model a population with an infectious
disease. Three different types of models are shown. The
first model is the most primitive model, which does not
effectively show how the population is spread in the
population or does not take into account how difficult
it would be to measure a viral population. The SIR
model splits the population into three distinct
categories: susceptible, infected, and removed. The
SIRS model is similar except that individuals can
return to the susceptible population after recovering
from the virus. The SIRS model is further analyzed and
a graph of the equilibrium points and nullclines.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gao:2008:IAI,
author = "Shuhong Gao and Mingfu Zhu",
title = "An incremental algorithm for irreducible
decompositions of monomial ideals (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "70--70",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394081",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Irreducible decompositions of monomial ideals are of
interest in several areas. We present an incremental
algorithm, which computes decompositions of ideals by
adding one generator at a time. The new algorithm
improves the Alexander dual and Scarf complex methods.
A novel feature of the algorithm is that the
intermediate storage used never exceeds the output
size.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Guzide:2008:NAD,
author = "Osman Guzide and Kenneth May and James Getz and Adam
Edgeson",
title = "New algebraic design for better {P2P} features
(abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "70--71",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394082",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Lately P2P application routing got interest and
finding better routing and increasing performance and
security is real challenge these days. Mostly research
use overlay routing even using interconnection network
design dynamically. Goal is to route a message to a
destination whose IP address is not known which
eliminates the need for large routing tables.
Nevertheless, the overlay network could become wasteful
because outgoing traffic may take a route longer than
necessary. In this abstract, we propose a new design
for P2P features. These new design is to combine
physical and logical networks to reduce traffic and
improving performance and security. This new design
provides node organization for faster searching. Work
used simulation program to show these new design better
performance than existing design. Algorithm of new
routing is defined mathematical algebraic model to show
every case. Our next step is to actually improving
localizing design with new overlay network design.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Iwami:2008:AIA,
author = "Maki Iwami",
title = "An attack on improved algebraic surface public-key
cryptosystem (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "71--74",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394083",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Public key cryptography is widely used because it
enables secure communication with a party accessing the
site for the first time. But it is widely known that
the quantum computers become available then the public
key cryptosystems based on the discrete logarithm
problem such as RSA cryptosystem and Elliptic Curve
cryptosystem will no longer be secure. To address these
issues, Akiyama--Goto algebraic Surface Public-key
Cryptosystem (ASC) was developed [1], and opened to
general public at website as a research news of Toshiba
corporation in 2005. Its security is based on a
decision randomizing polynomial problem which is
related to a problem of finding sections on fibered
algebraic surfaces. This problem can be reduced to
solving a multivariate equation system and it is known
to be NP-complete. In 2007, in the case that public-key
is in a certain form, Uchiyama and Tokunaga succeeded
in attacking in the sense of getting plain text from
cipher text using reductions efficiently without
solving section finding problem [2].And the abstract is
introduced in CRYPTREC report 2006 [3] in the Appendix
Chapter, which is known to be the important report
related to e-Government recommended ciphers in Japan.
Note that, at this point, the cryptosystem can be used
safely if only we avoid to adopt using public key with
vulnerability in the key generation step. However, the
author suggested two algorithms applicable to all cases
[5] i.e. the cryptosystem is completely broken. One is
the generalization of Uchiyama--Tokunagas attack from
polynomial ring over IFp to polynomial ring over
rational function field. And the other takes advantages
of Gr{\"o}bner base techniques so as to deal with in
the polynomial ring over IFp. And in [6], the author
also suggested methods for calculating zero point of
the algebraic surface and a new attack utilizing it,
and the approach resulted in the difficulty of making a
suggestion of the invulnerable algebraic surface
public-key cryptosystem without changing ideas
progressively. On the other hand, Inanov--Volochs
attack using trace map [9] was developed. In these
background, Akiyama--Goto developed improved version of
their Algebraic surface public-key cryptosystem
(improved ASC) [8] on January 2008 [8] which has
tolerance to Uchiyama--Gotos attack using reduction and
Volochs attack using the trace map. Ivanov and Voloch
suggested the substitution attack briefly on improved
ASC in section 3 in [9], but the details are
unspecified. In section 2, the improved ASC is
described, and then, in section 3, a new reduction
attack on the improved ASC is presented.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "cryptography",
}
@Article{Jones:2008:RAA,
author = "Josh Jones",
title = "The {RSA} algorithm (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "74--74",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394084",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "My project is a brief introduction for the RSA
Algorithm. This project will include a very brief
history of where RSA originated, as well as how the RSA
algorithm works. Following this, the mathematical proof
of RSA is presented along with the two necessary
theorems needed to prove RSA. The final portion of my
presentation includes some of the potential threats to
RSA and how to prevent these attacks, including a chart
of the strength of RSA based on time required to crack
RSA in MIPS-Years where the only factor is the size of
the key.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "cryptography",
}
@Article{Joyner:2008:SCT,
author = "David Joyner and Robert Miller",
title = "{SAGE} and coding theory (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "74--78",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394085",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/magma.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This is a very brief survey of recent work in SAGE on
implementing algorithms to compute with linear block
codes. \url{http://www.sagemath.org}.\par
SAGE is a mathematical software package similar to the
`big M's' (Maple, Mathematica, Magma, and Matlab) but
free and open source. Download information and manuals
are available at \url{http://www.sagemath.org/}.
Included in SAGE is the group theory package GAP and
GUAVA, GAP's coding theory package. All of GUAVA's
functions can be accessed within SAGE.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kelsey:2008:DFS,
author = "Michael A. Kelsey",
title = "Dethroning {Fibonacci} Sequence (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "78--78",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394086",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The purpose of this presentation is to demonstrate
some properties and applications of Fibonacci numbers.
We present Binet's Formula and its proof. By using
Binet's Formula, we show that the Fibonacci sequence is
not a special sequence. The Fibonacci sequence has a
closed form solution which can be expressed
analytically in terms of a bounded number of certain
'well-known' functions, which indicates that the
Fibonacci sequence is not unique.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lai:2008:GWB,
author = "Xun Lai and Paul S. Wang",
title = "{GeometryEditor}: a {Web}-based interactive geometry
manipulative authoring system (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "78--79",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394087",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "GeometryEditor (previous code name: GeoSVG) is a
Web-based environment for authoring interactive
geometry manipulatives. Users may create on-line
manipulatives to illustrate mathematical concepts for a
hands-on learning environment. GeometryEditor provides
standard authoring features, such as sketching,
measurements, calculation, macros, iteration, loci,
animation and coordinate systems. GeometryEditor also
offers several its own authoring features, such as
synchronized copy, parametric color and visibility, and
mouse click events.\par
The GeoSite provides the GeometryEditor authoring
environment and a corresponding page authoring
environment to assist in creating lessons around the
manipulatives. Other people via the Internet can
immediately view completed manipulatives and pages.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lewis:2008:CAT,
author = "Robert Lewis",
title = "Comparing acceleration techniques for the {Dixon} and
{Macaulay} resultants (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "79--81",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394088",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The Bezout--Dixon resultant method for solving systems
of polynomial equations lends itself to various
heuristic acceleration techniques, previously reported
by the present author [6], which can be extraordinarily
effective. In this paper we will discuss how well these
techniques apply to the Macaulay resultant. In brief,
we find that they do work there with some difficulties,
but the Dixon method is greatly superior. That they
work at all is surprising and begs theoretical
explanation.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Li:2008:GBM,
author = "Dongmei Li and Jinwang Liu and Shuhong Gao",
title = "The $w$-{Gr{\"o}bner} bases and monomial ideal under
polynomial composition (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "81--82",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394089",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{May:2008:AVO,
author = "John P. May and Mark Giesbrecht and Daniel Roche and
Marc Moreno Maza and Yuzhen Xie",
title = "Automatic variable order selection for polynomial
system solving (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "83--83",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394090",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The goal of a general purpose solver is to allow a
user to compute the solutions of a system of equations
with minimal interactions. Modern tools for polynomial
system solving, namely triangular decomposition and
Gr{\"o}bner basis computation, can be highly sensitive
to the ordering of the variables. Our goal is to
examine the structure of a given system and use it to
compute a variable ordering that will cause the solving
algorithm to complete quickly (or alternately, to give
compact output). We explore methods based on the
dependency graph of coincident variables and terms
between the equations. Desirable orderings are gleaned
from connected components and other topological
properties of these graphs, under different weighting
schemes. We present experimental results suggesting
that these methods work well in practice.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{McGrail:2008:TCM,
author = "Robert W. McGrail and Mary Sharac",
title = "Tricoloring as a corrective measure (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "83--85",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394091",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This work presents a two-stage logic program to find
tricolorings of a geometric braid [1]. This software is
applied to data from the KnotData digital library of
the Mathematica [5] symbolic computing system,
revealing errors in that collection. The two algorithms
presented below have been implemented in SWI-Prolog
[4]. The first produces a crossing relation from a
KnotData braid word and the second searches for
tricolorings given a crossing relation.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Novocin:2008:FUPa,
author = "Andrew Novocin",
title = "Factoring univariate polynomials over the rationals
(abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "85--85",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394092",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This poster presents an algorithm for factoring
polynomials over the rationals which follows the
approach of the van Hoeij algorithm. The key
theoretical novelty in our approach is that it is set
up in a way that will make it possible to prove a new
complexity result. Another difference of this algorithm
from prior algorithms is the practical improvement
which we call early termination. Our algorithm should
outperform prior algorithms in many common classes of
polynomials (including irreducibles).",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Prince:2008:CDU,
author = "Matthew Prince",
title = "The concept of derivatives using abstract algebra
(abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "85--86",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394093",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The purpose of this poster is to present the concept
and proof of several rules of derivative using
terminology and tools in abstract algebra. Four main
tasks are fulfilled: prove that the differential
operator D is a linear transformation, the product
rule, and the degree of the derivative is one less than
the degree of the original polynomial, and some
corollaries and propositions. Some of the problems can
be solved by using the limit definition introduced in
calculus courses. The motivation for proof is presented
in a format of showing the facts about polynomials and
their derivatives using nothing but algebraic concepts
and proof technique.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Quinn:2008:CSS,
author = "Robert Quinn and Hoon Hong",
title = "Connectivity in semialgebraic sets (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "86--86",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394094",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "A semialgebraic set is a subset of real space defined
by polynomial equations and inequalities. A
semialgebraic set is a union of finitely many maximally
connected components. In this talk, we consider the
problem of deciding whether two given points in a
semialgebraic set are connected, that is, whether the
two points lie in the same connected component. In
particular, we consider the semialgebraic set defined
by f not equal 0 where f is a given bivariate
polynomial. The motivation comes from the observation
that many important/non-trivial problems in science and
engineering can be often reduced to that of
connectivity. Due to its importance, there has been
intense research effort on the problem. We will
describe a method based on gradient fields and provide
a sketch of the proof of correctness based on the Morse
complex. The method seems to be more efficient than the
previous methods in practice.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Riley:2008:OMA,
author = "Sean Riley",
title = "Origami and mathematics (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "86--86",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394095",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Mathematics applied to the design of an origami model
can be used to develop the most efficient fold
patterns; more simply stated the largest finished model
compared to the unit dimensions of origami paper in
unfolded shape. Based on the final chapter of Origami
Design Secrets by R. J. Lang, a collaboration of
algorithms which mathematically models most all aspects
of what is happening to the piece of paper (set U)
during origami transformation is presented. In order to
understand what is meant by the symbolism of these
algorithms, knowledge of discrete math, linear algebra,
trigonometry, calculus, etc. College level mathematics
is a necessity.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Roche:2008:DPP,
author = "Daniel Roche and Mark Giesbrecht",
title = "Detecting polynomial perfect powers (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "87--87",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394096",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We consider the problem of determining whether a
polynomial $f$ is a perfect power of another polynomial
$h$, i.e. whether $ f = h^r$ for some integer $ r > 0$.
In particular, we seek algorithms which take advantage
of the sparsity in $f$, and so will be fast when the
input is lacunary, with only the nonzero terms
represented. We give such algorithms, for polynomials
with finite field or rational coefficients, after first
showing that in any non-trivial case the power $r$ must
be small. An implementation is given in the C++ library
NTL, and we compare our results to the fastest-known
dense algorithm.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Su:2008:SOE,
author = "Wei Su and Chuan Cai and Paul S. Wang and Lian Li",
title = "A solution for online entering and editing
mathematical formulas (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "87--88",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394097",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The ability for users online creating and editing
mathematical expressions is very important for Science
Computing Systems, Science Communication Systems, and
Web-based Mathematics Education Systems. Lanzhou
university/China and Kent University/USA are jointly
developing a mathematical expression editor. The editor
MathEdit, implemented in JavaScript and MathML, is a
web-based visual interactive editor for mathematical
expressions. Figure 1 shows the end-user view of the
MathEdit architecture. In MathEdit the MathML Content
code is the core code of being edited mathematical
expression. User actions, inserting, deleting and
editing sub-expressions by mouse clicks and keyboard
input, are treated as commands. The commands will
invoke JavaScript functions in the command processing
module to modify the MathML content code by revising
DOM tree of expression. The MathML Content will
synchronously convert to MathML Presentation code and
Math Infix code. The user will intuitively see the
changed math expression displayed by MathML
Presentation.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wang:2008:FPD,
author = "Mingsheng Wang and Jinwang Liu",
title = "Factorization problems on {$n$-D} polynomial matrices
(abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "88--89",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394098",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Watt:2008:FDM,
author = "Stephen M. Watt",
title = "On the functional decomposition of multivariate
{Laurent} polynomials (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "89--90",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394099",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Determining whether a univariate polynomial may be
written as the functional composition of two others of
lower degree is a question that has been studied since
at least the work of Ritt [1]. Algorithms by Barton and
Zippel [2] and then by Kozen and Landau [3] have been
incorporated in many computer algebra systems.
Generalizations have been studied for functional
decomposition of rational functions [4], algebraic
functions [5], multivariate polynomials [6] and
univariate Laurent polynomials [7].\par
We explore the functional decomposition problem for
multivariate Laurent polynomials, considering the case
f = g o h where g is univariate and h may be
multivariate. We present an algorithm to find such a
decomposition if it exists.\par
The algorithm proceeds as follows: First, a variable
weighting is chosen to make the weighted degree zero
term in f constant. The positive degree and negative
degree parts of h are then reconstructed separately, in
a manner similar to that of Kozen and Landau, but by
treating the homogeneous collections of terms by grade
rather than individual monomials. Then terms of the
univariate polynomial g are reconstructed degree by
degree using a generic univariate projection of h.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wolfe:2008:DTA,
author = "Randall Wolfe",
title = "Divisibility tests (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "90--90",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394100",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Divisibility tests have always fascinated people. My
project shows tricks of how you can tell if really
large numbers can be divisible by smaller numbers.
Modular arithmetic is utilized to find and analyze
divisibility tests. Three methods (Ending Digits Test,
Sum of Digits Test, and Alternating Sum of Digits Test)
in which you can test divisibility of a number (a) by a
number (d) and proofs are presented in this poster.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Yuhasz:2008:CMG,
author = "George Yuhasz and Erich Kaltofen",
title = "Computing minimal generators of integer matrix
sequences (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "91--91",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394101",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We describe a fraction free matrix Berlekamp/Massey
algorithm. The algorithm behaves like a scalar
algorithm by performing block eliminations through
multiplication by adjoint matrices. The adjoints are
computed using fraction free diagonalization. We also
describe an interesting classification of the unique
minimal generators of a linearly generated scalar
integer sequence. A counter example to the scalar
theorem is given for linearly generated integer matrix
sequences.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Zeller:2008:IPC,
author = "Dean Zeller",
title = "An introduction to programming curriculum including
elements of mathematics, art, and creative writing
(abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "91--91",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394102",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "During the Fall 2007 and Spring 2008 semesters, I
tested a new style of teaching introductory programming
in which graphics are covered early in the curriculum.
Students gained familarity with the XY-Coordinate
system used by most graphics packages. They used this
system to create scalable (size and location) and color
parameterizable graphics for use in other graphics. The
mathematical properties of sine and cosine were used to
generate points evenly distributed around a circle.
Objects were collected into a function library to
encourage collaboration. All this was finally used to
create an interactive illustrated story. This new style
of programming pedagogy can be applied to teaching
middle- or high-school level mathematic.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Zhou:2008:EOB,
author = "Wei Zhou",
title = "Efficient order basis computation (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "91--91",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394103",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Order basis (also known as 3/4-basis, minimal
approximant basis), originally developed by Beckermann
and Labahn in 1994 for rational approximation and
interpolation problems, has recently been applied to
many other important problems in polynomial matrix
computation. These include column reduction, matrix
inverse, determinant, and null space basis computation.
Storjohann, in 2006, provided an efficient way to
compute a part of order basis that is within a given
degree bound. We extend Storjohann's result by
providing a way to compute a complete order basis with
a similar computational cos.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Giesbrecht:2008:MCP,
author = "Mack Giesbrecht",
title = "The {MICA 2008 Conference}, Preface and Abstracts",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "92--102",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394105",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kotsireas:2008:MMC,
author = "Ilias S. Kotsireas",
title = "{Mathematical Methods in Computer Science 2008: MMICS
2008, December 17--19, 2008, Karlsruhe, Germany}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "103--103",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2008:ISS,
author = "Anonymous",
title = "{10th International Symposium on Symbolic and Numeric
Algorithms for Scientific Computing, Timisoara,
Romania, September 26--29, 2008}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "104--104",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fuchssteiner:2008:MGA,
author = "Benno Fuchssteiner",
title = "Modified {Gauss} algorithm for matrices with symbolic
entries",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "108--121",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Nagasaka:2008:APG,
author = "Kosaku Nagasaka",
title = "Approximate polynomial {GCD} over integers",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "124--126",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sasaki:2008:CDS,
author = "Tateaki Sasaki and Daiju Inaba",
title = "Convergence domain of series expansions of
multivariate algebraic functions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "127--128",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cheng:2008:CPL,
author = "Howard Cheng and George Labahn and Wei Zhou",
title = "Computing polynomial {LCM} and {GCD} in {Lagrange}
basis",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "129--130",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wolf:2008:SLS,
author = "Thomas Wolf",
title = "On solving large systems of polynomial equations
appearing in discrete differential geometry",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "131--134",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Buchberger:2008:GPR,
author = "Bruno Buchberger and Georg Regensburger and Markus
Rosenkranz and Loredana Tec",
title = "General polynomial reduction with {TH} 9 {OREM} 8
functors: applications to integro-differential
operators and polynomials",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "135--137",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Caboara:2008:GAG,
author = "Massimo Caboara and Fabrizio Caruso",
title = "Group actions on {Gr{\"o}bner} bases of saturated
zero-dimensional binomial ideals",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "138--139",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Inoue:2008:CIR,
author = "Shutaro Inoue and Kohei Mukaida and Akira Suzuki and
Yosuke Sato",
title = "Computation of inverses in residue class rings with
parameters",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "140--141",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Morel:2008:LRB,
author = "Ivan Morel and Damien Stehl{\'e} and Gilles Villard",
title = "From an {LLL}-reduced basis to another",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "142--143",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kanno:2008:SAR,
author = "Masaaki Kanno and Kazuhiro Yokoyama and Hirokazu
Anai",
title = "Solution of the algebraic {Riccati} equation using the
sum of roots",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "144--145",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Stefanus:2008:BFD,
author = "Lim Yohanes Stefanus",
title = "{De Boor--Fix} dual functionals for transformation
from polynomial basis to convolution basis",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "146--148",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gao:2008:CSM,
author = "Xiao-Shan Gao and Zhenyu Huang",
title = "A characteristic set method for equation solving over
finite fields",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "149--150",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{ChAze:2008:AFB,
author = "G. Ch{\`e}ze and M. Elkadi and A. Galligo and M.
Weimann",
title = "Absolute factoring of bidegree bivariate polynomials",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "151--153",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cuyt:2008:SMP,
author = "Annie Cuyt and Wen-shin Lee",
title = "Sparse multivariate polynomial interpolation via the
quotient-difference algorithm",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "154--155",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Benghorbal:2008:UFA,
author = "Mhenni M. Benghorbal",
title = "Unified formulas for arbitrary order symbolic
derivatives and anti-derivatives of the power-inverse
hyperbolic class 1",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "156--156",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Novocin:2008:FUPb,
author = "Andy Novocin and Mark van Hoeij",
title = "Factoring univariate polynomials over the rationals",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "157--157",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Moritsugu:2008:GTP,
author = "Shuichi Moritsugu and Chisato Arai",
title = "Geometry theorem proving by {Gr{\"o}bner} bases: using
ideal decompositions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "158--159",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Emiris:2008:CRB,
author = "Ioannis Emiris and Bernard Mourrain and Elias
Tsigaridas",
title = "Computing a rational in between",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "160--161",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Chen:2008:RCS,
author = "Changbo Chen and Liyun Li and Marc Moreno Maza and Wei
Pan and Yuzhen Xie",
title = "On the representation of constructible sets",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "162--163",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Li:2008:SSF,
author = "Ziming Li and Martin Ondera and Huaifu Wang",
title = "Simplifying skew fractions modulo differential and
difference relations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "164--165",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Banshchikov:2008:ADL,
author = "Andrey V. Banshchikov",
title = "Analysis of dynamics of large-dimensional mechanical
systems by the tools of computer algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "166--166",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Roach:2008:SIQ,
author = "Kelly Roach",
title = "Solving integrals with the quantum computer algebra
system",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "167--168",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Arri:2008:FCR,
author = "Alberto Arri",
title = "The {F5} criterion revised",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "169--170",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Li:2008:MLB,
author = "Xin Li and Marc Moreno Maza and Raqeeb Rasheed and
{\'E}ric Schost",
title = "The {\tt modpn} library: bringing fast polynomial
arithmetic into {MAPLE}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "172--174",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hamada:2008:KML,
author = "Tatsuyoshi Hamada and {KNOPPIX\slash Math
committers}",
title = "{KNOPPIX\slash Math}: a live system for enjoying
mathematics with computer",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "175--176",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Zeng:2008:AST,
author = "Zhonggang Zeng",
title = "{ApaTools}: a software toolbox for approximate
polynomial algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "177--179",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Greuel:2008:SCA,
author = "G. M. Greuel and G. Pfister and H. Sch{\"o}nemann",
title = "{SINGULAR}: a computer algebra system for polynomial
computations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "180--181",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Chen:2008:CPM,
author = "Changbo Chen and Marc Moreno Maza and Fran{\c{c}}ois
Lemaire and Wei Pan and Liyun Li and Yuzhen Xie",
title = "The {ConstructibleSetTools} and
{ParametricSystemTools} modules of the {RegularChains}
library in {Maple}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "182--184",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Schwarz:2008:AW,
author = "Fritz Schwarz",
title = "{ALLTYPES} in the {Web}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "3",
pages = "185--187",
month = sep,
year = "2008",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Feb 13 18:17:36 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sperner:2008:CTM,
author = "Emanuel Sperner",
title = "On a combinatorial theorem of {Macaulay} and its
applications to the theory of polynomial ideals",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "4",
pages = "192--201",
month = dec,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1504341.1504343",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Mar 31 20:07:19 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Translation by Michael Abramson of {\em {\"U}ber einen
kombinatorischen Satz von Macaulay und seine
Anwendungen auf die Theorie der Polynomideale,
Abhandlungen aus dem Mathematische Seminaren der
Universit{\"a}t Hamburg 7 (1930): 149--163}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Casale:2008:AEL,
author = "Giuliano Casale",
title = "An application of exact linear algebra to capacity
planning models",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "4",
pages = "202--205",
month = dec,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1504341.1504345",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Mar 31 20:07:19 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Stoutemyer:2008:MPF,
author = "David R. Stoutemyer",
title = "Multivariate partial fraction expansion",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "4",
pages = "206--210",
month = dec,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1504341.1504346",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Mar 31 20:07:19 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The Derive computer-algebra program has Expand as one
of the menu choices: The user is prompted for
successively less main expansion variables, which can
be all of the variables or any proper subset. It is
clear how to proceed when the expression is a
polynomial: Fully distribute with respect to all
expansion variables, but collect as coefficient
polynomials all terms that share the same exponents for
the expansion variables. Derive uses a partially
factored form, so the collected coefficient polynomials
can be fortuitously partially factored.\par
For rational expressions the expand function does
partial fraction expansion because it is the most
useful kind of rational expansion. However, most other
computer algebra systems and examples in the literature
focus on partial fraction expansion with respect to
only one variable, where any other variables are
considered mere parameters. For consistency with
multivariate polynomial expansion, we wanted a useful
and well-defined meaning for multivariate partial
fraction expansion. This paper provides such a
definition and a corresponding algorithm.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Broughan:2009:AEE,
author = "Kevin A. Broughan",
title = "An algorithm for the explicit evaluation of {$ \hbox
{GL}(n R) $} {Kloosterman} sums",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "1",
pages = "1--10",
month = mar,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1610296.1610297",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Sep 15 13:33:01 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "An algorithm for the explicit evaluation of
Kloosterman sums for $ \hbox {GL}(n R) $ for $ n \geq 2
$ and an implementation in the Mathematica package
GL($n$)pack are described. Pl{\"u}cker relations in
dimensions 3, 4 and 5 are given.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "167",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "11L05; Pl{\"u}cker coordinates; Pl{\"u}cker relations;
Kloosterman sum; MSC2000: 11L03; symbolic-numeric
algorithm",
}
@Article{Thome:2009:ACW,
author = "Emmanuel Thom{\'e}",
title = "Abstracts of the {CADO} workshop on integer
factorization",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "1",
pages = "11--14",
month = mar,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1610296.1610298",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Sep 15 13:33:01 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The CADO workshop on integer factorization was held in
Nancy, France, on October 7-9th, 2008. The workshop was
focused on the Number Field Sieve and its
implementation aspects. Fifty participants attended the
workshop.\par
The workshop was organized by Pierrick Gaudry, Emmanuel
Thom{\'e} and Paul Zimmermann.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "167",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hearn:2009:RFS,
author = "Anthony C. Hearn",
title = "{REDUCE} is free software as of {January 2009}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "1",
pages = "15--16",
month = mar,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1610296.1610299",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Sep 15 13:33:01 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/redextra.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "167",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2009:CA,
author = "Anonymous",
title = "Conference announcements",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "1",
pages = "17--20",
month = mar,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1610296.1610300",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Sep 15 13:33:01 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "167",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Abramson:2009:HBG,
author = "Michael P. Abramson",
title = "Historical background to {Gr{\"o}bner}'s paper",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "2",
pages = "22--23",
month = jun,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1610296.1610301",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Sep 15 13:33:01 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "168",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Grobner:2009:API,
author = "Wolfgang Gr{\"o}bner",
title = "On the algebraic properties of integrals of linear
differential equations with constant coefficients",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "2",
pages = "24--46",
month = jun,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1610296.1610302",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Sep 15 13:33:01 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "168",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Joyner:2009:ASS,
author = "David Joyner",
title = "{AMS} special session on {SAGE} and mathematical
research using open source software",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "2",
pages = "49--54",
month = jun,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1610296.1610303",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Sep 15 13:33:01 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "168",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gerhard:2009:PSP,
author = "J{\"u}rgen Gerhard and D. J. Jeffrey and Guillaume
Moroz",
title = "A package for solving parametric polynomial systems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "3",
pages = "61--72",
month = sep,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1823931.1823933",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jul 6 14:14:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "A new Maple package for solving parametric systems of
polynomial equations and inequalities is described. The
main idea for solving such a system is as follows. The
parameter space Rd is divided into two parts: the
discriminant variety $W$ and its complement $ R^d n W$.
The discriminant variety is a generalization of the
well-known discriminant of a univariate polynomial and
contains all those parameter values leading to
non-generic solutions of the system. The complement $
R^d n W$ can be expressed as a finite union of open
cells such that the number of real solutions of the
input system is constant on each cell. In this way, all
parameter values leading to generic solutions of the
system can be described systematically. The underlying
techniques used are Gr{\"o}bner bases, polynomial real
root finding, and cylindrical algebraic decomposition.
This package offers a friendly interface for scientists
and engineers to solve parametric problems, as
illustrated by an example from control theory.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "169",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Stoutemyer:2009:UNM,
author = "David R. Stoutemyer",
title = "Unit normalization of multinomials over {Gaussian}
integers",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "3",
pages = "73--76",
month = sep,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1823931.1823934",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jul 6 14:14:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Polynomials over the Gaussian integers $ Z[i] $ are a
unique factorization domain, and the units in $ Z[i] $
are $ 1, - 1, i $ and $ - i $. To implement the
advantageous uniqueness, we might have to factor one of
these units out of some multinomial factors to make all
of the factors unit normal. Not doing so can lead to
unnecessarily complicated results, disastrous
unrecognized division by 0, and lost opportunities to
obtain closed-form integrals, sums, limits, equation
solutions, etc. For example, the default simplification
of at least two major computer algebra systems don't
recognize that the linear factors in the numerator and
denominator of the following ratio are proportional,
hence do not simplify the ratio to 1: $ - i ((1 + i) z
+ i) / (1 - i) z + 1 \rightarrow 1 $.
Unlike polynomials over the integers or rational
numbers, the literature doesn't appear to address unit
normalization over the Gaussian integers. Therefore
this note proposes two alternative definitions. They
are easy to implement, execute quickly, and can't
greatly increase the bulk of an expression.
Consequently they are good candidates for inclusion in
the default simplification of every computer algebra
system.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "169",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bertone:2009:PAP,
author = "C. Bertone and G. Ch{\'e}ze and A. Galligo",
title = "Probabilistic algorithms for polynomial absolute
factorization",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "3",
pages = "77--78",
month = sep,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1823931.1823936",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jul 6 14:14:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "169",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cheng:2009:ALA,
author = "Howard Cheng and George Labahn",
title = "Applying linear algebra routines to modular ore
polynomial matrix algorithms",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "3",
pages = "78--79",
month = sep,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1823931.1823937",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jul 6 14:14:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "169",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cuyt:2009:SNS,
author = "Annie Cuyt and Wen-shin Lee",
title = "Symbolic-numeric sparse interpolation of multivariate
rational functions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "3",
pages = "79--80",
month = sep,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1823931.1823938",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jul 6 14:14:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "169",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Esparza:2009:LFP,
author = "Javier Esparza and Andreas Gaiser and Stefan Kiefer",
title = "On least fixed points of systems of positive
polynomials",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "3",
pages = "81--83",
month = sep,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1823931.1823939",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jul 6 14:14:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "169",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Inoue:2009:IBG,
author = "Shutaro Inoue and Yosuke Sato",
title = "Implementation of {Boolean Gr{\"o}bner} bases in
{Risa\slash Asir}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "3",
pages = "83--84",
month = sep,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1823931.1823940",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jul 6 14:14:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "169",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jeannerod:2009:ECA,
author = "Claude-Pierre Jeannerod and Christophe Mouilleron and
Gilles Villard",
title = "Extending {Cardinal}'s algorithm to a broader class of
structured matrices",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "3",
pages = "84--85",
month = sep,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1823931.1823941",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jul 6 14:14:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "169",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Maza:2009:BDP,
author = "Marc Moreno Maza and Yuzhen Xie",
title = "Balanced dense polynomial multiplication on
multi-cores",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "3",
pages = "85--87",
month = sep,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1823931.1823942",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jul 6 14:14:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "169",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Murakami:2009:CFT,
author = "Hiroshi Murakami",
title = "A continued fraction type method to find a rational
number in a given closed interval whose denominator is
minimal",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "3",
pages = "88--90",
month = sep,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1823931.1823943",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jul 6 14:14:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We show a fast algorithm to find a rational number in
a given real interval whose denominator is minimal. The
algorithm is similar to the regular continued fraction
expansion for a real number.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "169",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "approximation; continued fraction; interval; rational
number",
}
@Article{Nakayama:2009:DDB,
author = "Hiroki Nakayama and Hiroshi Sekigawa",
title = "Determining divisibility between polynomials with
inexact coefficients",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "3",
pages = "91--94",
month = sep,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1823931.1823944",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jul 6 14:14:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We provide a method of determining whether there exist
some $ p 2 P $ and $ f 2 F $ such that $p$ is divisible
by $f$ for a pair of real multivariate interval
polynomials, $P$ and $F$. Although this problem is
written as a feasibility problem for a system of
nonlinear algebraic equations, it is an NP-hard problem
and is thus difficult to solve. Our approach is
iterative based on interval analyses, which outputs the
regions containing the solutions if the system is
feasible; otherwise, it outputs the fact of
infeasibility. We also propose two methods for where
the system of algebraic equations is underdetermined,
the first obtains the regions that enclose all
solutions, and the second obtains the solution that
minimizes error in the Euclidean norm.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "169",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Porat:2009:VQA,
author = "Moshe Porat",
title = "A vector-quantization approach to coding systems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "3",
pages = "94--96",
month = sep,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1823931.1823945",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jul 6 14:14:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The increasing amount of information transmitted over
communication channels has to be handled efficiently to
avoid congestion and delays in the network service. In
this work, an algebraic approach to data coding and
transmission is proposed. One of its basic assumptions
is that in many situations the information could be
decomposed into basic components or vectors, which
represent a significant part of the data. To illustrate
the capabilities of the proposed approach, a coding
system based on vector quantization is investigated.
This approach is based on the observation that in most
systems, events of recent history of the stream can be
used to represent future vectors of the data. Our
conclusion is that the proposed algebraic approach
could be efficient in presently used coding systems.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "169",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Roune:2009:SAK,
author = "Bjarke Hammersholt Roune",
title = "A slice algorithm for {Koszul} simplicial complexes on
the {LCM} lattice of monomial ideals",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "3",
pages = "96--98",
month = sep,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1823931.1823946",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jul 6 14:14:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "169",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{deCabezon:2009:EAA,
author = "Eduardo S{\'a}enz de Cabez{\'o}n and Henry P. Wynn",
title = "Efficient algorithms for the algebraic analysis of
system reliability",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "3",
pages = "98--99",
month = sep,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1823931.1823947",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jul 6 14:14:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "169",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sasaki:2009:AFP,
author = "Tateaki Sasaki and Yasutaka Ookura",
title = "Approximate factorization of polynomials in {$ Z[x]
$}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "3",
pages = "99--101",
month = sep,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1823931.1823948",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jul 6 14:14:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "169",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Shayanfar:2009:CAE,
author = "Nikta Shayanfar and Mahmoud Hadizadeh",
title = "Computer algebraic efficiency of matrix polynomials
for a system of integral equations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "3",
pages = "101--102",
month = sep,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1823931.1823949",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jul 6 14:14:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "169",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Shirayanagi:2009:NMR,
author = "Kiyoshi Shirayanagi and Hiroshi Sekigawa",
title = "A new method of reducing exact computations to obtain
exact results",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "3",
pages = "102--104",
month = sep,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1823931.1823950",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jul 6 14:14:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "169",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Suzuki:2009:CGB,
author = "Akira Suzuki",
title = "Computing {Gr{\"o}bner} bases within linear algebra
and its implementation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "3",
pages = "104--105",
month = sep,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1823931.1823951",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jul 6 14:14:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "169",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Joyner:2009:OSC,
author = "David Joyner",
title = "Open source computer algebra systems: {GAP}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "4",
pages = "110--118",
month = dec,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1823931.1823953",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jul 6 14:14:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "170",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Koutschan:2009:AAH,
author = "Christoph Koutschan",
title = "Advanced applications of the holonomic systems
approach",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "4",
pages = "119--119",
month = dec,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1823931.1823954",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jul 6 14:14:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The holonomic systems approach was proposed in the
early 1990s by Doron Zeilberger. It laid a foundation
for the algorithmic treatment of holonomic function
identities. Fr{\'e}d{\'e}ric Chyzak later extended this
framework by introducing the closely related notion of
$ \partial $-finite functions and by placing their
manipulation on solid algorithmic grounds. For
practical purposes it is convenient to take advantage
of both concepts which is not too much of a
restriction: The class of functions that are holonomic
and $ \partial $-finite contains many elementary
functions (such as rational functions, algebraic
functions, logarithms, exponentials, sine function,
etc.) as well as a multitude of special functions (like
classical orthogonal polynomials, elliptic integrals,
Airy, Bessel, and Kelvin functions, etc.). In short, it
is composed of functions that can be characterized by
sufficiently many partial differential and difference
equations, both linear and with polynomial
coefficients. An important ingredient is the ability to
execute closure properties algorithmically, for example
addition, multiplication, and certain substitutions.
But the central technique is called creative
telescoping which allows to deal with summation and
integration problems in a completely automatized
fashion.\par
Part of this thesis is our Mathematica package
HolonomicFunctions in which the above mentioned
algorithms are implemented, including more basic
functionality such as noncommutative operator algebras,
the computation of Gr{\"o}bner bases in them, and
finding rational solutions of parameterized systems of
linear differential or difference
equations.\par
Besides standard applications like proving special
function identities, the focus of this thesis is on
three advanced applications that are interesting in
their own right as well as for their computational
challenge. First, we contributed to translating
Takayama's algorithm into a new context, in order to
apply it to an until then open problem, the proof of
Ira Gessel's lattice path conjecture. The computations
that completed the proof were of a nontrivial size and
have been performed with our software. Second,
investigating basis functions in finite element
methods, we were able to extend the existing algorithms
in a way that allowed us to derive various relations
which generated a considerable speed-up in the
subsequent numerical simulations, in this case of the
propagation of electromagnetic waves. The third
application concerns a computer proof of the
enumeration formula for totally symmetric plane
partitions, also known as Stembridge's theorem. To make
the underlying computations feasible we employed a new
approach for finding creative telescoping operators.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "170",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Li:2009:THP,
author = "Xin Li",
title = "Toward high-performance polynomial system solvers
based on triangular decompositions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "4",
pages = "120--120",
month = dec,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1823931.1823956",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jul 6 14:14:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This thesis is devoted to the design and
implementation of polynomial system solvers based on
symbolic computation. Solving systems of non-linear,
algebraic or differential equations, is a fundamental
problem in mathematical sciences. It has been studied
for centuries and still stimulates many research
developments, in particular on the front of
high-performance computing.\par
Triangular decompositions are a highly promising
technique with the potential to produce
high-performance polynomial system solvers. This thesis
makes several contributions to this effort.\par
We propose asymptotically fast algorithms for the core
operations on which triangular decompositions rely.
Complexity results and comparative implementation show
that these new algorithms provide substantial
performance improvements.\par
We present a fundamental software library for
polynomial arithmetic in order to support the
implementation of high-performance solvers based on
triangular decompositions. We investigate strategies
for the integration of this library in high-level
programming environments where triangular
decompositions are usually implemented.\par
We obtain a high performance library combining highly
optimized C routines and solving procedures written in
the Maple computer algebra system. The experimental
result shows that our approaches are very effective,
since our code often outperforms pre-existing solvers
in a significant manner.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "170",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Richardson:2009:EPT,
author = "David Richardson",
title = "Efficient programming techniques for the {SACLIB}
computer algebra library",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "4",
pages = "120--120",
month = dec,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1823931.1823955",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jul 6 14:14:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This dissertation describes three contributions to the
SACLIB computer algebra library. Using generic
programming we specify the Recursively Fixed Iterator
and the Structure Protecting Iterator concepts. We
prove that models of these concepts cannot leak or
double delete resources. Through template
metaprogramming, we implement models of these concepts
that provide this memory safety at compile-time and
without any run-time overhead. Using aspect oriented
programming, we allow unit and regression tests to be
automatically obtained from an executing SACLIB
program. This program instrumentation is transparent
both to SACLIB maintainers and clients. This mechanism
allows the automated creation of regression test suites
during the execution of normal SACLIB programs. Using
code generation and auto-tuning, we allow high
performance implementations of the Taylor shift, de
Casteljau's algorithm, and the Descartes Method for
polynomial root isolation to be automatically tuned for
different architectures. This allows a speedup of 10-20
over existing methods to be obtained on modern CPU
architectures. The key to this speedup is the creation
of a tiling scheme that allows the irregular structure
of the computation to be tiled using a small number of
tiles that are easy for a code generator to produce
code for. The implementation of the Recursively Fixed
Iterator and the Structure Protecting Iterator provide
memory safety by using C++ template metaprograms that
selectively disable certain classes of side effects in
programs using the iterators. Other safety properties
can be achieved using similar disabling of side
effects. We believe that the most important
continuation of the work presented here is the
development of programming language techniques to allow
programmers to control where their code should sit
along the spectrum of the absence of side effects in
pure functional languages and the unrestricted side
effects of imperative language.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "170",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ding:2009:NSC,
author = "Hui Ding",
title = "Numerical and symbolic computation of the {Lambert}
{$W$} function in {$ C^{n \times n}$}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "43",
number = "4",
pages = "121--121",
month = dec,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1823931.1823957",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jul 6 14:14:27 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The Lambert $W$ function is a multivalued complex
function, first named in the computer algebra system
Maple. We present iterative schemes and strategies for
the numerical evaluation of all branches of the scalar
complex Lambert $W$ function to hardware precision with
high computational efficiency, and present a set of
rules for the simplification of special symbolic
arguments. We also extend the numerical and symbolic
computations to the Lambert $W$ function in $ C^{n
\times n}$, for $ n > 1$. In order to achieve high
precision and computational efficiency, we evaluate a
series of high order and classical iterative methods
and strategies for the evaluation of the scalar Lambert
$W$ function. We then construct optimal iterative
schemes for the evaluation of the complex Lambert $W$
function in the IEEE floating point model. The schemes
consist of variations on Newton and Halley iterations
together with initial estimates generated using a
variety of series approximations. We also study several
classes of exact simplifications for the Lambert $W$
function for symbolic arguments and give rules for
their application. Finally, we consider the solutions
of the matrix equation $ S \exp (S) = A$, where $S$ and
$A$ are $ n \times n$ matrices. The solutions are
expressed in terms of extensions of the scalar Lambert
$W$ function to $ C^{n \times n}$. The solutions of the
matrix equations consist not only of the matrix
functions $ W(A)$; other solutions also exist. We focus
first on solving the matrix equation in $ C^{3 \times
3}$, and implement solutions in the floating-point
case, and the symbolic case, using Maple.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "170",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jeffrey:2010:LFN,
author = "D. J. Jeffrey",
title = "{LU} factoring of non-invertible matrices",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "1",
pages = "1--8",
month = mar,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838602",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The definition of the LU factoring of a matrix usually
requires that the matrix be invertible. Current
software systems have extended the definition to
non-square and rank-deficient matrices, but each has
chosen a different extension. Two new extensions, both
of which could serve as useful standards, are proposed
here: the first combines LU factoring with full-rank
factoring, and the second extension combines full-rank
factoring with fraction-free methods. Amongst other
applications, the extension to full-rank, fraction-free
factoring is the basis for a fraction-free computation
of the Moore--Penrose inverse.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "171",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bostan:2010:RFT,
author = "Alin Bostan and Shaoshi Chen and Fr{\'e}d{\'e}ric
Chyzak and Ziming Li",
title = "Rational-functions telescopers: blending creative
telescoping with {Hermite} reduction",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "1",
pages = "9--10",
month = mar,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838603",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "171",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Manubens:2010:AOP,
author = "Montserrat Manubens",
title = "Abstract only: {Parametric} polynomial system
discussion: canonical comprehensive {Gr{\"o}bner}
systems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "1",
pages = "11--12",
month = mar,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838605",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The discussion of parametric polynomial systems is an
old and important problem in many technical and
mathematical applications. To recall its importance it
suffices to remember the well-known discussions of
parametric linear systems and how useful they are for
applications. However, many practical problems are
associated to non-linear systems, in which the study of
the nature of the solutions (i.e. no solution, finite
number of solutions, degree of freedom of the
solutions, etc) is very important depending on the
values of the parameters.\par
Since Gr{\"o}bner bases were introduced, various
approaches have been developed for this problem. Many
authors have studied the subject during the last 15
years, among others we can highlight D. Lazard, D.
Duval, P. Gianni, M. Kalkbrenner, V. Weispfenning, T.
Mora, M. Moreno-Maza, L.Gonzalez-Vega, D. Kapur, D.
Wang, Y. Sato, A. Suzuki, for the relevance of their
contributions.\par
The development of the subject of this thesis was
initiated in 2000 with the first Montes' algorithm
dispgb for discussing parametric polynomial systems
using Gr{\"o}bner bases, published in 2002 in the
Journal of Symbolic Computation. Montes' algorithm has
progressed from that moment, until the final obtaining
of the Minimal Canonical Comprehensive Gr{\"o}bner
System (MCCGS) of a parametric ideal.\par
During the period 2003-2007 I had the great opportunity
and pleasure to participate in this challenging
project. My personal contribution to the project
consisted of the implementation and improvement of a
high number of algorithms that have conformed the
evolution up to the current algorithm MCCGS, and
updating the theory and algorithms that were initially
disperse and partially incomplete.\par
Given a polynomial system with parameters and a term
order for the variables, the latest implementation of
the algorithm MCCGS performs a discussion on the
cancellation of some polynomials in the parameters. It
obtains a set of ordered pairs consisting of a segment
(constructible subset of the parameter space) and a
basis (finite set of polynomials) such that\par
the set of all segments forms a partition of the
parameter space;
for each pair, the substitution of the parameters in
the basis by any value inside the corresponding
segment, produces always the reduced Gr{\"o}bner basis,
with respect to the given term order, of the ideal
generated by the substitution of the same values in the
given polynomials;
the segments are uniquely determined by the given
system and term order and moreover they are described
in a canonical form;
the number of pairs in the obtained set is the minimum
possible with these properties.
All implementations have been done in Maple, and the
last release 7.0 is currently available on the web
http://www-ma2.upc.edu/~montes/, which integrates the
improvements made on the original Montes' algorithm and
the final MCCGS algorithm.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "171",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Radu:2010:AOA,
author = "Silviu Radu",
title = "Abstract only: {An} algorithmic approach to
{Ramanujan}'s congruences and related problems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "1",
pages = "11--12",
month = mar,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838606",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In this thesis we study Ramanujan's congruences and
related problems from an algorithmic point of view. We
present an algorithm that proves such congruences.
Furthermore, we also describe an algorithm that proves
identities involving certain infinite products which
are tightly connected to Ramanujan's congruences. The
techniques involved are based on modular forms and we
spend some time on nailing down the definitions and
results involved in this area. In the last part of the
thesis we give a proof of a result conjectured by James
Sellers about generalized Frobenius partitions, which
resulted from joint work with Peter Paule.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "171",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2010:MCE,
author = "Anonymous",
title = "In memoriam: {Chionh Eng Wee}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "2",
pages = "18--19",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838600",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "172",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Grobner:2010:MIS,
author = "Wolfgang Gr{\"o}bner",
title = "On the {Macaulay} inverse system and its importance
for the theory of linear differential equations with
constant coefficients",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "2",
pages = "20--23",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838608",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "When first studying Macaulay's {\em inverse systems\/}
(for this, see [2, p. 65ff] first, then [3, page 37ff],
and the excellent short exposition [1, page 66ff]), one
can easily fall for the mistake that this is a
difficult to understand, artificial construction of
little value. Subsequent applications, which lead to a
very surprising new insight, teach us better. In what
follows, it will be shown how this shortcoming, insofar
as it even exists, can be corrected in a simple way
that draws on a new interpretation of the polynomial
ring, which may be useful in and of itself. Macaulay's
inverse system is thereby connected to the system of
integrals of linear homogeneous differential equations
with constant coefficients and loses its character of
possible foreignness. At the same time, this work
represents an attempt to establish relationships
between two seemingly completely separate branches of
mathematics, which may be useful and fruitful for both
sides.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "172",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Leykin:2010:AOC,
author = "Anton Leykin",
title = "Abstract only: {Certified} numerical solving of
systems of polynomial equations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "2",
pages = "24--24",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838610",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Polynomial homotopy continuation is at the heart of
numerical algebraic geometry, an area whose primary
goal is to solve systems of polynomial equations.
Recently this field developed rapidly producing several
software packages that solve some problems out of reach
for purely symbolic techniques. However, the homotopy
tracking procedures employ heuristics to follow the
homotopy continuation paths. Jointly with Carlos
Beltran we have devised a certified homotopy tracking
algorithm, which was implemented in Macaulay2. In
addition we conducted experiments shedding light on
some developments in complexity analysis of polynomial
systems solving.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "172",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Saunders:2010:AOE,
author = "David Saunders",
title = "Abstract only: {Exact} linear algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "2",
pages = "24--24",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838612",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Most of the methods of linear algebra, even the
iterative ones, are exact in principle but are applied
approximately. Over the past half century numerical
analysis has made great strides in the understanding of
approximation in matrix computation. But also, roughly
over the past three decades, a solid algorithmic basis
for exact sparse and dense matrix computation has
emerged. We argue that the computer algebra community
has the interests, techniques, motivations, and
applications to develop high performance computational
capabilities for exact linear algebra It is a tale of
two equivalence relations, similarity and matrix
equivalence. These were characterized in the 19th
century via the Jordan canonical form and Smith normal
form respectively. Associated with these are the
computational concerns of numerical linear algebra,
eigenvalues and linear system solving respectively. But
applications of exact linear algebra tend to need some
or all of the invariants themselves associated with
these equivalences. From rank to characteristic
polynomial, computation of these invariants resists
pure numerical solution and provides an important role
for computer algebra.\par
We discuss the state of the art and current issues in
algorithms and software system design for exact linear
algebra over the integers, the rational numbers, and
over finite fields. We show some of the applications in
which large scale exact linear algebra has been used.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "172",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{vanHoeij:2010:AOC,
author = "Mark van Hoeij",
title = "Abstract only: {The} complexity of factoring
univariate polynomials over the rationals",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "2",
pages = "24--24",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838611",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In 2001 a new algorithm was introduced for factoring
polynomials over the rationals. The algorithm was soon
adopted by several computer algebra systems because of
its good practical performance. A complexity result for
a slower version of the algorithm was given in a
preprint [BHKS, 2004], but there remained a very large
gap between the proven bound and the behavior of the
implementations as observed in actual examples. This
gap was closed in joint work with Andy Novocin. We give
a modification of the algorithm that allows us to prove
the best complexity bound for factoring in Q[x].
Moreover, unlike [BHKS, 2004], an implementation by
Novocin demonstrates that this modification does not
slow down the algorithm in practice.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "172",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bard:2010:AOD,
author = "Gregory V. Bard",
title = "Abstract only: {DEMOCRACY}: a heuristic for polynomial
systems of equations over finite fields",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "2",
pages = "25--25",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838613",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This paper presents a heuristic for solving polynomial
systems of equations on finite fields larger than
GF(2), via stochastic local search (SLS). It was
inspired by the SLS-based SAT-solvers G-SAT,Walk-SAT
and Tabu-SAT. Called DEMOCRACY, the equations vote on
which values for a given variable will satisfy as many
as possible of them. Variables, one at a time, are
thusly changed from an initial random setting, until
all equations are satisfied.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "172",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Giesbrecht:2010:AOC,
author = "Mark Giesbrecht and Daniel S. Roche and Hrushikesh
Tilak",
title = "Abstract only: {Complexity} of sparsest multiple
computation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "2",
pages = "25--25",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838614",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We investigate the problem of computing the sparsest
multiple of a given univariate polynomial. Over the
rational numbers we exhibit algorithms for when the
target sparsity is two (i.e., the existence of a
binomial multiple), as well as some cases when the
target multiple has greater (constant) sparsity. Over
finite fields, we tie the cost of finding a binomial
multiple (of low degree) to order-finding in the
multiplicative group of a finite field, as well as
presenting similar, but more limited results for
general sparsity.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "172",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Mathews:2010:AOE,
author = "Deborah Mathews",
title = "Abstract only: {An} empirical study of parallel big
number arithmetic",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "2",
pages = "25--25",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838615",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "To capitalize on multi-core processing, it would be
good to perform big number arithmetic in parallel.
While a performance increase equal to the number of
processors is theoretically possible, our experiments
show that in practice the likelihood of gaining any
performance increase for big number arithmetic through
parallel processing is low. A speed-up approaching the
number of processors was not achieved for
multiplication until the operands had at least 215
bits. No performance gain was realized for addition.
The base algorithm used for multiplication was O(n2)
and, therefore, suboptimal. The expected performance
gain achieved when parallelizing a more efficient base
algorithm should be even smaller.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "172",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Meng:2010:AOS,
author = "Lingchuan Meng and Jeremy Johnson and Franz Franchetti
and Yevgen Voronenko and Marc Moreno Maza and Yuzhen
Xie",
title = "Abstract only: {SPIRAL}-generated modular {FFTs}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "2",
pages = "25--26",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838616",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In this poster we present the use of the SPIRAL system
(www.spiral.net) to generate code for modular Fast
Fourier Transforms (FFTs). SPIRAL is a library
generation system that automatically generates
platform-tuned implementations of digital signal
processing algorithms with an emphasis on fast
transforms. Currently, SPRIAL can generate highly
optimized fixed point and floating-point FFTs for a
variety of platforms including vectorization,
multi-threaded and distributed memory parallelization.
The code produced is competitive with the best
available code for these platforms and SPIRAL is used
by Intel for its IPP (Intel Performance Primitives) and
MKL (Math kernel Library) libraries.\par
The SPIRAL system uses a mathematical framework for
representing and deriving algorithms. Algorithms are
derived using rewrite rules and additional rules are
used to symbolically manipulate algorithms into forms
that take advantage of the underlying hardware. A
search engine with a feedback loop is used to tune
implementations to particular platforms. New transforms
are added by introducing new symbols and their
definition and new algorithms can be generated by
adding new rules.\par
We extended SPIRAL to generate algorithms for FFT
computation over finite fields. This addition required
adding a new data type, several new rules and a new
transform (ModDFT) definition. In addition, the
unparser (where code is generated) was extended so that
it can generate scalar and vectorized code for modular
arithmetic. With these enhancements, the SPRIAL
machinery can be applied to modular transforms that are
of interest to the computer algebra community. This
provides a framework for systematically optimizing
these transforms, utilizing vector and parallel
computation, and for automatically tuning them to
different platforms. In this poster we present
preliminary results from this exploration. We show that
the code generated by SPIRAL, with improved cache
locality and vectorization, is approximately ten times
faster than the modular FFT code in the modpn
library.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "172",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cha:2010:AOS,
author = "Yongjae Cha and Mark van Hoeij and Giles Levy",
title = "Abstract only: {Solving} linear recurrence relations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "2",
pages = "26--26",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838619",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We will present an implementation of several
algorithms for solving second order linear recurrence
relations. The algorithms are described in two papers
accepted at ISSAC 2010. Our implementation can find
Liouvillian solutions, as well as solutions written in
terms of values of special functions such as the 2F1
hypergeometric function, Bessel, Whittaker, Legendre,
Laguerre, etc.\par
We have done an automated search in Sloane's online
encyclopedia of integer sequences, to find sequences
that satisfy a second order recurrence. Our
implementation solves a large majority of such
recurrence relations. The papers and implementation are
available at
http://www.math.fsu.edu/~glevy/implementation.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "172",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fang:2010:AOS,
author = "Tingting Fang and Mark van Hoeij",
title = "Abstract only: {Solving} linear differential equations
by using descent",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "2",
pages = "26--26",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838618",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "For second order linear ordinary differential
equations with coefficients in C(x), we present an
algorithm to reduce, whenever possible, the equation to
an equation defined over a subfield of C(x). At the
moment, we have implemented 2-descent, which means that
if there exists a reduction to a subfield of index 2,
then we can find it. If n is the number of true
singularities, then 2-descent, if it exists, reduces
the number of true singularities to at most n/2 + 2. In
12 out of the 17 examples sent to us by Bostan and
Kauers, we found that repeated use of 2-descent reduced
their regular singular equation down to 3
singularities, which means that 2-descent allows us to
find 2F1-hypergeometric type solutions for about two
third's of their equations.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "172",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Youse:2010:AOB,
author = "Bryan Youse and B. David Saunders",
title = "Abstract only: {Bitslicing} with matrix algorithms
oblivious to the data compression",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "2",
pages = "26--26",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838617",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Bitslicing is a data compression technique useful for
fast exact linear algebra over finite fields whose
elements are significantly smaller than a single
machine word. It involves striping the number of bits
used to represent field elements over the same number
of machine words. Thus, this data layout is maximally
storage-efficient. We showcase the computational
advantages. We also discuss practical challenges which
arise when employing this scheme on large matrices and
their sub-matrices over GF(3) with algorithms written
to work generically with matrices over GF(q), for any
q.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "172",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Haftmann:2010:CBP,
author = "Florian Haftmann and Cezary Kaliszyk and Walther
Neuper",
title = "{CTP}-based programming languages?: considerations
about an experimental design",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "2",
pages = "27--41",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838621",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This paper discusses plans for joint work in order to
gain early feedback from the community. Three lines of
work pursued independently so far shall be joined: (1)
narrowing the gap between declarative program
specification and program generation already working in
Isabelle, (2) reusing work, which embedded an
input-response-loop resembling Computer Algebra Systems
(CAS) into HOL Light, and (3) reconstructing an
experimental language for applied mathematics by
exploiting established as well as emerging features of
Isabelle/Isar.\par
These plans have to be seen as part of a variety of
highly active research areas -- on 'integration of the
deduction and the computational power' of Computer
Theorem Proving (CTP) and CAS respectively
(Calculemus), on 'innovative theoretical and
technological solutions for content-based systems'
(MKM), on 'Programming Languages for Mechanized
Mathematics Systems' (PLMMS), just to cite from some
related interest groups. Facing the abundant variety of
approaches, of intermediate results and of ongoing
developments, and taking under consideration the many
difficulties in integrating such approaches, we pursue
pragmatic goals: Design a component indispensable for
working engineers, a programming language for
engineering applications. Use Isabelle for an
experimental embedding of the language, which is useful
at least in engineering education as soon as
possible.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "172",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lefevre:2010:LTL,
author = "Vincent Lef{\'e}vre and Philippe Th{\'e}veny and
Florent de Dinechin and Claude-Pierre Jeannerod and
Christophe Mouilleron and David Pfannholzer and
Nathalie Revol",
title = "{LEMA}: towards a language for reliable arithmetic",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "2",
pages = "41--52",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838622",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Generating certified and efficient numerical codes
requires information ranging from the mathematical
level to the representation of numbers. Even though the
mathematical semantics can be expressed using the
content part of MathML, this language does not
encompass the implementation on computers. Indeed
various arithmetics may be involved, like
floating-point or fixed-point, in fixed precision or
arbitrary precision, and current tools do not handle
all of these.\par
Therefore we propose in this paper LEMA (Langage pour
les Expressions Math'ematiques Annot'ees), a
descriptive language based on MathML with additional
expressiveness. LEMA will be used during the automatic
generation of certified numerical codes. Such a
generation process typically involves several steps,
and LEMA would thus act as a glue to represent and
store the information at every stage.\par
First, we specify in the language the characteristics
of the arithmetic as described in the IEEE 754
floating-point standard: formats, exceptions, rounding
modes. This can be generalized to other arithmetics.
Then, we use annotations to attach a specific
arithmetic context to an expression tree. Finally,
considering the evaluation of the expression in this
context allows us to deduce several properties on the
result, like being exact or being an exception. Other
useful properties include numerical ranges and error
bounds.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "172",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Autexier:2010:RDM,
author = "Serge Autexier and Dominik Dietrich",
title = "Recent developments in {Mega}'s proof search
programming language",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "2",
pages = "52--59",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838623",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "172",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{DeFeo:2010:TLAa,
author = "Luca {De Feo} and Eric Schost",
title = "{{\tt transalpyne}}: a language for automatic
transposition",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "2",
pages = "59--71",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838624",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We present here transalpyne, a scripting language, to
be executed on top of a computer algebra system, that
is specifically conceived for automatic transposition
of linear functions. Its type system is able to
automatically infer all the possible linear functions
realized by a computer program. The key feature of
transalpyne is its ability to transform a computer
program computing a linear function in another computer
program computing the transposed linear function. The
time and space complexity of the resulting program are
similar to the original ones.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "172",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bulygin:2010:AOP,
author = "Stanislav Bulygin",
title = "Abstract only: {Polynomial} system solving for
decoding linear codes and algebraic cryptanalysis
parametric polynomial system discussion: canonical
comprehensive",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "2",
pages = "72--72",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838626",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This book that represents the author's Ph. D. thesis
is devoted to applying symbolic methods to the problems
of decoding linear codes and of algebraic
cryptanalysis. The paradigm we employ here is as
follows. We reformulate the initial problem in terms of
systems of polynomial equations over a finite field.
The solution(s) of such systems should yield a way to
solve the initial problem. Our main tools for handling
polynomials and polynomial systems in such a paradigm
is the technique of Gr{\"o}bner bases and normal form
reductions.\par
The first part of the book is devoted to formulating
and solving specific polynomial systems that reduce the
problem of decoding linear codes to the problem of
polynomial system solving. We analyze the existing
methods (mainly for the cyclic codes) and propose an
original method for arbitrary linear codes that in some
sense generalizes the Newton identities method widely
known for cyclic codes. We investigate the structure of
the underlying ideals and show how one can solve the
decoding problem -- both the so-called bounded decoding
and more general nearest codeword decoding -- by
finding reduced Gr{\"o}bner bases of these ideals. The
main feature of the method is that unlike usual methods
based on Gr{\"o}bner bases for 'finite field'
situations, we do not add the so-called field
equations. This tremendously simplifies the underlying
ideals, thus making feasible working with quite large
parameters of codes. Further we address complexity
issues, by giving some insight to the Macaulay matrix
of the underlying systems. By making a series of
assumptions we are able to provide an upper bound for
the complexity coefficient of our method. We address
also finding the minimum distance and the weight
distribution. We provide solid experimental material
and comparisons with some of the existing methods in
this area.\par
In the second part we deal with the algebraic
cryptanalysis of block iterative ciphers. Namely, we
analyze the small-scale variants of the Advanced
Encryption Standard (AES), which is a widely used
modern block cipher. Here a cryptanalyst composes the
polynomial systems which solutions should yield a
secret key used by communicating parties in a symmetric
cryptosystem. We analyze the systems formulated by
researchers for the algebraic cryptanalysis, and
identify the problem that conventional systems have
many auxiliary variables that are not actually needed
for the key recovery. Moreover, having many such
auxiliary variables, specific to a given
plaintext/ciphertext pair, complicates the use of
several pairs which is common in cryptanalysis. We thus
provide a new system where the auxiliary variables are
eliminated via normal form reductions. The resulting
system in key-variables only is then solved. We present
experimental evidence that such an approach is quite
good for small scaled ciphers. We investigate further
our approach and employ the so-called
meet-in-the-middle principle to see how far one can go
in analyzing just 2--3 rounds of scaled ciphers.
Additional 'tuning techniques' are discussed together
with experimental material. Overall, we believe that
the material of this part of the thesis makes a step
further in algebraic cryptanalysis of block
ciphers.\par
A short description of the thesis is on the KLUDO
webpage:
http://kluedo.ub.uni-kl.de/volltexte/2009/2350/.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "172",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2010:AIT,
author = "Anonymous",
title = "Abstracts of invited talks, contributed posters, and
software demos at the {East Coast Computer Algebra Day
2010}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "2",
pages = "??--??",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838609",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "172",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2010:ARDa,
author = "Anonymous",
title = "Abstracts of recent doctoral dissertations in computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "2",
pages = "??--??",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838604",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "172",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2010:ARDb,
author = "Anonymous",
title = "Abstracts of recent doctoral dissertations in computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "2",
pages = "??--??",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838625",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "172",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2010:ETP,
author = "Anonymous",
title = "Emerging trends papers accepted for {PLMMS 2010}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "2",
pages = "??--??",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838620",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "172",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2010:INJ,
author = "Anonymous",
title = "Issue 172 number 2, {June 2010}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "2",
pages = "??--??",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838607",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "172",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2010:INM,
author = "Anonymous",
title = "Issue 171 number 1, {March 2010}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "2",
pages = "??--??",
month = jun,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1838599.1838601",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 2 13:47:24 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "172",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gheffar:2010:LDD,
author = "A. Gheffar",
title = "Linear differential, difference and $q$-difference
homogeneous equations having no rational solutions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "78--83",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940525",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Some changes of the traditional scheme for finding
rational solutions of linear differential, difference
and q-difference homogeneous equations with rational
coefficients are proposed. In many cases these changes
allow one to predict the absence of rational solutions
in an early stage of the computation.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Antritter:2010:EAC,
author = "Felix Antritter and Johannes Middeke",
title = "An efficient algorithm for checking hyper-regularity
of matrices",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "84--86",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940477",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Arnon:2010:PIM,
author = "Dennis S. Arnon",
title = "A product information management system as a workbench
for quantifier elimination computations with {QEPCAD}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "87--88",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940478",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We report on the use of a Product Information
Management system as a convenient front end for
invoking and monitoring Quantifier Elimination
computations by the QEPCAD program, and for
user-friendly storage and analysis of accumulated
outputs.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Arnold:2010:FRA,
author = "Andrew Arnold and Michael Monagan",
title = "A fast recursive algorithm for computing cyclotomic
polynomials",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "89--90",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940479",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bachler:2010:TDA,
author = "Thomas B{\"a}chler and Vladimir Gerdt and Markus
Lange-Hegermann and Wilhelm Plesken and Daniel
Robertz",
title = "{Thomas} decomposition and its applications",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "91--92",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940480",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bermejo:2010:ACW,
author = "Isabel Bermejo and Ignacio Garc{\'\i}a-Marco",
title = "An algorithm for checking whether a simplicial toric
ideal is a complete intersection",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "93--94",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940481",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Blumlein:2010:SSA,
author = "Johannes Bl{\"u}mlein and Sebastian Klein and Carsten
Schneider and Flavia Stan",
title = "A symbolic summation approach to {Feynman} integrals",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "95--96",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940482",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Chen:2010:CCM,
author = "Changno Chen and Marc Moreno Maza and Yuzhen Xie",
title = "Cache complexity and multicore implementation for
univariate real root isolation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "97--98",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940483",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Isolating the real roots of a univariate polynomial is
a driving subject in computer algebra. This problem has
been studied under various angles from algebraic
algorithms [1, 2, 7] to implementation techniques [3,
5]. Today, multicores are the most popular parallel
hardware architectures. Beside, understanding the
implications of hierarchical memory on performance
software engineering has become essential. These
observations motivate our study. We analyze the cache
complexity of the core routine of many real root
isolation algorithms namely, the Taylor shift. Then, we
present efficient multithreaded implementation on
multicores.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Chowdhury:2010:CPR,
author = "Muhammad F. I. Chowdhury and Marc Moreno Maza and Wei
Pan and {\'E}ric Schost",
title = "Complexity and performance results for non {FFT}-based
univariate polynomial multiplication",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "99--100",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940484",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Today's parallel hardware architectures and computer
memory hierarchies enforce revisiting fundamental
algorithms which were often designed with algebraic
complexity as the main complexity measure and with
sequential running time as the main performance
counter. This study is devoted to two algorithms for
univariate polynomial multiplication algorithms that
are independent of the coefficient ring: the plain and
the Toom--Cook univariate multiplications. We analyze
their cache complexity and report on their parallel
implementations in Cilk++.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cuyt:2010:RST,
author = "Annie Cuyt and Wen-shin Lee",
title = "Reconstructing sparse trigonometric functions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "101--102",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940485",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Dahan:2010:ALT,
author = "Xavier Dahan and Marc Moreno Maza and {\'E}ric Schost
and Adrien Poteaux",
title = "Almost linear time operations with triangular sets",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "103--104",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940486",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{DeFeo:2010:TLAb,
author = "Luca {De Feo} and {\'E}ric Schost",
title = "{{\tt transalpyne}}: a language for automatic
transposition",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "105--106",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940487",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Drevet:2010:OTS,
author = "Charles {\'E}ric Drevet and Md. Nazrul Islam and
{\'E}ric Schost",
title = "Optimization techniques for small matrix
multiplication",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "107--108",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940488",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We tabulate improved costs for the multiplication of
matrices of small size, up to 30. Following previous
work by Probert {\&}Fisc her [5], Smith [4], and
Mezzarobba [2], we base our approach on previous
algorithms for small matrices due to Strassen,
Winograd, Pan, Laderman, \ldots{} and show how to
exploit these standard algorithms in an improved way.
We illustrate the use of our results by generating
multiplication code for various rings, such as
integers, polynomials, differential operators or linear
recurrence operators.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Erocal:2010:NCR,
author = "Bur{\c{c}}in Er{\"o}cal and Arne Storjohann",
title = "Nullspace computation over rational function fields
for symbolic summation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "109--110",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940489",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Haque:2010:CFS,
author = "Sardar Anisul Haque and Shahadat Hossain and M. Moreno
Maza",
title = "Cache friendly sparse matrix-vector multiplication",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "111--112",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940490",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Sparse matrix-vector multiplication or SpMxV is an
important kernel in scientific computing. For example,
in the conjugate gradient method, where SpMxV is the
main computational step. Though the total number of
arithmetic operations in SpMxV is fixed, reducing the
probability of cache misses per operation is still a
challenging area of research. In this work, we present
a new column ordering algorithm for sparse matrices. We
analyze the cache complexity of SpMxV when A is ordered
by our technique. The numerical experiments, with very
large test matrices, clearly demonstrate the
performance gains rendered by our proposed technique.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Heinle:2010:FPG,
author = "Albert Heinle and Viktor Levandovskyy",
title = "Factorization of polynomials in {$Z$}-graded skew
polynomial rings",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "113--114",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940491",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hellstrom:2010:VVI,
author = "Christian Hellstr{\"o}m",
title = "{VarInt}: variational integrator design with {Maple}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "115--115",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940492",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Geometric numerical integration refers to a class of
numerical integration algorithms that preserve the
differential geometric structure that defines the
evolution of dynamical systems. For simulations over
relatively short time spans, as compared to the
intrinsic time scales, standard (non-geometric)
integrators are often advantageous, as they include
adaptive and multistep methods, which can be both
accurate and fast. Extended computations require a
different, geometric approach, as non-geometric methods
tend to generate or dissipate energy artificially due
to the fact that they do not respect the fundamental
geometry of the phase flow, which means that at some
point the errors dominate. It is common to create
geometric numerical integrators based on either
previous knowledge of classes of non-geometric
numerical integrators, from which specific instances
can be derived that are geometric, or truncated series
solutions to the Hamilton--Jacobi equation for
(canonical) transformations near the identity.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Javadi:2010:SIF,
author = "Seyed Mohammad Mahdi Javadi and Michael Monagan",
title = "On sparse interpolation over finite fields",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "116--117",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940493",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kohl:2010:IMB,
author = "Karen T. Kohl",
title = "An implementation of the method of brackets for
symbolic integration",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "118--119",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940494",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In spite of being a classical problem, the current
techniques available for Symbolic Integration are not
sufficient to evaluate a variety of integrals coming
from Mathematical Physics, such as Bessel functions.
The Method of Brackets [2, 3], a heuristic process
appearing in the evaluation of Feynman diagrams, can be
used to evaluate symbolically a large class of single
or multiple integrals. It represents an extension of
the so-called Ramanujan Master Theorem [1]. The first
implementation of the Method of Brackets has been
written by the author in the open-source computer
algebra system Sage. This implementation allows
experimentation with representations of the integrand,
which can affect output and efficiency.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Korporal:2010:MPI,
author = "Anja Korporal and Georg Regensburger and Markus
Rosenkranz",
title = "A {Maple} package for integro-differential operators
and boundary problems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "120--122",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940495",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lee:2010:CAD,
author = "Jae Hee Lee",
title = "Cylindrical algebraic decomposition for reasoning
about qualitative spatial knowledge",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "123--124",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940496",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Levandovskyy:2010:NCS,
author = "Viktor Levandovskyy",
title = "Non-commutative subsystems of {{\sc Singular}}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "125--126",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940497",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We describe the state-of-the-art of non-commutative
subsystems of computer algebra system Singular, both
already released and under preparations for release.
The classes of algebras, functionality over them,
primary application fields of subsystems are explained
in details.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Moritsugu:2010:RCI,
author = "Shuichi Moritsugu",
title = "Radius computation for an inscribed pentagon in
{Sanpou-Hakki} (1690)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "127--128",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940498",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Murakami:2010:SRC,
author = "Hiroshi Murakami",
title = "{Sturm} root counting using {Chebyshev} expansion",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "129--131",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940499",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The Sturm's root counting method by the floating point
calculation was studied to solve real roots of a real
algebraic equation of high degree. To reduce the
effects of round-off errors, polynomials are
represented by the coefficients of Chebyshev
polynomials instead of monomials. In the Sturm sequence
calculation, the quotients are stored instead of
remainders. The values of remainders at a given
abscissa to count their sign variations are calculated
from the stored sequence of quotients. This approach
reduces the space and the number of arithmetic
operations. Some experiments was made using the FP
numbers.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Phisanbut:2010:GBC,
author = "Nalina Phisanbut and Russell J. Bradford and James H.
Davenport",
title = "Geometry of branch cuts",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "132--135",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940500",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Rueda:2010:LDI,
author = "Sonia L. Rueda",
title = "Linear differential implicitization and differential
resultants",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "136--137",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940501",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Given a system P of n linear ordinary differential
polynomial parametric equations (linear DPPEs) in n-1
differential parameters, we proved in [2] that if
nonzero a differential resultant gives the implicit
equation of P. Differential resultants often vanish
under specialization, which prevented us from giving an
implicitization algorithm in [2]. Motivated by Canny's
method and its generalizations we consider now a linear
perturbation of P and use it to give an algorithm to
decide if the dimension of the implicit ideal of P is
n-1 and in the affirmative case obtain the implicit
equation of P. This poster presentation will contain
this development together with examples illustrating
the results.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Saouter:2010:HCA,
author = "Yannick Saouter",
title = "Heuristics for {Cannon}'s algorithm with an
application to {Lyons} sporadic group",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "138--139",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940502",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This article is devoted to describing heuristics to
improve the efficiency of Cannon's algorithm. As an
application, the method is used to derive a new
presentation for the Lyons sporadic group.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Saouter:2010:FIC,
author = "Yannick Saouter and G{\'e}rald {Le Mestre}",
title = "A {FPGA} implementation of {Chen}'s algorithm",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "140--141",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940503",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This article is devoted to describing an
implementation of Chen's algorithm on FPGA. This
algorithm allows the computation of minimum distance of
cyclic codes. As an application, we determine the
minimum distance of quadratic residue codes of length
223.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sasaki:2010:CFP,
author = "Tateaki Sasaki and Fujio Kako",
title = "Computing floating-point {Gr{\"o}bner} bases
accurately",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "142--143",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940504",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We propose a new method for floating-point Gr{\"o}bner
basis computation. The idea is to improve the
accuracies of the coefficients of polynomials of
intermediate bases computed by our previous method, by
reducing coefficient matrices by Gaussian
elimination.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Schlomiuk:2010:ISC,
author = "Dana Schlomiuk and Nicolae Vulpe",
title = "Invariants and symbolic calculations in the theory of
quadratic differential systems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "144--146",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940505",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "While quadratic differential systems intervene in many
areas of applied mathematics and they also have
theoretical importance, the topological classification
of this class remains an extremely hard problem.
However, in recent years much progress has been
achieved due to the use of computer algebra and
numerical calculations for obtaining complete
classifications of some families of quadratic systems
by effectively computing polynomial invariants and by
an interplay between computer algebra and numerical
computations. We illustrate on a specific family how
these techniques yield the complete classification of
the family within the 12-dimensional space of the
coefficients of the systems.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sekigawa:2010:SBP,
author = "Hiroshi Sekigawa and Kiyoshi Shirayanagi",
title = "Solvability of bivariate polynomial systems under
perturbation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "147--148",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940506",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Shemyakova:2010:IDT,
author = "Ekaterina Shemyakova",
title = "{$X$}- and {$Y$}-invariants for {Darboux}
transformations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "149--150",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940507",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Studzinski:2010:CDN,
author = "Grischa Studzinski",
title = "Computation of dimensions of non-commutative
algebras",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "151--152",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940508",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Terui:2010:GIM,
author = "Akira Terui",
title = "{GPGCD}, an iterative method for calculating
approximate {GCD}, for multiple univariate
polynomials",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "153--155",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940509",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Johnson:2010:ARD,
author = "Jeremy Johnson",
title = "Abstracts of recent doctoral dissertations in computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "155--155",
month = sep,
year = "2010",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Stan:2010:ASF,
author = "Flavia Stan",
title = "Algorithms for special functions: computer algebra and
analytical aspects",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "156--157",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940511",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bardavid:2010:DSG,
author = "Colas Bardavid",
title = "Differential schemes: geometric approach and
functorial approach",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "3",
pages = "157--159",
month = sep,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940512",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This thesis focuses on the theory --- still under
construction --- of differential schemes. The aim of
our work is to provide two new perspectives to this
theory. The first perspective is geometric and consists
in considering schemes endowed with vector fields
instead of differential rings. In this context, we
define what is a leaf and what is the trajectory of a
point. With the help of these tools, we reinvest and
generalize some results of differential Galois theory.
Similarly, we show that the Carr{\`a} Ferro sheaf is
the natural sheaf of the space of leaves of a scheme
with vector field.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "173",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Steffy:2010:ESL,
author = "Daniel E. Steffy",
title = "Exact solutions to linear systems of equations using
output sensitive lifting",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "4",
pages = "160--182",
month = dec,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940513",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Many methods have been developed to symbolically solve
systems of linear equations over the rational numbers.
A common approach is to use p-adic lifting or iterative
refinement to build a modular or approximate solution,
then apply rational number reconstruction. An upper
bound can be computed on the number of iterations these
algorithms must perform before applying rational
reconstruction. In practice such bounds can be
conservative. Output sensitive lifting is the technique
of performing rational reconstruction at intermediate
steps of the algorithm and verifying correctness which
allows the possibility of early termination when the
solution size is small. In this paper we show how using
an appropriate output sensitive lifting strategy can
improve several algorithms.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "174",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cha:2010:SLR,
author = "Yongjae Cha and Mark van Hoeij and Giles Levy",
title = "Solving linear recurrence equations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "4",
pages = "183--185",
month = dec,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940515",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The software is an implementation of the algorithms in
[1], [2], and [3]. The main algorithm from [3] is
implemented with additional base equations beyond what
appear in [3] and is incorporated into [4]. Common to
each algorithm is a transformation from a base equation
to the input using transformations that preserve order
and homogeneity (referred to as gt-transformations).",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "174",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Effenberger:2010:SGT,
author = "Felix Effenberger and Jonathan Spreer",
title = "{{\tt simpcomp}}: a {GAP} toolbox for simplicial
complexes",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "4",
pages = "186--189",
month = dec,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940516",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "simpcomp [4] is an extension (a so called package) to
GAP [6], the well known system for computational
discrete algebra. The package enables the user to
compute numerous properties of (abstract) simplicial
complexes, provides functions to construct new
complexes from existing ones and an extensive library
of triangulations of manifolds. For an introduction to
the field of piecewise linear (PL) topology see the
books [16] and [11]. The authors acknowledge support by
the DFG: simpcomp has partly been developed within the
DFG projects Ku 1203/5-2 and Ku 1203/5-3.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "174",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Erocal:2010:SFT,
author = "Bur{\c{c}}in Er{\"o}cal",
title = "Summation in finite terms using {{\tt sage}}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "4",
pages = "190--193",
month = dec,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940517",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "174",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gastineau:2010:TCA,
author = "Micka{\"e}l Gastineau and Jacques Laskar",
title = "{TRIP}: a computer algebra system dedicated to
celestial mechanics and perturbation series",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "4",
pages = "194--197",
month = dec,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940518",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "TRIP is an interactive computer algebra system that is
devoted to perturbation series computations, and
specially adapted to celestial mechanics. Its
development started in 1988, as an upgrade of the
special purpose FORTRAN routines elaborated by J.
Laskar for the demonstration of the chaotic behavior of
the Solar System. TRIP is now a mature and efficient
tool for handling multivariate generalized power
series, and contains also a numerical kernel. A limited
version of TRIP is freely available on the WEB at
www.imcce.fr/trip.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "174",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hodorog:2010:GLG,
author = "M{\u{a}}d{\u{a}}lina Hodorog and Bernard Mourrain and
Josef Schicho",
title = "{GENOM3CK}: a library for genus computation of plane
complex algebraic curves using knot theory",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "4",
pages = "198--200",
month = dec,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940519",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We report on a library for computing the genus of a
plane complex algebraic curve using knot theory. The
library also computes other type of information about
the curve, such as for instance: the set of
singularities of the curve, the topological type
(algebraic link) of each singularity, the Alexander
polynomial of each algebraic link, the delta-invariant
of each singularity, etc. Using the algebraic geometric
modeler called Axel [1], we integrate symbolic, numeric
and graphical capabilities into a single library, which
we call GENOM3CK [3].",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "174",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Barakat:2010:LLC,
author = "Mohamed Barakat and Markus Lange-Hegermann",
title = "{LocalizeRingForHomalg}: localize commutative rings at
maximal ideals",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "4",
pages = "201--204",
month = dec,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940520",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The objective of this software presentation is to
demonstrate a means of homological computation of
finitely presented modules over a commutative ring R
localized at a maximal ideal m. This can be achieved by
a reduction of the problem of solving linear systems
over Rm to the same problem over R. An implementation
in the GAP-package LocalizeRingForHomalg exists as a
part of the homalg project.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "174",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Monagan:2010:SPM,
author = "Michael Monagan and Roman Pearce",
title = "Sparse polynomial multiplication and division in
{Maple 14}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "4",
pages = "205--209",
month = dec,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940521",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/magma.bib;
https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We demonstrate new routines for sparse multivariate
polynomial multiplication and division over the
integers that we have integrated into Maple 14 through
the expand and divide commands. These routines are
currently the fastest available, and the multiplication
routine is parallelized with superlinear speedup. The
performance of Maple is significantly improved. We
describe our polynomial data structure and compare it
with Maple's. Then we present benchmarks comparing
Maple 14 with Maple 13, Magma, Mathematica, Singular,
Pari, and Trip.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "174",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{SCIE:2010:SCS,
author = "{The SCIEnce project}",
title = "Symbolic computation software composability protocol
and its implementations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "4",
pages = "210--212",
month = dec,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940522",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "174",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{SCIE:2010:SPP,
author = "{The SCIEnce project}",
title = "{SymGrid-Par}: parallel orchestration of symbolic
computation systems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "4",
pages = "213--216",
month = dec,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940523",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "174",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Verschelde:2010:PHC,
author = "Jan Verschelde",
title = "Polynomial homotopy continuation with {PHCpack}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "44",
number = "4",
pages = "217--220",
month = dec,
year = "2010",
CODEN = "????",
DOI = "https://doi.org/10.1145/1940475.1940524",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Mar 31 10:24:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "PHCpack is a software package to solve polynomial
systems via homotopy continuation methods. In the last
twenty years (since the start of the development of
PHCpack), the notion of solving a polynomial system by
PHCpack evolved from approximating all isolated complex
solutions for systems with as many equations as
variables into providing tools for a numerical
irreducible decomposition. This document provides the
outline for a software demonstration highlighting
recent additions to the software, such as accepting
polynomials with negative exponents and sweeping for
real points that lie isolated on complex solution
curves.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "174",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lichtblau:2011:SDI,
author = "Daniel Lichtblau",
title = "Symbolic definite (and indefinite) integration:
methods and open issues",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "1",
pages = "1--16",
month = mar,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016569",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The computation of definite integrals presents one
with a variety of choices. There are various methods
such as Newton--Leibniz or Slater's convolution method.
There are questions such as whether to split or merge
sums, how to search for singularities on the path of
integration, when to issue conditional results, how to
assess (possibly conditional) convergence, and more.
These various considerations moreover interact with one
another in a multitude of ways. Herein we discuss these
various issues and illustrate with examples.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "175",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "algorithmic integration; Mathematica; {\tt MeijerG[]}
function",
}
@Article{Corless:2011:RCA,
author = "Robert Corless and Erik Postma and David R.
Stoutemyer",
title = "Rounding coefficients and artificially underflowing
terms in non-numeric expressions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "1",
pages = "17--48",
month = mar,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016570",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This article takes an analytical viewpoint to address
the following questions: 1. How can we justifiably
beautify an input or result sum of non-numeric terms
that has some approximate coefficients by deleting some
terms and/or rounding some coefficients to simpler
floating-point or rational numbers? 2. When we add two
expressions, how can we justifiably delete more
non-zero result terms and/or round some result
coefficients to even simpler floating-point, rational
or irrational numbers? The methods considered in this
paper provide a justifiable scale-invariant way to
attack these problems for subexpressions that are
multivariate sums of monomials with real exponents.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "175",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
keywords = "floating-point arithmetic; rounding; symbolic
algebra",
}
@Article{Robertson:2011:ACH,
author = "Aaron Robertson and Vince Vatter and Gizel Maimon and
Qing-Hu Hou",
title = "Abstracts of conferences in honor of {Doron
Zeilberger}'s 60th birthday",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "1",
pages = "49--61",
month = mar,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016571",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "175",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Johnson:2011:ARDa,
author = "Jeremy Johnson",
title = "Abstracts of recent doctoral dissertations in computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "1",
pages = "62--62",
month = mar,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016572",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "175",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Eder:2011:MFF,
author = "Christian Eder and Justin Gash and John Perry",
title = "Modifying {Faug{\`e}re}'s {F5} algorithm to ensure
termination",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "70--89",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016574",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The structure of the F5 algorithm to compute
Gr{\``o}bner bases makes it very efficient. However, it
is not clear whether it terminates for all inputs, not
even for ''regular sequences``. This paper has two
major parts. In the first part, we describe in detail
the difficulties related to a proof of termination. In
the second part, we explore three variants that ensure
termination. Two of these have appeared previously in
dissertations, and ensure termination by checking for a
Gr{\''o}bner basis using traditional criteria. The
third variant, F5+, identifies a degree bound using a
distinction between ``necessary'' and ``redundant''
critical pairs that follows from the analysis in the
first part.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Salvy:2011:PFF,
author = "Bruno Salvy and Bob Sedgewick and Michele Soria and
Wojciech Szpankowski and Brigitte Vallee",
title = "{Philippe Flajolet}: the father of analytic
combinatorics",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "90--91",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016575",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Almkvist:2011:RLF,
author = "Gert Almkvist",
title = "{Ramanujan}-like formulas for $ 1 / \pi^2 $ and String
Theory [abstract only]",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "92--92",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016576",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Sep 01 12:20:20 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "To appear in Proceedings of WWCA 2011.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
remark = "The new formula can be used to compute an arbitrary
{\em decimal digit\/} of $ 1 / \pi^2 $ without
computing earlier digits.",
}
@Article{Kotsireas:2011:AWH,
author = "Ilias Kotsireas and Eugene Zima",
title = "Abstracts of {WWCA 2011} in honor of {Herb Wilf}'s
80th birthday",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "92--99",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016576",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{May:2011:ECC,
author = "John May",
title = "{East Coast Computer Algebra Day 2011} abstracts",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "100--106",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016577",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Salem:2011:PCE,
author = "Fatima K. Abu Salem",
title = "Parallel and cache-efficient {Hensel} lifting",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "107--108",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016579",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Boady:2011:SCS,
author = "Mark Boady and Pavel Grinfeld and Jeremy Johnson",
title = "A symbolic computation system for the calculus of
moving surfaces",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "109--110",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016580",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bostan:2011:FCC,
author = "Alin Bostan and Fr{\'e}d{\'e}ric Chyzak and Ziming Li
and Bruno Salvy",
title = "Fast computation of common left multiples of linear
ordinary differential operators",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "111--112",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016581",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Chowdhury:2011:RLT,
author = "Muhammad F. I. Chowdhury and Romain Lebreton",
title = "Root lifting techniques and applications to list
decoding",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "113--114",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016582",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Motivated by Guruswami and Rudra's construction of
folded Reed--Solomon codes, we give algorithms to solve
functional equations of the form $ Q(x, f(x), f(x)) = 0
$, where $Q$ is a trivariate polynomial. We compare two
approaches, one based on Newton's iteration and the
second using relaxed series techniques.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Chatterji:2011:CEG,
author = "Samaresh Chatterji and Ratnik Gandhi",
title = "Computing equilibria with group actions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "115--116",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016583",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Islam:2011:CQC,
author = "Md. Nazrul Islam and A. Poteaux",
title = "Connectivity queries on curves in {$ R_n $}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "117--118",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016584",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kai:2011:CIS,
author = "Hiroshi Kai and Shigenobu Inoue",
title = "Cheater identification on a secret sharing scheme
using {GCD}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "119--120",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016585",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "A method to identify cheaters on the Shamir's (k, n)
threshold secret sharing scheme is proposed using
rational interpolation. When a rational interpolant is
computed for $l$ shares $ D_i, i = 1, \ldots {}, l$,
where $ l = k + 2 s$, then $s$ unattainable points of
the rational interpolant may identify $s$ cheaters. The
cheaters can be computed by GCD of the numerator
polynomial and the denominator polynomial.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kesh:2011:SAH,
author = "Deepanjan Kesh and Shashank K. Mehta",
title = "A saturation algorithm for homogeneous binomial
ideals",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "121--122",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016586",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Koukouvinos:2011:AFE,
author = "Christos Koukouvinos and Dimitris E. Simos and
Zafeirakis Zafeirakopoulos",
title = "An algebraic framework for extending orthogonal
designs",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "123--124",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016587",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Li:2011:APF,
author = "Yue Li and Gabriel {Dos Reis}",
title = "An automatic parallelization framework for
{OpenAxiom}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "125--126",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016588",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Maza:2011:SBP,
author = "Marc Moreno Maza and Wei Pan",
title = "Solving bivariate polynomial systems on a {GPU}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "127--128",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016589",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Maza:2011:IMM,
author = "Marc Moreno Maza and Paul Vrbik",
title = "Inverting matrices modulo regular chains",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "129--130",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016590",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sekigawa:2011:IRZ,
author = "Hiroshi Sekigawa and Kiyoshi Shirayanagi",
title = "Isolated real zero of a real polynomial system under
perturbation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "131--132",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016591",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Raab:2011:IFT,
author = "Clemens G. Raab",
title = "Integration in finite terms of non-{Liouvillian}
functions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "133--134",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016592",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Rahkooy:2011:URI,
author = "Hamid Rahkooy and Zafeirakis Zafeirakopoulos",
title = "Using resultants for inductive {Gr{\"o}bner} bases
computation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "135--136",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016593",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wiesinger-Widi:2011:GBG,
author = "Manuela Wiesinger-Widi",
title = "{Gr{\"o}bner} bases and generalized {Sylvester}
matrices",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "137--138",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016594",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Zengler:2011:NAB,
author = "Christoph Zengler and Andreas K{\"u}bler and Wolfgang
K{\"u}chlin",
title = "New approaches to {Boolean} quantifier elimination",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "139--140",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016595",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We present four different approaches for existential
Boolean quantifier elimination, based on model
enumeration, resolution, knowledge compilation with
projection, and substitution. We point out possible
applications in the area of verification and we present
preliminary benchmark results of the different
approaches.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Zengler:2011:BGB,
author = "Christoph Zengler and Wolfgang K{\"u}chlin",
title = "{Boolean} {Gr{\"o}bner} bases in {SAT} solving",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "141--142",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016596",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We want to incorporate the reasoning power of Boolean
Gr{\``o}bner bases into modern SAT solvers. There are
many starting points where to plug in the Gr{\''o}bner
bases engine in the SAT solving process. As a first
step we chose the learning part where new consequences
(lemmas) of the original formula are deduced. This
paper shows first promising results, also published at
the CASC 2010 in Armenia [1].",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Johnson:2011:ARDb,
author = "Jeremy Johnson",
title = "Abstracts of recent doctoral dissertations in computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "2",
pages = "143--145",
month = jun,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2016567.2016597",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Aug 17 08:55:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "176",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Trinks:2011:BMS,
author = "Wolfgang Trinks",
title = "On {Buchberger}'s method of solving systems of
algebraic equations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "3--4",
pages = "150--161",
month = sep,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2110170.2110172",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jan 26 16:43:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "An algorithm of Bruno Buchberger's is extended to
polynomial rings over a Noetherian ring. In a
specialized version, it can be used for computing
elimination ideals. Over fields, it provides the
determination of the minimal prime ideals which contain
the given ideal, except that the primeness must be
proved with other methods. Estimates for computing time
are not given.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "177",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Terui:2011:ARW,
author = "Akira Terui",
title = "Abstracts from {RIMS} workshop on developments in
computer algebra research",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "3--4",
pages = "162--165",
month = sep,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2110170.2110173",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jan 26 16:43:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The RIMSWorkshop on Developments in Computer Algebra
Research (https://sites.google.com/site/dcar2010/) has
been held at Research Institute for Mathematical
Sciences, Kyoto University, Kyoto, Japan, on July 7--9,
2010. This workshop has been organized mainly for young
researchers of computer algebra in Japan (besides
another RIMS conference annually held that is one of
the most traditional one in computer algebra community
in Japan), for communicating new ideas, interaction
with other research areas and/or sharing resource of
research communications (including how to organize an
international conference, as shown below). We had two
invited talks as tutorials and 13 contributed talks
which contain various topics in mathematics, physical
and chemical sciences, engineering and informatics.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "177",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Chen:2011:CRS,
author = "Changbo Chen and James H. Davenport and Fran{\c{c}}ois
Lemaire and Marc Moreno Maza and Bican Xia and Rong
Xiao and Yuzhen Xie",
title = "Computing the real solutions of polynomial systems
with the {RegularChains} library in {Maple}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "3--4",
pages = "166--168",
month = sep,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2110170.2110174",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jan 26 16:43:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "177",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{DeLoera:2011:SEI,
author = "J. A. {De Loera} and B. Dutra and M. K{\"o}ppe and S.
Moreinis and G. Pinto and J. Wu",
title = "Software for exact integration of polynomials over
polyhedra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "3--4",
pages = "169--172",
month = sep,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2110170.2110175",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jan 26 16:43:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We are interested in quickly computing the exact value
of integrals of polynomial functions over domains that
are decomposable into convex polyhedra (e.g., a
tetrahedral or cubical mesh decomposition of space). We
describe a software implementation, part of the
software LattE, and provide benchmark computations.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "177",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Effenberger:2011:SBD,
author = "Felix Effenberger and Jonathan Spreer",
title = "Simplicial blowups and discrete normal surfaces in
{\tt simpcomp}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "3--4",
pages = "173--176",
month = sep,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2110170.2110176",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jan 26 16:43:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "simpcomp is an extension to GAP, the well known system
for computational discrete algebra. It allows the user
to work with simplicial complexes. In the latest
version, support for simplicial blowups and discrete
normal surfaces was added. Furthermore, new functions
for constructing certain infinite series of
triangulations have been implemented and interfaces to
other software packages have been improved to previous
versions.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "177",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Joswig:2011:DPC,
author = "Michael Joswig and Andreas Paffenholz",
title = "Defect polytopes and counter-examples with {\tt
polymake}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "3--4",
pages = "177--179",
month = sep,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2110170.2110177",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jan 26 16:43:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "It is demonstrated how the software system polymake
can be used for computations in toric geometry. More
precisely, counter-examples to conjectures related to
A-determinants and defect polytopes are constructed.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "177",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Montes:2011:SCG,
author = "Antonio Montes",
title = "Software for computing the {Gr{\"o}bner} cover of a
parametric ideal",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "3--4",
pages = "180--182",
month = sep,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2110170.2110178",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jan 26 16:43:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "177",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Raichev:2011:NSC,
author = "Alexander Raichev",
title = "New software for computing asymptotics of multivariate
generating functions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "3--4",
pages = "183--185",
month = sep,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2110170.2110179",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jan 26 16:43:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "I introduce amgf, a new Sage software package for
computing asymptotics of multivariate generating
functions. It implements recent algorithms developed by
Mark C. Wilson and me. The current version of amgf is
under peer review for incorporation into Sage and is
available from my website at
www.cs.auckland.ac.nz/~raichev/research.html.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "177",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{vanderHoeven:2011:MQM,
author = "Joris van der Hoeven and Gr{\'e}goire Lecerf and
Bernard Mourrain and Philippe Tr{\'e}buchet and
J{\'e}r{\'e}my Berthomieu and Daouda Niang Diatta and
Angelos Mantzaflaris",
title = "{Mathemagix}: the quest of modularity and efficiency
for symbolic and certified numeric computation?",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "3--4",
pages = "186--188",
month = sep,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2110170.2110180",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jan 26 16:43:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We describe the goals and architecture of the software
project Mathemagix, the main list of packages it
contains, the main characteristics of its programming
language, and connections with existing frontends.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "177",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Tec:2011:SFG,
author = "Loredana Tec",
title = "A symbolic framework for general polynomial domains in
{Theorema}: applications to boundary problems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "3--4",
pages = "189--189",
month = sep,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2110170.2110181",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jan 26 16:43:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "177",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Middeke:2011:CVN,
author = "Johannes Middeke",
title = "A computational view on normal forms of matrices of
{Ore} polynomials",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "3--4",
pages = "190--191",
month = sep,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2110170.2110182",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jan 26 16:43:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "177",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Stoutemyer:2011:WIC,
author = "David R. Stoutemyer",
title = "Ways to implement computer algebra compactly",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "3--4",
pages = "199--224",
month = sep,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2110170.2110184",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jan 26 16:43:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Computer algebra had to be implemented compactly to
fit on early personal computers and hand-held
calculators. Compact implementation is still important
for portable hand-held devices. Also, compact
implementation increases comprehensibility while
decreasing development and maintenance time and cost,
regardless of the platform. This article describes
several ways to achieve compact implementations,
including: Exploit evaluation followed by interpolation
to avoid implementing a parser, such as in
PicoMath{\trademark}. Use contiguous storage as an
expression stack to avoid garbage collection and
pointerspace overhead, such as in Calculus Demontm and
TI-Math-Engine.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "177",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Joyner:2011:OSC,
author = "David Joyner and Ond{\v{r}}ej {\v{C}}ert{\'\i}k and
Aaron Meurer and Brian E. Granger",
title = "Open source computer algebra systems: {SymPy}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "3--4",
pages = "225--234",
month = sep,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2110170.2110185",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jan 26 16:43:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This survey will look at SymPy, a free and open source
computer algebra system started in 2005 by the second
author (O.{\v{C}}.). It is written entirely in Python,
available from http://sympy.org. SymPy is licensed
under the ``modified BSD'' license, as is its beautiful
logo designed by Fredrik Johansson.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "177",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Joyner:2011:RDJ,
author = "David Joyner and Ondrej Cert{\'\i}k and Aaron Meurer
and Brian E. Granger",
title = "{Richard Dimick Jenks Memorial Prize 2011}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "3--4",
pages = "235--235",
month = sep,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2110170.2110186",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jan 26 16:43:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "177",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Heras:2011:MKM,
author = "J{\'o}nathan Heras",
title = "Mathematical knowledge management in algebraic
topology",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "3--4",
pages = "236--237",
month = sep,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2110170.2110187",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jan 26 16:43:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "177",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Mantzaflaris:2011:RAM,
author = "Angelos Mantzaflaris",
title = "Robust algebraic methods for geometric computing",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "3--4",
pages = "237--237",
month = sep,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2110170.2110188",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jan 26 16:43:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "177",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ngo:2011:RGS,
author = "L. X. Ch{\^a}u Ng{\^o}",
title = "Rational general solutions of first-order algebraic
{ODEs}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "3--4",
pages = "238--238",
month = sep,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2110170.2110189",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jan 26 16:43:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "177",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lubbes:2011:MFC,
author = "Nils Lubbes",
title = "Minimal families of curves on surfaces",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "3--4",
pages = "238--239",
month = sep,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2110170.2110190",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jan 26 16:43:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "177",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hodorog:2011:SNA,
author = "Madalina Hodorog",
title = "Symbolic-numeric algorithms for plane algebraic
curves",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "45",
number = "3--4",
pages = "239--240",
month = sep,
year = "2011",
CODEN = "????",
DOI = "https://doi.org/10.1145/2110170.2110191",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jan 26 16:43:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "177",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Davenport:2012:SAS,
author = "James H. Davenport",
title = "Small algorithms for small systems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "1--2",
pages = "1--9",
month = mar # "\slash " # jun,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2338496.2338498",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jul 26 19:06:13 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "178",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fitch:2012:JG,
author = "John Fitch",
title = "{James Griesmer 1929--2011}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "1--2",
pages = "10--11",
month = mar # "\slash " # jun,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2338496.2338499",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jul 26 19:06:13 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "178",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Zeilberger:2012:FWH,
author = "Doron Zeilberger",
title = "Farewell to {``W'' (Herbert Saul Wilf), a true
VISIONARY for whom EVERYTHING was INTERTWINED}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "1--2",
pages = "12--13",
month = mar # "\slash " # jun,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2338496.2338500",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jul 26 19:06:13 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "178",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Johnson:2012:ARDa,
author = "Jeremy Johnson",
title = "Abstracts of recent doctoral dissertations in computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "1--2",
pages = "14--16",
month = mar # "\slash " # jun,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2338496.2338501",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jul 26 19:06:13 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Each month we are pleased to present abstracts of
recent doctoral dissertations in Computer Algebra and
Symbolic Computation. We encourage all recent Ph.D.
graduates (and their supervisors), who have defended in
the past two years, to submit their abstracts for
publication in CCA. Please send abstracts to the CCA
editors \url{editors_SIGSAM@acm.org} for
consideration.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "178",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Stoutemyer:2012:SC,
author = "David R. Stoutemyer",
title = "Series crimes",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "1--2",
pages = "19--52",
month = mar # "\slash " # jun,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2338496.2338503",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jul 26 19:06:13 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Puiseux series are power series in which the exponents
can be fractional and/or negative rational numbers.
Several computer algebra systems have one or more
built-in or loadable functions for computing truncated
Puiseux series. Some are generalized to allow
coefficients containing functions of the series
variable that are dominated by any power of that
variable, such as logarithms and nested logarithms of
the series variable. Some computer algebra systems also
have built-in or loadable functions that compute
infinite Puiseux series. Unfortunately, there are some
little-known pitfalls in computing Puiseux series. The
most serious of these is expansions within branch cuts
or at branch points that are incorrect for some
directions in the complex plane. For example with each
series implementation accessible to you. Compare the
value of $ (z^2 + z^3)^{3 / 2} $ with that of its
truncated series expansion about $ z = 0 $,
approximated at $ z = ?0.01 $. Does the series converge
to a value that is the negative of the correct value?
Compare the value of $ \ln (z^2 + z^3) $ with its
truncated series expansion about $ z = 0 $,
approximated at $ z = ?0.01 + 0.1 i $. Does the series
converge to a value that is incorrect by $ 2 \pi i $ ?
Compare $ \arctanh (?2 + \ln (z) z) $ with its
truncated series expansion about $ z = 0 $,
approximated at $ z = ?0.01 $. Does the series converge
to a value that is incorrect by about $ \pi i $ ? At
the time of this writing, most implementations that
accommodate such series exhibit such errors. This
article describes how to avoid these errors both for
manual derivation of series and when implementing
series packages.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "178",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Johnson:2012:MWK,
author = "Jeremy Johnson",
title = "In Memoriam: {Werner Krandick}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "1--2",
pages = "52--54",
month = mar # "\slash " # jun,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2338496.2338504",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jul 26 19:06:13 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "178",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Shaska:2012:ECC,
author = "Tony Shaska and Daniel E. Steffy",
title = "{East Coast Computer Algebra Day 2012} abstracts",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "1--2",
pages = "55--59",
month = mar # "\slash " # jun,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2338496.2338505",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jul 26 19:06:13 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "178",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Johnson:2012:ARDb,
author = "Jeremy Johnson",
title = "Abstracts of recent doctoral dissertations in computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "1--2",
pages = "60--63",
month = mar # "\slash " # jun,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2338496.2338506",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jul 26 19:06:13 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Each month we are pleased to present abstracts of
recent doctoral dissertations in Computer Algebra and
Symbolic Computation. We encourage all recent Ph.D.
graduates (and their supervisors), who have defended in
the past two years, to submit their abstracts for
publication in CCA. Please send abstracts to the CCA
editors \url{editors_SIGSAM@acm.org} for
consideration.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "178",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wilson:2012:RCE,
author = "David J. Wilson and Russell J. Bradford and James H.
Davenport",
title = "A repository for {CAD} examples",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "67--69",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429137",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Cylindrical Algebraic Decomposition (CAD, first
introduced in [Col75]) of Euclidean space has become an
important tool in mathematics and allows for practical
quantifier elimination (QE) over the reals. Much
research has gone into improving the projection
operator (e.g. [McC85]), the use of partial CADs (e.g.
[CH91]), or into alternative algorithms (e.g.
[CDM+09]). A problem of fundamentally high complexity
(doubly-exponential in the number of variables [DH88])
it can be difficult to judge when a problem will be
solved quickly, and easy to write down problems that
are computationally infeasible. It can therefore be
difficult to test new advances in this field, and even
harder to 'experiment' with new ideas. We have created
a unified machine-readable repository of examples to be
used when considering CADs. This allows for quick
access to a host of examples, pulled from various
theoretical questions and applications. As well as
enabling more efficient research, the creation of the
repository has prompted us to look deeper at certain
questions related to CADs. The example bank currently
facilitates quick input for Maple and Qepcad
implementations of CAD and QE. Whilst CAD and QE
procedures exist in other software, they are not
directly involved in our research.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2012:SD,
author = "Anonymous",
title = "{Stefan Dodunekov 1945--2012}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "70--71",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429138",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Salem:2012:COE,
author = "Fatima K. Abu Salem",
title = "A cache-oblivious engineering of the {G2V} algorithm
for computing {Gr{\"o}bner} bases",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "72--73",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429139",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Belhaj:2012:CCG,
author = "Skander Belhaj and Ha{\"\i}them Ben Kahla",
title = "On the complexity of computing the {GCD} of two
polynomials via {Hankel} matrices",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "74--75",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429140",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This paper is devoted to present a revised algorithm
that permits to preserve the beautiful relation between
the classical Euclidean algorithm and the block
diagonalization of Hankel matrices for two noncoprime
polynomials. Our algorithm for Greatest Common Divisor
(GCD) computation which has a cost of $ O(n^2) $
arithmetic operations is tested for several sets of
polynomials. A complexity comparison is given with
respect to other existing methods based on structured
matrix computations.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Breuer:2012:PAP,
author = "Felix Breuer and Zafeirakis Zafeirakopoulos",
title = "Partition analysis via polyhedral geometry",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "76--77",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429141",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bshouty:2012:T,
author = "Nader H. Bshouty",
title = "Testers",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "78--79",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429142",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We develop a new notion called tester of a class of
multivariate polynomials $ M \subseteq F[\chi_1, \ldots
{}, \chi_n] $ that maps the elements $ a \in A $ of an
$F$-algebra $A$ to a finite number (the size of the
tester) of elements $ b_1, \ldots {}, b_t$ in a smaller
sub-algebra $ B \subset A$ where the property $ f(a)
\neq 0$ is preserved for all $ f \in M$. I.e., for all
$ f \in M$ and $ a \in A$ if $ f(a) \neq 0$ then $
f(b_i) \neq 0$ for some $i$. We use tools from
elementary algebra and algebraic function fields to
construct testers of almost optimal size in
deterministic polynomial time in the size of the
tester. We then apply testers to deterministically
construct new set of objects with some combinatorial
and algebraic properties that can be used to
derandomize some algorithms. We show that those new
constructions are almost optimal and for many of them
meet the union bound of the problem. Constructions
include, d-restriction problems, perfect hash,
universal sets, cover-free families, separating hash
functions, polynomial restriction problems, black box
polynomial identity testing for polynomials and
circuits over small fields and hitting sets.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cha:2012:CFS,
author = "Yongjae Cha and Veronika Pillwein",
title = "Closed form solutions of linear difference equations
in terms of symmetric products",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "80--81",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429143",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Dahan:2012:SLG,
author = "Xavier Dahan",
title = "On the structure of lexicographic {Gr{\"o}bner} bases
in dimension zero",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "82--83",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429144",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Demenkov:2012:ERA,
author = "Max Demenkov",
title = "Estimating region of attraction for polynomial vector
fields by homotopy methods",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "84--85",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429145",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Duchamp:2012:DFE,
author = "G{\`a}{\'e}rard H. E. Duchamp and Vincel Hoang Ngoc
Minh",
title = "Dual families in enveloping algebras",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "86--87",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429146",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Emiris:2012:SIU,
author = "Ioannis Z. Emiris and Tatjana Kalinka",
title = "Sparse implicitization using support prediction",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "88--89",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429147",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fassino:2012:ZDI,
author = "C. Fassino and M. Torrente",
title = "Zero-dimensional ideals of limited precision points",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "90--91",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429148",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Faugare:2012:FCO,
author = "Jean-Charles Faug{\`a}re and Pierrick Gaudry and
Louise Huot and Gu{\'e}na{\"e}l Renault",
title = "Fast change of ordering with exponent $ \omega $",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "92--93",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429149",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hascoet:2012:SCO,
author = "Laurent Hasco{\"e}t and Shahadat Hossain and Trond
Steihaug",
title = "Structured computation in optimization and algorithmic
differentiation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "94--95",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429150",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{vanHoeij:2012:FFT,
author = "Mark van Hoeij and Vijay Jung Kunwar",
title = "Finding {$_2 F_1$} type solutions of differential
equations with $5$ singularities",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "96--97",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429151",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Irtegov:2012:SAD,
author = "V. D. Irtegov and T. N. Titorenko",
title = "Symbolic analysis of dynamic systems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "98--99",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429152",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jaroschek:2012:IPR,
author = "Maximilian Jaroschek",
title = "Improved polynomial remainder sequences for ore
polynomials",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "100--101",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429153",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jiang:2012:ACE,
author = "Hao Jiang and Stef Graillat and Roberto Barrio",
title = "Accurate computing elementary symmetric functions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "102--103",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429154",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jovanovic:2012:SNL,
author = "Dejan Jovanovi{\'c} and Leonardo de Moura",
title = "Solving non-linear arithmetic",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "104--105",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429155",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We propose a new decision procedure for the
existential theory of the reals. It performs a
backtracking search for a model in R, where the
backtracking is powered by a novel conflict resolution
procedure based on cylindrical algebraic decomposition.
The initial experimental results are very encouraging.
The full article has been accepted at the 6th
International Joint Conference on Automated Reasoning
(IJCAR 2012).",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Labahn:2012:GWC,
author = "George Labahn and Johannes Middeke",
title = "{Gr{\"o}bner} walk for computing matrix normal forms
over {Ore} polynomials",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "106--107",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429156",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lebreton:2012:CCC,
author = "Romain Lebreton and Esmaeil Mehrabi and {\'E}ric
Schost",
title = "On the complexity of computing certain resultants",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "108--109",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429157",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Li:2012:SDR,
author = "Wei Li and Chun-Ming Yuan and Xiao-Shan Gao",
title = "Sparse differential resultant for {Laurent}
differential polynomials",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "110--111",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429158",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In this poster, we first introduce the concept of
Laurent differentially essential systems and give a
criterion for them in terms of their supports. Then the
sparse differential resultant for a Laurent
differentially essential system is defined and its
basic properties are given. In particular, order and
degree bounds for the sparse differential resultant, as
well as a BKK-type degree bound for the differential
resultant, are given. Based on these bounds, an
algorithm to compute the sparse differential resultant
is proposed, which is single exponential.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Llorente:2012:NSM,
author = "Alberto Llorente and Jorge Mozo-Fern{\'a}ndez",
title = "Numeric-symbolic methods for computing the
{Liouvillian} solutions of differential equations and
systems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "112--113",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429159",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ba:2012:MBR,
author = "Thang Luu Ba",
title = "The matrix based representations of the intersection
curves",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "114--115",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429160",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Nagasaka:2012:BEA,
author = "Kosaku Nagasaka",
title = "Backward error analysis of approximate {Gr{\"o}bner}
basis",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "116--117",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429161",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ugalde:2012:PRF,
author = "Esteban Segura Ugalde",
title = "Polynomial root-finding via structured matrices",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "118--119",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429162",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We study the problem of approximating the zeros of an
univariate polynomial (up to machine precision). Some
popular iterative root-finding methods construct
companion matrices (Frobenius, Lagrange) associated
with the given polynomial and use eigensolvers to find
the eigenvalues of such matrices. Our goal is to study
this root-finding technique, exploiting the structure
(e.g., diagonal plus rank one) of companion matrices to
obtain a decrease of computational cost and memory
requirements.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sekigawa:2012:MPP,
author = "Hiroshi Sekigawa and Kiyoshi Shirayanagi",
title = "Maximal perturbation for preserving the number of
solutions of a polynomial system",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "120--121",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429163",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Usevich:2012:VPM,
author = "Konstantin Usevich and Ivan Markovsky",
title = "Variable projection methods for approximate {GCD}
computations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "122--124",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429164",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This paper presents optimization methods and software
for the approximate GCD problem of multiple univariate
polynomials in the weighted 2-norm. Backward error
minimization and Sylvester low-rank approximation
formulations of the problem are solved by the variable
projection method. Optimization methods are implemented
in publicly available C++ software package with an
interface to MATLAB. Results on computational
complexity are presented.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wu:2012:EAF,
author = "Wenyuan Wu and Jingwei Chen and Yong Feng",
title = "An efficient algorithm to factorize sparse bivariate
polynomials over the rationals",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "125--126",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429165",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Johnson:2012:ARDc,
author = "Jeremy Johnson",
title = "Abstracts of recent doctoral dissertations in computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "127--129",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429166",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Each month we are pleased to present abstracts of
recent doctoral dissertations in Computer Algebra and
Symbolic Computation. We encourage all recent Ph.D.
graduates (and their supervisors), who have defended in
the past two years, to submit their abstracts for
publication in CCA. Please send abstracts to the CCA
editors {\tt editors\_sigsam@acm.org} for
consideration.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Stoutemyer:2012:SM,
author = "David R. Stoutemyer",
title = "Series misdemeanors",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "134--153",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429168",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Puiseux series are power series in which the exponents
can be fractional and/or negative rational numbers.
Several computer algebra systems have one or more
built-in or loadable functions for computing truncated
Puiseux series --- perhaps generalized to allow
coefficients containing functions of the series
variable that are dominated by any power of that
variable, such as logarithms and nested logarithms of
the series variable. Some computer-algebra systems also
offer functions that can compute more-general truncated
recursive hierarchical series. However, for all of
these kinds of truncated series there are important
implementation details that haven't been addressed
before in the published literature and in current
implementations. For implementers this article contains
ideas for designing more convenient, correct, and
efficient implementations or improving existing ones.
For users, this article is a warning about some of
these limitations. More specifically, this article
discusses issues such as avoiding unnecessary
restrictions such as prohibiting negative or fractional
requested orders, the pros and cons of displaying
results with explicit infectious error terms of the
form $ o(\ldots {}) $, $ O(\ldots {}) $, and/or $
\theta (\ldots {}) $, efficient data structures, and
algorithms that efficiently give users exactly the
order or number of nonzero terms they request. Most of
the ideas in this article have been implemented in the
computer-algebra within the TI-Nspire calculator,
Windows and Macintosh products.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Korporal:2012:ISD,
author = "Anja Korporal and Georg Regensburger and Markus
Rosenkranz",
title = "{ISSAC 2012} software demonstrations: {Symbolic}
computation for ordinary boundary problems in {Maple}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "154--156",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429169",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Barkatou:2012:IMP,
author = "Moulay A. Barkatou and Eckhard Pfl{\"u}gel and Flavia
Stan",
title = "{ISOLDE}: a {Maple} package for systems of linear
functional equations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "157--159",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429170",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The Maple ISOLDE package contains algorithms for
symbolically solving various classes of linear
functional systems. In this demonstration, we focus on
the local analysis of systems of linear differential
and difference equations. We illustrate the use of our
formal reduction algorithm and sketch the link with the
computation of a formal fundamental matrix solution at
a regular or irregular singularity.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bermejo:2012:ML,
author = "I. Bermejo and E. Garc{\'\i}a-Llorente and Ph.
Gimenez",
title = "{{\tt monomialideal.lib}}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "160--161",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429171",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{project:2012:PPS,
author = "The HPC-GAP project",
title = "Parallel programming support in {GAP}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "161--163",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429172",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Monagan:2012:PNP,
author = "Michael Monagan and Roman Pearce",
title = "{POLY}: a new polynomial data structure for {Maple
17}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "164--167",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429173",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We demonstrate how a new data structure for sparse
distributed polynomials in the Maple kernel
significantly accelerates a large subset of Maple
library routines. The POLY data structure and its
associated kernel operations (degree, coeff, subs, has,
diff, eval, \ldots{}) are programmed for high
scalability, allowing polynomials to have hundreds of
millions of terms, and very low overhead, increasing
parallel speedup in existing routines and improving the
performance of high level Maple library routines.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Quintin:2012:DLL,
author = "Guillaume Quintin",
title = "The decoding {Library} for list decoding",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "168--170",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429174",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Chen:2012:GID,
author = "Xiaoyu Chen and Dongming Wang and Ting Zhao",
title = "{GeoText}: an intelligent dynamic geometry textbook",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "171--175",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429175",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Johnson:2012:ARDd,
author = "Jeremy Johnson",
title = "Abstracts of recent doctoral dissertations in computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "46",
number = "3--4",
pages = "176--179",
month = sep,
year = "2012",
CODEN = "????",
DOI = "https://doi.org/10.1145/2429135.2429176",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 18 10:13:15 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Eder:2013:IIS,
author = "Christian Eder",
title = "Improving incremental signature-based {Gr{\"o}bner}
basis algorithms",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "1--2",
pages = "1--13",
month = mar,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2503697.2503699",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jul 17 06:23:04 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In this paper we describe a combination of ideas to
improve incremental signature-based Gr{\"o}bner basis
algorithms which have a big impact on their
performance. Besides explaining how to combine already
known optimizations to achieve more efficient
algorithms, we show how to improve them even further.
Although our idea has a positive effect on all kinds of
incremental signature-based algorithms, the way this
impact is achieved can be quite different. Based on the
two best-known algorithms in this area, F5 and G2V, we
explain our idea, both from a theoretical and a
practical point of view.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wolfram:2013:RRC,
author = "Stephen Wolfram",
title = "Remembering {Richard Crandall} (1947--2012)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "1--2",
pages = "14--15",
month = mar,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2503697.2503700",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jul 17 06:23:04 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/bibnet/authors/c/crandall-richard-e.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bronstein:2013:MBC,
author = "Manuel Bronstein",
title = "{Manuel Bronstein}'s codes",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "1--2",
pages = "16--16",
month = mar,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2503697.2503701",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jul 17 06:23:04 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2013:ICB,
author = "Anonymous",
title = "{ISSAC 2015}: call for bids",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "1--2",
pages = "17--17",
month = mar,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2503697.2503702",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jul 17 06:23:04 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2013:RDJ,
author = "Anonymous",
title = "{Richard D. Jenks} prize 2013: call for nominations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "1--2",
pages = "18--18",
month = mar,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2503697.2503703",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jul 17 06:23:04 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Johnson:2013:ARD,
author = "Jeremy Johnson",
title = "Abstracts of recent doctoral dissertations in computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "1--2",
pages = "19--23",
month = mar,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2503697.2503704",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jul 17 06:23:04 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Each month we are pleased to present abstracts of
recent doctoral dissertations in Computer Algebra and
Symbolic Computation. We encourage all recent Ph.D.
graduates (and their supervisors), who have defended in
the past two years, to submit their abstracts for
publication in CCA. Please send abstracts to the CCA
editors \url{editors_SIGSAM@acm.org} for
consideration.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2013:RUEa,
author = "Anonymous",
title = "Recent and upcoming events",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "1--2",
pages = "24--25",
month = mar,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2503697.2503705",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jul 17 06:23:04 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Stoutemyer:2013:SPF,
author = "David R. Stoutemyer",
title = "Simplifying products of fractional powers of powers",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "1--2",
pages = "26--58",
month = mar,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2503697.2503707",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jul 17 06:23:04 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Most computer algebra systems incorrectly simplify $
(z - z) / (\sqrt {w^2} / w^3 - 1 / (w \sqrt w^2)) $ to
$0$ rather than to $ 0 / 0 $. The reasons for this
are:\par
(1) The default simplification does not succeed in
simplifying the denominator to $0$.\par
(2) There is a rule that $0$ is the result of $0$
divided by anything that does not simplify to either
$0$ or $ 0 / 0 $.\par
Many of these systems have more powerful optional
transformation and general purpose simplification
functions. However that is unlikely to help this
example even if one of those functions can simplify the
denominator to $0$, because the input to those
functions is the result of default simplification,
which has already incorrectly simplified the overall
ratio to $0$. Try it on your computer algebra
systems!\par
This article describes how to simplify products of the
form $ w^\alpha (w^{\beta_1})^{\gamma_1} \cdots
(w^{\beta_n})^{\gamma_n} $ correctly and well, where
$w$ is any real or complex expression and the exponents
are rational numbers.\par
It might seem that correct good simplification of such
a restrictive expression class must already be
published and/or built into at least one widely used
computer-algebra system, but apparently this issue has
been overlooked. Default and relevant optional
simplification was tested with 86 examples on 5 systems
with $ n = 1 $. Using a spectrum from the most serious
flaw being a result that is not equivalent to the input
somewhere to the least serious being not rationalizing
a denominator when that does not cause a more serious
flaw, the overall percentage of most flaw types is
alarming.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{vanderHoeven:2013:GTS,
author = "Joris van der Hoeven and Andrey Grozin and
Massimiliano Gubinelli and Gr{\'e}goire Lecerf and
Fran{\c{c}}ois Poulain and Denis Raux",
title = "{GNU TEXmacs}: a scientific editing platform",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "1--2",
pages = "59--61",
month = mar,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2503697.2503708",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jul 17 06:23:04 MDT 2013",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/gnu.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "GNU TEXmacs is a free software for editing scientific
documents, which can also be used as an interface for
computer algebra systems. In this software
demonstration we will briefly recall its main features
and present some recent developments.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Heinle:2013:RFC,
author = "Albert Heinle",
title = "Review of {``A first course in computational algebraic
geometry''} by {W. Decker} and {G. Pfister}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "1--2",
pages = "62--63",
month = mar,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2503697.2503709",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jul 17 06:23:04 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Roche:2013:AEC,
author = "Dan Roche",
title = "Abstracts of the {2013 East Coast Computer Algebra
Day}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "1--2",
pages = "64--70",
month = mar,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2503697.2503710",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jul 17 06:23:04 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2013:RUEb,
author = "Anonymous",
title = "Recent and upcoming events",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "1--2",
pages = "71--72",
month = mar,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2503697.2503711",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Jul 17 06:23:04 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Scott:2013:ASG,
author = "Tony C. Scott and Greg Fee and Johannes Grotendorst",
title = "Asymptotic series of generalized {Lambert $W$}
function",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "75--83",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576804",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Herein, we present a sequel to earlier work on a
generalization of the Lambert $W$ function. In
particular, we examine series expansions of the
generalized version providing computational means for
evaluating this function in various regimes and further
confirming the notion that this generalization is a
natural extension of the standard Lambert $W$
function.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kaltofen:2013:NFO,
author = "Erich Kaltofen and Alexey Ovchinnikov",
title = "{NSF} funding opportunities for symbolic computation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "84--84",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576805",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fogel:2013:CGA,
author = "Efi Fogel and Monique Teillaud",
title = "The {Computational Geometry Algorithms Library CGAL}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "85--87",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576806",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The Computational Geometry Algorithms Library (CGAL)
is an open source software library that provides
industrial and academic users with easy access to
reliable implementations of efficient geometric
algorithms.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Nagasaka:2013:RQC,
author = "Kosaku Nagasaka and Takaaki Masui",
title = "Revisiting {QRGCD} and comparison with {ExQRGCD}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "88--89",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576807",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bui:2013:SFQ,
author = "C. Bui and G. H. E. Duchamp and Hoang Ngoc Minh",
title = "{Sch{\"u}tzenberger}'s factorization on $q$-stuffle
{Hopf} algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "90--91",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576808",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sedjelmaci:2013:FPG,
author = "Sidi M. Sedjelmaci",
title = "Fast parallel {GCD} algorithm of many integers",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "92--93",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576809",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We present a new parallel algorithm which computes the
GCD of $n$ integers of $ O(n)$ bits in $ O(n / \log n)$
time with $ O(n^{2 + \epsilon })$ processors, for any $
\epsilon > 0$ on CRCW PRAM model.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Zhao:2013:GKD,
author = "Xiangui Zhao",
title = "{Gelfand--Kirillov} dimensions of differential
difference modules via {Gr{\"o}bner} bases",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "94--95",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576810",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Schost:2013:NLI,
author = "{\'E}ric Schost and Pierre-Jean Spaenlehauer",
title = "{Newton}-like iteration for determinantal systems and
structured low rank approximation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "96--97",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576811",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Khan:2013:VFM,
author = "Muhammad Taimoor Khan and Wolfgang Schreiner",
title = "A verification framework for {MiniMaple} programs",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "98--99",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576812",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Giorgi:2013:ROB,
author = "Pascal Giorgi and Romain Lebreton",
title = "Relaxing order basis computation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "100--101",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576813",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Vialla:2013:BWA,
author = "Bastien Vialla",
title = "Block {Wiedemann} algorithm on multicore
architectures",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "102--103",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576814",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Arnold:2013:RSI,
author = "Andrew Arnold and Mark Giesbrecht and Dan Roche",
title = "Recursive sparse interpolation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "104--105",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576815",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Meng:2013:TPG,
author = "Lingchuan Meng and Jeremy Johnson",
title = "Towards parallel general-size library generation for
polynomial multiplication",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "106--107",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576816",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hu:2013:PAC,
author = "Jiaxiong Hu and Michael Monagan",
title = "A parallel algorithm to compute the greatest common
divisor of sparse multivariate polynomials",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "108--109",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576817",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Terui:2013:CAG,
author = "Akira Terui",
title = "Calculating approximate {GCD} of multiple univariate
polynomials using approximate syzygies",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "110--111",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576818",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Feng:2013:IPA,
author = "Yong Feng and Jingwei Chen and Wenyuan Wu",
title = "Incremental {PSLQ} with application to algebraic
number reconstruction",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "112--113",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576819",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wan:2013:HGF,
author = "James G. Wan",
title = "Hypergeometric generating functions and series for $ 1
/ \pi $",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "114--115",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576820",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/pi.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Middeke:2013:AMI,
author = "Johannes Middeke",
title = "Annihilating monomials with the integro-differential
{Weyl} algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "116--117",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576821",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The integro-differential Weyl algebra provides an
algebraic model for differential and integral operators
with polynomial coefficients. It has a natural action
on the ring of polynomials. We are interested in
computing the annihilator of a given polynomial with
respect to this action. This contribution contains a
first step towards that goal---namely we give a
description of the annihilator of a monomial.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Harrison:2013:PAW,
author = "Gavin Harrison and Jeremy Johnson and B. David
Saunders",
title = "Probabilistic analysis of {Wiedemann}'s algorithm for
minimal polynomial computation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "118--119",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576822",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Belk:2013:ISC,
author = "James Belk and Nabil Hossain and Francesco Matucci and
Robert McGrail",
title = "Implementation of a solution to the conjugacy problem
in {Thompson}'s group {$F$}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "120--121",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576823",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We present an efficient implementation of the solution
to the conjugacy problem in Thompson's group $F$. This
algorithm checks for conjugacy by constructing and
comparing directed graphs called strand diagrams. We
provide a description of our solution algorithm,
including the data structure that represents strand
diagrams and supports simplifications.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wolf:2013:LSS,
author = "Thomas Wolf and Eberhard Schr{\"u}fer and Kenneth
Webster",
title = "A linear sparse systems solver {(LSSS)} applied to the
classification of integrable non-abelian {Laurent}
{ODEs}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "122--123",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576824",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Editors:2013:ARDa,
author = "{CCA Editors}",
title = "Abstracts of recent doctoral dissertations in computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "124--125",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576825",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Message from the SIGSAM chair",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Stoutemyer:2013:CAU,
author = "David R. Stoutemyer",
title = "A computer algebra user interface manifesto",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "130--165",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576827",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Many computer algebra systems have more than 1000
built-in functions, making expertise difficult. Using
mock dialog boxes, this article describes a proposed
interactive general-purpose wizard for organizing
optional transformations and allowing easy fine grain
control over the form of the result --- even by
amateurs. This wizard integrates ideas including:
flexible subexpression selection; complete control over
the ordering of variables and commutative operands,
with well-chosen defaults; interleaving the choice of
successively less main variables with applicable
function choices to provide detailed control without
incurring a combinatorial number of applicable
alternatives at any one level; quick applicability
tests to reduce the listing of inapplicable
transformations; using an organizing principle to order
the alternatives in a helpful manner; labeling
quickly-computed alternatives in dialog boxes with a
preview of their results, using ellipsis elisions if
necessary or helpful; allowing the user to retreat from
a sequence of choices to explore other branches of the
tree of alternatives --- or to return quickly to
branches already visited; allowing the user to
accumulate more than one of the alternative forms;
integrating direct manipulation into the wizard; and
supporting not only the usual input-result pair mode,
but also the useful alternative derivational and in
situ replacement modes in a unified window.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Johansson:2013:ACL,
author = "Fredrik Johansson",
title = "{Arb}: a {C} library for ball arithmetic",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "166--169",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576828",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Zeng:2013:NMT,
author = "Zhonggang Zeng and Tien-Yien Li",
title = "{NAClab}: a {Matlab} toolbox for numerical algebraic
computation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "170--173",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576829",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/matlab.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Postma:2013:NGT,
author = "E. J. Postma",
title = "The new group theory package in {Maple 17}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "174--178",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576830",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The GroupTheory package was added to Maple 17 [1]. It
deals with discrete groups. The package offers
visualizations of group theoretic concepts; accepts
input and generates output that is relatively close to
the classical textbook notation; and can deal with
parameterized groups where the parameters are given
only symbolically.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Koutschan:2013:HFM,
author = "Christoph Koutschan",
title = "Holonomic functions in {Mathematica}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "179--182",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576831",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/mathematica.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We present the Mathematica package HolonomicFunctions
which provides a powerful framework for the automatic
manipulation of multivariate holonomic functions, in
the spirit of Zeilberger's holonomic systems approach.
Its top-level functionalities are: converting a
mathematical expression into a holonomic description,
executing holonomic closure properties, and creative
telescoping for general holonomic functions. To achieve
these goals, many other, lower-level, functionalities
had to be implemented which were not available in the
Mathematica system: finding rational solutions of
linear systems of (q-) difference / differential
equations, noncommutative arithmetic in Ore algebras
and computing Gr{\"o}bner bases in such domains.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Betten:2013:CDO,
author = "Anton Betten",
title = "Classifying discrete objects with {Orbiter}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "183--186",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576832",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Orbiter is a software package to classify discrete
objects such as designs, graphs, codes, and objects
from finite geometry. It employs the method of breaking
the symmetry to attack difficult problem instances by
means of subobjects that serve as a stepping stone. The
algorithms combine techniques from Group Theory and
from Combinatorics. Orbiter is a library of C++
functions that provide functionality for Discrete
Mathematics. In order to be applied to a specific
problem, code has to be written tailored to the
specific application.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kaltofen:2013:JPA,
author = "Erich Kaltofen",
title = "{Jenks Prize 2013} award citation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "187--187",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576833",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2013:MGA,
author = "Anonymous",
title = "{Mark Giesbrecht} {ACM} distinguished scientist",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "188--188",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576834",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Editors:2013:ARDb,
author = "{CCA Editors}",
title = "Abstracts of recent doctoral dissertations in computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "47",
number = "3--4",
pages = "189--190",
month = sep,
year = "2013",
CODEN = "????",
DOI = "https://doi.org/10.1145/2576802.2576835",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Jan 28 17:13:26 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Each month we are pleased to present abstracts of
recent doctoral dissertations in Computer Algebra and
Symbolic Computation. We encourage all recent Ph.D.
graduates (and their supervisors), who have defended in
the past two years, to submit their abstracts for
publication in CCA. Please send abstracts to the CCA
editors \url{editors_SIGSAM@acm.org} for
consideration.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2014:MSCa,
author = "Anonymous",
title = "Message from the {SIGSAM} chair",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "1",
pages = "1--2",
month = mar,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2644288.2644290",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jul 10 18:07:32 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Abbott:2014:QIR,
author = "John Abbott",
title = "Quadratic interval refinement for real roots",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "1",
pages = "3--12",
month = mar,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2644288.2644291",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jul 10 18:07:32 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We present a new algorithm for refining a real
interval containing a single real root: the new method
combines the robustness of the classical Bisection
algorithm with the speed of the Newton--Raphson method;
that is, our method exhibits quadratic convergence when
refining isolating intervals of simple roots of
polynomials (and other well-behaved functions). We
assume the use of arbitrary precision rational
arithmetic. Unlike Newton--Raphson our method does not
need to evaluate the derivative.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Blankertz:2014:PTA,
author = "Raoul Blankertz",
title = "A polynomial time algorithm for computing all minimal
decompositions of a polynomial",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "1",
pages = "13--23",
month = mar,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2644288.2644292",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jul 10 18:07:32 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The composition of two polynomials $ g (h) = g o h $
is a polynomial. For a given polynomial f we are
interested in finding a functional decomposition $ f =
g o h $. In this paper an algorithm is described, which
computes all minimal decompositions in polynomial time.
In contrast to many previous decomposition algorithms
this algorithm works without restrictions on the degree
of the polynomial and the characteristic of the ground
field. The algorithm can be iteratively applied to
compute all decompositions. It is based on ideas of
Landau {\&} Miller (1985) and Zippel (1991).
Additionally, an upper bound on the number of minimal
decompositions is given.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{England:2014:BCM,
author = "M. England and E. Cheb-Terrab and R. Bradford and J.
H. Davenport and D. Wilson",
title = "Branch cuts in {Maple 17}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "1",
pages = "24--27",
month = mar,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2644288.2644293",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jul 10 18:07:32 MDT 2014",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Accurate and comprehensible knowledge about the
position of branch cuts is essential for correctly
working with multi-valued functions, such as the square
root and logarithm. We discuss the new tools in Maple
17 for calculating and visualising the branch cuts of
such functions, and others built up from them. The cuts
are described in an intuitive and accurate form,
offering substantial improvement on the descriptions
previously available.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Editors:2014:ARDa,
author = "{CCA Editors}",
title = "Abstracts of recent doctoral dissertations in computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "1",
pages = "28--28",
month = mar,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2644288.2644294",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jul 10 18:07:32 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Each month we are pleased to present abstracts of
recent doctoral dissertations in Computer Algebra and
Symbolic Computation. We encourage all recent Ph.D.
graduates (and their supervisors), who have defended in
the past two years, to submit their abstracts for
publication in CCA. Please send abstracts to the CCA
editors \url{editors_SIGSAM@acm.org} for
consideration.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kotsireas:2014:MSCa,
author = "Ilias S. Kotsireas",
title = "Message from the {SIGSAM Chair}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "2",
pages = "32--32",
month = mar,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2644288.2644296",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jul 10 18:07:32 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:2014:SDI,
author = "Robert M. Corless and Junrui Hu and D. J. Jeffrey",
title = "Some definite integrals containing the {Tree T}
function",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "2",
pages = "33--41",
month = mar,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2644288.2644297",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jul 10 18:07:32 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We consider, from a symbolic point of view, a pair of
definite integrals containing Lambert W, recently
considered from a numerical point of view by Walter
Gautschi. We transform the integrals to a shape that
can be integrated in special cases by a
computer-algebra system or by using tables of
integrals, such as Prudnikov et al.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Scott:2014:NGL,
author = "Tony C. Scott and Greg Fee and Johannes Grotendorst
and W. Z. Zhang",
title = "Numerics of the generalized {Lambert $W$} function",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "2",
pages = "42--56",
month = mar,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2644288.2644298",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jul 10 18:07:32 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Decker:2014:RNS,
author = "Wolfram Decker",
title = "Review of {``Numerically Solving Polynomial Systems
with Bertini'' by Daniel J. Bates, Jonathan D.
Hauenstein, Andrew J. Sommese, and Charles W.
Wampler}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "2",
pages = "57--58",
month = mar,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2644288.2644299",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jul 10 18:07:32 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "See reviewed book \cite{Bates:2013:NSP}.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2014:AEC,
author = "Anonymous",
title = "Abstracts of the {2014 East Coast Computer Algebra
Day}: Communicated by {Xiaobai Sun}, {Nikos P.
Pitsianis}, and {Alexandros-Stavros Iliopoulos}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "2",
pages = "59--63",
month = mar,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2644288.2644300",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jul 10 18:07:32 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Editors:2014:ARDb,
author = "{CCA Editors}",
title = "Abstracts of recent doctoral dissertations in computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "2",
pages = "64--66",
month = mar,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2644288.2644301",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jul 10 18:07:32 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Each month we are pleased to present abstracts of
recent doctoral dissertations in Computer Algebra and
Symbolic Computation. We encourage all recent Ph.D.
graduates (and their supervisors), who have defended in
the past two years, to submit their abstracts for
publication in CCA. Please send abstracts to the CCA
editors \url{editors_SIGSAM@acm.org} for
consideration.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ovchinnikov:2014:KSD,
author = "Alexey Ovchinnikov",
title = "{Kolchin} seminar in differential algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "2",
pages = "67--69",
month = mar,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2644288.2644302",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jul 10 18:07:32 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The productive past and lively present of the Kolchin
Seminar in Differential Algebra, as well as its
perspectives are touched on in this article.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sit:2014:KSD,
author = "William Sit",
title = "The {Kolchin} seminar in differential algebra at the
{Graduate Center of the City University of New York}:
Summer --- 2014",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "2",
pages = "70--73",
month = mar,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2644288.2644303",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jul 10 18:07:32 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "http://www.sci.ccny.cuny.edu/~ksda/gradcenter.html",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2014:MSCb,
author = "Anonymous",
title = "Message from the {SIGSAM} chair",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "77--77",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733695",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fateman:2014:ADL,
author = "Richard Fateman",
title = "{Algorithm Differentiation in Lisp: ADIL}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "78--89",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733696",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Algorithm differentiation (AD) is a technique used to
transform a program $F$ computing a numerical function
of one argument $ F(x)$ into another program $ G(p)$
that returns a pair, $ h F(p)$, $ F0 (p) i$ where by $
F0 (p)$ we mean the derivative of $F$ with respect to
its argument $x$, evaluated at $ x = p$. That is, we
have a program AD that takes as input a program, and
returns another: $ G := {\rm AD}(F)$. Over the years AD
programs have been developed to allow $F$ to be
expressed in some specialized variant of a popular
programming language $L$ (FORTRAN, C, Matlab, Python)
and where $G$ is delivered in that language $L$ or some
other. Alternatively, executing $ F(p)$ is some
environment will deliver $ h F0 (p)$, $ F(p) i$
directly. AD tools have also been incorporated in
computer algebra systems (CAS) such as Maple. A CAS is
hardly necessary for the task of writing the AD
program, since the main requirement is a set of tools
for manipulation of an internal (typically tree) form
of a program. In Lisp, a normal program is already in
this form and so the AD program in Lisp (ADIL), the
target $F$ and the product $G$ can all be expressed
compactly in Lisp. In spite of the brevity and
extensibility of the ADIL program, we can provide
features which are unsupported in other AD programs. In
particular, recursive functions are easily
accommodated. Our perspective here is to point out that
for scientists who write programs in Lisp or any
language that can be converted to Lisp, AD is easily at
hand.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gheffar:2014:DNR,
author = "Amal Gheffar",
title = "Detecting Nonexistence of Rational Solutions of Linear
Difference Equations in Early Stages of Computation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "90--97",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733697",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We discuss some changes of the traditional scheme for
finding rational solutions of linear difference
equations (homogeneous or inhomogeneous) with rational
coefficients. These changes in some cases allow one to
detect the absence of rational solutions in an early
stage of computation and to stop the work. The
corresponding strategy may be useful for the algorithms
based on finding rational solutions of equations of
considered form, e.g., for some symbolic summation
algorithms.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Arnold:2014:TFT,
author = "Andrew Arnold and {\'E}ric Schost",
title = "A {Truncated Fourier Transform} middle product",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "98--99",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733698",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The middle product computes the middle $n$ terms of a
$ (2 n - 1) \times n$ polynomial product, with
effectively the same cost as computing an $ n \times n
$ polynomial product. The middle product allows for
faster power series operations and Newton iteration.
Middle product variants of classical, Karatsuba, and
FFT-based multiplication algorithms are known. We
present a middle product algorithm based on the
Truncated Fourier Transform.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Boyer:2014:MMW,
author = "Brice Boyer and Jean-Guillaume Dumas",
title = "Matrix Multiplication over Word-size Modular Fields
Using {Bini}'s Approximate Formula",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "100--102",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733699",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Boyer:2014:NLS,
author = "Brice Boyer and Erich L. Kaltofen",
title = "Numerical Linear System Solving with Parametric
Entries by Error Correction",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "103--105",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733700",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Chen:2014:IAP,
author = "Shaoshi Chen and Hui Huang and Ziming Li",
title = "Improved {Abramov--Petkovsek}'s Reduction and Creative
Telescoping for Hypergeometric Terms",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "106--108",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733701",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:2014:ZFF,
author = "Robert M. Corless and Marc Moreno Maza and Steven E.
Thornton",
title = "Zigzag Form over Families of Parametric Matrices",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "109--112",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733702",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gomez-Torrecillas:2014:GII,
author = "Jos{\'e} G{\'o}mez-Torrecillas and F. J. Lobillo and
Gabriel Navarro",
title = "Generating Idempotents in Ideal Codes",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "113--115",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733703",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hamada:2014:MPC,
author = "Tatsuyoshi Hamada",
title = "{MathLibre}: Personalizable Computer Environment for
Mathematical Research",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "116--117",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733704",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "MathLibre is a project to archive free mathematical
software and free mathematical documents and offer them
on Live Linux system. MathLibre Project is the direct
descendant of KNOPPIX/Math Project. It provides a
desktop for mathematicians that can be set up easily
and quickly.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hibi:2014:CBT,
author = "Takayuki Hibi and Kenta Nishiyama and Nobuki
Takayama",
title = "Computing Bases of Twisted Cohomology Groups for
Sparse Polynomials",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "118--120",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733705",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We present an algorithm to construct bases of twisted
cohomology groups for the complement of a generic
sparse polynomial over a generic local system of rank
1. The algorithm is based on the theory given in a
recent preprint [1].",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Huang:2014:CTH,
author = "Zongyan Huang and Matthew England and David Wilson and
James H. Davenport and Lawrence C. Paulson",
title = "A Comparison of Three Heuristics to Choose the
Variable Ordering for Cylindrical Algebraic
Decomposition",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "121--123",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733706",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Cylindrical algebraic decomposition (CAD) is a key
tool for problems in real algebraic geometry and
beyond. When using CAD there is often a choice over the
variable ordering to use, with some problems infeasible
in one ordering but simple in another. Here we discuss
a recent experiment comparing three heuristics for
making this choice on thousands of examples.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kai:2014:FSD,
author = "Hiroshi Kai and Keita Ueda",
title = "Fake Shares Detection on a Visual Secret Sharing
Scheme by Rational Interpolation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "124--126",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733707",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In the visual secret sharing scheme based on
polynomial interpolation, e.g. Lin and Tsai's scheme,
fake share images may give incorrect secret
information. We propose a method to identify or detect
them using a technique by rational interpolation.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kawano:2014:QFT,
author = "Yasuhito Kawano and Hiroshi Sekigawa",
title = "{Quantum Fourier Transform} over Symmetric Groups:
Improved Result",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "127--129",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733708",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This paper improves the main result in our paper
``Quantum Fourier Transform over Symmetric Groups,
Proceedings of the International Symposium on Symbolic
and Algebraic Computation (ISSAC), pp. 227--234,
Northeastern University, Boston, USA (June 26-29,
2013).'' In that paper, we presented an O(n4) quantum
Fourier transform (QFT) algorithm over symmetric group
Sn, which was faster than the existing algorithm. This
paper proposes an O(n3 log n) QFT algorithm over Sn by
relieving bottlenecks of our previous algorithm.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Middeke:2014:FFF,
author = "Johannes Middeke and David J. Jeffrey",
title = "Fraction-Free Factoring Revisited",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "130--132",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733709",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We revisit fraction-free Gaussian elimination as a
method for finding exact solutions of linear systems
over integral domains, specifically integers and
univariate polynomials. We conducted several
experiments regarding common folklore about these
methods such as pivoting strategies. Moreover, we find
that the classical algorithms produce a unsettlingly
high amount of common factors in the rows of the
resulting matrices which they seem unable to detect let
alone remove. We present preliminary results on
remedying this fact. Finally, we apply fraction-free
elimination to compute matrix inverses and to solve
linear systems, and compare that to the use of
fractional methods.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bates:2014:DHS,
author = "Daniel J. Bates and Andrew J. Newell and Matthew E.
Niemerg",
title = "Decoupling Highly Structured Polynomial Systems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "133--133",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733710",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "An efficient technique for solving polynomial systems
with a particular structure is presented. This
structure is very specific but arises naturally when
computing the critical points of a symmetric polynomial
energy function. This novel numerical solution method
is based on homotopy continuation and is a particular
application of results due to Canny and Rojas. An
illustrative example from magnetism is presented.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Murakami:2014:CRN,
author = "Hiroshi Murakami",
title = "Calculation of Rational Numbers in an Interval Whose
Denominator is the Smallest by using {FP} Interval
Arithmetic",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "134--136",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733711",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The continued fraction expansion method is a fast
solver to find a rational number in a given real
interval whose denominator is the smallest. A simple
implementation of the CF expansion method which uses
floating point numbers as real numbers has a
possibility to give a wrong answer by the effect of
numerical round-off errors. In this paper, we show a
modification of the algorithm of the CF expansion
method so that it uses floating point (FP) intervals as
replacements of real numbers. By this modified
algorithm, the answer is obtained only when its
correctness is guaranteed and the possibility to give a
wrong answer is eliminated.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sasaki:2014:SPS,
author = "Tateaki Sasaki and Daiju Inaba and Fujio Kako",
title = "Solving Parametric Sparse Linear Systems by Local
Blocking",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "137--139",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733712",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Storjohann:2014:RAO,
author = "Arne Storjohann and Shiyun Yang",
title = "A Relaxed Algorithm for Online Matrix Inversion",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "140--142",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733713",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{vanHoeij:2014:TSS,
author = "Mark van Hoeij and Erdal Imamoglu",
title = "{${}_2 F_1 $}-type Solutions of Second Order
Differential Equations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "143--144",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733714",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Zima:2014:DIS,
author = "Eugene V. Zima",
title = "Direct Indefinite Summation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "145--147",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733715",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Editors:2014:ARDc,
author = "{CCA Editors}",
title = "Abstracts of recent doctoral dissertations in computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "148--150",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733716",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Each month we are pleased to present abstracts of
recent doctoral dissertations in Computer Algebra and
Symbolic Computation. We encourage all recent Ph.D.
graduates (and their supervisors), who have defended in
the past two years, to submit their abstracts for
publication in CCA. Please send abstracts to the CCA
editors \url{editors_SIGSAM@acm.org} for
consideration.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kotsireas:2014:MSCb,
author = "Ilias S. Kotsireas",
title = "Message from the {SIGSAM Chair}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "154--154",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733718",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Abramov:2014:SSP,
author = "Sergei A. Abramov and Moulay A. Barkatou",
title = "On Solution Spaces of Products of Linear Differential
or Difference Operators",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "155--165",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733719",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We consider linear ordinary differential or difference
systems of the form $ L(y) = 0 $ where $L$ is an
operator with matrix coefficients, the unknown vector
$y$ has $m$ components $ y_1$, \ldots{}, $ y_m$, $ m >
1 $. The matrix coefficients are of size $ m \times m$,
their entries belong to a differential or difference
field $K$ of characteristic $0$. For any such a system
the solution space VL is considered, and the components
of each solution are in a fixed appropriate
differential or difference extension of $K$ (e.g., in
the universal Picard-Vessiot extension). We prove that
$ \dim V L M = \dim V L + \dim V M$ for arbitrary
operators $L$ and $M$ of the considered form, and
discuss some algorithms based on this property of
operators. In particular, we propose an algorithm to
compute $ \dim V L$, as well as a new algorithm having
a low complexity for recognizing unimodular operators
and constructing the inverse of a unimodular
operator.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Monagan:2014:DMS,
author = "Michael Monagan and Roman Pearce",
title = "The Design of {Maple}'s Sum-of-Products and {POLY}
Data Structures for Representing Mathematical Objects",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "166--186",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733720",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The principal data structure Maple uses to represent
polynomials and general mathematical expressions
involving functions like $ \sin x $, $ e^{2x} $, $
y'(x) $, $ (n / k) $ etc., is known to the Maple
developers as the sum-of-products data structure.
Gaston Gonnet, as the primary author of the Maple
kernel, designed and implemented this data structure in
the early 1980s. As part of the process of simplifying
a mathematical formula, he represented every Maple
object and every sub-object uniquely in memory. This
makes testing for equality of expressions very fast. In
this article, on occasion of Gonnet's retirement, we
present details of his design, its pros and cons, and
changes we and others have made to it over the years.
One of the cons of the sum-of-products data structure
is it is not as efficient at multiplying multivariate
polynomials as other special purpose computer algebra
systems. We describe a new data structure called POLY
that we added to Maple 17 (released in 2013) to improve
performance for polynomials in Maple, and recent work
done for Maple 18 (released in 2014).",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{vanderHoeven:2014:SPI,
author = "Joris van der Hoeven and Gr{\'e}goire Lecerf",
title = "Sparse Polynomial Interpolation in Practice",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "187--191",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733721",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Izumi:2014:MPI,
author = "Hideaki Izumi",
title = "{Maple} Package {\tt itsol} for Formal Solutions of
Iterative Functional Equations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "192--196",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733722",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Chen:2014:BPA,
author = "Changbo Chen and Svyatoslav Covanov and Farnam
Mansouri and Marc Moreno Maza and Ning Xie and Yuzhen
Xie",
title = "Basic Polynomial Algebra Subprograms",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "197--201",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733723",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The Basic Polynomial Algebra Subprograms (BPAS)
provides arithmetic operations (multiplication,
division, root isolation, etc.) for univariate and
multivariate polynomials over prime fields or with
integer coefficients. The code is mainly written in
CilkPlus [11] targeting multicore processors. The
current distribution focuses on dense polynomials and
the sparse case is work in progress. A strong emphasis
is to put on adaptive algorithms as the library aims at
supporting a wide variety of situations in terms of
problem sizes and available computing resources. One of
the purposes of the BPAS project is to take advantage
of hardware accelerators in the development of
polynomial systems solvers. The BPAS library is
publicly available in source at {\tt
www.bpaslib.org}.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Editors:2014:ARDd,
author = "{CCA Editors}",
title = "Abstracts of recent doctoral dissertations in computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "48",
number = "3/4",
pages = "202--202",
month = sep,
year = "2014",
CODEN = "????",
DOI = "https://doi.org/10.1145/2733693.2733724",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 5 17:11:08 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Each month we are pleased to present abstracts of
recent doctoral dissertations in Computer Algebra and
Symbolic Computation. We encourage all recent Ph.D.
graduates (and their supervisors), who have defended in
the past two years, to submit their abstracts for
publication in CCA. Please send abstracts to the CCA
editors \url{editors_SIGSAM@acm.org} for
consideration.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Heinle:2015:SBT,
author = "Albert Heinle and Viktor Levandovskyy",
title = "The {SDeval} benchmarking toolkit",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "1--9",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768578",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In this paper we will present SDeval, a software
project that contains tools for creating and running
benchmarks with a focus on problems in computer
algebra. It is built on top of the Symbolic Data
project, able to translate problems in the database
into executable code for various computer algebra
systems. The included tools are designed to be very
flexible to use and to extend, such that they can be
easily deployed even in contexts of other communities.
We also address particularities of benchmarking in the
field of computer algebra. Furthermore, with SDEval, we
provide a feasible and automatable way of reproducing
benchmarks published in current research works, which
appears to be a difficult task in general due to the
customizability of the available programs.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fogel:2015:CGA,
author = "Efi Fogel and Monique Teillaud",
title = "The computational geometry algorithms library {CGAL}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "10--12",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768579",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The Computational Geometry Algorithms Library (CGAL)
is an open source software library that provides
industrial and academic users with easy access to
reliable implementations of efficient geometric
algorithms.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Aydin:2015:CAC,
author = "Nuh Aydin",
title = "Computer algebra challenges for constructing skew
cyclic codes",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "13--13",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768581",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bagheri:2015:NNA,
author = "Kadijeh Bagheri and Mohammad-Reza Sadeghi",
title = "A new non-associative cryptosystem based on {NTOW}
public key cryptosystem and octonions algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "13--13",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768582",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bennenni:2015:CCD,
author = "Nabil Bennenni and Kenza Guenda and Aaron Gulliver",
title = "Construction of codes for {DNA} computing by the
greedy algorithm",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "14--14",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768583",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cherchem:2015:ESP,
author = "Ahmed Cherchem and Andr{\'e} Leroy",
title = "Exponents of skew polynomials",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "14--14",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768584",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Dougherty:2015:CLR,
author = "Steven T. Dougherty and Eseng{\"u}l Salturk",
title = "Codes over local rings of order $ 16 $ and their gray
maps",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "14--14",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768586",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Teodorescu:2015:MIP,
author = "Iuliana Cioc{\u{a}}nea Teodorescu",
title = "The module isomorphism problem for finite rings and
related results",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "14--14",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768585",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Dougherty:2015:CRO,
author = "Steven Dougherty and Eseng{\"u}l Salt{\"u}rk and Steve
Szabo",
title = "Codes over rings of order $ 16 $",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "15--15",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768587",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Manganiello:2015:NCS,
author = "Felice Manganiello",
title = "Network coding via skew polynomials",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "15--15",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768588",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Martinez-Moro:2015:MCP,
author = "Edgar Mart{\'\i}nez-Moro and Alejandro P. Nicol{\'a}s
and Ignacio F. R{\'u}a",
title = "Multivariable codes in principal ideal polynomial
quotient rings",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "15--15",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768589",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Aliasgari:2015:JTB,
author = "Malihe Aliasgari and Mohammad-Reza Sadeghi and Daniel
Panario",
title = "A {Johnson}-type bound for group codes and lattices",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "16--16",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768592",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Martinez-Moro:2015:LCZ,
author = "Edgar Mart{\'\i}nez-Moro and Steve Szabo and Bahattin
Yildiz",
title = "Linear codes over {$ Z_4 [x] / \langle x^2 - 2 x
\rangle $}: dual preserving maps and images as codes
over {$ Z_4 $}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "16--16",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768590",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Aliasgari:2015:BIA,
author = "Malihe Aliasgari and Daniel Panario and Mohammad-Reza
Sadeghi",
title = "Binomial ideal associated to a lattice and its label
code",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "16--17",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768593",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Arasu:2015:SCP,
author = "K. T. Arasu",
title = "{Stickelberger}'s congruences and perfect sequence
constructions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "17--17",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768594",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bakshi:2015:CDS,
author = "Ankita Bakshi and Deeksha",
title = "On a class of difference set pairs",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "17--17",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768595",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bard:2015:PRO,
author = "Gregory V. Bard and Theodore McDonnough",
title = "Plaintext recovery for one-time pads used twice",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "17--18",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768596",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bernal:2015:NMB,
author = "Jos{\'e} Joaqu{\'\i}n Bernal and Juan Jacobo Sim{\'o}n
and Diana H. Bueno-Carre{\~n}o",
title = "A notion of multivariate {BCH} bounds and codes",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "18--18",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768597",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Degwekar:2015:ECX,
author = "Akshay Degwekar and Kenza Guenda and T. Aaron
Gulliver",
title = "Extending construction {$X$} for quantum
error-correcting codes",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "18--18",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768598",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Duck:2015:DCG,
author = "Natalia D{\"u}ck and Irene M{\'a}rquez-Corbella and
Edgar Mart{\'\i}nez-Moro",
title = "The degree compatible {Gr{\"o}bner} fan for linear
codes",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "18--19",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768599",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Durcheva:2015:SAI,
author = "Mariana Durcheva",
title = "Some applications of idempotent semirings in public
key cryptography",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "19--19",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768600",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Garcia-Morchon:2015:HCR,
author = "Oscar Garc{\'\i}a-Morch{\'o}n and Ronald Rietman and
Ludo Tolhuizen and Domingo G{\'o}mez and Jaime
Guti{\'e}rrez",
title = "{HIMMO}: a collusion-resistant identity-based scheme
for symmetric key generation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "19--19",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768601",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sarabia:2015:OAI,
author = "Manuel Gonz{\'a}lez Sarabia",
title = "An overview on algebraic invariants and the main
parameters of some parameterized codes",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "19--20",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768602",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hufford:2015:SRF,
author = "James Hufford",
title = "Some results on finite fields",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "20--20",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768603",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Joyner:2015:EWC,
author = "David Joyner",
title = "Edge-weighted {Cayley} graphs, monotonicity and bent
functions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "20--21",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768604",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jurrius:2015:EGR,
author = "Relinde Jurrius and Ruud Pellikaan",
title = "The extended and generalized rank weight enumerator of
a code",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "21--21",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768605",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Marquez-Corbella:2015:ECP,
author = "Irene M{\'a}rquez-Corbella and Ruud Pellikaan",
title = "Error-correcting pairs: a new approach to code-based
cryptography",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "21--21",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768606",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Moufek:2015:MCB,
author = "Hamza Moufek and Kenza Guenda",
title = "{McEliece} cryptosystem based on punctured
convolutional codes and the pseudo-random generators",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "21--21",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768607",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Phillips:2015:SNA,
author = "Bo Phillips and Jace Robinson",
title = "Some new almost difference sets via finite fields",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "21--22",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768608",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Previato:2015:ECW,
author = "Emma Previato",
title = "Evaluation codes and {Weierstrass} semigroups",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "22--22",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768609",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Orozco:2015:OSC,
author = "Ana Lucila Sandoval Orozco and Luis Javier Garc{\'\i}a
Villalba and Mario Blaum",
title = "Optimum shortened cyclic codes for multiple
burst-error correction",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "22--23",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768610",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Arreche:2015:CDG,
author = "Carlos E. Arreche",
title = "Computing differential {Galois} groups of
parameterized second-order linear differential
equations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "23--23",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768612",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Barkatou:2015:DAC,
author = "Moulay A. Barkatou",
title = "A direct algorithm for computing $k$-simple forms of
first-order linear differential systems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "23--23",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768613",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Freitag:2015:BSF,
author = "James Freitag",
title = "Bounding the size of a finite differential algebraic
variety",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "23--24",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768614",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gao:2015:BDI,
author = "Xiao-Shan Gao",
title = "Binomial difference ideal and toric difference
variety",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "24--24",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768615",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Heiderich:2015:TNC,
author = "Florian Heiderich",
title = "Towards a non-commutative {Picard--Vessiot} theory",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "24--24",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768616",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jaroschek:2015:ROP,
author = "Maximilian Jaroschek",
title = "Radicals of {Ore} polynomials",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "24--24",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768617",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jeronimo:2015:EDL,
author = "Gabriela Jeronimo",
title = "Effective differential {L{\"u}roth} theorem",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "24--25",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768618",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Juan:2015:IAF,
author = "Lourdes Juan",
title = "On the integration of algebraic functions: computing
the logarithmic part",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "25--25",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768619",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kogan:2015:DAI,
author = "Irina A. Kogan",
title = "Differential algebra of invariants and invariant
variational calculus",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "25--25",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768620",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Labahn:2015:DSS,
author = "George Labahn",
title = "Dynamical systems and scaling invariants",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "25--25",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768621",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lange-Hegermann:2015:CSD,
author = "Markus Lange-Hegermann",
title = "Counting solutions of differential equations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "25--26",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768622",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lemaire:2015:NDA,
author = "Fran{\c{c}}ois Lemaire",
title = "New development and application of integration of
differential fractions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "26--26",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768623",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Levin:2015:GGB,
author = "Alexander Levin",
title = "Generalized {Gr{\"o}bner} bases and dimension
polynomials of modules over some finitely generated
noncommutative algebras",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "26--26",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768625",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sanchez:2015:PLE,
author = "Omar Le{\'o}n S{\'a}nchez",
title = "Parametrized logarithmic equations and their {Galois}
theory",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "26--26",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768624",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Maddah:2015:FSC,
author = "Suzy S. Maddah",
title = "Formal solutions of completely integrable {Pfaffian}
systems with normal crossings",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "26--27",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768626",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Maier:2015:PDE,
author = "Annette Maier",
title = "Parameterized differential equations and patching",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "27--27",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768627",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Medvedev:2015:DDA,
author = "Alice Medvedev",
title = "Dimensions of difference-algebraic groups",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "27--27",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768628",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Paramonov:2015:UUT,
author = "Sergey Paramonov",
title = "Undecidability of the uniqueness testing problem for
analytic solutions of {PLDE} with boundary conditions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "27--27",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768629",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Roques:2015:GGD,
author = "Julien Roques",
title = "{Galois} groups of difference equations on elliptic
curves",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "27--28",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768630",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Huang:2015:TAC,
author = "Guanli Huang and Meng Zhou",
title = "On the termination of algorithm for computing relative
{Gr{\"o}bner} bases",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "28--28",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768632",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wibmer:2015:JHT,
author = "Michael Wibmer",
title = "A {Jordan--H{\"o}lder} theorem for difference
algebraic groups",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "28--28",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768631",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Poinsot:2015:DLA,
author = "Laurent Poinsot",
title = "Differential (Lie) algebras from a functorial point of
view",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "28--29",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768634",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Dali:2015:LSC,
author = "Dahira Dali and Jugurta Mahrez",
title = "Local stability of cubic differential systems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "29--29",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768636",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Rueda:2015:DED,
author = "Sonia L. Rueda",
title = "Differential elimination by differential
specialization of {Sylvester} style matrices",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "29--29",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768635",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Previato:2015:DAA,
author = "Emma Previato",
title = "Differential algebraic aspect of orthogonal
polynomials and modular forms",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "29--30",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768637",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Keigher:2015:DEH,
author = "William F. Keigher and V. Ravi Srinivasan",
title = "Differential equations and {Hurwitz} series",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "31--31",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768640",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Launois:2015:EQG,
author = "Stephane Launois",
title = "Endomorphisms of quantum generalized {Weyl} algebras",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "31--31",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768639",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Maddah:2015:FRS,
author = "Suzy S. Maddah",
title = "On the formal reduction of singularly-perturbed linear
differential systems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "31--31",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768638",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Labahn:2015:RIF,
author = "George Labahn",
title = "Rational invariants of finite abelian groups",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "31--32",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768641",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ragulskis:2015:GMO,
author = "Minvydas Ragulskis",
title = "The generalized multiplicative operator of
differentiation for the construction of analytic
solitary solutions to nonlinear differential
equations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "32--32",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768643",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Zhang:2015:GKD,
author = "Yang Zhang and Xiangui Zhao",
title = "{Gelfand--Kirillov} dimension of differential
difference algebras",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "32--32",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768642",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Giesbrecht:2015:FDD,
author = "Mark Giesbrecht and Albert Heinle and Viktor
Levandovskyy",
title = "On factoring differential and difference operators in
$n$ variables",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "33--33",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768645",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Guo:2015:RBT,
author = "Li Guo and William Sit and Xing Gao and Shanghua
Zheng",
title = "{Rota--Baxter} type operators, rewriting systems and
{Gr{\"o}bner--Shirshov} bases",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "33--33",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768644",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Koutschan:2015:MPL,
author = "Christoph Koutschan and Erwin Suazo and Sergei K.
Suslov",
title = "Multi-parameter laser modes in paraxial optics",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "33--33",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768646",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Beaudin:2015:PFC,
author = "Michel Beaudin and Fr{\'e}d{\'e}ric Henri",
title = "Piecewise functions and convolution integrals (part
{I}, part {II})",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "34--34",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768651",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jeffrey:2015:RIT,
author = "David Jeffrey and Albert Rich and Junrui Hu",
title = "{RUBI} and integration as term re-writing: integrals
containing tangent",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "34--34",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768649",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Levin:2015:MGC,
author = "Alexander Levin",
title = "Method of generalized characteristic sets and
multivariate dimension polynomials of differential
field extensions with a group action",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "34--34",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768647",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Raab:2015:RRN,
author = "Clemens G. Raab",
title = "Rewrite rules for nested integrals",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "34--34",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768650",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Labelle:2015:CIP,
author = "Gilbert Labelle",
title = "Combinatorial integration (part {I}, part {II})",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "35--35",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768653",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lichtblau:2015:HSD,
author = "Daniel Lichtblau",
title = "The hazards of symbolic definite integration (a
continuing saga)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "35--35",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768652",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Moir:2015:UPR,
author = "Robert H. C. Moir and Robert M. Corless and David J.
Jeffrey",
title = "Unwinding paths on the {Riemann} sphere for continuous
integrals of rational functions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "35--35",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2768654",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Apr 30 16:35:04 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Editors:2015:ARD,
author = "{CCA Editors}",
title = "Abstracts of recent doctoral dissertations in computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "1",
pages = "36--36",
month = mar,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2768577.2791243",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jun 11 05:51:59 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Each quarter we are pleased to present abstracts of
recent doctoral dissertations in Computer Algebra and
Symbolic Computation. We encourage all recent Ph.D.
graduates who have defended in the past two years (and
their supervisors), to submit their abstracts for
publication in CCA. Please send abstracts to the CCA
editors {\tt editors_SIGSAM@acm.org} for
consideration.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fateman:2015:PAS,
author = "Richard Fateman",
title = "Partitioning of algebraic subexpressions in computer
algebra systems: an alternative to matching with an
application to symbolic integration",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "38--47",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815112",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/macsyma.bib;
https://www.math.utah.edu/pub/tex/bib/mathematica.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "A popular technique to direct transformations of
algebraic expressions in a computer algebra system such
as Macsyma/Maxima or Mathematica is to first write out
a pattern or template for some expected class of
``input'' expressions and use a built-in system routine
to match it, identifying pieces and giving them names,
then proceeding to compute with these parts. Sometimes
this is not such a good approach, and an alternative,
presented here, may be more appealing.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Beaudin:2015:SCN,
author = "Michel Beaudin",
title = "Same courses, new questions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "48--48",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815115",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Varbanova:2015:CCM,
author = "Elena Varbanova",
title = "{CAS} in the context of methodology of mathematics
education",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "48--48",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815114",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Garcia:2015:UTM,
author = "Alfonsa Garc{\'\i}a and Francisco Garc{\'\i}a and
{\'A}ngel Mart{\'\i}n del Rey and Gerardo
Rodr{\'\i}guez and Agust{\'\i}n de la Villa",
title = "Using technology in mathematical courses: some
possibilities",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "49--49",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815116",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Tiffany:2015:EMC,
author = "Patrice Geary Tiffany",
title = "Effectively melding computer algebra systems into the
calculus curriculum",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "49--50",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815117",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Farley:2015:SUR,
author = "Rosemary Carroll Farley",
title = "Student undergraduate research projects in linear
algebra using a computer algebra system",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "50--50",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815118",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Toon:2015:ICD,
author = "Andrew Toon",
title = "Investigating complex data and dynamics via computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "50--50",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815119",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Xue:2015:PIS,
author = "Michael Xue",
title = "Prove inequalities by solving maximum\slash minimum
problems using a computer algebra system",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "50--50",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815120",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Alcazar:2015:SDR,
author = "Juan G. Alc{\'a}zar and Carlos Hermoso and Georg
Muntingh",
title = "Symmetry detection of rational space curves",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "51--51",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815122",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bouzidi:2015:CSL,
author = "Yacine Bouzidi",
title = "Computing separating linear forms for bivariate
systems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "51--52",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815123",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Alcazar:2015:ICC,
author = "Juan G. Alc{\'a}zar and Carlos Hermoso and Jorge
Caravantes and Gema M. D{\'\i}az-Toca",
title = "Iterative computation of the convex hull of a rational
plane curve",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "52--52",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815125",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Beshaj:2015:JCS,
author = "L. Beshaj and T. Shaska and C. Shor",
title = "On {Jacobians} of curves with superelliptic
components",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "52--52",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815124",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{DAndrea:2015:RAS,
author = "Carlos D'Andrea",
title = "The {Rees} algebra of some monomial parametrizations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "52--53",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815126",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fioravanti:2015:CTA,
author = "Mario Fioravanti and Laureano Gonzalez-Vega and Jorge
Caravantes",
title = "Computing the topology of an arrangement of parametric
or implicit algebraic curves in the {Lagrange} basis",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "53--53",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815127",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lubbes:2015:CS,
author = "Niels Lubbes",
title = "Circles on surfaces",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "53--54",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815128",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Maza:2015:DAG,
author = "Marc Moreno Maza",
title = "Doing algebraic geometry with the {RegularChains}
library",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "54--54",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815129",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Rueda:2015:AAP,
author = "S. L. Rueda and J. Sendra and J. R. Sendra",
title = "An approximate algorithm to parametrize algebraic
curves",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "54--55",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815130",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Shaska:2015:GHC,
author = "Tony Shaska",
title = "Genus $3$ hyperelliptic curves with $ (2, 4, 4)$-split
{Jacobians}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "55--55",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815131",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Weimann:2015:CGM,
author = "Martin Weimann",
title = "Computing gonal maps of algebraic curves",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "55--55",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815132",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Coutsias:2015:BFO,
author = "Evangelos A. Coutsias",
title = "{Bricard} flexible octahedra and the canonical
cyclohexane",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "56--56",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815135",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Helmer:2015:ACC,
author = "Martin Helmer",
title = "Algorithms to compute {Chern--Schwartz--Macpherson}
and {Segr{\`e}} classes and the {Euler}
characteristic",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "56--56",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815134",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Minimair:2015:CCA,
author = "Manfred Minimair",
title = "Collaborative computer algebra systems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "56--57",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815136",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lewis:2015:ADR,
author = "Robert H. Lewis and Bela Pal{\'a}ncz and Joseph
Awange",
title = "Application of {Dixon} resultant to maximization of
the likelihood function of {Gaussian} mixture
distribution",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "57--57",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815138",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Tot:2015:SDP,
author = "Jonathan Tot",
title = "Spinning double pendulum: equilibria and
bifurcations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "57--57",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815137",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Beshaj:2015:HHS,
author = "L. Beshaj",
title = "Heights on hyperelliptic and superelliptic curves",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "58--58",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815142",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Elezi:2015:QCE,
author = "A. Elezi",
title = "Quantum computing, error correcting quantum codes and
algebraic curves",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "58--58",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815141",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gutierrez:2015:RZH,
author = "J. Gutierrez",
title = "Recovering zeroes of hyperelliptic curves over finite
fields",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "58--58",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815140",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Shaska:2015:MMS,
author = "T. Shaska",
title = "Minimal models for superelliptic curves over their
minimal field of definition",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "58--58",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815145",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Shor:2015:WWB,
author = "C. Shor",
title = "On the $q$-{Weierstrass} weights of branch points of
superelliptic curves",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "58--58",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815143",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Trager:2015:GRP,
author = "Barry Trager",
title = "Good reduction of plane curves",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "58--58",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815144",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Galetto:2015:ADA,
author = "Federico Galetto",
title = "An algorithm for determining actions of semisimple
{Lie} groups on free resolutions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "59--59",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815148",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kelly:2015:ACP,
author = "Tyler Kelly",
title = "An algorithm for computing {Picard} ranks of certain
{K3} surfaces",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "59--59",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815147",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Manon:2015:HCH,
author = "Chris Manon",
title = "Horospherical contraction and {Hamiltonian} functions
on an algebraic group",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "59--59",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815149",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Paulhus:2015:DJV,
author = "Jennifer Paulhus",
title = "Decomposing {Jacobian} varieties",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "59--59",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815150",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Adj:2015:CDL,
author = "Gora Adj and Alfred Menezes and Thomaz Oliveira and
Francisco Rodr{\'\i}guez-Henr{\'\i}quez",
title = "Computing discrete logarithms using {Joux}'s
algorithm",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "60--60",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815154",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jensen:2015:BNT,
author = "David Jensen",
title = "{Brill--Noether} theory for metric graphs",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "60--60",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815151",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ksir:2015:ATC,
author = "Amy Ksir",
title = "Automorphisms of tropical curves and {Berkovich}
analytic curves and their skeletons",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "60--60",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815152",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Dukkipati:2015:GBR,
author = "Ambedkar Dukkipati and Nithish Pai and Maria Francis
and Abhishek Dubey",
title = "On {Gr{\"o}bner} bases over rings and residue class
polynomial rings with torsion",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "60--61",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815155",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Eder:2015:SSB,
author = "Christian Eder and Jean-Charles Faug{\`e}re",
title = "A survey on signature-based {Gr{\"o}bner} basis
computations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "61--61",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815156",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Faugere:2015:SGB,
author = "Jean-Charles Faug{\`e}re and Pierre-Jean Spaenlehauer
and Jules Svartz",
title = "Sparse {Gr{\"o}bner} bases: algorithms and
complexity",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "61--62",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815157",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Albrecht:2015:AAL,
author = "Martin R. Albrecht and Carlos Cid and Jean-Charles
Faug{\`e}re and Robert Fitzpatrick and Ludovic Perret",
title = "Algebraic algorithms for {LWE} problems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "62--62",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815158",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Perry:2015:SYF,
author = "John Perry",
title = "The skeletons you find when you order your ideal's
closet",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "62--63",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815159",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Tamayo:2015:AFH,
author = "Matthew Tamayo",
title = "Algebraic full homomorphic encryption and resisting
{Gr{\"o}bner} basis cryptanalysis",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "63--63",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815160",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sun:2015:ISB,
author = "Yao Sun and Dongdai Lin and Dingkang Wang",
title = "On implementing signature-based {Gr{\"o}bner} basis
algorithms using linear algebraic routines from
{M4RI}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "63--64",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815161",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Dana-Picard:2015:RPP,
author = "Thierry N. Dana-Picard",
title = "Review of {``Pavel Pech: \booktitle{Selected topics in
geometry with classical vs. computer proving}'', World
Scientific 2007 ISBN-10: 981-270-942-8, ISBN-13:
978-981-270-942-4}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "65--66",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815163",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Nowadays, the interplay between Geometry and Algebra
is present almost everywhere. Classical theorems from
Geometry may be revived with the usage of automatic
theorem proving, based on Computer Algebra Systems and
other technologies. Pech's book displays six stories
about classical theorems, providing both a computer
based proof and a classical one, making the reader
acquainted with new methods of discovering and proving
results together with leading the same reader to think
about the inner beauty of classical ways of proving.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ziegler:2015:ARD,
author = "Konstantin Ziegler",
title = "Abstracts of recent doctoral dissertations in computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "2",
pages = "67--67",
month = jun,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2815111.2815165",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Aug 14 17:27:46 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Each quarter we are pleased to present abstracts of
recent doctoral dissertations in Computer Algebra and
Symbolic Computation. We encourage all recent Ph.D.
graduates who have defended in the past two years (and
their supervisors), to submit their abstracts for
publication in CCA. Please send abstracts to the CCA
editors {\tt <editors\_SIGSAM@acm.org>} for
consideration.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{England:2015:RIS,
author = "Matthew England",
title = "Report on the {40th International Symposium on
Symbolic and Algebraic Computation}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "3",
pages = "69--69",
month = sep,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2850449.2850450",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Dec 2 14:16:56 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The 40th International Symposium on Symbolic and
Algebraic Computation (ISSAC 2015) was held at The
University of Bath, Bath, UK from 6 --- 9 July 2015. It
featured: o 43 Contributed Paper talks selected by the
ISSAC 2015 Program Committee; o 3 Invited Speakers; o 3
Tutorial Sessions; o 12 Poster Presentations; o 6
Software Demonstrations.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Duchamp:2015:HSP,
author = "G{\'e}rard H. E. Duchamp and Hoang Ngoc Minh and Ngo
Quoc Hoan",
title = "Harmonic sums and polylogarithms at negative
multi-indices",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "3",
pages = "70--73",
month = sep,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2850449.2850452",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Dec 2 14:16:56 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lee:2015:SMW,
author = "Dong-il Lee",
title = "Standard monomials for the {Weyl} group {$ F_4 $}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "3",
pages = "74--76",
month = sep,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2850449.2850453",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Dec 2 14:16:56 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The Weyl group of a root system coming from the Lie
theory is defined to be the group generated by
reflections with respect to the roots. We have three
series of finite Weyl groups and five exceptional Weyl
groups. For the Weyl groups of classical and some
exceptional types, their Gr{\"o}bner-Shirshov bases
were constructed in [3, 7, 8].",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kytmanov:2015:FRI,
author = "A. A. Kytmanov and A. M. Kytmanov and E. K. Myshkina",
title = "On finding residue integrals for a class of systems of
non-algebraic equations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "3",
pages = "77--79",
month = sep,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2850449.2850454",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Dec 2 14:16:56 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "A method of finding residue integrals for systems of
non-algebraic equations containing analytic functions
is presented. Such integrals are connected to the power
sums of roots for a certain system of equations. The
described approach can be used for developing methods
for the elimination of unknowns from systems of
non-algebraic equations.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hirata:2015:SEM,
author = "Takuya Hirata and Kazuya Yamaguchi and Ichijo Hodaka",
title = "A symbolic equation modeler for electric circuits",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "3",
pages = "80--82",
month = sep,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2850449.2850455",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Dec 2 14:16:56 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "When users analyze symbolically physical phenomena,
software products which partially help them write a
symbolic equation to the phenomena are available. In
electric engineering, there are a few software products
which compute symbolically voltages and currents of
electric circuits. They cover the frequency response
analysis on behavior of linear time-invariant (LTI)
circuits. However, they do not cover symbolic
computation on the time response of circuits. This
paper introduces a software product which generates a
model for computing the time response of LTI
circuits.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{McCleeary:2015:LAA,
author = "Ryan McCleeary and Martin Brain and Aaron Stump",
title = "A lazy approach to adaptive exact real arithmetic
using floating-point operations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "3",
pages = "83--86",
month = sep,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2850449.2850456",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Dec 2 14:16:56 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Arithmetic operations with high degrees of precision
are needed for an increasing number of applications. We
propose an exact real arithmetic system that achieves
adaptive precision using lazy infinite lists of
floating-point values.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{DeFeo:2015:DRF,
author = "Luca {De Feo} and Christophe Petit and Micha{\"e}l
Quisquater",
title = "Deterministic root finding in finite fields",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "3",
pages = "87--89",
month = sep,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2850449.2850457",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Dec 2 14:16:56 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Finding roots of polynomials with coefficients in a
finite field is a special instance of the polynomial
factorization problem. The most well known algorithm
for factoring and root-finding is the Cantor-Zassenhaus
algorithm. It is a Las Vegas algorithm with running
time polynomial in both the polynomial degree and the
field size. Its running time is quasi-optimal for the
special case of root-finding. No deterministic
polynomial time algorithm for these problems is known
in general, however several deterministic algorithms
are known for special instances, most notably when the
characteristic of the finite field is small. The goal
of this poster is to review the best deterministic
algorithms for root-finding, in a systematic way. We
present, in a unified way, four algorithms: o
Berlekamp's Trace Algorithm [2] (BTA), o Moenk's
Subgroup Refinement Method [7] (SRM), o Menezes, van
Oorschot and Vanstone's Affine Refinement Method [5,
10] (ARM), and o Petit's Successive Resultants
Algorithm [8] (SRA). It is the first time that these
algorithms are presented together in a comprehensive
way, and that they are rigorously analysed, implemented
and compared to each other. In doing so, we obtain
several new results: o We significantly improve the
complexity ARM, matching that of BTA and SRA. o We
highlight a profound duality relationship between ARM
and SRA. o We show how to combine ARM with SRM to
obtain a new algorithm, which always performs better,
and of which ARM and SRM are special instances. The new
algorithm considerably extends the range of finite
fields for which deterministic polynomial time
root-finding is possible. o We present several
practical and asymptotic improvements to special
instances of the algorithms. Part of these results were
submitted in response to the call for papers of ISSAC
'15, but were rejected. This poster corrects some minor
imperfections, improves the asymptotic complexities of
some algorithms, and presents a new algorithm not
previously known.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Pillwein:2015:EPD,
author = "Veronika Pillwein and Miriam Schussler",
title = "An efficient procedure deciding positivity for a class
of holonomic functions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "3",
pages = "90--93",
month = sep,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2850449.2850458",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Dec 2 14:16:56 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We present an efficient decision procedure for
positivity on a class of holonomic sequences satisfying
recurrences of arbitrary order.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Monagan:2015:USI,
author = "Michael Monagan and Baris Tuncer",
title = "Using sparse interpolation to solve multivariate
diophantine equations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "3",
pages = "94--97",
month = sep,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2850449.2850459",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Dec 2 14:16:56 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Suppose that we seek to factor a multivariate
polynomial $ a \epsilon R = Z[x_1, \ldots {}, x_n] $
and $ a = f g $ with $ f, g \in R $. The multivariate
Hensel lifting algorithm (MHL) developed by Wang [1]
uses a prime number $p$ and an ideal $ I = \langle x_2
- \alpha_2, \ldots {}, x_n - \alpha_n \rangle $ of $
Z_p [x_1, \ldots {}, x_n]$ where $ \alpha_2, \alpha_3,
\ldots {}, \alpha_n \epsilon Z_p$ is an evaluation
point chosen by the algorithm.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hebisch:2015:ITE,
author = "Waldemar Hebisch",
title = "Integration in terms of exponential integrals and
incomplete gamma functions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "3",
pages = "98--100",
month = sep,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2850449.2850460",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Dec 2 14:16:56 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Indefinite integration means that given $f$ in some
set we want to find $g$ from possibly larger set such
that $ f = g'$. When $f$ and $g$ are required to be
elementary functions due to work of among others Risch,
Rothstein, Trager, Bronstein (see [1] for references)
integration problem is now solved at least in theory.
In his thesis Cherry gave algorithm to integrate
transcendental elementary functions in terms of
exponential integrals. In [2] he gave algorithm to
integrate transcendental elementary functions in so
called reduced fields in terms of error functions.
Knowles [3] and [4] extended this allowing also
liovillian integrands and weakened restrictions on the
field containing integrands. We extend previous results
allowing incomplete gamma function $ \Gamma (a, x)$
with rational $a$. Also, our theory can handle
algebraic extensions and is complete jointly (and not
only separately for Ei and erf). In purely
transcendental case our method should be more efficient
and easier to implement than [2]. In fact, it seems
that no system currently implements algorithm from [2],
while partial implementation of our method in FriCAS
works well enough to be turned on by default. With our
approach non-reduced case from [2] can be handled
easily. We hope that other classes of special functions
can be handled in a similar way, in particular
irrational case of incomplete gamma function and
polylogarithms (however polylogarithms raise tricky
theoretical questions).",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Caboara:2015:HQP,
author = "Massimo Caboara and Carla Mascia",
title = "On the {Hilbert} quasi-polynomials for non-standard
graded rings",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "3",
pages = "101--104",
month = sep,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2850449.2850461",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Dec 2 14:16:56 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The Hilbert function, its generating function and the
Hilbert polynomial of a graded ring $ K[x_1, \ldots {},
x_k] $ have been extensively studied since the famous
paper of Hilbert: Ueber die Theorie der algebraischen
Formen ([Hilbert, 1890]). In particular, the
coefficients and the degree of the Hilbert polynomial
play an important role in Algebraic Geometry. If the
ring grading is non-standard, then its Hilbert function
is not eventually equal to a polynomial but to a
quasi-polynomial. It turns out that a Hilbert
quasi-polynomial $P$ of degree $n$ splits into a
polynomial $S$ of degree $n$ and a lower degree
quasi-polynomial $T$. We have completely determined the
degree of $T$ and the first few coefficients of $P$.
Moreover, the quasi-polynomial $T$ has a periodic
structure that we have described. We have also
developed a software to compute effectively the Hilbert
quasi-polynomial for any ring $ K[x_1, \ldots {}, x_k]
/ I$.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Yasuda:2015:MQC,
author = "Takanori Yasuda and Xavier Dahan and Yun-Ju Huang and
Tsuyoshi Takagi and Kouichi Sakurai",
title = "A multivariate quadratic challenge toward post-quantum
generation cryptography",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "3",
pages = "105--107",
month = sep,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2850449.2850462",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Dec 2 14:16:56 MST 2015",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Multivariate polynomials over finite fields have found
applications in Public Key Cryptography (PKC) where the
hardness to find solutions provides the ``one-way
function'' indispensable to such cryptosystems. Several
schemes for both encryption and signature have been
proposed, many of which are using quadratic (degree 2)
polynomials. Finding a solution to such systems in
general is called MQ problem, which easiest ``generic''
instances are NP-hard. An important feature of this
Multivariate Pubic Key Cryptography (MPKC) is the
resistance to quantum computers: no faster quantum
algorithm than classical ones to solve MQ problem is
known. Besides being thereby a candidate for
Post-Quantum Cryptography, signatures are much shorter
than to other candidates. We have established an open
public ``MQ Challenge'' (https://www.mqchallenge.org)
to stimulate progress in the design of efficient
algorithms to solve MQ problem, and thus test limit
parameters guaranteeing security of MPKC.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Liu:2015:RGB,
author = "Yue Liu",
title = "Research on {Gr{\"o}bner} basis of the defining ideal
of polynomial ring in quaternionic variables",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "3",
pages = "108--108",
month = sep,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2850449.2850464",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Dec 2 14:16:56 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Li:2015:TAD,
author = "Yinghong Li",
title = "Theories and algorithms for difference and
differential {Chow} form",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "3",
pages = "108--109",
month = sep,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2850449.2850465",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Dec 2 14:16:56 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Zhou:2015:CAB,
author = "Jie Zhou",
title = "The computations and applications based on
comprehensive {Groebner} system",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "3",
pages = "109--110",
month = sep,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2850449.2850466",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Dec 2 14:16:56 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Zhu:2015:CAB,
author = "Wei Zhu",
title = "The computations and applications based on
comprehensive {Groebner} system",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "3",
pages = "110--110",
month = sep,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2850449.2850467",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Dec 2 14:16:56 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kaltofen:2015:JPA,
author = "Erich Kaltofen",
title = "{Jenks Prize 2015} award citation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "4",
pages = "112--112",
month = dec,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2893803.2893804",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Feb 17 16:05:57 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The 2015 Richard D. Jenks Memorial Prize was awarded
on October 30, 2015 at the Fields Institute in Toronto
during the Major Thematic Program on Computer Algebra
to Professor Victor Shoup for NTL: A Library for doing
Number Theory.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Abbott:2015:WNC,
author = "John Abbott and Anna Maria Bigatti",
title = "What is new in {CoCoALib} and {CoCoA-5}?",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "4",
pages = "113--116",
month = dec,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2893803.2893805",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Feb 17 16:05:57 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "CoCoA is a well-established Computer Algebra System
for Computations in Commutative Algebra, and
specifically for Gr{\"o}bner bases. In the last few
years the CoCoA software has undergone a profound
change: the code has been totally re-written in C++,
and includes CoCoA-5 (an interactive system) and
CoCoALib (an open source C++ library). The new CoCoA-5
language resembles the old CoCoA-4 language, but has
clearly defined semantics, making it both more robust
and more flexible than CoCoA-4. CoCoALib is the
mathematical core; its design focusses on ease of use
so that other software can readily use it as a library
for multivariate polynomial computations and other
Commutative Algebra operations. The internal design of
the software makes it easy to integrate other libraries
and to render all CoCoALib extensions accessible via
the interactive CoCoA-5 system.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Chien:2015:CTD,
author = "Bui Van Chien and G. H. E. Duchamp and Hoang Ngoc
Minh",
title = "Computation tool for the $q$-deformed quasi-shuffle
algebras and representations of structure of {MZVs}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "4",
pages = "117--120",
month = dec,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2893803.2893806",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Feb 17 16:05:57 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We would like to introduce our package using Maple to
compute within the q -deformed$^1$ quasi-shuffle
algebras and to represent structure of multiple zeta
values (MZVs). For this package, we can define an
arbitrary alphabet from which the letters associated
with indices totally ordered and then carry out
computations on words, that will complement functions
for the package StringTools in Maple. In the vector
space of (noncommutative) polynomials which is equipped
q -deformed quasi-shuffle products and concatenation
product [1, 2], we compute the bases in duality and
express an arbitrary homogeneous polynomial in terms of
these bases. Moreover, due to our algorithms, we can
represent structure of MZVs on the transcendence bases
in terms of irreducible elements [4]. We used this
package to compute all examples and verify the results
in the paper [4] which was present at the conference
ISSAC 2015.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Grenet:2015:LCB,
author = "Bruno Grenet",
title = "{Lacunaryx}: computing bounded-degree factors of
lacunary polynomials",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "4",
pages = "121--124",
month = dec,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2893803.2893807",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Feb 17 16:05:57 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In this paper, we report on an implementation in the
free software Mathemagix [9] of lacunary factorization
algorithms, distributed as a library called Lacunaryx.
These algorithms take as input a polynomial in sparse
representation, that is as a list of nonzero monomials,
and an integer $d$, and compute its degree-$d$ factors.
The complexity of these algorithms is polynomial in the
sparse size of the input polynomial and $d$: The sparse
size of a polynomial [EQUATION] log where the $
h(\cdot)$ denotes the height of a rational number, that
is the maximum of the absolute values of its numerator
and denominator.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hornecker:2015:CMC,
author = "Achim Hornecker",
title = "{CloudMath}: mathematical collaboration within the
cloud",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "4",
pages = "125--126",
month = dec,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2893803.2893808",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Feb 17 16:05:57 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "CloudMath is an interactive cloud based system for
mathematical work independent of the local environment.
It uses the advantages of modern web technologies and
open mathematical systems.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ren:2015:CTV,
author = "Yue Ren",
title = "Computing tropical varieties over fields with
valuation using classical standard basis techniques",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "4",
pages = "127--129",
month = dec,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2893803.2893809",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Feb 17 16:05:57 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In this presentation, we discuss the application of
classical Gr{\"o}bner basis (or standard basis)
techniques to algebraic problems in polynomial rings
over fields with non-trivial valuation arising in
tropical geometry. The key problem we will study is the
computation of a tropical variety, given its ideal in
the polynomial ring. All algorithms in this
presentation have been implemented in the computer
algebra system Singular and are available as part of
the official distribution.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Verschelde:2015:PHC,
author = "Jan Verschelde and Xiangcheng Yu",
title = "Polynomial homotopy continuation on {GPUs}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "4",
pages = "130--133",
month = dec,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2893803.2893810",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Feb 17 16:05:57 MST 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/python.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The purpose of the software presentation is to
announce a library to track many solution paths defined
by a polynomial homotopy on a Graphics Processing Unit
(GPU). Developed on NVIDIA graphics cards with CUDA
SDKs, our code is released under the GNU GPL license.
Via the C interface to PHCpack, we can call our GPU
library from Python.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Emiris:2015:RWA,
author = "Ioannis Emiris",
title = "Research workshop on algebraic representations in
computer-aided design for complex shapes",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "49",
number = "4",
pages = "134--134",
month = dec,
year = "2015",
CODEN = "????",
DOI = "https://doi.org/10.1145/2893803.2893811",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Feb 17 16:05:57 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This is the Kickoff Workshop of European Network
ARCADES, and also serves as a Recruitment event for the
Network's 13 open PhD positions. There is funding
available for student participants.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lecerf:2016:SSK,
author = "Gr{\'e}goire Lecerf and Joelle Saad{\'e}",
title = "A short survey on {Kantorovich}: like theorems for
{Newton}'s method",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "1",
pages = "1--11",
month = mar,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2930964.2930965",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Apr 27 16:14:51 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We survey influential quantitative results on the
convergence of the Newton iterator towards simple roots
of continuously differentiable maps defined over Banach
spaces. We present a general statement of Kantorovich's
theorem, with a concise proof from scratch, dedicated
to wide audience. From it, we quickly recover known
results, and gather historical notes together with
pointers to recent articles.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Delgado:2016:NGP,
author = "M. Delgado and P. A. Garc{\'\i}a-S{\'a}nchez",
title = "{\tt numericalsgps}, a {GAP} package for numerical
semigroups",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "1",
pages = "12--24",
month = mar,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2930964.2930966",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Apr 27 16:14:51 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The package numericalsgps performs computations with
and for numerical and affine semigroups. This
manuscript is a survey of what the package does, and at
the same time intends to gather the trending topics on
numerical semigroups.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Labahn:2016:TPC,
author = "George Labahn and Stephen Watt",
title = "Thematic program in computer algebra: {July 1--Dec 31,
2015}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "1",
pages = "25--26",
month = mar,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2930964.2930967",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Apr 27 16:14:51 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "During the second half of 2015, the Fields Institute
hosted the Thematic Program on Computer Algebra. This
program attracted some 125 individuals working in the
subject's various areas.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kauers:2016:WSC,
author = "Manuel Kauers and Peter Paule and Greg Reid",
title = "Workshop on symbolic combinatorics and algorithmic
differential algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "1",
pages = "27--34",
month = mar,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2930964.2930968",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Apr 27 16:14:51 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The workshop on Symbolic Combinatorics and
Computational Differential Algebra was held from
September 14 to September 20, 2015 as part of the
Thematic Program on Computer Algebra at the Fields
Institute in Toronto, Canada. The workshop was devoted
to algorithmic developments in Combinatorics and
Differential Algebra with a particular focus on the
interaction of these two areas.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ilie:2016:AEC,
author = "Silvana Ilie and Arne Storjohann",
title = "Abstracts of the {2015 East Coast Computer Algebra
Day}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "1",
pages = "35--39",
month = mar,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2930964.2930969",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Apr 27 16:14:51 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In the past decade, the introduction of low-level
heterogeneous programming models, in particular CUDA,
has brought supercomputing to the level of the desktop
computer. However, these models bring notable
challenges, even to expert programmers. Indeed, fully
exploiting the power of hardware accelerators with
CUDA-like code often requires significant code
optimization e.ort. While this development can
certainly yield high performance, it is desirable for
some programmers to avoid the explicit management of
device initialization and data transfer between memory
levels. To this end, high-level models for accelerator
programming, like OpenMP and OpenACC, have become an
important research direction. With these models,
programmers only need to annotate their C/C++ code to
indicate which code portion is to be executed on the
device and how data maps between host and device.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Meng:2016:ARD,
author = "Lingchuan Meng",
title = "Abstracts of recent doctoral dissertations in computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "1",
pages = "40--42",
month = mar,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2930964.2930970",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Apr 27 16:14:51 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Polynomial multiplication is a key algorithm
underlying computer algebra systems (CAS) and its
efficient implementation is crucial for the performance
of CAS. In this context coefficients of polynomials
come from domains such as the integers, rationals and
finite fields where arithmetic is performed exactly
without rounding error.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Maignan:2016:FGL,
author = "Aude Maignan and Tony C. Scott",
title = "Fleshing out the generalized {Lambert} {$W$}
function",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "2",
pages = "45--60",
month = jun,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2992274.2992275",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Aug 25 17:57:39 MDT 2016",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Herein, we use Hardy's notion of the ``false
derivative'' to obtain exact multiple roots in closed
form of the transcendental--algebraic equations
representing the generalized Lambert $W$ function. In
this fashion, we flesh out the generalized Lambert $W$
function by complementing previous developments to
produce a more complete and integrated body of work.
Finally, we demonstrate the usefulness of this special
function with some applications.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Abramov:2016:CCA,
author = "Sergei A. Abramov and Leonid A. Sevastianov",
title = "The conference {``computer algebra''} in {Moscow}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "2",
pages = "61--68",
month = jun,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2992274.2992276",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Aug 25 17:57:39 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The International Conference ``Computer Algebra'' was
held in Moscow, Russia from June 29 till July 2, 2016.
The conference web-site is
\url{http://www.ccas.ru/ca/conference}. Co-organized by
the Dorodnicyn Computing Centre (Federal Research
Center ``Computer Science and Control'') of the Russian
Academy of Sciences and the Peoples' Friendship
University of Russia. It was devoted to computer
algebra and related topics. The conference was
supported by the Russian Foundation for Basic Research
under Grant No. 16-01-20379.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sasaki:2016:MPM,
author = "Tateaki Sasaki and Hiroshi Kai",
title = "Memories on {Professor Matu-tarow Noda}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "2",
pages = "69--69",
month = jun,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/2992274.2992277",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Aug 25 17:57:39 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Schwarz:2016:DSQ,
author = "Fritz Schwarz",
title = "Decomposing and solving quasilinear second-order
differential equations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "3",
pages = "73--82",
month = sep,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3015306.3015307",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Nov 4 16:34:18 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Decompositions of linear ordinary differential
equations (ode's) into components of lower order have
successfully been employed for determining its
solutions. Here this method is generalized to certain
classes of quasilinear equations of second order, i.e.,
equations that are linear w.r.t. the second derivative,
and rational otherwise. Often it leads to simple
expressions for the general solution that hardly can be
obtained otherwise, i.e., it is a genuine extension of
Lie's symmetry analysis. Due to its efficiency it is
suggested that it is applied always as a first step in
an ode solver.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "197",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Abanades:2016:DAR,
author = "Miguel Ab{\'a}nades and Francisco Botana and
Zolt{\'a}n Kov{\'a}cs and Tom{\'a}s Recio and Csilla
S{\'o}lyom-Gecse",
title = "Development of automatic reasoning tools in
{GeoGebra}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "3",
pages = "85--88",
month = sep,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3015306.3015309",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Nov 4 16:34:18 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Much effort has been put into the implementation of
automatic proving in interactive geometric environments
(e.g., Java Geometry Expert, GeoGebra). The closely
related concept of automatic discovery, remains however
almost unexplored. This software presentation will
demonstrate our results towards the incorporation of
automatic discovery capabilities into GeoGebra, an
educational software with tens of millions of users
worldwide. As main result, we report on a new command,
currently available in the official version, that
allows the automatic discovery of loci of points in
diagrams defined by implicit conditions. This
represents an extension of a previous command, similar
in nature, but restricted to loci defined by the
standard mover-tracer construction. Our proposal
successfully automates the `dummy locus dragging' in
dynamic geometry. This makes the cycle
conjecturing-checking-proving accessible for general
users in elementary geometry.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "197",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Aichinger:2016:SGT,
author = "Erhard Aichinger and Rika Yatchak",
title = "{Sonata}: a {GAP} tool for nearring computations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "3",
pages = "89--92",
month = sep,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3015306.3015310",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Nov 4 16:34:18 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "A nearring N is an algebra that does not satisfy the
ring axioms, but nevertheless satisfies a one-sided
distributivity law. SONATA is a GAP package designed as
a research tool for nearrings. Users are able to define
and work with finite nearrings in order to generate and
test conjectures.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "197",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Alvandi:2016:CLR,
author = "Parisa Alvandi and Mahsa Kazemi and Marc Moreno Maza",
title = "Computing limits with the regular chains and power
series libraries: from rational functions to {Zariski}
closure",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "3",
pages = "93--96",
month = sep,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3015306.3015311",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Nov 4 16:34:18 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Many fundamental concepts in mathematics are defined
in terms of limits and it is desirable for computer
algebra systems to be able to compute them. However,
limits of functions, limits of secants or topological
closures are, by essence, hard to compute in an
algorithmic fashion, say by doing finitely many
rational operations on polynomials or matrices over the
usual coefficient fields of symbolic computation. This
is why a computer algebra system like Maple is not
capable of computing limits of rational functions in
more than two variables while it can perform highly
sophisticated algebraic computations like solving
(formally) a system of partial differential
equations.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "197",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Chen:2016:BPA,
author = "Changbo Chen and Svyatoslav Covanov and Farnam
Mansouri and Robert H. C. Moir and Marc Moreno Maza and
Ning Xie and Yuzhen Xie",
title = "The basic polynomial algebra subprograms",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "3",
pages = "97--100",
month = sep,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3015306.3015312",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Nov 4 16:34:18 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The Basic Polynomial Algebra Subprograms (BPAS)
provides arithmetic operations (multiplication,
division, root isolation, etc.) for univariate and
multivariate polynomials over common types of
coefficients (prime fields, complex rational numbers,
rational functions, etc.). The code is mainly written
in CilkPlus [10] targeting multicore processors. The
current distribution focuses on dense polynomials and
the sparse case is work in progress. A strong emphasis
is put on adaptive algorithms as the library aims at
supporting a wide variety of situations in terms of
problem sizes and available computing resources. The
BPAS library is publicly available in source at
www.bpaslib.org.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "197",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fukasaku:2016:CSR,
author = "Ryoya Fukasaku and Hidenao Iwane and Yosuke Sato",
title = "{CGSQE\slash SyNRAC}: a real quantifier elimination
package based on the computation of comprehensive
{Gr{\"o}bner} systems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "3",
pages = "101--104",
month = sep,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3015306.3015313",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Nov 4 16:34:18 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "CGSQE is a Maple package for real quantifier
elimination (QE) we are developing. It works
cooperating with SyNRAC which is also a Maple package
for real QE one of the authors is developing. For a
given first order formula, CGSQE eliminates all
possible quantifiers using the underlying equational
constraints by the computation of comprehensive
Gr{\"o}bner systems (CGSs). In case all quantifiers are
not removable, it transforms the given formula into a
formula which contains only strict inequalities of
quantified variables, then uses a cylindrical algebraic
decomposition based real QE program of SyNRAC to remove
the remaining quantifiers. The core algorithm of CGSQE
is a CGS real QE algorithm which was first introduced
by Weispfenning in 1998 and further improved by us in
2015 so that we can make a satisfactorily practical
implementation. CGSQE is superior to other real QE
implementations for many examples which contain many
equational constraints. In the software presentation,
we would like to show high-performance computation of
CGSQE.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "197",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Groves:2016:SPF,
author = "A. Whitman Groves and Daniel S. Roche",
title = "Sparse polynomials in {FLINT}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "3",
pages = "105--108",
month = sep,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3015306.3015314",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Nov 4 16:34:18 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We have implemented a high-performance C library for
sparse polynomials, which is provided as an add-on
module to the open-source computation library FLINT
[7]. Our implementation incorporates a number of recent
theoretical advances in supersparse polynomial
arithmetic, most notably recent algorithms for sparse
interpolation and multiplication. We provide a summary
of the provided functionality, a selection of key
implementation decisions, and some preliminary timing
data.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "197",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Koutschan:2016:MPP,
author = "Christoph Koutschan",
title = "Motion polynomials and planar linkages",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "3",
pages = "109--112",
month = sep,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3015306.3015315",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Nov 4 16:34:18 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We present the Mathematica package PlanarLinkages,
which provides commands for constructing and
visualizing planar linkages that draw a prescribed
algebraic curve of genus 0, or more generally, that
follow a prescribed rational motion. Since the
implemented algorithms are heavily based on the concept
of motion polynomials, the functionality of the package
also includes basic arithmetic of motion polynomials
and a factorization procedure.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "197",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Leykin:2016:PHC,
author = "Anton Leykin",
title = "Polynomial homotopy continuation in {Macaulay2}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "3",
pages = "113--116",
month = sep,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3015306.3015316",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Nov 4 16:34:18 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "While primarily symbolic, the computer algebra system
Macaulay2 has acquired a range of numerical tools in
the recent years. We describe the design changes in its
NumericalAlgebraicGeometry package and the
corresponding changes in the core of the system. We
also discuss support packages and other packages that
depend on methods provided by homotopy continuation.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "197",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Tsigaridas:2016:SSR,
author = "Elias Tsigaridas",
title = "{SLV}: a software for real root isolation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "3",
pages = "117--120",
month = sep,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3015306.3015317",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Nov 4 16:34:18 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The problem of isolating the real roots of a
univariate polynomial with integer coefficients is an
important problem in computational mathematics. Given a
polynomial with integer coefficients, [EQUATION], the
objective is to isolate the real roots of $f$, that is
to compute intervals with rational endpoints that
contain one and only one root of $f$. SLV is an open
source software package written in C that provides
functions for isolating the real roots of univariate
polynomials with integer coefficients. It also provides
functionality to approximate the isolated roots up to
an arbitrary precision. Currently, it is realizes a
subdivision algorithm based on Descartes' rule of sign,
with modifications to improve its performance. SLV
assumes that the input is a square-free polynomial. It
performs all the operations using exact arithmetic
based on the library gmp and it exploits as much as
possible computations with dyadic numbers, that is
numbers of the form $ a / 2^k$ where $a$ and $k$ are
integers. It builds upon a constant memory variant of
Descartes' rule of sign [3]. To minimize the number of
allocations in the memory we wrote a small wrapper to
use the queue.h library of OpenBSD, in order to have
access to a fast implementation of lists and queues.
Even though queue.h is written in C, it is a library
that follows the generic programming paradigm, and if
it is programmed carefully, it could be used with
various data sets.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "197",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2016:JMB,
author = "Anonymous",
title = "{Jonathan M. Borwein}, former {CMS President}, dies at
65",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "3",
pages = "121--122",
month = sep,
year = "2016",
CODEN = "????",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Apr 04 14:00:57 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/bibnet/authors/b/borwein-jonathan-m.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "197",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Maurischat:2016:NFI,
author = "Andreas Maurischat",
title = "Non-free iterative differential modules",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "4",
pages = "126--135",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3055282.3055283",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 23 07:24:42 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In [7] we established a Picard-Vessiot theory over
differentially simple rings which may not be fields.
Differential modules over such rings were proven to be
locally free but don't have to be free as modules. In
this article, we give a family of examples of non-free
differential modules, and compute Picard-Vessiot rings
as well as Galois groups for them.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "198",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wang:2016:PSS,
author = "Fei Wang",
title = "Proof of a series solution for {Euler}'s trinomial
equation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "4",
pages = "136--144",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3055282.3055284",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 23 07:24:42 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In 1779, Leonhard Euler published a paper about
Lambert's transcendental equation in the symmetric form
$ x^\alpha - x^\beta = (\alpha - \beta) v x^{\alpha +
\beta } $. In the paper, he studied the series solution
of this equation and other results based on an
assumption which was not proved in the paper. Euler's
paper gave the first series expansion for the so-called
Lambert $W$ function. In this work, we briefly review
Euler's results and give a proof to modern standards of
rigor of the series solution of Lambert's
transcendental equation.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "198",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Abraham:2016:SCS,
author = "E. {\'A}brah{\'a}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",
title = "Satisfiability checking and symbolic computation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "4",
pages = "145--147",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3055282.3055285",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 23 07:24:42 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Symbolic Computation and Satisfiability Checking are
viewed as individual research areas, but they share
common interests in the development, implementation and
application of decision procedures for arithmetic
theories. Despite these commonalities, the two
communities are currently only weakly connected. We
introduce a new project SC$^2$ to build a joint
community in this area, supported by a newly accepted
EU (H2020-FETOPEN-CSA) project of the same name. We aim
to strengthen the connection between these communities
by creating common platforms, initiating interaction
and exchange, identifying common challenges, and
developing a common roadmap. This abstract and
accompanying poster describes the motivation and aims
for the project, and reports on the first activities.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "198",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Alvandi:2016:RLP,
author = "Parisa Alvandi and Marc Moreno Maza",
title = "Real limit points of quasi-componenets of regular
chains",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "4",
pages = "148--150",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3055282.3055286",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 23 07:24:42 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The work reported here is motivated by problems
arising in solving polynomial systems over the real
numbers.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "198",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Carter:2016:EDH,
author = "Richard G. Carter and Shahadat Hossain and Marzia
Sultana",
title = "Efficient detection of {Hessian} matrix sparsity
pattern",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "4",
pages = "151--154",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3055282.3055287",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 23 07:24:42 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Evaluation of the Hessian matrix of a scalar function
is a subproblem in many numerical optimization
algorithms. For large-scale problems often the Hessian
matrix is sparse and structured, and it is preferable
to exploit such information when available. Using
symmetry in the second derivative values of the
components it is possible to detect the sparsity
pattern of the Hessian via products of the Hessian
matrix with specially chosen direction vectors. We use
graph coloring methods and employ efficient sparse data
structures to implement the sparsity pattern detection
algorithms. Results from preliminary numerical testings
are highly promising.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "198",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Chan:2016:FMP,
author = "Eunice Y. S. Chan and Robert M. Corless",
title = "{Fibonacci--Mandelbrot} polynomials and matrices",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "4",
pages = "155--157",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3055282.3055288",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 23 07:24:42 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/fibquart.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We explore a family of polynomials similar to the
Mandelbrot polynomials called the Fibonacci--Mandelbrot
polynomials defined by $ q_0 (z) = 0 $, $ q_1 (z) = 1
$, and $ q_n(z) = z q_{n - 1} q_{n - 2} + 1 $. We
compute the roots of the Fibonacci-Mandelbrot
polynomials using two methods. One method uses a
recursively constructed matrix, where elements are $0$,
$1$, or $ - 1$, whose eigenvalues are the roots of $
q_n(z)$. The other method uses a special-purpose
homotopy continuation method, where the solution of the
differential equation, [EQUATION], in which the initial
condition are $0$, and the roots of $ q_{n - 1}$ and $
q_{n - 2}$, are also the roots of the
Fibonacci-Mandelbrot polynomials.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "198",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:2016:BEP,
author = "Robert M. Corless and Steven E. Thornton",
title = "The {Bohemian} eigenvalue project",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "4",
pages = "158--160",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3055282.3055289",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 23 07:24:42 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Bohemian eigenvalues are the eigenvalues of matrices
with entries of bounded height, typically drawn from a
discrete set. We will call this set $F$ with
cardinality $ \# F$. The name ``Bohemian'' is intended
as a mnemonic and is derived from ``bounded height
integer matrices.'' These objects are surprisingly
interesting to study, with many unsolved problems
related to them, and with many applications. See the
works of Tao and Vu [10] for universality results for
larger dimension in the generic structured case, for
instance. This project concentrates on explicit
construction of high resolution pictures of the
eigenvalues for modest dimensions and sizes of the
entries; for instance, Figure 1a is a picture of the
eigenvalues of all $ 5 \times 5 $ matrices with entries
in $ \{ - 1, 0, 1 \} $ colored by density and plotted
on the complex plane.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "198",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ocansey:2016:RHP,
author = "Evans Doe Ocansey and Carsten Schneider",
title = "Representation of hypergeometric products in
difference rings",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "4",
pages = "161--163",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3055282.3055290",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 23 07:24:42 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In his pioneering work [1, 2], Michael Karr introduced
$ \Pi \Sigma $-fields which provide a rather general
framework for symbolic summation. He worked out the
first algorithmic steps to represent indefinite nested
sums and products as transcendental extensions over a
computable ground field $K$ called the field of
constants. Furthermore, he presented an algorithm that
solves the parameterized telescoping problem, and as
special cases the telescoping and creative telescoping
problems [3] within a given $ \Pi \Sigma $-field.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "198",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Eberly:2016:BBL,
author = "Wayne Eberly",
title = "Black box linear algebra: extending {Wiedemann}'s
analysis of a sparse matrix preconditioner for
computations over small fields",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "4",
pages = "164--166",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3055282.3055291",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 23 07:24:42 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Wiedemann's paper, introducing his algorithm for
sparse and structured matrix computations over
arbitrary fields, also presented a pair of matrix
preconditioners for computations over small fields. The
analysis of the second of these is extended here in
order to provide more explicit statements of the
expected number of nonzero entries in the matrices
obtained as well as bounds on the probability that the
matrices being considered have maximal rank. It is
hoped that this will make Wiedemann's second
preconditioner of more practical use. This is part of
ongoing work to establish that this matrix
preconditioner can be used to bound the number of
nontrivial nilpotent blocks in the Jordan normal form
of a preconditioned matrix, in such a way that one can
also sample uniformly from the null space of the
originally given matrix. If successful this will result
in a black box algorithm for the type of matrix
computation required when using the number field sieve
for integer factorization that is provably reliable
(unlike some heuristics, presently in use) and --- by a
small factor --- asymptotically more efficient than
alternative provably reliable techniques that make use
of other matrix preconditioners or require computations
over field extensions.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "198",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Fassbender:2016:CSS,
author = "Heike Fassbender and Javier P{\'e}rez and Nikta
Shayanfar",
title = "Constructing symmetric structure-preserving strong
linearizations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "4",
pages = "167--169",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3055282.3055292",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 23 07:24:42 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Polynomials eigenvalue problems with structured matrix
polynomials arise in many applications. The standard
way to solve polynomial eigenvalue problems is through
the classical Frobenius companion linearizations, which
may not retain the structure of the matrix polynomial.
Particularly, the structure of the symmetric matrix
polynomials can be lost, while from the computational
point of view, it is advisable to construct a
linearization which preserves the symmetry structure.
Recently, new families of block-Kronecker pencils have
been introduced in [5]. Applying block-Kronecker
pencils, we present structure-preserving strong
linearizations for symmetric matrix polynomials. When
the matrix polynomial has an odd degree, these
linearizations are strong regardless of whether the
matrix polynomial is regular or singular. Additionally,
we construct structure-preserving strong linearizations
for regular symmetric matrix polynomials of even degree
under some simple nonsingularity conditions.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "198",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gazor:2016:ZES,
author = "Majid Gazor and Mahsa Kazemi",
title = "{$ Z2 $}-equivariant standard bases for submodules
associated with {$ Z2 $}-equivariant singularities",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "4",
pages = "170--172",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3055282.3055293",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 23 07:24:42 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Let $ x = (x_1, \ldots {}, x_n) \in R^n $ and $
\lambda \in R $. A smooth map $ f (x, \lambda) $ is
called $ Z_2$-equivariant ($ Z_2$-invariant) if $ f( -
x, \lambda) = - f(x, \lambda)(f( - x, \lambda) = f(x,
\lambda))$. Consider the local solutions of a $ Z_2$
equivariant map $ f(x, \lambda) = 0$ around a solution,
say $ f(x_0, \lambda_0)$, as the parameters smoothly
vary. The solution set may experience a surprising
behavior like observing changes in the number of
solutions. Each of such problems/changes is called a
singularity/bifurcation. Since our analysis is about
local solutions, we call any two smooth map $ f(x,
\lambda)$ and $ g(x, \lambda)$ as germ-equivalent when
they are identical on a neighborhood of $ (x_0,
\lambda_0) = (0, 0)$. Each germ equivalent class is
referred to a smooth germ. The space of all smooth $
Z_2$ equivariant germs is denoted by [EQUATION] and
space of all smooth $ Z_2$-invariant germs is denoted
by [EQUATION]$_{x, \lambda } (Z_2)$. The space
[EQUATION] is a module over the ring of $ Z_2$
-invariant germs [EQUATION]$_{x, \lambda }(Z_2)$; see
[3, 2, 7] for more information and the origins of our
notations.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "198",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Harrison:2016:PAB,
author = "Gavin Harrison and Jeremy Johnson and B. David
Saunders",
title = "Probabilistic analysis of block {Wiedemann} for
leading invariant factors",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "4",
pages = "173--175",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3055282.3055294",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 23 07:24:42 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The exact probability, dependent on the matrix
structure, is given that the block Wiedemann algorithm
correctly computes the leading invariant factors of a
matrix. A tight lower bound, structure independent, is
derived.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "198",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Katayama:2016:NII,
author = "Akiyuki Katayama and Kiyoshi Shirayanagi",
title = "A new idea on the interval-symbol method with correct
zero rewriting for reducing exact computations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "4",
pages = "176--178",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3055282.3055295",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 23 07:24:42 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The ISCZ method (Interval-Symbol method with Correct
Zero rewriting) was proposed in [2] based on
Shirayanagi-Sweedler stabilization theory ([3]), to
reduce the amount of exact computations as much as
possible to obtain the exact results. The authors of
[2] applied this method to Buchberger's algorithm which
computes a Gr{\"o}bner basis, but the effectiveness was
not achieved except for a few examples. This is not
only because the complex structure of Buchberger's
algorithm causes symbols to significantly grow but also
because we naively implemented the ISCZ method without
any particular devices. In this poster, we propose a
new idea for efficiency of the ISCZ method and show its
effect by applying it to calculation of Frobenius
canonical form of square matrices. Jordan canonical
form is also well-known, but it requires an extension
of the field containing the roots of its characteristic
polynomial. On the other hand, Frobenius canonical form
can be computed by using only basic arithmetic
operations, but nevertheless has almost the same
information as Jordan canonical form.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "198",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kim:2016:SMT,
author = "SungSoon Kim and Dong-il Lee",
title = "Standard monomials for {Temperley--Lieb} algebras",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "4",
pages = "179--181",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3055282.3055296",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 23 07:24:42 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We deal with Temperley--Lieb algebras of type B,
extending the result in [3, \S 6]. By completing the
relations coming from a presentation of the
Temperley--Lieb algebra, we find its
Gr{\"o}bner-Shirshov basis to obtain the corresponding
set of standard monomials. The explicit multiplication
table between the monomials follows naturally.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "198",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Law:2016:CCP,
author = "Marshall Law and Michael Monagan",
title = "Computing characteristic polynomials of matrices of
structured polynomials",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "4",
pages = "182--184",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3055282.3055297",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 23 07:24:42 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We are interested in specific structured matrices
obtained from [5] which arise from combinatorial
problems.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "198",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Middeke:2016:DBH,
author = "Johannes Middeke and Carsten Schneider",
title = "Denominator bounds for higher order systems of linear
recurrence equations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "4",
pages = "185--187",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3055282.3055298",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 23 07:24:42 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Let $ (K, \sigma) $ be a difference field. We define
the set of constants by const $ K = \{ c \in K | \sigma
(c) = c \} $. A $ \Pi \Sigma *$-extension of $K$ is a
field of rational functions $ K (t)$ over $K$ together
with an extension of $ \sigma $ to $ K (t)$ given by
either $ \sigma (t) = a t$ ($ \Pi $ case) or $ \sigma
(t) = t + b$ ($ \Sigma *$ case) for some non-zero $a$
or $ b \in K$ such that const $ K (t) = $ const $K$
holds. See, for example, [8, 9] for more details on $
\Pi \Sigma $ *-extensions.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "198",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Monagan:2016:FBR,
author = "Michael Monagan and Roman Pearce",
title = "{Fermat} benchmarks for rational expressionals in
{Maple}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "4",
pages = "188--190",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3055282.3055299",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 23 07:24:42 MST 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We employ two techniques to dramatically improve
Maple's performance on the Fermat benchmarks for
simplifying rational expressions. First, we factor
expanded polynomials to ensure that gcds are identified
and cancelled automatically. Second, we replace all
expanded polynomials by new variables and normalize the
result. To undo the substitutions, we use a C routine
for sparse multivariate division by a set of
polynomials. The resulting times for the first Fermat
benchmark are a factor of 17x faster than Fermat and
39x faster than Magma.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "198",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Duval:2016:DMR,
author = "Dominique Duval and Adrien Poteaux",
title = "Death of {Marc Rybowicz}, aged 52",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "50",
number = "4",
pages = "191--191",
month = dec,
year = "2016",
CODEN = "????",
DOI = "https://doi.org/10.1145/3055282.3055300",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Feb 23 07:24:42 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "It is with great sadness that we annonce you the death
of our friend and colleague Marc Rybowicz. He passed
away on November 11th after a long fight against cancer
since June 2015.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
issue = "198",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Heinle:2017:SSI,
author = "Albert Heinle and Wolfram Koepf and Wolfram Sperber",
title = "Some steps to improve software information",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "1",
pages = "1--11",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3096730.3096731",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Oct 10 16:29:29 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Mathematical software plays an increasing role in
mathematics and key technologies. But to find and get
information about software is expensive. Missing
metadata standards, e.g., the citation of software, are
one of the reasons. In the following some recent
developments are described how the community can
contribute to a better information system for
mathematical software.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Monagan:2017:FPM,
author = "Michael Monagan and Alan Wong",
title = "Fast parallel multi-point evaluation of sparse
polynomials",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "1",
pages = "12--14",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3096730.3096732",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Oct 10 16:29:29 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In [3] the following polynomial evaluation problem
arises. Let $A$ be a sparse polynomial with $s$ terms
in $ Z^p[x^0, x^1, \ldots {}, x^n]$. Suppose we seek
evaluations of $A$ into $t$ bivariate images in $
Z^p[x0, x^1]$, for some $ t < s$. We do not know a
priori the exact number of images t needed. This will
be determined by using a trial value $T$ for $t$, and
increasing $T$ as required.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Nagasaka:2017:SBA,
author = "Kosaku Nagasaka",
title = "Seeking better algorithms for approximate {GCD}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "1",
pages = "15--17",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3096730.3096733",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Oct 10 16:29:29 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We are interested in seeking better algorithms by just
slightly updating and combining the well-known
algorithms for the following well-known problem in
Symbolic-Numeric Computations.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Numahata:2017:ASN,
author = "Dai Numahata and Hiroshi Sekigawa",
title = "An algorithm for symbolic--numeric sparse
interpolation of multivariate polynomials whose degree
bounds are unknown",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "1",
pages = "18--20",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3096730.3096734",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Oct 10 16:29:29 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We consider the problem of sparse interpolation of a
multivariate black-box polynomial in floating-point
arithmetic. More specifically, we assume that we are
given a black-box polynomial $ f(x_1, \ldots {}, x_n) =
\sum^t_{j = 1} c_j x_1^{d_j, 1} \ldots {} x_n^{d_j, n}
\in C[x_1, \ldots {}, x_n] (c_j \neq 0) $ and the
number of terms $t$, and that we can evaluate the value
of $ f(x^1, \ldots {}, x_n)$ at any point in $ C^n$ in
floating-point arithmetic. The problem is to find the
coefficients $ c_1, \ldots {}, c_t$ and the exponents $
d_{1, 1}, \ldots {}, d_{t, n}$. We propose an efficient
algorithm to solve the problem.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sevyeri:2017:LSF,
author = "Leili Rafiee Sevyeri and Robert M. Corless",
title = "Linearization of a specific family of {B{\'e}zout}
matrices",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "1",
pages = "21--22",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3096730.3096735",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Oct 10 16:29:29 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We want to investigate on the sequence of minimal
polynomials of the sequence below.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sanchez:2017:UBO,
author = "Omar Le{\'o}n S{\'a}nchez",
title = "An upper bound for the order of a differential
algebraic variety",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "1",
pages = "23--25",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3096730.3096736",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Oct 10 16:29:29 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "we present an upper bound for the order of each
irreducible component of finite order of a differential
algebraic variety V in the context of partial
differential fields of characteristic zero. This bound
is constructed recursively in terms of explicit data
obtained from V.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sasaki:2017:EEH,
author = "Tateaki Sasaki and Daiju Inaba",
title = "Enhancing the extended {Hensel} construction by using
{Gr{\"o}bner} basis",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "1",
pages = "26--28",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3096730.3096737",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Oct 10 16:29:29 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Contrary to that the general Hensel construction (GHC:
[3]) uses univariate initial Hensel factors, the
extended Hensel construction (EHC: [8]) uses
multivariate initial Hensel factors determined by the
Newton polygon (see below) of the given multivariate
polynomial $ F (x, u) \in K[x, u] $, where $ (u) =
(u_1, \ldots {}, u_l) $, with $ l \geq 2 $, and $K$ is
a number field. The $ F(x, u)$ may be such that its
leading coefficient may vanish at $ (u) = (0) = (0,
\ldots {}, 0)$, and even may be $ F(x, 0) = 0$. The EHC
was used so far for computing series expansion of
multivariate algebraic function determined by $ F(x, u)
= 0$, at critical points [8, 5] and for factorization
[4, 1] and GCD computation [7] of $ F(x, u)$, without
shifting the origin of $u$. It allows us to construct
efficient algorithms for sparse multivariate
polynomials [1, 7]. The EHC is another and promising
approach than Zippel's sparse Hensel lifting [9, 10].",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Slavyanov:2017:ADH,
author = "S. Yu. Slavyanov and O. L. Stesik",
title = "Antiquantization of deformed {Heun} class equations as
a tool for symbolic generation of {Painlev{\'e}}
equations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "1",
pages = "29--31",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3096730.3096738",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Oct 10 16:29:29 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We have used antiquantization of deformed Heun class
equations for programming the generation of
Painlev{\'e} equations with the CAS Maple.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Stoutemyer:2017:APC,
author = "David R. Stoutemyer",
title = "{AskConstants} proposes concise non-floats close to
floats",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "1",
pages = "32--34",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3096730.3096739",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Oct 10 16:29:29 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This poster presentation is an opportunity to try the
downloadable AskConstants program. This copy of some
posters is a sequence of images of the program in
operation.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Wang:2017:FMR,
author = "Fei Wang and Greg Reid and Henry Wolkowicz",
title = "Finding maximum rank moment matrices by facial
reduction on primal form and {Douglas--Rachford}
iteration",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "1",
pages = "35--37",
month = mar,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3096730.3096740",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Oct 10 16:29:29 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Recent breakthroughs have been made in the use of
semi-definite programming and its application to real
polynomial solving. For example, the real radical of a
zero dimensional ideal, can be determined by such
approaches. Some progress has been made on the
determination of the real radical in positive dimension
by Ma, Wang and Zhi[5, 4]. Such work involves the
determination of maximal rank semidefinite matrices.
Existing methods are computationally expensive and have
poorer accuracy on larger examples. In previous work we
showed that regularity in the form of the Slater
constraint qualification (strict feasibility) fails for
the moment matrix in the SDP feasibility problem[6]. We
used facial reduction to obtain a smaller regularized
problem for which strict feasibility holds. However we
did not have a theoretical guarantee that our methods,
based on facial reduction and Douglas-Rachford
iteration ensured the satisfaction of the maximum rank
condition. Our work is motivated by the problems above.
We discuss how to compute the moment matrix and its
kernel using facial reduction techniques where the
maximum rank property can be guaranteed by solving the
dual problem. The facial reduction algorithms on the
primal form is presented. We give examples that exhibit
for the first time additional facial reductions beyond
the first which are effective in practice with much
better accuracy than SeDuMi(CVX).",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Velez:2017:LQP,
author = "Juan D. Velez and Juan P. Hernandez and Carlos A.
Cadavid",
title = "Limits of quotients of polynomial functions in three
variables",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "2",
pages = "42--56",
month = jun,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3151131.3151132",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Oct 10 16:29:30 MDT 2017",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "A method for computing limits of quotients of real
analytic functions in two variables was developed in
[4]. In this article we generalize the results obtained
in that paper to the case of quotients $ q = f(x, y, z)
/ g (x, y, z) $ of polynomial functions in three
variables with rational coefficients. The main idea
consists in examining the behavior of the function q
along certain real variety $ X(q) $ (the discriminant
variety associated to $q$). The original problem is
then solved by reducing to the case of functions of two
variables. The inductive step is provided by the key
fact that any algebraic curve is birationally
equivalent to a plane curve. Our main result is
summarized in Theorem 2. In Section 4 we describe an
effective method for computing such limits. We provide
a high level description of an algorithm that
generalizes the one developed in [4], now available in
Maple as the {\tt limit\slash multicode} command.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lee:2017:MCA,
author = "Wen-shin Lee",
title = "{Milestones in Computer Algebra (MICA 2016)}: a
workshop celebrating the research of {Erick Kaltofen}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "2",
pages = "57--65",
month = jun,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3151131.3151133",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Oct 10 16:29:30 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The workshop ``Milestone in Computer Algebra 2016
(MICA 2016)'' was in-cooperation of ACM and hosted by
David R. Cheriton School of Computer Science at the
University of Waterloo. The MICA 2016 took place from
July 16 till 18, which was right before the annual
premier computer algebra conference ISSAC 2016, also
hosted in Waterloo by the nearby Wilfrid Laurier
University from July 19 till 22.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lichtblau:2017:ECC,
author = "Daniel Lichtblau",
title = "{East Coast Computer Algebra Day 2017}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "2",
pages = "66--69",
month = jun,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3151131.3151134",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Oct 10 16:29:30 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The East Coast Computer Algebra Day 2017 (ECCAD 2017)
was hosted by Wolfram Research on Saturday, April 29,
2017.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2017:ARD,
author = "Anonymous",
title = "Abstracts of recent doctoral dissertations in computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "2",
pages = "70--72",
month = jun,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3151131.3151135",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Oct 10 16:29:30 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Each quarter we are pleased to present abstracts of
recent doctoral dissertations in Computer Algebra and
Symbolic Computation. We encourage all recent Ph.D.
graduates who have defended in the past two years (and
their supervisors), to submit their abstracts for
publication in CCA.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gao:2017:WTW,
author = "Xiao-Shan Gao",
title = "{Wen-Tsun Wu}: His Life and Legacy",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "2",
pages = "73--79",
month = jun,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3151131.3151136",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Oct 10 16:29:30 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Professor Wen-Tsun Wu passed away on May 7, 2017, a
few days ahead of his 98th birthday. Wu is one of the
most influential Chinese mathematicians and computer
scientists. In his early years, he made fundamental
contributions to algebraic topology. In the late 1970s,
Wu proposed the Wu's method of geometric theorem
proving and founded the school of Mathematics
Mechanization. His study on the ancient Chinese
mathematics opened a new era in the field of history of
Chinese mathematics. He also made contributions in the
area of algebraic geometry, invariant theory, complex
geometry, and game theory. His legacy consists not only
of his academic work but also of several generations of
scientists who learned from him the joy and enthusiasm
of scientific research and the way to go about it.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sutherland:2017:DCG,
author = "Nicole Sutherland",
title = "A demonstration of computing {Galois} groups of
polynomials in {Magma}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "3",
pages = "81--82",
month = sep,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3177795.3177796",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 5 06:22:51 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/magma.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We demonstrate some of the computations of Galois
groups which are possible in Magma [1].",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Ren:2017:CTV,
author = "Yue Ren",
title = "Computing tropical varieties using {Newton}'s polygon
method",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "3",
pages = "83--85",
month = sep,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3177795.3177797",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 5 06:22:51 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We will demonstrate software for fast computation of
tropical varieties. We give a brief overview of the
first techniques developed by
Bogart-Jensen-Speyer-Sturmfels-Thomas and show how its
bottlenecks can be avoided, relying theoretically on
recent results on the intersection of tropical
varieties and practically on well-known algorithms in
computer algebra.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jing:2017:PLM,
author = "Rui-Juan Jing and Marc Moreno Maza",
title = "The polyhedra library in {Maple}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "3",
pages = "86--88",
month = sep,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3177795.3177798",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 5 06:22:51 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The Polyhedra library is dedicated to solving problems
dealing with the integer points of polyhedral sets.
Such problems include decomposing the integer points of
such sets, solving parametric integer programs,
performing dependence analysis in for-loop nests and
determining the validity of certain Presburger
formulas.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Haque:2017:CCL,
author = "S. Anisul Haque and X. Li and F. Mansouri and M.
Moreno Maza and D. Mohajerani and W. Pan",
title = "{CUMODP}: a {CUDA} library for modular polynomial
computation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "3",
pages = "89--91",
month = sep,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3177795.3177799",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 5 06:22:51 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/pvm.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The CUDA Modular Polynomial (CUMODP) Library
implements arithmetic operations for dense matrices and
dense polynomials, primarily with modular integer
coefficients. Some operations are available for integer
or floating point coefficients. Similar to other
software libraries, like CuBLAS$^1$ targeting Graphics
Processing Units (GPUs), CUMODP focuses on
efficiency-critical routines and provides them in the
form of device functions and CUDA kernels. Hence, these
routines are primarily designed to offer GPU support to
polynomial system solvers. A bivariate system solver is
part of the library, as a proof-of-concept. Its
implementation is presented in [10] and it is
integrated in Maple's Triangularize command$^2$, since
the release 18 of Maple.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kastner:2017:TGP,
author = "Lars Kastner and Benjamin Lorenz and Andreas
Paffenholz and Anna-Lena Winz",
title = "Toric geometry in polymake",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "3",
pages = "92--94",
month = sep,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3177795.3177800",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 5 06:22:51 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We give an overview of the application 'fulton' for
toric geometry of the software framework polymake.
Using two-dimensional cyclic quotient singularities as
our main example, we will show how to create toric
varieties and divisors on these. The Singular interface
of polymake allows one to go back to the algebraic side
in case there is no combinatorial algorithm known yet,
in order to develop new conjectures and algorithms.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Abbott:2017:CC,
author = "John Abbott and Anna M. Bigatti",
title = "{CoCoA-5.2.2} and {CoCoALib}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "3",
pages = "95--97",
month = sep,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3177795.3177801",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 5 06:22:51 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "CoCoA-5 is an interactive Computer Algebra System for
Computations in Commutative Algebra, particularly
Gr{\"o}bner bases. It offers a dedicated,
mathematician-friendly programming language, with many
built-in functions. Its mathematical core is a
user-friendly C++ library, called CoCoALib; being a
software library facilitates integration with other
software. The software is free and open source (C++,
GPL3). CoCoALib has been designed so that other
``external'' software libraries can be easily
integrated with it, and also made accessible via
CoCoA-5. We give an overview of CoCoA-5 and CoCoALib,
highlighting the latest developments.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Tuncer:2017:ARD,
author = "Yusuf Baris Tuncer",
title = "Abstracts of recent doctoral dissertations in computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "3",
pages = "98--98",
month = sep,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3177795.3177802",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 5 06:22:51 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Each quarter we are pleased to present abstracts of
recent doctoral dissertations in Computer Algebra and
Symbolic Computation. We encourage all recent Ph.D.
graduates who have defended in the past two years (and
their supervisors), to submit their abstracts for
publication in CCA. Please send abstracts to the CCA
editors \url{editors_SIGSAM@acm.org} for
consideration.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Brown:2017:MSC,
author = "Christopher W. Brown",
title = "Message from the {SIGSAM} chair",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "4",
pages = "101--102",
month = dec,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3199652.3200140",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Mar 23 11:52:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Abramov:2017:SC,
author = "Sergei A. Abramov and Anna A. Ryabenko and Timur M.
Sadykov",
title = "The second conference",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "4",
pages = "103--110",
month = dec,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3199652.3199653",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Mar 23 11:52:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The second International conference is organized
jointly by Dorodnicyn Computing Center of Federal
Research Center ``Computer Science and Control'' of RAS
and Plekhanov Russian University of Economics with a
support of the Russian Foundation for Basic Research
(project 17-01-20398 17). The first edition of the
event [1] (http://www.ccas.ru/ca/conference2016) was
held in 2016 at the Dorodnicyn Computing Center in
cooperation with Russian University of Friendship of
Peoples. The conference website:
http://www.ccas.ru/ca/conference.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2017:RDJ,
author = "Anonymous",
title = "The {2017 Richard D. Jenks Memorial Award}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "4",
pages = "111--111",
month = dec,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3199652.3200141",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Mar 23 11:52:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The 2017 Richard D. Jenks Memorial Prize for
Excellence in Software Engineering Applied to Computer
Algebra has been awarded to Stephen Wolfram for
Wolfram-Alpha and Mathematica.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2017:DWE,
author = "Anonymous",
title = "{Dongming Wang} elected member of the {Academia
Europaea}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "4",
pages = "112--112",
month = dec,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3199652.3200142",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Mar 23 11:52:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Prof. Dongming Wang was elected as a Member of the
Academia Europaea in 2017.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Anonymous:2017:GC,
author = "Anonymous",
title = "{George E. Collins} (1928--2017)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "51",
number = "4",
pages = "113--113",
month = dec,
year = "2017",
CODEN = "????",
DOI = "https://doi.org/10.1145/3199652.3200143",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Mar 23 11:52:02 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "George E. Collins passed away on 21st November 2017 in
Madison, Wisconsin at the age of 89. George left an
inspiring legacy that includes publications in logic,
mathematics and computer science in seven different
decades. He is probably best known within SIGSAM as the
inventor of cylindrical algebraic decomposition and its
application to quantifier elimination.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:2018:RDT,
author = "Robert M. Corless and Julia E. Jankowski",
title = "Revisiting the discharge time of a cylindrical leaking
bucket: or, ``one does not simply call {\tt dsolve}
into {\tt mordor}.''",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "1",
pages = "1--10",
month = mar,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3243034.3243035",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jul 26 16:28:20 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In [2] we find an exploration of a new mathematical
model of the flow in a leaking bucket suitable for
beginning students. The model is derived using the
non-steady Bernoulli's Principle, and results in a more
sophisticated model than the simple ordinary
differential equation [EQUATION] derived using the
steady Bernoulli's Principle. The simpler model goes
sometimes by the name of Torricelli's Law and is very
well studied; indeed it is a favourite example in many
textbooks. This present paper provides an alternative
derivation of the new model that uses an energy
balance, and carefully lays out some numerical issues
omitted from the treatment in [2]. We also provide an
analytic solution in terms of$_2$ F$_1$ hypergeometric
functions, which, while possibly unfamiliar to the
student, are available to them via computer algebra
systems. Even before that solution, an intermediate
equation [EQUATION] is derived, which already explains
the similarity of the solutions to the more
sophisticated model to the ones from the simple
Torricelli's Law. This paper gives a useful example for
use of a CAS in a classroom setting.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Combariza:2018:FCA,
author = "Germ{\'a}n A. G. Combariza",
title = "A few conjectures about the multiple zeta values",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "1",
pages = "11--20",
month = mar,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3243034.3243036",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Jul 26 16:28:20 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The multiple zeta values (MZVs) form a set of real
numbers with, what we believe and module Zagier's
Conjecture, a beautiful structure as an algebra over
the rational numbers. In this paper we show partial
solutions to five well known conjectures about the MZV
obtained by using linear systems and shuffle products.
We use computer algebra systems to study these
conjectures and make our code available online. We
describe how to compute the shuffle minus stuffle
product to obtain relations of the MZVs, together with
the xtaylor algorithm, to verify the conjectures
mentioned above. We note that it is only necessary to
solve a linear system, not in MZV but in its powers and
products, to find all the relations. We also made all
the code available online.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Nagashima:2018:EIS,
author = "Hiroki Nagashima and Kiyoshi Shirayanagi",
title = "Effect of the interval-symbol method with correct zero
rewriting on the $ \delta $-{LLL} algorithm",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "2",
pages = "24--31",
month = jun,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3282678.3282679",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Oct 1 16:08:39 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We previously proposed the interval-symbol method with
correct zero rewriting (ISCZ method) to reduce the
amount of exact computations to obtain the exact
results by aid of floating-point computations. Recently
we have presented new ideas for reducing time and
memory of executing the ISCZ method. In this paper, we
apply the new ISCZ method to the $ \delta $-LLL
algorithm, which is a generalization of the
Lenstra--Lenstra--Lov{\'a}sz (LLL) lattice reduction
algorithm. By Maple experiments, we confirm its
superiority over the original ISCZ method, and in the
irrational case we show its great effect on the $
\delta $-LLL algorithm in the sense that it is much
more efficient than the purely exact approach.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:2018:CAD,
author = "Robert M. Corless and David J. Jeffrey and David R.
Stoutemyer",
title = "Comprehensive anti-derivatives and parametric
continuity",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "2",
pages = "32--33",
month = jun,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3282678.3282680",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Oct 1 16:08:39 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We present a poster and software demonstration
regarding the calculation of indefinite integrals, or
anti-derivatives, when parameters are present.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Magron:2018:RMP,
author = "Victor Magron and Mohab Safey {El Din}",
title = "\pkg{RealCertify}: a {Maple} package for certifying
non-negativity",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "2",
pages = "34--37",
month = jun,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3282678.3282681",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Oct 1 16:08:39 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Let $Q$ (resp. $R$) be the field of rational (resp.
real) numbers and $ X = (X_1, \ldots {}, X_n)$ be
variables. Deciding the non-negativity of polynomials
in $ Q[X]$ over $ R^n$ or over semi-algebraic domains
defined by polynomial constraints in $ Q[X]$ is a
classical algorithmic problem for symbolic computation.
The Maple package \pkg{RealCertify} tackles this
decision problem by computing sum of squares
certificates of non-negativity for inputs where such
certificates hold over the rational numbers. It can be
applied to numerous problems coming from engineering
sciences, program verification and cyber-physical
systems. It is based on hybrid symbolic--numeric
algorithms based on semi-definite programming.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{DeFeo:2018:LCE,
author = "Luca {De Feo} and Hugues Randriambololona and
{\'E}douard Rousseau",
title = "Lattices of compatibly embedded finite fields in
{Nemo\slash Flint}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "2",
pages = "38--41",
month = jun,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3282678.3282682",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Oct 1 16:08:39 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We present a software that allows the user to compute
embeddings between arbitrary finite fields. It is
written using Julia and C, as part of Nemo and Flint[7,
6]. The software ensures compatibility between the
embeddings, so that the user can work with multiple
fields and have coherent results independently of where
the computations are made and of where the results are
expressed.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Grabe:2018:YS,
author = "Hans-Gert Gr{\"a}be",
title = "20 Years {SymbolicData}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "3",
pages = "45--54",
month = sep,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3313880.3313881",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Sat Feb 23 06:21:15 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The SymbolicData Project on testing an benchmarking
Computer Algebra software grew up from the Special
Session on Benchmarking at the 1998 ISSAC conference.
During 20 years we collected reserach data and meta
information, developed a test framework along the
``cross cutting concerns'' of modern software
engineering and experimented with semantic technologies
as a building block of a modern distributed
socio-technical research infrastructure in the area of
Computer Algebra. This paper presents a comprehensive
survey of the most important motivations, concepts,
steps, efforts and practical achievements of the
SymbolicData Project to contribute to the formation of
such a research infrastructure.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{vanderHoeven:2018:FGB,
author = "Joris van der Hoeven and Robin Larrieu",
title = "Fast {Gr{\"o}bner} basis computation and polynomial
reduction for generic bivariate ideals",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "3",
pages = "55--58",
month = sep,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3313880.3313882",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Sat Feb 23 06:21:15 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Let A, B \in K[ X, Y ] be two bivariate polynomials
over an effective field K, and let G be the reduced
Gr{\"o}bner basis of the ideal I := \langle A, B
\rangle generated by A and B with respect to the usual
degree lexicographic order. Assuming A and B
sufficiently generic, we design a quasi-optimal
algorithm for the reduction of P \in K[ X, Y ] modulo
G, where ``quasi-optimal'' is meant in terms of the
size of the input A, B, P. Immediate applications are
an ideal membership test and a multiplication algorithm
for the quotient algebra A := K[ X, Y ]/ \langle A, B
\rangle , both in quasi-linear time. Moreover, we show
that G itself can be computed in quasi-linear time with
respect to the output size.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Nagloo:2018:CPP,
author = "Joel Nagloo and Alexey Ovchinnikov and Peter
Thompson",
title = "Commuting planar polynomial vector fields for
conservative {Newton} systems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "3",
pages = "59--62",
month = sep,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3313880.3313883",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Sat Feb 23 06:21:15 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We study the problem of characterizing polynomial
vector fields that commute with a given polynomial
vector field on a plane. It is a classical result that
one can write down solution formulas for an ODE that
corresponds to a planar vector field that possesses a
linearly independent (transversal) commuting vector
field (see Theorem 2.1). In what follows, we will use
the standard correspondence between (polynomial) vector
fields and derivations on (polynomial) rings. Let [MATH
HERE] be a derivation, where f is a polynomial with
coefficients in a field K of zero characteristic. This
derivation corresponds to the differential equation $
\ddot {x} = f (x) $, which is called a conservative
Newton system as it is the expression of Newton's
second law for a particle confined to a line under the
influence of a conservative force. Let $H$ be the
Hamiltonian polynomial for d with zero constant term,
that is [MATH HERE]. Then the set of all polynomial
derivations that commute with $d$ forms a $
K[H]$-module $ M_d$ [6, Corollary 7.1.5]. We show that,
for every such d, the module $ M_d$ is of rank 1 if and
only if deg $ f \geq 2$. For example, the classical
elliptic equation $ \ddot {x} = 6 x^2 + a$, where $ a
\in C$, falls into this category. For proofs of the
results stated in this abstract, see [5].",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Budroni:2018:HGB,
author = "Alessandro Budroni and Federico Pintore",
title = "Hashing to {G2} on {BLS} pairing-friendly curves",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "3",
pages = "63--66",
month = sep,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3313880.3313884",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Sat Feb 23 06:21:15 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "When a pairing e: $ G_1 $ x $ G_2 $ -{$>$} $ G_T $, on
an elliptic curve E defined over F$_q$, is exploited in
a cryptographic protocol, there is often the need to
hash binary strings into $ G_1$ and $ G_2$.
Traditionally, if $E$ admits a twist $ \tilde {E}$ of
order $d$, then $ G_1$ = E (F$_q$) \cap E [ r ], where
r is a prime integer, and $ G_2$ = $ \tilde {E}$ (F
$_q^{k / d}$) \cap $ \tilde {E}$ [ r ], where k is the
embedding degree of E w.r.t. r. The standard approach
for hashing a binary string into $ G_1$ and $ G_2$ is
to map it to general points P \in E (F$_q$) and P' \in
$ \tilde {E}$ (F $_q^{k / d}$), and then multiply them
by the cofactors c = \#E (F $_q$)/ r and c ' = \#$
\tilde {E}$ (F $_q^{k / d}$)/ r respectively. Usually,
the multiplication by c' is computationally expensive.
In order to speed up such a computation, two different
methods (by Scott et al. and by Fuentes et al.) have
been proposed. In this poster we consider these two
methods for BLS pairing-friendly curves having k \in
{12, 24, 30, 42,48}, providing efficiency comparisons.
When k = 42,48, the Fuentes et al. method requires an
expensive one-off pre-computation which was infeasible
for the computational power at our disposal. In these
cases, we theoretically obtain hashing maps that follow
Fuentes et al. idea.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Boulier:2018:SPS,
author = "Fran{\c{c}}ois Boulier and Fran{\c{c}}ois Fages and
Ovidiu Radulescu and Satya Swarup Samal and Andreas
Schuppert and Werner Seiler and Thomas Sturm and
Sebastian Walcher and Andreas Weber",
title = "The {SYMBIONT} project: symbolic methods for
biological networks",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "3",
pages = "67--70",
month = sep,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3313880.3313885",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Sat Feb 23 06:21:15 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The international interdisciplinary SYMBIONT project
ranges from mathematics via computer science to systems
biology, with a balanced team of researchers from those
fields. At the present stage the project has a clear
focus on fundamental research on mathematical methods,
and prototypes in software. Results are systematically
benchmarked against models from computational biology
databases. We summarize the motivation and aims for the
project, and report on existing results by the
consortium and first activities. The project website
can be found at www.symbiont-project.org.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gomez-Torrecillas:2018:MDC,
author = "Jos{\'e} G{\'o}mez-Torrecillas and F. J. Lobillo and
Gabriel Navarro",
title = "Minimum distance computation of linear codes via
genetic algorithms with permutation encoding",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "3",
pages = "71--74",
month = sep,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3313880.3313886",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Sat Feb 23 06:21:15 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We design a heuristic method, a genetic algorithm, for
the computation of an upper bound of the minimum
distance of a linear code over a finite field. By the
use of the row reduced echelon form, we obtain a
permutation encoding of the problem, so that its space
of solutions does not depend on the size of the base
field or the dimension of the code. Actually, the
efficiency of our method only grows non-polynomially
with respect to the length of the code.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cuyt:2018:SSP,
author = "Annie Cuyt and Wen-shin Lee",
title = "A scale and shift paradigm for sparse interpolation in
one and more dimensions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "3",
pages = "75--77",
month = sep,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3313880.3313887",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Sat Feb 23 06:21:15 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Sparse interpolation from at least 2 n uniformly
spaced interpolation points t$_j$ can be traced back to
the exponential fitting method [MATH HERE] of de Prony
from the 18-th century [5]. Almost 200 years later this
basic problem is also reformulated as a generalized
eigenvalue problem [8]. We generalize (1) to sparse
interpolation problems of the form [MATH HERE] and some
multivariate formulations thereof, from corresponding
regular interpolation point patterns. Concurrently we
introduce the wavelet inspired paradigm of dilation and
translation for the analysis (2) of these
complex-valued structured univariate or multivariate
samples. The new method is the result of a search on
how to solve ambiguity problems in exponential
analysis, such as aliasing which arises from too
coarsely sampled data, or collisions which may occur
when handling projected data.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Telen:2018:TNF,
author = "Simon Telen and Bernard Mourrain and Marc {Van
Barel}",
title = "Truncated normal forms for solving polynomial
systems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "3",
pages = "78--81",
month = sep,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3313880.3313888",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Sat Feb 23 06:21:15 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In this poster we present the results of [10]. We
consider the problem of finding the common roots of a
set of polynomial functions defining a zero-dimensional
ideal I in a ring R of polynomials over C. We propose a
general algebraic framework to find the solutions and
to compute the structure of the quotient ring R/I from
the cokernel of a resultant map. This leads to what we
call Truncated Normal Forms (TNFs). Algorithms for
generic dense and sparse systems follow from the
classical resultant constructions. In the presented
framework, the concept of a border basis is generalized
by relaxing the conditions on the set of basis
elements. This allows for algorithms to adapt the
choice of basis in order to enhance the numerical
stability. We present such an algorithm. The numerical
experiments show that the methods allow to compute all
zeros of challenging systems (high degree, with a large
number of solutions) in small dimensions with high
accuracy.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bright:2018:SPW,
author = "Curtis Bright and Ilias Kotsireas and Vijay Ganesh",
title = "The {SAT+CAS} paradigm and the {Williamson}
conjecture",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "3",
pages = "82--84",
month = sep,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3313880.3313889",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Sat Feb 23 06:21:15 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We employ tools from the fields of symbolic
computation and satisfiability checking---namely,
computer algebra systems and SAT solvers---to study the
Williamson conjecture from combinatorial design theory
and increase the bounds to which Williamson matrices
have been enumerated. In particular, we completely
enumerate all Williamson matrices of orders divisible
by 2 or 3 up to and including 70. We find one
previously unknown set of Williamson matrices of order
63 and construct Williamson matrices in every even
order up to and including 70. This extended abstract
outlines a preprint currently under submission [4].",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Caravantes:2018:OCQ,
author = "Jorge Caravantes and Mario Fioravanti and Laureano
Gonzalez-Vega and Gema Diaz-Toca",
title = "Offsets to conics and quadrics: a new determinantal
representation for their implicit equation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "3",
pages = "85--88",
month = sep,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3313880.3313890",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Sat Feb 23 06:21:15 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "A new determinantal presentation of the implicit
equation for offsets to non degenerate conics and
quadrics is introduced which is specially well suited
for intersection purposes.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Middeke:2018:TDM,
author = "Johannes Middeke and Carsten Schneider",
title = "Towards a direct method for finding hypergeometric
solutions of linear first order recurrence systems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "3",
pages = "89--91",
month = sep,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3313880.3313891",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Sat Feb 23 06:21:15 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We establish a connection between the hypergeometric
solutions of a first order linear recurrence systems
and the determinant of the system matrix. This enables
us to find hypergeometric solutions for systems in a
way similar to the scalar case. Our result works in the
in the single basic and in the multibasic case.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jebelean:2018:TNS,
author = "Tudor Jebelean",
title = "Techniques for natural-style proofs in elementary
analysis",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "3",
pages = "92--95",
month = sep,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3313880.3313892",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Sat Feb 23 06:21:15 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Combining methods from satisfiability checking with
methods from symbolic computation promises to solve
challenging problems in various areas of theory and
application. We look at the basically equivalent
problem of proving statements directly in a non-clausal
setting, when additional information on the underlying
domain is available in form of specific properties and
algorithms. We demonstrate on a concrete example
several heuristic techniques for the automation of
natural-style proving of statements from elementary
analysis. The purpose of this work in progress is to
generate proofs similar to those produced by humans, by
combining automated reasoning methods with techniques
from computer algebra. Our techniques include: the
S-decomposition method for formulae with alternating
quantifiers, quantifier elimination by cylindrical
algebraic decomposition, analysis of terms behaviour in
zero, bounding the \in -bounds, rewriting of
expressions involving absolute value, algebraic
manipulations, and identification of equal terms under
unknown functions. These techniques are being
implemented in the Theorema system and are able to
construct automatically natural-style proofs for
numerous examples including: convergence of sequences,
limits and continuity of functions, uniform continuity,
and other.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Zima:2018:AIH,
author = "Eugene V. Zima",
title = "Accelerating indefinite hypergeometric summation
algorithms",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "3",
pages = "96--99",
month = sep,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3313880.3313893",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Sat Feb 23 06:21:15 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Let K be a field of characteristic zero, x an
independent variable, E the shift operator with respect
to x, i.e., Ef (x) = f (x + 1) for an arbitrary f ( x).
Recall that a nonzero expression F (x) is called a
hypergeometric term over K if there exists a rational
function r (x) \in K(x) such that F (x + 1)/ F (x ) = r
(x). Usually r (x) is called the rational certificate
of F (x). The problem of indefinite hypergeometric
summation (anti-differencing) is: given a
hypergeometric term F (x), find a hypergeometric term G
(x) which satisfies the first order linear difference
equation (E --- 1) G (x) = F (x). (1) If found, write
\Sigma $_x$ F (x) = G (x) + c, where c is an arbitrary
constant.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hyun:2018:FAS,
author = "Seung Gyu Hyun and Stephen Melczer and Catherine
St-Pierre",
title = "A fast algorithm for solving linearly recurrent
sequences",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "3",
pages = "100--103",
month = sep,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3313880.3313894",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Sat Feb 23 06:21:15 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We present an algorithm which computes the D$^{th}$
term of a sequence satisfying a linear recurrence
relation of order d over a field K in O (M(d \nu) log(
D) + M(d) log(d)) operations in K, where d \nu {$<$}= d
is the degree of the squarefree part of the
annihilating polynomial of the recurrence and M is the
cost of polynomial multiplication in K. This is a
refinement of the previously optimal result of O (M(d )
log(D)) operations, due to Fiduccia.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Mehta:2018:UBN,
author = "Ranjana Mehta and Joydip Saha and Indranath Sengupta",
title = "Unboundedness of {Betti} numbers of curves",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "3",
pages = "104--107",
month = sep,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3313880.3313895",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Sat Feb 23 06:21:15 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Bresinsky defined a class of monomial curves in A$^4$
with the property that the minimal number of generators
or the first Betti number of the defining ideal is
unbounded above. We prove that the same behaviour of
unboundedness is true for all the Betti numbers and
construct an explicit minimal free resolution for this
class. We also propose a general construction of such
curves in arbitrary embedding dimension.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Farnsworth:2018:HFV,
author = "Cameron Farnsworth and Jose Israel Rodriguez",
title = "Homogenized funtf varieties and algebraic frame
completion",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "3",
pages = "108--111",
month = sep,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3313880.3313896",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Sat Feb 23 06:21:15 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We introduce homogenized funtf (finite tight unit norm
frames) varieties and study the degrees of their
coordinate projections. These varieties compactify the
affine funtf variety differently from the
projectivizations studied in [12]. However, each are
the closures (Zariski) of the set of finite tight unit
norm frames. Our motivation comes from studying the
algebraic frame completion problem.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Bermejo:2018:NRD,
author = "I. Bermejo and E. Garc{\'\i}a-Llorente and I.
Garc{\'\i}a-Marco and M. Morales",
title = "{Noether} resolutions in dimension 2",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "4",
pages = "114--116",
month = dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3338637.3338638",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Oct 23 07:34:18 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Let R := K [ x$_1$,\ldots, x$_n$ ] be a polynomial
ring over an infinite field K, and let I \subset R be a
homogeneous ideal with respect to a weight vector
\omega = (\omega $_1$, \ldots, \omega $_n$) \in
(Z$^+$)$^n$ such that dim(R/I) = d. We consider the
minimal graded free resolution of R/I as A -module,
that we call the Noether resolution of R/I, whenever A
:= K [ x$_{n - d + 1}$,\ldots, x$_n$ ] is a Noether
normalization of R/I. When d = 2 and I is saturated, we
give an algorithm for obtaining this resolution that
involves the computation of a minimal Gr{\"o}bner basis
of I with respect to the weighted degree reverse
lexicographic order. In the particular case when R/I is
a 2-dimensional semigroup ring, we also describe the
multigraded version of this resolution in terms of the
underlying semigroup. Whenever we have the Noether
resolution of R/I or its multigraded version, we obtain
formulas for the corresponding Hilbert series of R/I,
and when I is homogeneous, we obtain a formula for the
Castelnuovo-Mumford regularity of R/I. As an
application of the results for 2-dimensional semigroup
rings, we provide a new upper bound for the
Castelnuovo-Mumford regularity of the coordinate ring
of a projective monomial curve. Finally, we describe
the multigraded Noether resolution of either the
coordinate ring of a projective monomial curve
[EQUATION] associated to an arithmetic sequence or of
any of its canonical projections [EQUATION].",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Brieulle:2018:CIE,
author = "Ludovic Brieulle and Luca {De Feo} and Javad Doliskani
and Jean Pierre Flori and {\'E}ric Schost",
title = "Computing isomorphisms and embeddings of finite
fields",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "4",
pages = "117--119",
month = dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3338637.3338639",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Oct 23 07:34:18 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Let q be a prime power and let F$_q$ be a field with q
elements. Let f and g be irreducible polynomials in
F$_q$ [ X ], with deg f dividing deg g. Define k =
F$_q$ [ X ]/ f and K = F$_q$ [ X ]/ g, then there is an
embedding \phi : k [EQUATION] K, unique up to F$_q$
-automorphisms of k. Our goal is to describe algorithms
to efficiently represent and evaluate one such
embedding.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gazor:2018:GBM,
author = "Majid Gazor and Amir Hashemi and Mahsa Kazemi",
title = "{Gr{\"o}bner} bases and multi-dimensional persistent
bifurcation diagram classifications",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "4",
pages = "120--122",
month = dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3338637.3338640",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Oct 23 07:34:18 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The work presented here is motivated by our ongoing
project on symbolic bifurcation analysis of
multidimensional germs of singularities, say [EQUATION]
where z and \lambda denote the state variables and a
distinguished parameter, respectively. A local solution
Z (\lambda) for f (Z (\lambda), \lambda) = 0 is called
a bifurcation diagram. Any two bifurcation diagrams
Z$_1$ (\lambda) and Z$_2$ (\lambda) of f ( z, \lambda)
are called qualitatively equivalent when there exists a
diffeomorphism (\Phi (Z$_1$, \lambda $_1$), \Lambda
(\lambda $_1$)) transforming the bifurcation diagram
Z$_1$ (\lambda $_1$) into Z$_2$ ( \lambda $_2$) = \Phi
(Z$_1$ (\Lambda $^{-1}$ (lD$_2$ )), \Lambda $^{-1}$
(\lambda $_2$)). Our proposed bifurcation analysis
often corresponds to steady state bifurcations of PDEs,
static and dynamical systems and occur in many real
life and engineering control problems [5]. This will be
integrated into the Singularity library [3, 4] as
MultiDimSingularities module. Our library provides
systematic tools for symbolic treatment of bifurcation
analysis of such systems. The classical approach uses
root finding and parametric continuation methods
through numerical normal form analysis for differential
systems with low codimension (degeneracy). The latter
fails on comprehensive analysis for a parametric system
and for systems with moderate degeneracies. The goal
here is to classify the qualitatively different
bifurcation diagrams of an unfolding germ [EQUATION],
for f (z, \lambda), where \alpha = (\alpha $_1$
,\ldots, \alpha $_p$) are unfolding parameters and F
(z, \lambda , 0) = f (z, \lambda). This classification
is feasible via the concept of persistent bifurcation
diagrams. A diagram is called persistent when it is
qualitatively self-equivalent under arbitrarily small
perturbations. The idea is to find non-persistent
sources of bifurcations. Non-persistent sources are
divided into three categories: bifurcation B,
hysteresis H and double limit point D; see [6, Page
410]. The set [EQUATION] is called a transition local
variety, that is a codimension-1 hyperplane in the
parameter space. A local variety refers to a
neighborhood subset of zeros of a polynomial system.
The complement space of this hyperplane consists of a
finite number of connected components, say C$_1$,
\ldots, C$_n$. For any i and \alpha , \beta \in C$_i$,
the bifurcation diagrams Z ( \lambda , \alpha) and Z
(\lambda , \beta) are qualitatively equivalent. Hence,
a choice of bifurcation diagram from each connected
component gives rise to a complete list of persistent
bifurcation diagram classifications for F (z, \lambda ,
\alpha). The RegularChains library in Maple provides a
tool through the command CylindricalAlgebraicDecompose
enabling us to generate this list; see [1]. However,
there usually exist multiple bifurcation diagrams from
each connected component C$_i$ in the generating list.
In this abstract paper, we merely focus on the use of
Gr{\"o}bner basis for multi-dimensional persistent
bifurcation diagram classifications.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hyun:2018:SFU,
author = "Seung Gyu Hyun and Vincent Neiger and Hamid Rahkooy
and {\'E}ric Schost",
title = "Sparse {FGLM} using the block {Wiedemann} algorithm",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "4",
pages = "123--125",
month = dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3338637.3338641",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Oct 23 07:34:18 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Overview. Computing the Gr{\"o}bner basis of an ideal
with respect to a term ordering is an essential step in
solving systems of polynomials; in what follows, we
restrict our attention to systems with finitely many
solutions. Certain term orderings, such as the degree
reverse lexicographical ordering (degrevlex), make the
computation of the Gr{\"o}bner basis faster, while
other orderings, such as the lexicographical ordering (
lex), make it easier to find the coordinates of the
solutions. Thus, one typically first computes a
Gr{\"o}bner basis for the degrevlex ordering, and then
converts it to either a lex Gr{\"o}bner basis or a
related representation, such as Rouillier's Rational
Univariate Representation [8].",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jing:2018:CIP,
author = "Rui-Juan Jing and Marc Moreno Maza",
title = "Computing the integer points of a polyhedron",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "4",
pages = "126--129",
month = dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3338637.3338642",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Oct 23 07:34:18 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The integer points of polyhedral sets are of interest
in many areas of mathematical sciences, see for
instance the landmark textbooks of A. Schrijver [18]
and A. Barvinok [3], as well as the compilation of
articles [4]. One of these areas is the analysis and
transformation of computer programs. For instance,
integer programming [6] is used by P. Feautrier in the
scheduling of for-loop nests [7], Barvinok's algorithm
[2] for counting integer points in polyhedra is adapted
by M. K{\"o}ppe and S. Verdoolaege in [15] to answer
questions like how many memory locations are touched by
a for-loop nest. In [16], W. Pugh proposes an
algorithm, called the Omega Test, for testing whether a
polyhedron has integer points. In the same paper, W.
Pugh shows how to use the Omega Test for performing
dependence analysis [16] in for-loop nests. In [17], W.
Pugh also suggests, without stating a formal algorithm,
that the Omega Test could be used for quantifier
elimination on Presburger formulas. This observation is
a first motivation for the work presented here.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kieffer:2018:IBC,
author = "Jean Kieffer and Luca {De Feo}",
title = "Isogeny-based cryptography in {Julia\slash Nemo}: a
case study",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "4",
pages = "130--132",
month = dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3338637.3338643",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Oct 23 07:34:18 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/julia.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The Couveignes--Rostovtsev--Stolbunov key-exchange
protocol based on isogenies of elliptic curves is of
interest because it may resist quantum attacks, but its
efficient implementation remains a challenge. We
briefly present the computations involved, and
efficient algorithms to achieve the critical steps,
with timing results for our implementations in Sage and
Julia\slash Nemo.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kytmanov:2018:CRI,
author = "A. A. Kytmanov and A. M. Kytmanov and E. K. Myshkina",
title = "On computing residue integrals for a class of
nonlinear transcendental systems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "4",
pages = "133--135",
month = dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3338637.3338644",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Oct 23 07:34:18 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "A method of computing residue integrals with
integration over certain cycles for systems of
transcendental equations is presented. Such integrals
are connected to the power sums of roots for a certain
system of equations. The described approach can be used
for developing methods for the elimination of unknowns
from transcendental systems.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{LaScala:2018:CNH,
author = "Roberto {La Scala} and Sharwan K. Tiwari",
title = "Computing noncommutative {Hilbert} series",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "4",
pages = "136--138",
month = dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3338637.3338645",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Oct 23 07:34:18 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We propose methods for computing the Hilbert series of
multigraded right modules over the free associative
algebra. In particular, we compute such series for
noncommutative multigraded algebras. Using results from
the theory of regular languages, we provide conditions
when the methods are effective and hence the Hilbert
series have a rational sum. Efficient variants of the
methods are also developed for the truncations of
infinite-dimensional algebras which provide
approximations of possibly irrational Hilbert series.
Moreover, we provide a characterization of the
finite-dimensional algebras in terms of the nilpotency
of a key matrix involved in the computations. Finally,
we present a well-tested and complete implementation
for the computation of graded and multigraded Hilbert
series which has been developed in the kernel of the
computer algebra system Singular (for the details, see
preprint[1]).",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lauster:2018:SCM,
author = "Florian Lauster and D. Russell Luke and Matthew K.
Tam",
title = "Symbolic computation with monotone operators",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "4",
pages = "139--141",
month = dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3338637.3338646",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Oct 23 07:34:18 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The Fenchel conjugate, f$^*$, and the subdifferential,
\partial f, of a function f are two objects of
fundamental importance in convex analysis. For this
reason, software libraries or packages which have the
ability to compute and manipulate such objects easily
are a valuable edition to the convex analyst's toolkit.
Moreover, such tools have potential pedagogical uses if
one believes, as we do, that nonsmooth analysis could
and should be a part of the traditional ``calculus''
cannon taught to high school and beginning Bachelor's
level students.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Mou:2018:CSL,
author = "Chenqi Mou and Dongming Wang",
title = "On {$W$}-characteristic sets of lexicographic
{Gr{\"o}bner} bases",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "4",
pages = "142--144",
month = dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3338637.3338647",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Oct 23 07:34:18 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The structures of lexicographic (LEX) Gr{\"o}bner
bases were studied first by Lazard [4] for bivariate
ideals and then extended to general zero-dimensional
multivariate (radical) ideals [3, 6, 2]. Based on the
structures of LEX Gr{\"o}bner bases, algorithms have
been proposed to compute triangular decompositions out
of LEX Gr{\"o}bner bases for zero-dimensional ideals
[5, 2]. The relationships between LEX Gr{\"o}bner bases
and Ritt characteristic sets were explored in [1] and
then made clearer in [8] with the concept of
W-characteristic sets.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Numahata:2018:RAS,
author = "Dai Numahata and Hiroshi Sekigawa",
title = "Robust algorithms for sparse interpolation of
multivariate polynomials",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "4",
pages = "145--147",
month = dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3338637.3338648",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Oct 23 07:34:18 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We consider the problem of symbolic-numeric sparse
interpolation of multivariate polynomials. The problem
is to find the coefficients and the exponents of a
given black-box polynomial $ f(x_1, \ldots, x_n) =
\sum_{j = 1}^t c_j x_1^{d_{j, 1}} \ldots {} x_n^{d_{j,
n}} \in \mathbb {C}[x_1, \ldots, x_n] (c_j \neq 0) $ by
evaluating the value of $ f(x_1, \ldots, x_n) $ at any
point in $ \mathbb {C}^n $ in floating-point arithmetic
and by using the conditions of the input.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sanuki:2018:IEG,
author = "Masaru Sanuki",
title = "Improvement of {EZ-GCD} algorithm based on extended
{Hensel} construction",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "4",
pages = "148--150",
month = dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3338637.3338649",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Oct 23 07:34:18 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In [2], we proposed the EZ-GCD algorithm based on
extended Hensel construction, in order to compute the
GCD of multivariate polynomials. The extended Hensel
construction is a specify factorization into algebraic
function, and it is efficient for sparse multivariate
polynomials. However, it is slower than Maple's GCD
routine. In this paper, we improve our EZ-GCD algorithm
efficiency.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sutherland:2018:CGG,
author = "Nicole Sutherland",
title = "Computation of geometric {Galois} groups and absolute
factorizations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "4",
pages = "151--153",
month = dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3338637.3338650",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Oct 23 07:34:18 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "An algorithm being developed to compute geometric
Galois groups of polynomials over Q(t) is discussed.
This algorithm also computes a field extension such
that the factorization of a polynomial over this field
extension is the absolute factorization of the
polynomial.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hu:2018:ARD,
author = "Jiaxiong (Lucas) Hu and Anton Panferov",
title = "Abstracts of recent doctoral dissertations in computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "52",
number = "4",
pages = "154--155",
month = dec,
year = "2018",
CODEN = "????",
DOI = "https://doi.org/10.1145/3338637.3338651",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Oct 23 07:34:18 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Each quarter we are pleased to present abstracts of
recent doctoral dissertations in Computer Algebra and
Symbolic Computation. We encourage all recent Ph.D.
graduates who have defended in the past two years (and
their supervisors), to submit their abstracts for
publication in CCA. Please send abstracts to the CCA
editors <editors\_SIGSAM@acm.org> for consideration.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Li:2019:RGS,
author = "Ao Li and Robert M. Corless",
title = "Revisiting {Gilbert Strang}'s {``a chaotic search for
$i$''}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "1",
pages = "1--22",
month = mar,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3363520.3363521",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Oct 23 07:34:19 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In the paper ``A Chaotic Search for $i$'' ([25]),
Strang completely explained the behaviour of Newton's
method when using real initial guesses on $ f(x) = x^2
+ 1$, which has only the pair of complex roots \pm i.
He explored an exact symbolic formula for the
iteration, namely x$_n$ = cot (2$^n$ \theta $_0$),
which is valid in exact arithmetic. In this paper, we
extend this to to k$^{th}$ order Householder methods,
which include Halley's method, and to the secant
method. Two formulae, x$_n$ = cot (\theta $_{n - 1}$ +
\theta $_{n - 2}$) with \theta $_{n - 1}$ = arccot (
x$_{n - 1}$) and \theta $_{n - 2}$ = arccot (x$_{n -
2}$), and x$_n$ = cot ((k + 1)$^n$ \theta $_0$) with
\theta $_0$ = arccot(x$_0$), are provided. The
asymptotic behaviour and periodic character are
illustrated by experimental computation. We show that
other methods (Schr{\"o}der iterations of the first
kind) are generally not so simple. We also explain an
old method that can be used to allow Maple's
Fractals[Newton] package to visualize general one-step
iterations by disguising them as Newton iterations.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Abramov:2019:RRP,
author = "Sergei A. Abramov and Moulay A. Barkatou",
title = "Row reduction process for matrices of scalar
operators: storing the intermediate results of row
transformation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "1",
pages = "23--30",
month = mar,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3363520.3363522",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Oct 23 07:34:19 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "It is well known that if the leading matrix of a
linear ordinary differential or difference system is
nonsingular, then the determinant of this matrix
contains some useful information on solutions of the
system. We investigate a kind of non-arithmetic
complexity of known algorithms for transforming a
matrix of scalar operators to an equivalent matrix
which has non-singular frontal, or, leading matrix. In
the algorithms under consideration, the differentiation
in the differential case and the shift in the
difference case play a significant role. We give some
analysis of the complexity measured as the number of
differentiations or, resp., shifts in the worst case.
We not only offer estimates of the complexity written
using the O-notation, but we also show that some
estimates are sharp and can not be improved.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Yao:2019:ISP,
author = "Shanshan Yao and Yifei Feng and Xiaohong Jia and
Li-Yong Shen",
title = "{ISSAC 2019} software presentations communicated by
{Yue Ren}: a package to compute implicit equations for
rational curves and surfaces",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "2",
pages = "33--36",
month = jun,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3371991.3371992",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Nov 14 05:46:36 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Implicit is a package for implicitizing rational
planar curves and rational tensor product surfaces,
developed on Maplesoft based on the state-of-the-art
implicitization techniques. The main functions ImpCurve
and ImpSurface return the implicit equation of a
rational planar curve or a rational tensor product
surface. Other popularly used functions, such as
ImpDegree, ImpMatrix and ImpRuled that are used for
deciding the implicit degree and the implicit matrix of
a general rational surface, and computing the implicit
equation of a rational ruled surface in a more
efficient way, are also proposed.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hong:2019:STA,
author = "Hoon Hong and Alexey Ovchinnikov and Gleb Pogudin and
Chee Yap",
title = "{SIAN}: a tool for assessing structural
identifiability of parametric {ODEs}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "2",
pages = "37--40",
month = jun,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3371991.3371993",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Nov 14 05:46:36 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Many important real-world processes are modeled using
systems of ordinary differential equations (ODEs)
involving unknown parameters. The values of these
parameters are usually inferred from experimental data.
However, due to the structure of the model, there might
be multiple parameter values that yield the same
observed behavior even in the case of continuous
noise-free data. It is important to detect such
situations a priori, before collecting actual data. In
this case, the only input is the model itself, so it is
natural to tackle this question by methods of symbolic
computation. We present new software SIAN (Structural
Identifiability ANalyser) that solves this problem. Our
software allows to tackle problems that could not be
tackled before. It is written in Maple and available at
https://github.com/pogudingleb/SIAN.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Larrieu:2019:CGB,
author = "Robin Larrieu",
title = "Computing generic bivariate {Gr{\"o}bner} bases with
{Mathemagix}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "2",
pages = "41--44",
month = jun,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3371991.3371994",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Nov 14 05:46:36 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Let A, B \in K[ X,Y ] be two bivariate polynomials
over an effective field K, and let G be the reduced
Gr{\"o}bner basis of the ideal I:= \langle A, B \rangle
generated by A and B with respect to the usual degree
lexicographic order. Assuming A and B sufficiently
generic, G admits a so-called concise representation
that helps computing normal forms more efficiently [7].
Actually, given this concise representation, a
polynomial P \in K[ X, Y ] can be reduced modulo G with
quasi-optimal complexity (in terms of the size of the
input A, B, P ). Moreover, the concise representation
can be computed from the input A, B with quasi-optimal
complexity as well. The present paper reports on an
efficient implementation for these two tasks in the
free software Mathemagix [10]. This implementation is
included in Mathemagix as a library called Larrix.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Lee:2019:CAS,
author = "Kisun Lee",
title = "Certifying approximate solutions to polynomial systems
on {Macaulay2}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "2",
pages = "45--48",
month = jun,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3371991.3371995",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Nov 14 05:46:36 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/macaulay2.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We present the Macaulay2 package
NumericalCertification for certifying roots of square
polynomial systems. It employs the interval Krawczyk
method and $ \alpha $-theory as main methods for
certification. The package works with output data
computed in Macaulay2 with no need for external
software. Also, our implementation supports the
Krawczyk method which uses interval arithmetic.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Hofstadler:2019:COI,
author = "Clemens Hofstadler and Clemens G. Raab and Georg
Regensburger",
title = "Certifying operator identities via noncommutative
{Gr{\"o}bner} bases",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "2",
pages = "49--52",
month = jun,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3371991.3371996",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Nov 14 05:46:36 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Matrices or linear operators and their identities can
be modelled algebraically by noncommutative polynomials
in the free algebra. For proving new identities of
matrices or operators from given ones, computations are
done formally with noncommutative polynomials.
Computations in the free algebra, however, are not
necessarily compatible with formats of matrices resp.
with domains and codomains of operators. For ensuring
validity of such computations in terms of operators, in
principle, one would have to inspect every step of the
computation. In [9], an algebraic framework is
developed that allows to rigorously justify such
computations without restricting the computation to
compatible expressions. The main result of that paper
reduces the proof of an operator identity to verifying
membership of the corresponding polynomial in the ideal
generated by the polynomials corresponding to the
assumptions and verifying compatibility of this
polynomial and of the generators of the ideal.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Jimenez-Pastor:2019:SID,
author = "Antonio Jim{\'e}nez-Pastor",
title = "A {Sage} implementation for {DD}-finite functions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "2",
pages = "53--56",
month = jun,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3371991.3371997",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Nov 14 05:46:36 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We present here the Sage package dd\_functions which
provides many features to compute with DD-finite
functions, a natural extension of the class of
holonomic or D-finite functions. The package, focused
on a functional approach, allows the user to compute
closure properties, extract coefficient sequences and
compute the composition (as formal power series) of
functions treated in this package. All these operations
reduce the problem to linear algebra computations where
classical division-free algorithms are used.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kauers:2019:MOP,
author = "Manuel Kauers and Marc Mezzarobba",
title = "Multivariate {Ore} polynomials in {SageMath}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "2",
pages = "57--60",
month = jun,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3371991.3371998",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Nov 14 05:46:36 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We present the latest update of the ore\_algebra
package for SageMath. The main new feature in this
release is the support of operators in several
variables.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Cuevas-Rozo:2019:KIA,
author = "Juli{\'a}n Cuevas-Rozo and Jose Divas{\'o}n and Miguel
Marco-Buzun{\'a}riz and Ana Romero",
title = "A {Kenzo} interface for algebraic topology
computations in {SageMath}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "2",
pages = "61--64",
month = jun,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3371991.3371999",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Nov 14 05:46:36 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In this work we present an interface between SageMath
and Kenzo, together with an optional Kenzo package. Our
work makes it possible to communicate both computer
algebra programs and enhances the SageMath system with
new capabilities in algebraic topology, dealing in
particular with simplicial objects of infinite
nature.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Abramov:2019:CCA,
author = "Sergei A. Abramov and Anna Ryabenko and Leonid A.
Sevastianov and Min Wu and Yvette Zonn",
title = "The conference {``Computer Algebra''} in {Moscow}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "2",
pages = "65--77",
month = jun,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3371991.3372000",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Nov 14 05:46:36 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The International Conference ``Computer Algebra'' was
held in Moscow, Russia from June 17--21, 2019. The
conference web-site is
\url{http://www.ccas.ru/ca/conference}. Co-organized by
the Dorodnicyn Computing Centre (Federal Research
Center ``Computer Science and Control'') of the Russian
Academy of Sciences and the Peoples' Friendship
University of Russia, it was devoted to computer
algebra and related topics. This is the third edition
of the conference, and the previous two were in 2016
and 2017, respectively.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Sakata:2019:ERS,
author = "Kosuke Sakata",
title = "An efficient reduction strategy for signature-based
algorithms to compute {Gr{\"o}bner} basis",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "3",
pages = "81--92",
month = sep,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3377006.3377007",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 19 09:43:43 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "This paper introduces a strategy for signature-based
algorithms to compute Gr{\"o}bner basis. In comparison
with Buchberger algorithm, signature-based algorithms
generate S-pairs instead of S-polynomials, and operate
$s$-reductions instead of usual reductions which is
used in Buchberger algorithm. There are two strategies
for $s$-reductions: one is only-top reduction strategy
which is the way that only leading monomials are
$s$-reduced. The other is full reduction strategy which
is the way that all monomials are $s$-reduced. New
strategy for $s$-reduction of S-pairs, which we call
selective-full strategy, is introduced in this paper.
The idea of the strategy is that when we have computed
a signature Gr{\"o}bner basis, there are unnecessary
elements for a minimal Gr{\"o}bner basis, so candidates
of elements included in a minimal Gr{\"o}bner basis
should be sufficiently reduced. According to the
experimental result, proposed strategy is efficient for
computing the reduced Gr{\"o}bner basis. For computing
a signature Gr{\"o}bner basis, it's the most efficient
or not the worst of the three strategies.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Aldossari:2019:MSD,
author = "Shayea Aldossari and Mark van Hoeij",
title = "Methods for simplifying differential equations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "3",
pages = "93--95",
month = sep,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3377006.3377008",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 19 09:43:43 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Chen:2019:AOS,
author = "Shaoshi Chen and Jing Guo",
title = "Additive {Ore--Sato} theorem",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "3",
pages = "96--98",
month = sep,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3377006.3377009",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 19 09:43:43 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Chi:2019:GAB,
author = "Boming Chi and Akira Terui",
title = "The {GPGCD} algorithm with the {B{\'e}zout} matrix",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "3",
pages = "99--102",
month = sep,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3377006.3377010",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 19 09:43:43 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "With the progress of algebraic computations on
polynomials and matrices, we are paying more attention
to approximate algebraic algorithms. Among approximate
algebraic algorithms, those for calculating approximate
greatest common divisor (GCD) consider a pair of given
polynomials $f$ and $g$ that are relatively prime in
general, and find $f$ and $g$ which are close to $f$
and $g$, respectively, in the sense of polynomial norm,
and have the GCD of certain degree. The algorithms can
be classified into two categories: (1) for a given
tolerance (magnitude) of $ || f - \tilde {f} ||$ and $
|| g - \tilde {g} ||$, make the degree of approximate
GCD as large as possible, and (2) for a given degree
$d$, minimize the magnitude of $ || f - \tilde {f}||$
and $ || g - \tilde {g} ||$.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Corless:2019:AGB,
author = "Robert M. Corless and Leili Rafiee Sevyeri",
title = "Approximate {GCD} in {Bernstein} basis",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "3",
pages = "103--106",
month = sep,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3377006.3377011",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 19 09:43:43 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In general, finding the Greatest Common Divisor (GCD)
of two exactly-known univariate polynomials is a well
understood problem. However, it is also known that the
GCD problem for noisy polynomials (polynomials with
errors in their coefficients) is ill-posed. More
precisely, a small error in coefficients of polynomials
$P$ and $Q$ with a non-trivial GCD generically leads to
a constant GCD. We note that the choice of basis makes
no difference to this difficulty.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Darkey-Mensah:2019:IFI,
author = "Mawunyo Kofi Darkey-Mensah and Przemys{\l}aw
Koprowski",
title = "Intrinsic factorization of ideals in {Dedekind}
domains",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "3",
pages = "107--109",
month = sep,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3377006.3377012",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 19 09:43:43 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We present a generalization of a polynomial
factorization algorithm that works with ideals in
maximal orders of global function fields. The method
presented in this paper is intrinsic in the sense that
it does not depend on the embedding of the ring of
polynomials into the Dedekind domain in question.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Du:2019:ADM,
author = "Hao Du and Jing Guo and Ziming Li",
title = "An additive decomposition in multiple logarithmic
extensions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "3",
pages = "110--113",
month = sep,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3377006.3377013",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 19 09:43:43 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Let $K$ be a tower of logarithmic extensions over $
C(x)$. There exists a well-generated tower $E$ of
logarithmic extensions containing $K$. We outline an
additive decomposition in $E$. More precisely, for an
element $f$ of $E$, the additive decomposition computes
$g$, $ r \in E$ such that $ f = g' + r$ with the
following two properties: (i) $r$ is minimal in some
sense; (ii) $f$ has an integral in $E$ if and only if $
r = 0$. Furthermore, $ f \in K$ has an elementary
integral over $K$ if and only if $r$ is a $C$-linear
combination of some logarithmic derivatives in $E$.
Consequently, we can determine elementary integrability
in logarithmic extensions without solving any Risch's
equation. This is a generalization of the results in
the paper \booktitle{Additive Decompositions in
Primitive Extensions} by S. Chen, H. Du and Z. Li in
Proc. of ISSAC 2018.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Elliott:2019:BCC,
author = "Jesse Elliott and {\'E}ric Schost",
title = "Bit complexity for critical point computation in
smooth and compact real hypersurfaces",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "3",
pages = "114--117",
month = sep,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3377006.3377014",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 19 09:43:43 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Consider the polynomial mapping defined by the
projection to the first coordinate on a real, smooth
and compact hypersurface. The critical points of this
mapping in generic coordinates have several
applications in real algebraic geometry. We provide bit
complexity estimates for computing them. Generic
coordinates are obtained by applying a randomly chosen
linear change of variables to the polynomial defining
the hypersurface. The coordinates are sufficiently
generic when the Jacobian matrix of the system under
study has full rank at the critical points and when the
number of critical points is finite. We have proven a
new quantitative extension of Thom's weak
transversality theorem [1]. By applying this extension,
we are able to choose sufficiently generic changes of
variables with arbitrarily high probability.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Heule:2019:FSM,
author = "Marijn Heule and Manuel Kauers and Martina Seidl",
title = "A family of schemes for multiplying $ 3 \times 3 $
matrices with 23 coefficient multiplications",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "3",
pages = "118--121",
month = sep,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3377006.3377015",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 19 09:43:43 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We present a 17-dimensional family of multiplication
schemes for $ 3 \times 3 $ matrices with 23
multiplications applicable to arbitrary coefficient
rings.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Huang:2019:AAC,
author = "Bo Huang and Wei Niu",
title = "Algebraic approach to chaos induced by snapback
repeller",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "3",
pages = "122--125",
month = sep,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3377006.3377016",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 19 09:43:43 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "In this poster we present the results of [1]. We
consider the problem of detecting chaotic behaviors in
discrete dynamical systems. We propose an algebraic
criterion for determining whether all the zeros of a
given polynomial are outside the unit circle in the
complex plane. This criterion is used to deduce
critical algebraic conditions for the occurrence of
chaos in multi-dimensional discrete systems based on
Marotto's theorem. Using these algebraic conditions we
reduce the problem of analyzing chaos induced by
snapback repeller to an algebraic problem, and
introduce an algorithmic approach to solve this problem
by means of symbolic computation. The proposed approach
is effective as shown by several examples and can be
used to determine the possibility that all the fixed
points are snapback repellers.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kauers:2019:WYS,
author = "Manuel Kauers and Thibaut Verron",
title = "Why you should remove zeros from data before
guessing",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "3",
pages = "126--129",
month = sep,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3377006.3377017",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 19 09:43:43 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "A common advice in automated guessing is that when the
input is a sequence like 2, 0, 0, 7, 0, 0, 17,
\ldots{}, one should remove the zeros before passing
the data to the guesser. On this poster, we explain why
this approach is sound, and which problem may arise if
one does not take this step.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Kondo:2019:RCM,
author = "Kazuki Kondo and Hiroshi Sekigawa",
title = "Robust computation methods for sparse interpolation of
multivariate polynomials",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "3",
pages = "130--133",
month = sep,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3377006.3377018",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 19 09:43:43 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "For the problem of sparse interpolation of
multivariate polynomials, we propose robust computation
methods based on the modified numerical Ben-Or/Tiwari
algorithm by M. Giesbrecht, G. Labahn, and W.-s. Lee.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Liu:2019:BDI,
author = "Jiang Liu",
title = "Block distance invariant method for monoterm
canonicalization of {Riemann} tensor polynomials",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "3",
pages = "134--137",
month = sep,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3377006.3377019",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 19 09:43:43 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "Symbolic manipulation of indexed polynomials is one of
the oldest research topics in computer algebra.
Monoterm canonicalization of indexed polynomials is
indispensable in finding canonical forms of indexed
polynomials. This poster puts forward a symmetric-block
distance invariant method and develops a monoterm
canonicalization algorithm for Riemann tensor
polynomials. The algorithm is implemented in Maple, and
shown to be very efficient as the running time is
within 15 seconds even when the number of indices is up
to 400.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Nair:2019:LCE,
author = "Akshar Nair and James Davenport and Gregory Sankaran
and Scott McCallum",
title = "{Lazard}'s {CAD} exploiting equality constraints",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "3",
pages = "138--141",
month = sep,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3377006.3377020",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 19 09:43:43 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "McCallum improved the original Collins CAD projection
operator (assuming well-orientation) and reduced the
projection set even further for quantifier elimination
problems which have equality constraints [6, 7]. Lazard
provided a projection operator (and corresponding
lifting process) that reduces the projection set as
compared to McCallum's and is unconditional like
Collins' original algorithm [2]. Our research extends
Lazard's work by providing a modification that reduces
the projection set even further when there is a single
equality constraint in the quantifier elimination
problem (as in [6]). We also report a slight error in
[7].",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Paluck:2019:NBH,
author = "Garrett Paluck and Michael Monagan",
title = "New bivariate {Hensel} lifting algorithm for $n$
factors",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "3",
pages = "142--145",
month = sep,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3377006.3377021",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 19 09:43:43 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We present a new algorithm for performing linear
Hensel lifting of bivariate polynomials over a finite
field $ F_p $ with $p$ elements. It lifts n monic,
univariate polynomials to recover the factors of a
polynomial $ A(x, y) \in F_p[x, y]$ which is monic in
$x$, and bounded by degrees $ d_x = \deg (A, x)$ and $
d_y = \deg (A, y)$. Our algorithm improves upon
Bernardin's algorithm in [1] and reduces the cost from
[EQUATION] to [EQUATION]. Experimental results show
that our algorithm works efficiently for large degree
polynomials.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Pascual-Ortigosa:2019:AAR,
author = "Patricia Pascual-Ortigosa and Eduardo
S{\'a}enz-de-Cabez{\'o}n and Henry P. Wynn",
title = "Algebraic algorithms for the reliability analysis of
multi-state $k$-out-of-$n$ systems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "3",
pages = "146--149",
month = sep,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3377006.3377022",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 19 09:43:43 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "We develop algorithms for the analysis of multi-state
$k$-out-of-$n$ systems and their reliability based on
commutative algebra.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Zhou:2019:FAF,
author = "Yi Zhou and Mark van Hoeij",
title = "Fast algorithm for factoring difference operators",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "3",
pages = "150--152",
month = sep,
year = "2019",
CODEN = "????",
DOI = "https://doi.org/10.1145/3377006.3377023",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 19 09:43:43 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{AMSS:2020:ISW,
author = "{Academy of Mathematics and Systems Science}",
title = "International Symposium on {Wen-Tsun Wu}'s Academic
Thought and Mathematics Mechanization",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "4",
pages = "155--181",
month = mar,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3388974.3388975",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Apr 6 09:08:49 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/abs/10.1145/3388974.3388975",
abstract = "During May 12-17, 2019, shall we celebrate the late
famous mathematician Wen-Tsun Wu's centenary birthday.
Professor Wen-Tsun Wu is one of the most
internationally influential mathematicians in China,
who brought far-reaching influence on both \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Gerhard:2020:MC,
author = "J{\"u}rgen Gerhard and Ilias S. Kotsireas",
title = "{Maple} Conference 2019",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "4",
pages = "182--182",
month = mar,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3388974.3388976",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Apr 6 09:08:49 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/abs/10.1145/3388974.3388976",
abstract = "The Maple Conference 2019 was held at the University
of Waterloo in Waterloo, Ontario, Canada, on October 15
--- October 17, 2019.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{CCA:2020:ARD,
author = "{CCA editors}",
title = "Abstracts of recent doctoral dissertations in computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "4",
pages = "183--188",
month = mar,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3388974.3388977",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Apr 6 09:08:49 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/abs/10.1145/3388974.3388977",
abstract = "Each quarter we are pleased to present abstracts of
recent doctoral dissertations in Computer Algebra and
Symbolic Computation. We encourage all recent Ph.D.
graduates who have defended in the past two years (and
their supervisors), to submit their \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{Emiris:2020:PPG,
author = "Ioannis Emiris",
title = "15 {PhD} positions in {GRAPES}: learning, processing
\& optimising shapes",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "53",
number = "4",
pages = "189--189",
month = mar,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3388974.3388978",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Apr 6 09:08:49 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/abs/10.1145/3388974.3388978",
abstract = "We are pleased to announce 15 open PhD Positions
within the new European Network GRAPES: Learning,
Processing and Optimising Shapes. GRAPES is a Marie
Sk{\l}odowska-Curie Innovative Training Network in the
framework of H2020, started on December 1st, 2019,.
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}
@Article{vanderHoeven:2020:UCN,
author = "Joris van der Hoeven and Gr{\'e}goire Lecerf",
title = "Ultimate complexity for numerical algorithms",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "54",
number = "1",
pages = "1--13",
month = aug,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3419048.3419049",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Aug 20 08:02:39 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3419048.3419049",
abstract = "Most numerical algorithms are designed for single or
double precision floating point arithmetic, and their
complexity is measured in terms of the total number of
floating point operations. The resolution of problems
with high condition numbers (e.g., when approaching a
singularity or degeneracy) may require higher working
precisions, in which case it is important to take the
precision into account when doing complexity analyses.
In this paper, we propose a new ``ultimate complexity''
model, which focuses on analyzing the cost of numerical
algorithms for ``sufficiently large'' precisions. As an
example application we will present an ultimately
softly linear time algorithm for modular composition of
univariate polynomials.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Seiler:2020:JCD,
author = "Werner M. Seiler",
title = "{Jacques Calmet} dies at 77",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "54",
number = "1",
pages = "14--15",
month = aug,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3419048.3419050",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Aug 20 08:02:39 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3419048.3419050",
abstract = "The computer algebra community lost one of its
pioneers when Jacques Calmet died on 7th April 2019
aged 77. Born in Marseille, he studied physics at the
University of Aix-Marseille where he received his Ph.D.
in 1966 and his Doctorat-{\'e}s-Sciences in 1970. He
was from 1965 to 1988 first a researcher, then a
research director with the French CNRS. Until 1981 he
was mainly working in physics at the Centre de Physique
Th{\'e}orique de Marseille, then he moved to Grenoble
to work first at IMAG and then at LIFIA more in the
field of computer science. During this time, he spent
repeatedly longer spells at foreign universities and
research centres like the Universities of Utah and
Delaware in the USA, the University of Karlsruhe,
Germany, and the CERN Theory Division in Geneva,
Switzerland. In 1988 he moved permanently to the
University of Karlsruhe where he was a professor of
computer science until his retirement in 2007.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Abramov:2020:CSR,
author = "Sergei A. Abramov and Denis E. Khmelnov and Anna A.
Ryabenko",
title = "Checkpoints in searching for rational solutions of
linear ordinary difference and differential systems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "54",
number = "2",
pages = "18--29",
month = sep,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3427218.3427219",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Sep 30 13:46:41 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3427218.3427219",
abstract = "It is quite common that search algorithms for those
solutions of difference and differential equations and
systems that belong to a fixed class of functions are
designed so that nonexistence of solutions of the
desired type is detected only in the last \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Jimenez-Pastor:2020:SPC,
author = "Antonio Jim{\'e}nez-Pastor and Alin Bostan and
Fr{\'e}d{\'e}ric Chyzak and Pierre Lairez",
title = "The {Sage} package {\tt comb\_walks} for walks in the
quarter plane",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "54",
number = "2",
pages = "30--38",
month = sep,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3427218.3427220",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Sep 30 13:46:41 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3427218.3427220",
abstract = "We present in this extended abstract a new software
designed to work with generating functions that count
walks in the quarter plane. With this software we offer
a cohesive package that brings together all the
required procedures for manipulating these \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Crowley:2020:MPS,
author = "Colin Crowley and Jose Israel Rodriguez and Jacob
Weiker and Jacob Zoromski",
title = "{MultiRegeneration} for polynomial system solving",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "54",
number = "2",
pages = "39--43",
month = sep,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3427218.3427221",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Sep 30 13:46:41 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3427218.3427221",
abstract = "We demonstrate our implementation of a continuation
method as described in [7] for solving polynomials
systems. Given a sequence of (multi)homogeneous
polynomials, the software multiregeneration outputs the
respective (multi)degree in a wide range of \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Harkonen:2020:AOD,
author = "Marc H{\"a}rk{\"o}nen and Benjamin Hollering and
Fatemeh Tarashi Kashani and Jose Israel Rodriguez",
title = "Algebraic optimization degree",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "54",
number = "2",
pages = "44--48",
month = sep,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3427218.3427222",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Sep 30 13:46:41 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3427218.3427222",
abstract = "The Macaulay2 [5] package AlgebraicOptimization
implements methods for determining the algebraic degree
of an optimization problem. We describe the structure
of an algebraic optimization problem and explain how
the methods in this package may be used to \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Katsamaki:2020:PMP,
author = "Christina Katsamaki and Fabrice Rouillier and Elias
Tsigaridas and Zafeirakis Zafeirakopoulos",
title = "{PTOPO}: a {MAPLE} package for the topology of
parametric curves",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "54",
number = "2",
pages = "49--52",
month = sep,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3427218.3427223",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Sep 30 13:46:41 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3427218.3427223",
abstract = "PTOPO is a MAPLE package computing the topology and
describing the geometry of a parametric plane curve.
The algorithm behind PTOPO constructs an abstract graph
that is isotopic to the curve. PTOPO exploits the
benefits of the parametric representation and performs
all computations in the parameter space using exact
computing. PTOPO computes the topology and visualizes
the curve in less than a second for most examples in
the literature.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Koprowski:2020:CMP,
author = "Przemys{\l}aw Koprowski",
title = "{CQF Magma} package",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "54",
number = "2",
pages = "53--56",
month = sep,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3427218.3427224",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Sep 30 13:46:41 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/gnu.bib;
https://www.math.utah.edu/pub/tex/bib/magma.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3427218.3427224",
abstract = "CQF is a free, open-source Magma package for doing
computations in quadratic forms theory. We present some
selected ingredients of the package.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Romero:2020:NKM,
author = "Ana Romero and Julio Rubio and Francis Sergeraert and
Markus Szymik",
title = "A new {Kenzo} module for computing the
{Eilenberg--Moore} spectral sequence",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "54",
number = "2",
pages = "57--60",
month = sep,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3427218.3427225",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Sep 30 13:46:41 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3427218.3427225",
abstract = "In this work we present a new module for the computer
algebraic topology system Kenzo computing the
Eilenberg--Moore spectral sequence of fibrations
between spaces with effective homology. These programs
can be applied to determine the Eilenberg--Moore
spectral sequence of extensions of finitely generated
abelian groups.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Monagan:2020:RDJ,
author = "Michael Monagan",
title = "The {2019 Richard D. Jenks} memorial prize",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "54",
number = "2",
pages = "61--61",
month = sep,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3427218.3427226",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Sep 30 13:46:41 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3427218.3427226",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Staff:2020:RUE,
author = "Staff",
title = "Recent and upcoming events",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "54",
number = "2",
pages = "62--64",
month = sep,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3427218.3427227",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Wed Sep 30 13:46:41 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3427218.3427227",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{vanderHoeven:2020:COB,
author = "Joris van der Hoeven and Michael Monagan",
title = "Computing one billion roots using the tangent
{Graeffe} method",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "54",
number = "3",
pages = "65--85",
month = sep,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3457341.3457342",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue May 11 15:38:43 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3457341.3457342",
abstract = "Let p be a prime of the form $ p = \sigma 2^k + 1 $
with $ \sigma $ small and let $ F_p $ denote the finite
field with $p$ elements. Let $ P(z)$ be a polynomial of
degree $d$ in $ F_p[z]$ with $d$ distinct roots in $
F_p$. For $ p = 5 \cdot 2^{55} + 1$ we can compute the
roots of such polynomials of \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Rojas:2020:CCS,
author = "J. Maurice Rojas and Yuyu Zhu",
title = "A complexity chasm for solving sparse polynomial
equations over $p$-adic fields: extended abstract",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "54",
number = "3",
pages = "86--90",
month = sep,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3457341.3457343",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue May 11 15:38:43 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3457341.3457343",
abstract = "The applications of solving systems of polynomial
equations are legion: The real case permeates all of
non-linear optimization as well as numerous problems in
engineering. The p -adic case leads to many classical
questions in number theory, and is close \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Qi:2020:CMC,
author = "Jiayue Qi",
title = "A calculus for monomials in {Chow} group of zero
cycles in the moduli space of stable curves",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "54",
number = "3",
pages = "91--94",
month = sep,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3457341.3457344",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue May 11 15:38:43 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3457341.3457344",
abstract = "We introduce an algorithm for computing the value of
all monomials in the Chow group of zero cycles in the
moduli space of stable curves.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Lindner:2020:IDA,
author = "Sebastian Lindner and Laurent Imbert and Michael J.
Jacobson",
title = "Improved divisor arithmetic on generic hyperelliptic
curves",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "54",
number = "3",
pages = "95--99",
month = sep,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3457341.3457345",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue May 11 15:38:43 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3457341.3457345",
abstract = "The divisor class group of a hyperelliptic curve
defined over a finite field is a finite abelian group
at the center of a number of important open questions
in algebraic geometry, number theory and cryptography.
Many of these problems lend themselves to \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Lindberg:2020:ESP,
author = "Julia Lindberg and Nigel Boston and Bernard C.
Lesieutre",
title = "Exploiting symmetry in the power flow equations using
monodromy",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "54",
number = "3",
pages = "100--104",
month = sep,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3457341.3457346",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue May 11 15:38:43 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3457341.3457346",
abstract = "We propose solving the power flow equations using
monodromy. We prove the variety under consideration
decomposes into trivial and nontrivial subvarieties and
that the nontrivial subvariety is irreducible. We also
show various symmetries in the \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Harris:2020:SPS,
author = "Katherine Harris and Jonathan D. Hauenstein and Agnes
Szanto",
title = "Smooth points on semi-algebraic sets",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "54",
number = "3",
pages = "105--108",
month = sep,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3457341.3457347",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue May 11 15:38:43 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3457341.3457347",
abstract = "Many algorithms for determining properties of
semi-algebraic sets rely upon the ability to compute
smooth points [1]. We present a simple procedure based
on computing the critical points of some well-chosen
function that guarantees the computation of \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Berthomieu:2020:TFO,
author = "J{\'e}r{\'e}my Berthomieu and Andrew Ferguson and
Mohab Safey {El Din}",
title = "Towards fast one-block quantifier elimination through
generalised critical values",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "54",
number = "3",
pages = "109--113",
month = sep,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3457341.3457348",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue May 11 15:38:43 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3457341.3457348",
abstract = "One-block quantifier elimination is comprised of
computing a semi-algebraic description of the
projection of a semi-algebraic set or of deciding the
truth of a semi-algebraic formula with a single
quantifier.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Chalkis:2020:SFS,
author = "Apostolos Chalkis and Vissarion Fisikopoulos and
Panagiotis Repouskos and Elias Tsigaridas",
title = "Sampling the feasible sets of {SDPs} and volume
approximation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "54",
number = "3",
pages = "114--118",
month = sep,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3457341.3457349",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue May 11 15:38:43 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3457341.3457349",
abstract = "We present algorithmic, complexity, and implementation
results on the problem of sampling points in the
interior and the boundary of a spectrahedron, that is
the feasible region of a semidefinite program. Our main
tool is random walks. We define and \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Bychkov:2020:OMQ,
author = "Andrey Bychkov and Gleb Pogudin",
title = "Optimal monomial quadratization for {ODE} systems:
extended abstract",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "54",
number = "3",
pages = "119--123",
month = sep,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3457341.3457350",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue May 11 15:38:43 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3457341.3457350",
abstract = "Transformation of a polynomial ODE system to a special
quadratic form has been successfully used recently as a
preprocessing step for model order reduction methods.
However, to the best of our knowledge, there has been
no practical algorithm for \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Imamoglu:2020:NSP,
author = "Erdal Imamoglu and Erich L. Kaltofen",
title = "A note on sparse polynomial interpolation in {Dickson}
polynomial basis",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "54",
number = "4",
pages = "125--128",
month = dec,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3465002.3465003",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri May 21 10:34:03 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3465002.3465003",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Valluri:2020:CPT,
author = "Maheswara Rao Valluri",
title = "Combinatorial primality test",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "54",
number = "4",
pages = "129--133",
month = dec,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3465002.3465004",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri May 21 10:34:03 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3465002.3465004",
abstract = "In 1879, Laisant-Beaujeux gave the following result
without proof: If $n$ is a prime, then [EQUATION] This
paper provides proofs of the result of Laisant-Beaujeux
in two cases explicitly: (1) If an integer of the form
$ n = 4 k + 1$, $ k > 0$ is prime, then \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Ou:2020:TMC,
author = "Miao-jung Yvonne Ou",
title = "Teaching multivariable calculus and tensor calculus
with computer algebra software",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "54",
number = "4",
pages = "134--135",
month = dec,
year = "2020",
CODEN = "????",
DOI = "https://doi.org/10.1145/3465002.3465005",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri May 21 10:34:03 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3465002.3465005",
abstract = "To go from calculus of scalar functions of one
variable to multivariate calculus of vector-valued
functions is a steep learning curve for many students.
It takes a lot of practice to get used to the new
concepts such as the directional derivatives, the
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Mayr:2021:VGD,
author = "Ernst W. Mayr and Werner M. Seiler and Evgenii V.
Vorozhtsov",
title = "{Vladimir Gerdt} dies at 73",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "55",
number = "1",
pages = "1--2",
month = mar,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3466895.3467684",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue May 25 16:34:00 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3466895.3467684",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{vanderHoeven:2021:SIR,
author = "Joris van der Hoeven and Gr{\'e}goire Lecerf",
title = "On sparse interpolation of rational functions and
gcds",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "55",
number = "1",
pages = "1--12",
month = mar,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3466895.3466896",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri May 21 10:30:36 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3466895.3466896",
abstract = "In this note, we present a variant of a probabilistic
algorithm by Cuyt and Lee for the sparse interpolation
of multivariate rational functions. We also present an
analogous method for the computation of sparse gcds.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Abramov:2021:WCA,
author = "Sergei A. Abramov and Alla Bogolubskaya",
title = "{22nd Workshop on Computer Algebra in Memory of
Professor Vladimir Gerdt in Dubna}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "55",
number = "2",
pages = "21--29",
month = jun,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3493492.3493493",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Oct 21 10:40:36 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3493492.3493493",
abstract = "The 22nd Workshop on Computer Algebra in memory of
Professor Vladimir Gerdt was held in Dubna, Russia from
May 24-25, 2021. Co-organized by the Dorodnicyn
Computing Centre (Federal Research Center ``Computer
Science and Control'') of Russian Academy of \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Abramov:2021:FCC,
author = "Sergei A. Abramov and Anna Ryabenko and Leonid A.
Sevastianov and Yvette Zonn and Min Wu",
title = "The fourth conference ``computer algebra'' in
{Moscow}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "55",
number = "2",
pages = "30--38",
month = jun,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3493492.3493494",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Oct 21 10:40:36 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3493492.3493494",
abstract = "The International Conference ``Computer Algebra'' was
held online via Zoom on June 28-29, 2021 and the
conference web-site is
http://www.ccas.ru/ca/conference. Co-organized by the
Dorodnicyn Computing Center of Federal Research Center
``Computer Science and Control'' of Russian Academy of
Science and the Peoples' Friendship University of
Russia, the conference was devoted to inspiring
discussions on computer algebra and related topics.
Researchers from different countries presented talks on
their latest research work.\par
This is the fourth edition of the conference, and the
previous three were in 2016, 2017 and 2019,
respectively.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Kovacs:2021:ART,
author = "Zolt{\'a}n Kov{\'a}cs and Tom{\'a}s Recio and M. Pilar
V{\'e}lez",
title = "Automated reasoning tools in {GeoGebra} discovery",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "55",
number = "2",
pages = "39--43",
month = jun,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3493492.3493495",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Oct 21 10:40:36 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3493492.3493495",
abstract = "We present some current achievements in the software
package GeoGebra Discovery that provides several
symbolic tools and commands to mechanically discover
(and verify symbolically) relationships on planar
geometry constructions. Our presentation \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Goyer:2021:SPS,
author = "Alexandre Goyer",
title = "A {Sage} package for the symbolic-numeric
factorization of linear differential operators",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "55",
number = "2",
pages = "44--48",
month = jun,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3493492.3493496",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Oct 21 10:40:36 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3493492.3493496",
abstract = "We present a SageMath implementation of the
symbolic-numeric algorithm introduced by van der Hoeven
in 2007 for factoring linear differential operators
whose coefficients are rational functions.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Ilmer:2021:MAS,
author = "Ilia Ilmer and Alexey Ovchinnikov and Gleb Pogudin",
title = "{Maple} application for structural identifiability
analysis of {ODE} models",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "55",
number = "2",
pages = "49--53",
month = jun,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3493492.3493497",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Oct 21 10:40:36 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3493492.3493497",
abstract = "Structural identifiability properties of models of
ordinary differential equations help one assess if the
parameter's value can be recovered from experimental
data. This theoretical property can be queried without
the need for data collection and is \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Elbaz-Vincent:2021:EFL,
author = "Philippe Elbaz-Vincent and Etienne Marcatel",
title = "An extension of the {fpLLL} library to {Hermitian}
lattices",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "55",
number = "2",
pages = "54--58",
month = jun,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3493492.3493498",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Oct 21 10:40:36 MDT 2021",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3493492.3493498",
abstract = "We present an Hermitian version of the classical
floating-point LLL reduction algorithm of Nguyen and
Stehl{\'e}[16]. This new variant works on imaginary
quadratic fields which are norm-Euclidean and also for
some adequate cyclotomic fields. An optimized C++
implementation has been performed, based on the fpLLL
code and results show a significant improvement for
Hermitian lattices reduction of dimension $N$ when
compared to fpLLL reduction on the corresponding
Euclidean lattice of dimension $ 2 N$. We demonstrate
our implementation in the special case of the Gaussian
integers.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Monagan:2021:CBP,
author = "Michael Monagan",
title = "A call to build a publicly accessible library of
lecture recordings in computer algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "55",
number = "3",
pages = "65--67",
month = sep,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3511528.3511529",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 14 06:55:48 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3511528.3511529",
abstract = "Because of the pandemic, most of us have been teaching
online. Some of us have taught courses in computer
algebra and some of us recorded those lectures. Now is
a good time to assemble a library of computer algebra
lectures on various topics. This will \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Darkey-Mensah:2021:AQF,
author = "Mawunyo Kofi Darkey-Mensah",
title = "Algorithms for quadratic forms over global function
fields of odd characteristic",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "55",
number = "3",
pages = "68--72",
month = sep,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3511528.3511530",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 14 06:55:48 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3511528.3511530",
abstract = "This paper presents an adaptation of recently
developed algorithms for quadratic forms over number
fields in [4] to global function fields of odd
characteristics. First, we present algorithm for
checking if a given non-degenerate quadratic form is
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Garcia-Garcia:2021:CIS,
author = "J. I. Garc{\'\i}a-Garc{\'\i}a and D.
Mar{\'\i}n-Arag{\'o}n and A. Vigneron-Tenorio",
title = "Computing the ideals of sumset semigroups",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "55",
number = "3",
pages = "73--76",
month = sep,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3511528.3511531",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 14 06:55:48 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3511528.3511531",
abstract = "We introduce an algorithm for computing the ideals
associated with some sumset semigroups. Our results
allow us to study some additive properties of
sumsets.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Belhaj:2021:AGC,
author = "Skander Belhaj and Abdulrahman Alsulami",
title = "Approximate greatest common divisor of several
polynomials from {Hankel} matrices",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "55",
number = "3",
pages = "77--81",
month = sep,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3511528.3511532",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 14 06:55:48 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3511528.3511532",
abstract = "This paper is devoted to present a new method for
computing the approximate Greatest Common Divisor (GCD)
of several polynomials (not pairwise) from the
generalized Hankel matrix. Our approach based on the
calculation of cofactors is tested for several
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Pfeifle:2021:LFP,
author = "Julian Pfeifle",
title = "Large final polynomials from integer programming",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "55",
number = "3",
pages = "82--86",
month = sep,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3511528.3511533",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 14 06:55:48 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3511528.3511533",
abstract = "We introduce a new method for finding a
non-realizability certificate of a simplicial sphere $
\Sigma $. It enables us to prove for the first time the
non-realizability of a balanced 2-neighborly 3-sphere
by Zheng, a family of highly neighborly centrally
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Miguel:2021:CNS,
author = "Daniel Miguel and Andrea Guidolin and Ana Romero and
Julio Rubio",
title = "Constructing new spectral systems from simplicial
fibrations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "55",
number = "3",
pages = "87--91",
month = sep,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3511528.3511534",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 14 06:55:48 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3511528.3511534",
abstract = "In this work we present an ongoing project on the
development and study of new spectral systems which
combine filtrations associated to Serre and
Eilenberg-Moore spectral sequences of different
fibrations. Our new spectral systems are part of a new
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Gowda:2021:HPS,
author = "Shashi Gowda and Yingbo Ma and Alessandro Cheli and
Maja Gw{\'o}'zzd'z and Viral B. Shah and Alan Edelman
and Christopher Rackauckas",
title = "High-performance symbolic-numerics via multiple
dispatch",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "55",
number = "3",
pages = "92--96",
month = sep,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3511528.3511535",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 14 06:55:48 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3511528.3511535",
abstract = "As mathematical computing becomes more democratized in
high-level languages, high-performance symbolic-numeric
systems are necessary for domain scientists and
engineers to get the best performance out of their
machine without deep knowledge of code \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Nagasaka:2021:AGR,
author = "Kosaku Nagasaka",
title = "Approximate {GCD} by relaxed {NewtonSLRA} algorithm",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "55",
number = "3",
pages = "97--101",
month = sep,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3511528.3511536",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 14 06:55:48 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3511528.3511536",
abstract = "We propose a better algorithm for approximate greatest
common divisor (approximate GCD) of univariate
polynomials in terms of robustness and distance, based
on the NewtonSLRA algorithm that is a solver for the
structured low rank approximation (SLRA) \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Iglesias:2021:CRP,
author = "Rodrigo Iglesias and Eduardo S{\'a}enz de
Cabez{\'o}n",
title = "Cellular reductions of the {Pommaret--Seiler}
resolution for Quasi-stable ideals",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "55",
number = "3",
pages = "102--106",
month = sep,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3511528.3511537",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 14 06:55:48 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3511528.3511537",
abstract = "Involutive bases were introduced in [6] as a type of
Gr{\"o}bner bases with additional combinatorial
properties. Pommaret bases are a particular kind of
involutive bases with strong relations to commutative
algebra and algebraic geometry[11, 12].",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Bradford:2021:DPP,
author = "R. Bradford and J. H. Davenport and M. England and A.
Sadeghimanesh and A. Uncu",
title = "The {DEWCAD} project: pushing back the doubly
exponential wall of cylindrical algebraic
decomposition",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "55",
number = "3",
pages = "107--111",
month = sep,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3511528.3511538",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 14 06:55:48 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3511528.3511538",
abstract = "This abstract seeks to introduce the ISSAC community
to the DEWCAD project, which is based at Coventry
University and the University of Bath, in the United
Kingdom. The project seeks to push back the Doubly
Exponential Wall of Cylindrical Algebraic \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Matveiakin:2021:DMP,
author = "Andrei Matveiakin",
title = "Discovering multiple polylogarithm equations via
symbolic computations",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "55",
number = "3",
pages = "112--116",
month = sep,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3511528.3511539",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 14 06:55:48 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3511528.3511539",
abstract = "We discuss how symbolic computations can be used to
find functional equations for multiple polylogarithms
and prove parts of Goncharov's depth conjecture. We
present a custom-built C++ toolkit for polylogarithm
symbol manipulations in Lie coalgebras and \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{editors:2021:ARD,
author = "CCA editors",
title = "Abstracts of recent doctoral dissertations in computer
algebra",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "55",
number = "3",
pages = "117--124",
month = sep,
year = "2021",
CODEN = "????",
DOI = "https://doi.org/10.1145/3511528.3511540",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Fri Jan 14 06:55:48 MST 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3511528.3511540",
abstract = "Each quarter we are pleased to present abstracts of
recent doctoral dissertations in Computer Algebra and
Symbolic Computation. We encourage all recent Ph.D.
graduates who have defended in the past two years (and
their supervisors), to submit their \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Naiman:2022:AVS,
author = "Aaron E. Naiman",
title = "Automated vector space proofs using {Mathematica}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "56",
number = "1",
pages = "1--13",
month = mar,
year = "2022",
CODEN = "????",
DOI = "https://doi.org/10.1145/3572865.3572866",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 16:58:02 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/mathematica.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3572865.3572866",
abstract = "We present Mathematica tools for proving or disproving
whether a set of objects constitutes a vector space.
When necessary axioms are upheld, the relationships
between the variables are presented. When the axioms
fail, intuitive counterexamples are shown. A number of
different kinds of vectors are demonstrated, with
varying types of vector addition and scalar
multiplication as well. All of the calculations are
performed in an automated fashion.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Garcia-Marco:2022:CGH,
author = "Ignacio Garc{\'\i}a-Marco and Irene
M{\'a}rquez-Corbella and Edgar Mart{\'\i}nez-Moro and
Yuriko Pitones",
title = "Computing generalized {Hamming} weights of binary
linear codes via free resolutions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "56",
number = "2",
pages = "19--24",
month = jun,
year = "2022",
CODEN = "????",
DOI = "https://doi.org/10.1145/3572867.3572868",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 16:58:02 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3572867.3572868",
abstract = "In this work, we explore the relationship between free
resolution of some monomial ideals and Generalized
Hamming Weights (GHWs) of binary codes. More precisely,
we look for a structure smaller than the set of
codewords of minimal support that provides us some
information about the GHWs. We prove that the first and
second generalized Hamming weight of a binary linear
code can be computed (by means of a graded free
resolution) from a set of monomials associated to a
binomial ideal related with the code. Moreover, the
remaining weights are bounded by the Betti numbers for
that set.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Jimenez-Pastor:2022:CEN,
author = "Antonio Jim{\'e}nez-Pastor and Gleb Pogudin",
title = "Computing exact nonlinear reductions of dynamical
models",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "56",
number = "2",
pages = "25--31",
month = jun,
year = "2022",
CODEN = "????",
DOI = "https://doi.org/10.1145/3572867.3572869",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 16:58:02 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3572867.3572869",
abstract = "Dynamical systems are commonly used to represent
real-world processes. Model reduction techniques are
among the core tools for studying dynamical systems
models, they allow to reduce the study of a model to a
simpler one. In this poster, we present an \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Steininger:2022:EAS,
author = "Jakob Steininger and Sergey Yurkevich",
title = "Extended abstract for: {Solving} {Rupert}'s problem
algorithmically",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "56",
number = "2",
pages = "32--35",
month = jun,
year = "2022",
CODEN = "????",
DOI = "https://doi.org/10.1145/3572867.3572870",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 16:58:02 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3572867.3572870",
abstract = "Undoubtedly the following fact is surprising when
being first encountered with: It is possible to cut a
hole in the unit cube such that another unit cube can
pass through it.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Fontan:2022:CAM,
author = "Jorge Garc{\'\i}a Font{\'a}n and Alessandro Colotti
and S{\'e}bastien Briot and Alexandre Goldsztejn and
Mohab Safey {El Din}",
title = "Computer algebra methods for polynomial system solving
at the service of image-based visual servoing",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "56",
number = "2",
pages = "36--40",
month = jun,
year = "2022",
CODEN = "????",
DOI = "https://doi.org/10.1145/3572867.3572871",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 16:58:02 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3572867.3572871",
abstract = "Visual servoing refers to different methods used for
robot motion control based on data from computer
vision, in general the projection of a number of
characteristics from the scene on a camera mounted on
the robot. When the control is carried out in
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Eder:2022:TSB,
author = "Christian Eder and Pierre Lairez and Rafael Mohr and
Mohab Safey {El Din}",
title = "Towards signature-based {Gr{\"o}bner} basis algorithms
for computing the nondegenerate locus of a polynomial
system",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "56",
number = "2",
pages = "41--45",
month = jun,
year = "2022",
CODEN = "????",
DOI = "https://doi.org/10.1145/3572867.3572872",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 16:58:02 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3572867.3572872",
abstract = "Problem statement. Let K be a field and K be an
algebraic closure of K. Consider the polynomial ring R
= K[ x$_1$, \ldots{}, x$_n$ ] over K and a finite
sequence of polynomials f$_1$, \ldots{}, f$_c$ in R
with c {$<$}= n. Let V \subset K$^n$ be the algebraic
set defined by the simultaneous",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Tabuguia:2022:FAE,
author = "Bertrand Teguia Tabuguia and Wolfram Koepf",
title = "{FPS} in action: an easy way to find explicit formulas
for interlaced hypergeometric sequences",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "56",
number = "2",
pages = "46--50",
month = jun,
year = "2022",
CODEN = "????",
DOI = "https://doi.org/10.1145/3572867.3572873",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 16:58:02 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3572867.3572873",
abstract = "Linear recurrence equations with constant coefficients
define the power series coefficients of rational
functions. However, one usually prefers to have an
explicit formula for the sequence of coefficients,
provided that such a formula is ``simple'' \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Lemaire:2022:IEM,
author = "Fran{\c{c}}ois Lemaire and Louis Roussel",
title = "Integral equation modelling and deep learning",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "56",
number = "2",
pages = "51--55",
month = jun,
year = "2022",
CODEN = "????",
DOI = "https://doi.org/10.1145/3572867.3572874",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 16:58:02 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3572867.3572874",
abstract = "We present some preliminary results on the integration
of integro-differential equations using Deep Learning
techniques.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Suchen:2022:UST,
author = "Jazz G. Suchen and Josu{\'e} Tonelli-Cueto",
title = "Ultrametric {Smale}'s $ \alpha $-theory",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "56",
number = "2",
pages = "56--59",
month = jun,
year = "2022",
CODEN = "????",
DOI = "https://doi.org/10.1145/3572867.3572875",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 16:58:02 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3572867.3572875",
abstract = "We present a version of Smale's $ \alpha $-theory for
ultrametric fields, such as the $p$-adics and their
extensions, which gives us a multivariate version of
Hensel's lemma.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Pages:2022:FDO,
author = "Rapha{\"e}l Pag{\`e}s",
title = "Factoring differential operators over algebraic curves
in positive characteristic",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "56",
number = "2",
pages = "60--63",
month = jun,
year = "2022",
CODEN = "????",
DOI = "https://doi.org/10.1145/3572867.3572876",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 16:58:02 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3572867.3572876",
abstract = "We present an algorithm for factoring linear
differential operators with coefficients in a finite
separable extension of F$_p$ ( x ). Our methods rely on
specific tools arising in positive characteristic: p
-curvature, structure of simple central algebras and
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Trochez:2022:AML,
author = "Juan Pablo Gonz{\'a}lez Trochez and Marc Moreno Maza
and Matt Calder and Erik Postma",
title = "Algorithms for multivariate {Laurent} series",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "56",
number = "2",
pages = "64--67",
month = jun,
year = "2022",
CODEN = "????",
DOI = "https://doi.org/10.1145/3572867.3572877",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 16:58:02 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3572867.3572877",
abstract = "Let K be a field and x$_1$ {$<$} $ \cdot $$ \cdot$$
\cdot $ {$<$} x$_n$ be ordered variables. Consider a
set of polynomials F \subset K[ x$_1$, \ldots{}, x$_n$
]. If the zero set V ( F ) of F is of positive
dimension, then any triangular decomposition \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Qi:2022:IMC,
author = "Jiayue Qi",
title = "An identity on multinomial coefficients",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "56",
number = "2",
pages = "68--71",
month = jun,
year = "2022",
CODEN = "????",
DOI = "https://doi.org/10.1145/3572867.3572878",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 16:58:02 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3572867.3572878",
abstract = "We introduce an identity on multinomial coefficients,
as well as the proof for it.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Hubert:2022:OSM,
author = "Evelyne Hubert and Tobias Metzlaff and Philippe
Moustrou and Cordian Riener",
title = "{$T$}-orbit spaces of multiplicative actions and
applications",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "56",
number = "2",
pages = "72--75",
month = jun,
year = "2022",
CODEN = "????",
DOI = "https://doi.org/10.1145/3572867.3572879",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 16:58:02 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3572867.3572879",
abstract = "We present the results of our recent article [4] and
discuss its applications [5]. A finite group with an
integer representation has a multiplicative action on
the ring of Laurent polynomials, which is induced by a
nonlinear action on the compact torus. \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Sadeghimanesh:2022:SSN,
author = "AmirHosein Sadeghimanesh and Matthew England",
title = "An {SMT} solver for non-linear real arithmetic inside
{Maple}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "56",
number = "2",
pages = "76--79",
month = jun,
year = "2022",
CODEN = "????",
DOI = "https://doi.org/10.1145/3572867.3572880",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 16:58:02 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3572867.3572880",
abstract = "We report on work-in-progress to create an SMT-solver
inside Maple for non-linear real arithmetic (NRA). We
give background information on the algorithm being
implemented: cylindrical algebraic coverings as a
theory solver in the lazy SMT paradigm. We then present
some new work on the identification of minimal
conflicting cores from the coverings.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Chen:2022:FNM,
author = "Tian Chen and Michael Monagan",
title = "Factoring non-monic polynomials represented by black
boxes",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "56",
number = "2",
pages = "80--83",
month = jun,
year = "2022",
CODEN = "????",
DOI = "https://doi.org/10.1145/3572867.3572881",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 16:58:02 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3572867.3572881",
abstract = "We aim to factor a sparse polynomial a \in Z[ x$_1$, $
\cdot $$ \cdot$$ \cdot $, x$_n$ ] represented by a
black box. The authors have previously developed
efficient sparse Hensel lifting algorithms for the
monic and square-free case that outperforms the
algorithm by Kaltofen and Trager \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Iravanian:2022:SNI,
author = "Shahriar Iravanian and Carl Julius Martensen and
Alessandro Cheli and Shashi Gowda and Anand Jain and
Yingbo Ma and Chris Rackauckas",
title = "Symbolic-numeric integration of univariate expressions
based on sparse regression",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "56",
number = "2",
pages = "84--87",
month = jun,
year = "2022",
CODEN = "????",
DOI = "https://doi.org/10.1145/3572867.3572882",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 16:58:02 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3572867.3572882",
abstract = "The majority of computer algebra systems (CAS) support
symbolic integration using a combination of heuristic
algebraic and rule-based (integration table) methods.
In this paper, we present a hybrid (symbolic-numeric)
method to calculate the indefinite \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Jinadu:2022:NIA,
author = "Ayoola Jinadu and Michael Monagan",
title = "A new interpolation algorithm for computing {Dixon}
resultants",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "56",
number = "2",
pages = "88--91",
month = jun,
year = "2022",
CODEN = "????",
DOI = "https://doi.org/10.1145/3572867.3572883",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 16:58:02 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3572867.3572883",
abstract = "Given a system of polynomial equations with
parameters, we present a new interpolation algorithm
for computing its Dixon resultant R. Our algorithm
interpolates the monic square-free factors of R one at
a time from monic univariate polynomial images of
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Cohen:2022:JPA,
author = "Henri Cohen and Bill Allombert and Karim Belabas",
title = "{Jenks Prize} announcement",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "56",
number = "2",
pages = "92--94",
month = jun,
year = "2022",
CODEN = "????",
DOI = "https://doi.org/10.1145/3572867.3572884",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 16:58:02 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3572867.3572884",
abstract = "Pari/GP was designed for algebraic number theory. As
such it does not have some standard features that other
general purpose computer algebra systems have such as
Gr{\"o}bner bases and multivariate polynomial
factorization. In this letter I say a few words
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Sasaki:2022:BBE,
author = "Tateaki Sasaki",
title = "A Bridge between {Euclid} and {Buchberger}: (An
Attempt to Enhance {Gr{\"o}bner} Basis Algorithm by
{PRSs} and {GCDs})",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "56",
number = "3",
pages = "97--124",
month = sep,
year = "2022",
CODEN = "????",
DOI = "https://doi.org/10.1145/3594252.3594253",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 16:58:03 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3594252.3594253",
abstract = "This article surveys a very new method of enhancing
Buchberger's Gr{\"o}bner basis algorithm by the PRSs
(polynomial remainder sequences) and the GCDs of
multivariate polynomials. Let F = { F$_1$, \ldots{},
F$_{m + 1}$ } \subset K[ x, u ] be a given system,
where ( x ) = ( x$_1$, \ldots{}, x$_m$ ) \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Celis:2022:ATI,
author = "Oliver Salazar Celis",
title = "Adaptive {Thiele} interpolation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "56",
number = "3",
pages = "125--132",
month = sep,
year = "2022",
CODEN = "????",
DOI = "https://doi.org/10.1145/3594252.3594254",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 16:58:03 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3594252.3594254",
abstract = "The current implementation of Thiele rational
interpolation in Maple (the Thieleinterpolation
routine) breaks down when the points are not
well-ordered. In this article, it is shown how this
breakdown can be avoided by ordering the interpolation
points \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Abramov:2023:LDO,
author = "Sergei Abramov and Gleb Pogudin",
title = "Linear Difference Operators with Sequence Coefficients
Having Infinite-Dimentional Solution Spaces",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "1",
pages = "1--4",
month = mar,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3610377.3610378",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 16:58:03 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3610377.3610378",
abstract = "The notion of lacunary infinite numerical sequence is
introduced. It is shown that for an arbitrary linear
difference operator L with coefficients belonging to
the set R of infinite numerical sequences, a criterion
(i.e., a necessary and sufficient \ldots{}).",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Ekhad:2023:CCW,
author = "Shalosh B. Ekhad and Doron Zeilberger",
title = "Counting Clean Words According to the Number of Their
Clean Neighbors",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "1",
pages = "5--9",
month = mar,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3610377.3610379",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 16:58:03 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3610377.3610379",
abstract = "In fond memory of Marko Petkovsek (1955--2023), a
great summer and enumerator.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
keywords = "Maple",
}
@Article{Petkovsek:2023:MP,
author = "Eva U. Petkovsek",
title = "{Marko Petkovsek} 1955--2023",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "1",
pages = "10--18",
month = mar,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3610377.3610380",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 16:58:03 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3610377.3610380",
abstract = "During the last months of his life, while still
undergoing chemotherapy after a recent severe
oncological operation, Marko remained very much engaged
in his work. Actually, not only did he collaborate with
one of his young students on an article which was later
accepted for publication. He co-wrote as well another
one on the subject of the representation of prime
numbers by quadratic forms with a now deceased surveyor
adept at computer experiments. Marko both came up with
the formulation and proof of the corresponding
hypotheses.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Okuda:2023:UIS,
author = "Kazuki Okuda and Kiyoshi Shirayanagi",
title = "Using the Interval-Symbol Method with Zero Rewriting
to Factor Polynomials over Algebraic Number Fields",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "2",
pages = "21--30",
month = jun,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3614408.3614409",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 17:12:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3614408.3614409",
abstract = "The ISZ method (Interval-Symbol method with Zero
rewriting) based on stabilization theory was proposed
to reduce the amount of exact computations as much as
possible but obtain the exact results by aid of
floating-point computations. In this paper, we
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Blumlein:2023:CMR,
author = "Johannes Bl{\"u}mlein and Nikolai Fadeev and Carsten
Schneider",
title = "Computing {Mellin} Representations and Asymptotics of
Nested Binomial Sums in a Symbolic Way: The {RICA}
Package",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "2",
pages = "31--34",
month = jun,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3614408.3614410",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 17:12:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3614408.3614410",
abstract = "Nested binomial sums form a particular class of sums
that arise in the context of particle physics
computations at higher orders in perturbation theory
within QCD and QED, but that are also mathematically
relevant, e.g., in combinatorics. We present the
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Berthomieu:2023:MMM,
author = "J{\'e}r{\'e}my Berthomieu and Stef Graillat and
Dimitri Lesnoff and Theo Mary",
title = "Modular Matrix Multiplication on {GPU} for Polynomial
System Solving",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "2",
pages = "35--38",
month = jun,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3614408.3614411",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 17:12:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3614408.3614411",
abstract = "The bottleneck of the SPARSE-FGLM algorithm for
Gr{\"o}bner bases change of order is an iterative
matrix --- tall and skinny matrix product over a finite
prime field. Our contribution is twofold. First, we
port existing CPU-only algorithms for matrix products
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{He:2023:MMP,
author = "Yang-Hui He and Vishnu Jejjala and Brent D. Nelson and
Hal Schenck and Michael Stillman",
title = "{MSSM}: a {Macaulay2} Package for the Vacuum Moduli
Space",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "2",
pages = "39--42",
month = jun,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3614408.3614412",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 17:12:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/macaulay2.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3614408.3614412",
abstract = "The Standard Model of particle physics has been
amazingly successful at explaining interactions between
three of the four fundamental forces of physics: the
strong force, the weak force, and electro-magnetism.
But it is an incomplete theory, failing to \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Brown:2023:FRT,
author = "Christopher Brown and Zolt{\'a}n Kov{\'a}cs and
Tom{\'a}s Recio",
title = "Faithful Real-Time Animation of Parametrized (Semi-)
Algebraic Expressions via Cylindrical Algebraic
Decomposition",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "2",
pages = "43--46",
month = jun,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3614408.3614413",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 17:12:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3614408.3614413",
abstract = "We present some current improvements, implemented in
the software package GeoGebra Discovery, that combine
symbolic computation and graphics algorithms to
faithfully visualize (semi-)algebraic expressions. Our
implementation allows fluid animation of \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Marco-Buzunariz:2023:EHU,
author = "Miguel A. Marco-Buzun{\'a}riz and Ana Romero and Jose
Divas{\'o}n",
title = "Effective Homology of Universal Covers",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "2",
pages = "47--50",
month = jun,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3614408.3614414",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 17:12:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3614408.3614414",
abstract = "We present an algorithm for constructing the effective
homology for the universal cover of simplicial sets
with effective homology, provided that a nilpotency
condition holds. This can be useful for computing
higher homotopy groups, since this process \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Tabuguia:2023:OAF,
author = "Bertrand Teguia Tabuguia",
title = "Operations for {$D$}-Algebraic Functions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "2",
pages = "51--56",
month = jun,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3614408.3614415",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 17:12:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3614408.3614415",
abstract = "A function is differentially algebraic (or simply
D-algebraic) if there is a polynomial relationship
between some of its derivatives and the indeterminate
variable. Many functions in the sciences, such as
Mathieu functions, the Weierstrass elliptic \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Zidaric:2023:FFF,
author = "Nusa Zidaric and Guang Gong and Mark Aagaard and
Aleksandar Jurisi{\'c} and Olexandr Konovalov",
title = "{FFCSA} --- Finite Field Constructions, Search, and
Algorithms",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "2",
pages = "57--64",
month = jun,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3614408.3614416",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 17:12:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3614408.3614416",
abstract = "In this work we present the new GAP package FFCSA ---
Finite Field Constructions, Search, and Algorithms. It
was designed to enable Design Space Exploration for
hardware implementations of cryptographic algorithms
defined over finite fields. FFCSA \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Ayotte:2023:DMS,
author = "David Ayotte and Xavier Caruso and Antoine
Leudi{\`e}re and Joseph Musleh",
title = "{Drinfeld} Modules in {SageMath}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "2",
pages = "65--71",
month = jun,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3614408.3614417",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 17:12:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/macsyma.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3614408.3614417",
abstract = "We present the first implementation of Drinfeld
modules fully integrated in the SageMath ecosystem.
First features were released with SageMath 10.0.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Abramov:2023:FCC,
author = "Sergei A. Abramov and Alexander B. Batkhin and Anna
Ryabenko and Leonid A. Sevastianov and Yvette Zonn and
Min Wu",
title = "The Fifth Conference {``Computer Algebra''} in
{Moscow}",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "2",
pages = "72--84",
month = jun,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3614408.3614418",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Aug 21 17:12:10 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3614408.3614418",
abstract = "The fifth International Conference ``Computer
algebra'' http://www.ccas.ru/ca/conference is organized
in Moscow from 26 to 28 June 2023 jointly by the
Dorodnicyn Computing Centre (Federal Research Center
``Computer Science and Control'') of Russian Academy
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{McPhedran:2023:KLC,
author = "Ross McPhedran and Tony C. Scott and Aude Maignan",
title = "The {Keiper--Li} Criterion for the {Riemann
Hypothesis} and Generalized {Lambert} Functions",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "3",
pages = "85--110",
month = sep,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3637529.3637530",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 14 15:54:00 MST 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3637529.3637530",
abstract = "Keiper [1] and Li [2] published independent
investigations of the connection between the Riemann
hypothesis and the properties of sums over powers of
zeros of the Riemann zeta function. Here we consider a
reframing of the criterion, to work with higher-order
derivatives $ \zeta_r $ of the symmetrized function $
\zeta (s) $ at $ s = 1 / 2 $, with all $ \zeta_r $
known to be positive. The reframed criterion requires
knowledge of the asymptotic properties of two terms,
one being an infinite sum over the $ \zeta_r $. This is
studied using known asymptotic expansions for the $
\zeta_r $, which give the location of the summand as a
relationship between two parameters. This relationship
needs to be inverted, which we show can be done exactly
using a generalized Lambert function. The result
enables an accurate asymptotic expression for the value
of the infinite sum",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Jimenez-Pastor:2023:CAC,
author = "Antonio Jim{\'e}nez-Pastor and Sonia L. Rueda and
Maria-Angeles Zurro",
title = "Computing Almost-Commuting Basis of Ordinary
Differential Operators",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "3",
pages = "111--118",
month = sep,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3637529.3637531",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 14 15:54:00 MST 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3637529.3637531",
abstract = "An effective computation of a basis of a nontrivial
centralizer of a differential operator is the first
step towards a Picard-Vessiot theory for spectral
problems of ordinary differential operators. The set of
almost-commuting operators enjoys a richer \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Sekigawa:2023:AAN,
author = "Hiroshi Sekigawa",
title = "An Approximation Algorithm for the Nearest
Decomposable Polynomial in the {Hamming} Distance",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "3",
pages = "119--125",
month = sep,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3637529.3637532",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 14 15:54:00 MST 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3637529.3637532",
abstract = "A univariate polynomial f is decomposable if it is the
composition f = g ( h ) of polynomials g and h whose
degrees are at least two. We consider the nearest
decomposable polynomial to a given polynomial f in the
Hamming distance. We propose a polynomial-. \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{delRio:2023:CLM,
author = "Tereso del R{\'\i}o and AmirHosein Sadeghimanesh and
Matthew England",
title = "Clustering in the {Lazard} method for Cylindrical
Algebraic Decomposition",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "3",
pages = "126--132",
month = sep,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3637529.3637533",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 14 15:54:00 MST 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3637529.3637533",
abstract = "Cylindrical Algebraic Decomposition (CAD) is an
algorithm originally proposed by Collins in [4]. Given
a set of multivariate polynomials, CAD decomposes the
multidimensional real space into connected subsets
called cells, within which those polynomials \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Chen:2023:TLM,
author = "Benjamin Chen and Yu Li and Eugene Zima",
title = "On a Two-Layer Modular Arithmetic",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "3",
pages = "133--136",
month = sep,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3637529.3637534",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 14 15:54:00 MST 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3637529.3637534",
abstract = "Two-layer organization of modular arithmetic is
considered. Lower layer uses many moduli at hardware
precision and simultaneous conversion to/from RNS as
described in [2]. Upper layer uses specially selected
large moduli allowing for fast reduction and\slash or
reconstruction. Implementation of two different
strategies for selecting moduli on the upper layer
confirms practicality of proposed approach.",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Metzlaff:2023:SAB,
author = "Tobias Metzlaff",
title = "Symmetry Adapted Bases for Trigonometric
Optimization",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "3",
pages = "137--140",
month = sep,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3637529.3637535",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 14 15:54:00 MST 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3637529.3637535",
abstract = "We present an algorithm to compute the global minimum
of a trigonometric polynomial, when it is invariant
under the exponential action of a Weyl group. This is
based on a common relaxation technique that leads to a
semi-definite program (SDP). It is \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Zidaric:2023:HUC,
author = "Nusa Zidaric",
title = "How to use a {CAS} for Hardware Design Automation",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "3",
pages = "141--147",
month = sep,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3637529.3637536",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 14 15:54:00 MST 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3637529.3637536",
abstract = "With the rise of new technologies, the demand for
efficient cryptographic hardware is rising. This work
is focusing on finite field based cryptography. To
explore the vast design space obtained from possible
finite field parameters, automated generation
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Bhayani:2023:NAP,
author = "Snehal Bhayani and Praneeth Susarla and S. S. Krishna
Chaitanya Bulusu and Olli Silven and Markku Juntti and
Janne Heikkila",
title = "A Novel Application of Polynomial Solvers in {mmWave}
Analog Radio Beamforming",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "3",
pages = "148--151",
month = sep,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3637529.3637537",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 14 15:54:00 MST 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3637529.3637537",
abstract = "Beamforming is a signal processing technique where an
array of antenna elements can be steered to transmit
and receive radio signals in a specific direction. The
usage of millimeter wave (mmWave) frequencies and
multiple input multiple output (MIMO) \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Bihan:2023:QCI,
author = "Fr{\'e}d{\'e}ric Bihan and Erika Croy and Weixun Deng
and Kaitlyn Phillipson and Robert J. Rennie and J.
Maurice Rojas",
title = "Quickly Computing Isotopy Type for Exponential Sums
over Circuits (Extended Abstract)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "3",
pages = "152--155",
month = sep,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3637529.3637538",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 14 15:54:00 MST 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3637529.3637538",
abstract = "Fewnomial Theory [Kho91] has established bounds on the
number of connected components (a.k.a. pieces ) of a
broad class of real analytic sets as a function of a
particular kind of input complexity, e.g., the number
of distinct exponent vectors among a \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Studenicova:2023:AGC,
author = "Katar{\'\i}na Studenicov{\'a}",
title = "Arithmetics in Generalised {Cantor} Base Systems",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "3",
pages = "156--159",
month = sep,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3637529.3637539",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 14 15:54:00 MST 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3637529.3637539",
abstract = "For alternate Cantor real base numeration systems we
generalise the result of Frougny and Solomyak on
arithmetics on the set of numbers with finite
expansions. We generalise the notion of finiteness
property, denoted ( F ). We also provide several
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Nagasaka:2023:CGB,
author = "Kosaku Nagasaka and Ryo Oshimatani",
title = "Conditional {Gr{\"o}bner} Basis: {Gr{\"o}bner} Basis
Detection with Parameters",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "3",
pages = "160--164",
month = sep,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3637529.3637540",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Thu Dec 14 15:54:00 MST 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3637529.3637540",
abstract = "For a given finite polynomial set, finding a monomial
order such that the given set is already a Gr{\"O}bner
basis for the ideal generated by the given set with
respect to the found monomial order is called
Gr{\"O}bner basis detection (GBD) problem and there is
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Dogan:2023:CCH,
author = "M. Levent Dogan and Alperen A. Erg{\"u}r and Elias
Tsigaridas",
title = "On the Complexity of {Chow} and {Hurwitz} Forms",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "4",
pages = "167--199",
month = dec,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3653002.3653003",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Mar 18 15:25:50 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3653002.3653003",
abstract = "We consider the bit complexity of computing Chow forms
of projective varieties defined over integers and their
generalization to multiprojective spaces. We develop
\ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Berardini:2023:PBN,
author = "Elena Berardini and Alain Couvreur and Gr{\'e}goire
Lecerf",
title = "A Proof of the {Brill--Noether} Method from Scratch",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "57",
number = "4",
pages = "200--229",
month = dec,
year = "2023",
CODEN = "????",
DOI = "https://doi.org/10.1145/3653002.3653004",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Mon Mar 18 15:25:50 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "https://dl.acm.org/doi/10.1145/3653002.3653004",
abstract = "In 1874 Brill and Noether designed a seminal geometric
method for computing bases of Riemann--Roch spaces.
From then, their method has led to several \ldots{}",
acknowledgement = ack-nhfb,
ajournal = "ACM Commun. Computer Algebr.",
fjournal = "ACM Communications in Computer Algebra",
journal-URL = "https://dl.acm.org/loi/sigsam-cca",
}
@Article{Shearer:1985:ASS,
author = "J. M. Shearer and M. A. Wolfe",
title = "{ALGLIB}, a simple symbol-manipulation package",
journal = j-CACM,
volume = "28",
number = "8",
pages = "820--825",
month = aug,
year = "1985",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Tue Feb 06 07:23:06 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
keywords = "algorithms; human factors; languages; performance;
reliability",
review = "ACM CR 8604-0366",
subject = "D.2.2 Software, SOFTWARE ENGINEERING, Tools and
Techniques, Software libraries \\ E.2 Data, DATA
STORAGE REPRESENTATIONS, Composite structures \\ I.1
Computing Methodologies, ALGEBRAIC MANIPULATION,
Expressions and Their Representation",
}
@Proceedings{Jenks:1974:PER,
editor = "R. D. Jenks",
booktitle = "{Proceedings of Eurosam '74, Royal Institute of
Technology, Stockholm, Sweden, August 1--2, 1974}",
title = "{Proceedings of Eurosam '74, Royal Institute of
Technology, Stockholm, Sweden, August 1--2, 1974}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "110",
year = "1974",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib;
Misc/TUBScsd.bib; Misc/TUBScsd/1974.bib",
note = "Published in ACM SIGSAM Bulletin, volume 8, number
3.",
annote = "Session I: Future trends --- Symbolic mathematical
systems now and in the future --- Toward a formal
implementation of computer Session II: Systems I ---
Tuning an algebraic manipulation system through
measurements --- Analitik --- principal features of the
language and its implementation Session III: Algorithms
I --- On computing with factored rational expressions
--- Factored rational expressions in Altran ---
Computational aspects of Hensel-type univariate
polynomial greatest common divisor algorithms Session
IV: Systems II --- Presentation of the Schoonschip
system Session V: Algorithms II --- Experience with
truncated power series --- Sparse polynomial arithmetic
--- Different polynomial representations and their
interaction in the portable algebra system Port-ALG
Session VI: Applications in physics --- Computer
recognition of divergences in Feynman diagrams --- A
non-numerical computation involving sums of many
products of finite rotation matrices for spin 3/2 --- A
perturbation calculation in general relativity Session
VIII: Algorithms III --- Quantifier elimination for
real closed fields by cylindrical algebraic
decomposition --- preliminary report --- Formal
representations for algebraic numbers Session IX:
Applications in mathematics --- The automatic
construction of pure recurrence relations --- Symbolic
integration of a class of algebraic functions --- The
use of symbolic computation in solving free boundary
problems by the Ritz--Galerkin methods Session X:
Systems IV --- Macsyma --- the fifth year",
descriptor = "Altran, Analytik, Angewandte Informatik, Arithmetik,
Macsyma, Port-Alg, Schoonschip, Symbolmanipulation,
System, Physik, Algebra, Algorithmus, Mathematik",
}
@Proceedings{Jenks:1976:SPA,
editor = "Richard D. Jenks",
booktitle = "{Symsac '76: proceedings of the 1976 ACM Symposium on
Symbolic and Algebraic Computation, August 10--12,
1976, Yorktown Heights, New York}",
title = "{Symsac '76: proceedings of the 1976 ACM Symposium on
Symbolic and Algebraic Computation, August 10--12,
1976, Yorktown Heights, New York}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "384",
year = "1976",
LCCN = "QA155.7.E4 A15 1976",
bibdate = "Tue Jul 26 09:04:45 1994",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
price = "US\$20.00",
acknowledgement = ack-nhfb,
xxISBN = "none",
}
@Proceedings{Ng:1979:SAC,
editor = "Edward W. Ng",
booktitle = "{Symbolic and algebraic computation: EUROSAM '79, an
International Symposium on Symbolic and Algebraic
Manipulation, Marseille, France, June 1979}",
title = "{Symbolic and algebraic computation: EUROSAM '79, an
International Symposium on Symbolic and Algebraic
Manipulation, Marseille, France, June 1979}",
volume = "72",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 557",
year = "1979",
CODEN = "LNCSD9",
ISBN = "0-387-09519-5",
ISBN-13 = "978-0-387-09519-6",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA155.7.E4 E88 1979",
bibdate = "Fri Apr 12 07:14:47 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
series = ser-LNCS,
acknowledgement = ack-nhfb,
keywords = "algebra --- data processing --- congresses",
}
@Proceedings{Wang:1981:SPA,
editor = "Paul S. Wang",
booktitle = "{SYMSAC '81: proceedings of the 1981 ACM Symposium on
Symbolic and Algebraic Computation, Snowbird, Utah,
August 5--7, 1981}",
title = "{SYMSAC '81: proceedings of the 1981 ACM Symposium on
Symbolic and Algebraic Computation, Snowbird, Utah,
August 5--7, 1981}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xi + 249",
year = "1981",
ISBN = "0-89791-047-8",
ISBN-13 = "978-0-89791-047-7",
LCCN = "QA155.7.E4 A28 1981",
bibdate = "Fri Feb 09 12:29:36 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/issac.bib;
https://www.math.utah.edu/pub/tex/bib/macsyma.bib;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ACM order no. 505810",
price = "US\$23.00",
acknowledgement = ack-nhfb,
tableofcontents = "The basis of a computer system for modern algebra /
John J. Cannon \\
A language for computational algebra / Richard D.
Jenks, Barry M. Trager \\
Characterization of VAX Macsyma / John K. Foderaro,
Richard J. Fateman \\
SMP - A Symbolic Manipulation Program / Chris A. Cole,
Stephen Wolfram \\
An extension of Liouville s theorem on integration in
finite terms / M. F. Singer, B. D. Saunders, B. F.
Caviness \\
Formal solutions of differential equations in the
neighborhood of singular points (Regular and Irregular)
/ J. Della Dora, E. Tournier \\
Elementary first integrals of differential equations /
M. J. Prelle, M. F. Singer \\
A technique for solving ordinary differential equations
using Riemann s P-functions / Shunro Watanabe \\
Using Lie transformation groups to find closed form
solutions to first order ordinary differential
equations / Bruce Char \\
The computational complexity of continued fractions /
V. Strassen \\
Newton s iteration and the sparse Hensel algorithm
(Extended Abstract) / Richard Zippel \\
Automatic generation of finite difference equations and
Fourier stability analyses / Michael C. Wirth \\
An algorithmic classification of geometries in general
relativity / Jan E. Aman, Anders Karlhede \\
Formulation of design rules for NMR imaging coil by
using symbolic manipulation / John F. Schenck, M. A.
Hussain \\
Computation for conductance distributions of
percolation lattice cells / Rabbe Fogelholm \\
Breuer s grow factor algorithm in computer algebra / J.
A. van Hulzen \\
An implementation of Kovacic s algorithm for solving
second order linear homogeneous differential equations
/ B. David Saunders \\
Implementing a polynomial factorization and GCD package
/ P. M. A. Moore, A. C. Norman \\
Note on probabilistic algorithms in integer and
polynomial arithmetic / Michael Kaminski \\
A case study in interlanguage communication: Fast LISP
polynomial operations written in C / Richard J. Fateman
\\
On the application of Array Processors to symbol
manipulation / R. Beardsworth \\
The optimization of user programs for an Algebraic
Manipulation System / P. D. Pearce, R. J. Hickst \\
Views on transportability of Lisp and Lisp-based
systems / Richard J. Fateman \\
Algebraic constructions for algorithms (Extended
Abstract) / S. Winograd \\
A cancellation free algorithm, with factoring
capabilities, for the efficient solution of large
sparse sets of equations / J. Smit \\
Efficient Gaussian elimination method for symbolic
determinants and linear systems (Extended Abstract) /
Tateaki Sasaki, Hirokazu Murao \\
Parallelism in algebraic computation and parallel
algorithms for symbolic linear systems / Tateaki
Sasaki, Yasumasa Kanada \\
Algebraic computation for the masses / Joel Moses \\
Construction of nilpotent Lie algebras over arbitrary
fields / Robert E. Beck, Bernard Kolman \\
Algorithms for central extensions of Lie algebras
Robert E. Beck, Bernard Kolman \\
Computing an invariant subring of $k[X,Y]$ / Rosalind
Neuman \\
Double cosets and searching small groups / Gregory
Butler \\
A generalized class of polynomials that are hard to
factor / Erich Kaltofen, David R. Musser, B. David
Saunders \\
Some inequalities about univariate polynomials /
Maurice Mignotte \\
Factorization over finitely generated fields / James H.
Davenport, Barry M. Trager \\
On solving systems of algebraic equations via ideal
bases and elimination theory / Michael E. Pohst, David
Y. Y. Yun \\
A p-adic algorithm for univariate partial fractions /
Paul S. Wang \\
Use of VLSI in algebraic computation: Some suggestions
H. T. Kung \\
An algebraic front-end for the production and use of
numeric programs / Douglas H. Lanam \\
Computer algebra and numerical integration / Richard J.
Fateman \\
Tracing occurrences of patterns in symbolic
computations / F. Gardin, J. A. Campbell \\
The automatic derivation of periodic solutions to a
class of weakly nonlinear differential equations / John
Fitch \\
User-based integration software / John Fitch.",
}
@Proceedings{Char:1986:PSS,
editor = "Bruce W. Char",
booktitle = "{Proceedings of the 1986 Symposium on Symbolic and
Algebraic Computation: Symsac '86, July 21--23, 1986,
Waterloo, Ontario}",
title = "{Proceedings of the 1986 Symposium on Symbolic and
Algebraic Computation: Symsac '86, July 21--23, 1986,
Waterloo, Ontario}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "254",
year = "1986",
ISBN = "0-89791-199-7 (paperback)",
ISBN-13 = "978-0-89791-199-3 (paperback)",
LCCN = "QA155.7.E4 A281 1986",
bibdate = "Thu Mar 12 07:35:00 MST 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ACM order no. 505860.",
acknowledgement = ack-nhfb,
keywords = "Algebra --- Data processing --- Congresses;
Programming languages (Electronic computers) ---
Congresses",
}
@Proceedings{Gianni:1988:SAC,
editor = "P. Gianni",
booktitle = "Symbolic and algebraic computation: International
Symposium ISSAC '88, Rome, Italy, July 4--8, 1988:
Proceedings",
title = "Symbolic and algebraic computation: International
Symposium {ISSAC} '88, Rome, Italy, July 4--8, 1988:
Proceedings",
volume = "358",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 543",
year = "1988",
ISBN = "0-387-51084-2",
ISBN-13 = "978-0-387-51084-2",
LCCN = "QA76.95 .I571 1988",
bibdate = "Thu Dec 14 17:17:57 1995",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
series = "Lecture notes in computer science",
acknowledgement = ack-nhfb,
}
@Proceedings{Gianni:1989:SAC,
editor = "P. (Patrizia) Gianni",
booktitle = "{Symbolic and algebraic computation: International
Symposium ISSAC '88, Rome, Italy, July 4--8, 1988:
proceedings}",
title = "{Symbolic and algebraic computation: International
Symposium ISSAC '88, Rome, Italy, July 4--8, 1988:
proceedings}",
volume = "358",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 543",
year = "1989",
ISBN = "3-540-51084-2",
ISBN-13 = "978-3-540-51084-0",
LCCN = "QA76.95 .I571 1988",
bibdate = "Thu Sep 26 06:21:35 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Conference held jointly with AAECC-6.",
series = ser-LNCS,
abstract = "The following topics were dealt with: differential
algebra; applications; Gr{\"o}bner bases; differential
equations; algorithmic number theory; algebraic
geometry; computational geometry; computational logic;
systems; and arithmetic.",
acknowledgement = ack-nhfb,
classification = "C1110 (Algebra); C4100 (Numerical analysis); C7310
(Mathematics)",
confdate = "4--8 July 1988",
conflocation = "Rome, Italy",
keywords = "Differential algebra; Applications; Gr{\"o}bner bases;
Differential equations; Algorithmic number theory;
Algebraic geometry; Computational geometry;
Computational logic; Systems; Arithmetic",
pubcountry = "West Germany",
thesaurus = "Algebra; Computational geometry; Differential
equations; Formal logic; Mathematics computing; Theorem
proving",
}
@Proceedings{Gonnet:1989:PAI,
editor = "Gaston H. Gonnet",
booktitle = "{Proceedings of the ACM-SIGSAM 1989 International
Symposium on Symbolic and Algebraic Computation: ISSAC
'89 / July 17--19, 1989, Portland, Oregon}",
title = "{Proceedings of the ACM-SIGSAM 1989 International
Symposium on Symbolic and Algebraic Computation: ISSAC
'89 / July 17--19, 1989, Portland, Oregon}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "399",
year = "1989",
ISBN = "0-89791-325-6",
ISBN-13 = "978-0-89791-325-6",
LCCN = "QA76.95.I59 1989",
bibdate = "Thu Sep 26 06:21:35 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ACM order number: 505890. English and French.",
price = "US\$29.00",
abstract = "The following topics were dealt with: differential
equations; linear difference equations; functional
equivalence; series solutions; factorization; Las Vegas
primality test; matrix algebra; rational mappings;
Knuth--Bendix procedure and Buchberger algorithm;
symbolic algebra; lockup tables; derivations
polynomials; Pad{\'e}--Hermite Forms; $p$-adic
approximations; nonlinear equations; defect;
Sturm--Habicht sequence; MINION; REDUCE; code
optimization; IRENA; MACSYMA; GENCRAY; AIPI; Fourier
series; functions; integration; education; stability;
normal forms; curves; geometry; root isolation;
triangle inequalities; parallel algorithms; rewriting
systems; and theorem proving.",
acknowledgement = ack-nhfb,
classification = "C1110 (Algebra); C1120 (Analysis); C4100 (Numerical
analysis); C4200 (Computer theory); C7310
(Mathematics)",
confdate = "17--19 July 1989",
conflocation = "Portland, OR, USA",
confsponsor = "ACM",
keywords = "AIPI; algebra --- data processing --- congresses;
Buchberger algorithm; Code optimization; computational
complexity --- congresses; Curves; Defect; Derivations;
Differential equations; Education; Factorization;
Fourier series; Functional equivalence; Functions;
GENCRAY; Geometry; Integration; IRENA; Knuth--Bendix
procedure; Las Vegas primality test; Linear difference
equations; Lockup tables; MACSYMA; Matrix algebra;
MINION; Nonlinear equations; Normal forms; P-adic
approximations; Pad{\'e}--Hermite Forms; Parallel
algorithms; Polynomials; Rational mappings; REDUCE;
Rewriting systems; Root isolation; Series solutions;
Stability; Sturm--Habicht sequence; Symbolic algebra;
Theorem proving, mathematics --- data processing ---
congresses; Triangle inequalities",
pubcountry = "USA",
thesaurus = "Algebra; Computation theory; Functions; Mathematics
computing; Numerical analysis; Series [mathematics];
Symbol manipulation",
}
@Proceedings{Mora:1989:AAA,
editor = "T. Mora",
booktitle = "{Applied Algebra, Algebraic Algorithms and
Error-Correcting Codes. 6th International Conference,
AAECC-6, Rome, Italy, July 4--8, 1988. Proceedings}",
title = "{Applied Algebra, Algebraic Algorithms and
Error-Correcting Codes. 6th International Conference,
AAECC-6, Rome, Italy, July 4--8, 1988. Proceedings}",
volume = "357",
publisher = pub-SV,
address = pub-SV:adr,
pages = "ix + 480",
year = "1989",
ISBN = "3-540-51083-4",
ISBN-13 = "978-3-540-51083-3",
LCCN = "QA268 .A35 1988",
bibdate = "Tue Sep 17 06:46:18 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "Conference held jointly with ISSAC '88.",
series = "Lecture Notes in Computer Science",
acknowledgement = ack-nhfb,
confdate = "4--8 July 1988",
conflocation = "Rome, Italy",
pubcountry = "West Germany",
}
@Proceedings{SIGSAM:1989:PAI,
key = "ISSAC'89",
booktitle = "Proceedings of the ACM-SIGSAM 1989 International
Symposium on Symbolic and Algebraic Computation: ISSAC
'89, July 17--19, 1989, Portland, Oregon",
title = "Proceedings of the {ACM}-{SIGSAM} 1989 International
Symposium on Symbolic and Algebraic Computation:
{ISSAC} '89, July 17--19, 1989, Portland, Oregon",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "399",
year = "1989",
ISBN = "0-89791-325-6",
ISBN-13 = "978-0-89791-325-6",
LCCN = "QA76.95.I59 1989",
bibdate = "Sat Dec 16 16:54:41 1995",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "English and French. Includes bibliographical
references and index.",
price = "US\$22.00",
acknowledgement = ack-nhfb,
keywords = "algebra -- data processing -- congresses;
computational complexity -- congresses; mathematics --
data processing -- congresses",
}
@Proceedings{Watanabe:1990:IPI,
editor = "Shunro Watanabe and Morio Nagata",
booktitle = "{ISSAC '90: proceedings of the International Symposium
on Symbolic and Algebraic Computation: August 20--24,
1990, Tokyo, Japan}",
title = "{ISSAC '90: proceedings of the International Symposium
on Symbolic and Algebraic Computation: August 20--24,
1990, Tokyo, Japan}",
publisher = pub-ACM # " and " # pub-AW,
address = pub-ACM:adr # " and " # pub-AW:adr,
pages = "ix + 307",
year = "1990",
ISBN = "0-89791-401-5 (ACM), 0-201-54892-5 (Addison-Wesley)",
ISBN-13 = "978-0-89791-401-7 (ACM), 978-0-201-54892-1
(Addison-Wesley)",
LCCN = "QA76.95 .I57 1990",
bibdate = "Thu Sep 26 06:00:06 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The following topics were dealt with: foundations of
symbolic computation; computational logics; systems;
algorithms on polynomials; integration and differential
equations; and algorithms on geometry.",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
confdate = "20--24 Aug. 1990",
conflocation = "Tokyo, Japan",
confsponsor = "Inf. Processing Soc. Japan; Japan Soc. Software Sci.
Technol.; ACM",
keywords = "algebra --- data processing --- congresses;
Algorithms; Computational geometry; Computational
logics; Differential equations; Geometry; Integration;
mathematics --- data processing --- congresses;
Polynomials; Symbolic computation; Systems",
pubcountry = "USA",
thesaurus = "Algorithm theory; Computational geometry; Formal
logic; Symbol manipulation",
}
@Proceedings{Watt:1991:IPI,
editor = "Stephen M. Watt",
booktitle = "{ISSAC '91: proceedings of the 1991 International
Symposium on Symbolic and Algebraic Computation, July
15--17, 1991, Bonn, Germany}",
title = "{ISSAC '91: proceedings of the 1991 International
Symposium on Symbolic and Algebraic Computation, July
15--17, 1991, Bonn, Germany}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xiii + 468",
year = "1991",
ISBN = "0-89791-437-6",
ISBN-13 = "978-0-89791-437-6",
LCCN = "QA 76.95 I59 1991",
bibdate = "Thu Sep 26 06:00:06 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
abstract = "The following topics were dealt with: algorithms for
symbolic mathematical computation; languages, systems
and packages; computational geometry, group theory and
number theory; automatic theorem proving and
programming; interface of symbolics, numerics and
graphics; applications in mathematics, science and
engineering; and symbolic and algebraic computation in
education.",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4130
(Interpolation and function approximation); C4210
(Formal logic); C4240 (Programming and algorithm
theory); C7310 (Mathematics)",
confdate = "15--17 July 1991",
conflocation = "Bonn, Germany",
confsponsor = "ACM",
keywords = "algebra --- data processing --- congresses; Algebraic
computation; Algorithms; Automatic theorem proving;
Computational geometry; Education; Engineering;
Graphics; Group theory; Languages; Mathematics;
mathematics --- data processing --- congresses; Number
theory; Programming; Science; Symbolic mathematical
computation; Symbolics",
pubcountry = "USA",
thesaurus = "Computational complexity; Formal languages;
Interpolation; Number theory; Polynomials; Symbol
manipulation",
}
@Proceedings{Wang:1992:PII,
editor = "Paul S. Wang",
booktitle = "{Proceedings of ISSAC '92. International Symposium on
Symbolic and Algebraic Computation}",
title = "{Proceedings of ISSAC '92. International Symposium on
Symbolic and Algebraic Computation}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "ix + 406",
year = "1992",
ISBN = "0-89791-489-9 (soft cover), 0-89791-490-2 (hard
cover)",
ISBN-13 = "978-0-89791-489-5 (soft cover), 978-0-89791-490-1
(hard cover)",
LCCN = "QA76.95.I59 1992",
bibdate = "Thu Sep 26 05:51:45 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ACM order number: 505920.",
abstract = "The following topics were dealt with: symbolic
computation; differential equations; differs-integral
software; algebraic algorithms; algebraic software;
real algebraics and root isolation; groups and number
theory; systems and interfaces.",
acknowledgement = ack-nhfb,
classification = "C6130 (Data handling techniques); C7310
(Mathematics)",
confdate = "27--29 July 1992",
conflocation = "Berkeley, CA, USA",
confsponsor = "ACM",
keywords = "Algebraic algorithms; Algebraic software; Differential
equations; Differs-integral software; Groups theory;
Interfaces; Number theory; Real algebraics; Root
isolation; Symbolic computation",
pubcountry = "USA",
thesaurus = "Differential equations; Mathematics computing; Symbol
manipulation",
}
@Proceedings{Bronstein:1993:IPI,
editor = "Manuel Bronstein",
booktitle = "{ISSAC'93: proceedings of the 1993 International
Symposium on Symbolic and Algebraic Computation, July
6--8, 1993, Kiev, Ukraine}",
title = "{ISSAC'93: proceedings of the 1993 International
Symposium on Symbolic and Algebraic Computation, July
6--8, 1993, Kiev, Ukraine}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "viii + 321",
year = "1993",
ISBN = "0-89791-604-2",
ISBN-13 = "978-0-89791-604-2",
LCCN = "QA 76.95 I59 1993",
bibdate = "Thu Sep 26 05:45:15 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ACM order number: 505930.",
abstract = "The following topics were dealt with: algebraic
solutions of equations; computer algebra systems;
algorithm theory and complexity; automated theorem
proving; polynomials; and matrix algebra.",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory); C7310 (Mathematics computing)",
confdate = "6--8 July 1993",
conflocation = "Kiev, Ukraine",
confsponsor = "ACM",
keywords = "algebra --- data processing --- congresses; Algorithm
theory; Automated theorem proving; Complexity; Computer
algebra; mathematics --- data processing ---
congresses; Matrix algebra; Polynomials",
pubcountry = "USA",
source = "ISSAC '93",
sponsor = "Association for Computing Machinery.",
thesaurus = "Computational complexity; Mathematics computing;
Matrix algebra; Polynomials; Symbol manipulation;
Theorem proving",
}
@Proceedings{Halstead:1993:PSC,
editor = "Robert H. Halstead and Takayasu Ito",
booktitle = "{Parallel symbolic computing: languages, systems, and
applications: US\slash Japan workshop, Cambridge, MA,
USA, October 14--17, 1992: proceedings}",
title = "{Parallel symbolic computing: languages, systems, and
applications: US\slash Japan workshop, Cambridge, MA,
USA, October 14--17, 1992: proceedings}",
number = "748",
publisher = pub-SV,
address = pub-SV:adr,
pages = "x + 417",
year = "1993",
ISBN = "0-387-57396-8, 3-540-57396-8",
ISBN-13 = "978-0-387-57396-0, 978-3-540-57396-8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.58.P3785 1993",
bibdate = "Thu Mar 12 11:28:58 MST 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
series = ser-LNCS,
acknowledgement = ack-nhfb,
}
@Proceedings{ACM:1994:IPI,
editor = "{ACM}",
booktitle = "{ISSAC '94: Proceedings of the 1994 International
Symposium on Symbolic and Algebraic Computation: July
20--22, 1994, Oxford, England, United Kingdom}",
title = "{ISSAC '94: Proceedings of the 1994 International
Symposium on Symbolic and Algebraic Computation: July
20--22, 1994, Oxford, England, United Kingdom}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "ix + 359",
year = "1994",
ISBN = "0-89791-638-7",
ISBN-13 = "978-0-89791-638-7",
LCCN = "QA76.95.I59 1994",
bibdate = "Thu Sep 26 05:45:15 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
confdate = "20--22 July 1994",
conflocation = "Oxford, UK",
confsponsor = "ACM",
pubcountry = "USA",
}
@Proceedings{Hong:1994:FIS,
editor = "Hoon Hong",
booktitle = "{First International Symposium on Parallel Symbolic
Computation, PASCO '94, Hagenberg\slash Linz, Austria,
September 26--28, 1994}",
title = "{First International Symposium on Parallel Symbolic
Computation, PASCO '94, Hagenberg\slash Linz, Austria,
September 26--28, 1994}",
volume = "5",
publisher = pub-WORLD-SCI,
address = pub-WORLD-SCI:adr,
pages = "xiii + 431",
year = "1994",
ISBN = "981-02-2040-5",
ISBN-13 = "978-981-02-2040-2",
LCCN = "QA76.642.I58 1994",
bibdate = "Thu Mar 12 07:55:38 MST 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
series = "Lecture notes series in computing",
acknowledgement = ack-nhfb,
alttitle = "Parallel symbolic computation",
keywords = "Parallel programming (Computer science) ---
Congresses.",
}
@Proceedings{SIGSAM:1994:IPI,
key = "ISSAC'94",
booktitle = "ISSAC '94: Proceedings of the 1994 International
Symposium on Symbolic and Algebraic Computation: July
20--22, 1994, Oxford, England, United Kingdom",
title = "{ISSAC} '94: Proceedings of the 1994 International
Symposium on Symbolic and Algebraic Computation: July
20--22, 1994, Oxford, England, United Kingdom",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "ix + 359",
year = "1994",
ISBN = "0-89791-638-7",
ISBN-13 = "978-0-89791-638-7",
LCCN = "QA76.95 .I59 1994",
bibdate = "Thu Dec 14 17:04:44 1995",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{Levelt:1995:IPI,
editor = "A. H. M. Levelt",
booktitle = "{ISSAC '95: Proceedings of the 1995 International
Symposium on Symbolic and Algebraic Computation: July
10--12, 1995, Montr{\'e}al, Canada}",
title = "{ISSAC '95: Proceedings of the 1995 International
Symposium on Symbolic and Algebraic Computation: July
10--12, 1995, Montr{\'e}al, Canada}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xviii + 314",
year = "1995",
ISBN = "0-89791-699-9",
ISBN-13 = "978-0-89791-699-8",
LCCN = "QA 76.95 I59 1995",
bibdate = "Thu Sep 26 05:34:21 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ACM order number: 505950",
series = "ISSAC -PROCEEDINGS- 1995",
abstract = "The following topics were dealt with: differential
equations; visualisation; algebraic numbers;
algorithms; systems; polynomial and differential
algebra; seminumerical methods; greatest common
divisors; and.",
acknowledgement = ack-nhfb,
classification = "C4100 (Numerical analysis); C4170 (Differential
equations); C7310 (Mathematics computing)",
confdate = "10--12 July 1995",
conflocation = "Montr{\'e}al, Que., Canada",
confsponsor = "ACM",
keywords = "algebra --- data processing --- congresses; Algebraic
numbers; Algorithms; Differential algebra; Differential
equations; Greatest common divisors; mathematics ---
data processing --- congresses; Polynomial;
Seminumerical methods; Systems; Visualisation",
pubcountry = "USA",
source = "ISSAC '95",
thesaurus = "Data visualisation; Differential equations; Group
theory; Numerical analysis; Symbol manipulation",
}
@Proceedings{Calmet:1996:DIS,
editor = "Jacques Calmet and Carla Limongelli",
booktitle = "{Design and implementation of symbolic computation
systems: International Symposium, DISCO '96, Karlsruhe,
Germany, September 18--20, 1996: proceedings}",
title = "{Design and implementation of symbolic computation
systems: International Symposium, DISCO '96, Karlsruhe,
Germany, September 18--20, 1996: proceedings}",
volume = "1128",
publisher = pub-SV,
address = pub-SV:adr,
pages = "ix + 356",
year = "1996",
ISBN = "3-540-61697-7 (softcover)",
ISBN-13 = "978-3-540-61697-9 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.S88I576 1996",
bibdate = "Thu Mar 12 12:25:22 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
series = ser-LNCS,
acknowledgement = ack-nhfb,
keywords = "Automatic theorem proving --- Congresses.; Mathematics
--- Data processing --- Congresses.; System design ---
Congresses.",
}
@Proceedings{LakshmanYN:1996:IPI,
editor = "{Lakshman Y.N.}",
booktitle = "{ISSAC '96: Proceedings of the 1996 International
Symposium on Symbolic and Algebraic Computation, July
24--26, 1996, Zurich, Switzerland}",
title = "{ISSAC '96: Proceedings of the 1996 International
Symposium on Symbolic and Algebraic Computation, July
24--26, 1996, Zurich, Switzerland}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xvii + 313",
year = "1996",
ISBN = "0-89791-796-0",
ISBN-13 = "978-0-89791-796-4",
LCCN = "QA 76.95 I59 1996",
bibdate = "Thu Mar 12 08:00:14 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
sponsor = "ACM; Special Interest Group in Symbolic and Algebraic
Manipulation (SIGSAM). ACM; Special Interest Group on
Numerical Mathematics (SIGNUM).",
}
@Proceedings{Kuchlin:1997:PPS,
editor = "Wolfgang W. K{\"u}chlin",
booktitle = "{ISSAC 97: July 21--23, 1997, Maui, Hawaii, USA:
proceedings of the 1997 International Symposium on
Symbolic and Algebraic Computation}",
title = "{ISSAC 97: July 21--23, 1997, Maui, Hawaii, USA:
proceedings of the 1997 International Symposium on
Symbolic and Algebraic Computation}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xxii + 414",
year = "1997",
ISBN = "0-89791-875-4",
ISBN-13 = "978-0-89791-875-6",
LCCN = "QA76.95",
bibdate = "Sat Mar 23 12:41:32 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "http://www.acm.org/pubs/contents/proceedings/issac/258726/",
acknowledgement = ack-nhfb,
}
@Proceedings{Buchberger:1998:YGB,
editor = "Bruno Buchberger and Franz Winkler",
booktitle = "33 years of Gr{\"o}bner bases: Gr{\"o}bner bases and
applications: Conference --- February 1998, Linz,
Austria",
title = "33 years of Gr{\"o}bner bases: Gr{\"o}bner bases and
applications: Conference --- February 1998, Linz,
Austria",
number = "251",
publisher = pub-CAMBRIDGE,
address = pub-CAMBRIDGE:adr,
pages = "viii + 552",
year = "1998",
ISBN = "0-521-63298-6",
ISBN-13 = "978-0-521-63298-0",
LCCN = "QA251.3.G76 1998",
bibdate = "Thu Mar 12 11:28:58 MST 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
series = "London Mathematical Society Lecture Note Series",
acknowledgement = ack-nhfb,
sponsor = "Research Institute for Symbolic Computation.",
}
@Proceedings{Gloor:1998:IPI,
editor = "Oliver Gloor",
booktitle = "{ISSAC 98: Proceedings of the 1998 International
Symposium on Symbolic and Algebraic Computation, August
13--15, 1998, University of Rostock, Germany}",
title = "{ISSAC 98: Proceedings of the 1998 International
Symposium on Symbolic and Algebraic Computation, August
13--15, 1998, University of Rostock, Germany}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xxii + 327",
year = "1998",
ISBN = "1-58113-002-3",
ISBN-13 = "978-1-58113-002-7",
LCCN = "QA155.7.E4 E88 1998",
bibdate = "Wed Sep 16 17:13:58 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{Dooley:1999:IJS,
editor = "Sam Dooley",
booktitle = "{ISSAC 99: July 29--31, 1999, Simon Fraser University,
Vancouver, BC, Canada: proceedings of the 1999
International Symposium on Symbolic and Algebraic
Computation}",
title = "{ISSAC 99: July 29--31, 1999, Simon Fraser University,
Vancouver, BC, Canada: proceedings of the 1999
International Symposium on Symbolic and Algebraic
Computation}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xxii + 311",
year = "1999",
ISBN = "1-58113-073-2",
ISBN-13 = "978-1-58113-073-7",
LCCN = "QA76.95 .I57 1999",
bibdate = "Sat Mar 11 16:51:59 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{Traverso:2000:IAU,
editor = "Carlo Traverso",
booktitle = "{ISSAC 2000: 7--9 August 2000, University of St.
Andrews, Scotland: proceedings of the 2000
International Symposium on Symbolic and Algebraic
Computation}",
title = "{ISSAC 2000: 7--9 August 2000, University of St.
Andrews, Scotland: proceedings of the 2000
International Symposium on Symbolic and Algebraic
Computation}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "viii + 309",
year = "2000",
ISBN = "1-58113-218-2",
ISBN-13 = "978-1-58113-218-2",
LCCN = "QA76.95.I59 2000",
bibdate = "Tue Apr 17 09:12:53 2001",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/issac/;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ACM order number 505000.",
URL = "http://www.acm.org/pubs/contents/proceedings/issac/345542/",
acknowledgement = ack-nhfb,
}
@Proceedings{Mourrain:2001:IJU,
editor = "Bernard Mourrain",
booktitle = "{ISSAC 2001: July 22--25, 2001, University of Western
Ontario, London, Ontario, Canada: proceedings of the
2001 International Symposium on Symbolic and Algebraic
Computation}",
title = "{ISSAC 2001: July 22--25, 2001, University of Western
Ontario, London, Ontario, Canada: proceedings of the
2001 International Symposium on Symbolic and Algebraic
Computation}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xii + 352",
year = "2001",
ISBN = "1-58113-417-7",
ISBN-13 = "978-1-58113-417-9",
LCCN = "QA76.95.I59 2001",
bibdate = "Wed May 15 14:30:19 2002",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/issac/;
https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ACM order number 505010.",
acknowledgement = ack-nhfb,
}
@Proceedings{Mora:2002:IPI,
editor = "Teo Mora",
booktitle = "{ISSAC 2002: Proceedings of the 2002 International
Symposium on Symbolic and Algebraic Computation, July
07--10, 2002, Universit{\'e} de Lille, Lille, France}",
title = "{ISSAC 2002: Proceedings of the 2002 International
Symposium on Symbolic and Algebraic Computation, July
07--10, 2002, Universit{\'e} de Lille, Lille, France}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xx + 276",
year = "2002",
ISBN = "1-58113-484-3",
ISBN-13 = "978-1-58113-484-1",
LCCN = "QA76.95",
bibdate = "Fri Nov 22 16:20:31 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
URL = "http://www.lifl.fr/ISSAC2002/",
acknowledgement = ack-nhfb,
}
@Proceedings{Senda:2003:IPI,
editor = "J. Rafael Senda",
booktitle = "{ISSAC 2003: Proceedings of the 2003 International
Symposium on Symbolic and Algebraic Computation, August
3--6, 2003, Drexel University, Philadelphia, PA, USA}",
title = "{ISSAC 2003: Proceedings of the 2003 International
Symposium on Symbolic and Algebraic Computation, August
3--6, 2003, Drexel University, Philadelphia, PA, USA}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "x + 273",
year = "2003",
ISBN = "1-58113-641-2",
ISBN-13 = "978-1-58113-641-8",
LCCN = "QA76.95",
bibdate = "Sat Dec 13 18:18:22 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ACM order number 505030.",
acknowledgement = ack-nhfb,
}
@Proceedings{Gutierrez:2004:IJU,
editor = "Jaime Gutierrez",
booktitle = "{ISAAC 2004: July 4--7, 2004, University of Cantabria,
Santander, Spain: proceedings of the 2004 International
Symposium on Symbolic and Algebraic Computation}",
title = "{ISAAC 2004: July 4--7, 2004, University of Cantabria,
Santander, Spain: proceedings of the 2004 International
Symposium on Symbolic and Algebraic Computation}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xii + 328",
year = "2004",
ISBN = "1-58113-827-X",
ISBN-13 = "978-1-58113-827-6",
LCCN = "",
bibdate = "Fri Oct 21 06:33:01 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
meetingname = "International Symposium on Symbolic and Algebraic
Computation (2004: Santander, Spain)",
}
@Proceedings{Kauers:2005:IJB,
editor = "Manuel Kauers",
booktitle = "{ISSAC '05: July 24--27, 2005, Beijing, China:
Proceedings of the 2005 International Symposium on
Symbolic and Algebraic Computation}",
title = "{ISSAC '05: July 24--27, 2005, Beijing, China:
Proceedings of the 2005 International Symposium on
Symbolic and Algebraic Computation}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xiv + 372",
year = "2005",
ISBN = "1-59593-095-7",
ISBN-13 = "978-1-59593-095-8",
LCCN = "????",
bibdate = "Fri Oct 21 07:01:24 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ACM Order Number 505050.",
acknowledgement = ack-nhfb,
}
@Proceedings{Trager:2006:PIS,
editor = "Barry Trager",
booktitle = "{Proceedings of the 2006 International Symposium on
Symbolic and Algebraic Computation, Genoa, Italy July
09--12, 2006}",
title = "{Proceedings of the 2006 International Symposium on
Symbolic and Algebraic Computation, Genoa, Italy July
09--12, 2006}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "????",
year = "2006",
ISBN = "1-59593-276-3",
ISBN-13 = "978-1-59593-276-1",
LCCN = "????",
bibdate = "Wed Aug 23 09:44:27 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib",
note = "ACM order number 505060.",
acknowledgement = ack-nhfb,
}
@Book{Pech:2007:STG,
author = "Pavel Pech",
title = "Selected topics in geometry with classical vs.
computer proving",
publisher = pub-WORLD-SCI,
address = pub-WORLD-SCI:adr,
pages = "xi + 239",
year = "2007",
ISBN = "981-270-942-8 (hardcover)",
ISBN-13 = "978-981-270-942-4 (hardcover)",
LCCN = "QA445 .P42 2007",
bibdate = "Fri Aug 14 17:31:35 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip0722/2007028204.html",
abstract = "This textbook presents various automatic techniques
based on Grobner bases elimination to prove well-known
geometrical theorems and formulas. Besides proving
theorems, these methods are used to discover new
formulas, solve geometric inequalities, and construct
objects --- which cannot be easily done with a ruler
and compass. Each problem is firstly solved by an
automatic theorem proving method. Secondly, problems
are solved classically --- without using computer where
possible - so that readers can compare the strengths
and weaknesses of both approaches.",
acknowledgement = ack-nhfb,
subject = "Geometry; Computer programs; Problem solving",
tableofcontents = "1: Introduction \\
2: Automatic theorem proving \\
3: Generalization of the formula of Heron \\
4: Simson-Wallace theorem \\
5: Transversals in a polygon \\
6: Petr-Douglas-Neumann theorem \\
7: Geometric inequalities \\
8: Regular polygons \\
9: Miscellaneous",
}
@Book{Bates:2013:NSP,
author = "Daniel J. (Daniel James) Bates",
title = "Numerically solving polynomial systems with
{Bertini}",
publisher = pub-SIAM,
address = pub-SIAM:adr,
pages = "xx + 352",
year = "2013",
ISBN = "1-61197-269-8",
ISBN-13 = "978-1-61197-269-6",
LCCN = "QA161.P59 B38 2013",
bibdate = "Thu Jul 10 18:10:37 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsam.bib;
z3950.loc.gov:7090/Voyager",
series = "Software, environments, and tools",
URL = "http://www.loc.gov/catdir/enhancements/fy1403/2013025584-b.html;
http://www.loc.gov/catdir/enhancements/fy1403/2013025584-d.html;
http://www.loc.gov/catdir/enhancements/fy1403/2013025584-t.html",
acknowledgement = ack-nhfb,
author-dates = "1979--",
subject = "Polynomials; Data processing; Geometry, Algebraic",
}
