%%% -*-BibTeX-*-
%%% ====================================================================
%%% BibTeX-file{
%%% author = "Nelson H. F. Beebe",
%%% version = "3.04",
%%% date = "12 August 2008",
%%% time = "17:44:29 MDT",
%%% filename = "sigsam.bib",
%%% address = "University of Utah
%%% Department of Mathematics, 110 LCB
%%% 155 S 1400 E RM 233
%%% Salt Lake City, UT 84112-0090
%%% USA",
%%% telephone = "+1 801 581 5254",
%%% FAX = "+1 801 581 4148",
%%% URL = "http://www.math.utah.edu/~beebe",
%%% checksum = "43370 23521 95604 869342",
%%% email = "beebe at math.utah.edu, beebe at acm.org,
%%% beebe at computer.org (Internet)",
%%% codetable = "ISO/ASCII",
%%% keywords = "bibliography; BibTeX; SIGSAM Bulletin; ACM
%%% Communications in Computer Algebra; symbolic
%%% algebra",
%%% license = "public domain",
%%% supported = "yes",
%%% docstring = "This is a bibliography of ACM SIGSAM Bulletin
%%% (CODEN SIGSBZ, ISSN 0163-5824), covering 1967
%%% date. Coverage is complete from 1967 onward,
%%% but entries for issues 1--7, 10, and 26 are
%%% missing, and data for those issues are not
%%% yet available in the ACM Portal database.
%%%
%%% It appears that volume numbers may not have
%%% been assigned until volume 8 (1974). Prior
%%% to that, journal issues were assigned
%%% issue numbers 1--28.
%%%
%%% At volume 40, number 1, 2006, the journal was
%%% renamed ACM Communications in Computer
%%% Algebra and given a new ISSN, 1932-2232, but
%%% volume, number, and issue numbering continues
%%% from its predecessor. No CODEN is available
%%% yet for the new name. The version number of
%%% this bibliography was advanced to 3.00 with
%%% the name change.
%%%
%%% Papers published in the companion proceedings
%%% of the International Symposia on Symbolic and
%%% Algebraic Computation (ISSAC 'xx) are covered
%%% in a separate bibliography, issac.bib, but
%%% proceedings entries are supplied here for
%%% them, and for a few other conferences on
%%% computer algebra.
%%%
%%% The initial draft of this bibliography was
%%% extracted from the ACM Computing Archive CD
%%% ROM for the 1980s, with manual corrections
%%% and additions. Major additions were obtained
%%% from the huge Computer Science bibliography
%%% archive on ftp.ira.uka.de, from the IEEE
%%% INSPEC database (1979--1996), and from
%%% bibliographies in the author's personal
%%% collections.
%%%
%%% At version 1.08, another 50 entries were
%%% added from an OCLC Contents1st database
%%% search. Regrettably, this database does not
%%% record final page numbers of journal
%%% articles. However, most have since been
%%% supplied manually from the original journal
%%% issues; a few remain because they are in
%%% issues that are missing from my shelves.
%%%
%%% The publisher maintains World-Wide Web pages
%%% for the journal at
%%%
%%% http://portal.acm.org/browse_dl.cfm?idx=J1000
%%% http://www.acm.org/sigsam/
%%% http://www.acm.org/sigsam/bulletin/
%%%
%%% and a former editor maintains a journal Web
%%% page at
%%%
%%% http://www.apmaths.uwo.ca/~rcorless/
%%%
%%% with tables of contents for recent issues
%%% (1996--date).
%%%
%%% Some issues of the journal are also available at
%%%
%%% http://books.google.com/books?id=YylVAAAAMAAJ
%%%
%%% At version 3.04, the year coverage looked
%%% like this:
%%%
%%% 1967 ( 1) 1981 ( 22) 1995 ( 18)
%%% 1968 ( 1) 1982 ( 24) 1996 ( 44)
%%% 1969 ( 10) 1983 ( 23) 1997 ( 59)
%%% 1970 ( 13) 1984 ( 48) 1998 ( 52)
%%% 1971 ( 6) 1985 ( 15) 1999 ( 79)
%%% 1972 ( 19) 1986 ( 9) 2000 ( 40)
%%% 1973 ( 14) 1987 ( 24) 2001 ( 20)
%%% 1974 ( 36) 1988 ( 16) 2002 ( 21)
%%% 1975 ( 27) 1989 ( 20) 2003 ( 30)
%%% 1976 ( 15) 1990 ( 15) 2004 ( 22)
%%% 1977 ( 23) 1991 ( 31) 2005 ( 34)
%%% 1978 ( 15) 1992 ( 18) 2006 ( 22)
%%% 1979 ( 15) 1993 ( 18) 2007 ( 19)
%%% 1980 ( 22) 1994 ( 10) 2008 ( 60)
%%%
%%% Article: 998
%%% Proceedings: 32
%%%
%%% Total entries: 1030
%%%
%%% BibTeX citation tags are uniformly chosen
%%% as name:year:abbrev, where name is the
%%% family name of the first author or editor,
%%% year is a 4-digit number, and abbrev is a
%%% 3-letter condensation of important title
%%% words. Citation tags were automatically
%%% generated by software developed for the
%%% BibNet Project.
%%%
%%% In this bibliography, entries are sorted in
%%% publication order within each journal, using
%%% `bibsort -byvolume'. Cross-referenced
%%% proceedings entries appear at the end,
%%% because of a restriction in the current
%%% BibTeX.
%%%
%%% The checksum field above contains a CRC-16
%%% checksum as the first value, followed by the
%%% equivalent of the standard UNIX wc (word
%%% count) utility output of lines, words, and
%%% characters. This is produced by Robert
%%% Solovay's checksum utility.",
%%% }
%%% ====================================================================
@Preamble{"\input bibnames.sty " #
"\input path.sty " #
"\ifx \undefined \arccoth \def \arccoth {\mathop{\rm arccoth}\nolimits} \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" #
"\hyphenation{
brems-strah-lung
Fried-rich
Kalt-of-en
Ne-cha-ev-sky
SIG-SAM
Sho-u-i-chi
}"
}
%%% ====================================================================
%%% Acknowledgement abbreviations:
@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|http://www.math.utah.edu/~beebe/|"}
%%% ====================================================================
%%% Journal abbreviations:
@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)"}
%%% ====================================================================
%%% Publisher abbreviations:
@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-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"}
%%% ====================================================================
%%% Series abbreviations:
@String{ser-LNCS = "Lecture Notes in Computer Science"}
%%% ====================================================================
%%% Bibliography entries:
%%% ACM Portal database missing issues 1--7
@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 = "http://doi.acm.org/10.1145/1316548.1316549",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:15:34 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "8",
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 = "http://doi.acm.org/10.1145/1093532.1093533",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:15:39 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "9",
}
%%% ACM Portal database missing issue 10
@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 = "http://doi.acm.org/10.1145/1093407.1093408",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:13:49 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "11",
}
@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 = "http://doi.acm.org/10.1145/1241706.1241707",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:13:52 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "12",
}
@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 = "http://doi.acm.org/10.1145/1241706.1241708",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:13:52 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "12",
}
@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 = "http://doi.acm.org/10.1145/1241706.1241709",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:13:52 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "12",
}
@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 = "http://doi.acm.org/10.1145/1241706.1241710",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:13:52 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "12",
}
@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 = "http://doi.acm.org/10.1145/1241706.1241711",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:13:52 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "12",
}
@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 = "http://doi.acm.org/10.1145/1241706.1241712",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:13:52 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "12",
}
@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 = "http://doi.acm.org/10.1145/1241706.1241713",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:13:52 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "12",
}
@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",
bibdate = "Wed Oct 5 08:31:53 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "13",
}
@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",
ISSN = "0163-5824",
bibdate = "Wed Oct 5 08:31:53 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "13",
}
@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",
bibdate = "Wed Oct 5 08:31:53 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "14",
}
@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",
bibdate = "Wed Oct 5 08:31:53 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "14",
}
@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",
bibdate = "Wed Oct 5 08:31:53 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "14",
}
@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",
bibdate = "Wed Oct 5 08:31:53 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "14",
}
@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",
bibdate = "Wed Oct 5 08:31:53 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "14",
}
@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",
bibdate = "Wed Oct 5 08:31:53 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "14",
}
@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",
bibdate = "Wed Oct 5 08:31:53 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "14",
}
@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 = "http://doi.acm.org/10.1145/1093410.1093411",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:06 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "15",
}
@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 = "http://doi.acm.org/10.1145/1093410.1093412",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:06 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "15",
}
@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 = "http://doi.acm.org/10.1145/1093410.1093413",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:06 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "15",
}
@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 = "http://doi.acm.org/10.1145/1093415.1093416",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:13 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "16",
}
@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 = "http://doi.acm.org/10.1145/1093415.1093417",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:13 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "16",
}
@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 = "http://doi.acm.org/10.1145/1093415.1093418",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:13 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "16",
}
@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 = "http://doi.acm.org/10.1145/1093420.1093421",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:18 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "17",
}
@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 = "http://doi.acm.org/10.1145/1093420.1093422",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:18 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "17",
}
@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 = "http://doi.acm.org/10.1145/1093420.1093423",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:18 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "17",
}
@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 = "http://doi.acm.org/10.1145/1093425.1093426",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:25 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "18",
}
@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 = "http://doi.acm.org/10.1145/1093428.1093429",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:27 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "19",
}
@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 = "http://doi.acm.org/10.1145/1093431.1093432",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:29 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "20",
}
@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 = "http://doi.acm.org/10.1145/1086784.1086785",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:31 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "21",
}
@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 = "http://doi.acm.org/10.1145/1086784.1086786",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:31 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "21",
}
@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 = "http://doi.acm.org/10.1145/1086784.1086787",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:31 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "21",
}
@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 = "http://doi.acm.org/10.1145/1086789.1086790",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:39 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "22",
}
@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 = "http://doi.acm.org/10.1145/1086789.1086791",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:39 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "22",
}
@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 = "http://doi.acm.org/10.1145/1093522.1093523",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:43 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "23",
}
@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 = "http://doi.acm.org/10.1145/1093522.1093524",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:43 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "An improved non-modular algorithm for the calculation
of the greatest common divisor of two multivariate
polynomials is presented.",
acknowledgement = ack-nhfb,
issue = "23",
}
@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 = "http://doi.acm.org/10.1145/1093522.1093525",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:43 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "23",
}
@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 = "http://doi.acm.org/10.1145/1093522.1093526",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:43 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "23",
}
@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 = "http://doi.acm.org/10.1145/1086793.1086794",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:51 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "24",
}
@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 = "http://doi.acm.org/10.1145/1086793.1086795",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:51 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "24",
}
@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 = "http://doi.acm.org/10.1145/1086793.1086796",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:51 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "24",
}
@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 = "http://doi.acm.org/10.1145/1086793.1086797",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:51 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "24",
}
@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 = "http://doi.acm.org/10.1145/1086793.1086798",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:51 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "24",
}
@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 = "http://doi.acm.org/10.1145/1086793.1086799",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:51 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "24",
}
@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 = "http://doi.acm.org/10.1145/1086793.1086800",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:51 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "24",
}
@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 = "http://doi.acm.org/10.1145/1086793.1086801",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:14:51 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "24",
}
@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",
abstract = "A {REDUCE} solution to {SIGSAM} Problem \#2 is
described.",
}
@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",
abstract = "A compact program for the solution of {SIGSAM} Problem
\#2 is presented.",
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 = "http://doi.acm.org/10.1145/1086803.1086804",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:15:08 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "25",
}
@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 = "http://doi.acm.org/10.1145/1086803.1086805",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:15:08 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "25",
}
@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 = "http://doi.acm.org/10.1145/1086803.1086806",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:15:08 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "25",
}
@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 = "http://doi.acm.org/10.1145/1086803.1086807",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:15:08 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "25",
}
%%% ACM Portal database missing issue 26
@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 = "http://doi.acm.org/10.1145/1086809.1086810",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:15:15 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "27",
}
@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 = "http://doi.acm.org/10.1145/1086809.1086811",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:15:15 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "27",
}
@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 = "http://doi.acm.org/10.1145/1086809.1086812",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:15:15 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "27",
}
@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 = "http://doi.acm.org/10.1145/1086814.1086815",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:15:20 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "28",
}
@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 = "http://doi.acm.org/10.1145/1086814.1086816",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:15:20 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "28",
}
@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 = "http://doi.acm.org/10.1145/1086814.1086817",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:15:20 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "28",
}
@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 = "http://doi.acm.org/10.1145/1086814.1086818",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:15:20 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "28",
}
@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 = "http://doi.acm.org/10.1145/1086814.1086819",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:15:20 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "28",
}
@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 = "http://doi.acm.org/10.1145/1086814.1086820",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:15:20 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "28",
}
@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 = "http://doi.acm.org/10.1145/1086814.1086821",
ISSN = "0163-5824",
bibdate = "Tue Jun 17 19:15:20 MDT 2008",
bibsource = "http://portal.acm.org/",
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,
issue = "28",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@Article{Smit:1974:IN,
author = "Mr. 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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
ISSN = "0163-5824",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
abstract = "A description of a program for the recognition of
divergences in {Feynman} graphs is given.",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
issue = "??",
}
@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",
bibdate = "Wed Oct 5 08:31:54 MDT 2005",
bibsource = "