%%% -*-BibTeX-*-
%%% ====================================================================
%%% BibTeX-file{
%%% author = "Nelson H. F. Beebe",
%%% version = "2.05",
%%% date = "08 August 2008",
%%% time = "14:32:55 MDT",
%%% filename = "issac.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 = "32764 30581 153617 1544223",
%%% email = "beebe at math.utah.edu, beebe at acm.org,
%%% beebe at computer.org (Internet)",
%%% codetable = "ISO/ASCII",
%%% keywords = "bibliography, ISSAC, International
%%% Symposium on Symbolic and Algebraic
%%% Computation",
%%% license = "public domain",
%%% supported = "yes",
%%% docstring = "This is a bibliography of papers presented
%%% at the annual ISSAC (International Symposia
%%% on Symbolic and Algebraic Computation)
%%% conferences. These conferences have been
%%% held most years since 1966, with the 23th on
%%% August 13--15, 1998 at the University of
%%% Rostock, Germany.
%%%
%%% It also includes papers from the PASCO
%%% (Parallel Symbolic Computation)
%%% conferences, the SYMSAC (Symbolic and
%%% Algebraic Computation) conferences, and a
%%% few papers on symbolic algebra from other
%%% conferences not specifically devoted to
%%% that subject.
%%%
%%% Companion bibliographies sigsam.bib and
%%% jsymcomp.bib cover papers in the area of
%%% symbolic and algebraic computation
%%% published in SIGSAM Bulletin and the
%%% Journal of Symbolic Computation.
%%%
%%% At version 2.05, the year coverage looked
%%% like this:
%%%
%%% 1976 ( 1) 1987 ( 0) 1998 ( 49)
%%% 1977 ( 0) 1988 ( 0) 1999 ( 41)
%%% 1978 ( 0) 1989 ( 106) 2000 ( 44)
%%% 1979 ( 1) 1990 ( 64) 2001 ( 48)
%%% 1980 ( 0) 1991 ( 86) 2002 ( 36)
%%% 1981 ( 2) 1992 ( 50) 2003 ( 40)
%%% 1982 ( 1) 1993 ( 58) 2004 ( 47)
%%% 1983 ( 0) 1994 ( 103) 2005 ( 52)
%%% 1984 ( 0) 1995 ( 52) 2006 ( 55)
%%% 1985 ( 0) 1996 ( 51) 2007 ( 54)
%%% 1986 ( 50) 1997 ( 88) 2008 ( 47)
%%%
%%% Article: 3
%%% Book: 1
%%% InProceedings: 1183
%%% Proceedings: 39
%%%
%%% Total entries: 1226
%%%
%%% Regrettably, bibliographic data for most of
%%% these conferences prior to 1989 are
%%% inaccessible electronically. With an
%%% estimated 60 papers at each conference, a
%%% complete bibliography would have about 1800
%%% entries, so the coverage is only about 25%.
%%%
%%% This bibliography has been collected from
%%% bibliographies in the author's personal
%%% files, from the OCLC and IEEE INSPEC
%%% (1989--1995) databases, and from the
%%% computer science bibliography collection on
%%% ftp.ira.uka.de in /pub/bibliography to
%%% which many people of have contributed. The
%%% snapshot of this collection was taken on
%%% 5-May-1994, and it consists of 441 BibTeX
%%% files, 2,672,675 lines, 205,289 entries,
%%% and 6,375 <at>String{} abbreviations,
%%% occupying 94.8MB of disk space.
%%%
%%% Numerous errors have been corrected, and TeX
%%% mathematics mode markup has been added
%%% manually to more than 1000 text fragments in
%%% the key values.
%%%
%%% 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
%%% first by ascending year, and within each
%%% year, alphabetically by author or editor,
%%% and then, if necessary, by the 3-letter
%%% abbreviation at the end of the BibTeX
%%% citation tag, using the bibsort -byyear
%%% utility. Year order has been chosen to
%%% make it easier to identify the most recent
%%% work.
%%%
%%% 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{
"\ifx \undefined \mathbb \def \mathbb #1{{\bf #1}}\fi"
#
"\ifx \undefined \mathcal \def \mathcal #1{{\cal #1}}\fi"
}
%%% ====================================================================
%%% 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@ieee.org| (Internet),
URL: \path|http://www.math.utah.edu/~beebe/|"}
%%% ====================================================================
%%% Journal abbreviations:
@String{j-SIGNUM = "ACM SIGNUM Newsletter"}
@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 10036, 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-IEEE = "IEEE Computer Society Press"}
@String{pub-IEEE:adr = "1109 Spring Street, Suite 300, Silver
Spring, MD 20910, USA"}
@String{pub-SIAM = "SIAM Press"}
@String{pub-SIAM:adr = "Philadelphia, PA, USA"}
@String{pub-SV = "Springer Verlag"}
@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:
@InProceedings{Fateman:1981:CAN,
author = "Richard J. Fateman",
title = "Computer Algebra and Numerical Integration",
crossref = "Wang:1981:SPA",
pages = "228--232",
year = "1981",
bibdate = "Mon Apr 25 07:01:52 2005",
abstract = "Algebraic manipulation systems such as MACSYMA include
algorithms and heuristic procedures for indefinite and
definite integration, yet these system facilities are
not as generally useful as might be thought. Most
isolated definite integration problems are more
efficiently tackled with numerical programs.
Unfortunately, the answers obtained are sometimes
incorrect, in spite of assurances of accuracy;
furthermore, large classes of problems can sometimes be
solved more rapidly by preliminary algebraic
transformations. In this paper we indicate various
directions for improving the usefulness of integration
programs given closed form integrands, via algebraic
manipulation techniques. These include expansions in
partial fractions or Taylor series, detection and
removal of singularities and symmetries, and various
approximation techniques for troublesome problems.",
acknowledgement = ack-nhfb,
}
@Book{Buchberger:1982:CAS,
author = "Bruno Buchberger and George Edward Collins and Rudiger
Loos and R. Albrecht",
title = "Computer algebra: symbolic and algebraic computation",
volume = "4",
publisher = pub-SV,
address = pub-SV:adr,
pages = "vi + 283",
year = "1982",
ISBN = "0-387-81684-4",
ISBN-13 = "978-0-387-81684-5",
LCCN = "QA155.7.E4 C65 1982",
bibdate = "Thu Dec 28 13:48:31 1995",
series = "Computing. Supplementum",
acknowledgement = ack-nhfb,
keywords = "algorithms; measurement; theory",
subject = "S1 Algebra --- Data processing; S2 Machine theory",
}
@InProceedings{Abbott:1986:BAN,
author = "J. A. Abbott and R. J. Bradford and J. H. Davenport",
title = "The {Bath} algebraic number package",
crossref = "Char:1986:PSS",
pages = "250--253",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p250-abbott/",
acknowledgement = ack-nhfb,
keywords = "design; measurement; performance",
subject = "{\bf I.1.2} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Algorithms, Algebraic
algorithms. {\bf I.1.1} Computing Methodologies,
SYMBOLIC AND ALGEBRAIC MANIPULATION, Expressions and
Their Representation, Simplification of expressions.
{\bf F.2.1} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms
and Problems, Computations on polynomials. {\bf G.4}
Mathematics of Computing, MATHEMATICAL SOFTWARE. {\bf
I.1.3} Computing Methodologies, SYMBOLIC AND ALGEBRAIC
MANIPULATION, Languages and Systems, REDUCE.",
}
@InProceedings{Abdali:1986:OOA,
author = "S. K. Abdali and Guy W. Cherry and Neil Soiffer",
title = "An object-oriented approach to algebra system design",
crossref = "Char:1986:PSS",
pages = "24--30",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p24-abdali/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; theory",
subject = "{\bf I.1.3} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Languages and Systems. {\bf
D.3.3} Software, PROGRAMMING LANGUAGES, Language
Constructs and Features, Abstract data types. {\bf
D.3.4} Software, PROGRAMMING LANGUAGES, Processors,
Run-time environments. {\bf D.3.2} Software,
PROGRAMMING LANGUAGES, Language Classifications,
Specialized application languages. {\bf D.3.2}
Software, PROGRAMMING LANGUAGES, Language
Classifications, Very high-level languages.",
}
@InProceedings{Akritis:1986:TNU,
author = "Alkiviadis G. Akritis",
title = "There is no ``{Uspensky}'s method''",
crossref = "Char:1986:PSS",
pages = "88--90",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p88-akritis/",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory",
subject = "{\bf I.1.2} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Algorithms, Analysis of
algorithms. {\bf G.1.5} Mathematics of Computing,
NUMERICAL ANALYSIS, Roots of Nonlinear Equations,
Polynomials, methods for. {\bf K.2} Computing Milieux,
HISTORY OF COMPUTING, Systems. {\bf G.1.5} Mathematics
of Computing, NUMERICAL ANALYSIS, Roots of Nonlinear
Equations, Iterative methods. {\bf F.2.1} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Numerical Algorithms and Problems,
Computations on polynomials.",
}
@InProceedings{Arnborg:1986:ADR,
author = "S. Arnborg and H. Feng",
title = "Algebraic decomposition of regular curves",
crossref = "Char:1986:PSS",
pages = "53--55",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p53-arnborg/",
acknowledgement = ack-nhfb,
keywords = "theory",
subject = "{\bf I.1.m} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Miscellaneous.",
}
@InProceedings{Bachmair:1986:CPC,
author = "Leo Bachmair and Nachum Dershowitz",
title = "Critical-pair criteria for the {Knuth--Bendix}
completion procedure",
crossref = "Char:1986:PSS",
pages = "215--217",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p215-bachmair/",
acknowledgement = ack-nhfb,
keywords = "languages; theory; verification",
subject = "{\bf F.4.2} Theory of Computation, MATHEMATICAL LOGIC
AND FORMAL LANGUAGES, Grammars and Other Rewriting
Systems, Parallel rewriting systems. {\bf I.1.3}
Computing Methodologies, SYMBOLIC AND ALGEBRAIC
MANIPULATION, Languages and Systems. {\bf I.1.1}
Computing Methodologies, SYMBOLIC AND ALGEBRAIC
MANIPULATION, Expressions and Their Representation,
Simplification of expressions. {\bf F.2.3} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Tradeoffs between Complexity Measures. {\bf
F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Complexity of proof procedures.",
}
@InProceedings{Bajaj:1986:LAS,
author = "Chanderjit Bajaj",
title = "Limitations to algorithm solvability: {Galois} methods
and models of computation",
crossref = "Char:1986:PSS",
pages = "71--76",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p71-bajaj/",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory",
subject = "{\bf I.1.2} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Algorithms, Analysis of
algorithms. {\bf G.2.m} Mathematics of Computing,
DISCRETE MATHEMATICS, Miscellaneous. {\bf G.4}
Mathematics of Computing, MATHEMATICAL SOFTWARE,
Algorithm design and analysis.",
}
@InProceedings{Bayer:1986:DMS,
author = "D. Bayer and M. Stillman",
title = "The design of {Macaulay}: a system for computing in
algebraic geometry and commutative algebra",
crossref = "Char:1986:PSS",
pages = "157--162",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p157-bayer/",
acknowledgement = ack-nhfb,
keywords = "design; performance; theory",
subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Geometrical problems and
computations. {\bf I.1.3} Computing Methodologies,
SYMBOLIC AND ALGEBRAIC MANIPULATION, Languages and
Systems.",
}
@InProceedings{Beck:1986:SAL,
author = "Robert E. Beck and Bernard Kolman",
title = "Symbolic algorithms for {Lie} algebra computation",
crossref = "Char:1986:PSS",
pages = "85--87",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p85-beck/",
acknowledgement = ack-nhfb,
keywords = "algorithms; performance; theory",
subject = "{\bf I.1.2} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Algorithms, Algebraic
algorithms. {\bf I.2.2} Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Automatic Programming. {\bf
F.2.1} Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Numerical Algorithms and
Problems, Computations on matrices. {\bf I.1.2}
Computing Methodologies, SYMBOLIC AND ALGEBRAIC
MANIPULATION, Algorithms, Analysis of algorithms. {\bf
I.1.3} Computing Methodologies, SYMBOLIC AND ALGEBRAIC
MANIPULATION, Languages and Systems, MACSYMA. {\bf K.2}
Computing Milieux, HISTORY OF COMPUTING, Systems.",
}
@InProceedings{Bradford:1986:ERD,
author = "R. J. Bradford and A. C. Hearn and J. A. Padget and E.
Schr{\"u}fer",
title = "Enlarging the {REDUCE} domain of computation",
crossref = "Char:1986:PSS",
pages = "100--106",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p100-bradford/",
acknowledgement = ack-nhfb,
keywords = "algorithms; languages; theory",
subject = "{\bf I.1.3} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Languages and Systems, REDUCE.
{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Computations on discrete
structures. {\bf I.1.2} Computing Methodologies,
SYMBOLIC AND ALGEBRAIC MANIPULATION, Algorithms,
Algebraic algorithms.",
}
@InProceedings{Bronstein:1986:GFA,
author = "Manuel Bronstein",
title = "Gsolve: a faster algorithm for solving systems of
algebraic equations",
crossref = "Char:1986:PSS",
pages = "247--249",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p247-bronstein/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; performance; theory",
subject = "{\bf I.1.2} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Algorithms, Algebraic
algorithms. {\bf G.4} Mathematics of Computing,
MATHEMATICAL SOFTWARE, Efficiency. {\bf G.1.5}
Mathematics of Computing, NUMERICAL ANALYSIS, Roots of
Nonlinear Equations, Systems of equations. {\bf G.4}
Mathematics of Computing, MATHEMATICAL SOFTWARE,
Reliability and robustness.",
}
@InProceedings{Butler:1986:DCC,
author = "Greg Butler",
title = "Divide-and-conquer in computational group theory",
crossref = "Char:1986:PSS",
pages = "59--64",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p59-butler/",
acknowledgement = ack-nhfb,
keywords = "algorithms",
subject = "{\bf G.2.0} Mathematics of Computing, DISCRETE
MATHEMATICS, General. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Computations on discrete structures. {\bf I.1.0}
Computing Methodologies, SYMBOLIC AND ALGEBRAIC
MANIPULATION, General.",
}
@InProceedings{Chaffy:1986:HCM,
author = "C. Chaffy",
title = "How to compute multivariate {Pad{\'e}} approximants",
crossref = "Char:1986:PSS",
pages = "56--58",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p56-chaffy/",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory",
subject = "{\bf G.1.2} Mathematics of Computing, NUMERICAL
ANALYSIS, Approximation.",
}
@InProceedings{Char:1986:CAU,
author = "B. W. Char and K. O. Geddes and G. H. Gonnet and B. J.
Marshman and P. J. Ponzo",
title = "Computer algebra in the undergraduate mathematics
classroom",
crossref = "Char:1986:PSS",
pages = "135--140",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p135-char/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; documentation; experimentation;
human factors; performance",
subject = "{\bf I.1.3} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Languages and Systems, Maple.
{\bf K.3.1} Computing Milieux, COMPUTERS AND EDUCATION,
Computer Uses in Education, Computer-assisted
instruction (CAI).",
}
@InProceedings{Cooperman:1986:SMC,
author = "Gene Cooperman",
title = "A semantic matcher for computer algebra",
crossref = "Char:1986:PSS",
pages = "132--134",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p132-cooperman/",
acknowledgement = ack-nhfb,
keywords = "experimentation; human factors; languages",
subject = "{\bf I.1.3} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Languages and Systems,
Special-purpose algebraic systems. {\bf F.4.1} Theory
of Computation, MATHEMATICAL LOGIC AND FORMAL
LANGUAGES, Mathematical Logic. {\bf I.1.3} Computing
Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION,
Languages and Systems, Evaluation strategies. {\bf
F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Pattern matching. {\bf I.1.1} Computing
Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION,
Expressions and Their Representation, Representations
(general and polynomial). {\bf I.1.3} Computing
Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION,
Languages and Systems, MACSYMA.",
}
@InProceedings{Czapor:1986:IBA,
author = "S. R. Czapor and K. O. Geddes",
title = "On implementing {Buchberger}'s algorithm for
{Gr{\"o}bner} bases",
crossref = "Char:1986:PSS",
pages = "233--238",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p233-czapor/",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory",
subject = "{\bf I.1.3} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Languages and Systems, Maple.
{\bf F.2.1} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms
and Problems, Computations on polynomials.",
}
@InProceedings{Davenport:1986:PSM,
author = "J. H. Davenport and C. E. Roth",
title = "{PowerMath}: a system for the {Macintosh}",
crossref = "Char:1986:PSS",
pages = "13--15",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p13-davenport/",
acknowledgement = ack-nhfb,
keywords = "design; theory",
subject = "{\bf K.8} Computing Milieux, PERSONAL COMPUTING,
Apple. {\bf I.1.3} Computing Methodologies, SYMBOLIC
AND ALGEBRAIC MANIPULATION, Languages and Systems,
Special-purpose algebraic systems.",
}
@InProceedings{Dora:1986:FSL,
author = "J. Della Dora and E. Tournier",
title = "Formal solutions of linear difference equations:
method of {Pincherle--Ramis}",
crossref = "Char:1986:PSS",
pages = "192--196",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p192-della_dora/",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory",
subject = "{\bf G.1.m} Mathematics of Computing, NUMERICAL
ANALYSIS, Miscellaneous. {\bf F.2.1} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Numerical Algorithms and Problems,
Computation of transforms.",
}
@InProceedings{Fitch:1986:AIA,
author = "J. Fitch and A. Norman and M. A. Moore",
title = "Alkahest {III}: automatic analysis of periodic weakly
nonlinear {ODEs}",
crossref = "Char:1986:PSS",
pages = "34--38",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p34-fitch/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; human factors; theory",
subject = "{\bf G.1.7} Mathematics of Computing, NUMERICAL
ANALYSIS, Ordinary Differential Equations. {\bf D.2.2}
Software, SOFTWARE ENGINEERING, Design Tools and
Techniques, User interfaces.",
}
@InProceedings{Freeman:1986:SMP,
author = "T. Freeman and G. Imirzian and E. Kaltofen",
title = "A system for manipulating polynomials given by
straight-line programs",
crossref = "Char:1986:PSS",
pages = "169--175",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p169-freeman/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; performance; theory",
subject = "{\bf I.1.3} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Languages and Systems. {\bf
G.1.5} Mathematics of Computing, NUMERICAL ANALYSIS,
Roots of Nonlinear Equations, Polynomials, methods
for.",
}
@InProceedings{Furukawa:1986:GBM,
author = "A. Furukawa and T. Sasaki and H. Kobayashi",
title = "The {Gr{\"o}bner} basis of a module over
{KUX1,\ldots{},Xne} and polynomial solutions of a
system of linear equations",
crossref = "Char:1986:PSS",
pages = "222--224",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p222-furukawa/",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory",
subject = "{\bf I.1.3} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Languages and Systems. {\bf
F.2.1} Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Numerical Algorithms and
Problems, Computations on polynomials. {\bf G.1.3}
Mathematics of Computing, NUMERICAL ANALYSIS, Numerical
Linear Algebra, Linear systems (direct and iterative
methods).",
}
@InProceedings{Gates:1986:NCG,
author = "Barbara L. Gates",
title = "A numerical code generation facility for {REDUCE}",
crossref = "Char:1986:PSS",
pages = "94--99",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p94-gates/",
acknowledgement = ack-nhfb,
keywords = "design; languages; theory",
subject = "{\bf I.1.3} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Languages and Systems, REDUCE.
{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
Processors, Code generation.",
}
@InProceedings{Gebauer:1986:BAS,
author = "R{\"u}diger Gebauer and H. Michael M{\"o}ller",
title = "{Buchberger}'s algorithm and staggered linear bases",
crossref = "Char:1986:PSS",
pages = "218--221",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p218-gebauer/",
acknowledgement = ack-nhfb,
keywords = "algorithms; measurement; performance; theory",
subject = "{\bf I.1.2} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Algorithms, Algebraic
algorithms. {\bf I.1.3} Computing Methodologies,
SYMBOLIC AND ALGEBRAIC MANIPULATION, Languages and
Systems. {\bf F.2.1} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms
and Problems, Computations on polynomials. {\bf I.1.1}
Computing Methodologies, SYMBOLIC AND ALGEBRAIC
MANIPULATION, Expressions and Their Representation,
Simplification of expressions.",
}
@InProceedings{Geddes:1986:NIS,
author = "K. O. Geddes",
title = "Numerical integration in a symbolic context",
crossref = "Char:1986:PSS",
pages = "185--191",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p185-geddes/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design",
subject = "{\bf G.1.4} Mathematics of Computing, NUMERICAL
ANALYSIS, Quadrature and Numerical Differentiation.
{\bf I.1.2} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Algorithms.",
}
@InProceedings{Golden:1986:OAM,
author = "J. P. Golden",
title = "An operator algebra for {Macsyma}",
crossref = "Char:1986:PSS",
pages = "244--246",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p244-golden/",
acknowledgement = ack-nhfb,
keywords = "design; theory; verification",
subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, MACSYMA. {\bf I.1.3} Computing
Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION,
Languages and Systems, MACSYMA.",
}
@InProceedings{Gonnet:1986:IOS,
author = "G. H. Gonnet",
title = "An implementation of operators for symbolic algebra
systems",
crossref = "Char:1986:PSS",
pages = "239--243",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p239-gonnet/",
acknowledgement = ack-nhfb,
keywords = "design; languages; theory",
subject = "{\bf I.1.1} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Expressions and Their
Representation, Representations (general and
polynomial). {\bf I.1.3} Computing Methodologies,
SYMBOLIC AND ALGEBRAIC MANIPULATION, Languages and
Systems.",
}
@InProceedings{Gonnet:1986:NRR,
author = "Gaston H. Gonnet",
title = "New results for random determination of equivalence of
expressions",
crossref = "Char:1986:PSS",
pages = "127--131",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p127-gonnet/",
acknowledgement = ack-nhfb,
keywords = "theory",
subject = "{\bf I.1.1} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Expressions and Their
Representation. {\bf F.2.1} Theory of Computation,
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
Numerical Algorithms and Problems, Computations on
polynomials. {\bf G.2.m} Mathematics of Computing,
DISCRETE MATHEMATICS, Miscellaneous.",
}
@InProceedings{Hadzikadic:1986:AKB,
author = "M. Hadzikadic and F. Lichtenberger and D. Y. Y. Yun",
title = "An application of knowledge-base technology in
education: a geometry theorem prover",
crossref = "Char:1986:PSS",
pages = "141--147",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p141-hadzikadic/",
acknowledgement = ack-nhfb,
keywords = "algorithms; experimentation; human factors; languages;
performance; verification",
subject = "{\bf K.3.1} Computing Milieux, COMPUTERS AND
EDUCATION, Computer Uses in Education,
Computer-assisted instruction (CAI). {\bf F.2.2} Theory
of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Geometrical problems and computations. {\bf F.4.1}
Theory of Computation, MATHEMATICAL LOGIC AND FORMAL
LANGUAGES, Mathematical Logic, Mechanical theorem
proving. {\bf I.2.3} Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Deduction and Theorem
Proving.",
}
@InProceedings{Hayden:1986:SBC,
author = "Michael B. Hayden and Edmund A. Lamagna",
title = "Summation of binomial coefficients using
hypergeometric functions",
crossref = "Char:1986:PSS",
pages = "77--81",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p77-hayden/",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory",
subject = "{\bf I.1.3} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Languages and Systems, REDUCE.
{\bf F.1.2} Theory of Computation, COMPUTATION BY
ABSTRACT DEVICES, Modes of Computation, Parallelism and
concurrency. {\bf I.2.2} Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Automatic Programming,
Automatic analysis of algorithms. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Geometrical problems and computations. {\bf F.2.1}
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, Numerical Algorithms and Problems,
Computations on polynomials. {\bf G.1.4} Mathematics of
Computing, NUMERICAL ANALYSIS, Quadrature and Numerical
Differentiation, Iterative methods.",
}
@InProceedings{Hilali:1986:ACF,
author = "A. Hilali and A. Wazner",
title = "Algorithm for computing formal invariants of linear
differential systems",
crossref = "Char:1986:PSS",
pages = "197--201",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p197-hilali/",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory; verification",
subject = "{\bf G.1.3} Mathematics of Computing, NUMERICAL
ANALYSIS, Numerical Linear Algebra, Eigenvalues and
eigenvectors (direct and iterative methods). {\bf
G.1.7} Mathematics of Computing, NUMERICAL ANALYSIS,
Ordinary Differential Equations. {\bf F.2.1} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Numerical Algorithms and Problems,
Computations on matrices. {\bf I.1.1} Computing
Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION,
Expressions and Their Representation, Simplification of
expressions.",
}
@InProceedings{Jurkovic:1986:EES,
author = "N. Jurkovic",
title = "Edusym --- educational symbolic manipulator on a
microcomputer",
crossref = "Char:1986:PSS",
pages = "154--156",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p154-jurkovic/",
acknowledgement = ack-nhfb,
keywords = "human factors; theory",
subject = "{\bf I.1.3} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Languages and Systems, MuMATH.
{\bf K.3.1} Computing Milieux, COMPUTERS AND EDUCATION,
Computer Uses in Education, Computer-assisted
instruction (CAI).",
}
@InProceedings{Kaltofen:1986:FPA,
author = "E. Kaltofen and M. Krishnamoorthy and B. D. Saunders",
title = "Fast parallel algorithms for similarity of matrices",
crossref = "Char:1986:PSS",
pages = "65--70",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p65-kaltofen/",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory",
subject = "{\bf G.1.0} Mathematics of Computing, NUMERICAL
ANALYSIS, General, Parallel algorithms. {\bf I.1.2}
Computing Methodologies, SYMBOLIC AND ALGEBRAIC
MANIPULATION, Algorithms, Analysis of algorithms. {\bf
F.2.1} Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Numerical Algorithms and
Problems, Computations on matrices.",
}
@InProceedings{Kapur:1986:GTP,
author = "Deepak Kapur",
title = "Geometry theorem proving using {Hilbert}'s
{Nullstellensatz}",
crossref = "Char:1986:PSS",
pages = "202--208",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p202-kapur/",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory; verification",
subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
AND FORMAL LANGUAGES, Mathematical Logic, Logic and
constraint programming. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Geometrical problems and computations. {\bf I.2.3}
Computing Methodologies, ARTIFICIAL INTELLIGENCE,
Deduction and Theorem Proving. {\bf F.2.1} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Numerical Algorithms and Problems,
Computations on polynomials. {\bf I.1.1} Computing
Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION,
Expressions and Their Representation, Simplification of
expressions.",
}
@InProceedings{Knowles:1986:ILF,
author = "P. H. Knowles",
title = "Integration of {Liouvillian} functions with special
functions",
crossref = "Char:1986:PSS",
pages = "179--184",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p179-knowles/",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory",
subject = "{\bf G.1.m} Mathematics of Computing, NUMERICAL
ANALYSIS, Miscellaneous.",
}
@InProceedings{Kobayashi:1986:GBI,
author = "H. Kobayashi and A. Furukawa and T. Sasaki",
title = "Gr{\"o}bner bases of ideals of convergent power
series",
crossref = "Char:1986:PSS",
pages = "225--227",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p225-kobayashi/",
acknowledgement = ack-nhfb,
keywords = "theory",
subject = "{\bf F.2.1} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms
and Problems, Computations on polynomials. {\bf I.1.3}
Computing Methodologies, SYMBOLIC AND ALGEBRAIC
MANIPULATION, Languages and Systems. {\bf G.m}
Mathematics of Computing, MISCELLANEOUS.",
}
@InProceedings{Kryukov:1986:CRA,
author = "A. P. Kryukov and Y. Rodionov and G. L. Litvinov",
title = "Construction of rational approximations by means of
{REDUCE}",
crossref = "Char:1986:PSS",
pages = "31--33",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p31-kryukov/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; theory",
subject = "{\bf I.1.3} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Languages and Systems, REDUCE.
{\bf G.1.2} Mathematics of Computing, NUMERICAL
ANALYSIS, Approximation, Rational approximation. {\bf
I.1.1} Computing Methodologies, SYMBOLIC AND ALGEBRAIC
MANIPULATION, Expressions and Their Representation,
Simplification of expressions.",
}
@InProceedings{Kryukov:1986:DRE,
author = "A. P. Kryukov",
title = "Dialogue in {REDUCE}: experience and development",
crossref = "Char:1986:PSS",
pages = "107--109",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p107-kryukov/",
acknowledgement = ack-nhfb,
keywords = "design; human factors; performance; theory",
subject = "{\bf I.1.3} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Languages and Systems, REDUCE.
{\bf D.2.2} Software, SOFTWARE ENGINEERING, Design
Tools and Techniques, User interfaces.",
}
@InProceedings{Kryukov:1986:URC,
author = "A. P. Kryukov and A. Y. Rodionov",
title = "Usage of {REDUCE} for computations of
group-theoretical weight of {Feynman} diagrams in
{non-Abelian} gauge theories",
crossref = "Char:1986:PSS",
pages = "91--93",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p91-kryukov/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; theory",
subject = "{\bf I.1.3} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Languages and Systems, REDUCE.
{\bf G.2.m} Mathematics of Computing, DISCRETE
MATHEMATICS, Miscellaneous.",
}
@InProceedings{Kutzler:1986:AGT,
author = "B. Kutzler and S. Stifter",
title = "Automated geometry theorem proving using
{Buchberger}'s algorithm",
crossref = "Char:1986:PSS",
pages = "209--214",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p209-kutzler/",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory; verification",
subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
AND FORMAL LANGUAGES, Mathematical Logic, Logic and
constraint programming. {\bf I.2.3} Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and
Theorem Proving. {\bf F.2.2} Theory of Computation,
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
Nonnumerical Algorithms and Problems, Geometrical
problems and computations. {\bf F.2.1} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Numerical Algorithms and Problems,
Computations on polynomials. {\bf I.1.1} Computing
Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION,
Expressions and Their Representation, Simplification of
expressions.",
}
@InProceedings{Leff:1986:CSG,
author = "L. Leff and D. Y. Y. Yun",
title = "Constructive solid geometry: a symbolic computation
approach",
crossref = "Char:1986:PSS",
pages = "121--126",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p121-leff/",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory",
subject = "{\bf J.6} Computer Applications, COMPUTER-AIDED
ENGINEERING. {\bf F.2.2} Theory of Computation,
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
Nonnumerical Algorithms and Problems, Geometrical
problems and computations. {\bf I.1.m} Computing
Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION,
Miscellaneous.",
}
@InProceedings{Leong:1986:IDU,
author = "B. L. Leong",
title = "{Iris}: design of an user interface program for
symbolic algebra",
crossref = "Char:1986:PSS",
pages = "1--6",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p1-leong/",
acknowledgement = ack-nhfb,
keywords = "design; human factors; theory",
subject = "{\bf I.1.2} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Algorithms, Algebraic
algorithms. {\bf D.2.2} Software, SOFTWARE ENGINEERING,
Design Tools and Techniques, User interfaces. {\bf
I.1.3} Computing Methodologies, SYMBOLIC AND ALGEBRAIC
MANIPULATION, Languages and Systems, Maple. {\bf H.1.2}
Information Systems, MODELS AND PRINCIPLES,
User/Machine Systems, Human factors.",
}
@InProceedings{Lucks:1986:FIP,
author = "Michael Lucks",
title = "A fast implementation of polynomial factorization",
crossref = "Char:1986:PSS",
pages = "228--232",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p228-lucks/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; experimentation; performance;
theory",
subject = "{\bf G.1.5} Mathematics of Computing, NUMERICAL
ANALYSIS, Roots of Nonlinear Equations, Polynomials,
methods for. {\bf F.2.1} Theory of Computation,
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
Numerical Algorithms and Problems, Computations on
polynomials. {\bf I.1.3} Computing Methodologies,
SYMBOLIC AND ALGEBRAIC MANIPULATION, Languages and
Systems. {\bf F.2.1} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms
and Problems, Number-theoretic computations.",
}
@InProceedings{Mawata:1986:SDR,
author = "C. P. Mawata",
title = "A sparse distributed representation using prime
numbers",
crossref = "Char:1986:PSS",
pages = "110--114",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p110-mawata/",
acknowledgement = ack-nhfb,
keywords = "experimentation; performance; theory",
subject = "{\bf F.2.1} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms
and Problems, Number-theoretic computations. {\bf
I.1.1} Computing Methodologies, SYMBOLIC AND ALGEBRAIC
MANIPULATION, Expressions and Their Representation,
Representations (general and polynomial). {\bf G.1.0}
Mathematics of Computing, NUMERICAL ANALYSIS, General,
Parallel algorithms. {\bf F.2.1} Theory of Computation,
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
Numerical Algorithms and Problems, Computations on
matrices. {\bf G.4} Mathematics of Computing,
MATHEMATICAL SOFTWARE, Algorithm design and analysis.
{\bf I.1.2} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Algorithms, Analysis of
algorithms.",
}
@InProceedings{Purtilo:1986:ASI,
author = "J. Purtilo",
title = "Applications of a software interconnection system in
mathematical problem solving environments",
crossref = "Char:1986:PSS",
pages = "16--23",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p16-purtilo/",
acknowledgement = ack-nhfb,
keywords = "design; theory",
subject = "{\bf I.1.3} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Languages and Systems. {\bf
G.m} Mathematics of Computing, MISCELLANEOUS. {\bf
D.2.m} Software, SOFTWARE ENGINEERING, Miscellaneous.",
}
@InProceedings{Renbao:1986:CAS,
author = "Z. Renbao and X. Ling and R. Zhaoyang",
title = "The computer algebra system {CAS1} for the {IBM-PC}",
crossref = "Char:1986:PSS",
pages = "176--178",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p176-renbao/",
acknowledgement = ack-nhfb,
keywords = "design; theory",
subject = "{\bf K.8} Computing Milieux, PERSONAL COMPUTING, IBM
PC. {\bf I.1.3} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Languages and Systems,
Special-purpose algebraic systems. {\bf I.1.1}
Computing Methodologies, SYMBOLIC AND ALGEBRAIC
MANIPULATION, Expressions and Their Representation,
Simplification of expressions.",
}
@InProceedings{Sasaki:1986:SAE,
author = "Tateaki Sasaki",
title = "Simplification of algebraic expression by multiterm
rewriting rules",
crossref = "Char:1986:PSS",
pages = "115--120",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p115-sasaki/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; languages",
subject = "{\bf I.1.1} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Expressions and Their
Representation, Simplification of expressions. {\bf
F.4.2} Theory of Computation, MATHEMATICAL LOGIC AND
FORMAL LANGUAGES, Grammars and Other Rewriting Systems,
Parallel rewriting systems.",
}
@InProceedings{Seymour:1986:CCM,
author = "Harlan R. Seymour",
title = "Conform: a conformal mapping system",
crossref = "Char:1986:PSS",
pages = "163--168",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p163-seymour/",
acknowledgement = ack-nhfb,
keywords = "design; languages; performance; theory",
subject = "{\bf I.1.3} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Languages and Systems. {\bf
D.3.2} Software, PROGRAMMING LANGUAGES, Language
Classifications, LISP. {\bf D.3.3} Software,
PROGRAMMING LANGUAGES, Language Constructs and
Features.",
}
@InProceedings{Shavlik:1986:CUG,
author = "Jude W. Shavlik and Gerald F. DeJong",
title = "Computer understanding and generalization of symbolic
mathematical calculations: a case study in physics
problem solving",
crossref = "Char:1986:PSS",
pages = "148--153",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p148-shavlik/",
acknowledgement = ack-nhfb,
keywords = "design; human factors; languages; performance; theory;
verification",
subject = "{\bf I.2.6} Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Learning. {\bf K.3.1} Computing Milieux,
COMPUTERS AND EDUCATION, Computer Uses in Education,
Computer-assisted instruction (CAI). {\bf I.1.1}
Computing Methodologies, SYMBOLIC AND ALGEBRAIC
MANIPULATION, Expressions and Their Representation.
{\bf I.2.1} Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Applications and Expert Systems. {\bf
J.2} Computer Applications, PHYSICAL SCIENCES AND
ENGINEERING, Physics. {\bf G.4} Mathematics of
Computing, MATHEMATICAL SOFTWARE. {\bf I.1.3} Computing
Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION,
Languages and Systems, Substitution mechanisms**. {\bf
I.1.3} Computing Methodologies, SYMBOLIC AND ALGEBRAIC
MANIPULATION, Languages and Systems, Evaluation
strategies. {\bf I.1.2} Computing Methodologies,
SYMBOLIC AND ALGEBRAIC MANIPULATION, Algorithms,
Algebraic algorithms.",
}
@InProceedings{Smith:1986:MUI,
author = "C. J. Smith and N. Soiffer",
title = "{MathScribe}: a user interface for computer algebra
systems",
crossref = "Char:1986:PSS",
pages = "7--12",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p7-smith/",
acknowledgement = ack-nhfb,
keywords = "design; human factors; theory",
subject = "{\bf I.1.3} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Languages and Systems. {\bf
D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and
Techniques, User interfaces.",
}
@InProceedings{Yun:1986:FCF,
author = "D. Y. Y. Yun and C. N. Zhang",
title = "A fast carry-free algorithm and hardware design for
extended integer {GCD} computation",
crossref = "Char:1986:PSS",
pages = "82--84",
year = "1986",
bibdate = "Thu Mar 12 07:38:29 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p82-yun/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; theory",
subject = "{\bf F.2.1} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms
and Problems, Number-theoretic computations. {\bf
I.1.2} Computing Methodologies, SYMBOLIC AND ALGEBRAIC
MANIPULATION, Algorithms, Analysis of algorithms. {\bf
G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE,
Algorithm design and analysis. {\bf B.7.1} Hardware,
INTEGRATED CIRCUITS, Types and Design Styles,
Algorithms implemented in hardware.",
}
@InProceedings{A:1989:SSG,
author = "R. A. and J. r. Ravenscroft and E. A. Lamagna",
title = "Symbolic summation with generating functions",
crossref = "Gonnet:1989:PAI",
pages = "228--233",
year = "1989",
bibdate = "Thu Mar 12 08:33:50 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/74540/p228-ravenscroft/",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory",
subject = "{\bf G.2.1} Mathematics of Computing, DISCRETE
MATHEMATICS, Combinatorics, Generating functions. {\bf
I.1.2} Computing Methodologies, SYMBOLIC AND ALGEBRAIC
MANIPULATION, Algorithms, Analysis of algorithms. {\bf
G.1.3} Mathematics of Computing, NUMERICAL ANALYSIS,
Numerical Linear Algebra, Linear systems (direct and
iterative methods).",
}
@InProceedings{Abbot:1989:RAN,
author = "J. Abbot",
title = "Recovery of algebraic numbers from their $p$-adic
approximations",
crossref = "Gonnet:1989:PAI",
pages = "112--120",
year = "1989",
bibdate = "Thu Sep 26 06:21:35 MDT 1996",
abstract = "The author describes three ways to generalize
Lenstra's algebraic integer recovery method. One
direction adapts the algorithm so that rational numbers
are automatically produced given only upper bounds on
the sizes of the numerators and denominators. Another
direction produces a variant which recovers algebraic
numbers as elements of multiple generator algebraic
number fields. The third direction explains how the
method can work if a reducible minimal polynomial had
been given for an algebraic generator. Any two or all
three of the generalisations may be employed
simultaneously.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Rensselaer Polytech. Inst.,
Troy, NY, USA",
classification = "C1110 (Algebra); C4130 (Interpolation and function
approximation); C4240 (Programming and algorithm
theory)",
keywords = "Algebraic generator; Algebraic integer recovery
method; Algebraic numbers; Computer algebra;
Denominators; Factorisation; Lenstra; Multiple
generator algebraic number fields; Numerators; P-adic
approximations; Rational numbers; Reducible minimal
polynomial; Upper bounds",
thesaurus = "Computation theory; Number theory; Polynomials; Symbol
manipulation",
}
@InProceedings{Abbott:1989:RAN,
author = "John Abbott",
title = "Recovery of algebraic numbers from their $p$-adic
approximations",
crossref = "Gonnet:1989:PAI",
pages = "112--120",
year = "1989",
bibdate = "Thu Mar 12 08:33:50 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/74540/p112-abbott/",
acknowledgement = ack-nhfb,
keywords = "algorithms; theory",
subject = "{\bf G.1.2} Mathematics of Computing, NUMERICAL
ANALYSIS, Approximation. {\bf I.1.2} Computing
Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION,
Algorithms, Algebraic algorithms. {\bf F.2.1} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Numerical Algorithms and Problems,
Computations on polynomials.",
}
@InProceedings{Abdali:1989:EQR,
author = "S. K. Abdali and D. S. Wiset",
title = "Experiments with quadtree representation of matrices",
crossref = "Gianni:1989:SAC",
pages = "96--108",
year = "1989",
bibdate = "Thu Sep 26 06:21:35 MDT 1996",
abstract = "The quadtrees matrix representation has been recently
proposed as an alternative to the conventional linear
storage of matrices. If all elements of a matrix are
zero, then the matrix is represented by an empty tree;
otherwise it is represented by a tree consisting of
four subtrees, each representing, recursively, a
quadrant of the matrix. Using four-way block
decomposition, algorithms on quadtrees accelerate on
blocks entirely of zeros, and thereby offer improved
performance on sparse matrices. The paper reports the
results of experiments done with a quadtree matrix
package implemented in REDUCE to compare the
performance of quadtree representation with REDUCE's
built-in sequential representation of matrices. Tests
on addition, multiplication, and inversion of dense,
triangular, tridiagonal, and diagonal matrices (both
symbolic and numeric) of sizes up to 100*100 show that
the quadtree algorithms perform well in a broad range
of circumstances, sometimes running orders of magnitude
faster than their sequential counterparts.",
acknowledgement = ack-nhfb,
affiliation = "Tektronix Labs., Beaverton, OR, USA",
classification = "C1110 (Algebra); C1160 (Combinatorial mathematics);
C4140 (Linear algebra); C6120 (File organisation);
C7310 (Mathematics)",
keywords = "Addition; Dense matrices; Diagonal matrices; Empty
tree; Four-way block decomposition; Inversion;
Multiplication; Performance comparison; Quadrant;
Quadtree algorithms; Quadtree matrix package; Quadtrees
matrix representation; REDUCE; Sparse matrices;
Subtrees; Triangular matrices; Tridiagonal matrices;
Zero elements",
thesaurus = "Data structures; Mathematics computing; Matrix
algebra; Trees [mathematics]",
}
@InProceedings{Abdulrab:1989:EW,
author = "H. Abdulrab",
title = "Equations in words",
crossref = "Gianni:1989:SAC",
pages = "508--520",
year = "1989",
bibdate = "Thu Sep 26 06:21:35 MDT 1996",
abstract = "The study of equations in words was introduced by
Lentin (1972). There is always a solution for any
equation with no constant. Makanin (1977) showed that
solving equations with constants is decidable. Pecuchet
(1981) unified the two theories of equations with or
without constants and gave a new description of
Makanin's algorithm. This paper describes some new
results in the field of solving equations in words.",
acknowledgement = ack-nhfb,
affiliation = "LITP, Fac. des Sci., Mont Saint Aignan, France",
classification = "C4210 (Formal logic)",
keywords = "Decidable; Equations in words",
thesaurus = "Decidability",
}
@InProceedings{Abhyankar:1989:CAC,
author = "S. S. Abhyankar and C. L. Bajaj",
title = "Computations with algebraic curves",
crossref = "Gianni:1989:SAC",
pages = "274--284",
year = "1989",
bibdate = "Thu Sep 26 06:21:35 MDT 1996",
abstract = "The authors present a variety of computational
techniques dealing with algebraic curves both in the
plane and in space. The main results are polynomial
time algorithms: (1) to compute the genus of plane
algebraic curves; (2) to compute the rational
parametric equations for implicitly defined rational
plane algebraic curves of arbitrary degree; (3) to
compute birational mappings between points on
irreducible space curves and points on projected plane
curves and thereby to compute the genus and rational
parametric equations for implicitly defined rational
space curves of arbitrary degree; and (4) to check for
the faithfulness (one to one) of parameterizations.",
acknowledgement = ack-nhfb,
affiliation = "Purdue Univ., West Lafayette, IN, USA",
classification = "C4130 (Interpolation and function approximation);
C4190 (Other numerical methods)",
keywords = "Algebraic curves; Birational mappings; Computational
techniques; Irreducible space curves; Polynomial time
algorithms; Rational parametric equations",
thesaurus = "Computational geometry; Polynomials",
}
@InProceedings{Alonso:1989:CAS,
author = "M. E. Alonso and T. Mora and M. Raimondo",
title = "Computing with algebraic series",
crossref = "Gonnet:1989:PAI",
pages = "101--111",
year = "1989",
bibdate = "Thu Mar 12 08:33:50 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/74540/p101-alonso/",
abstract = "The authors develop a computational model for
algebraic formal power series, based on a symbolic
codification of the series by means of the implicit
function theorem: i.e. they consider algebraic series
as the unique solutions of suitable functional
equations. They show that most of the usual local
commutative algebra can be effectively performed on
algebraic series, since they can reduce to the
polynomial case, where the tangent cone algorithm can
be used to effectively perform local algebra. The main
result to the paper is an effective version of
Weierstrass theorems, which allows effective
elimination theory for algebraic series and an
effective noether normalization lemma.",
acknowledgement = ack-nhfb,
affiliation = "Univ. Complutense, Madrid, Spain",
classification = "C1110 (Algebra); C1120 (Analysis); C4150 (Nonlinear
and functional equations); C4240 (Programming and
algorithm theory)",
keywords = "Algebraic formal power series; Algebraic series;
algorithms; Computational model; Elimination theory;
Functional equations; Implicit function theorem; Local
commutative algebra; Noether normalization lemma;
Polynomial; Symbolic codification; Tangent cone
algorithm; theory; Weierstrass theorems",
subject = "{\bf I.1.2} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Algorithms, Algebraic
algorithms. {\bf F.4.1} Theory of Computation,
MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
Logic, Computational logic.",
thesaurus = "Computability; Functional equations; Polynomials;
Series [mathematics]; Symbol manipulation",
}
@InProceedings{Arnborg:1989:EPO,
author = "S. Arnborg",
title = "Experiments with a projection operator for algebraic
decomposition",
crossref = "Gianni:1989:SAC",
pages = "177--182",
year = "1989",
bibdate = "Thu Sep 26 06:21:35 MDT 1996",
abstract = "Reports an experiment with the projection phase of an
algebraic decomposition problem. The decomposition
asked for is a collection of rational sample points, at
least one in each full-dimensional region of a
decomposition, sign-invariant with respect to a set of
polynomials and with a cylindrical structure. Such a
decomposition is less general than a cylindrical
algebraic decomposition, but still useful for purposes
such as solving collision and motion planning problems
in theoretical robotics. Specifically, there is no
information about the structure of less than
full-dimensional regions and intersections between
projections of regions. This makes quantifier
elimination with alternating quantifiers difficult or
impossible.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Numer. Anal. and Comput. Sci., R. Inst. of
Technol., Stockholm, Sweden",
classification = "C1110 (Algebra)",
keywords = "Algebraic decomposition; Cylindrical structure;
Full-dimensional region; Polynomials; Projection
operator; Projection phase; Rational sample points;
Sign-invariant",
thesaurus = "Algebra; Polynomials",
}
@InProceedings{Ausiello:1989:DMP,
author = "G. Ausiello and A. Marchetti Spaccamela and U. Nanni",
title = "Dynamic maintenance of paths and path expressions on
graphs",
crossref = "Gianni:1989:SAC",
pages = "1--12",
year = "1989",
bibdate = "Thu Sep 26 06:21:35 MDT 1996",
abstract = "In several applications it is necessary to deal with
data structures that may dynamically change during a
sequence of operations. In these cases the classical
worst case analysis of the cost of a single operation
may not adequately describe the behaviour of the
structure but it is rather more meaningful to analyze
the cost of the whole sequence of operations. The paper
first discusses some results on maintaining paths in
dynamic graphs. Besides, it considers paths problems on
dynamic labeled graphs and shows how to maintain path
expressions in the acyclic case when insertions of new
arcs are allowed.",
acknowledgement = ack-nhfb,
affiliation = "Dipartimento di Inf. e Sistemistica, Rome Univ.,
Italy",
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory); C6120 (File
organisation)",
keywords = "Acyclic case; Data structures; Dynamic graphs; Dynamic
labeled graphs; Dynamic maintenance; Insertions; New
arcs; Path expressions; Paths problems",
thesaurus = "Computational complexity; Data structures; Graph
theory",
}
@InProceedings{Avenhaus:1989:URT,
author = "J. Avenhaus and D. Wi{\ss}mann",
title = "Using rewriting techniques to solve the generalized
word problem in polycyclic groups",
crossref = "Gonnet:1989:PAI",
pages = "322--337",
year = "1989",
bibdate = "Thu Mar 12 08:33:50 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/74540/p322-avenhaus/",
abstract = "The authors apply rewriting techniques to the
generalized word problem GWP in polycyclic groups. They
assume the group $G$ to be given by a canonical
polycyclic string-rewriting system $R$ and consider GWP
in $G$ which is defined by $GWP(w,U)$ iff $w$ in $<U>$
for $w$ in $G$, finite $U$ contained in $G$, where
$<U>$ is the subgroup of $G$ generated by $U$. They
describe $<U>$ also by a rewrite system $S$ and define
a rewrite relation $\mbox{implies}_{S,R}$ in such a way
that $w$ implied by * $\mbox{implies}_{S,R} \lambda$
iff $w$ in $<U>$ ($\lambda$ the empty word). For this
rewrite relation the authors develop different critical
pair criteria for $\mbox{implies}_{S,R}$ to be
$\lambda$-confluent, i.e. confluent on the
left-congruence class $(\lambda )$ of implied by *
$\mbox{implies}_{S,R}$. Using any of these
$\lambda$-confluence criteria they construct a
completion procedure which stops for every input $S$
and computes a $\lambda$-confluent rewrite system
equivalent to $S$. This leads to a decision procedure
for GWP in G. Thus the authors give an explicit uniform
algorithm for deciding GWP in polycyclic groups and a
new proof based almost only on rewriting techniques for
the decidability of this problem. Further, they define
a rewrite relation $\mbox{implies}_{LM,U}$ which is
stronger than $\mbox{implies}_{S,R}$. They show that if
$G$ is given by a nilpotent string-rewriting system,
then by a completion procedure the input $U$ can be
transformed into $V$ such that $\mbox{implies}_{LM,V}$
is even confluent, not just $\lambda$-confluent.",
acknowledgement = ack-nhfb,
affiliation = "Fachbereich Inf., Kaiserslautern Univ., West Germany",
classification = "C1110 (Algebra); C4210 (Formal logic)",
keywords = "$\Lambda$-confluent; algorithms; Canonical polycyclic
string-rewriting system; Completion procedure; Critical
pair criteria; Decidability; design; Explicit uniform
algorithm; Generalized word problem; Group theory;
Nilpotent string-rewriting system; Polycyclic groups;
Rewrite relation; Rewriting techniques; theory",
subject = "{\bf F.4.2} Theory of Computation, MATHEMATICAL LOGIC
AND FORMAL LANGUAGES, Grammars and Other Rewriting
Systems. {\bf I.1.0} Computing Methodologies, SYMBOLIC
AND ALGEBRAIC MANIPULATION, General.",
thesaurus = "Decidability; Group theory; Rewriting systems; Symbol
manipulation",
}
@InProceedings{Bajaj:1989:FRP,
author = "C. Bajaj and J. Canny and T. Garrity and J. Warren",
title = "Factoring rational polynomials over the complexes",
crossref = "Gonnet:1989:PAI",
pages = "81--90",
year = "1989",
bibdate = "Thu Mar 12 08:33:50 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/74540/p81-bajaj/",
abstract = "The authors give NC algorithms for determining the
number and degrees of the absolute factors (factors
irreducible over the complex numbers $C$) of a
multivariate polynomial with rational coefficients. NC
is the class of functions computable by
logspace-uniform boolean circuits of polynomial size
and polylogarithmic dept. The measures of size of the
input polynomial are its degree $d$, coefficient length
$c$, number of variables $n$, and for sparse
polynomials, the number of nonzero coefficients $s$.
For the general case, the authors give a random
(Monte-Carlo) NC algorithm in these input measures. If
$n$ is fixed, or if the polynomial is dense, they give
a deterministic NC algorithm. The algorithm also works
in random NC for polynomial represented by
straight-line programs, provided the polynomial can be
evaluated at integer points in NC. The authors discuss
a method for obtaining an approximation to the
coefficients of each factor whose running time is
polynomial in the size of the original (dense)
polynomial. These methods rely on the fact that the
connected components of a complex hypersurface
$P(z_1,\ldots{},z_n)=0$ minus its singular points
correspond to the absolute factors of $P$.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Purdue Univ., Lafayette, IN,
USA",
classification = "C1110 (Algebra); C1160 (Combinatorial mathematics);
C4240 (Programming and algorithm theory)",
keywords = "Absolute factors; algorithms; Complex numbers;
Factorisation; Functions; Logspace-uniform boolean
circuits; measurement; Monte-Carlo; Multivariate
polynomial; NC algorithms; Rational coefficients;
Rational polynomials; Set theory; theory;
verification",
subject = "{\bf G.1.2} Mathematics of Computing, NUMERICAL
ANALYSIS, Approximation. {\bf F.4.1} Theory of
Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
Mathematical Logic, Mechanical theorem proving.",
thesaurus = "Approximation theory; Computability; Computational
complexity; Monte Carlo methods; Polynomials; Set
theory; Symbol manipulation",
xxauthor = "C. Bajaj and J. Canny and R. Garrity and J. Warren",
}
@InProceedings{Barkatou:1989:RLS,
author = "M. A. Barkatou",
title = "On the reduction of linear systems of difference
equations",
crossref = "Gonnet:1989:PAI",
pages = "1--6",
year = "1989",
bibdate = "Thu Mar 12 08:33:50 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/74540/p1-barkatou/",
abstract = "The author deals with linear systems of difference
equations whose coefficients admit generalized
factorial series representations at $z=\infty$. He
gives a criterion by which a given system is determined
to have a regular singularity. He gives an algorithm,
implementable in a computer algebra system, which
reduces in a finite number of steps the system of
difference equations on an irreducible form.",
acknowledgement = ack-nhfb,
affiliation = "Lab. TIM3-IMAG, Grenoble, France",
classification = "C1120 (Analysis); C4170 (Differential equations);
C7310 (Mathematics)",
keywords = "algorithms; Computer algebra system; Convergence;
Generalized factorial series; Irreducible form; Linear
difference equations; Regular singularity; theory",
subject = "{\bf G.1.7} Mathematics of Computing, NUMERICAL
ANALYSIS, Ordinary Differential Equations. {\bf G.1.3}
Mathematics of Computing, NUMERICAL ANALYSIS, Numerical
Linear Algebra, Linear systems (direct and iterative
methods).",
thesaurus = "Convergence; Difference equations; Linear differential
equations; Mathematics computing; Matrix algebra;
Series [mathematics]; Symbol manipulation",
}
@InProceedings{Barkatou:1989:RNA,
author = "M. A. Barkatou",
title = "Rational {Newton} algorithm for computing formal
solutions of linear differential equations",
crossref = "Gianni:1989:SAC",
pages = "183--195",
year = "1989",
bibdate = "Thu Sep 26 06:21:35 MDT 1996",
abstract = "Presents a new algorithm for solving linear
differential equations in the neighbourhood of an
irregular singular point. This algorithm is based upon
the same principles as the Newton algorithm, however it
has a lower cost and is more suitable for computing
algebra.",
acknowledgement = ack-nhfb,
affiliation = "CNRS, INPG, IMAG, Grenoble, France",
classification = "C1120 (Analysis); C4170 (Differential equations)",
keywords = "Formal solutions; Irregular singular point; Linear
differential equations; Neighbourhood; Rational Newton
algorithm",
thesaurus = "Linear differential equations",
}
@InProceedings{BoydelaTour:1989:FAS,
author = "T. {Boy de la Tour} and R. Caferra",
title = "A formal approach to some usually informal techniques
used in mathematical reasoning",
crossref = "Gianni:1989:SAC",
pages = "402--406",
year = "1989",
bibdate = "Mon Dec 01 16:57:16 1997",
abstract = "One of the striking characteristics of mathematical
reasoning is the contrast between the formal aspects of
mathematical truth and the informal character of the
ways to that truth. Among the many important and
usually informal mathematical activities the authors
are interested in proof analogy (i.e. common pattern
between proofs of different theorems) in the context of
interactive theorem proving.",
acknowledgement = ack-nhfb,
affiliation = "LIFIA-INPG, Grenoble, France",
classification = "C4210 (Formal logic)",
keywords = "Formal approach; Informal character; Interactive
theorem proving; Mathematical reasoning; Mathematical
truth; Usually informal techniques",
thesaurus = "Theorem proving",
}
@InProceedings{Bradford:1989:ETC,
author = "R. J. Bradford and J. H. Davenport",
title = "Effective tests for cyclotomic polynomials",
crossref = "Gianni:1989:SAC",
pages = "244--251",
year = "1989",
bibdate = "Thu Sep 26 06:21:35 MDT 1996",
abstract = "The authors present two efficient tests that determine
if a given polynomial is cyclotomic, or is a product of
cyclotomics. The first method uses the fact that all
the roots of a cyclotomic polynomial are roots of
unity, and the second the fact that the degree of a
cyclotomic polynomial is a value of $\phi (n)$, for
some $n$. The authors also find the cyclotomic factors
of any polynomial.",
acknowledgement = ack-nhfb,
affiliation = "Sch. of Math. Sci., Bath Univ., UK",
classification = "C4130 (Interpolation and function approximation)",
keywords = "Cyclotomic polynomials; Roots",
thesaurus = "Polynomials",
}
@InProceedings{Bradford:1989:SRD,
author = "R. Bradford",
title = "Some results on the defect",
crossref = "Gonnet:1989:PAI",
pages = "129--135",
year = "1989",
bibdate = "Thu Mar 12 08:33:50 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/74540/p129-bradford/",
abstract = "The defect of an algebraic number field (or, more
correctly, of a presentation of the field) is the
largest rational integer that divides the denominator
of any algebraic integer in the field when written
using that presentation. Knowing the defect, or
estimating it accurately is extremely valuable in many
algorithms, the factorization of polynomials over
algebraic number fields being a prime example. The
author presents a few results that are a move in the
right direction.",
acknowledgement = ack-nhfb,
affiliation = "Sch. of Math. Sci., Bath Univ., UK",
classification = "C1110 (Algebra); C1160 (Combinatorial mathematics);
C4130 (Interpolation and function approximation); C4240
(Programming and algorithm theory)",
keywords = "Algebraic integer; Algebraic number field; algorithms;
Defect; Factorization; Polynomials; Rational integer;
theory",
subject = "{\bf I.1.2} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Algorithms. {\bf G.1.2}
Mathematics of Computing, NUMERICAL ANALYSIS,
Approximation. {\bf G.1.4} Mathematics of Computing,
NUMERICAL ANALYSIS, Quadrature and Numerical
Differentiation. {\bf G.1.9} Mathematics of Computing,
NUMERICAL ANALYSIS, Integral Equations.",
thesaurus = "Computation theory; Number theory; Polynomials; Symbol
manipulation",
}
@InProceedings{Bronstein:1989:FRR,
author = "M. Bronstein",
title = "Fast reduction of the {Risch} differential equation",
crossref = "Gianni:1989:SAC",
pages = "64--72",
year = "1989",
bibdate = "Thu Sep 26 06:21:35 MDT 1996",
abstract = "Presents a weaker definition of weak-normality which:
can always be obtained in a tower of transcendental
elementary extensions, and gives an explicit formula
for the denominator of $y$, so the equation $y'+fy=g$
can be reduced to a polynomial equation in one
reduction step. As a consequence, a new algorithm is
obtained for solving y'+fy=g. The algorithm is very
similar to the one described by Rothstein (1976),
except that the present one uses weak normality to
prevent finite cancellation, rather than having to find
integer roots of polynomials over the constant field of
$K$ in order to detect it.",
acknowledgement = ack-nhfb,
affiliation = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
classification = "C1120 (Analysis); C4170 (Differential equations)",
keywords = "Denominator; Explicit formula; Fast reduction;
Polynomial equation; Reduction step; Risch differential
equation; Transcendental elementary extensions;
Weak-normality",
thesaurus = "Differential equations",
}
@InProceedings{Bronstein:1989:SRE,
author = "M. Bronstein",
title = "Simplification of real elementary functions",
crossref = "Gonnet:1989:PAI",
pages = "207--211",
year = "1989",
bibdate = "Thu Mar 12 08:33:50 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/74540/p207-bronstein/",
abstract = "The author describes an algorithm, based on Risch's
real structure theorem, that determines explicitly all
the algebraic relations among a given set of real
elementary functions. He provides examples from its
implementation in the scratchpad computer algebra
system that illustrate the advantages over the use of
complex logarithms and exponentials.",
acknowledgement = ack-nhfb,
affiliation = "IBM Res. Div., T. J. Watson Res. Center, Yorktown
Heights, NY, USA",
classification = "C1110 (Algebra); C7310 (Mathematics)",
keywords = "algorithms; Computer algebra system; Real elementary
functions; Real structure theorem; Scratchpad; theory",
subject = "{\bf I.1.3} Computing Methodologies, SYMBOLIC AND
ALGEBRAIC MANIPULATION, Languages and Systems. {\bf
G.1.7} Mathematics of Computing, NUMERICAL ANALYSIS,
Ordinary Differential Equations.",
thesaurus = "Functions; Mathematics computing; Symbol
manipulation",
}
@InProceedings{Brown:1989:SPP,
author = "C. Brown and G. Cooperman and L. Finkelstein",
title = "Solving permutation problems using rewriting systems",
crossref = "Gianni:1989:SAC",
pages = "364--377",
year = "1989",
bibdate = "Thu Sep 26 06:21:35 MDT 1996",
abstract = "A new approach is described for finding short
expressions for arbitrary elements of a permutation
group in terms of the original generators which uses
rewriting methods. This forms an important component in
a long term plan to find short solutions for `large'
permutation problems (such as Rubik's cube), which are
difficult to solve by existing search techniques. In
order for this methodology to be successful, it is
important to start with a short presentation for a
finite permutation group. A new method is described for
giving a presentation for an arbitrary permutation
group acting on $n$ letters. This can be used to show
that any such permutation group has a presentation with
at most $n-1$ generators and $(n-1)^2$ relations. As an
application of this method, an $O(n^4)$ algorithm is
described for determining if a set of generators for a
permutation group of $n$ letters is a strong generating
set (in the sense of Sims). The `back end' includes a
novel implementation of the Knuth--Bendix technique on
symmetrization classes for groups.",
acknowledgement = ack-nhfb,
affiliation = "Coll. of Comput. Sci., Northeastern Univ., Boston, MA,
USA",
classification = "C4210 (Formal logic)",
keywords = "Knuth--Bendix technique; Permutation problems;
Rewriting systems",
thesaurus = "Rewriting systems",
}
@InProceedings{Butler:1989:CVU,
author = "G. Butler and J. Cannon",
title = "{Cayley}, version 4: the user language",
crossref = "Gianni:1989:SAC",
pages = "456--466",
year = "1989",
bibdate = "Thu Sep 26 06:21:35 MDT 1996",
abstract = "Cayley, version 4, is a proposed knowledge-based
system for modern algebra. The proposal integrates the
existing powerful algorithm base of Cayley with modest
deductive facilities and large sophisticated databases
of groups and related algebraic structures. The outcome
will be a revolutionary computer algebra system. The
user language of Cayley, version 4, is the first stage
of the project to develop a computer algebra system
which integrates algorithmic, deductive, and factual
knowledge. The language plays an important role in
shaping the users' communication of their knowledge to
the system, and in presenting the results to the user.
The very survival of a system depends upon its
acceptance by the users, so the language must be
natural, extensible, and powerful. The major changes in
the language (over version 3) are the definitions of
algebraic structures, set constructors and associated
control structures, the definitions of maps and
homomorphisms, the provision of packages for procedural
abstraction and encapsulation, database facilities, and
other input/output. The motivation for these changes
has been the need to provide facilities for a
knowledge-based system; to allow sets to be defined by
properties; and to remove semantic ambiguities of
structure definitions.",
acknowledgement = ack-nhfb,
affiliation = "Sydney Univ., NSW, Australia",
classification = "C6170 (Expert systems); C7310 (Mathematics)",
keywords = "Algebra; Algebraic structures; Associated control
structures; Cayley; Computer algebra system; Deductive
facilities; Encapsulation; Factual knowledge;
Homomorphisms; Knowledge-based system; Procedural
abstraction; Set constructors; Sophisticated databases;
User language; Version 4",
thesaurus = "Knowledge based systems; Symbol manipulation",
}
@InProceedings{Cabay:1989:FRA,
author = "S. Cabay and G. Labahn",
title = "A fast, reliable algorithm for calculating
{Pad{\'e}--Hermite} forms",
crossref = "Gonnet:1989:PAI",
pages = "95--100",
year = "1989",
bibdate = "Thu Mar 12 08:33:50 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/74540/p95-cabay/",
abstract = "The authors present a new fast algorithm for the
calculation of a Pad{\'e}--Hermite form for a vector of
power series. When the vector of power series is
normal, the algorithm is shown to calculate a
Pad{\'e}--Hermite form of type $(n_0, \ldots{}, n_k)$
in $O(k.(n_0^2+\ldots{} +n_k^2))$ operations. This
complexity is the same as that of other fast algorithms
for computing Pad{\'e}--Hermite approximants. However,
unlike other algorithms, the new algorithm also
succeeds in the nonnormal case, usually with only a
moderate increase in cost.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta.,
Canada",
classification = "C1120 (Analysis); C4130 (Interpolation and function
approximation); C4240 (Programming and algorithm
theory)",
keywords = "algorithms; Complexity; Iterative methods; Nonnormal
case; Pad{\'e}--Hermite approximants; Pad{\'e}--Hermite
forms; theory; Vector of power series",
subject = "{\bf F.2.1} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms
and Problems. {\bf G.1.2} Mathematics of Computing,
NUMERICAL ANALYSIS, Approximation. {\bf G.1.7}
Mathematics of Computing, NUMERICAL ANALYSIS, Ordinary
Differential Equations. {\bf G.1.9} Mathematics of
Computing, NUMERICAL ANALYSIS, Integral Equations.",
thesaurus = "Computational complexity; Iterative methods; Linear
differential equations; Series [mathematics]; Vectors",
}
@InProceedings{Canny:1989:GCP,
author = "J. Canny",
title = "Generalized characteristic polynomials",
crossref = "Gianni:1989:SAC",
pages = "293--299",
year = "1989",
bibdate = "Thu Sep 26 06:21:35 MDT 1996",
abstract = "The author generalises the notion of characteristic
polynomial for a system of linear equations to systems
of multivariate polynomial equations. The
generalization is natural in the sense that it reduces
to the usual definition when all the polynomials are
linear. Whereas the constant coefficient of the
characteristic polynomial of a linear system is the
determinant, the constant coefficient of the general
characteristic polynomial is the resultant of the
system. This construction is applied to solve a
traditional problem with efficient methods for solving
systems of polynomial equations: the presence of
infinitely many solutions `at infinity'. The author
gives a single-exponential time method for finding all
the isolated solution points of a system of
polynomials, even in the presence of infinitely many
solutions at infinity or elsewhere.",
acknowledgement = ack-nhfb,
affiliation = "Div. of Comput. Sci., California Univ., Berkeley, CA,
USA",
classification = "C4130 (Interpolation and function approximation)",
keywords = "Generalised characteristic polynomials; Multivariate
polynomial equations; Single-exponential time method;
System of linear equations",
thesaurus = "Polynomials",
}
@InProceedings{Canny:1989:SSN,
author = "J. F. Canny and E. Kaltofen and L. Yagati",
title = "Solving systems of non-linear polynomial equations
faster",
crossref = "Gonnet:1989:PAI",
pages = "121--128",
year = "1989",
bibdate = "Thu Mar 12 08:33:50 MST 1998",
bibsource = "http://www.acm.org/pubs/toc/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/74540/p121-canny/",
abstract = "Finding the solution to a system of $n$ non-linear
polynomial equations in $n$ unknowns over a given
field, say the algebraic closure of the coefficient
field, is a classical and fundamental problem in
computational algebra. The authors give a method that
allows the computation of resultants and $u$-resultants
of polynomial systems in essentially linear space and
quadratic time. The algorithm constitutes the first
improvement over Gaussian elimination-based methods for
computing these fundamental invariants.",
acknowledgement = ack-nhfb,
affiliation = "Div. of Comp. Sci., California Univ., Berkeley, CA,
USA",
classification = "C1110 (Algebra); C1120 (Analysis); C4130
(Interpolation and function approximation); C4150
(Nonlinear and functional equations); C4240
(Programming and algorithm theory)",
keywords = "Algebraic closure; algorithms; Coefficient field;
Computational algebra; Computational complexity; Linear
space; Nonlinear polynomial equations; Quadratic time;
Resultants; theory; U-resultants",
subject = "{\bf F.2.1} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms
and Problems, Computations on polynomials. {\bf G.1.5}
Mathematics of Computing, NUMERICAL ANALYSIS, Roots of
Nonlinear Equations, Systems of equations. {\bf I.1.2}
Computing Methodologies, SYMBOLIC AND ALGEBRAIC
MANIPULATION, Algorithms. {\bf G.1.1} Mathematics of
Computing, NUMERICAL ANALYSIS, Interpolation.",
thesaurus = "Computational complexity; Nonlinear equations;
Polynomials; Symbol manipulation",
}
@InProceedings{Cantone:1989:DPE,
author = "D. Cantone and V. Cutello and A. Ferro",
title = "Decision procedures for elementary sublanguages of set
theory. {XIV}. {Three} languages involving rank related
constructs",
crossref = "Gianni:1989:SAC",
pages = "407--422",
year = "1989",
bibdate = "Thu Sep 26 06:21:35 MDT 1996",
abstract = "The authors present three decidability results for
some quantifier-free and quantified theories of sets
involving rank related constructs.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Courant Inst. of Math. Sci.,
New York Univ., NY, USA",
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
keywords = "Decidability results; Decision procedures; Elementary
sublanguages; Quantified theories; Quantifier-free;
Rank related constructs; Set theory",
thesaurus = "Decidability; Formal logic; Set theory",
}
@InProceedings{Caprasse:1989:CEB,
author = "H. Caprasse and J. Demaret and E. Schrufer",
title = "Can {EXCALC} be used to investigate high-dimensional
cosmological models with nonlinear {Lagrangians}?",
crossref =