%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "2.44",
%%%     date            = "03 December 2014",
%%%     time            = "09:25:05 MDT",
%%%     filename        = "jsymcomp.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        = "64207 56848 222140 2345406",
%%%     email           = "beebe at math.utah.edu, beebe at acm.org,
%%%                        beebe at computer.org (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     keywords        = "bibliography, BibTeX, Journal of Symbolic
%%%                        Computation",
%%%     license         = "public domain",
%%%     supported       = "yes",
%%%     docstring       = "This file contains a COMPLETE bibliography of
%%%                        publications in the Journal of Symbolic
%%%                        Computation (CODEN JSYCEH, ISSN 0747-7171),
%%%                        originally published by Academic Press (London,
%%%                        UK), and now by Elsevier.
%%%
%%%                        The journal began publishing quarterly in
%%%                        March 1985, then bimonthly in 1987--1988, and
%%%                        then monthly since January 1989.  Despite
%%%                        monthly publication, there are only six
%%%                        issues per volume, so there are two volumes
%%%                        yearly since 1989.
%%%
%%%                        The journal has a World Wide Web site at
%%%
%%%                            http://www.sciencedirect.com/science/journal/07477171
%%%
%%%                        The journal editor maintains a Web page at
%%%
%%%                            http://www4.ncsu.edu:8030/~hong/jsc/jsc.bib
%%%
%%%                        with a cumulative bibliography of the
%%%                        journal; the data there has been merged into
%%%                        this file for version 2.00, with many
%%%                        corrections.
%%%
%%%                        At version 2.44, the year coverage looked
%%%                        like this:
%%%
%%%                             1985 (  30)    1996 (  72)    2007 (  63)
%%%                             1986 (  28)    1997 (  85)    2008 (  51)
%%%                             1987 (  47)    1998 (  77)    2009 ( 113)
%%%                             1988 (  50)    1999 (  70)    2010 (  81)
%%%                             1989 (  68)    2000 (  92)    2011 (  99)
%%%                             1990 (  82)    2001 (  92)    2012 (  99)
%%%                             1991 (  64)    2002 (  82)    2013 ( 126)
%%%                             1992 (  69)    2003 (  87)    2014 (  27)
%%%                             1993 (  79)    2004 (  92)    2015 (  49)
%%%                             1994 (  65)    2005 (  80)
%%%                             1995 (  76)    2006 (  85)
%%%
%%%                             Article:       2280
%%%
%%%                             Total entries: 2280
%%%
%%%                        Hypertext Web links to www.idealibrary.com in
%%%                        BibTeX entries should forward automatically
%%%                        to somewhere in the www.sciencedirect.com
%%%                        domain.  Regrettably, ScienceDirect at
%%%                        present does not make DOI (digital object
%%%                        identifier) data easily available, so it has
%%%                        not been possible to include compact URL or
%%%                        DOI values in BibTeX entries for journal
%%%                        articles after March 2002.
%%%
%%%                        The initial draft of this bibliography was
%%%                        derived from the OCLC Contents1st database,
%%%                        after conversion to BibTeX form, and
%%%                        extensive editing and correction.  This was
%%%                        then augmented with entries from the author's
%%%                        personal bibliography files, from the IEEE
%%%                        INSPEC database (1986--1996), from the
%%%                        MathSciNet database, from the computer
%%%                        graphics bibliography archive at
%%%                        ftp.siggraph.org, and from a very large
%%%                        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.  Where multiple sources
%%%                        of a particular entry existed, field values
%%%                        have been manually merged to preserve maximal
%%%                        information.
%%%
%%%                        Regrettably, the OCLC database does not
%%%                        usually record final page numbers of
%%%                        journal articles, so there were originally
%%%                        many page ranges of the form 123--?? in
%%%                        this bibliography.  At version 1.09, only
%%%                        about 40 such entries remained after
%%%                        merging bibliographic data from other
%%%                        sources.
%%%
%%%                        Although coverage is now believed to be
%%%                        complete, a substantial number of
%%%                        uncertainties remain in page ranges, and
%%%                        sometimes in author names or article titles.
%%%                        These are indicated by doubled queries (??)
%%%                        in the value strings, or by keywords
%%%                        beginning `xx'.  My local university library
%%%                        does not have this journal, so I have no way
%%%                        of checking the original journal issues.
%%%
%%%                        In this bibliography, entries are sorted in
%%%                        publication order, using bibsort -byvolume.
%%%
%%%                        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{
    "\hyphenation{
        Ha-da-mard
        La-zard
        Schwartz-bach
        Wau-po-titsch
    }"
    # "\ifx \undefined \bold   \def \bold #1{{\bf#1}} \fi"
    # "\ifx \undefined \cprime \def \cprime {$\mathsurround=0pt '$}\fi"
    # "\ifx \undefined \ocirc  \def \ocirc #1{{\accent'27#1}}\fi"
    # "\ifx \undefined \mathbb \def \mathbb #1{{\bf #1}}\fi"
    # "\ifx \undefined \mathcal \def \mathcal #1{{\cal #1}}\fi"
    # "\ifx \undefined \mathrm \def \mathrm #1{{\rm #1}}\fi"
}

%%% ====================================================================
%%% 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-J-SYMBOLIC-COMP       = "Journal of Symbolic Computation"}

%%% ====================================================================
%%% Bibliography entries:

@Article{Editors:1985:SCE,
  author =       "Editors",
  title =        "Symbolic Computation (An Editorial)",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "1",
  pages =        "1--6",
  month =        mar,
  year =         "1985",
  bibdate =      "Wed Feb 22 07:40:30 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Editorial",
}

@Article{Paul:1985:EMF,
  author =       "Etienne Paul",
  title =        "Equational Methods in First Order Predicate Calculus",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "1",
  pages =        "7--29",
  month =        mar,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B35 (03C05 68T15)",
  MRnumber =     "87i:03014",
  MRreviewer =   "Alexander Leitsch",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/obscure.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Equational Reasoning, Automated Theorem Proving, First
                 Order Logic",
}

@Article{Eder:1985:PSU,
  author =       "Elmar Eder",
  key =          "Eder85",
  title =        "Properties of Substitutions and Unifications",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "1",
  pages =        "31--46",
  month =        mar,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35)",
  MRnumber =     "87f:68079",
  MRreviewer =   "Alexander Leitsch",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "Ai/prolog.1.bib;
                 http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Misc/formal.hardware.verification.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keyword =      "Logic",
  keywords =     "prolog; Unification",
}

@Article{Chazelle:1985:OSC,
  author =       "B. Chazelle and H. Edelsbrunner",
  title =        "Optimal Solutions for a Class of Point Retrieval
                 Problems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "1",
  pages =        "47--56",
  month =        mar,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68U05",
  MRnumber =     "87a:68145",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Computational Geometry",
}

@Article{Kaltofen:1985:FPA,
  author =       "Erich Kaltofen",
  title =        "Fast Parallel Absolute Irreducibility Testing",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "1",
  pages =        "57--67",
  month =        mar,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12-04 (11Y16 68Q40)",
  MRnumber =     "87b:12002",
  MRreviewer =   "A. K. Lenstra",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "See errata \cite{Kaltofen:1990:EFP}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Factorization",
}

@Article{Pavelle:1985:M,
  author =       "Richard Pavelle and Paul S. Wang",
  title =        "{MACSYMA} from $ {F} $ to $ {G} $",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "1",
  pages =        "69--100",
  month =        mar,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (65-04)",
  MRnumber =     "810 136",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "Distributed/QLD.bib; Distributed/QLD/1985.bib;
                 http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/auto.diff.bib",
  acknowledgement = ack-nhfb,
  annote =       "A descriptive, non-technical tutorial on macsyma, a
                 well-known and widely used computer algebra system, is
                 presented. Several examples of its capabilities are
                 exhibited using actual Macsyma input and output. A
                 discussion of computer-based symbolic mathematical
                 computation is motivated by pointing out inherent
                 difficulties with familiar numeric computations. The
                 inner workings of computer algebra systems are briefly
                 discussed in addition to some",
  country =      "USA",
  date =         "14/08/85",
  descriptors =  "MACSYMA; survey; SYMBOLIC ALGEBRAIC LANGUAGE;",
  enum =         "2386",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "MACSYMA",
  language =     "English",
  location =     "RWTH-AC-DFV: TELL; PKI-OG: Li-Ord.Le",
  references =   "30",
  referred =     "[Char91a]; [Gold91a].",
  revision =     "21/04/91",
}

@Article{Gerdt:1985:CAA,
  author =       "V. P. Gerdt and A. B. Shvachka and A. Yu. Zharkov",
  title =        "Computer algebra application for classification of
                 integrable non-linear evolution equations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "1",
  pages =        "101--107",
  month =        mar,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "35Q20 (35-04 58G37 65M99)",
  MRnumber =     "87d:35116",
  MRreviewer =   "S. V. Duzhin",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/cathode.bib; Theory/Comp.Alg.1.bib;
                 Theory/reduce.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Differential Equations, FORMAC; integrability tests
                 PDEs oderef, Reduce",
}

@Article{Kolbig:1985:EEC,
  author =       "K. S. K{\"o}lbig",
  title =        "Explicit Evaluation of Certain Definite Integrals
                 Involving Powers of Logarithms",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "1",
  pages =        "109--114",
  month =        mar,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "65D15 (65-04)",
  MRnumber =     "87b:65023",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/Comp.Alg.1.bib; Theory/reduce.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Definite Integration; Reduce",
}

@Article{Bibel:1985:BPI,
  author =       "W. Bibel and K. Aspetsberger",
  title =        "A Bibliography on Parallel Inference Machines",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "1",
  pages =        "115--118",
  month =        mar,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68-00 (03B35)",
  MRnumber =     "810 139",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Misc/Functional.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "functional architecture bibliography hardware symbolic
                 computation; Parallel Computation, Parallel Machines",
}

@Article{Biermann:1985:APT,
  author =       "A. W. Biermann",
  title =        "Automatic Programming: a Tutorial on Formal
                 Methodologies",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "2",
  pages =        "119--142",
  month =        jun,
  year =         "1985",
  bibdate =      "Wed Feb 22 07:40:30 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Automatic Programming",
}

@Article{Butler:1985:ECG,
  author =       "Gregory Butler",
  title =        "Effective Computations with Group Homomorphisms",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "2",
  pages =        "143--158 (or 143--157??)",
  month =        jun,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (20-04 20B99)",
  MRnumber =     "87b:68057",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Computational Group Theory",
  xxtitle =      "Effective computation with group homomorphisms",
}

@Article{Barton:1985:PDA,
  author =       "David R. Barton and Richard Zippel",
  title =        "Polynomial Decomposition Algorithms",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "2",
  pages =        "159--168",
  month =        jun,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12-04 (11C08 12E05 68Q40)",
  MRnumber =     "87b:12001",
  MRreviewer =   "Maurice Mignotte",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Polynomial Decomposition",
}

@Article{Borodin:1985:DND,
  author =       "Allan Borodin and Ronald Fagin and John E. Hopcroft
                 and Martin Tompa",
  title =        "Decreasing the Nesting Depth of Expressions Involving
                 Square Roots",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "2",
  pages =        "169--188",
  month =        jun,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (12F05)",
  MRnumber =     "87a:68087",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Simplification",
}

@Article{Zippel:1985:SEI,
  author =       "Richard Zippel",
  title =        "Simplification of Expressions Involving Radicals",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "2",
  pages =        "189--210",
  month =        jun,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (12-04)",
  MRnumber =     "87b:68058",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Simplification",
}

@Article{Fitch:1985:SAP,
  author =       "John P. Fitch",
  title =        "Solving algebraic problems with {REDUCE}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "2",
  pages =        "211--228 (or 211--227??)",
  month =        jun,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Feb 22 07:40:30 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/auto.diff.bib; Theory/Comp.Alg.1.bib;
                 Theory/reduce.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Reduce",
  referred =     "[Char91a].",
}

@Article{Schwarz:1985:ADP,
  author =       "Fritz Schwarz",
  title =        "An Algorithm for Determining Polynomial First
                 Integrals of Autonomous Systems of Ordinary
                 Differential Equations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "2",
  pages =        "229--234 (or 229--233??)",
  month =        jun,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "34A45 (58F05)",
  MRnumber =     "818 879",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/cathode.bib; Theory/Comp.Alg.1.bib;
                 Theory/reduce.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Differential Equations; REDUCE; Gr{\"o}bner Bases;
                 Reduce; ODEs first integrals",
}

@Article{Navarro-Saad:1985:AFT,
  author =       "Miguel Navarro-Saad and Kurt Bernardo Wolf",
  title =        "Applications of a Factorization Theorem for
                 Ninth-order Aberration Optics",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "2",
  pages =        "235--240 (or 235--239??)",
  month =        jun,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "78A05 (78-04)",
  MRnumber =     "87b:78003",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Factorization, Optics, REDUCE",
  xxtitle =      "Applications of a factorisation theorem for
                 ninth-order aberration optics",
}

@Article{Coppersmith:1985:AF,
  author =       "D. Coppersmith and J. H. Davenport",
  title =        "An Application of Factoring",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "2",
  pages =        "241--243",
  month =        jun,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11T71 (11Y16 68Q40)",
  MRnumber =     "87b:11125",
  MRreviewer =   "Kevin S. McCurley",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Factorization, Logarithms, Cryptography, SCRATCHPAD",
}

@Article{Bibel:1985:AI,
  author =       "W. Bibel",
  title =        "Automated Inferencing",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "3",
  pages =        "245--260",
  month =        sep,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B35 (68T15)",
  MRnumber =     "88b:03018",
  MRreviewer =   "L. W. Szczerba",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Automated Theorem Proving",
}

@Article{Lazard:1985:IBP,
  author =       "D. Lazard",
  title =        "Ideal Bases and Primary Decomposition: Case of Two
                 Variables",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "3",
  pages =        "261--270",
  month =        sep,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13A15 (13F20 68Q40)",
  MRnumber =     "87k:13001",
  MRreviewer =   "R. K. Markanda",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Gr{\"o}bner Bases, Polynomial Ideals, Primary
                 Decomposition",
}

@Article{Krishnamurthy:1985:SIA,
  author =       "E. V. Krishnamurthy",
  title =        "Symbolic Iterative Algorithm for Generalized Inversion
                 of Rational Polynomial Matrices",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "3",
  pages =        "271--282 (or 271--281??)",
  month =        sep,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12-04 (68Q40)",
  MRnumber =     "87i:12003",
  MRreviewer =   "F. J. van der Linden",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Matrices",
  xxtitle =      "Symbolic iterative algorithm for generalised inversion
                 of rational polynomial matrices",
}

@Article{Cherry:1985:IFT,
  author =       "G. W. Cherry",
  title =        "Integration in Finite Terms with Special Functions:
                 the Error Function",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "3",
  pages =        "283--302",
  month =        sep,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12H05",
  MRnumber =     "88h:12003",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/cathode.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "integration oderef; Integration, Error Function",
}

@Article{Karr:1985:TSF,
  author =       "Michael Karr",
  title =        "Theory of Summation in Finite Terms",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "3",
  pages =        "303--316 (or 303--315??)",
  month =        sep,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12H10 (68Q20 68Q40)",
  MRnumber =     "89a:12016",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Summation, Difference Fields",
}

@Article{Rizzi:1985:USC,
  author =       "Nicola Rizzi and Amabile Tatone",
  title =        "Using Symbolic Computation in Buckling Analysis",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "3",
  pages =        "317--322 (or 317--321??)",
  month =        sep,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "73-08 (73H05)",
  MRnumber =     "87h:73006",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Differential Equations, REDUCE",
}

@Article{Coquand:1985:SBC,
  author =       "Thierry Coquand and G{\'e}rard A. Huet",
  title =        "A Selected Bibliography on Constructive Mathematics,
                 Intuitionistic Type Theory and Higher Order Deduction",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "3",
  pages =        "323--328",
  month =        sep,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68-00 (03-00 03B15 03B35 03B70 03F55 03F65)",
  MRnumber =     "87j:68001",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Proof Checking, Theorem Proving, Lambda Calculus",
}

@Article{Bachmair:1985:TOA,
  author =       "Leo Bachmair and David A. Plaisted",
  title =        "Termination Ordering for Associative Commutative
                 Rewriting Systems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "4",
  pages =        "329--350 (or 329--349??)",
  month =        dec,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35 68Q50)",
  MRnumber =     "87m:68067",
  MRreviewer =   "G. E. Peterson",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/obscure.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Term Rewriting, Termination",
  xxtitle =      "Termination orderings for associative-commutative
                 rewriting systems",
}

@Article{Holt:1985:MCF,
  author =       "D. F. Holt",
  title =        "The Mechanical Computation of First and Second
                 Cohomology Groups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "4",
  pages =        "351--362 (or 351--361??)",
  month =        dec,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20-04 (20J06 68Q20)",
  MRnumber =     "87i:20005",
  MRreviewer =   "U. Stammbach",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Computational Group Theory",
}

@Article{Butler:1985:GBA,
  author =       "G. Butler and C. W. H. Lam",
  title =        "A General Backtrack Algorithm for the Isomorphism
                 Problem of Combinatorial Objects",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "4",
  pages =        "363--382 (or 363--381??)",
  month =        dec,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q20 (05-04 68Q40 68R05)",
  MRnumber =     "87j:68044",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Computational Group Theory",
}

@Article{Madlener:1985:PAW,
  author =       "Klaus Madlener and Friedrich Otto",
  title =        "Pseudonatural algorithms for the word problem for
                 finitely presented monoids and groups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "4",
  pages =        "383--418",
  month =        dec,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03D40 (03D15 20F10 20M05)",
  MRnumber =     "87h:03067",
  MRreviewer =   "M. Tetruashvili",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Term Rewriting",
  xxtitle =      "Pseudo-Natural Algorithms for the Word Problem for
                 Finitely Presented Monoids and Groups",
}

@Article{Tombal:1985:MCD,
  author =       "Ph. Tombal and A. Moussiaux",
  title =        "{MACSYMA} computation of the {Dirac--Bergmann}
                 algorithm for {Hamiltonian} systems with constraints",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "1",
  number =       "4",
  pages =        "419--421",
  month =        dec,
  year =         "1985",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "70H35 (70-04)",
  MRnumber =     "87h:70033",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Physics, MACSYMA, Dynamical Systems",
  xxtitle =      "Computation of the Dirac--Bergmann Algorithm for
                 Hamiltonian Systems with Constraints",
}

@Article{Kovacic:1986:ASS,
  author =       "Jerald J. Kovacic",
  key =          "Kovacic 1986",
  title =        "An Algorithm for Solving Second Order Linear
                 Homogeneous Differential Equations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "1",
  pages =        "3--43",
  month =        mar,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12H05 (34A30)",
  MRnumber =     "88c:12011",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/cathode.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290P (Differential equations); C4170 (Differential
                 equations)",
  corpsource =   "JYACC Inc., New York, NY, USA",
  countrypub =   "UK A01",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "closed form solution; complex variable; differential
                 equations; Differential Equations; rational functions;
                 second order linear homogeneous",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Atkinson:1986:CGC,
  author =       "M. D. Atkinson and R. A. Hassan",
  title =        "On the Computation of Group Characters",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "1",
  pages =        "45--50",
  month =        mar,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20C15",
  MRnumber =     "87e:20013",
  MRreviewer =   "I. M. Isaacs",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont.,
                 Canada",
  countrypub =   "UK A02",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "character sets; character table; Computational Group
                 Theory; computational methods; finite group; group
                 characters; irreducible characters; reducible
                 characters",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Slattery:1986:CCD,
  author =       "Michael C. Slattery",
  title =        "Computing character degrees in $p$-groups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "1",
  pages =        "51--58",
  month =        mar,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20C15 (20-04 68Q40)",
  MRnumber =     "87e:20019",
  MRreviewer =   "I. M. Isaacs",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics); C6130 (Data handling
                 techniques)",
  corpsource =   "Dept. of Math., Stat. and Comput. Sci., Marquette
                 Univ., Milwaukee, WI, USA",
  countrypub =   "UK A03",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "CAYLEY; character degrees computing; character sets;
                 Computational Group Theory; group theory; irreducible
                 complex characters; p-groups; power-commutator;
                 presentation; recursive procedure",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pasztor:1986:NSA,
  author =       "Ana Pasztor",
  title =        "Non-Standard Algorithmic and Dynamic Logic",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "1",
  pages =        "59--81",
  month =        mar,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q60 (03H20)",
  MRnumber =     "87j:68079",
  MRreviewer =   "L{\'a}szl{\'o} Csirmaz",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Dept. of Math., Carnegie-Mellon Univ., Pittsburgh, PA,
                 USA",
  countrypub =   "UK A04",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "dynamic logic; first order logic; nonstandard
                 algorithmic logic; program verification",
  treatment =    "B Bibliography; P Practical",
}

@Article{Boege:1986:SES,
  author =       "W. Boege and R. Gebauer and H. Kredel",
  title =        "Some Examples for Solving Systems of Algebraic
                 Equations by Calculating {Gr{\"o}bner} Bases",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "1",
  pages =        "83--98",
  month =        mar,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12-04 (11Y16 13-06 68Q40)",
  MRnumber =     "87d:12001",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/Comp.Alg.1.bib; Theory/reduce.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "Inst. for Appl. Math., Heidelberg Univ., West
                 Germany",
  countrypub =   "UK A05",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Reduce; polynomials; Buchberger algorithm; algebraic
                 equations; Gr{\"o}bner bases; coefficient domains;
                 variable ordering; term ordering; computing time; space
                 allocation; SAC-2; REDUCE",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bajaj:1986:PGA,
  author =       "Chanderjit Bajaj",
  title =        "Proving Geometric Algorithm Non-Solvability: An
                 Application of Factoring Polynomials",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "1",
  pages =        "99--102",
  month =        mar,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12-04 (11Y05)",
  MRnumber =     "87f:12001",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0260 (Optimisation techniques); B0290F (Interpolation
                 and function approximation); C1180 (Optimisation
                 techniques); C4130 (Interpolation and function
                 approximation)",
  corpsource =   "Dept. of Comput. Sci., Purdue Univ., West Lafayette,
                 IN, USA",
  countrypub =   "UK A06",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic equations; approximation; arithmetic
                 operations; computer algebra; factoring polynomials;
                 geometric algorithm nonsolvability proving; geometric
                 optimisation; geometric programming; Integer
                 Factorization, MACSYMA, Optimization; MACSYMA system;
                 numerical; polynomials; problems; root; symbolic
                 approximations",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Watowich:1986:SAO,
  author =       "S. J. Watowich and J. L. Krause and R. S. Berry",
  title =        "Stability Analysis of an Optimally Controlled
                 Light-Driven Engine",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "1",
  pages =        "103--108",
  month =        mar,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1320 (Stability in control theory); C3340B (Control
                 of heat systems); C4170 (Differential equations)",
  corpsource =   "Dept. of Chem., Chicago Univ., IL, USA",
  countrypub =   "UK A07",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computer algebra routines; free-piston engine; heat
                 engines; MACSYMA; MACSYMA, differential equations,
                 numerics; mixed boundary conditions; nonlinear
                 differential equations; numerical program; optimally
                 controlled light-driven engine; parameter sets; piston;
                 program; stability; stability analysis; symbolic
                 processing; trajectories",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Avenhaus:1986:DPT,
  author =       "J{\"u}rgen Avenhaus",
  title =        "On the Descriptive Power of Term Rewriting Systems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "2",
  pages =        "109--122",
  month =        jun,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (68Q50)",
  MRnumber =     "88a:68094",
  MRreviewer =   "G. E. Peterson",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/Comp.Alg.1.bib; Theory/symbolic.math.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory)",
  corpsource =   "Fachbereich Inf., Kaiserslautern Univ., West Germany",
  countrypub =   "UK A01",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "descriptive power; necessary and sufficient
                 syntactical conditions; programming theory; R-normal
                 forms; term rewriting systems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Furbach:1986:MCF,
  author =       "U. Furbach and S. H{\"o}lldobler",
  title =        "Modelling the Combination of Functional and Logic
                 Programming Languages",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "2",
  pages =        "123--138",
  month =        jun,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B70 68T25)",
  MRnumber =     "87j:68099",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Misc/Functional.bib; Theory/Comp.Alg.1.bib;
                 Theory/symbolic.math.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C6110 (Systems analysis and
                 programming)",
  corpsource =   "Univ. der Bundeswehr, M{\"u}nchen, West Germany",
  countrypub =   "UK A02",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "formal languages; functional programming languages;
                 invertibility; logic; logic programming; modelling;
                 programming languages; pure Horn clause logic
                 languages; unification algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Robbiano:1986:TGS,
  author =       "Lorenzo Robbiano",
  title =        "On the Theory of Graded Structures",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "2",
  pages =        "139--170",
  month =        jun,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13C05 (13-04 13A15 18D35 68Q40)",
  MRnumber =     "87j:13010",
  MRreviewer =   "Manfred Herrmann",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/Comp.Alg.1.bib; Theory/symbolic.math.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "Istituto Matematico, Genova Univ., Italy",
  countrypub =   "UK A03",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "polynomials; graded structures theory; standard;
                 Gr{\"o}bner bases; algorithmic problems; polynomial
                 ideal theory; algebraic; theories; structural algebraic
                 framework; Gr{\"o}bner Bases; Standard bases",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Edelsbrunner:1986:CHS,
  author =       "H. Edelsbrunner and R. Waupotitsch",
  title =        "Computing a Ham-Sandwich Cut in Two Dimensions",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "2",
  pages =        "171--178",
  month =        jun,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68U05",
  MRnumber =     "849 049",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/Comp.Alg.1.bib; Theory/symbolic.math.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4190 (Other numerical methods)",
  corpsource =   "Dept. of Comput. Sci., Illinois Univ., Urbana, IL,
                 USA",
  countrypub =   "UK A04",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Computational Geometry; computational geometry;
                 Euclidean plane; ham-sandwich cut computing; two
                 dimensions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Char:1986:TIM,
  author =       "Bruce W. Char and G. J. Fee and Keith O. Geddes and
                 Gaston H. Gonnet and Michael B. Monagan",
  title =        "A Tutorial Introduction to {Maple}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "2",
  pages =        "179--200",
  month =        jun,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "ftp://ftp.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing)",
  corpsource =   "Dept. of Comput Sci., Waterloo Univ., Ont., Canada",
  countrypub =   "UK A05",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; algebra system; algebraic equations;
                 algorithms; arithmetic; differential equations;
                 differentiation; factoring; integration; interactive
                 systems; languages; Maple computer; mathematical power;
                 mathematics; matrix manipulations; programming;
                 programming language; series expansions;
                 simplification; space statistics; summation; time
                 statistics; tutorial introduction; user syntax",
  review =       "ACM CR 8705-0409",
  subject =      "I.1.3 Computing Methodologies, ALGEBRAIC MANIPULATION,
                 Languages and Systems, Maple",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Duncan:1986:RUM,
  author =       "Anthony Duncan and Ralph Roskies",
  title =        "Representations of Unusual Mathematical Structures in
                 Scientific Applications of Symbolic Computation",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "2",
  pages =        "201--206 (or 201--207??)",
  month =        jun,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/Comp.Alg.1.bib; Theory/reduce.bib;
                 Theory/symbolic.math.bib",
  abstract =     "We present examples of techniques we have used to
                 apply {REDUCE} to problems in particle physics which
                 have mathematical structures unknown to {REDUCE}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C7310 (Mathematics
                 computing)",
  corpsource =   "Dept. of Phys. and Astron., Pittsburgh Univ., PA,
                 USA",
  countrypub =   "UK A06",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "anti-commuting; FORTRAN code; Gross--Neveu;
                 mathematical structures; model; operators; particle
                 physics; REDUCE, particle physics, numerics; scientific
                 applications; symbol manipulation; symbolic
                 computation; unusual mathematical structures",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Trindle:1986:AMR,
  author =       "C. Trindle",
  title =        "Application of the {MuMath(R)} Symbol Manipulation
                 System to Chemically Significant Permutation Groups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "2",
  pages =        "207--212",
  month =        jun,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/Comp.Alg.1.bib; Theory/symbolic.math.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Dept. of Chem., Virginia Univ., Charlottesville, VA,
                 USA",
  countrypub =   "UK A07",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "arithmetic; chemically significant; Chemistry,
                 Computational Group Theory; generating characters;
                 irreducible; modulo; MuMATH(R) symbol manipulation
                 system; permutation groups; quantum states;
                 representations; symbol manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Steinberg:1986:UMW,
  author =       "Stanly Steinberg and Patrick J. Roache",
  title =        "Using {Macsyma} to Write {FORTRAN} Subroutines",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "2",
  pages =        "213--216",
  month =        jun,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/auto.diff.bib; Theory/Comp.Alg.1.bib;
                 Theory/symbolic.math.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C6140D (High level
                 languages)",
  corpsource =   "Dept. of Math. and Stat., New Mexico Univ.,
                 Albuquerque, NM, USA",
  countrypub =   "UK A08",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "boundary value problems; difference code; differential
                 equations; electric field; elliptic partial; finite;
                 FORTRAN; FORTRAN subroutines; laser cavity; MACSYMA;
                 physics, differential equations, finite differences;
                 symbol manipulation; symbol manipulator",
  referred =     "[Char91a].",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Caviness:1986:CAP,
  author =       "B. F. Caviness",
  title =        "Computer Algebra: Past and Future",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "3",
  pages =        "217--236",
  month =        sep,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (11Y05 11Y16 12-04 13-04)",
  MRnumber =     "860 537",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/Comp.Alg.1.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4140 (Linear algebra); C7310 (Mathematics)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Delaware Univ.,
                 Newark, DE, USA",
  countrypub =   "UK A01",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computer algebra; future research and development;
                 GCD, Factorization, Polynomial Ideals, Logical
                 Theories, Integration, Summation, Differential
                 Equations, Software Systems, Transcendental Functions,
                 Parallel Computation, Education; linear algebra",
  treatment =    "B Bibliography; G General Review; T Theoretical or
                 Mathematical",
}

@Article{Davenport:1986:ELS,
  author =       "J. H. Davenport and M. F. Singer",
  title =        "Elementary and {Liouvillian} solutions of linear
                 differential equations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "3",
  pages =        "237--260",
  month =        sep,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12H05",
  MRnumber =     "88f:12010",
  MRreviewer =   "R. Cohn",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/cathode.bib; Theory/Comp.Alg.1.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4170 (Differential equations)",
  corpsource =   "Sch. of Math., Bath Univ., UK",
  countrypub =   "UK A02",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "coefficients; differential equations; differential
                 field; elementary solutions; linear; linear
                 differential equations; linear ODEs Galois theory
                 Liouvillian solutions ODEs oderef; Liouvillian
                 solutions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rolletschek:1986:NDE,
  author =       "Heinrich Rolletschek",
  title =        "On the Number of Divisions of the {Euclidean}
                 Algorithm Applied to {Gaussian} Integers",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "3",
  pages =        "261--292 (or 261--291??)",
  month =        sep,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11Y16 (68Q40)",
  MRnumber =     "88d:11131",
  MRreviewer =   "Jacques Calmet",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/Comp.Alg.1.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4140 (Linear algebra)",
  corpsource =   "Kent State Univ., OH, USA",
  countrypub =   "UK A03",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "arbitrary remainder; EA; Euclidean algorithm; Gaussian
                 integers; linear algebra; minimal remainder-version;
                 norm; number of divisions; tight upper bound",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Plaisted:1986:SPC,
  author =       "David A. Plaisted and Steven Greenbaum",
  title =        "A Structure Preserving Clause Form Translation",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "3",
  pages =        "293--304",
  month =        sep,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35 03B70)",
  MRnumber =     "88b:68172",
  MRreviewer =   "Alexander Leitsch",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/Comp.Alg.1.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1230 (Artificial intelligence)",
  corpsource =   "Dept. of Comput. Sci., North Carolina Univ., Chapel
                 Hill, NC, USA",
  countrypub =   "UK A04",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "clause form; first-; lock resolution; nonstandard
                 clause form translation; order formula; predicates;
                 program verification; program verification, resolution
                 theorem proving; resolution theorem provers;
                 structure-preserving clause form; theorem proving;
                 translation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wang:1986:FSS,
  author =       "Paul S. Wang",
  title =        "{FINGER}: a symbolic system for automatic generation
                 of numerical programs in finite element analysis",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "3",
  pages =        "305--316",
  month =        sep,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/auto.diff.bib; Theory/Comp.Alg.1.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4140 (Linear algebra); C6100 (Software techniques and
                 systems)",
  comment =      "Char -- Includes a discussion of code optimization
                 techniques.",
  corpsource =   "Dept. of Math. Sci., Kent State Univ., OH, USA",
  countrypub =   "UK A05",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; automatic; automatic intermediate; automatic
                 programming; code; expression labelling; FINGER; finite
                 element analysis; finite element analysis packages;
                 finite element code generator; FORTRAN code;
                 FORTRAN-based; generated functions; generation;
                 GENTRAN; interleaving formula derivation; LISP-based
                 system; material matrices; matrices; matrix; numerical
                 programs; stiffness; strain-displacement matrices;
                 subroutines; symbolic formulas; symbolic system;
                 symmetry",
  referred =     "[Char91a].",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Book:1986:UET,
  author =       "R. V. Book and J. H. Siekmann",
  title =        "On Unification: Equational Theories Are Not Bounded",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "4",
  pages =        "317--324",
  month =        dec,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B35 (03C05 68T15)",
  MRnumber =     "88a:03027",
  MRreviewer =   "Hans-Joachim Goltz",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Dept. of Math., California Univ., Santa Barbara, CA,
                 USA",
  countrypub =   "UK A01",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "cardinality; equational theories; symbol manipulation;
                 unification",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Paulson:1986:CRO,
  author =       "Lawrence C. Paulson",
  title =        "Constructing Recursion Operators in Intuitionistic
                 Type Theory",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "4",
  pages =        "325--355",
  month =        dec,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T25 (03B15 03B70 03D65 03F15 03F50 68Q60)",
  MRnumber =     "88b:68176",
  MRreviewer =   "Daniel Leivant",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "Compiler/math.prog.construction.bib;
                 http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Comput. Lab., Cambridge, UK",
  countrypub =   "UK A02",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computer programs; formal logic; formal reasoning;
                 induction; Martin-Lof intuitionistic; natural numbers;
                 program verification, theorem proving; programming
                 theory; recursion operators construction; theory of
                 types",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bremner:1986:FCW,
  author =       "Murray R. Bremner",
  title =        "Fast Computation of Weight Multiplicities",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "4",
  pages =        "357--362",
  month =        dec,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "17B10",
  MRnumber =     "88a:17010",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics)",
  corpsource =   "Dept. of Math., Yale Univ., New Haven, CT, USA",
  countrypub =   "UK A03",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "CDC Cyber 835; complex Lie algebras; dominant weights;
                 fast computation; finite-dimensional irreducible
                 modules; implementation; Lie algebra; Lie groups;
                 mathematics computing; Pascal; weight multiplicities",
  treatment =    "T Theoretical or Mathematical",
}

@Article{LeChenadec:1986:CCG,
  author =       "Philippe {Le Chenadec}",
  title =        "A Catalogue of Complete Group Presentations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "4",
  pages =        "363--381",
  month =        dec,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (20F05 20F10 68Q50)",
  MRnumber =     "88f:68067",
  MRreviewer =   "D. L. Johnson",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0210 (Algebra); B0250 (Combinatorial mathematics);
                 C1110 (Algebra); C1160 (Combinatorial mathematics)",
  corpsource =   "INRIA, Le Chesnay, France",
  countrypub =   "UK A04",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithms; catalogue; combinatorial mathematics;
                 combinatorial properties; complete group presentations;
                 Coxeter groups; Dyck groups; group theory; problem;
                 replacement rules; Rewriting, Church--Rosser; surface
                 groups; symmetric groups; uniform; word; word problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Armbruster:1986:CUU,
  author =       "D. Armbruster and H. Kredel",
  title =        "Constructing universal unfoldings using {Gr{\"o}bner}
                 bases",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "4",
  pages =        "383--388",
  month =        dec,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "58-04 (58C27 58E07 68Q40)",
  MRnumber =     "87m:58002",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4200 (Computer theory)",
  corpsource =   "Inst. for Inf. Sci., Tubingen Univ., West Germany",
  countrypub =   "UK A05",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computation theory; universal unfoldings construction;
                 Gr{\"o}bner bases; Buchberger; algorithm system;
                 singularity; bifurcation theory; mapping problem;
                 Bifurcation; Singularities",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kutzler:1986:ABA,
  author =       "B. Kutzler and S. Stifter",
  title =        "On the application of {Buchberger}'s algorithm to
                 automated geometry theorem proving",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "4",
  pages =        "389--397",
  month =        dec,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35 51-04)",
  MRnumber =     "872 788",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4190 (Other numerical methods)",
  corpsource =   "Inst. fur Math., Linz Univ., Austria",
  countrypub =   "UK A06",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational geometry; Buchberger algorithm;
                 automated geometry theorem proving; Gr{\"o}bner bases;
                 hypotheses; conjecture; polynomial equations;
                 pseudoreduction; rational function field; computer
                 algebra; system SAC-2; IBM 4341",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kapur:1986:UGB,
  author =       "Deepak Kapur",
  title =        "Using {Gr{\"o}bner} bases to reason about geometry
                 problems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "2",
  number =       "4",
  pages =        "399--408",
  month =        dec,
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35 51-04 68Q40)",
  MRnumber =     "872 789",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation);
                 C4190 (Other numerical methods)",
  corpsource =   "Corp. Res. and Dev., General Electric Co.,
                 Schenectady, NY, USA",
  countrypub =   "UK A07",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational geometry; polynomials; reasoning;
                 Gr{\"o}bner bases; geometry problems; finite set;
                 polynomial equations; Geometrical Theorem Proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Coquand:1986:SBC,
  author =       "T. Coquand and G. P. Huet",
  title =        "A Selected Bibliography on Constructive Mathematics,
                 Intuitionistic Type Theory and Higher Order Deduction",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "3",
  number =       "1",
  pages =        "??--??",
  month =        "????",
  year =         "1986",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Feb 22 07:40:30 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Misc/Functional.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "functional typed lambda calculus Curry",
}

@Article{Buchberger:1987:HBF,
  author =       "Bruno Buchberger",
  title =        "History and Basic Features of the
                 Critical-Pair/Completion Procedure",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "3",
  number =       "1--2",
  pages =        "3--38",
  month =        feb # "--" # apr,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (03B35 68Q50 68T20)",
  MRnumber =     "88m:68026",
  MRreviewer =   "Klaus Madlener",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Rewriting techniques and applications (Dijon, 1985).",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C1230 (Artificial intelligence);
                 C4210 (Formal logic)",
  corpsource =   "Dept. of Math., Johannes-Kepler-Univ., Linz, Austria",
  countrypub =   "UK A01",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; algorithmic polynomial ideal theory;
                 critical-pair/completion approach; finitely generated
                 algebras; formal languages; formal logic; polynomials;
                 reviews; rewriting; superpositions; symbol
                 manipulation; symbolic computation; systems; theorem
                 proving; Resolution; Theorem Proving; Rewrite;
                 Knuth--Bendix; Church--Rosser; Gr{\"o}bner Bases",
  treatment =    "B Bibliography; G General Review; T Theoretical or
                 Mathematical",
}

@Article{Book:1987:TSR,
  author =       "Ronald V. Book",
  title =        "{Thue} Systems as Rewriting Systems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "3",
  number =       "1--2",
  pages =        "39--68",
  month =        feb # "--" # apr,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03D03 (03D35 68Q50)",
  MRnumber =     "88g:03056",
  MRreviewer =   "George Tourlakis",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Rewriting techniques and applications (Dijon, 1985).",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Math., California Univ., Santa Barbara, CA,
                 USA",
  countrypub =   "UK A02",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Church-; computational complexity; decidability;
                 formal languages; formal logic; formula manipulation;
                 group theory; groups; length-decreasing rewriting;
                 monoids; reduction; reviews; rewriting systems; Rosser
                 property; rules; strings over a finite alphabet; symbol
                 manipulation; symbolic computation; Thue systems",
  treatment =    "B Bibliography; G General Review; T Theoretical or
                 Mathematical",
}

@Article{Dershowitz:1987:TR,
  author =       "Nachum Dershowitz",
  key =          "Ders87",
  title =        "Termination of Rewriting",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "3",
  number =       "1--2",
  pages =        "69--115",
  month =        feb # "--" # apr,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q50 (68T15)",
  MRnumber =     "88j:68099a",
  MRreviewer =   "Ursula Martin",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Misc/formal.hardware.verification.bib",
  note =         "Rewriting techniques and applications (Dijon, 1985).
                 See corrigendum \cite{Dershowitz:1987:CTR}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. Sci., Illinois Univ., Urbana, IL,
                 USA",
  countrypub =   "UK A03",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keyword =      "Rewrite Methods",
  keywords =     "decidability; formal languages; formal logic;
                 interpretations; linearity; orderings on terms; path
                 orderings; polynomial; program; restrictions; reviews;
                 rewriting systems; symbol manipulation; symbolic
                 computation; terminating programs; termination proofs;
                 verification",
  treatment =    "B Bibliography; G General Review; T Theoretical or
                 Mathematical",
}

@Article{Rusinowitch:1987:PSO,
  author =       "Michael Rusinowitch",
  title =        "Path of Subterms Ordering and Recursive Decomposition
                 Ordering Revisited",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "3",
  number =       "1--2",
  pages =        "117--132 (or 117--131??)",
  month =        feb # "--" # apr,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q50 (68T15)",
  MRnumber =     "89h:68095",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/obscure.bib",
  note =         "Rewriting techniques and applications (Dijon, 1985).",
  acknowledgement = ack-nhfb,
  classcodes =   "C1230 (Artificial intelligence); C4210 (Formal
                 logic)",
  corpsource =   "Centre de Recherche en Inf. de Nancy, Vandoeuvre,
                 France",
  countrypub =   "UK A04",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "formal languages; formal logic; manipulation; path of
                 subterms ordering; recursive decomposition ordering;
                 recursive functions; recursive path ordering; Rewrite,
                 Termination; rewriting systems; symbol; symbolic
                 computation; theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hsiang:1987:RMT,
  author =       "Jieh Hsiang",
  title =        "Rewrite Method for Theorem Proving in First Order
                 Theory with Equality",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "3",
  number =       "1--2",
  pages =        "133--151",
  month =        feb # "--" # apr,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B35 (68T15)",
  MRnumber =     "88g:03020",
  MRreviewer =   "Alexander Leitsch",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Rewriting techniques and applications (Dijon, 1985).",
  acknowledgement = ack-nhfb,
  classcodes =   "C1230 (Artificial intelligence); C4210 (Formal
                 logic)",
  corpsource =   "Dept. of Comput. Sci., State Univ. of New York, Stony
                 Brook, NY, USA",
  countrypub =   "UK A05",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Boolean algebra; calculus; equality; first order
                 predicate calculus with; formal logic;
                 Hsiang-Dershowitz; manipulation; method;
                 paramodulation; resolution; symbol; symbolic
                 computation; term rewriting method; theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yelick:1987:UCC,
  author =       "Katherine A. Yelick",
  title =        "Unification in Combinations of Collapse-free Regular
                 Theories",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "3",
  number =       "1--2",
  pages =        "153--181",
  month =        feb # "--" # apr,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35 03C05)",
  MRnumber =     "89a:68193",
  MRreviewer =   "G. E. Peterson",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Rewriting techniques and applications (Dijon, 1985).",
  acknowledgement = ack-nhfb,
  classcodes =   "C1230 (Artificial intelligence); C4210 (Formal logic);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Lab. for Comput. Sci., MIT, Cambridge, MA, USA",
  countrypub =   "UK A06",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm correctness proving; associative-;
                 collapse-free regular theories; commutative operator
                 unification; equational; formal logic; free symbols;
                 mixed function-symbol sets; multiple operator
                 instances; necessary and sufficient; program
                 verification; proving; restrictions; Rewrite; symbol
                 manipulation; symbolic computation; theorem; theorem
                 proving; unification algorithms; variable-only case
                 algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Tiden:1987:UPO,
  author =       "Erik Tid{\'e}n and Stefan Arnborg",
  title =        "Unification Problems with One-sided Distributivity",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "3",
  number =       "1--2",
  pages =        "183--202",
  month =        feb # "--" # apr,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q50 (03B35 03C05 03D35 68Q20 68T15)",
  MRnumber =     "89a:68141",
  MRreviewer =   "Denis Lugiez",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Rewriting techniques and applications (Dijon, 1985).",
  acknowledgement = ack-nhfb,
  classcodes =   "B1130B (Computer-aided circuit analysis and design);
                 C1230 (Artificial intelligence); C4210 (Formal logic);
                 C4240 (Programming and algorithm theory); C4290 (Other
                 computer theory)",
  corpsource =   "Swedish Inst. of Comput. Sci., Spanga, Sweden",
  countrypub =   "UK A07",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "associativity; circuit CAD; circuit synthesis;
                 computational complexity; decidability; decision
                 procedure; decomposition; distributivity; equational
                 theories; generalized occurs check; manipulation;
                 Markov associative unification; one-sided
                 distributivity; one-sided unit element; permutative
                 theory; problem; Rewrite; symbol; symbolic computation;
                 termination; theorem proving; two-sided; unification",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Benanav:1987:CMP,
  author =       "Dan Benanav and Deepak Kapur and Paliath Narendran",
  title =        "Complexity of Matching Problems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "3",
  number =       "1--2",
  pages =        "203--216",
  month =        feb # "--" # apr,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q50 (03B35 03D15 68Q25 68Q40 68T15)",
  MRnumber =     "89a:68131",
  MRreviewer =   "Alexander Leitsch",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Rewriting techniques and applications (Dijon, 1985).",
  acknowledgement = ack-nhfb,
  classcodes =   "C1230 (Artificial intelligence); C4210 (Formal logic);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Corp. Res. and Dev., General Electric Co.,
                 Schenectady, NY, USA",
  countrypub =   "UK A08",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "associative matching; associative-commutative;
                 automated reasoning; complexity; computational;
                 computational complexity; formal logic; functional
                 programming; logic programming; matching problem;
                 NP-complete problems; program verification;
                 programming; relational; Rewrite, Unification;
                 specification analysis; symbol manipulation; symbolic
                 computation; upper bound",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fortenbacher:1987:AAU,
  author =       "Albrecht Fortenbacher",
  title =        "An Algebraic Approach to Unification Under
                 Associativity and Commutativity",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "3",
  number =       "3",
  pages =        "217--229",
  month =        jun,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35 68Q55)",
  MRnumber =     "89i:68114",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C6130 (Data handling
                 techniques)",
  corpsource =   "Inst. fur Inf. I, Karlsruhe Univ., West Germany",
  countrypub =   "UK A01",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Abelian strings; algebraic approach; associativity;
                 commutativity; formal languages; free algebra;
                 mappings; symbol manipulation; unification",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sims:1987:VN,
  author =       "Charles C. Sims",
  title =        "Verifying Nilpotence",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "3",
  number =       "3",
  pages =        "231--247",
  month =        jun,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20F10 (03B35 20F18 68Q40 68Q50)",
  MRnumber =     "88k:20057",
  MRreviewer =   "Klaus Madlener",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics); C1230 (Artificial
                 intelligence); C4210 (Formal logic)",
  corpsource =   "Dept. of Math., Rutgers Univ., New Brunswick, NJ,
                 USA",
  countrypub =   "UK A02",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computer implementation; Finitely Presented Group,
                 Rewriting; formal languages; group theory; minimal
                 presentations; nilpotence verification; polycyclicity;
                 presented group; rules; string rewriting; theorem
                 proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Aurenhammer:1987:RPC,
  author =       "F. Aurenhammer",
  title =        "Recognising Polytopical Cell Complexes and
                 Constructing Projection Polyhedra",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "3",
  number =       "3",
  pages =        "249--255",
  month =        jun,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68U05",
  MRnumber =     "88h:68081",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4190 (Other numerical methods)",
  corpsource =   "Inst. for Inf. Process., Tech. Univ. of Graz,
                 Austria",
  countrypub =   "UK A03",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational geometry; Computational Geometry,
                 Voronoi Diagrams; construction; convex polyhedron;
                 diagrams; Euclidean d-space; planar point-location;
                 polytopical cell complexes recognition; projection
                 polyhedra; Voronoi",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fages:1987:ACU,
  author =       "Fran{\c{c}}ois Fages",
  title =        "Associative-Commutative Unification",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "3",
  number =       "3",
  pages =        "257--275",
  month =        jun,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q25 (03B35 68T15)",
  MRnumber =     "89a:68098",
  MRreviewer =   "G. E. Peterson",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Lab. d'Inf. Theor. et de Programmation, CNRS, Paris,
                 France",
  countrypub =   "UK A04",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "associative-commutation unification; automated
                 deduction; correctness; diophantine equations;
                 equational theories; formal languages; homogeneous;
                 linear diophantine equations; term rewriting systems;
                 termination",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ogilvie:1987:ASC,
  author =       "J. F. Ogilvie and R. H. Tipping",
  title =        "On the Analytic Solution by Computer Algebra of Some
                 Problems in the Vibration-rotational Spectroscopy of
                 Diatomic Molecules",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "3",
  number =       "3",
  pages =        "277--281",
  month =        jun,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "81G55 (65V05 81-08)",
  MRnumber =     "88h:81242",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "A3120 (Specific calculations and results); A3310J
                 (Vibrational-rotational analysis); A3320 (Molecular
                 spectra grouped by wavelength ranges)",
  corpsource =   "Res. Sch. of Chem., Inst. of Adv. Studies, Australian
                 Nat. Univ., Canberra, ACT, Australia",
  countrypub =   "UK A05",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "analytic solution; chemistry, REDUCE; coefficients;
                 computational techniques; computer algebra; diatomic
                 molecules; Dunham theory; expectation values; frequency
                 data; Herman-Wallis; intensity data; matrix elements;
                 molecular energy level calculations; molecular
                 rotation-; molecules; spectra of diatomic inorganic;
                 term-value coefficients; vibration calculations;
                 vibration-rotational spectroscopy",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Beyer:1987:STA,
  author =       "W. A. Beyer and L. Heller",
  title =        "A {Steiner} Tree Associated with Tree Quarks",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "3",
  number =       "3",
  pages =        "283--289",
  month =        jun,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "81G20 (05C99)",
  MRnumber =     "88h:81229",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "A1235H (Phenomenological composite models of particle
                 structure and reactions (partons, bags, etc.))",
  corpsource =   "Theor. Div., Los Alamos Nat. Lab., NM, USA",
  countrypub =   "UK A06",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "geometries; MACSYMA; MIT bag model; quark confinement;
                 static quarks; Steiner tree; symbol manipulation;
                 symbol manipulation system; three quarks; trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mills:1987:USA,
  author =       "R. D. Mills",
  title =        "Using a Small Algebraic Manipulation System to Solve
                 Differential and Integral Equations by Variational and
                 Approximation Techniques",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "3",
  number =       "3",
  pages =        "291--301",
  month =        jun,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "65V05",
  MRnumber =     "88d:65188",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0260 (Optimisation techniques); B0290P (Differential
                 equations); B0290R (Integral equations); C1180
                 (Optimisation techniques); C4170 (Differential
                 equations); C4180 (Integral equations); C6130 (Data
                 handling techniques)",
  corpsource =   "Dept. of Comput. Sci., Glasgow Univ., UK",
  countrypub =   "UK A07",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic; approximation techniques; approximations;
                 boundary-value problems; differential equations;
                 Fredholm; integral equations; least squares; least-;
                 manipulation system; MuMATH; MUMATH; squares
                 techniques; symbol manipulation; variational
                 techniques",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Semjonov:1987:SPK,
  author =       "A. L. Semjonov and L. S. Mel\cprime{}nikov and V. A.
                 Evstigneev",
  title =        "Solving the Problems of Kinetics of Complex Reactions
                 by Symbolic Algebraic Manipulation Methods",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "3",
  number =       "3",
  pages =        "303--307",
  month =        jun,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "80A30 (05C20 92A40)",
  MRnumber =     "88k:80012",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "A8220 (Chemical kinetics)",
  corpsource =   "Inst. of Maths., Acad. of Sci., Novosibirsk, USSR",
  countrypub =   "UK A08",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "complex reactions; graph theory; graph-theoretical
                 methods; kinetics problems; Kinetics, Physics,
                 Polynomials, ARAP, YARMO; manipulation; manipulation
                 methods; multivariate polynomial operations;
                 polynomials; reaction kinetics theory; symbol; symbolic
                 algebraic",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pohst:1987:I,
  author =       "Michael Pohst",
  title =        "Introduction",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "1",
  pages =        "1--2",
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "i",
  MRnumber =     "88i:01124",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
}

@Article{Boffgen:1987:CDP,
  author =       "R. B{\"o}ffgen and M. A. Reichert",
  title =        "Computing the Decomposition of Primes $p$ and $p$-adic
                 Absolute Values in Semisimple Algebras over {$ {\bf
                 Q}$}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "1",
  pages =        "3--10",
  month =        aug,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11Y40 (11R27)",
  MRnumber =     "89e:11083",
  MRreviewer =   "Kurt Girstmair",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics)",
  corpsource =   "Saarlandes Univ., Fachbereich Math., Saarbrucken, West
                 Germany",
  countrypub =   "UK A01",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm; factorisation; Factorization;
                 Ford-Zassenhaus algorithm; monic; number; number
                 theory; ORDMAX; p-adic values; prime decomposition;
                 semi-simple algebras; separable polynomial; symbol
                 manipulation; symbolic computation; theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Buchmann:1987:PIT,
  author =       "Johannes B. Buchmann and H. C. Williams",
  title =        "On Principal Ideal Testing in Algebraic Number
                 Fields",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "1",
  pages =        "11--19",
  month =        aug,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11R29 (11Y40)",
  MRnumber =     "88m:11093",
  MRreviewer =   "Franz Halter-Koch",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics)",
  corpsource =   "Math. Inst., Dusseldorf Univ., West Germany",
  countrypub =   "UK A02",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic number; complexity; computational;
                 cyclotomic numbers of order 7; fields; number theory;
                 principal ideal testing; symbol manipulation; symbolic
                 computation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cerlienco:1987:CMP,
  author =       "L. Cerlienco and M. Mignotte and F. Piras",
  title =        "Computing the Measure of a Polynomial",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "1",
  pages =        "21--33",
  month =        aug,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12-04 (11J99 11Y16 30-04 68Q40)",
  MRnumber =     "89a:12001",
  MRreviewer =   "Joachim von zur Gathen",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra)",
  corpsource =   "Dipartimento di Matematica, Cagliari Univ., Italy",
  countrypub =   "UK A03",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic algorithms; complex zeros of a polynomial;
                 computational complexity; elimination problems;
                 linearly recursive sequences; measure of a; poles and
                 zeros; polynomials; semi-numerical algorithms;
                 Solutions of Polynomials, numerics, elimination; symbol
                 manipulation; symbolic computation; univariate
                 polynomial",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cohn:1987:ASM,
  author =       "Harvey Cohn and Jesse Ira Deutsch",
  title =        "Application of Symbolic Manipulation to the {Hecke}
                 Transformations of Modular Forms in Two Variables,
                 {II}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "1",
  pages =        "35--40",
  month =        aug,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11F41 (11Y16 11Y35)",
  MRnumber =     "88k:11032",
  MRreviewer =   "Marvin I. Knopp",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C1160 (Combinatorial mathematics);
                 C7310 (Mathematics)",
  corpsource =   "Dept. of Math., City Coll., New York, NY, USA",
  countrypub =   "UK A04",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; asymmetric modular forms; equations; Hecke
                 transformations; in two variables; MACSYMA,
                 Computational Number Theory, Algebraic Number Fields;
                 manipulation; mathematics computing; modular forms;
                 number theory; polynomial; symbol; symbolic
                 manipulation",
  treatment =    "T Theoretical or Mathematical; X Experimental",
}

@Article{Eckhardt:1987:CCN,
  author =       "Carsten Eckhardt",
  title =        "Computation of Class Numbers by an Analytic Method",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "1",
  pages =        "41--52",
  month =        aug,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11R29 (11Y40)",
  MRnumber =     "89b:11089",
  MRreviewer =   "H. London",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C1160 (Combinatorial mathematics)",
  corpsource =   "Gottingen Univ, Math. Inst., West Germany",
  countrypub =   "UK A05",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; algebraic number field; Algebraic Number
                 Fields; analytic method; class numbers; manipulation;
                 number theory; series (mathematics); series expansion;
                 symbol; symbolic computation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Folz:1987:WRD,
  author =       "H. G. Folz and H. G. Zimmer",
  title =        "What is the Rank of the {Demjanenko} Matrix?",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "1",
  pages =        "53--67",
  month =        aug,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11G05 (11Y50)",
  MRnumber =     "88k:11038",
  MRreviewer =   "Toshihiro Hadano",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C1160 (Combinatorial mathematics);
                 C7310 (Mathematics)",
  corpsource =   "Fachbereich 9 Math., Saarlandes Univ., Saarbrucken,
                 West Germany",
  countrypub =   "UK A06",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic number; boundedness; Demjanenko matrix;
                 Elliptic Curves, Algebraic Number Fields; field; lower
                 estimate; manipulation; mathematics computing; matrix
                 algebra; number theory; rank; symbol; symbolic
                 computation; theorem; torsion of an elliptic curve",
  treatment =    "T Theoretical or Mathematical; X Experimental",
}

@Article{Ford:1987:CMO,
  author =       "David J. Ford",
  title =        "The Construction of Maximal Orders Over a {Dedekind}
                 Domain",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "1",
  pages =        "69--75",
  month =        aug,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11R54 (16A18)",
  MRnumber =     "89a:11121",
  MRreviewer =   "J{\"u}rgen Ritter",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C1160 (Combinatorial mathematics)",
  corpsource =   "Concordia Univ., Montreal, Que., Canada",
  countrypub =   "UK A07",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; algebraic decomposition; algebraic
                 decomposition, p-adic, Residue Domains; complete local;
                 computation; Dedekind domain; integral element; maximal
                 orders; number theory; P-adic stability; polynomials;
                 proper factorisation of monic polynomials; symbol
                 manipulation; symbolic; Zassenhaus",
  treatment =    "T Theoretical or Mathematical; X Experimental",
}

@Article{Kaltofen:1987:DIT,
  author =       "Erich Kaltofen",
  title =        "Deterministic Irreducibility Testing of Polynomials
                 over Large Finite Fields",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "1",
  pages =        "77--82",
  month =        aug,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11T06 (11Y16 12E05 68Q40)",
  MRnumber =     "88k:11091",
  MRreviewer =   "Jacques Calmet",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C1160 (Combinatorial mathematics);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Rensselaer Polytech. Inst.,
                 Troy, NY, USA",
  countrypub =   "UK A08",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Berlekamp algorithm; Berlekamp's Algorithm;
                 computational complexity; dense multivariate
                 polynomials; deterministic irreducibility testing;
                 manipulation; number theory; polynomials; sequential
                 deterministic polynomial-; symbol; symbolic
                 computation; time algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Malle:1987:PPN,
  author =       "Gunter Malle",
  title =        "Polynomials for Primitive Nonsolvable Permutation
                 Groups of Degree $ d \leq 15 $",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "1",
  pages =        "83--92",
  month =        aug,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12F10 (11R32 12E05)",
  MRnumber =     "89b:12007",
  MRreviewer =   "K. Kiyek",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C1160 (Combinatorial mathematics)",
  corpsource =   "Math. Inst. II, Lehrstuhl Professor Leopoldt,
                 Karlsruhe, West Germany",
  countrypub =   "UK A09",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Galois group; Galois Groups; group theory; groups;
                 Hilbert irreducibility theorem; manipulation; maximal
                 transitive; number theory; polynomials; primitive
                 nonsolvable permutation; subgroups; symbol; symbolic
                 computation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Matzat:1987:PGG,
  author =       "B. Heinrich Matzat and Andreas Zeh-Marschke",
  title =        "{Polynome mit der Galoisgruppe $ {M}_{11} $ {\"u}ber $
                 {\bf Q} $. (German)} [Polynomials with the {Galois}
                 group $ {M}_{11} $ over {$ {\bf Q} $}]",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "1",
  pages =        "93--97",
  month =        aug,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12E05 (11R32 12F10)",
  MRnumber =     "89b:12004",
  MRreviewer =   "W. Feit",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C1160 (Combinatorial mathematics)",
  corpsource =   "Math. Inst. II, Karlsruhe Univ., West Germany",
  countrypub =   "UK A10",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "group theory; manipulation; number theory;
                 polynomials; symbol; symbolic computation",
  language =     "German",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Maus:1987:CIB,
  author =       "Eckart Maus",
  title =        "Computation of integral bases in certain $ {S}_n $
                 extensions of {$ {\bf Q} $}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "1",
  pages =        "99--102",
  month =        aug,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11R29 (11R21 11R33)",
  MRnumber =     "88m:11094",
  MRreviewer =   "B. Heinrich Matzat",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C1160 (Combinatorial mathematics)",
  corpsource =   "Math. Inst., Georg-August-Univ., Gottingen, West
                 Germany",
  countrypub =   "UK A11",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "$S_n$ extensions; algebra; extensions; Galois; Galois
                 Extensions, Galois Group; group; group theory; integral
                 bases; nonsolvable Galois; number theory; ring of
                 integers; symbol manipulation; symbolic computation;
                 trinomial equations",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Petho:1987:RTI,
  author =       "Attila Peth{\"o}",
  title =        "On the resolution of {Thue} inequalities",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "1",
  pages =        "103--109",
  month =        aug,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11D75 (11A55 11Y50)",
  MRnumber =     "89b:11030",
  MRreviewer =   "John H. Loxton",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C1160 (Combinatorial mathematics)",
  corpsource =   "Math. Inst., Kossuth Lajos Univ., Debrecen, Hungary",
  countrypub =   "UK A12",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "continued fraction expansion; Diophantine
                 Inequalities; homogeneous polynomial; number theory;
                 polynomials; resolution; symbol manipulation; symbolic
                 computation; Thue inequalities",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Plesken:1987:TSQ,
  author =       "W. Plesken",
  title =        "Towards a Soluble Quotient Algorithm",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "1",
  pages =        "111--122",
  month =        aug,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20F16 (03B35 20-04 20D10)",
  MRnumber =     "89d:20027",
  MRreviewer =   "M. Greendlinger",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C1160 (Combinatorial mathematics)",
  corpsource =   "Queen Mary Coll., London, UK",
  countrypub =   "UK A13",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; factor groups, finitely presented groups;
                 finitely; group theory; number theory; presented
                 groups; soluble factor groups; soluble quotient
                 algorithm; symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pohst:1987:MLR,
  author =       "M. Pohst",
  title =        "A Modification of the {LLL}-Reduction Algorithm",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "1",
  pages =        "123--127",
  month =        aug,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11Y16 (11H06 11R27 11Y05 68Q20)",
  MRnumber =     "89c:11183",
  MRreviewer =   "Hans G. Kopetzky",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C1160 (Combinatorial mathematics)",
  corpsource =   "Math. Inst., Dusseldorf Univ., West Germany",
  countrypub =   "UK A14",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "lattices; linearly dependent input; modified LLL
                 reduction algorithm; number theory; polynomial
                 factoring; polynomials; symbol manipulation; symbolic
                 computation; vectors",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Anonymous:1987:BHZ,
  author =       "Anonymous",
  title =        "Bibliography of {Hans Zassenhaus}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "1",
  pages =        "129--135",
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "01A70",
  MRnumber =     "88k:01051",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
}

@Article{vonzurGathen:1987:FAC,
  author =       "Joachim {von zur Gathen}",
  title =        "Feasible Arithmetic Computations: {Valiant}'s
                 Hypothesis",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "2",
  pages =        "137--172",
  month =        oct,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q15 (03D15 11Y16 12-04 15A15 68-02)",
  MRnumber =     "89f:68021",
  MRreviewer =   "Werner Hartmann",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. Sci., Toronto Univ., Ont., Canada",
  countrypub =   "UK A01",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Complexity; computational complexity; feasible
                 arithmetic computations; P=NP; polynomials;
                 Polynomials; symbol manipulation; symbolic computation;
                 Valiant hypothesis",
  treatment =    "B Bibliography; T Theoretical or Mathematical",
}

@Article{Murray:1987:TLA,
  author =       "Neil V. Murray and Erik Rosenthal",
  title =        "Theory Links: Applications to Automated Theorem
                 Proving",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "2",
  pages =        "173--190",
  month =        oct,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B35 (68T15)",
  MRnumber =     "89e:03019",
  MRreviewer =   "Henry Africk",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1230 (Artificial intelligence); C4210 (Formal
                 logic)",
  corpsource =   "Dept. of Comput. Sci., State Univ. of New York,
                 Albany, NY, USA",
  countrypub =   "UK A02",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "automated theorem proving; deletion; first-order
                 theory links; formal logic; link; symbol manipulation;
                 symbolic computation; theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Buttner:1987:EBE,
  author =       "Wolfram B{\"u}ttner and Helmut Simonis",
  title =        "Embedding {Boolean} Expressions into Logic
                 Programming",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "2",
  pages =        "191--205",
  month =        oct,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T25 (03B35 03B70)",
  MRnumber =     "89f:68061",
  MRreviewer =   "Petr Jirk\ocirc u",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "Ai/constr.logic.bib; Ai/Constr.logic.prog.bib;
                 http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C6120 (File
                 organisation)",
  corpsource =   "Siemens AG, M{\"u}nchen, West Germany",
  countrypub =   "UK A03",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Boolean algebra; Boolean expression embedding; data
                 structures; data type; logic programming; most general
                 unifier; programming theory; PROLOG; symbol
                 manipulation; symbolic computation; theory;
                 Unification; unitary",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Paige:1987:MTS,
  author =       "Robert Paige and Fritz Henglein",
  title =        "Mechanical Translation of Set Theoretic Problem
                 Specifications into Efficient {RAM} Code --- a Case
                 Study",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "2",
  pages =        "207--232",
  month =        oct,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68N05 (03B70 68T99)",
  MRnumber =     "89a:68020",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics); C4240 (Programming
                 and algorithm theory); C4250 (Database theory)",
  corpsource =   "Dept. of Comput. Sci., Rutgers Univ., New Brunswick,
                 NJ, USA",
  countrypub =   "UK A04",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "asymptotic running time; attribute closure; automatic
                 programming; automatic top-down program development;
                 computation; computational complexity; data structure
                 selection; database; differencing; efficient RAM code;
                 finite; fixed point iteration; formal problem
                 specifications; linear time solution; mechanical
                 translation; problem transformation; Program Synthesis,
                 program transformation, RAPTS; programming theory;
                 RAPTS; relational databases; set; set theoretical
                 problem; specifications; symbol manipulation; symbolic;
                 theory; transformational programming system; upper
                 bound; worst case",
  treatment =    "B Bibliography; T Theoretical or Mathematical",
}

@Article{Gallier:1987:FAT,
  author =       "Jean H. Gallier",
  title =        "Fast algorithms for testing unsatisfiability of ground
                 {Horn} clauses with equations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "2",
  pages =        "233--254",
  month =        oct,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35 68Q25)",
  MRnumber =     "89k:68131",
  MRreviewer =   "John Cowles",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Pennsylvania Univ.,
                 Philadelphia, PA, USA",
  countrypub =   "UK A05",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "clauses with equations; computational complexity;
                 congruence closure; Congruence Closure, Automated
                 Theorem Proving; fast algorithms; formal logic; ground
                 Horn; symbol manipulation; symbolic computation;
                 unsatisfiability testing",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Royle:1987:TGD,
  author =       "Gordon F. Royle",
  title =        "The Transitive Groups of Degree Twelve",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "2",
  pages =        "255--268",
  month =        oct,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20B05",
  MRnumber =     "89b:20010",
  MRreviewer =   "Martin W. Liebeck",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics); C7310
                 (Mathematics)",
  corpsource =   "Dept. of Math., Western Australia Univ., Nedlands, WA,
                 Australia",
  countrypub =   "UK A06",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "CAYLEY group theory package; group theory; mathematics
                 computing; minimal; nonconjugate transitive groups of
                 degree twelve; pairwise; symbol manipulation; symbolic
                 computation; transitive groups",
  treatment =    "T Theoretical or Mathematical; X Experimental",
}

@Article{Gibert:1987:FPC,
  author =       "Jacek Gibert",
  title =        "Functional Programming with Combinators",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "3",
  pages =        "269--293",
  month =        dec,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68N05 (03B40 03B70 68Q40 68Q55)",
  MRnumber =     "89a:68019",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C4240 (Programming and algorithm
                 theory); C5220 (Computer architecture); C6130 (Data
                 handling techniques); C6150C (Compilers, interpreters
                 and other processors); C7310 (Mathematics)",
  corpsource =   "Dept. of Comput. Sci., Melbourne Univ., Parkville,
                 Vic., Australia",
  countrypub =   "UK A01",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; algebraic; algebraic model; architecture;
                 combinator reduction; computer; computer architecture;
                 data flow; fine-grain parallelism; functional
                 programming; functional simulator; interpreter;
                 interpreters; JA Machine; JAM; manipulation;
                 mathematics computing; parallel architectures; Parallel
                 Computation; parallel programming; program; programming
                 theory; sequential/parallel; symbol manipulation;
                 symbolic computation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kaplan:1987:SCT,
  author =       "St{\'e}phane Kaplan",
  title =        "Simplifying conditional term rewriting systems:
                 unification, termination and confluence",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "3",
  pages =        "295--334",
  month =        dec,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q50 (03B70 68Q65 68T15)",
  MRnumber =     "89d:68049",
  MRreviewer =   "Laurent Kott",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1230 (Artificial intelligence); C4210 (Formal
                 logic)",
  corpsource =   "Univ. des Sci., Orsay, France",
  countrypub =   "UK A02",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Bendix theorem proving methods; conditional term;
                 confluence; correctness of evaluation; formal logic;
                 Knuth-; procedures; recursive; recursivity control;
                 reduction; rewriting systems; simplifying systems;
                 symbol manipulation; symbolic computation; termination;
                 theorem proving; unification in conditional theories;
                 Unification K:Knuth--Bendix",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hilali:1987:ADN,
  author =       "A. Hilali",
  title =        "On the algebraic and differential {Newton--Puiseux}
                 polygons",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "3",
  pages =        "335--349",
  month =        dec,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "65L99 (34A20 34A30)",
  MRnumber =     "89b:65198",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C1120 (Analysis)",
  corpsource =   "Inst. Nat. Polytech. de Grenoble, France",
  countrypub =   "UK A03",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic Newton--Puiseux polygons; Differential
                 equations; differential Newton--Puiseux polygons;
                 formal; holomorphic matrix; irregular singular point;
                 linear algebra; linear differential equations;
                 manipulation; punctured neighbourhood; singularity
                 classification; super-irreducible form; symbol;
                 symbolic computation; symmetric functions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Stifter:1987:GRR,
  author =       "Sabine Stifter",
  title =        "A Generalization of Reduction Rings",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "3",
  pages =        "351--364",
  month =        dec,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (13-04)",
  MRnumber =     "89h:68077",
  MRreviewer =   "Heinrich Rolletschek",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C1160 (Combinatorial mathematics)",
  corpsource =   "Res. Inst. for Symbolic Comput., Johannes Kepler
                 Univ., Linz, Austria",
  countrypub =   "UK A04",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; number theory; symbol manipulation; symbolic
                 computation; generalised reduction rings; Gr{\"o}bner;
                 bases; arithmetic operations; ordering",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Young:1987:GGU,
  author =       "D. A. Young and P. S. Wang",
  title =        "{GI/S}: a graphical user interface for symbolic
                 computation systems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "3",
  pages =        "365--380",
  month =        dec,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C6130B (Graphics
                 techniques); C6170 (Expert systems); C7310
                 (Mathematics)",
  corpsource =   "Dept. of Math. Sci., Kent State Univ., OH, USA",
  countrypub =   "UK A05",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "2-D display; command; computer graphics; Franz LISP;
                 GI/S; graphic plotting; graphical user interface;
                 history mechanism; line editing; MACSYMA; manipulation;
                 mathematical expression manipulation by mouse;
                 mathematics computing; multiple; symbol; symbolic
                 computation; Tektronix 4404 workstation; user
                 interfaces; window environment",
  treatment =    "P Practical",
}

@Article{Beyer:1987:VCT,
  author =       "W. A. Beyer and L. R. Fawcett and R. D. Mauldin and B.
                 K. Swartz",
  title =        "The volume common to two congruent circular cones
                 whose axes intersect symmetrically",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "3",
  pages =        "381--390",
  month =        dec,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C1160 (Combinatorial mathematics);
                 C7310 (Mathematics)",
  corpsource =   "Los Alamos Nat. Lab., NM, USA",
  countrypub =   "UK A06",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; common volume; computational geometry;
                 congruent circular cones; intersecting axes; MACSYMA;
                 MACSYMA, Geometry; mathematics computing; symbol
                 manipulation; symbolic computation; symmetrically-",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Elishakoff:1987:ASA,
  author =       "Isaac Elishakoff and Brian Couch",
  title =        "Application of Symbolic Algebra to the Instability of
                 a Nonconservative System",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "3",
  pages =        "391--396",
  month =        dec,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/Comp.Alg.1.bib; Theory/reduce.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "A0230 (Function theory, analysis); A0270
                 (Computational techniques); A4630L (Buckling and
                 instability); C1110 (Algebra); C1120 (Analysis); C7310
                 (Mathematics); C7320 (Physics and Chemistry)",
  corpsource =   "Dept. of Mech. Eng., Naval Postgraduate Sch.,
                 Monterey, CA, USA",
  countrypub =   "UK A07",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; buckling; computer; computing; differential
                 equations; flutter buckling; follower force;
                 foundation; Galerkin method; instability; manipulation;
                 mathematics; mechanical stability; nonconservative
                 system; physics computing; Reduce; REDUCE, physics;
                 symbol; symbolic algebra; tapered column; uniform
                 elastic",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "Applications of Symbolic Algebra to the Instability of
                 a Nonconservative System",
}

@Article{Bandyopadhyay:1987:SSI,
  author =       "S. Bandyopadhyay and J. S. Devitt",
  title =        "{SIS}: a symbolic information management system",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "3",
  pages =        "397--408",
  month =        dec,
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4250 (Database theory); C6160D (Relational DBMS);
                 C7310 (Mathematics)",
  corpsource =   "Sch. of Comput. Sci., Windsor Univ., Ont., Canada",
  countrypub =   "UK A08",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic constraint satisfaction; automatic query
                 inference systems; computation; database management
                 systems; database theory; databases; formulae;
                 management system; MAPLE; Maple algebra system;
                 mathematical; mathematics computing; query by example;
                 relational; relational databases; Scientific
                 Information System; SIS; symbol manipulation; symbolic;
                 symbolic information",
  treatment =    "P Practical",
}

@Article{Dershowitz:1987:CTR,
  author =       "Nachum Dershowitz",
  title =        "Corrigendum: {``Termination of rewriting''}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "4",
  number =       "3",
  pages =        "409--410",
  year =         "1987",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q50 (68T15)",
  MRnumber =     "88j:68099b",
  MRreviewer =   "Ursula Martin",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "See \cite{Dershowitz:1987:TR}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
}

@Article{Weispfenning:1988:CAL,
  author =       "Volker Weispfenning",
  title =        "The Complexity of Almost Linear {Diophantine}
                 Problems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "5",
  number =       "1--2",
  pages =        "3--28 (or 3--27??)",
  month =        feb # "--" # apr,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11U05 (03C10 03D15 12-04 68T15)",
  MRnumber =     "89g:11123",
  MRreviewer =   "Maurice Mignotte",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C4210 (Formal logic); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Math. Inst., Heidelberg Univ., West Germany",
  countrypub =   "UK A01",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; complexity; computational complexity;
                 decidability; discretely; finitely many discrete
                 valuations; finitely many independent orderings;
                 first-; formal logic; formulas; linear; linear decision
                 procedures; linear problems; order language; ordered
                 fields; quantifier elimination; quantifier-free linear;
                 symbol manipulation; symbolic algorithms; valued
                 fields",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "The Complexity of Linear Problems in Fields",
}

@Article{Davenport:1988:RQE,
  author =       "James H. Davenport and Joos Heintz",
  title =        "Real Quantifier Elimination is Doubly Exponential",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "5",
  number =       "1--2",
  pages =        "29--36 (or 29--35??)",
  month =        feb # "--" # apr,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B25 (03C10 03D15 12L12)",
  MRnumber =     "89g:03009",
  MRreviewer =   "A. A. Mullin",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Sch. of Math. Sci., Bath Univ., UK",
  countrypub =   "UK A02",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; computational complexity; cylindrical
                 algebraic decomposition; Cylindrical Algebraic
                 Decomposition, Real Algebraic Geometry; doubly; doubly
                 exponential time; exponential space; real closed
                 fields; real quantifier elimination; symbol
                 manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Grigorev:1988:SSP,
  author =       "D. Yu. Grigor\cprime{}ev and N. N. {Vorobjov, Jr.}",
  title =        "Solving Systems of Polynomial Inequalities in
                 Sub-Exponential Time",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "5",
  number =       "1--2",
  pages =        "37--64",
  month =        feb # "--" # apr,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13-04 (13B25 68Q40 90C10)",
  MRnumber =     "89h:13001",
  MRreviewer =   "Maurice Mignotte",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Math., Acad. of Sci., Leningrad, USSR",
  countrypub =   "UK A03",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "equations; polynomial inequalities; polynomial-time
                 algorithm; polynomials; subexponential time; symbol
                 manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Grigorev:1988:CDT,
  author =       "D. Yu. Grigor\cprime{}ev",
  title =        "Complexity of Deciding {Tarski} Algebra",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "5",
  number =       "1--2",
  pages =        "65--108",
  month =        feb # "--" # apr,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03D15 (03B25 03C10 11Y16)",
  MRnumber =     "90b:03054",
  MRreviewer =   "Annalisa Marcja",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C4210 (Formal logic); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Dept. of Steklov Math. Inst., Acad. of Sci.,
                 Leningrad, USSR",
  countrypub =   "UK A04",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; computational complexity; decidability;
                 Decision algorithm, Real Closed Fields; decision
                 method; manipulation; polynomial time complexity;
                 symbol; Tarski algebra",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Risler:1988:SAC,
  author =       "Jean-Jacques J. Risler",
  title =        "Some Aspects of Complexity in Real Algebraic
                 Geometry",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "5",
  number =       "1--2",
  pages =        "109--120 (or 109--119??)",
  month =        feb # "--" # apr,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12D10 (12-04 14-04 14G30)",
  MRnumber =     "89k:12002",
  MRreviewer =   "Jes{\'u}s M. Ruiz",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C1160 (Combinatorial mathematics);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "UER de Math., Paris 7 Univ., France",
  countrypub =   "UK A05",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; algebraic geometry; bounds; complexity;
                 computational complexity; cylindrical algebraic
                 decomposition; geometry; lower; real; reviews;
                 semi-algebraic sets; set; symbol manipulation; theory;
                 topology",
  treatment =    "G General Review; T Theoretical or Mathematical",
}

@Article{Coste:1988:TLC,
  author =       "M. Coste and M. F. Roy",
  title =        "{Thom}'s Lemma, the Coding of Real Algebraic Numbers
                 and the Computation of the Topology of Semi-Algebraic
                 Sets",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "5",
  number =       "1--2",
  pages =        "121--130 (or 121--129??)",
  month =        feb # "--" # apr,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12D10 (14G30)",
  MRnumber =     "89g:12002",
  MRreviewer =   "Jean-Jacques Risler",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C1160 (Combinatorial mathematics)",
  corpsource =   "IRMAR, Rennes I Univ., France",
  countrypub =   "UK A06",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; computation; computation theory; cylindrical
                 algebraic decomposition; encoding; geometry; number;
                 polynomials; Real algebraic geometry; real algebraic
                 number coding; roots of; semi-algebraic sets; set
                 theory; symbol manipulation; theory; Thom lemma;
                 topology",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Arnborg:1988:ADR,
  author =       "Stefan Arnborg and Huichun Feng",
  title =        "Algebraic Decomposition of Regular Curves",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "5",
  number =       "1--2",
  pages =        "131--140",
  month =        feb # "--" # apr,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (12-04 14-04 14G30)",
  MRnumber =     "90a:68042",
  MRreviewer =   "Michel Coste",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Numerical Anal. and Comput. Sci., R. Inst. of
                 Technol., Stockholm, Sweden",
  countrypub =   "UK A07",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; bivariate; computational complexity;
                 cylindrical algebraic; Cylindrical Algebraic
                 Decomposition; decomposition; polynomial;
                 sign-invariant decomposition; symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{McCallum:1988:IPO,
  author =       "Scott McCallum",
  title =        "An Improved Projection Operation for Cylindrical
                 Algebraic Decomposition of Three-Dimensional Space",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "5",
  number =       "1--2",
  pages =        "141--162 (or 141--161??)",
  month =        feb # "--" # apr,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12-04 (14-04 51-04)",
  MRnumber =     "89m:12001",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C1160 (Combinatorial mathematics)",
  corpsource =   "Dept. of Comput. Sci., Toronto Univ., Ont., Canada",
  countrypub =   "UK A08",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; Collins algorithm; complex analytic;
                 computing time; cylindrical algebraic decomposition;
                 dimensional space; geometry; operation; projection;
                 quantifier elimination; r-variate polynomials; symbol
                 manipulation; three-; trivariate polynomials",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Arnon:1988:AAC,
  author =       "Dennis S. Arnon and George E. Collins and Scott
                 McCallum",
  title =        "An Adjacency Algorithm for Cylindrical Algebraic
                 Decompositions of Three-Dimensional Space",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "5",
  number =       "1--2",
  pages =        "163--188 (or 163--187??)",
  month =        feb # "--" # apr,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q20 (03B35 03C10 51-04 68U05)",
  MRnumber =     "90g:68048a",
  MRreviewer =   "Maurice Mignotte",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C1160 (Combinatorial mathematics)",
  corpsource =   "Xerox PARC, Palo Alto, CA, USA",
  countrypub =   "UK A09",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "adjacency algorithm; algebra; cylindrical algebraic
                 decompositions; geometry; semi-algebraic cells; set
                 theory; symbol manipulation; three-dimensional space",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Arnon:1988:CBC,
  author =       "Dennis S. Arnon",
  title =        "A Cluster-Based Cylindrical Algebraic Decomposition
                 Algorithm",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "5",
  number =       "1--2",
  pages =        "189--212",
  month =        feb # "--" # apr,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q20 (03B35 03C10 51-04 68U05)",
  MRnumber =     "90g:68048b",
  MRreviewer =   "Maurice Mignotte",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C1160 (Combinatorial mathematics)",
  corpsource =   "Xerox PARC, Palo Alto, CA, USA",
  countrypub =   "UK A10",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; based cylindrical algebraic decomposition
                 algorithm; cluster-; Collins algorithm; Euclidean space
                 partitioning; finite; geometry; semi-algebraic cells;
                 set; set theory; symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Arnon:1988:PTA,
  author =       "Dennis S. Arnon and Scott McCallum",
  title =        "A Polynomial-time Algorithm for the Topological Type
                 of a Real Algebraic Curve",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "5",
  number =       "1--2",
  pages =        "213--236",
  month =        feb # "--" # apr,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12D99 (12-04 14-04 14G30 68Q20)",
  MRnumber =     "89k:12005",
  MRreviewer =   "Hale F. Trotter",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C1160 (Combinatorial mathematics);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Xerox PARC, Palo Alto, CA, USA",
  countrypub =   "UK A11",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; curve; cylindrical algebraic decomposition;
                 geometry; polynomial-time algorithm; real algebraic;
                 symbol manipulation; topological type; topology",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Arnon:1988:MQE,
  author =       "Dennis S. Arnon and Maurice Mignotte",
  title =        "On Mechanical Quantifier Elimination for Elementary
                 Algebra and Geometry",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "5",
  number =       "1--2",
  pages =        "237--260 (or 237--259??)",
  month =        feb # "--" # apr,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B35 (03C10 12D10 51-04 68T15)",
  MRnumber =     "90a:03010",
  MRreviewer =   "F. J. van der Linden",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C1160 (Combinatorial mathematics)",
  corpsource =   "Xerox PARC, Palo Alto, CA, USA",
  countrypub =   "UK A12",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; cylindrical algebraic decomposition;
                 elementary algebra; geometry; mechanical quantifier
                 elimination; number theory; symbol manipulation;
                 theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lazard:1988:QEO,
  author =       "Daniel Lazard",
  title =        "Quantifier Elimination: Optimal Solutions for Two
                 Classical Examples",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "5",
  number =       "1--2",
  pages =        "261--266",
  month =        feb # "--" # apr,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12L05 (03B35 03C10 11U05 51-04 68T15)",
  MRnumber =     "89k:12017",
  MRreviewer =   "Maurice Mignotte",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C1160 (Combinatorial mathematics);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Paris VI Univ., France",
  countrypub =   "UK A13",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "4 polynomial; algebra; complexity; computational
                 complexity; degree; ellipse; geometry; manipulation;
                 optimal solution; positive values; quantifier
                 elimination; Real Algebraic Geometry; symbol; unit
                 circle",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "Quantifier Elimination: Optimal Solution for Two
                 Classical Examples",
}

@Article{Arnon:1988:BQE,
  author =       "Dennis S. Arnon",
  title =        "A Bibliography of Quantifier Elimination for Real
                 Closed Fields",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "5",
  number =       "1--2",
  pages =        "267--274",
  month =        feb # "--" # apr,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12D15 (00A15 03C10 03C60 12L12)",
  MRnumber =     "89g:12003",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "Ai/Constr.logic.prog.bib;
                 http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C1160 (Combinatorial mathematics);
                 C1230 (Artificial intelligence); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Xerox PARC, Palo Alto, CA, USA",
  countrypub =   "UK A14",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; algorithmic quantifier; bibliography;
                 computational complexity; elimination; geometry; real
                 closed fields; set theory; symbol manipulation; theorem
                 proving",
  treatment =    "B Bibliography",
  xxtitle =      "Bibliography on Algorithms in Real Algebra Geometry",
}

@Article{Butler:1988:PHA,
  author =       "Gregory Butler",
  title =        "A proof of {Holt}'s algorithm",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "5",
  number =       "3",
  pages =        "275--284 (or 275--283??)",
  month =        jun,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20-04",
  MRnumber =     "89k:20002",
  MRreviewer =   "Jennifer Whitehead",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0210 (Algebra); C1110 (Algebra)",
  corpsource =   "Basser Dept. of Comput. Sci., Sydney Univ., NSW,
                 Australia",
  countrypub =   "UK A01",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "group theory; Groups; Holt algorithm; p-group; p-step
                 central series; power commutator; presentation; series
                 (mathematics); subnormal series",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Glasby:1988:CNF,
  author =       "S. P. Glasby",
  title =        "Constructing Normalisers in Finite Soluble Groups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "5",
  number =       "3",
  pages =        "285--294",
  month =        jun,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (20-04 20D10)",
  MRnumber =     "90f:68092",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0210 (Algebra); C1110 (Algebra)",
  corpsource =   "Dept. of Pure Math., Sydney Univ., NSW, Australia",
  countrypub =   "UK A02",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Carter subgroups; finite soluble groups; group theory;
                 Hall pi-; normalisers construction; subgroup H; Sylow
                 3-subgroup",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Glasby:1988:ISF,
  author =       "S. P. Glasby",
  title =        "Intersecting Subgroups of Finite Soluble Groups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "5",
  number =       "3",
  pages =        "295--302 (or 295--301??)",
  month =        jun,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (20-04 20D10)",
  MRnumber =     "90f:68093",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0210 (Algebra); C1110 (Algebra)",
  corpsource =   "Dept. of Pure Math., Sydney Univ., NSW, Australia",
  countrypub =   "UK A03",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Abelian terms; automorphism group; finite soluble
                 groups; group theory; hypereccentric factor;
                 intersecting subgroups; nilpotent series; Sylow bases;
                 system normalisers",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kobayashi:1988:SSA,
  author =       "Hidetsune Kobayashi and Tetsuro Fujise and Akio
                 Furukawa",
  title =        "Solving Systems of Algebraic Equations by a General
                 Elimination Method",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "5",
  number =       "3",
  pages =        "303--320",
  month =        jun,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "65H10",
  MRnumber =     "90g:65073",
  MRreviewer =   "M. S. Abou El-Seoud",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Dept. of Math., Nihon Univ., Tokyo, Japan",
  countrypub =   "UK A04",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "symbol manipulation; algebraic equations system;
                 general elimination method; factorisation; U-resultant;
                 linear factors; Gr{\"o}bner basis; polynomials;
                 Factorization, Gr{\"o}bner Bases",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sakata:1988:FMS,
  author =       "Shojiro Sakata",
  title =        "Finding a Minimal Set of Linear Recurring Relations
                 Capable of Generating a Given Finite Two-Dimensional
                 Array",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "5",
  number =       "3",
  pages =        "321--338 (or 321--337??)",
  month =        jun,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "94B15 (13-04 68Q25)",
  MRnumber =     "89d:94045",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Production Syst. Eng., Toyohashi Univ. of
                 Technol., Japan",
  countrypub =   "UK A05",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Gr{\"o}bner Bases; Berlekamp--Massey algorithm;
                 computational complexity; two-dimensional array;
                 feedback shift-register; finite linear; linear
                 recurring relations; minimal set",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Madlener:1988:PNA,
  author =       "Klaus Madlener and Friedrich Otto",
  title =        "Pseudo-Natural Algorithms for Finitely Generated
                 Presentations of Monoids and Groups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "5",
  number =       "3",
  pages =        "339--358",
  month =        jun,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20F10 (20M05 68Q50)",
  MRnumber =     "90f:20047",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C4210 (Formal logic)",
  corpsource =   "Fachbereich Inf., Kaiserslautern Univ., West Germany",
  countrypub =   "UK A06",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Knuth--Bendix; Gr{\"o}bner bases; Rewriting;
                 context-free; context-free grammars; context-sensitive
                 grammars; context-sensitive presentation; finitely
                 generated presentations; group; groups; monoids;
                 presentation; problem; theory; word",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mints:1988:PSP,
  author =       "G. Mints and E. Tyugu",
  title =        "The programming system {PRIZ}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "5",
  number =       "3",
  pages =        "359--376 (or 359--375??)",
  month =        jun,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150G (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "Inst. of Cybern., Acad. of Sci., Tallinn, Estonian
                 SSR, USSR",
  countrypub =   "UK A07",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "application domains; automatic synthesis of programs;
                 program synthesis, UTOPIST, intuitionistic systems,
                 lambda calculus, PROLOG; program verification;
                 programming; programming system PRIZ; propositional
                 calculus",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sage:1988:ATQ,
  author =       "Martin L. Sage",
  title =        "An algebraic treatment of quantum vibrations using
                 {REDUCE}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "5",
  number =       "3",
  pages =        "377--384",
  month =        jun,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "81-04",
  MRnumber =     "946 589",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/Comp.Alg.1.bib; Theory/reduce.bib",
  note =         "See erratum \cite{Sage:1989:EAT}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C7320 (Physics and
                 Chemistry)",
  corpsource =   "Dept. of Chem., Syracuse Univ., NY, USA",
  countrypub =   "UK A08",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic; algebraic treatment; chemistry; eigenvalue;
                 manipulations; mathematical physics; non-commuting,
                 physics, chemistry; physics computing; problems;
                 quantum vibrations; REDUCE; Reduce; symbol
                 manipulation; two dimensional nearly harmonic
                 oscillator",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxtitle =      "An Algebraic Treatment of Quantum Vibration Using
                 {REDUCE}",
}

@Article{Mawata:1988:SHE,
  author =       "C. P. Mawata",
  title =        "Solving the heat equation symbolically with {MuSimp}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "5",
  number =       "3",
  pages =        "385--389",
  month =        jun,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "65V05",
  MRnumber =     "946 590",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation);
                 C6130 (Data handling techniques); C7320 (Physics and
                 Chemistry)",
  corpsource =   "Dept. of Math., Hawaii Univ., Honolulu, HI, USA",
  countrypub =   "UK A09",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "heat equations; Heat Polynomials; MuSimp; Physics;
                 physics computing; polynomials; symbol manipulation;
                 symbolic solution",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bachmair:1988:CPC,
  author =       "Leo Bachmair and Nachum Dershowitz",
  key =          "BaDe88",
  title =        "Critical Pair Criteria for Completion",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "1",
  pages =        "1--18",
  month =        aug,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q50 (68Q40)",
  MRnumber =     "89j:68087",
  MRreviewer =   "J{\"u}rgen Dassow",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Misc/formal.hardware.verification.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1230 (Artificial intelligence); C4210 (Formal
                 logic)",
  corpsource =   "Dept. of Comput. Sci., State Univ. of New York, Stony
                 Brook, NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keyword =      "Rewrite Methods",
  keywords =     "abstract level; criterion; critical pair; equational
                 inference system; equational proofs; formal logic;
                 Knuth--Bendix completion method; Knuth--Bendix,
                 Rewrite; orderings; proof ordering techniques; theorem
                 proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kapur:1988:OPS,
  author =       "Deepak Kapur and David R. Musser and Paliath
                 Narendran",
  title =        "Only Prime Superpositions Need be Considered in the
                 {Knuth--Bendix} Completion Procedure",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "1",
  pages =        "19--36",
  month =        aug,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q50 (03B35 68Q40)",
  MRnumber =     "89j:68093",
  MRreviewer =   "J{\"u}rgen Dassow",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C1230 (Artificial intelligence);
                 C6130 (Data handling techniques)",
  corpsource =   "Corp. Res. and Dev., General Electric Co.,
                 Schenectady, NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "associative-commutative operators; Church--Rosser
                 property; composite; critical pair of terms; formal
                 logic; Knuth--Bendix completion procedure; local
                 confluence; proof techniques; rewriting system;
                 superpositions; symbol manipulation; term; Term
                 Rewriting, Church Rosser; theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kandri-Rody:1988:CGB,
  author =       "Abdelilah Kandri-Rody and Deepak Kapur",
  title =        "Computing a {Gr{\"o}bner} basis of a polynomial ideal
                 over a {Euclidean} domain",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "1",
  pages =        "37--58 (or 37--57??)",
  month =        aug,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13-04 (13F07 68Q40 68Q50)",
  MRnumber =     "89h:13002",
  MRreviewer =   "Bernd Sturmfels",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "Dept. des Math., Univ. Cadi Ayyad, Marrakech,
                 Morocco",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "polynomials; Buchberger algorithms; Gr{\"o}bner basis;
                 polynomial ideal; Euclidean domain; algorithm; Gaussian
                 integers; algebraic; integers; quadratic number
                 fields",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Robertson:1988:TTW,
  author =       "Edmund F. Robertson",
  title =        "{Tietze} Transformations with Weighted Substring
                 Search",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "1",
  pages =        "59--64",
  month =        aug,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (20F05)",
  MRnumber =     "89h:68076",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Math. Inst., St. Andrews, UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computer program; elimination; group; group theory;
                 Groups; length function; presentation; routing; Tietze
                 transformations; weighted substring search",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Myers:1988:PSR,
  author =       "Thomas J. Myers and Maya B. Gokhale",
  title =        "Parallel Scheduling of Recursively Defined Arrays",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "1",
  pages =        "65--82 (or 65--81??)",
  month =        aug,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (68Q25)",
  MRnumber =     "961 371",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6115 (Programming support); C1180 (Optimisation
                 techniques)",
  corpsource =   "Delaware Univ., Newark, DE, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "array; automatic; automatic programming; concurrent
                 programs; dependency vectors; element; generation;
                 hyperplanes; integer programming; parallel; parallel
                 scheduling; program synthesis, program transformation;
                 programming; PS automatic program generation system;
                 recursive equations; recursively defined arrays;
                 variable length",
  treatment =    "P Practical",
}

@Article{Cantone:1988:ASS,
  author =       "Domenico Cantone and Susanna Ghelfo and Eugenio
                 Omodeo",
  title =        "The automation of syllogistic. {I}. Syllogistic normal
                 forms",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "1",
  pages =        "83--98 (or 82--98??)",
  month =        aug,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35 68R10)",
  MRnumber =     "89i:68111",
  MRreviewer =   "Hans-Joachim Goltz",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Courant Inst., New York Univ., NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "automation of syllogistic; broad-; combinatorial
                 explosion; friendliness; man-machine interaction;
                 predicate calculus; set theory; set theory, theorem
                 proving; spectrum proof verification system;
                 syllogistic normal forms; user-",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wrathall:1988:WPF,
  author =       "C. Wrathall",
  title =        "The Word Problem for Free Partially Commutative
                 Groups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "1",
  pages =        "99--104",
  month =        aug,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (03D40 20F10)",
  MRnumber =     "89h:68078",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Math., California Univ., Santa Barbara, CA,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm; correctness; formal languages; free
                 partially commutative groups; linear-time; programming
                 theory; Thue systems; word problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Michler:1988:ADS,
  author =       "Gerhard O. Michler",
  title =        "An Algorithm for Determining the Simplicity of a
                 Modular Group Representation",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "1",
  pages =        "105--112 (or 105--111??)",
  month =        aug,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20C15 (20C20)",
  MRnumber =     "89h:20013",
  MRreviewer =   "J. L. Alperin",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Dept. of Math., Essen Univ., West Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Amitsur-Levitzki theorem; arbitrary splitting field;
                 finite group; finite-dimension group representation;
                 group theory; matrix; modular group; polynomial
                 identities; representation; ring; simplicity
                 determining algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dixmier:1988:MNF,
  author =       "J. Dixmier and D. Lazard",
  title =        "Minimum number of fundamental invariants for the
                 binary form of degree 7",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "1",
  pages =        "113--116 (or 113--115??)",
  month =        aug,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11E76 (15A72 68Q40)",
  MRnumber =     "90d:11046",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Inst. des Hautes Etudes Sci., Bures-sur-Yvette,
                 France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "binary form of degree 7; computer algebra; fundamental
                 invariants; hand computations; minimal; number; number
                 theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ollongren:1988:PRF,
  author =       "Alexander Ollongren",
  title =        "On a particular restricted five-body problem: an
                 analysis with computer algebra",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "1",
  pages =        "117--127 (or 117--126??)",
  month =        aug,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "70F10 (70-04)",
  MRnumber =     "89j:70015",
  MRreviewer =   "Fu Tong",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics)",
  corpsource =   "Dept. of Math. and Comput. Sci., Leiden Univ.,
                 Netherlands",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "celestial mechanics; computer algebra; Lagrangian
                 points of equilibrium; linear stability analysis;
                 mathematics computing; MuMATH; particular restricted
                 five-body problem; REDUCE",
  treatment =    "P Practical",
  xxtitle =      "On a Restricted Five-Body Problem: An Analysis with
                 Computer Algebra",
}

@Article{Davenport:1988:CAA,
  author =       "J. H. Davenport",
  title =        "Computer Algebra Applied to Itself",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "1",
  pages =        "127--132",
  month =        aug,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (12-04 12D10)",
  MRnumber =     "89m:68072",
  MRreviewer =   "D. Z. Spicer",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4130 (Interpolation and function
                 approximation)",
  corpsource =   "Sch. of Math. Sci., Bath Univ., UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "complexity analysis; Complexity, Real root isolation,
                 REDUCE; computer algebra; mathematics computing;
                 polynomials; Reduce; roots of",
  treatment =    "P Practical",
}

@Article{Bayer:1988:CCS,
  author =       "David Bayer and Michael Stillman",
  title =        "On the Complexity of Computing Syzygies",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "2--3",
  pages =        "135--148 (or 135--147??)",
  month =        oct # "--" # dec,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (13-04 13B25)",
  MRnumber =     "90g:68071",
  MRreviewer =   "Daniel Lazard",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational aspects of commutative algebra.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4240 (Programming and algorithm
                 theory)C4130 (Interpolation and function
                 approximation); C6130 (Data handling techniques)",
  corpsource =   "Dept. of Math., Columbia Univ., New York, NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Gr{\"o}bner bases; complexity; computational
                 complexity; double exponential; double exponential
                 degrees; minimal syzygies; polynomial ideal;
                 polynomials; projective space; regularity; symbol
                 manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gianni:1988:GBP,
  author =       "Patrizia Gianni and Barry Trager and Gail Zacharias",
  title =        "{Gr{\"o}bner bases and primary decomposition of
                 polynomial ideals}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "2--3",
  pages =        "149--168 (or 149--167??)",
  month =        oct # "--" # dec,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (13-04 13A17)",
  MRnumber =     "90f:68091",
  MRreviewer =   "Daniel Lazard",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational aspects of commutative algebra.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4130 (Interpolation and function
                 approximation); C6130 (Data handling techniques)",
  corpsource =   "Pisa Univ., Italy",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "polynomials; symbol manipulation; Gr{\"o}bner bases;
                 primary decomposition; polynomial ideals; algorithm;
                 primary decomposition; factorially closed; algorithmic
                 principal ideal domain; constructive PID; primary
                 decomposition",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shtokhamer:1988:LCA,
  author =       "R. Shtokhamer",
  title =        "Lifting canonical algorithms from a ring $ {R} $ to
                 the ring $ {R}[x] $",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "2--3",
  pages =        "169--182 (or 169--181??)",
  month =        oct # "--" # dec,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13-04 (13A15 68Q40)",
  MRnumber =     "90g:13002",
  MRreviewer =   "Ferdinando Mora",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational aspects of commutative algebra.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4130 (Interpolation and function
                 approximation); C6130 (Data handling techniques)",
  corpsource =   "Dept. of Comput. and Inf. Sci., Delaware Univ.,
                 Newark, DE, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "ample sets; canonical algorithms lifting; canonical
                 form algorithms; Noetherian rings; Polynomial Ideal
                 Theory; polynomial ring; polynomials; symbol
                 manipulation; syzygies",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mora:1988:GFI,
  author =       "Teo Mora and Lorenzo Robbiano",
  title =        "The {Gr{\"o}bner Fan} of an ideal",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "2--3",
  pages =        "183--208",
  month =        oct # "--" # dec,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13A15 (13-04 68Q40)",
  MRnumber =     "90d:13004",
  MRreviewer =   "Felipe Cucker",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational aspects of commutative algebra.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4130 (Interpolation and function
                 approximation); C6130 (Data handling techniques)",
  corpsource =   "Dipartimento di Matematica, Genova Univ., Italy",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "polynomials; symbol manipulation; Gr{\"o}bner Fan;
                 ideal; polynomial ring; Gr{\"o}bner region; term-;
                 orderings; Universal Gr{\"o}bner Bases; polynomial
                 ideals",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bayer:1988:SBG,
  author =       "David Bayer and Ian Morrison",
  title =        "Standard bases and geometric invariant theory. {I}.
                 Initial ideals and state polytopes",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "2--3",
  pages =        "209--218 (or 209--217??)",
  month =        oct # "--" # dec,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13-04 (13B25 68Q40)",
  MRnumber =     "90e:13001",
  MRreviewer =   "Ferdinando Mora",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational aspects of commutative algebra.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling techniques);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "Dept. of Math., Columbia Univ., New York, NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Gr{\"o}bner Bases; convex polytope; fixed coordinate
                 system; geometric invariant theory; Hilbert point;
                 initial ideals; polynomial ring; polynomials; standard
                 bases; state polytope; state polytopes; symbol
                 manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ferro:1988:GBH,
  author =       "Giuseppa Carr{\`a} Ferro",
  title =        "{Gr{\"o}bner} bases and {Hilbert} schemes. {I}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "2--3",
  pages =        "219--230",
  month =        oct # "--" # dec,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13A15 (13B25 14C05 68Q40)",
  MRnumber =     "90g:13005",
  MRreviewer =   "Daniel Lazard",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational aspects of commutative algebra.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling
                 techniques)",
  corpsource =   "Dipartimento di Matematica, Catania Univ., Italy",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "symbol manipulation; Gr{\"o}bner bases; Hilbert
                 schemes; sequential term ordering; monomials; affine
                 scheme; prime ideals; open subsets",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kredel:1988:CDI,
  author =       "Heinz Kredel and Volker Weispfenning",
  title =        "Computing dimension and independent sets for
                 polynomial ideals",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "2--3",
  pages =        "231--248 (or 231--247??)",
  month =        oct # "--" # dec,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (13-04 13A15)",
  MRnumber =     "90c:68038",
  MRreviewer =   "Daniel Lazard",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational aspects of commutative algebra.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4130 (Interpolation and function
                 approximation); C6130 (Data handling techniques)",
  corpsource =   "Passau Univ., West Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Gr{\"o}bner Bases; polynomials; symbol manipulation;
                 dimension; independent sets; polynomial ideals;
                 Gr{\"o}bner; basis; lexicographical term order;
                 zero-dimensionality; Hilbert polynomial; prime ideals;
                 strong independence; modulo; admissible term order;
                 ALDES/SAC-2 system",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Giusti:1988:CDT,
  author =       "Marc Giusti",
  title =        "Combinatorial dimension theory of algebraic
                 varieties",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "2--3",
  pages =        "249--266 (or 249--265??)",
  month =        oct # "--" # dec,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "14-04 (68Q40)",
  MRnumber =     "90e:14001",
  MRreviewer =   "Felipe Cucker",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational aspects of commutative algebra.",
  acknowledgement = ack-nhfb,
  classcodes =   "B0250 (Combinatorial mathematics); B0290F
                 (Interpolation and function approximation); C1160
                 (Combinatorial mathematics); C4130 (Interpolation and
                 function approximation); C7310 (Mathematics)",
  corpsource =   "Centre de Math., Ecole Polytech., Palaiseau, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic geometry; algebraic varieties; algebraic
                 variety; algorithms; combinatorial dimension theory;
                 combinatorial mathematics; complexity; nonoptimal worst
                 case; polynomials; projective; symbol manipulation;
                 truncation idea",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shannon:1988:UGB,
  author =       "David Shannon and Moss Sweedler",
  title =        "Using {Gr{\"o}bner} bases to determine algebra
                 membership, split surjective algebra homomorphisms
                 determine birational equivalence",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "2--3",
  pages =        "267--274 (or 267--273??)",
  month =        oct # "--" # dec,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13-04 (13B25 68Q40)",
  MRnumber =     "90e:13002",
  MRreviewer =   "Felipe Cucker",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational aspects of commutative algebra.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4130 (Interpolation and function
                 approximation); C6130 (Data handling techniques)",
  corpsource =   "Dept. of Math., Transylvania Univ., Lexington, KY,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "polynomials; symbol manipulation; IBM; Gr{\"o}bner
                 bases; algebra membership; split surjective; algebra
                 homomorphisms; birational equivalence; polynomial;
                 homomorphism; algebra generators; identity map;
                 algebra; automorphisms; computer algebra systems;
                 SCRATCHPAD II",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Gebauer:1988:IBA,
  author =       "R{\"u}diger Gebauer and H. Michael M{\"o}ller",
  title =        "On an Installation of {Buchberger}'s Algorithm",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "2--3",
  pages =        "275--286",
  month =        oct # "--" # dec,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P10 (68Q40)",
  MRnumber =     "91a:13014",
  MRreviewer =   "Ferdinando Mora",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/Comp.Alg.1.bib; Theory/reduce.bib",
  note =         "Computational aspects of commutative algebra.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling techniques);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "Springer-Verlag, New York, NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "polynomials; symbol manipulation; Buchberger algorithm
                 installation; Gr{\"o}bner bases; polynomial ideals;
                 superfluous reductions; redundant; elements; module of
                 syzygies; SCRATCHPAD II; REDUCE 3.3; computational
                 properties",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Winkler:1988:AAC,
  author =       "Franz Winkler",
  title =        "A $p$-adic approach to the computation of
                 {Gr{\"o}bner} bases",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "2--3",
  pages =        "287--304",
  month =        oct # "--" # dec,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (12-04 13-04)",
  MRnumber =     "90m:68071",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational aspects of commutative algebra.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4130 (Interpolation and function
                 approximation); C6130 (Data handling techniques)",
  corpsource =   "Inst. fur Math., Kepler Univ., Linz, Austria",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "polynomial ideals; polynomials; symbol manipulation;
                 Gr{\"o}bner bases computation; p-adic approach; finite
                 vector; polynomials; lucky prime; syzygies",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Miola:1988:CLG,
  author =       "A. Miola and T. Mora",
  title =        "Constructive lifting in graded structures: a unified
                 view of {Buchberger} and {Hensel} methods",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "2--3",
  pages =        "305--322",
  month =        oct # "--" # dec,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (13A18 13J10)",
  MRnumber =     "90f:68096",
  MRreviewer =   "Daniel Lazard",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational aspects of commutative algebra.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling techniques);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "Dipartimento di Inf. e Sistemistica, Rome Univ.,
                 Italy",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Gr{\"o}bner Bases; Buchberger method; computational
                 problems; computer algebra; constructive lifting;
                 graded structures; Hensel method; polynomial equations;
                 polynomials; symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "Constructive lifting in graded structures: a unified
                 view of {Gr{\"o}bner} and {Hensel} methods",
}

@Article{Brundu:1988:CGS,
  author =       "Michela Brundu and Fabio Rossi",
  title =        "On the computation of generalised standard bases",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "2--3",
  pages =        "323--344 (or 323--343??)",
  month =        oct # "--" # dec,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (13A18 13J10)",
  MRnumber =     "90f:68097",
  MRreviewer =   "Daniel Lazard",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational aspects of commutative algebra.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling
                 techniques)",
  corpsource =   "Dipartimento di Sci. Matematiche, Trieste Univ.,
                 Italy",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Gr{\"o}bner Bases; computation; computational
                 problems; generalized standard bases; graded
                 structures; modules; symbol manipulation; syzygies",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxtitle =      "On the computation of generalized standard bases",
}

@Article{Moller:1988:CGB,
  author =       "H. Michael M{\"o}ller",
  title =        "On the construction of {Gr{\"o}bner} bases using
                 syzygies",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "2--3",
  pages =        "345--360 (or 345--359??)",
  month =        oct # "--" # dec,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13B25 (13A15 68Q40)",
  MRnumber =     "90e:13008",
  MRreviewer =   "Daniel Lazard",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational aspects of commutative algebra.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling techniques);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "FB Math. und Inf., Fern Univ., Hagen, West Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "polynomials; symbol manipulation; construction of
                 Gr{\"o}bner bases; syzygies; multivariate; polynomial
                 ideals; coefficient domains; constructibility;
                 conditions; principal ideal rings; Buchberger
                 algorithm",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxtitle =      "On the Computation of {Gr{\"o}bner} Bases in
                 Commutative Rings",
}

@Article{Apel:1988:EBA,
  author =       "J. Apel and W. Lassner",
  title =        "An extension of {Buchberger}'s algorithm and
                 calculations in enveloping fields of {Lie} algebras",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "2--3",
  pages =        "361--370",
  month =        oct # "--" # dec,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "17-04 (17B35 68Q40)",
  MRnumber =     "91g:17002",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational aspects of commutative algebra.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling
                 techniques)",
  corpsource =   "Naturwiss.-Theoretisches Zentrum, Karl-Marx-Univ.,
                 Leipzig, East Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Lie groups; symbol manipulation; Buchberger algorithm
                 extension; enveloping fields; Lie; algebras;
                 Gr{\"o}bner bases; right fractions; left fractions; CAS
                 calculations; AMP program LIEFIELD; SYZYGY; Weyl
                 algebra; Gr{\"o}bner Bases; Lie Algebra; AMP;
                 syzygies",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Gateva-Ivanova:1988:RPA,
  author =       "Tatiana Gateva-Ivanova and Victor Latyshev",
  title =        "On recognisable properties of associative algebras",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "6",
  number =       "2--3",
  pages =        "371--388",
  month =        oct # "--" # dec,
  year =         "1988",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (16-04 16A38 16A55)",
  MRnumber =     "90f:68090",
  MRreviewer =   "H.-J. Hoehnke",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational aspects of commutative algebra.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling
                 techniques)",
  corpsource =   "Inst. of Math., Bulgarian Acad. of Sci., Sofia,
                 Bulgaria",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "symbol manipulation; noncommutative setting;
                 Gr{\"o}bner basis; recognisable; properties;
                 associative algebras; computer algebra; standard;
                 finite presentation; finite-dimensional, nilpotent;
                 nil; algebraic",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxtitle =      "On Recognizable Properties of Associative Algebras",
}

@Article{Scholten:1989:GMA,
  author =       "Hans W. Scholten and Mark H. Overmars",
  title =        "General Methods for Adding Range Restrictions to
                 Decomposable Searching Problems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "1",
  pages =        "1--10",
  month =        jan,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68P05 (68P10)",
  MRnumber =     "90f:68031",
  MRreviewer =   "Marc Gyssens",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation); C6130 (Data handling
                 techniques)",
  corpsource =   "Dept. of Comput. Sci., Utrecht Univ., Netherlands",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Computational Geometry; data structures; decomposable
                 searching problems; query; range restrictions; static
                 structures; symbol manipulation; time; weight-balanced
                 multiway tree",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Cole:1989:VPP,
  author =       "Richard Cole and Micha Sharir",
  title =        "Visibility Problems for Polyhedral Terrains",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "1",
  pages =        "11--30",
  month =        jan,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68U05",
  MRnumber =     "90c:68076",
  MRreviewer =   "Peter Gritzmann",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4190 (Other numerical methods); C1250 (Pattern
                 recognition); C6120 (File organisation)",
  corpsource =   "Courant Inst. of Math. Sci., New York Univ., NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Ackermann's function; combinatorial; complexity;
                 computational geometry; computer vision; data
                 structure; data structures; Davenport--Schinzel
                 sequence; Davenport--Schinzel, Geometry; NP-hard;
                 polyhedral terrains; ray shooting queries; visibility
                 problems",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Char:1989:GHP,
  author =       "Bruce W. Char and Keith O. Geddes and Gaston H.
                 Gonnet",
  title =        "{GCDHEU}: Heuristic Polynomial {GCD} Algorithm Based
                 on Integer {GCD} Computation",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "1",
  pages =        "31--48",
  month =        jan,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (11Y16 12-04)",
  MRnumber =     "90g:68073",
  MRreviewer =   "Michael Clausen",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C4130 (Interpolation
                 and function approximation)",
  corpsource =   "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computation; GCDHEU; heuristic polynomial GCD
                 algorithm; integer GCD; interpolation; interpolation
                 scheme; polynomials; single large integer value;
                 single-point; symbol manipulation; univariate
                 problems",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Czapor:1989:SAE,
  author =       "S. R. Czapor",
  title =        "Solving Algebraic Equations: Combining {Buchberger}'s
                 Algorithm with Multivariate Factorization",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "1",
  pages =        "49--54 (or 49--53??)",
  month =        jan,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (13-04)",
  MRnumber =     "89k:68081",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Dept. of Appl. Math., Waterloo Univ., Ont., Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "symbol manipulation; algebraic equations; Buchberger's
                 algorithm; multivariate; factorization; lexicographic
                 term ordering; algebraic; equations; Gr{\"o}bner basis
                 method; Gr{\"o}bner Bases",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Pan:1989:BPI,
  author =       "Luquan Pan",
  title =        "On the {$D$}-Basis of Polynomial Ideals over Principal
                 Ideal Domains",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "1",
  pages =        "55--70 (or 55--69??)",
  month =        jan,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13A15 (13-04 13B25 68Q40)",
  MRnumber =     "90g:13006",
  MRreviewer =   "Ferdinando Mora",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C4130 (Interpolation
                 and function approximation)",
  corpsource =   "Bell Commun. Res., Piscataway, NJ, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "polynomials; symbol manipulation; D-bases of
                 polynomial ideals; principal ideal domains; D-;
                 reduction; necessary and sufficient condition;
                 Gr{\"o}bner bases; B-reductions; B-bases; B-domains;
                 Euclidean domains",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Sterling:1989:SSE,
  author =       "Leon Sterling and Alan Bundy and Lawrence Byrd and
                 Richard O'Keefe and Bernard Silver",
  title =        "Solving Symbolic Equations with {PRESS}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "1",
  pages =        "71--84",
  month =        jan,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (68-04)",
  MRnumber =     "984 272",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C7310
                 (Mathematics)",
  corpsource =   "Dept. of Artificial Intelligence, Edinburgh Univ.,
                 UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic manipulation; Equation Solving System;
                 inference; metal-level; nondifferential equations;
                 PRESS; Prolog; service facilities; software packages;
                 symbol manipulation; symbolic equations; symbolic
                 manipulation; transcendental equations; transcendental
                 functions, meta-level inference",
  treatment =    "P Practical",
}

@Article{Tombal:1989:APG,
  author =       "Ph. Tombal and A. Moussiaux",
  title =        "Algebraic programming of geometrical calculus and
                 {Clifford} algebra",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "1",
  pages =        "85--92 (or 85--91??)",
  month =        jan,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (68-04)",
  MRnumber =     "984 273",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C6110 (Systems
                 analysis and programming)",
  corpsource =   "Lab. de Phys. Math., Fac. Univ. Notre-Dame de la Paix,
                 Namur, Belgium",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; algebraic programming; Clifford; geometrical
                 calculus; MACSYMA; multivectors; programming; symbol
                 manipulation",
  treatment =    "P Practical",
}

@Article{Ng:1989:CCU,
  author =       "Tze Beng Ng",
  title =        "Computation of the cohomology of {$ B \hat {\rm S}{\rm
                 O}_n \langle 16 \rangle $} for $ 23 \leq n \leq 26 $
                 using {REDUCE}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "1",
  pages =        "93--100 (or 93--99??)",
  month =        jan,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "55-04 (68-04 68Q40)",
  MRnumber =     "984 274",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/reduce.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling techniques);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "Dept. of Math., Nat. Univ. of Singapore, Kent Ridge,
                 Singapore",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "polynomials; symbol manipulation; REDUCE; polynomial
                 structure; Gr{\"o}bner basis method; Leray-Serre
                 spectral sequence; fibration; mod 2 cohomology ring;
                 base space; polynomial algebra",
  treatment =    "P Practical",
  xxtitle =      "Computation of the cohomology of {$BSO_n(16)$} for $23
                 \leq n \leq 26$ using {REDUCE}",
}

@Article{Sage:1989:EAT,
  author =       "Martin L. Sage",
  title =        "Erratum: {``An algebraic treatment of quantum
                 vibrations using REDUCE'' [J. Symbolic Comput. {\bf 5}
                 (1988), no. 3, 377--384]}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "1",
  pages =        "101--101",
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "81-04",
  MRnumber =     "984 275",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "See \cite{Sage:1988:ATQ}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
}

@Article{Statman:1989:WPS,
  author =       "Rick Statman",
  title =        "The Word Problem for {Smullyan}'s Lark Combinator is
                 Decidable",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "2",
  pages =        "103--112",
  month =        feb,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B40 (03B25)",
  MRnumber =     "90e:03017",
  MRreviewer =   "R. Hindley",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C1160 (Combinatorial
                 mathematics)",
  corpsource =   "Carnegie-Mellon Univ., Pittsburgh, PA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Church--Rosser; combinatorial mathematics;
                 decidability; decidable; lark combinator; word
                 problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Takahashi:1989:PRC,
  author =       "Masako Takahashi",
  title =        "Parallel Reduction in $ \lambda $-Calculus",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "2",
  pages =        "113--124 (or 113--123??)",
  month =        feb,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B40",
  MRnumber =     "90b:03017",
  MRreviewer =   "B. Lercher",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C1160 (Combinatorial
                 mathematics)",
  corpsource =   "Dept. of Inf. Sci., Tokyo Inst. of Technol., Japan",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "beta eta -; beta-reduction; Church--Rosser;
                 combinatorial mathematics; eta-reduction;
                 lambda-calculus; parallel reduction; reduction; symbol
                 manipulation; Tait-Martin-Lof proof; theorem",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxtitle =      "Parallel reductions in $\lambda$-calculus",
}

@Article{deSchreye:1989:TLP,
  author =       "Danny {de Schreye} and Maurice Bruynooghe",
  title =        "On the Transformation of Logic Programs with
                 Instantiation Based Computation Rules",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "2",
  pages =        "125--154",
  month =        feb,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T25 (03B70 68T15)",
  MRnumber =     "90g:68125",
  MRreviewer =   "Neculai Curteanu",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6110 (Systems analysis and programming)",
  corpsource =   "Dept. of Comput. Sci., Katholieke Univ. Leuven,
                 Heverlee, Belgium",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "automatic programming; clause programs; completeness;
                 computation rules; control rules; declarative Horn;
                 formal description; instantiation based; logic
                 programming; logic programs; program transformation;
                 Prolog; query pattern; soundness; transformation",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxauthor =     "Danny {De Schreye} and Maurice Bruynooghe",
}

@Article{Pittaluga:1989:COA,
  author =       "Marilena Pittaluga and Elisabetta Strickland",
  title =        "A computer oriented algorithm for the determination of
                 the dimension and character of a modular irreducible $
                 {\rm {SL}}(n, {K})$-module",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "2",
  pages =        "155--162 (or 155--161??)",
  month =        feb,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20C20 (20-04 68Q40)",
  MRnumber =     "90d:20027",
  MRreviewer =   "Michael Clausen",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C1160 (Combinatorial
                 mathematics)",
  corpsource =   "Dipartimento di Matematica, Roma Univ., Italy",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "character; combinatorial mathematics; computer
                 oriented algorithm; dimension; Groups; integral linear
                 map; irreducible representations; representation
                 theory; Schur modules; special linear group; symbol
                 manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Dutton:1989:IGI,
  author =       "R. D. Dutton and R. C. Brigham and F. Gomez",
  title =        "{INGRID}: a Graph Invariant Manipulator",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "2",
  pages =        "163--178 (or 163--177??)",
  month =        feb,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C0220 (Education and training); C1160 (Combinatorial
                 mathematics)",
  corpsource =   "Univ. of Central Florida, Orlando, FL, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Berkeley; commutative rule-based system; computer
                 science education; forward chaining; graph invariant;
                 graph theory; INGRID; interactive graph invariant
                 delimiter; interface; manipulator; partial; Pascal;
                 software packages; software system; UNIX; user;
                 user-supplied restrictions; VAX 11/780",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Vorontsov:1989:EAS,
  author =       "S. A. Vorontsov",
  title =        "An Example of the Application of Symbolic Computation
                 in Solid State Physics",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "2",
  pages =        "179--182 (or 179--181??)",
  month =        feb,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7320 (Physics and Chemistry); C6130 (Data handling
                 techniques)",
  corpsource =   "Inst. for Low Temp. Phys. and Eng., Acad. of Sci.,
                 Kharkov, Ukrainian SSR, USSR",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Fortran routine; magnetic susceptibility;
                 manipulation; matrix products; physics computing;
                 polynomial; solid state physics; symbol; symbolic
                 computation",
  treatment =    "A Application; P Practical",
  xxauthor =     "S. A. Voronstov",
  xxtitle =      "An example of application of symbolic computation in
                 solid state physics",
}

@Article{Autin:1989:SEI,
  author =       "B. Autin and J. Bengtsson",
  title =        "Symbolic Evaluation of Integrals Occurring in
                 Accelerator Orbit Theory",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "2",
  pages =        "183--188 (or 183--187??)",
  month =        feb,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/reduce.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "A2915 (Electrostatic and linear particle
                 accelerators); B7410 (Accelerators); C7320 (Physics and
                 Chemistry); C6130 (Data handling techniques)",
  corpsource =   "CERN, Geneva, Switzerland",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "accelerator orbit theory; automatic FORTRAN coding;
                 chromatic aberrations; computation; direct numerical
                 integration; generated functions; integrals;
                 manipulation; particle accelerators; Particle physics,
                 numerics; perturbation theory; physics computing;
                 symbol; symbolic; transverse oscillations",
  treatment =    "A Application; P Practical",
}

@Article{Magnan:1989:MPM,
  author =       "J. F. Magnan",
  title =        "A {MACSYMA} Program for the Multiple Bifurcation
                 Analysis of Double-Diffusive Convection",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "2",
  pages =        "189--198 (or 189--197??)",
  month =        feb,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Math., Florida State Univ., Tallahassee, FL,
                 USA",
  classcodes =   "C7310 (Mathematics); C4170 (Differential equations)",
  classification = "C4170 (Differential equations); C7310
                 (Mathematics)",
  corpsource =   "Dept. of Math., Florida State Univ., Tallahassee, FL,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "adjoint linearized system; Adjoint linearized system;
                 amplitude; Amplitude equation; asymptotic expansion;
                 Asymptotic expansion; asymptotic solution; Asymptotic
                 solution; bifurcation analysis; computer analysis;
                 Computer analysis; double-diffusive convection;
                 Double-diffusive convection; equation; MACSYMA program;
                 mathematics computing; multiple; Multiple bifurcation
                 analysis; non-liner partial differential equations;
                 nonlinear; Nonlinear PDEs; partial differential
                 equations; Partial differential equations; PDEs",
  thesaurus =    "Mathematics computing; Partial differential
                 equations",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hirschberg:1989:ANR,
  author =       "W. Hirschberg and D. Schramm",
  title =        "Application of {NEWEUL} in Robot Dynamics",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "2",
  pages =        "199--204",
  month =        feb,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C3355 (Manufacturing processes); C6130 (Data handling
                 techniques)",
  corpsource =   "Steyr-Daimier-Puch AG., Austria",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "behaviour; digital simulation; dynamic; equations of
                 motion; evaluation; flexible drives; industrial robots;
                 links; multibody system; multibody systems,
                 engineering, motion, Numerics; NEWEUL; numeric; numeric
                 standard procedures; program codes; rigid; robot
                 dynamics; simulation; simulation program; stability;
                 symbol manipulation; symbolic equations",
  treatment =    "P Practical",
}

@Article{Siekmann:1989:UT,
  author =       "J{\"o}rg H. Siekmann",
  key =          "Siek89",
  title =        "Unification Theory",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "3--4",
  pages =        "207--274",
  month =        mar # "--" # apr,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B35 (03C05 68Q50 68T15)",
  MRnumber =     "90j:03024",
  MRreviewer =   "Luis Fari{\~n}as del Cerro",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Misc/formal.hardware.verification.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1230 (Artificial intelligence); C6130 (Data handling
                 techniques)",
  corpsource =   "Kaiserslautern Univ., West Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keyword =      "Logic",
  keywords =     "artificial; artificial intelligence; instruction set;
                 intelligence; knowledge based systems; manipulation;
                 symbol; symbolic representation; unification theory",
  treatment =    "B Bibliography; T Theoretical or Mathematical",
}

@Article{Martin:1989:BUS,
  author =       "Ursula Martin and Tobias Nipkow",
  title =        "{Boolean} Unification --- The Story So Far",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "3--4",
  pages =        "275--294 (or 275--293??)",
  month =        mar # "--" # apr,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B35 (06E30 68T15)",
  MRnumber =     "90d:03021",
  MRreviewer =   "S. Rudeanu",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. Sci., London Univ., Egham, UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Boolean functions; Boolean rings; Boolean terms;
                 complexity analysis; unification algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Nutt:1989:BNR,
  author =       "Werner Nutt and Pierre R{\'e}ty and Gert Smolka",
  title =        "Basic Narrowing Revisited",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "3--4",
  pages =        "295--318 (or 295--317??)",
  month =        mar # "--" # apr,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35 68Q40)",
  MRnumber =     "90g:68120",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Kaiserslautern Univ., West Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "basic; equation solving rule; failure rules;
                 narrowing; resolution rules; rewriting systems;
                 simplification rules; term rewriting system;
                 Unification",
  treatment =    "T Theoretical or Mathematical",
}

@Article{You:1989:EON,
  author =       "Jia-Huai You",
  title =        "Enumerating Outer Narrowing Derivations for
                 Constructor-Based Term Rewriting Systems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "3--4",
  pages =        "319--342 (or 319--341??)",
  month =        mar # "--" # apr,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q50 (03B35 03C05 68T15)",
  MRnumber =     "90d:68046",
  MRreviewer =   "Neculai Curteanu",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta.,
                 Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "constructor-based; disjoint variables; E-matching;
                 equational logic programs; equational theories; outer
                 narrowing derivations enumeration; procedure; rewriting
                 systems; term rewriting systems; Unification",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "Enumerating out narrowing derivations for
                 constructor-based term rewriting systems",
}

@Article{Smolka:1989:IHS,
  author =       "Gert Smolka and Hassan A{\"i}t-Kaci",
  title =        "Inheritance Hierarchies: Semantics and Unification",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "3--4",
  pages =        "343--370",
  month =        mar # "--" # apr,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q55 (03B35 03B70 68P15 68T15)",
  MRnumber =     "90g:68086",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  corpsource =   "Kaiserslautern Univ., West Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic specifications; data structures; feature
                 type; inheritance hierarchies; nonempty intersection;
                 semantics; taxonomically organized data; unification",
  treatment =    "P Practical",
}

@Article{Comon:1989:EPD,
  author =       "Hubert Comon and Pierre Lescanne",
  title =        "Equational Problems and Disunification",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "3--4",
  pages =        "371--425 (or 371--426??)",
  month =        mar # "--" # apr,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B35 (03C05 68T15)",
  MRnumber =     "90f:03023",
  MRreviewer =   "Hans-Joachim Goltz",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/obscure.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "LIFIA, INPG, Grenoble, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "decision procedure; disunification; equational
                 problem; first order formula; Herbrand Universe;
                 predicate symbol; symbol manipulation; termination
                 proofs; Unification",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kanellakis:1989:RCC,
  author =       "Paris C. Kanellakis and Peter Z. Z. Revesz",
  title =        "On the Relationship of Congruence Closure and
                 Unification",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "3--4",
  pages =        "427--444",
  month =        mar # "--" # apr,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35 68Q15)",
  MRnumber =     "90g:68119",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C7310 (Mathematics);
                 C1160 (Combinatorial mathematics)",
  corpsource =   "Dept. of Comput. Sci., Brown Univ., Providence, RI,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "acyclic; congruence closure; deterministic finite
                 automata; directed acyclic graph; directed graphs;
                 directional duality; parallel complexity class; PTIME;
                 symbol manipulation; symbolic computation;
                 unification",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kozen:1989:PDA,
  author =       "Dexter Kozen and Susan Landau",
  title =        "Polynomial Decomposition Algorithms",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "5",
  pages =        "445--456",
  month =        may,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P05 (68Q40)",
  MRnumber =     "91c:13022",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "See errata \cite{Kozen:1990:EPD}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C1110
                 (Algebra); C1160 (Combinatorial mathematics)",
  corpsource =   "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "$O(n^2)$-time; algebraic conditions; algorithm;
                 commutative ring; computational complexity;
                 decomposibility; factorization; finite fields; group
                 theory; irreducible polynomials; manipulation;
                 multiplicative inverse; nontrivial functional
                 decomposition; polynomial; polynomials; structure
                 theorem; symbol",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Narendran:1989:CFP,
  author =       "Paliath Narendran and Colm {\'O}'D{\'u}nlaing",
  title =        "Cancellativity in Finitely Presented Semigroups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "5",
  pages =        "457--472",
  month =        may,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q50 (03D03)",
  MRnumber =     "90m:68081",
  MRreviewer =   "Friedrich Otto",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C1110 (Algebra)",
  corpsource =   "GE Corporate Res. and Dev. Center, Schenectady, NY,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "canonical commutative systems; Church--Rosser, Thue
                 systems; commutative Thue systems; decidability;
                 decision procedure; finite Thue system; finitely
                 presented semigroups; group theory; monadic
                 Church--Rosser Thue systems; monoid; rewriting systems;
                 semidecidable; string rewriting systems; undecidable",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lam:1989:BSI,
  author =       "C. W. H. Lam and L. Thiel",
  title =        "Backtrack Search with Isomorph Rejection and
                 Consistency Check",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "5",
  pages =        "473--486 (or 473--485??)",
  month =        may,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics); C1110 (Algebra);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Concordia Univ., Montreal,
                 Que., Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "combinatorial mathematics; combinatorial object;
                 exhaustive backtrack search; exhaustive enumeration;
                 group theory; Groups; independent consistency check;
                 isomorph rejection; large symmetry group; search
                 problems; search tree",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mozes:1989:DDB,
  author =       "Eyal Mozes",
  title =        "A deductive database based on {Aristotelian} logic",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "5",
  pages =        "487--508 (or 487--507??)",
  month =        may,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T20 (03B70 68P15)",
  MRnumber =     "999 515",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C6180 (User interfaces); C6170
                 (Expert systems); C4250 (Database theory); C6160
                 (Database management systems (DBMS))",
  corpsource =   "Dept. of Comput. Sci., Stanford Univ., CA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Aristotelian logic; database management systems;
                 deductive database; deductive procedures; explanation;
                 formal logic; knowledge based systems; prototype;
                 syllogism; system; Theorem Proving; user interaction;
                 user interfaces",
  treatment =    "T Theoretical or Mathematical; X Experimental",
}

@Article{Lassez:1989:SKB,
  author =       "Catherine Lassez and Ken McAloon and Graeme Port",
  title =        "Stratification and Knowledge Base Management",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "5",
  pages =        "509--522",
  month =        may,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T30",
  MRnumber =     "90c:68072",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C6170
                 (Expert systems); C1160 (Combinatorial mathematics);
                 C4250 (Database theory)",
  corpsource =   "IBM Thomas J. Watson Res. Center, New York, NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "assertions; computational complexity; consequences;
                 database management systems; disjunctive knowledge
                 bases; Expert Systems; graph; graph theory; interactive
                 knowledge base; knowledge based systems; linear time
                 stratification algorithm; logical; maintenance system;
                 partial ordering; search problems; stratification;
                 theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{dosSantos:1989:URS,
  author =       "Renato P. {dos Santos}",
  title =        "Using {REDUCE} in Supersymmetry",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "5",
  pages =        "523--525",
  month =        may,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/reduce.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "A1130P (Supersymmetry); A0270 (Computational
                 techniques); C7320 (Physics and Chemistry); C7310
                 (Mathematics); C1110 (Algebra)",
  corpsource =   "Centro Brasileiro de Pesquisas Fisicas Rio de Janeiro,
                 Brazil",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic manipulator; physics computing; REDUCE;
                 supersymmetry; supersymmetry calculus; symbol
                 manipulation",
  treatment =    "A Application; T Theoretical or Mathematical",
  xxauthor =     "Renato P. {Dos Santos}",
}

@Article{Martin:1989:KKS,
  author =       "Bernd Martin and Gerhard Pfister",
  title =        "The kernel of the {Kodaira--Spencer} map of the versal
                 $ \mu $-constant deformation of an irreducible plane
                 curve singularity with {$ {\bf C}^r$}-action",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "6",
  pages =        "527--532 (or 527--531??)",
  month =        jun,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "14B07 (32S30 68Q40)",
  MRnumber =     "91c:14005",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics); C4190 (Other
                 numerical methods)",
  corpsource =   "Humboldt-Univ. zu Berlin, Sektion Math., East
                 Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; Algebraic Geometry; base of the kernel;
                 computational geometry; deformation; Kodaira--Spencer
                 map; moduli; plane curve singularities; versal
                 $\mu$-constant",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Traugott:1989:DSS,
  author =       "J. Traugott",
  title =        "Deductive Synthesis of Sorting Programs",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "6",
  pages =        "533--572",
  month =        jun,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Stanford Univ., CA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "automatic programming; complexity; computational
                 complexity; deductive synthesis; generation of
                 auxiliary procedures; nontrivial algorithms; program;
                 Program Synthesis; program synthesis; sorting; sorting
                 programs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Suppes:1989:ICT,
  author =       "Patrick Suppes and Shuzo Takahashi",
  title =        "An Interactive Calculus Theorem-Prover for Continuity
                 Properties",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "6",
  pages =        "573--590",
  month =        jun,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35 04-04 26A15)",
  MRnumber =     "91a:68242",
  MRreviewer =   "R. C. T. Lee",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/reduce.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1230 (Artificial intelligence); C1160 (Combinatorial
                 mathematics); C4210 (Formal logic)",
  corpsource =   "Inst. for Math. Studies in the Social Sci., Stanford
                 Univ., CA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Analysis; calculus; continuity properties; interactive
                 theorem-; prover; resolution theorem-prover; set; set
                 theory; symbol manipulation; symbolic computation;
                 theorem proving; theorem-prover; theory; VERIFY",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gonzalez:1989:IBR,
  author =       "Teofilo Gonzalez and Si-Qing Zheng",
  title =        "Improved Bounds for Rectangular and Guillotine
                 Partitions",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "6",
  pages =        "591--610",
  month =        jun,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68U05 (68Q25)",
  MRnumber =     "90d:68075",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4290 (Other computer theory); C4240 (Programming and
                 algorithm theory); C4190 (Other numerical methods)",
  corpsource =   "Dept. of Comput. Sci., California Univ., Santa
                 Barbara, CA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "approximation algorithms; computational complexity;
                 computational geometry; guillotine partitions; NP-hard;
                 optimal rectangular partition; partitioning; polynomial
                 time approximation; rectangle",
  treatment =    "T Theoretical or Mathematical; X Experimental",
  xxauthor =     "T. Gonzales and S. Q. Zheng",
}

@Article{Fushchich:1989:CAA,
  author =       "W. I. Fushchich and V. V. Kornyak",
  title =        "Computer algebra application for determining {Lie} and
                 {Lie--B{\"a}cklund} symmetries of differential
                 equations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "7",
  number =       "6",
  pages =        "611--619",
  month =        jun,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "58G35 (35-04 35A30 35Q20 58-04)",
  MRnumber =     "90d:58166",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/cathode.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4170 (Differential equations)",
  corpsource =   "Dept. of Appl. Res., Inst. of Math., Acad. of Sci.,
                 Ukrainian SSR, Kiev, USSR",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; AMP; computer algebra; differential
                 equations; FORMAC; LB symmetries; Lie; Lie-Backlund;
                 ODE REDUCE FORMAC AMP; REDUCE; REDUCE, FORMAC;
                 symmetries",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Burckert:1989:ETU,
  author =       "Hans-J{\"u}rgen B{\"u}rckert and Alexander Herold and
                 Manfred Schmidt-Schauss",
  title =        "On Equational Theories, Unification, and
                 (Un)decidability",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "1--2",
  pages =        "3--50 (or 3--49??)",
  month =        jul # "--" # aug,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B35 (03C05 68Q50 68T15)",
  MRnumber =     "90j:03022",
  MRreviewer =   "Jean-Pierre Jouannaud",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Fachbereich Inf., Kaiserslautern; Univ., West
                 Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "almost; collapse free; decidability; equational
                 theories; finiteness; formal logic; membership;
                 problem; simplicity; undecidability; unification
                 theory",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "On Equational Theories, Unification and Decidability",
}

@Article{Schmidt-Schauss:1989:UCA,
  author =       "Manfred Schmidt-Schauss",
  title =        "Unification in a Combination of Arbitrary Disjoint
                 Equational Theories",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "1--2",
  pages =        "51--100 (or 51--99??)",
  month =        jul # "--" # aug,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35 03C05)",
  MRnumber =     "91a:68241",
  MRreviewer =   "Hans-Joachim Goltz",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Fachbereich Inf., Kaiserslautern Univ., West Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "collapse-free; constant-; decidability; decidable;
                 disjoint; elimination problem; equational theories;
                 formal logic; free function symbols; regular;
                 unifiability; unification; unification problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gallier:1989:HOU,
  author =       "J. Gallier and W. Snyder",
  title =        "Higher-order unification revisited: complete sets of
                 transformations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "1--2",
  pages =        "101--140",
  month =        "????",
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Feb 22 07:40:30 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/CLiCS.bib",
  abstract =     "In this paper, we reexamine the problem of general
                 higher-order unification and develop an approach based
                 on the method of transformations on systems of terms
                 which has its roots in Herbrand's thesis, and which was
                 developed by Martelli and Montanari in the context of
                 first-order unification. This method provides an
                 abstract and mathematically elegant means of analyzing
                 the invariant properties of unification in various
                 settings by providing a clean separation of the logical
                 issues from the specification of procedural
                 information. Our major contribution is three-fold.
                 First, we have extended the Herbrand-Martelli-Montanari
                 method of transformations on systems to higher-order
                 unification and pre-unification; second, we have used
                 this formalism to provide a more direct proof of the
                 completeness of a method for higher-order unification
                 than has previously been available; and, finally, we
                 have shown the completeness of the strategy of eager
                 variable elimination. In addition, this analysis
                 provides another justification of the design of Huet's
                 procedure, and shows how its basic principles work in a
                 more general setting. Finally, it is hoped that this
                 presentation might form a good introduction to
                 higher-order unification for those readers unfamiliar
                 with the field.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
}

@Article{Snyder:1989:HOU,
  author =       "Wayne Snyder and Jean Gallier",
  title =        "Higher order unification revisited: Complete Sets of
                 Transformations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "1--2",
  pages =        "101--140",
  month =        jul # "--" # aug,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B35 (03B40 03C05 68T15)",
  MRnumber =     "90j:03025",
  MRreviewer =   "Hans-Joachim Goltz",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. Sci., Boston Univ., MA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "formal logic; Herbrand's; higher-order; logic
                 programming; procedural information; thesis;
                 transformations; unification",
  treatment =    "T Theoretical or Mathematical",
}

@Article{LeChenadec:1989:LU,
  author =       "Philippe {Le Chenadec}",
  title =        "On the logic of unification",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "1--2",
  pages =        "141--199",
  month =        jul # "--" # aug,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B35 (68T15)",
  MRnumber =     "91b:03027",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "INRIA, Le Chesnay, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "equational logic; finite trees; formal logic; logic;
                 natural; proof-theoretic properties; symbol
                 manipulation; symbolic manipulation; theorem proving;
                 Type Inference problem; unification; unification
                 logic",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Clausen:1989:ESL,
  author =       "Michael Clausen and Albrecht Fortenbacher",
  title =        "Efficient Solution of Linear {Diophantine} Equations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "1--2",
  pages =        "201--216",
  month =        jul # "--" # aug,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11Y50 (03B35 11D04 68T15 90C10)",
  MRnumber =     "90i:11151",
  MRreviewer =   "B{\'e}la Vizv{\'a}ri",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4140 (Linear algebra)",
  corpsource =   "Inst. fur Algorithmen and Kognitive Syst., Karlsruhe
                 Univ., West Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "associative-commutative; graph algorithm; homogeneous;
                 inhomogeneous; linear algebra; linear diophantine
                 equations; nonnegative integer solutions; PASCAL
                 implementation; Pascal listings; unification",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lincoln:1989:AAC,
  author =       "Patrick Lincoln and Jim Christian",
  title =        "Adventures in Associative-Commutative Unification",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "1--2",
  pages =        "217--240",
  month =        jul # "--" # aug,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q42 (03B35 03C05 68T15)",
  MRnumber =     "91d:68061",
  MRreviewer =   "Mukkai S. Krishnamoorthy",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/algebraic.spec.1.bib",
  note =         "Also appears in {\it Unification}, edited by Claude
                 Kirchner (Academic, 1990), pages 393--416",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C6110 (Systems analysis and
                 programming)",
  corpsource =   "Dept. of Comput. Sci., Stanford Univ., CA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "AC unification; associative-commutative unification;
                 equational; formal logic; logic programming; matching;
                 SLD-resolution-based environment; theories; unification
                 procedures",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Butler:1989:CPM,
  author =       "Gregory Butler and John Cannon",
  title =        "Computing in permutation and matrix groups. {III}:
                 {Sylow} subgroups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "3",
  pages =        "241--252",
  month =        sep,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20-04 (20D20)",
  MRnumber =     "90i:20003",
  MRreviewer =   "J. D. Dixon",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics)",
  corpsource =   "Dept. of Comput. Sci., Sydney Univ., NSW, Australia",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "group theory; matrix algebra; matrix group; Sylow
                 subgroups",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fribourg:1989:SRI,
  author =       "Laurent Fribourg",
  key =          "Frib89",
  title =        "A Strong Restriction of the Inductive Completion
                 Procedure",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "3",
  pages =        "253--276",
  month =        sep,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q50 (03B35 68Q60)",
  MRnumber =     "91b:68066",
  MRreviewer =   "Jean-Pierre Jouannaud",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Misc/formal.hardware.verification.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "LITP, Paris, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keyword =      "Rewrite Methods",
  keywords =     "formal logic; inductive completion procedure;
                 inductive theorems; strong restriction; superposition;
                 theory equations",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Abadi:1989:TLP,
  author =       "Martin Abadi and Zohar Manna",
  title =        "Temporal Logic Programming",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "3",
  pages =        "277--296 (or 277--295??)",
  month =        sep,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T25 (03B45 03B70)",
  MRnumber =     "90m:68107",
  MRreviewer =   "Petr Jirk\ocirc u",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140D (High level languages); C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. Sci., Stanford Univ., CA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "clauses; language; logic programming; programming;
                 specification language; TEMPLOG; temporal Horn;
                 temporal logic; temporal operators; temporal resolution
                 method",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Brackx:1989:HMD,
  author =       "F. Brackx and D. Constales and A. Ronveaux and H.
                 Serras",
  title =        "On the Harmonic and Monogenic Decomposition of
                 Polynomials",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "3",
  pages =        "297--304",
  month =        sep,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "30-04 (30G35)",
  MRnumber =     "90i:30001",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/reduce.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1120 (Analysis)",
  corpsource =   "Seminarie voor Wiskundige Anal., Gent, Belgium",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Clifford analysis; decomposition; decomposition of
                 polynomials; Dirac; Euclidean space; harmonic; Laplace
                 operator; Minkowski spaces; monogenic; operator;
                 polynomials; procedures; REDUCE; REDUCE Polynomials
                 Inverting Operator; spherical harmonics",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fitt:1989:SCH,
  author =       "A. D. Fitt",
  title =        "Symbolic Computation of Hyperbolicity Regions for
                 Systems of Two-Phase Flow Conservation Laws Using
                 {Maple}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "3",
  pages =        "305--308",
  month =        sep,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "65-04",
  MRnumber =     "1 015 653",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "R. Mil. Coll. of Sci., Swindon, UK",
  classcodes =   "A4710 (General theory, simulation and other
                 computational methods); A4755K (Multiphase flows);
                 C7320 (Physics and Chemistry)",
  classification = "A4710 (General theory, simulation and other
                 computational methods); A4755K (Multiphase flows);
                 C7320 (Physics and Chemistry)",
  corpsource =   "R. Mil. Coll. of Sci., Swindon, UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "flow simulation; hyperbolicity regions; Hyperbolicity
                 regions; manipulation; MAPLE; MAPLE command language;
                 mathematical modelling; Mathematical modelling;
                 multiphase flow; multiphase flows; Multiphase flows;
                 physics computing; symbol; symbolic manipulation
                 system; Symbolic manipulation system; two-phase flow
                 conservation laws; Two-phase flow conservation laws",
  thesaurus =    "Flow simulation; Multiphase flow; Physics computing;
                 Symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Royle:1989:CVT,
  author =       "Gordon F. Royle and Cheryl E. Pr{\"a}ger",
  title =        "Constructing the Vertex-Transitive Graphs of Order
                 24",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "4",
  pages =        "309--326",
  month =        oct,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68R10 (05C25 20B25)",
  MRnumber =     "91a:68216",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Dept. of Math., Univ. of Western Australia, Nedlands,
                 WA, Australia",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "catalogues; Computational Group Theory; graph theory;
                 group-; order 24; theoretic techniques;
                 vertex-transitive graphs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dur:1989:CCF,
  author =       "Arne D{\"u}r",
  title =        "On Computing the Canonical Form for a Binary Form of
                 Odd Degree",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "4",
  pages =        "327--334 (or 327--333??)",
  month =        oct,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11E76 (11Y40 94B35)",
  MRnumber =     "90i:11042",
  MRreviewer =   "Joseph Kung",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B6120B (Codes); C1260 (Information theory)",
  corpsource =   "Math. Inst., Innsbruck Univ., Austria",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "binary form; codes; computing the canonical form;
                 decoding; odd degree; Reed--Solomon codes",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Puel:1989:UUS,
  author =       "Laurence Puel",
  title =        "Using Unavoidable Set of Trees to Generalize
                 {Kruskal}'s Theorem",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "4",
  pages =        "335--382",
  month =        oct,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q42",
  MRnumber =     "91b:68053",
  MRreviewer =   "Yves Metivier",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C1160 (Combinatorial
                 mathematics)",
  corpsource =   "Lab. d'Informatique, Ecole Normale Superieure, Paris,
                 France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "embedding relation; finite; of trees; quasi
                 simplification orderings; ranked alphabet; rewriting
                 systems; term rewriting systems; termination;
                 Termination, Rewriting; trees (mathematics);
                 unavoidable set",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Meseguer:1989:OSU,
  author =       "Jos{\'e} Meseguer and Joseph A. Goguen and Gert
                 Smolka",
  title =        "Order Sorted Unification",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "4",
  pages =        "383--414 (or 383--413??)",
  month =        oct,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q55 (03B35 68Q42 68Q65 68T15)",
  MRnumber =     "91e:68106",
  MRreviewer =   "Laurent Kott",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/algebraic.spec.1.bib",
  note =         "Preliminary version appeared as Report CSLI-87-86,
                 Center for the Study of Language and Information,
                 Stanford University, March 1987",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C6130 (Data handling
                 techniques)",
  corpsource =   "SRI Int., Menlo Park, CA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; endomorphisms; equational logic; formal
                 logic; function; order-sorted equatorial logic;
                 semantic aspects; set-theoretic containment; single
                 free; symbol manipulation; symbols; unification;
                 unsorted",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Schmidt-Schauss:1989:UPE,
  author =       "Manfred Schmidt-Schauss",
  title =        "Unification in Permutative Equational Theories is
                 Undecidable",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "4",
  pages =        "415--422 (or 415--421??)",
  month =        oct,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03D35 (03B35 03C05 03D40 68Q25 68T15)",
  MRnumber =     "91f:03091",
  MRreviewer =   "Jan {\v{S}}indel{\'a}{\v{r}}",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C4220 (Automata theory)",
  corpsource =   "Fachbereich Inf., Kaiserslautern Univ., West Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "associativity; commutativity; confluent term-rewriting
                 system; narrowing; permutative; permutative equatorial
                 theories; rewriting systems; Turing machine; Turing
                 machines; undecidable; unification",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dudley:1989:CAD,
  author =       "M. L. Dudley and R. W. James",
  title =        "Computer-aided derivation of spherical harmonic
                 spectral equations in astro-geophysics",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "4",
  pages =        "423--427",
  month =        oct,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "86-08 (85-08 85A15 85A20 86A25)",
  MRnumber =     "90j:86001",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/reduce.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Appl. Math., Sydney Univ., NSW, Australia",
  classcodes =   "C7310 (Mathematics); C7350 (Astronomy and
                 astrophysics); C7340 (Geophysics)",
  classification = "C7310 (Mathematics); C7340 (Geophysics); C7350
                 (Astronomy and astrophysics)",
  corpsource =   "Dept. of Appl. Math., Sydney Univ., NSW, Australia",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Astro-geophysics; astro-geophysics; astrophysics
                 computing; Computer algebra programs; computer algebra
                 programs; Computer-aided derivation; computer-aided
                 derivation; computing; differential equations; Earth
                 core; equations; geophysics computing; MACSYMA;
                 Magnetic induction equation; magnetic induction
                 equation; MAPLE; Mathematical physics; mathematical
                 physics; Mathematical problems; mathematical problems;
                 mathematics; Modelling magnetohydrodynamic
                 interactions; modelling magnetohydrodynamic
                 interactions; Numerical solution; numerical solution;
                 partial; Partial differential equations; REDUCE;
                 Spectral analysis; spectral analysis; spectral
                 equations; spherical harmonic; Spherical harmonic
                 spectral equations; Stellar atmospheres; stellar
                 atmospheres; Stellar interiors; stellar interiors;
                 vector; Vector equations",
  thesaurus =    "Astrophysics computing; Geophysics computing;
                 Mathematics computing; Spectral analysis",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Langemyr:1989:CPG,
  author =       "Lars Langemyr and Scott McCallum",
  title =        "The Computation of Polynomial Greatest Common Divisors
                 Over an Algebraic Number Field",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "5",
  pages =        "429--448",
  month =        nov,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12-04 (11Y05 68Q40)",
  MRnumber =     "90k:12001",
  MRreviewer =   "Maurice Mignotte",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C4130
                 (Interpolation and function approximation)",
  corpsource =   "Numerical Anal. and Comput. Sci., R. Inst. of
                 Technol., Stockholm, Sweden",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic number field; algorithm theory; Arithmetic;
                 greatest common divisor; modular algorithm; polynomial
                 greatest common divisors; polynomials;
                 Weinberger-Rothschild homomorphic scheme",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Boudet:1989:UBR,
  author =       "Alexandre Boudet and Jean-Pierre P. Jouannaud and
                 Manfred Schmidt-Schauss",
  title =        "Unification in {Boolean} rings and {Abelian} groups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "5",
  pages =        "449--478 (or 449--477??)",
  month =        nov,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35 06E20 20K99)",
  MRnumber =     "91d:68105",
  MRreviewer =   "Hans-Joachim Goltz",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C1160
                 (Combinatorial mathematics)",
  corpsource =   "LRI, Univ. Paris-Sud, Orsay, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Abelian groups; algorithm theory; Boolean rings;
                 constant; cycle free; disjoint sets; elimination
                 algorithm; free constants; function symbols; group
                 theory; infinite; trees; unification; unification
                 algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Baader:1989:UCT,
  author =       "Franz Baader",
  title =        "Unification in Commutative Theories",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "5",
  pages =        "479--498 (or 479--497??)",
  month =        nov,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35)",
  MRnumber =     "91d:68104",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Inst. fur Math. Maschinen und Datenverarbeitung
                 Informatik",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Abelian; Abelian groups; algorithm theory;
                 categorical; commutative theories; constant-free; group
                 theory; idempotent Abelian monoids; monoids;
                 reformulation; theory unification; unification;
                 unification problems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Abdulrab:1989:SWE,
  author =       "Habib Abdulrab and Jean-Pierre P{\'e}cuchet",
  title =        "Solving Word Equations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "5",
  pages =        "499--522 (or 499--521??)",
  month =        nov,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68R15 (03B35 20M35 68Q40 68Q50 68R99 68T15)",
  MRnumber =     "91b:68092",
  MRreviewer =   "Andr{\'e} Lentin",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C1160 (Combinatorial
                 mathematics)",
  corpsource =   "Lab. d'Informatique de Rouen et LITP,
                 Mont-Saint-Aignan, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "associative unification; formal languages; group
                 theory; word equations",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "Associative Unification",
}

@Article{Burckert:1989:MSC,
  author =       "Hans-J{\"u}rgen J. B{\"u}rckert",
  title =        "Matching --- a Special Case of Unification?",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "5",
  pages =        "523--536",
  month =        nov,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35)",
  MRnumber =     "91e:68127",
  MRreviewer =   "Alexander Leitsch",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C1160 (Combinatorial
                 mathematics)",
  corpsource =   "FB Inf., Kaiserslautern Univ., West Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "collapse free equational theories; decidability;
                 decidable; equational; formal languages; free
                 constants; group theory; matching problems; restricted;
                 signature; substitutions; theory; unification;
                 unification theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ronveaux:1989:DES,
  author =       "A. Ronveaux and G. Thiry",
  title =        "Differential Equations of Some Orthogonal Families in
                 {REDUCE}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "5",
  pages =        "537--541",
  month =        nov,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "34-04 (33-04)",
  MRnumber =     "90k:34001",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/reduce.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4170 (Differential equations); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Phys. Math., Fac. Univ. N. D. de la Paix, Namur,
                 Belgium",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm theory; differential equations; equation;
                 orthogonal families; polynomials; REDUCE; REDUCE
                 Differential Equations; second-order differential",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kobayashi:1989:RZD,
  author =       "Hidetsune Kobayashi and Shuichi Moritsugu and Robert
                 W. Hogan",
  title =        "On radial zero-dimensional ideals",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "6",
  pages =        "545--552",
  month =        dec,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P10",
  MRnumber =     "91d:13027",
  MRreviewer =   "Ralf Fr{\"o}berg",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C7310
                 (Mathematics)",
  corpsource =   "Dept. of Math., Coll. of Sci. and Technol., Nihon
                 Univ., Tokyo, Japan",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "symbol manipulation; radial zero-dimensional ideals;
                 Gr{\"o}bner bases; algebraic; equations",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxtitle =      "On radical zero-dimensional ideals",
}

@Article{Yokoyama:1989:CPE,
  author =       "Kazuhiro Yokoyama and Masayuki Noro and Taku
                 Takeshima",
  title =        "Computing Primitive Elements of Extension Fields",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "6",
  pages =        "553--580",
  month =        dec,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11Y40 (12-04 12F99 68Q40)",
  MRnumber =     "91b:11147",
  MRreviewer =   "Lajos R{\'o}nyai",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4130 (Interpolation and function
                 approximation)",
  corpsource =   "Int. Inst. for Adv. Study of Social Inf. Sci., Fujitsu
                 Ltd., Shizuoka, Japan",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "adjoining algebraic numbers; algebraic extension
                 fields; computational methods; extension fields;
                 mathematical; minimal polynomial; minimal polynomials;
                 polynomials; primitive elements computing; results;
                 symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Umeno:1989:SCA,
  author =       "Takaji Umeno and Syuichi Yamashita and Osami Saito and
                 Kenichi Abe",
  title =        "Symbolic Computation Application for the Design of
                 Linear Multivariable Control Systems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "6",
  pages =        "581--588",
  month =        dec,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "93B40 (68Q40)",
  MRnumber =     "1 045 542",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/reduce.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1340B (Multivariable systems); C7310 (Mathematics);
                 C1340D (Discrete systems); C7420 (Control
                 engineering)",
  corpsource =   "Toyohashi Univ. of Technol., Aichi, Japan",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic design; bilateral equations; control system;
                 control system synthesis; design; discrete time
                 systems; discrete-time; linear; linear multivariable
                 control; manipulation; matrix equations; multivariable
                 control systems; package; polynomial; polynomials;
                 rational function matrices; REDUCE; software; symbol;
                 symbolic computation; systems; unilateral equations",
  treatment =    "A Application; P Practical",
}

@Article{Sakai:1989:CTB,
  author =       "K{\^o} Sakai and Akira Aiba",
  title =        "{CAL}: a theoretical background of constraint logic
                 programming and its applications",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "6",
  pages =        "589--604 (or 589--603??)",
  month =        dec,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T25 (68Q40)",
  MRnumber =     "91b:68108",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "Ai/Constr.logic.prog.bib;
                 http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6110 (Systems analysis and programming); C6140
                 (Programming languages)",
  corpsource =   "Inst. for New Generation Comput. Technol., Tokyo,
                 Japan",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "CAL; CLP language; constraint logic programming;
                 Contrainte avec Logique; logic programming; polynomial
                 equations; programming languages; semantics",
  treatment =    "A Application; P Practical",
}

@Article{Sato:1989:FOC,
  author =       "Taisuke Sato and Hisao Tamaki",
  title =        "First order compiler: a deterministic logic program
                 synthesis algorithm",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "6",
  pages =        "605--628 (or 605--627??)",
  month =        dec,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68N20 (68N15 68T25)",
  MRnumber =     "1 045 544",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150C (Compilers, interpreters and other processors);
                 C6110 (Systems analysis and programming)",
  corpsource =   "Electrotech. Lab., Ibaraki, Japan",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm; definite clause; deterministic algorithm;
                 deterministic logic program synthesis; first order
                 compiler; logic programming; program compilers;
                 programs; universal-continuation forms",
  treatment =    "P Practical",
}

@Article{Hagino:1989:CM,
  author =       "Tatsuya Hagino",
  title =        "Codatatypes in {ML}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "6",
  pages =        "629--650",
  month =        dec,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q65",
  MRnumber =     "1 045 545",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation); C6110 (Systems analysis and
                 programming)",
  corpsource =   "Data Process. Center, Kyoto Univ., Japan",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "categorical characterisation; codatatypes; data
                 structures; data type declaration; domain-theoretic
                 characterization; functional programming; functional
                 programming language ML; mechanism",
  treatment =    "P Practical",
}

@Article{Hagiya:1989:MCI,
  author =       "Masami Hagiya",
  title =        "Meta-circular Interpreter for a Strongly Typed
                 Language",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "6",
  pages =        "651--680",
  month =        dec,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q55 (68N15)",
  MRnumber =     "1 045 546",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150C (Compilers, interpreters and other
                 processors)",
  corpsource =   "Res. Inst. for Math. Sci., Kyoto Univ., Japan",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "conditional terms; functional language; metacircular
                 interpreter; program interpreters; strongly typed
                 language; type system; typing; untyped system; well-",
  treatment =    "P Practical",
}

@Article{Hiroyuki:1989:CBC,
  author =       "Sato Hiroyuki",
  title =        "{E-CCC}: between {CCC} and topos --- its expressive
                 power from the viewpoint of data type theory",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "8",
  number =       "6",
  pages =        "681--695",
  month =        dec,
  year =         "1989",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q65 (18B25)",
  MRnumber =     "1 045 547",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation)",
  corpsource =   "Dept. of Inf. Sci., Tokyo Univ., Japan",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Cartesian closed category; category; data structures;
                 data type theory; E-CCC; structure of data types;
                 theory; topos; typed lambda-calculus",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kandri-Rody:1990:NCG,
  author =       "A. Kandri-Rody and V. Weispfenning",
  title =        "Non-commutative {Gr{\"o}bner} bases in algebras of
                 solvable type",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "1",
  pages =        "1--26",
  month =        jan,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P10 (68Q40)",
  MRnumber =     "91e:13025",
  MRreviewer =   "Heinrich Rolletschek",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Dept. des Math., Univ. Cadi Ayyad, Marrakech,
                 Morocco",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebras; algorithm theory; Clifford; elimination
                 ideals; enveloping algebras; finite dimensional Lie
                 algebras; group theory; ideal membership problem;
                 iterated Ore extensions of fields; noncommutative
                 polynomial rings; one-sided ideals; polynomial ideals;
                 polynomials; residue modules; solvable polynomial
                 rings; syzygies; Weyl; word problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Labonte:1990:ACM,
  author =       "Gilles Labont{\'e}",
  title =        "An algorithm for the construction of matrix
                 representations for finitely presented non-commutative
                 algebras",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "1",
  pages =        "27--38",
  month =        jan,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q45 (16G99)",
  MRnumber =     "91e:68090",
  MRreviewer =   "Yves Metivier",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/cathode.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4140 (Linear algebra); C4240 (Programming and
                 algorithm theory); C1160 (Combinatorial mathematics)",
  corpsource =   "Dept. of Math. and Comp. Sci., R. Mil. Coll. of
                 Canada, Kingston, Ont., Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "integration; algorithm theory; convergence of
                 numerical methods; group; theory; matrix algebra;
                 convergence; matrix representations; finitely presented
                 non-; commutative algebras; vector constraints;
                 Gr{\"o}bner basis; Todd--Coxeter coset-enumeration
                 method; group theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gollan:1990:OCS,
  author =       "H. W. Gollan and T. W. Ostermann",
  title =        "Operation of Class Sums on Permutation Modules",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "1",
  pages =        "39--48 (or 39--47??)",
  month =        jan,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20C20",
  MRnumber =     "91a:20017",
  MRreviewer =   "Roderick Gow",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Dept. of Math., Essen Univ., West Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm theory; block idempotents; CAYLEY-procedure;
                 class sums; conjugacy class sums; finite field; finite
                 group; group algebra; group theory; modular
                 representation; permutation modules; theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bronstein:1990:TRD,
  author =       "Manuel Bronstein",
  title =        "The transcendental {Risch} differential equation",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "1",
  pages =        "49--60",
  month =        jan,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "65L99 (34A45)",
  MRnumber =     "91d:65122",
  MRreviewer =   "Siegfried Filippi",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/cathode.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290P (Differential equations); C4170 (Differential
                 equations)",
  corpsource =   "Dept. of Math. Sci., IBM Research Div., Thomas. J.
                 Watson Res. Center, Yorktown Heights, NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm; denominators; differential equations;
                 Hermite-like reduction; integration; integration ODEs
                 oderef; progressive reduction; rational; timings;
                 towers; transcendental elementary extensions;
                 transcendental Risch differential equation; weak
                 normality",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Caprasse:1990:RGF,
  author =       "H. Caprasse",
  title =        "Renormalization Group, Function Iterations and
                 Computer Algebra",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "1",
  pages =        "61--72",
  month =        jan,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "81E15",
  MRnumber =     "1 044 915",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/reduce.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "A1110G (Renormalization); A0260 (Numerical
                 approximation and analysis); C4170 (Differential
                 equations); C4240 (Programming and algorithm theory);
                 C1160 (Combinatorial mathematics)",
  comment =      "Based on a renormalization group equation met in
                 Quantum Field Theory, Continuous Iterations of a large
                 class of functions are computed using {REDUCE}.",
  corpsource =   "Inst. de Phys. au Sart Tilman, Liege Univ., Belgium",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Abelian group; algorithm theory; boundary condition;
                 computer algebra; differential equations; function
                 iterations; iterative methods; perturbation techniques;
                 perturbative; quantum field; quantum field theory;
                 quantum field theory, differential equations; REDUCE;
                 renormalisation; renormalisation group equation;
                 solutions; theory",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "Renormalisation Group, Function Iteration and Computer
                 Algebra",
}

@Article{Fulling:1990:AAR,
  author =       "S. A. Fulling",
  title =        "The Analytic Approach to Recursion Relations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "1",
  pages =        "73--86 (or 73--85??)",
  month =        jan,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "A0460 (Quantum theory of gravitation); A0260
                 (Numerical approximation and analysis); C4170
                 (Differential equations); C7320 (Physics and
                 Chemistry); C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Math., Texas A and M Univ., College Station,
                 TX, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computing; differential equations; differential
                 geometry; functions; ordinary differential equations;
                 physics; quantum field theory of gravitation; recursion
                 relations; recursive; relativity; WKB",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kwong:1990:CAS,
  author =       "Man Kam Kwong and Mary Beth Dever",
  title =        "Computer-aided study of a problem in {Hermitian}
                 matrix theory",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "1",
  pages =        "87--112",
  month =        jan,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "15A24 (65F99)",
  MRnumber =     "91f:15037",
  MRreviewer =   "Moody T. Chu",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4140 (Linear algebra)",
  corpsource =   "Argonne Nat. Lab., IL, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Hermitian matrix theory; mathematics computing; matrix
                 algebra; matrix equation; number; positive definite
                 matrix; real",
  treatment =    "P Practical",
}

@Article{Lazard:1990:IRF,
  author =       "D. Lazard and R. Rioboo",
  title =        "Integration of rational functions: rational
                 computation of the logarithmic part",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "2",
  pages =        "113--116 (or 113--115??)",
  month =        feb,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (12H05 12Y05)",
  MRnumber =     "91h:68091",
  MRreviewer =   "Alkiviadis G. Akritas",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/cathode.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1120 (Analysis); C4160 (Numerical integration and
                 differentiation); C4180 (Integral equations)",
  corpsource =   "LITP and GRECO de Calcul Formel, Univ. Pierre et Marie
                 Curie, Paris, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computations; GCD; integral; integral equations;
                 integration; logarithmic part; polynomial arithmetic;
                 rational computation; rational functions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bronstein:1990:IEF,
  author =       "Manuel Bronstein",
  title =        "Integration of Elementary Functions",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "2",
  pages =        "117--174 (or 117--173??)",
  month =        feb,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12H05 (68Q40)",
  MRnumber =     "91h:12017",
  MRreviewer =   "Alexandru Buium",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/cathode.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1120 (Analysis); C4160 (Numerical integration and
                 differentiation)",
  corpsource =   "Dept. of Math. Sci, IBM Res. Div., Thomas J. Watson
                 Res. Center, Yorktown Heights, NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic extension; algebraic function; Computer
                 Analysis; decision procedure; elementary function
                 field; elementary functions; exponential; finite terms;
                 indefinite; integration; integration Risch ODEs oderef;
                 logarithm; proof; Trager",
  treatment =    "T Theoretical or Mathematical",
}

@Article{vonzurGathen:1990:IFF,
  author =       "Joachim {von zur Gathen}",
  title =        "Inversion in Finite Fields Using Logarithmic Depth",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "2",
  pages =        "175--184 (or 175--183??)",
  month =        feb,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (11Y16 68Q25)",
  MRnumber =     "91g:68089",
  MRreviewer =   "Christoph Meinel",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. Sci., Toronto Univ., Ont., Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithms; arithmetic reductions; Boolean; Boolean
                 algebra; Boolean circuits; computational complexity;
                 Davida; finite fields; inverses; inversion; Litow;
                 logarithmic depth; parallel; reductions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kean:1990:IMG,
  author =       "Alex Kean and George Tsiknis",
  title =        "An incremental method for generating prime
                 implicants\slash implicates",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "2",
  pages =        "185--206",
  month =        feb,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q20 (03B35 68T20 94C10)",
  MRnumber =     "91h:68071",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "See corrigendum \cite{Kean:1994:COI}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., British Columbia Univ.,
                 Vancouver, BC, Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "artificial intelligence applications; clause
                 management; CMS; complexity analysis; computational
                 complexity; correctness proof; implicants; incremental
                 method; number theory; prime; prime implicates;
                 Propositional Logic; systems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Eisenberger:1990:ASA,
  author =       "Moshe Eisenberger",
  title =        "Application of Symbolic Algebra to the Analysis of
                 Plates on Variable Elastic Foundation",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "2",
  pages =        "207--214 (or 207--213??)",
  month =        feb,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/reduce.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "A4630C (Elasticity); A0260 (Numerical approximation
                 and analysis); A0210 (Algebra, set theory, and graph
                 theory); C7440 (Civil and mechanical engineering);
                 C4140 (Linear algebra); C4130 (Interpolation and
                 function approximation)",
  corpsource =   "Dept. of Civil Eng., Carnegie Mellon Univ.,
                 Pittsburgh, PA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "approximate finite element; approximate solutions;
                 approximation theory; civil engineering; civil
                 engineering computing; convergence; convergence of
                 numerical methods; displacement method; elasticity;
                 foundation; foundation stiffness; matrix algebra; plate
                 analysis; plate element stiffness matrix; symbolic
                 algebra; variable elastic; variable Winkler elastic
                 foundation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Lloyd:1990:RBL,
  author =       "N. G. Lloyd and J. M. Pearson",
  title =        "{REDUCE} and the Bifurcation of Limit Cycles",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "2",
  pages =        "215--224",
  month =        feb,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "58F21 (58F14)",
  MRnumber =     "1 056 844",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/cathode.bib; Theory/reduce.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4170 (Differential equations);
                 C1120 (Analysis)",
  corpsource =   "Dept. of Math., Univ. Coll. of Wales, Dyfed, UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra system; bifurcation; computer; dynamical
                 systems; limit cycles; mathematics computing; nonlinear
                 differential equations; nonlinear ordinary differential
                 equations; polynomial differential systems; REDUCE",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Buchberger:1990:SIC,
  author =       "B. Buchberger and E. Kaltofen",
  title =        "Special Issue: Computational Algebraic
                 Complexity---Editorial",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "3",
  pages =        "225--228",
  month =        mar,
  year =         "1990",
  bibdate =      "Wed Feb 22 07:40:30 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
}

@Article{Bach:1990:FPU,
  author =       "Eric Bach and Victor Shoup",
  title =        "Factoring Polynomials Using Fewer Random Bits",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "3",
  pages =        "229--240 (or 229--239??)",
  month =        mar,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11Y16 (11T06 68Q25 68Q40)",
  MRnumber =     "91h:11149",
  MRreviewer =   "Jeffrey O. Shallit",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Wisconsin-Madison Univ., WI,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational complexity; polynomials; probabilistic
                 algorithms; random bits",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Canny:1990:GCP,
  author =       "John Canny",
  title =        "Generalised Characteristic Polynomials",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "3",
  pages =        "241--250",
  month =        mar,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P05 (68Q40)",
  MRnumber =     "91i:13030",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Div. of Comput. Sci., California Univ., Berkeley, CA,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "affine solution; asymptotic; complexity; computational
                 complexity; generalised characteristic polynomials;
                 isolated solution points; linear algebra; polynomial;
                 polynomial equations; polynomials; projection operator;
                 resultants; single-exponential; time method",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "Generalized characteristic polynomials",
}

@Article{Coppersmith:1990:MMA,
  author =       "Don Coppersmith and Shmuel Winograd",
  title =        "Matrix Multiplication via Arithmetic Progressions",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "3",
  pages =        "251--280",
  month =        mar,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q25 (11Y16 15A30)",
  MRnumber =     "91i:68058",
  MRreviewer =   "Werner Hartmann",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290H (Linear algebra); C4140 (Linear algebra)",
  corpsource =   "Dept. of Math. Sci., IBM Res. Div., Thomas J. Watson
                 Res. Center, Yorktown Heights, NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "arithmetic progressions; basic; matrix algebra; matrix
                 multiplication; Salem-Spencer theorem; trilinear form",
  treatment =    "T Theoretical or Mathematical",
}

@Article{vonzurGathen:1990:FDPa,
  author =       "Joachim {von zur Gathen}",
  title =        "Functional Decomposition of Polynomials: The Tame
                 Case",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "3",
  pages =        "281--300 (or 281--299??)",
  month =        mar,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12Y05 (12E05)",
  MRnumber =     "92a:12015",
  MRreviewer =   "Kevin S. McCurley",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Toronto Univ., Ont., Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational complexity; decomposition; functional;
                 functional composition; optimal depth; parallel
                 algorithm; parallel algorithms; polynomials; tame case;
                 univariate polynomials",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kaltofen:1990:CPG,
  author =       "Erich Kaltofen and Barry M. Trager",
  title =        "Computing with Polynomials Given by Black Boxes for
                 Their Evaluations: {Greatest} Common Divisors,
                 Factorization, Separation of Numerators and
                 Denominators",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "3",
  pages =        "300--320 (or 301--320??)",
  month =        mar,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (12Y05)",
  MRnumber =     "91k:68100",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/auto.diff.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation);
                 C4140 (Linear algebra)",
  corpsource =   "Dept. of Comput. Sci., Rensselaer Polytech. Inst.,
                 Troy, NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "black box representation; black boxes; computational
                 complexity; denominators; factorization; greatest
                 common divisors; implicit representation;
                 interpolation; multivariate polynomials;
                 polynomial-time; polynomials; random; separation of
                 numerators; sparse",
  referred =     "[Char91a].",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kaltofen:1990:EFP,
  author =       "Erich Kaltofen",
  title =        "Errata to: {``Fast parallel absolute irreducibility
                 testing'' [J.\ Symbolic Comput. {\bf 1} (1985), no. 1,
                 57--67, MR 87b:12002]}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "3",
  pages =        "320--320",
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12Y05 (11Y16 68Q40)",
  MRnumber =     "91b:12013",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "See \cite{Kaltofen:1985:FPA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
}

@Article{Rolletschek:1990:SDC,
  author =       "Heinrich Rolletschek",
  title =        "Shortest Division Chains in Imaginary Quadratic Number
                 Fields",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "3",
  pages =        "321--354",
  month =        mar,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11Y40 (11R11 68Q25)",
  MRnumber =     "91g:11162",
  MRreviewer =   "Ken Yamamura",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Johannes Kepler-Univ., Linz, Austria",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic integers; algorithm theory; discriminant;
                 Euclidean algorithm; imaginary quadratic number fields;
                 number theory; shortest division chains",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ronyai:1990:CSF,
  author =       "Lajos R{\'o}nyai",
  title =        "Computing the Structure of Finite Algebras",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "3",
  pages =        "355--374 (or 355--373??)",
  month =        mar,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (16P10)",
  MRnumber =     "91h:68093",
  MRreviewer =   "David Pokrass Jacobs",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Comput. and Autom. Inst., Hungarian Acad. of Sci.,
                 Budapest, Hungary",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithmic problems; associative algebras; common
                 invariant subspace; complexity class; computational
                 complexity; explicit isomorphism; finite algebras;
                 finite fields; full matrix algebra; linear; polynomial;
                 polynomial time algorithms; polynomials; structure
                 theory; time Las Vegas method; transformations; zero
                 divisors",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zippel:1990:IPT,
  author =       "Richard Zippel",
  title =        "Interpolating Polynomials from Their Values",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "3",
  pages =        "375--403",
  month =        mar,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (12Y05 65D05)",
  MRnumber =     "91g:68090",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm theory; computer algebra; intermediate
                 expression swell; interpolating polynomials;
                 interpolation; polynomials; sparse multivariate
                 polynomials; zero avoidance problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sakkalis:1990:SPA,
  author =       "Takis Sakkalis and Rida Farouki",
  title =        "Singular Points of Algebraic Curves",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "4",
  pages =        "405--422 (or 405--421??)",
  month =        apr,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "14Q05 (14B05 68U05)",
  MRnumber =     "91f:14056",
  MRreviewer =   "Sherwood Washburn",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4190 (Other numerical methods); C6130 (Data handling
                 techniques)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic curves; computational geometry; rational
                 arithmetic operations; rational coefficients; Real
                 Algebraic Geometry; singular points; symbol
                 manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zhang:1990:APR,
  author =       "Hantao Zhang",
  title =        "Automated Proof of Ring Commutativity Problems by
                 Algebraic Methods",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "4",
  pages =        "423--428 (or 423--427??)",
  month =        apr,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35 16U80)",
  MRnumber =     "91e:68129",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C6130 (Data handling
                 techniques)",
  corpsource =   "Dept. of Comput. Sci., Iowa Univ., Iowa City, IA,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic; automated proof; GCD computation; methods;
                 Newton's binomial theorem; ring commutativity problems;
                 symbol manipulation; theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ma:1990:AEA,
  author =       "Keju Ma and Joachim {von zur Gathen}",
  title =        "Analysis of {Euclidean} Algorithms for Polynomials
                 over Finite Fields",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "4",
  pages =        "429--456 (or 429--455??)",
  month =        apr,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11Y16 (11T06 68Q25)",
  MRnumber =     "91j:11113",
  MRreviewer =   "Jeffrey O. Shallit",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C4130 (Interpolation
                 and function approximation)",
  corpsource =   "Dept. of Comput. Sci., Toronto Univ., Ont., Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "arithmetic; common divisor; Euclidean algorithms;
                 finite fields; GCD; greatest; operations; polynomials;
                 symbol manipulation; univariate polynomials",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gunther:1990:MPR,
  author =       "Oliver G{\"u}nther",
  title =        "Minimum {$K$}-Partitioning of Rectilinear Polygons",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "4",
  pages =        "457--484 (or 457--483??)",
  month =        apr,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68U05",
  MRnumber =     "1 056 637",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4190 (Other numerical methods); C6130 (Data handling
                 techniques); C4240 (Programming and algorithm theory)",
  corpsource =   "FAW-AL Lab., Ulm Univ., West Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational complexity; computational geometry;
                 disjoint; lower bound; manipulation; minimum
                 k-partition; rectilinear components; rectilinear
                 polygons; symbol; time complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ramesh:1990:PTP,
  author =       "R. Ramesh and I. V. Ramakrishnan",
  title =        "Parallel Tree Pattern Matching",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "4",
  pages =        "485--502 (or 485--501??)",
  month =        apr,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C1160
                 (Combinatorial mathematics); C1250 (Pattern
                 recognition)",
  corpsource =   "Dept. of Comput. Sci., Texas Univ., Dallas, TX, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "automatic; code; compilers; computational complexity;
                 optimization; parallel algorithm; parallel algorithms;
                 parallel random access machine model; parallel tree
                 pattern matching; pattern; programming tasks;
                 recognition; Rewriting, Theorem proving; symbolic
                 computation; term rewriting; theorem proving; trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Corless:1990:SHL,
  author =       "R. M. Corless and D. J. Jeffrey",
  title =        "Solution of a hydrodynamic lubrication problem with
                 {Maple}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "4",
  pages =        "503--514 (or 503--513??)",
  month =        apr,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Appl. Math., Univ. of Western Ontario,
                 London, Ont., Canada",
  classcodes =   "A4710 (General theory, simulation and other
                 computational methods); C7320 (Physics and Chemistry);
                 C6130 (Data handling techniques)",
  classification = "A4710 (General theory, simulation and other
                 computational methods); C6130 (Data handling
                 techniques); C7320 (Physics and Chemistry)",
  corpsource =   "Dept. of Appl. Math., Univ. of Western Ontario,
                 London, Ont., Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic; Algebraic manipulations; algebraic
                 transformations; Algebraic transformations;
                 approximation; differential equations; hydrodynamic
                 lubrication problem; Hydrodynamic lubrication problem;
                 hydrodynamics; lowest-order; Lowest-order
                 approximation; lubrication; manipulation;
                 manipulations; Maple; partial; Partial differential
                 equations; perturbation technique; Perturbation
                 technique; physics computing; symbol",
  thesaurus =    "Hydrodynamics; Lubrication; Physics computing; Symbol
                 manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Savage:1990:SCF,
  author =       "Stuart B. Savage",
  title =        "Symbolic Computation of the Flow of Granular
                 Avalanches",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "4",
  pages =        "515--530",
  month =        apr,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/reduce.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7340 (Geophysics); C6130 (Data handling techniques)",
  corpsource =   "Lab. of Hydraulics, Hydrology and Glaciology,
                 ETH-Zentrum, Zurich, Switzerland",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Application; C-code; cohesionless granular material;
                 dense flowing snow avalanches; differential equations;
                 dimensional flow; flow of granular avalanches; GENTRAN;
                 geophysics computing; ice avalanches; Pade
                 approximants; perturbation equations; profiles;
                 rockfalls; Shanks transformations; symbol manipulation;
                 symbolic manipulation package REDUCE 3.3; two-;
                 velocity",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Conlon:1990:CCG,
  author =       "S. B. Conlon",
  title =        "Calculating characters of $p$-groups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "5--6",
  pages =        "535--550",
  month =        may # "--" # jun,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20C40 (20C15 20D15)",
  MRnumber =     "91j:20033",
  MRreviewer =   "Michael C. Slattery",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part I.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C7310 (Mathematics);
                 C1110 (Algebra)",
  corpsource =   "Dept. of Pure Math., Sydney Univ., NSW, Australia",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "characters of p-groups; computational group theory;
                 finite; group; group theory; symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Conlon:1990:CMP,
  author =       "S. B. Conlon",
  title =        "Computing Modular and Projective Character Degrees of
                 Soluble Groups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "5--6",
  pages =        "551--570",
  month =        may # "--" # jun,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20C40 (20C15 20C20)",
  MRnumber =     "91j:20034",
  MRreviewer =   "Michael C. Slattery",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part I.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C4140 (Linear
                 algebra); C1110 (Algebra)",
  corpsource =   "Dept. of Pure Math., Sydney Univ., NSW, Australia",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "central cyclic subgroup; character; faithful linear;
                 group theory; irreducible representations; linear
                 algebra; modular character degrees; projective
                 character degrees; representation; scalar; soluble
                 groups; symbol manipulation; twisted group algebra",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Michler:1990:SPC,
  author =       "Gerhard O. Michler",
  title =        "Some Problems in Computational Representation Theory",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "5--6",
  pages =        "571--582",
  month =        may # "--" # jun,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20C40 (20C15 20C20 68Q40)",
  MRnumber =     "91k:20022",
  MRreviewer =   "David B. Surowski",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part I.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling
                 techniques)",
  corpsource =   "Dept. of Math., Essen Univ., West Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational representation theory; computer algebra;
                 finite groups; mathematical; mathematics computing;
                 scientific software; software; symbol manipulation;
                 systems",
  treatment =    "P Practical",
}

@Article{Parker:1990:CCM,
  author =       "R. A. Parker and R. A. Wilson",
  title =        "The Computer Construction of Matrix Representations of
                 Finite Groups over Finite Fields",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "5--6",
  pages =        "583--590",
  month =        may # "--" # jun,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20-04 (20C40 20D08)",
  MRnumber =     "91j:20001",
  MRreviewer =   "R. W. Carter",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part I.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics)",
  corpsource =   "Dept. of Pure Math. and Math. Stat., Cambridge Univ.,
                 UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "abstract group; computer construction; concrete group;
                 explicit generators; finite; finite fields; groups;
                 mathematics computing; matrix generators; matrix
                 representations; Meat-axe; symbol manipulation",
  treatment =    "P Practical",
}

@Article{Ryba:1990:CCM,
  author =       "A. J. E. Ryba",
  title =        "Computer condensation of modular representations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "5--6",
  pages =        "591--600",
  month =        may # "--" # jun,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20-04 (20C20 20C40)",
  MRnumber =     "91j:20002",
  MRreviewer =   "R. W. Carter",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part I.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling
                 techniques)",
  corpsource =   "Dept. of Math., Michigan Univ., Ann Arbor, MI, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "2-modular character; computer condensation; explicit;
                 Hecke algebra; mathematics computing; matrix
                 representation; modular representations; symbol
                 manipulation; table",
  treatment =    "P Practical",
}

@Article{Schneider:1990:DCT,
  author =       "Gerhard J. A. Schneider",
  title =        "{Dixon}'s Character Table Algorithm Revisited",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "5--6",
  pages =        "601--606 (or 600--606??)",
  month =        may # "--" # jun,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20C40 (20-04 20C15 68Q40)",
  MRnumber =     "91j:20036",
  MRreviewer =   "Jamshid Moori",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part I.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C7310
                 (Mathematics)",
  corpsource =   "Essen Univ., West Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "character table algorithm; complete class matrices;
                 dimensional character space; Groups; symbol
                 manipulation; two-",
}

@Article{Schneider:1990:CER,
  author =       "Gerhard J. A. Schneider",
  title =        "Computing with Endomorphism Rings of Modular
                 Representations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "5--6",
  pages =        "607--636",
  month =        may # "--" # jun,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20C40 (20C05 20C20)",
  MRnumber =     "92a:20015",
  MRreviewer =   "Shigeo Koshitani",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part I.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C7310
                 (Mathematics)",
  corpsource =   "Inst. fur Exp. Math., Essen Univ., West Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithms; CAYLEY; endomorphism rings;
                 indecomposability; mathematics computing; modular
                 representations; properties; sources; symbol
                 manipulation; system; vertices",
  treatment =    "P Practical",
}

@Article{Glasby:1990:CIN,
  author =       "S. P. Glasby and Michael C. Slattery",
  title =        "Computing Intersections and Normalizers in Soluble
                 Groups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "5--6",
  pages =        "637--652 (or 637--651??)",
  month =        may # "--" # jun,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20D10",
  MRnumber =     "91j:20044",
  MRreviewer =   "Patrizia Longobardi",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part I.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C7310
                 (Mathematics)",
  corpsource =   "Dept. of Math., Victoria Univ., Wellington, New
                 Zealand",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithms; arbitrary; Hall subgroup; intersections;
                 normalizer algorithms; normalizers; orbit-stabilizer
                 algorithm; soluble groups; subgroups; symbol
                 manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Havas:1990:NQA,
  author =       "George Havas and M. F. Newman and M. R. Vaughan-Lee",
  title =        "A Nilpotent Quotient Algorithm for Graded {Lie}
                 Rings",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "5--6",
  pages =        "653--664",
  month =        may # "--" # jun,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20F40",
  MRnumber =     "92d:20054",
  MRreviewer =   "E. I. Khukhro",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part 1.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling techniques);
                 C1110 (Algebra)",
  corpsource =   "Nat. Center for Supercomput. Applications, Illinois
                 Univ., Urbana-Champaign, IL, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Burnside groups; characteristic; graded Lie rings; Lie
                 groups; nilpotent quotient algorithm; prime; symbol
                 manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Leedham-Green:1990:CLO,
  author =       "C. R. Leedham-Green and L. H. Soicher",
  title =        "Collection from the left and other strategies",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "5--6",
  pages =        "665--676 (or 665--675??)",
  month =        may # "--" # jun,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20D10 (68Q25)",
  MRnumber =     "92b:20021",
  MRreviewer =   "M. Greendlinger",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part I.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C7310
                 (Mathematics)C6130 (Data handling techniques)",
  corpsource =   "Sch. of Math. Sci., Queen Mary and Westfield Coll.,
                 London, UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "collection strategies; computational complexity;
                 finite soluble group; p-group; symbol manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{OBrien:1990:GGA,
  author =       "E. A. O'Brien",
  title =        "The $p$-Group Generation Algorithm",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "5--6",
  pages =        "677--698",
  month =        may # "--" # jun,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20D15",
  MRnumber =     "91j:20050",
  MRreviewer =   "{\`E}. M. Pal\cprime{}chik",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part I.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C7310
                 (Mathematics)",
  corpsource =   "Dept. of Math., Stat. and Comput. Sci., Marquette
                 Univ., Milwaukee, WI, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm; computational complexity; descriptions;
                 generating; p-group generation algorithm; performance;
                 symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sims:1990:COS,
  author =       "Charles C. Sims",
  title =        "Computing the Order of a Solvable Permutation Group",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "5--6",
  pages =        "699--706 (or 699--705??)",
  month =        may # "--" # jun,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20B40",
  MRnumber =     "91m:20011",
  MRreviewer =   "Gerhard Hiss",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part I.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C1110 (Algebra)",
  corpsource =   "Dept. of Math., Rutgers Univ., New Brunswick, NJ,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "generating set; generators; group theory; order
                 computing; polycyclic generating sequence; solvable
                 permutation group; symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sims:1990:IBC,
  author =       "Charles C. Sims",
  title =        "Implementing the {Baumslag-Cannonito-Miller}
                 Polycyclic Quotient Algorithm",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "5--6",
  pages =        "707--724 (or 707--723??)",
  month =        may # "--" # jun,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20F05 (20-04)",
  MRnumber =     "91g:20046",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part I.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics)",
  corpsource =   "Dept. of Math., Rutgers Univ., New Brunswick, NJ,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "symbol manipulation; Baumslag-Cannonito-Miller
                 polycyclic quotient algorithm; finitely presented
                 group; Gr{\"o}bner bases; nilpotent; quotients;
                 metabelian polycyclic quotients",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Vaughan-Lee:1990:CL,
  author =       "M. R. Vaughan-Lee",
  title =        "Collection From the Left",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "9",
  number =       "5--6",
  pages =        "725--733",
  month =        may # "--" # jun,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20F12 (20-04 20D15 20F18)",
  MRnumber =     "92c:20065",
  MRreviewer =   "M. Greendlinger",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part I.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics)",
  corpsource =   "Christ Church, Oxford Univ., UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm; Canberra version; collection; finite
                 p-groups; Havas-Nicholson algorithm; nilpotent quotient
                 algorithm; semigroup words; symbol manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Risler:1990:TP,
  author =       "Jean-Jacques J. Risler and Felice Ronga",
  title =        "Testing Polynomials",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "1",
  pages =        "1--5",
  month =        jul,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12Y05 (11Y16 68Q40)",
  MRnumber =     "91k:12010",
  MRreviewer =   "Maurice Mignotte",
  bibdate =      "Tue Nov 10 07:08:14 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4290 (Other computer theory); C6130 (Data handling
                 techniques); C1110 (Algebra)",
  corpsource =   "Lab. d'Anal. Num{\'e}rique, Univ. Pierre et Marie
                 Curie, Paris, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computer algebra; Multivariate, Identities;
                 polynomials; sparse polynomials; symbol manipulation;
                 testing set",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Grigorev:1990:CFC,
  author =       "D. Yu. Grigor\cprime{}ev",
  title =        "Complexity of Factoring and Calculating the {GCD} of
                 Linear Ordinary Differential Operators",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "1",
  pages =        "7--37",
  month =        jul,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12Y05 (12H05 65Y20 68Q40)",
  MRnumber =     "92g:12012",
  MRreviewer =   "Kevin S. McCurley",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C1120
                 (Analysis)",
  corpsource =   "Leningrad Dept. of Math., V. A. Steklov Inst., Acad.
                 of Sci., USSR",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational complexity; differentiation;
                 factorizations; linear ordinary differential operators;
                 manipulation; polynomial time algorithm; symbol",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Roy:1990:CCR,
  author =       "Marie-Fran{\c{c}}oise F. Roy and Aviva Szpirglas",
  title =        "Complexity of Computation on Real Algebraic Numbers",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "1",
  pages =        "39--52 (or 39--51??)",
  month =        jul,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11Y16 (68Q40)",
  MRnumber =     "91k:11114",
  MRreviewer =   "Maurice Mignotte",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Inst. de Recherche Math. de Rennes, Rennes Univ.,
                 France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "complexity study; computational complexity;
                 computations; formal; number theory; numbers;
                 polynomial inequalities; polynomial time method; real
                 algebraic; symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "Complexity of the Computation on Real Algebraic
                 Numbers",
}

@Article{Norton:1990:AAE,
  author =       "G. H. Norton",
  title =        "On the Asymptotic Analysis of the {Euclidean}
                 Algorithm",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "1",
  pages =        "53--58",
  month =        jul,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11N64 (68Q25 68Q90)",
  MRnumber =     "91k:11088",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory)",
  corpsource =   "Centre for Commun. Res., Fac. of Eng., Bristol Univ.,
                 UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm theory; asymptotic analysis; Euclidean
                 algorithm; symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Singer:1990:FSD,
  author =       "Michael F. Singer",
  title =        "Formal Solutions of Differential Equations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "1",
  pages =        "59--94",
  month =        jul,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12H05 (34A05 68Q40)",
  MRnumber =     "91m:12011",
  MRreviewer =   "G. Eisenreich",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/cathode.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1120 (Analysis); C4170 (Differential equations)",
  corpsource =   "Dept. of Math., North Carolina State Univ., Raleigh,
                 NC, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "(mathematics); asymptotic methods; difference
                 equations; differential equations; first integrals;
                 formal solutions; Lie; Liouvillian solutions; ODEs;
                 power series; series; solutions; symbol manipulation;
                 theoretic methods; transform methods",
  treatment =    "B Bibliography; T Theoretical or Mathematical",
}

@Article{Ratner:1990:PRR,
  author =       "Daniel Ratner and Manfred Warmuth",
  title =        "The $ (n^2 - 1)$-puzzle and related relocation
                 problems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "2",
  pages =        "111--137 (or 111--136??)",
  month =        aug,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T20 (68Q25 68U05)",
  MRnumber =     "91i:68138",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics); C4240 (Programming
                 and algorithm theory); C4130 (Interpolation and
                 function approximation); C7310 (Mathematics)",
  corpsource =   "California Univ., Santa Cruz, CA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "15-puzzle; 8-puzzle; approximation algorithm;
                 approximation theory; computational complexity;
                 heuristic search; NP-hard; polynomials; problems;
                 relocation problems; robotics; search problems; search
                 techniques; symbol manipulation; techniques",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxtitle =      "$N \times N$ Puzzle and Related Relocation Problem",
}

@Article{Cabay:1990:PSR,
  author =       "S. Cabay and P. Kossowski",
  title =        "Power series remainder sequences and {Pad{\'e}}
                 fractions over an integral domain",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "2",
  pages =        "138--164 (or 139--163??)",
  month =        aug,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "65D15 (65Y20 68Q25)",
  MRnumber =     "92d:65030",
  MRreviewer =   "G. P. Bhattacharjee",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4240 (Programming and algorithm
                 theory)C4130 (Interpolation and function
                 approximation)",
  corpsource =   "Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta.,
                 Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm; co-factor sequence; computational
                 complexity; domain; fraction-free methods; integral;
                 off-diagonal path; Pade fractions; polynomials; power
                 series remainder sequences; resultants, arithmetic;
                 series (mathematics); symbol manipulation; time
                 complexity",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Becker:1990:SBS,
  author =       "Thomas Becker",
  title =        "Standard Bases and Some Computations in Rings of Power
                 Series",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "2",
  pages =        "165--178",
  month =        aug,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P10 (13J05 68Q40)",
  MRnumber =     "91i:13031",
  MRreviewer =   "Ralf Fr{\"o}berg",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4130 (Interpolation and function
                 approximation)",
  corpsource =   "Fakultat fur Math. und Inf., Passau Univ., West
                 Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "arbitrary admissible term order; lexicographical term
                 order; polynomials; rings of power series; series
                 (mathematics); standard bases; symbol manipulation;
                 unique remainder; Weierstrass preparation theorem",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Deprit:1990:PPS,
  author =       "T. Deprit and E. Deprit",
  title =        "Processing {Poisson} Series in Parallel",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "2",
  pages =        "179--202 (or 179--201??)",
  month =        aug,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics)",
  corpsource =   "Nat. Inst. of Stand. and Technol., Gaithersburg, MD,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Connection Machine; free algebra; large Poisson
                 series; manipulating; manipulation; massively parallel
                 processor; mathematics computing; rational numbers;
                 real numbers; series (mathematics); symbol; symbolic
                 calculations; two-body problem",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxauthor =     "A. Deprit and E. Deprit",
}

@Article{Gerdt:1990:CCI,
  author =       "V. P. Gerdt and A. Yu. Zharkov",
  title =        "Computer Classification of Integrable Coupled
                 {KdV}-like Systems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "2",
  pages =        "203--208 (or 203--207??)",
  month =        aug,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "35-04 (35Q53)",
  MRnumber =     "91h:35003",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/cathode.bib; Theory/reduce.bib",
  abstract =     "The foundations of the symmetry approach to the
                 classification problem of integrable {non-linear}
                 evolution systems are briefly described. Within the
                 framework of the symmetry approach the {ten-parametric}
                 family of the third order {non-linear} evolution
                 coupled {KdV-like} systems is investigated. The
                 necessary integrability conditions lead to an
                 {over-determined non-linear} algebraic system. To solve
                 that system an effective method based on its structure
                 has been used. This allows us to obtain the complete
                 list of integrable systems of a given type. All
                 computation has been completed on the basis of computer
                 algebra systems {FORMAC} and {REDUCE}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics)",
  corpsource =   "Lab. of Comput. Tech. and Autom., Joint Inst. for
                 Nucl. Res., Moscow, USSR",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "approach; classification problem; evolution equations
                 PDE; FORMAC; integrable coupled KdV-like systems;
                 integrable nonlinear evolution systems; mathematics
                 computing; nonlinear algebraic; REDUCE; symbol
                 manipulation; symmetry; system; ten-parametric family",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Heng:1990:SRN,
  author =       "Aik-Koan K. Heng",
  title =        "Some Remarks On Numerical Iterations in a Symbolic
                 Manipulation System",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "2",
  pages =        "209--221",
  month =        aug,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4130 (Interpolation and function
                 approximation)",
  corpsource =   "Dept. of Inf. Syst. and Comput. Sci., Nat. Univ. of
                 Singapore, Singapore",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "convergence; iterative methods; numerical iterations;
                 properties; rational numbers; real numbers; roundoff
                 error; symbol manipulation; symbolic manipulation;
                 system",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Alevizos:1990:NCC,
  author =       "P. Alevizos and J. D. Boissonnat and M. Yvinec",
  title =        "Non Convex Contour Reconstruction",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "3--4",
  pages =        "225--252",
  month =        sep # "--" # oct,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "65Y25 (65D17 68U05)",
  MRnumber =     "92a:65372",
  MRreviewer =   "Reiner Lenz",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C4190 (Other
                 numerical methods); C1160 (Combinatorial mathematics)",
  corpsource =   "Dept. of Math., Patras Univ., Greece",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational complexity; computational geometry;
                 connected object; data points; dynamic algorithms;
                 insertion; nonconvex contour reconstruction; planar
                 cross-section; point; point deletion; rays;
                 semi-infinite curves; simply; total order;
                 two-dimensional reconstruction problems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mulmuley:1990:FPP,
  author =       "Ketan Mulmuley",
  title =        "A Fast Planar Partition Algorithm, {I}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "3--4",
  pages =        "253--280",
  month =        sep # "--" # oct,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68U05 (65Y25 68Q25)",
  MRnumber =     "92f:68181a",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C4190 (Other
                 numerical methods); C1160 (Combinatorial mathematics)",
  corpsource =   "Chicago Univ., IL, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm; computational complexity; computational
                 geometry; computer graphics; input segments;
                 intersection points; line segments; planar partition
                 algorithm; randomized",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chazelle:1990:AGP,
  author =       "Bernard Chazelle and Micha Sharir",
  title =        "An Algorithm for Generalized Point Location and its
                 Applications",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "3--4",
  pages =        "281--310 (or 281--309??)",
  month =        sep # "--" # oct,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68U05 (03B35)",
  MRnumber =     "91m:68161",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C4190 (Other
                 numerical methods); C1160 (Combinatorial mathematics)",
  corpsource =   "Dept. of Comput. Sci., Princeton Univ., NJ, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm; Collins classical quantifier elimination;
                 computational complexity; computational geometry;
                 logarithmic query time; multidimensional searching
                 problems; optimization problems; point location
                 algorithm; polynomial space; polynomial-size data;
                 procedure; real algebraic varieties; structure",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Avis:1990:LRA,
  author =       "David Avis and Hiroshi Imai",
  title =        "Locating a Robot with Angle Measurements",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "3--4",
  pages =        "311--326",
  month =        sep # "--" # oct,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68U05 (52B55 68Q25 93C85)",
  MRnumber =     "92h:68084",
  MRreviewer =   "Michael B. Dillencourt",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C4190 (Other
                 numerical methods); C1160 (Combinatorial mathematics);
                 C1230 (Artificial intelligence)",
  corpsource =   "Sch. of Comput. Sci., McGill Univ., Montreal, Que.,
                 Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "(artificial intelligence); angle measurements;
                 angular; compass; computational complexity;
                 computational geometry; environment; image processing
                 errors; indistinguishable mark points; location
                 queries; measurements; placements; planar; planning;
                 polynomial-time; preprocessing; robot location; robot
                 placements",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "Locating a robot with angle Mathematics",
}

@Article{Megiddo:1990:CSG,
  author =       "Nimrod Megiddo",
  title =        "On the Complexity of Some Geometric Problems in
                 Unbounded Dimension",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "3--4",
  pages =        "327--334",
  month =        sep # "--" # oct,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q25 (68U05)",
  MRnumber =     "92c:68068",
  MRreviewer =   "Peter Shor",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C4190 (Other
                 numerical methods); C1160 (Combinatorial mathematics)",
  corpsource =   "IBM Almaden Res. Center, San Jose, CA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "complete; complexity; computational complexity;
                 computational geometry; cube covering; dimension; error
                 ratios; geometric problems; lower bounds; minimum
                 cover; minimum number of lines; NP-; P not=NP; P=NP;
                 points; polynomial approximation; polynomial time;
                 unbounded; unit balls; unit cubes",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Edelsbrunner:1990:TPS,
  author =       "H. Edelsbrunner and F. P. Preparata and D. B. West",
  title =        "Tetrahedrizing Point Sets in Three Dimensions",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "3--4",
  pages =        "335--348 (or 335--347??)",
  month =        sep # "--" # oct,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68U05 (65Y25)",
  MRnumber =     "92c:68186",
  MRreviewer =   "Franz Aurenhammer",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C4190 (Other
                 numerical methods); C1160 (Combinatorial mathematics)",
  corpsource =   "Illinois Univ., Urbana-Champaign, IL, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm; co-planar; computational complexity;
                 computational geometry; extremum; points; problems;
                 tetrahedrizing point sets; three dimensions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yap:1990:STG,
  author =       "Chee-Keng K. Yap",
  title =        "Symbolic Treatment of Geometric Degeneracies",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "3--4",
  pages =        "349--370",
  month =        sep # "--" # oct,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68U05 (68Q40)",
  MRnumber =     "91k:68188",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C4190 (Other
                 numerical methods); C1160 (Combinatorial mathematics)",
  corpsource =   "Courant Inst. of Math. Sci., New York Univ., NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithms; computational complexity; computational
                 geometry; geometric degeneracies; symbolic scheme",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "Symbolic Treatment of Geometric Degeneration",
}

@Article{Schwartz:1990:TDD,
  author =       "Jacob T. Schwartz and Micha Sharir",
  title =        "On the two-dimensional {Davenport--Schinzel} problem",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "3--4",
  pages =        "371--393",
  month =        sep # "--" # oct,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q25 (68U05)",
  MRnumber =     "92f:68070",
  MRreviewer =   "Narsingh Deo",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C4190 (Other
                 numerical methods); C1160 (Combinatorial mathematics)",
  corpsource =   "Courant Inst. of Math. Sci., New York Univ., NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "combinatorial; complexity; computational complexity;
                 computational geometry; constant of proportionality;
                 continuous bivariate functions; curve; function;
                 graphs; intersect; intersection; planar Voronoi
                 diagrams; plane; Shamos algorithm; singular points;
                 triple; two-dimensional Davenport--Schinzel problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Weispfenning:1990:CAL,
  author =       "V. Weispfenning",
  title =        "The Complexity of Almost Linear {Diophantine}
                 Problems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "5",
  pages =        "395--404 (or 395--403??)",
  month =        nov,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03D15 (03C10 03F30)",
  MRnumber =     "92c:03047",
  MRreviewer =   "Shih Ping Tung",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Passau Univ., Postfach, Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "additive elementary theory; ALA; almost; arithmetic
                 PrA; bounds; computational complexity; integers; linear
                 arithmetic; linear Diophantine problems; lower
                 complexity bounds; number theory; order; polynomials;
                 Presburger; quantifier elimination; rational functions;
                 upper complexity; variables",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cucker:1990:TRP,
  author =       "F. Cucker and M. F. Roy",
  title =        "A Theorem on Random Polynomials and Some Consequences
                 in Average Complexity",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "5",
  pages =        "405--410 (or 405--409??)",
  month =        nov,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q25",
  MRnumber =     "92j:68045",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C4130
                 (Interpolation and function approximation); C1110
                 (Algebra)",
  corpsource =   "IRMAR, Rennes Univ., France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithms; average complexity; computational
                 complexity; polynomials; random polynomials; real
                 algebraic numbers; real roots",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "{Kac}'s Theorem on the Number of Real Roots and its
                 Consequences in Average Complexity",
}

@Article{Hunt:1990:CEC,
  author =       "H. B. {Hunt, III} and R. E. Stearns",
  title =        "The Complexity of Equivalence for Commutative Rings",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "5",
  pages =        "411--436",
  month =        nov,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q25 (13P99 68Q40)",
  MRnumber =     "92g:68062",
  MRreviewer =   "B. David Saunders",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., State Univ. of New York,
                 Albany, NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "commutative unitary rings; computational complexity;
                 conditions; deterministic time complexity; equivalence
                 problems; finite commutative; prime characteristic;
                 rings; satisfiable 3CNF formulas; straight-line
                 programs; sufficient; zero characteristic",
  treatment =    "T Theoretical or Mathematical",
}

@Article{vonzurGathen:1990:FDPb,
  author =       "Joachim {von zur Gathen}",
  title =        "Functional Decomposition of Polynomials: The Wild
                 Case",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "5",
  pages =        "437--452",
  month =        nov,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12Y05 (68Q25 68Q40)",
  MRnumber =     "92i:12008",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C1110
                 (Algebra); C4130 (Interpolation and function
                 approximation)",
  corpsource =   "Dept. of Comput. Sci., Toronto Univ., Ont., Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm theory; decomposition; functional;
                 functional composition; ground field; polynomial-time
                 partial; polynomials; solution; wild case",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mathieu:1990:ACR,
  author =       "Marie-H{\'e}l{\`e}ne H. Mathieu and David Ford",
  title =        "On $p$-adic Computation of the Rational Form of a
                 Matrix",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "5",
  pages =        "453--464",
  month =        nov,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (15A21 68Q25)",
  MRnumber =     "92e:68086",
  MRreviewer =   "Maurice Mignotte",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4140 (Linear algebra); C1110 (Algebra); C4130
                 (Interpolation and function approximation)",
  corpsource =   "Dept. of Comput. Sci., Concordia Univ., Montreal,
                 Que., Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "approximation theory; approximations; bounds; cyclic
                 form; matrix algebra; p-adic integer; precision;
                 rational form; rational integer",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Beckmann:1990:CGA,
  author =       "P. Beckmann and J. St{\"u}ckrad",
  title =        "The Concept of {Gr{\"o}bner} Algebras",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "5",
  pages =        "465--479 (or 465--480??)",
  month =        nov,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P10 (16D15 68Q40)",
  MRnumber =     "92f:13029",
  MRreviewer =   "Michael Clausen",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra)",
  corpsource =   "Sektion Math., Karl-Marx-Univ., Leipzig, East
                 Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; Gr{\"o}bner algebras; Gr{\"o}bner bases;
                 polynomial rings; non-; commutative algebras",
  treatment =    "T Theoretical or Mathematical",
  xxauthor =     "P. Beckman and J. St{\"u}ckrad",
}

@Article{Lallement:1990:DGR,
  author =       "Gerard Lallement and Robert McFadden",
  title =        "On the Determination of {Green}'s Relations in Finite
                 Transformation Semigroups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "5",
  pages =        "481--498",
  month =        nov,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20M20 (68Q45)",
  MRnumber =     "91k:20076",
  MRreviewer =   "Dominique Perrin",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C1110
                 (Algebra); C1160 (Combinatorial mathematics)",
  corpsource =   "Dept. of Math., Pennsylvania State Univ., University
                 Park, PA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm; algorithm theory; finite set; finite
                 transformation semigroups; generators; Green relations;
                 group theory; Group theory; maximal subgroups;
                 partially ordered set; set theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Nielsen:1990:UCA,
  author =       "Glen C. Nielsen and Mark O. McLinden and Graham
                 Morrison",
  title =        "Use of Computer Algebra to Locate Critical Loci in
                 Fluid Mixtures",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "5",
  pages =        "499--508",
  month =        nov,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "1 087 718",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7320 (Physics and Chemistry)",
  corpsource =   "Nat. Inst. of Stand. and Technol., Gaithersburg, MD,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Carnahan-Starling-DeSantis; component fluid mixtures;
                 computer algebra; critical loci; critical points;
                 equation; fluid dynamics; MACSYMA; mixtures; physics
                 computing; refrigerant mixtures; symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
  xxauthor =     "Glen C. Nielson and Mark O. McLinden and Graham
                 Morrison",
}

@Article{Vira:1990:ASC,
  author =       "N. Vira and T. Gill and E. Tunstel",
  title =        "Application of Symbolic Computation in Robot Pose
                 Error Modeling",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "5",
  pages =        "509--524 (or 509--523??)",
  month =        nov,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Howard Univ., Washington, DC, USA",
  classcodes =   "C7420 (Control engineering); C3390 (Robotics); C6130
                 (Data handling techniques); C4110 (Error analysis in
                 numerical methods)",
  classification = "C3390 (Robotics); C4110 (Error analysis in numerical
                 methods); C6130 (Data handling techniques); C7420
                 (Control engineering)",
  corpsource =   "Howard Univ., Washington, DC, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "calibration; Denavit-Hartenberg notation; digital
                 simulation; end-effector; End-effector; equations;
                 error; error analysis; Error calibration; error
                 compensation; Error compensation; error handling; error
                 model; Error model equations; geometrical error
                 modelling; Geometrical error modelling; industrial
                 robotic manipulator; Industrial robotic manipulator;
                 industrial robots; link; Link parameters; Lisp-based
                 artificial intelligence language; MACSYMA;
                 manipulation; manufacturing computer control;
                 mathematical error model; Mathematical error model;
                 modelling; parameters; perturbations; Perturbations;
                 robot pose error; Robot pose error modelling; SCRPE;
                 simulation; Simulation; symbol; symbolic computation;
                 Symbolic computation; symbolic manipulation; Symbolic
                 manipulation",
  thesaurus =    "Digital simulation; Error analysis; Error handling;
                 Industrial robots; Manufacturing computer control;
                 Symbol manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxtitle =      "Application of symbolic computation in robot pose
                 error modelling",
}

@Article{Abouzahra:1990:CAA,
  author =       "M. D. Abouzahra and R. Pavelle",
  title =        "Computer algebra applied to radiation from microstrip
                 discontinuities",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "5",
  pages =        "525--528",
  month =        nov,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Lincoln Lab., MIT, Lexington, MA, USA",
  classcodes =   "B1310 (Waveguides); C7410D (Electronic engineering);
                 C7310 (Mathematics)",
  classification = "B1310 (Waveguides); C7310 (Mathematics); C7410D
                 (Electronic engineering)",
  corpsource =   "Lincoln Lab., MIT, Lexington, MA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; applications; arbitrary angle; Arbitrary
                 angle; closed-form expression; Closed-form expression;
                 computer; Computer algebra; dielectric; Dielectric
                 loss; discontinuities; Discontinuities; line
                 attenuation; Line attenuation; loss; MACSYMA; metallic
                 loss; Metallic loss; microstrip bends; Microstrip
                 bends; microstrip discontinuities; Microstrip
                 discontinuities; microstrip lines; Microstrip lines;
                 microwave; Microwave applications; radiation loss;
                 Radiation loss; strip lines; symbol manipulation;
                 transitions; Transitions",
  thesaurus =    "Strip lines; Symbol manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kozen:1990:EPD,
  author =       "D. Kozen and S. Landau",
  title =        "Errata: {``Polynomial decomposition algorithms'' [J.
                 Symbolic Comput.\ {\bf 7} (1989), no. 5, 445--456, MR
                 91c:13022]}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "5",
  pages =        "529--529",
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P05 (68Q40)",
  MRnumber =     "1 087 719",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "See \cite{Kozen:1989:PDA}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
}

@Article{Klingen:1990:LCI,
  author =       "Norbert Klingen",
  title =        "{Leopoldt}'s conjecture for imaginary {Galois} number
                 fields",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "6",
  pages =        "531--546 (or 531--545??)",
  month =        dec,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11R27 (11Y40 68Q40)",
  MRnumber =     "92e:11124",
  MRreviewer =   "Jean-Fran{\c{c}}ois Jaulent",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics)",
  corpsource =   "Math. Inst., Koln Univ., West Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "character; Galois group; Galois number fields; Group
                 theory; imaginary number fields; Leopoldt's conjecture;
                 number theory; symbol manipulation; table",
  treatment =    "T Theoretical or Mathematical",
}

@Article{vonzurGathen:1990:CNB,
  author =       "Joachim {von zur Gathen} and Mark Giesbrecht",
  title =        "Constructing Normal Bases in Finite Fields",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "6",
  pages =        "547--570",
  month =        dec,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11T30 (11Y16 68Q40)",
  MRnumber =     "92e:11142",
  MRreviewer =   "Ren{\'e} Schoof",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics)",
  corpsource =   "Dept. of Comput. Sci., Toronto Univ., Ont., Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "finite fields; normal bases; polynomial-time
                 reduction; primitive elements; primitive normal
                 elements; probabilistic algorithm; symbol
                 manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Almkvist:1990:MDU,
  author =       "Gert Almkvist and Doron Zeilberger",
  title =        "The Method of Differentiating under the Integral
                 Sign",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "6",
  pages =        "571--592 (or 571--591??)",
  month =        dec,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "26-04 (26A99 33-04 68Q40)",
  MRnumber =     "92d:26003",
  MRreviewer =   "Pavel S. Pankov",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4160 (Numerical integration and
                 differentiation); C4170 (Differential equations)",
  corpsource =   "Dept. of Math., Lund Univ., Sweden",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "continuous version; differential equation;
                 differential equations; differentiation; holonomic
                 function; hypergeometric identities; integral; proof
                 machine; symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shallit:1990:WCT,
  author =       "Jeffrey Shallit",
  title =        "On the Worst Case of Three Algorithms for Computing
                 the {Jacobi} Symbol",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "6",
  pages =        "593--610",
  month =        dec,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11Y16 (68Q25)",
  MRnumber =     "91m:11112",
  MRreviewer =   "Duncan A. Buell",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics)",
  corpsource =   "Dept. of Math. and Comput. Sci., Dartmouth Coll.,
                 Hanover, NH, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm; Eisenstein's algorithm; iterative
                 algorithms; iterative methods; Jacobi symbol;
                 least-remainder; Lebesgue's algorithm; lexicographic
                 ordering; reverse lexicographic orderings; symbol
                 manipulation; worst case; worst-case behavior",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shackell:1990:GEE,
  author =       "John Shackell",
  title =        "Growth estimates for {Exp-log} functions",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "6",
  pages =        "611--632",
  month =        dec,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "26A12",
  MRnumber =     "92c:26001",
  MRreviewer =   "Yi Qun Yang",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics)",
  corpsource =   "Inst. of Math., Kent Univ., Canterbury, UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; dominance problem; eventual dominance;
                 Exp-log functions; explicit algorithm; growth
                 estimates; identity problem; symbol manipulation;
                 transcendental functions; Turing-reducible; zero
                 equivalence",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Nef:1990:CSP,
  author =       "Walter Nef and Peter-Michael M. Schmidt",
  title =        "Computing a Sweeping-plane in Regular (``General'')
                 Position: a Numerical and a Symbolic Solution",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "6",
  pages =        "633--646",
  month =        dec,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68U05 (68Q40)",
  MRnumber =     "91m:68168",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4290 (Other computer theory)",
  corpsource =   "Inst. fur Inf. und Angewandte Math., Bern Univ.,
                 Switzerland",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational geometry; Computational geometry;
                 hyperplanes; numerical solution; parallel;
                 sweeping-plane; symbol manipulation; symbolic method",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wilson:1990:MCC,
  author =       "Robert A. Wilson",
  title =        "The $2$- and $3$-modular characters of {$ J_3$}, its
                 covering group and automorphism group",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "6",
  pages =        "647--657 (or 647--656??)",
  month =        dec,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20C20 (20C40 20D08)",
  MRnumber =     "92b:20016",
  MRreviewer =   "Wolfgang Knapp",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics)",
  corpsource =   "Sch. of Math. and Stat., Birmingham Univ., UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "automorphism; covering group; group; group theory;
                 irreducible representations; modular character tables;
                 Parker's Meat-Axe; simple group; sporadic; symbol
                 manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hughes:1990:SCF,
  author =       "D. I. Hughes",
  title =        "Symbolic Computation with {Fermions}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "10",
  number =       "6",
  pages =        "657--664",
  month =        dec,
  year =         "1990",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (81-04)",
  MRnumber =     "91j:68063",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/reduce.bib",
  abstract =     "A set of {REDUCE} routines for manipulating operators
                 which anticommute amongst themselves is described.
                 These routines have applications in theories such as
                 supergravity where anticommuting operators are used to
                 represent fermions. The Dirac bracket of the
                 supersymmetry constraints arising in a quantum
                 cosmological model based on N = 1 supergravity coupled
                 to a massless scalar multiplet is calculated as an
                 example.",
  acknowledgement = ack-nhfb,
  classcodes =   "A9880 (Cosmology); A9530S (Relativity and
                 gravitation); A0465 (Supergravity); A1130P
                 (Supersymmetry); A0270 (Computational techniques);
                 C7320 (Physics and Chemistry)",
  corpsource =   "Dept. of Appl. Math. and Theor. Phys., Cambridge
                 Univ., UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "anticommute; cosmology; Dirac bracket; fermions;
                 manipulating operators; massless scalar multiplet;
                 physics computing; quantum cosmological model; REDUCE
                 routines; supergravity; supersymmetry; symbol
                 manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pais:1991:UFP,
  author =       "John Pais and Gerald E. Peterson",
  title =        "Using Forcing to Prove Completeness of Resolution and
                 Paramodulation",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "1--2",
  pages =        "3--19 (or 3--20??)",
  month =        jan # "--" # feb,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35 03C25)",
  MRnumber =     "92c:68172",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C1230 (Artificial
                 intelligence)",
  corpsource =   "McDonnell Douglas Corp., St. Louis, MO, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "completeness proving; deletion; equality; first-order
                 logic; formal logic; inference mechanisms; inference
                 rules; infinite extents; model; paramodulation; proving
                 systems; resolution; rewriting systems; simplification;
                 subsumed clauses; term orderings; theorem; theorem
                 proving; theoretic forcing",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rusinowitch:1991:TPR,
  author =       "Michael Rusinowitch",
  title =        "Theorem-proving with Resolution and Superposition",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "1--2",
  pages =        "21--50 (or 21--49??)",
  month =        jan # "--" # feb,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35)",
  MRnumber =     "92c:68174",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C1230 (Artificial
                 intelligence)",
  corpsource =   "CRIN, Vandoeuvre les Nancy, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "demodulation; equality; equational logic; first-order
                 logic; formal logic; inference mechanisms; inference
                 rules; Knuth--Bendix procedure; ordering; resolution;
                 rewriting systems; superposition; theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ganzinger:1991:CPC,
  author =       "Harald Ganzinger",
  title =        "A Completion Procedure for Conditional Equations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "1--2",
  pages =        "51--82 (or 51--81??)",
  month =        jan # "--" # feb,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q42 (03B70)",
  MRnumber =     "92i:68076",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C1230 (Artificial
                 intelligence)",
  corpsource =   "Max-Planck-Inst. fur Inf., Saarbrucken, Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "completion procedure; conditional equational logic;
                 conditional equations; conditional rewriting;
                 correctness proofs; formal logic; nonreductive
                 equations; proof trees; recursive path orderings;
                 reductive; rewriting systems; rules; theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kapur:1991:AII,
  author =       "Deepak Kapur and Paliath Narendran and Hantao Zhang",
  title =        "Automating Inductionless Induction using Test Sets",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "1--2",
  pages =        "83--112 (or 83--111??)",
  month =        jan # "--" # feb,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35)",
  MRnumber =     "92c:68167",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C1230 (Artificial
                 intelligence)",
  corpsource =   "Dept. of Comput. Sci., State Univ. of New York,
                 Albany, NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "abstract data; algebraic specifications; automatic
                 equation proving; axiomatizations; consistency check;
                 consistency checking; equational; equational theories;
                 equational theory; ground-reducibility; inductionless
                 induction; Knuth--Bendix completion procedure; proof by
                 consistency; Rewrite Rule Laboratory; rewriting
                 systems; RRL; sufficient-completeness property; test
                 sets; theorem proving; theorem proving environment;
                 types",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kounalis:1991:WPH,
  author =       "Emmanuel Kounalis and Michael Rusinowitch",
  title =        "On Word Problems in {Horn} Theories",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "1--2",
  pages =        "113--128 (or 113--127??)",
  month =        jan # "--" # feb,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35 68N17)",
  MRnumber =     "92k:68110",
  MRreviewer =   "Ondrej S\'ykora",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C1230 (Artificial
                 intelligence)",
  corpsource =   "LRI, Univ. de Paris-Sud, Orsay, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "conditional normalization; conditional rewrite rules;
                 formal logic; Horn clauses; Horn theories; initial
                 models; rewriting systems; sufficient conditions;
                 theorem proving; word problems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Socher:1991:RBR,
  author =       "Rolf Socher",
  title =        "On the Relation Between Resolution Based and
                 Completion Based Theorem Proving",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "1--2",
  pages =        "129--148 (or 129--147??)",
  month =        jan # "--" # feb,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35)",
  MRnumber =     "92f:68153",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C1230 (Artificial
                 intelligence)",
  corpsource =   "Fachbereich Inf., Kaiserslautern Univ., Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "arbitrary clauses; Boolean polynomial ring; completion
                 based theorem proving; completion deduction; deduction
                 rule; divergent critical pair; equational system; first
                 order formula; Horn clauses; hyperresolution; ideals;
                 resolution deductions; resolution rule; resolution
                 theorem proving; rewrite rules; rewriting systems;
                 rings; Shostak theorem; steps; superposition; theorem
                 proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Plaisted:1991:TRS,
  author =       "David A. Plaisted and Richard C. Potter",
  title =        "Term Rewriting: Some Experimental Results",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "1--2",
  pages =        "149--180",
  month =        jan # "--" # feb,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q42 (03B35 68T15)",
  MRnumber =     "92d:68072",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C1230 (Artificial
                 intelligence)",
  corpsource =   "Dept. of Comput. Sci., North Carolina Univ., Chapel
                 Hill, NC, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Bernays-Godel set theory; clausal theorem prover;
                 predicates; Prolog-based theorem prover; rewriting
                 systems; Skolemized setting; SPRFN; tautologies; term
                 rewriting; theorem proving; von Neumann-",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Chazarain:1991:MVL,
  author =       "J. Chazarain and A. Riscos and J. A. Alonso and E.
                 Briales",
  title =        "Multi-Valued Logic and {Gr{\"o}bner} Bases with
                 Applications to Modal Logic",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "3",
  pages =        "181--194",
  month =        mar,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B50 (03B35 03B45 13P10 68Q40 68T15)",
  MRnumber =     "92g:03032",
  MRreviewer =   "Xiang Li",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Nice Univ., Dept. of Math., Nice Univ., Parc Valrose,
                 France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Theorem Proving; Boolean algebra; many-valued logics;
                 Gr{\"o}bner bases; Stone isomorphism; Boolean algebras;
                 Boolean; rings; multi-valued logic; deduction problem;
                 ideal; membership; polynomial ring; Lukasiewicz modal
                 logic",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zeilberger:1991:MCT,
  author =       "Doron Zeilberger",
  title =        "The Method of Creative Telescoping",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "3",
  pages =        "195--204",
  month =        mar,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "33C20",
  MRnumber =     "92c:33005",
  MRreviewer =   "R. A. Askey",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics)",
  corpsource =   "Dept. of Math. and Comput. Sci., Temple Univ.,
                 Philadelphia, PA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Bernstein theory; combinatorial mathematics; creative
                 telescoping; definite hypergeometric summation; Gosper
                 algorithm; holonomic systems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sattler-Klein:1991:ECS,
  author =       "Andrea Sattler-Klein",
  title =        "Elimination of Composite Superpositions May Cause
                 Abortion",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "3",
  pages =        "205--212 (or 205--211??)",
  month =        mar,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q42",
  MRnumber =     "92f:68084",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Comput. Sci. Dept., Kaiserslautern Univ., Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Church--Rosser; composite superpositions; rewriting
                 systems; stop with failure; term rewriting system;
                 unnecessary",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gentili:1991:RGS,
  author =       "Graziano Gentili and Michael A. O'Connor",
  title =        "Rational Geometry in Space",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "3",
  pages =        "213--230 (or 213--229??)",
  month =        mar,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "51F20 (51F25 68U05)",
  MRnumber =     "92k:51021",
  MRreviewer =   "Chanderjit Bajaj",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics); C4190 (Other
                 numerical methods); C4290 (Other computer theory)",
  corpsource =   "Int. Sch. for Adv. Studies, Trieste, Italy",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "calculation; classical number theory; Computational
                 Geometry; computational geometry; equivalence classes;
                 equivalence relation; line segments; movements;
                 polyhedra; quotient space; rational geometry; rational
                 linear; symbolic",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Piquette:1991:MSE,
  author =       "Jean C. Piquette",
  title =        "A method for symbolic evaluation of indefinite
                 integrals containing special functions or their
                 products",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "3",
  pages =        "231--250 (or 231--249??)",
  month =        mar,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (33-04)",
  MRnumber =     "92g:68069",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/cathode.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4180 (Integral equations); C4160 (Numerical
                 integration and differentiation)",
  corpsource =   "Naval Res. Lab., Underwater Sound Reference
                 Detachment, Orlando, FL, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Bessel functions; Computer Analysis; computer
                 mathematics; functions; Hermite functions; indefinite;
                 indefinite integration; indefinite integration
                 transcendental functions; integral equations;
                 integrals; integration; Laguerre functions; language;
                 Legendre; SMP; special case expressions; special
                 functions; symbolic evaluation",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "An Algorithm for Symbolic Evaluation of Indefinite
                 Integrals Containing Special Functions or Their
                 Products",
}

@Article{Singer:1991:LSL,
  author =       "Michael F. Singer",
  title =        "{Liouvillian} Solution of Linear Differential
                 Equations with {Liouvillian} Coefficients",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "3",
  howpublished = "North Carolina pre-print 1988",
  pages =        "251--274 (or 251--273??)",
  month =        mar,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12H05 (34A30 68Q40)",
  MRnumber =     "92b:12011",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/cathode.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4170 (Differential equations)",
  corpsource =   "Dept. of Math., North Carolina State Univ., Raleigh,
                 NC, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computer analysis; functions; linear differential
                 equations; Liouvillian coefficients; Liouvillian
                 solutions; nonzero solution; ODEs; rational",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "{Liouvillian} solutions of linear differential
                 equations with {Liouvillian} coefficients",
}

@Article{Diver:1991:MWC,
  author =       "D. A. Diver",
  title =        "Modelling Waves with Computer Algebra",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "3",
  pages =        "275--290 (or 275--289??)",
  month =        mar,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/reduce.bib",
  abstract =     "A sophisticated model for linear waves in an
                 inhomogeneous plasma is tackled completely using the
                 computer algebra system {REDUCE}. The algebra code
                 mirrors the mathematics, and is structured in a simple
                 and straightforward manner. In so doing, the solution
                 technique is made obvious, and the overall philosophy
                 of the approach is intuitive to the {non-specialist}
                 computer algebra user.",
  acknowledgement = ack-nhfb,
  classcodes =   "A5235 (Waves, oscillations, and instabilities in
                 plasma); C7320 (Physics and Chemistry)",
  corpsource =   "Dept. of Phy. and Astron., Glasgow Univ., UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computer algebra; inhomogeneous plasma; linear waves;
                 physics computing; plasma waves; REDUCE",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Cohen:1991:UMC,
  author =       "H. I. Cohen and J. P. Fitch",
  title =        "Uses Made of Computer Algebra in Physics",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "3",
  pages =        "291--305",
  month =        mar,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7320 (Physics and Chemistry)",
  corpsource =   "Inst. for Mech., KTH Stockholm, Sweden",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "analysis; Applications; celestial mechanics;
                 chemistry; computer algebra; continuum mechanics; fluid
                 mechanics; mechanics; nonlinear evolution equations;
                 numerical; optics; perturbation technology; physics
                 computing; plasma physics; quantum; relativity;
                 theoretical",
  treatment =    "B Bibliography; T Theoretical or Mathematical",
}

@Article{Ponder:1991:PMP,
  author =       "Carl G. Ponder",
  title =        "Parallel Multiplication and Powering of Polynomials",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "4",
  pages =        "307--320",
  month =        apr,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "92f:68079",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Comput. Sci. Div., California Univ., Berkeley, CA,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic manipulation systems; algorithm; algorithms;
                 Arithmetic; dense polynomials; divide and conquer;
                 interpolation; multinomial expansion; NOMC; parallel
                 algorithms; parallel multiplication; parallel powering;
                 polynomial interpolation; polynomial multiplication;
                 polynomial powering; polynomials; serial; Simp
                 algorithm; sparse",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Laville:1991:CPR,
  author =       "Alain Laville",
  title =        "Comparison of Priority Rules in Pattern Matching and
                 Term Rewriting",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "4",
  pages =        "321--348 (or 321--347??)",
  month =        apr,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q42 (68N05)",
  MRnumber =     "93g:68063",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "INRIA, Le Chesnay, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "calls; constructors based linear systems; function;
                 pattern matching; priority rules; programming theory;
                 rewriting systems; term rewriting",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Comon:1991:RBT,
  author =       "H. Comon and D. Lugiez and Ph. Schnoebelen",
  title =        "A rewrite-based type discipline for a subset of
                 computer algebra",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "4",
  pages =        "349--368",
  month =        apr,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (03D35)",
  MRnumber =     "92i:68069",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Lab. d'Inf. Fondamentale et d'Intelligence
                 Artificielle, Grenoble, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; axiomatization; computer algebra; Generic
                 Programming; order-sorted; polymorphism; procedures;
                 rewrite relation; rewrite-based type discipline;
                 rewriting systems; semantics; semi-decision; structure;
                 subtyping; type; type inference; type properties;
                 undecidable",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Krantz:1991:AED,
  author =       "Steven G. Krantz and William H. Paulsen",
  title =        "Asymptotic eigenfrequency distributions for the $
                 {N}$-beam {Euler--Bernoulli} coupled beam equation with
                 dissipative joints",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "4",
  pages =        "369--418",
  month =        apr,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "73K05 (34L40 73K12)",
  MRnumber =     "92b:73027",
  MRreviewer =   "B. A. Boley",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
}

@Article{White:1991:MCF,
  author =       "Neil L. White",
  title =        "Multilinear {Cayley} factorization",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "5--6",
  pages =        "421--438",
  month =        may # "--" # jun,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (03B35 68U05)",
  MRnumber =     "92i:68074",
  MRreviewer =   "Timothy Stokes",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 http://www.math.utah.edu/pub/tex/bib/magma.bib",
  note =         "Invariant-theoretic algorithms in geometry
                 (Minneapolis, MN, 1987).",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation);
                 C4290 (Other computer theory); C1230 (Artificial
                 intelligence)",
  corpsource =   "Dept. of Math., Florida Univ., Gainesville, FL, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic expressions; bracket algebra; Cayley
                 algebra; Cayley factorization problem; computational
                 geometry; computer-aided geometric reasoning;
                 geometric; homogeneous bracket; interpretations;
                 polynomial; polynomials; projective geometry; spatial
                 reasoning; symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sturmfels:1991:SFP,
  author =       "Bernd Sturmfels and Walter Whiteley",
  title =        "On the Synthetic Factorization of Projectively
                 Invariant Polynomials",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "5--6",
  pages =        "439--454 (or 439--453??)",
  month =        may # "--" # jun,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "92i:68075",
  MRreviewer =   "Timothy Stokes",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 http://www.math.utah.edu/pub/tex/bib/magma.bib",
  note =         "Invariant-theoretic algorithms in geometry
                 (Minneapolis, MN, 1987).",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation);
                 C4290 (Other computer theory); C1230 (Artificial
                 intelligence)",
  corpsource =   "Dept. of Math., Cornell Univ., Ithaca, NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm; automated geometry theorem proving; Cayley
                 algebra; computational geometry; explicit; homogeneous
                 bracket polynomial; polynomial functions; polynomials;
                 projective geometry; projectively invariant
                 polynomials; spatial reasoning; symbol manipulation;
                 synthetic constructions; synthetic factorization;
                 theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Morgenstern:1991:IGA,
  author =       "Jacques Morgenstern",
  title =        "Invariant and geometric aspects of algebraic
                 complexity theory. {I}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "5--6",
  pages =        "455--470 (or 455--469??)",
  month =        may # "--" # jun,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q25 (03B35 03D15 68Q40 68U05)",
  MRnumber =     "92g:68063",
  MRreviewer =   "Hans-Dietrich Hecker",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Invariant-theoretic algorithms in geometry
                 (Minneapolis, MN, 1987).",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory)",
  corpsource =   "Nice Univ., Parc Valrose, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic complexity theory; algebraic geometry;
                 computational complexity; computational geometry;
                 computational networks; geometric aspects; invariance;
                 projective; spaces",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "Classical Invariant Theory and Algebraic Complexity
                 Theory",
}

@Article{McMillan:1991:DSA,
  author =       "Tim McMillan and Neil L. White",
  title =        "The Dotted Straightening Algorithm",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "5--6",
  pages =        "471--482",
  month =        may # "--" # jun,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "92e:68087",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 http://www.math.utah.edu/pub/tex/bib/magma.bib",
  note =         "Invariant-theoretic algorithms in geometry
                 (Minneapolis, MN, 1987).",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation)",
  corpsource =   "Dept. of Math., Florida Univ., Gainesville, FL, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "bracket polynomial; Cayley algebra; dotted bracket
                 expression; dotted straightening algorithm;
                 homogeneous; polynomials; symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Clausen:1991:MPS,
  author =       "Michael Clausen",
  title =        "Multivariate Polynomials, Standard Tableaux and
                 Representations of Symmetric Groups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "5--6",
  pages =        "483--522",
  month =        may # "--" # jun,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "05E10 (20C30 68Q40)",
  MRnumber =     "92h:05140",
  MRreviewer =   "Jorn B. Olsson",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Invariant-theoretic algorithms in geometry
                 (Minneapolis, MN, 1987).",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation);
                 C1160 (Combinatorial mathematics)",
  corpsource =   "Informatik V, Bonn Univ., Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "bideterminants; Capelli operators; commutative ring;
                 generalized Laplace expansions; group theory; groups;
                 hyperdominance; Littlewood--Richardson rule;
                 multivariate polynomials; polynomial rings;
                 polynomials; R-bases; representation theory; Specht
                 series; standard tableaux; symbol manipulation;
                 symmetric",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Crapo:1991:ITM,
  author =       "Henry Crapo",
  title =        "Invariant Theoretic Methods in Scene Analysis and
                 Structural Mechanics",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "5--6",
  pages =        "523--548",
  month =        may # "--" # jun,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "51A45 (52C25 68U05 73K99)",
  MRnumber =     "92g:51004",
  MRreviewer =   "V. Medek",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Invariant-theoretic algorithms in geometry
                 (Minneapolis, MN, 1987).",
  acknowledgement = ack-nhfb,
  classcodes =   "C4290 (Other computer theory); C5260B (Computer vision
                 and picture processing)",
  corpsource =   "INRIA, Le Chesnay, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "3D geometric forms; applied geometry; bar-and-joint
                 structures; computational geometry; computerised
                 picture processing; correctness; invariant theory;
                 plane drawings; projective conditions; scene analysis;
                 structural mechanics; symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Whiteley:1991:ICA,
  author =       "Walter Whiteley",
  title =        "Invariant Computations for Analytic Projective
                 Geometry",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "5--6",
  pages =        "549--578",
  month =        may # "--" # jun,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B35 (51N15 68Q40)",
  MRnumber =     "92k:03008",
  MRreviewer =   "G. E. Peterson",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Invariant-theoretic algorithms in geometry
                 (Minneapolis, MN, 1987).",
  acknowledgement = ack-nhfb,
  classcodes =   "C4290 (Other computer theory); C1230 (Artificial
                 intelligence)",
  corpsource =   "Centre de Recherches Math., Montreal Univ., Que.,
                 Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "analytic geometric language; analytic projective
                 geometry; computational geometry; invariant; language;
                 nullstellensatz identities; symbol manipulation;
                 symbolic computations; synthetic geometry; theorem
                 proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Havel:1991:SEU,
  author =       "Timothy F. Havel",
  title =        "Some Examples of the Use of Distances as Coordinates
                 for {Euclidean} Geometry",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "5--6",
  pages =        "579--594 (or 579--593??)",
  month =        may # "--" # jun,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "51N20 (03B35 68Q40 68U05 70B15)",
  MRnumber =     "92j:51033",
  MRreviewer =   "G. E. Peterson",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Invariant-theoretic algorithms in geometry
                 (Minneapolis, MN, 1987).",
  acknowledgement = ack-nhfb,
  classcodes =   "C4290 (Other computer theory); C1160 (Combinatorial
                 mathematics); C1230 (Artificial intelligence); C7310
                 (Mathematics)",
  corpsource =   "Harvard Med. Sch., Boston, MA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational geometry; computer algebra;
                 coordinate-free approach; Euclidean geometry;
                 manipulation; mathematics computing; polynomial
                 equations; programs; proving theorems; simple linkage
                 mechanism; symbol; theorem proving; topological
                 structure",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "The Use of Distances as Coordinated for Analytic
                 Geometry",
}

@Article{Sturmfels:1991:CAG,
  author =       "Bernd Sturmfels",
  title =        "Computational Algebraic Geometry of Projective
                 Configurations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "11",
  number =       "5--6",
  pages =        "595--618",
  month =        may # "--" # jun,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "14Q99 (03B35 03D15 13P10 51A20 68T15)",
  MRnumber =     "92k:14059",
  MRreviewer =   "Robert Silhol",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Invariant-theoretic algorithms in geometry
                 (Minneapolis, MN, 1987).",
  acknowledgement = ack-nhfb,
  classcodes =   "C4290 (Other computer theory); C4240 (Programming and
                 algorithm theory); C7310 (Mathematics)",
  corpsource =   "Dept. of Math., Cornell Univ., Ithaca, NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational complexity; computational geometry;
                 mathematics computing; symbol manipulation; theorem
                 proving; computational algebraic geometry; projective
                 configurations; structural aspects; computer-aided
                 study; incidence; configurations; plane projective
                 geometry; invariant-; theoretic algorithms; complexity
                 results; realization space; coordinatizability;
                 automated theorem proving; Gr{\"o}bner basis; method;
                 minimum degree final polynomials; final syzygies;
                 nullstellensatz",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yap:1991:NLB,
  author =       "Chee-K. K. Yap",
  title =        "A New Lower Bound Construction for the Word Problem
                 for Commutative {Thue} Systems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "1",
  pages =        "1--28 (or 1--27??)",
  month =        jul,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03D03 (03D15 68Q25 68Q40)",
  MRnumber =     "92i:03046",
  MRreviewer =   "Xiang Li",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation);
                 C7310 (Mathematics)",
  corpsource =   "Courant Inst. of Math. Sci., New York Univ., NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "polynomials; symbol manipulation; lower bound
                 construction; commutative Thue systems; Gr{\"o}bner;
                 bases; ideal membership problem; syzygy basis problem",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxtitle =      "A New Lower Bound Construction for Commutative {Thue}
                 Systems with Applications",
}

@Article{Takayama:1991:ERF,
  author =       "Yukihide Takayama",
  title =        "Extraction of Redundancy-free Programs from
                 Constructive Natural Deduction Proofs",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "1",
  pages =        "29--70 (or 29--69??)",
  month =        jul,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q60 (03B70 03F50)",
  MRnumber =     "93c:68068",
  MRreviewer =   "G. Mirkowska",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C7310 (Mathematics); C1160
                 (Combinatorial mathematics); C1180 (Optimisation
                 techniques)",
  corpsource =   "Inst. for New Generation Comput. Technol., Tokyo,
                 Japan",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "constructive logic; constructive natural deduction
                 proofs; executable codes; interpretation; manipulation;
                 mathematical programming; mathematics computing; number
                 checker program; prime; proof trees; q-realizability
                 interpretation; realizability; redundancy-free programs
                 extraction; symbol; theorem proving; trees
                 (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxtitle =      "Proof Theoretic Approach to the Extraction of
                 Redundancy free Realizer Codes",
}

@Article{Lambe:1991:RHP,
  author =       "Larry A. Lambe",
  title =        "Resolutions via homological perturbation",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "1",
  pages =        "71--88 (or 71--87??)",
  month =        jul,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (18G10 55P99)",
  MRnumber =     "92k:68050",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Illinois Univ., Chicago, IL, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic; complexity; computational complexity;
                 homological perturbation; integers; manipulation;
                 mathematical environment; perturbation theory;
                 resolutions; Scratchpad system; symbol",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxtitle =      "Resolution via Homological Perturbation",
}

@Article{Garbey:1991:UMA,
  author =       "Marc Garbey and Hans G. Kaper and Gary K. Leaf and
                 Bernard J. Matkowsky",
  title =        "Using {MAPLE} for the Analysis of Bifurcation
                 Phenomena in Condensed-Phase Surface Combustion",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "1",
  pages =        "89--114 (or 89--113??)",
  month =        jul,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "1 124 306",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Div. of Math. and Comput. Sci., Argonne Nat. Lab., IL,
                 USA",
  classcodes =   "C7310 (Mathematics); C4170 (Differential equations);
                 C4150 (Nonlinear and functional equations)",
  classification = "C4150 (Nonlinear and functional equations); C4170
                 (Differential equations); C7310 (Mathematics)",
  corpsource =   "Div. of Math. and Comput. Sci., Argonne Nat. Lab., IL,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "bifurcation phenomena; Bifurcation phenomena; boundary
                 value; Boundary value problem; boundary-value problems;
                 combustion; condensed-phase surface; Condensed-phase
                 surface combustion; cylindrical solid fuel element;
                 Cylindrical solid fuel element; MAPLE; nonlinear
                 differential equations; nonlinear partial differential
                 equations; Nonlinear partial differential equations;
                 partial differential equations; problem; stability
                 properties; Stability properties; structure; Structure;
                 symbol manipulation; symbolic manipulation language;
                 Symbolic manipulation language",
  thesaurus =    "Boundary-value problems; Nonlinear differential
                 equations; Partial differential equations; Symbol
                 manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Oussous:1991:MCL,
  author =       "Nour Eddine Oussous",
  title =        "{Macsyma} Computation of Local Minimal Realization of
                 Dynamical Systems of which Generating Power Series are
                 Finite",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "1",
  pages =        "115--126",
  month =        jul,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "1 124 307",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Lab. d'Inf. Fondamentale, Lille Univ., Villeneuve
                 d'Ascq, France",
  classcodes =   "C7310 (Mathematics)",
  classification = "C7310 (Mathematics)",
  corpsource =   "Lab. d'Inf. Fondamentale, Lille Univ., Villeneuve
                 d'Ascq, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra system; computer; Computer algebra system;
                 dynamical; Dynamical systems; Finite alphabet; finite
                 alphabet; Generating power series; generating power
                 series; Local minimal realization; local minimal
                 realization; Macsyma computation; manipulation;
                 mathematics computing; series (mathematics); symbol;
                 systems",
  thesaurus =    "Mathematics computing; Series [mathematics]; Symbol
                 manipulation",
  treatment =    "A Application; P Practical",
}

@Article{Richardson:1991:WMK,
  author =       "Daniel Richardson",
  title =        "{Wu}'s method and the {Khovanski{\u{\i}}} finiteness
                 theorem",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "2",
  pages =        "127--142 (or 127--141??)",
  month =        aug,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "14P05 (68T15)",
  MRnumber =     "92m:14073",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0250 (Combinatorial mathematics); B0210 (Algebra);
                 C1160 (Combinatorial mathematics); C1110 (Algebra)",
  corpsource =   "Sch. of Math., Bath Univ., UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic; algebraic set; components; connected;
                 Khovanskii finiteness theorem; methods; Pfaff manifold;
                 polynomials; set theory; Wu--Ritt zero structure
                 theorem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{tenEikelder:1991:NFC,
  author =       "H. M. M. {ten Eikelder} and J. C. F. Wilmont",
  title =        "Normal Forms for a Class of Formulas",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "2",
  pages =        "143--160",
  month =        aug,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (03B35 68Q42)",
  MRnumber =     "92k:68048",
  MRreviewer =   "Yuji Kobayashi",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/cathode.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290P (Differential equations); C4170 (Differential
                 equations)",
  corpsource =   "Dept. of Math. and Comput. Sci., Eindhoven Univ. of
                 Technol., Netherlands",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "form; Hamiltonian systems; integral differential
                 formulae; integration; integration by parts;
                 mathematical physics; normal; normalization algorithm;
                 operator; partial differential equations; PDEs; real
                 functions; simplification; symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
  xxauthor =     "H. M. M. {Ten Eikelder} and J. C. F. Wilmont",
}

@Article{Klop:1991:SOT,
  author =       "Jan Willem Klop and Aart Middeldorp",
  title =        "Sequentiality in Orthogonal Term Rewriting Systems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "2",
  pages =        "161--196 (or 161--195??)",
  month =        aug,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q42",
  MRnumber =     "92i:68077",
  MRreviewer =   "Ralph W. Wilkerson",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Centre for Math. and Comput. Sci., Kruislaan,
                 Amsterdam, Netherlands",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "decidability; decidable property; one-; orthogonal
                 term rewriting systems; rewriting systems; step
                 reduction strategy; strong sequentiality",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Champarnaud:1991:ACP,
  author =       "J. M. Champarnaud and G. Hansel",
  title =        "{AUTOMATE}, a Computing Package for Automata and
                 Finite Semigroups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "2",
  pages =        "197--220",
  month =        aug,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (68Q70)",
  MRnumber =     "1 125 939",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4220 (Automata theory); C1160 (Combinatorial
                 mathematics); C7310 (Mathematics)",
  corpsource =   "LITP, Paris 7 Univ., France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "automata; AUTOMATE; computing package; deterministic
                 automata; deterministic minimal automaton; expressions;
                 extended rational; finite automata; finite semigroups;
                 group theory; interface; regular D-classes structure;
                 software packages; symbol manipulation; symbolic
                 computation; table; transition; transition monoid;
                 user",
  treatment =    "P Practical; R Product Review",
}

@Article{Pasini:1991:SCO,
  author =       "P. Pasini and F. Semeria and C. Zannoni",
  title =        "Symbolic Computation of Orientational Correlation
                 Function Moments",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "2",
  pages =        "221--231 (or 221--232??)",
  month =        aug,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "Ai/LP.bib;
                 http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/reduce.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7320 (Physics and Chemistry)",
  corpsource =   "INFN, Bologna, Italy",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "analytic evaluation; biaxially; computer algebra;
                 moments; orientational correlation function; physics
                 computing; REDUCE; SCHOONSCHIP; series expansion;
                 statistical physics; symbol manipulation; symbolic
                 manipulation; symmetric particles; Taylor;
                 time-correlation functions; uniaxial fluid",
  treatment =    "P Practical",
}

@Article{Wang:1991:MMC,
  author =       "Dong Ming Wang",
  title =        "Mechanical Manipulation for a Class of Differential
                 Systems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "2",
  pages =        "233--254",
  month =        aug,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "58-04 (34-04 34D20 68Q40)",
  MRnumber =     "92g:58002",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/cathode.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1320 (Stability); C4170 (Differential equations);
                 C7420 (Control engineering)",
  corpsource =   "Res. Inst. for Symbolic Comput., Johannes Kepler
                 Univ., Linz, Austria",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "6-tuple focus; computer algebraic methods; control
                 system analysis computing; cubic systems; DEMS;
                 differential systems; HP1000; IBM4341; incompleteness;
                 large polynomials; Liapunov constants; Liapunov
                 functions; limit cycles; Limit cycles SCRATCHPAD;
                 Lyapunov methods; manipulation; mechanical procedure;
                 nonlinear DEs; nonlinear differential equations;
                 Scratchpad II; stability; stability criteria; symbol",
  treatment =    "P Practical",
}

@Article{Otto:1991:WES,
  author =       "Friedrich Otto",
  title =        "When is an Extension of a Specification Consistent?
                 Decidable and Undecidable Cases",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "3",
  pages =        "255--274 (or 255--273??)",
  month =        sep,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q42 (03D40 68Q55)",
  MRnumber =     "93f:68056",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Fachbereich Math. Inf., Gesamthochschule Kassel,
                 Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic structure; consistency; consistent
                 extension; decidability; decision problem; finite
                 specifications; rewriting systems; string-rewriting
                 systems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Schend:1991:MDS,
  author =       "B. Schend",
  title =        "A Methodology for Detecting Shared Variable
                 Dependencies in Logic Programs",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "3",
  pages =        "275--298",
  month =        sep,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q10 (68N17 68Q60)",
  MRnumber =     "1 128 246",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6110 (Systems analysis and programming)",
  corpsource =   "ZXT-Inf. Technol., BASF AG, Ludwigshafen, Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "AND-parallel execution; checking; clause literals;
                 compile time analysis; dependency; inconsistent
                 bindings; independent literals; logic; logic
                 programming; parallel programming; program clauses;
                 programs; run-time analysis; shared variable
                 dependencies",
  treatment =    "P Practical",
}

@Article{Collins:1991:PCA,
  author =       "George E. Collins and Hoon Hong",
  title =        "Partial Cylindrical Algebraic Decomposition for
                 Quantifier Elimination",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "3",
  pages =        "299--328",
  month =        sep,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B35 (03C10 68Q40 68T20)",
  MRnumber =     "93b:03015",
  MRreviewer =   "Henry Africk",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C4290 (Other computer theory)",
  corpsource =   "Dept. of Comput. Sci., Ohio State Univ., Columbus, OH,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "atomic formulas; computational geometry; constant
                 signs; cylindrical algebraic decomposition; elementary
                 algebra; formal languages; method; polynomials;
                 quantifier elimination; truth evaluation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bjorck:1991:FWC,
  author =       "G{\"o}ran Bj{\"o}rck and Ralf Fr{\"o}berg",
  title =        "A Faster Way to Count the Solution of Inhomogeneous
                 Systems of Algebraic Equations, with Applications to
                 Cyclic $n$-Roots",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "3",
  pages =        "329--336",
  month =        sep,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "92g:68067",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 B0290H (Linear algebra); C4130 (Interpolation and
                 function approximation); C4140 (Linear algebra)",
  corpsource =   "Dept. of Math., Stockholm Univ., Sweden",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic equations; cyclic n-roots; inhomogeneous
                 systems; linear algebra; polynomials; symbol
                 manipulation; symbolic algebra",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Jacobsson:1991:SBG,
  author =       "Carl Jacobsson and Clas L{\"o}fwall",
  title =        "Standard Bases for General Coefficient Rings and a New
                 Constructive Proof of {Hilbert}'s Basis Theorem",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "3",
  pages =        "337--372 (or 337--371??)",
  month =        sep,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P10 (03F65 13E05 13L05 68Q40)",
  MRnumber =     "92j:13027",
  MRreviewer =   "Alessandro Logar",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Dept. of Math., Stockholm Univ., Sweden",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "constructive proof; constructively noetherian ring;
                 general coefficient rings; Hilbert basis theorem;
                 number theory; polynomial rings; termination",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sailer:1991:PRG,
  author =       "V. Sailer and G. Morales-Luna",
  title =        "On the Polynomial Representation of Generalized
                 {Liouville} Operators",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "3",
  pages =        "373--380 (or 373--379??)",
  month =        sep,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "35-04 (35G20 68-04)",
  MRnumber =     "92g:35002",
  MRreviewer =   "H. R{\"o}hrl",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290H (Linear algebra); C4140 (Linear algebra)",
  corpsource =   "Dept. of Electr. Eng., IPN, Mexico City, Mexico",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "generalized Liouville operators; inclusion properties;
                 matrix algebra; polynomial representation; polynomials;
                 real valued functions; square matrices; symbol
                 manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Roque:1991:CAS,
  author =       "Waldir L. Roque and Renato P. {dos Santos}",
  title =        "Computer Algebra in Spacetime Embedding",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "3",
  pages =        "381--389",
  month =        sep,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "83-04 (53-04 68Q40)",
  MRnumber =     "92g:83002",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/reduce.bib",
  abstract =     "In this paper we describe an algorithm to determine
                 the vectors normal to a space-time $ {V}_4 $ embedded
                 in a pseudo-Euclidean manifold $ {M}_{4 + N} $. An
                 application of this algorithm is given considering the
                 Schwarzschild spacetime geometry embedded in a 6
                 dimensional pseudo-Euclidean manifold, using the
                 algebraic computing system REDUCE.",
  acknowledgement = ack-nhfb,
  classcodes =   "A0420J (Solutions to equations); A0240 (Geometry,
                 differential geometry, and topology); A0260 (Numerical
                 approximation and analysis); A9530S (Relativity and
                 gravitation); C7320 (Physics and Chemistry); C6130
                 (Data handling techniques)",
  corpsource =   "Dept. de Matematica, Brasilia Univ., Brazil",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic; computing system; general relativity;
                 geometry; manifold; manipulation; physics computing;
                 pseudo-Euclidean; REDUCE; Schwarzschild metric;
                 Schwarzschild spacetime geometry; space-time
                 configurations; spacetime embedding; symbol",
  treatment =    "P Practical",
  xxauthor =     "W. L. Roque and R. P. Dos Santos",
}

@Article{Epstein:1991:UKB,
  author =       "D. B. A. Epstein and D. F. Holt and S. E. Rees",
  title =        "The Use of {Knuth--Bendix} Methods to Solve the Word
                 Problem in Automatic Groups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "4--5",
  pages =        "397--414",
  month =        oct # "--" # nov,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (03D40 20F10)",
  MRnumber =     "92m:68052",
  MRreviewer =   "Klaus Madlener",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part 2.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C7310 (Mathematics);
                 C4220 (Automata theory)",
  corpsource =   "Math. Inst., Warwick Univ., Coventry, UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "automatic groups; finite automata; finite-state
                 automata; geometry; infinite groups; Knuth--Bendix
                 methods; performance statistics; symbol manipulation;
                 topology; word problem",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Linton:1991:DCE,
  author =       "Stephen A. Linton",
  title =        "Double Coset Enumeration",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "4--5",
  pages =        "415--426",
  month =        oct # "--" # nov,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20F10",
  MRnumber =     "92k:20064",
  MRreviewer =   "M. Greendlinger",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part 2.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling
                 techniques)",
  corpsource =   "Dept. of Pure Math. and Math. Stat., Cambridge Univ.,
                 UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm; Computational Group Theory; coset table;
                 double coset enumeration; finitely presented groups;
                 mathematics; mathematics computing; principal method;
                 symbol manipulation; word problem",
  treatment =    "P Practical",
}

@Article{Linton:1991:CMR,
  author =       "S. A. Linton",
  title =        "Constructing Matrix Representations of Finitely
                 Presented Groups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "4--5",
  pages =        "427--438",
  month =        oct # "--" # nov,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20C40",
  MRnumber =     "93c:20032",
  MRreviewer =   "Gerhard Hiss",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part 2.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling
                 techniques)",
  corpsource =   "Inst. fur Experimentelle Math., Essen, Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "C program; computational group theory; finitely
                 generated algebras; finitely presented; groups;
                 mathematics computing; matrix representations
                 construction; permutation representations; symbol
                 manipulation; Todd--Coxeter coset enumeration
                 algorithm",
  treatment =    "P Practical",
}

@Article{Sims:1991:KBP,
  author =       "Charles C. Sims",
  title =        "The {Knuth--Bendix} Procedure for Strings as a
                 Substitute for Coset Enumeration",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "4--5",
  pages =        "439--442",
  month =        oct # "--" # nov,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (20F05)",
  MRnumber =     "92k:68051",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part 2.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling
                 techniques)",
  corpsource =   "Dept. of Math., Rutgers Univ., New Brunswick, NJ,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "coset enumeration; finitely; Knuth--Bendix procedure;
                 mathematics computing; presented group; strings; symbol
                 manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Butler:1991:CSS,
  author =       "Gregory Butler and John Cannon",
  title =        "Computing {Sylow} Subgroups of Permutation Groups
                 Using Homomorphic Images of Centralizers",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "4--5",
  pages =        "443--458 (or 443--457??)",
  month =        oct # "--" # nov,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20B40 (20-04 68Q40)",
  MRnumber =     "92m:20002",
  MRreviewer =   "D. F. Holt",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part 2.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C7310
                 (Mathematics)",
  corpsource =   "Dept. of Comput. Sci. and Pure Math., Sydney Univ.,
                 NSW, Australia",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "centralizers; homomorphic images of; homomorphisms;
                 invariant sets; large finite permutation group;
                 mathematics computing; natural; permutation groups;
                 Sylow subgroups; symbol manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Cameron:1991:FRD,
  author =       "P. J. Cameron and J. Cannon",
  title =        "Fast Recognition of Doubly Transitive Groups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "4--5",
  pages =        "459--474",
  month =        oct # "--" # nov,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20B40 (20-04 68Q40)",
  MRnumber =     "92m:20003",
  MRreviewer =   "D. F. Holt",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part 2.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling
                 techniques)",
  corpsource =   "Sch. of Math. Sci., Queen Mary and Westfield Coll.,
                 London, UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithms; classification; composition factors;
                 composition factors algorithm; dimensional affine
                 group; doubly transitive groups; fast recognition;
                 finite simple groups; general permutation; group;
                 mathematics computing; one-; residual; soluble; strong
                 generating set; symbol manipulation",
  treatment =    "P Practical",
}

@Article{Cooperman:1991:SGT,
  author =       "Gene Cooperman and Larry Finkelstein",
  title =        "A strong generating test and short presentations for
                 permutation groups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "4--5",
  pages =        "475--498 (or 475--497??)",
  month =        oct # "--" # nov,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (20B40 68Q20)",
  MRnumber =     "93d:68037",
  MRreviewer =   "Mark R. Jerrum",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part 2.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling
                 techniques)",
  corpsource =   "Coll. of Comput. Sci., Northeastern Univ., Boston, MA,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Computational Group Theory; computational group
                 theory; group membership problem; group theory; groups;
                 mathematics computing; permutation; short
                 presentations; strong generating test; symbol
                 manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxtitle =      "A Strong Generating Test and Short Presentation for
                 Permutation Groups",
}

@Article{Holt:1991:CNP,
  author =       "D. F. Holt",
  title =        "The Computation of Normalizers in Permutation Groups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "4--5",
  pages =        "499--516",
  month =        oct # "--" # nov,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20B40 (68Q40)",
  MRnumber =     "93b:20010",
  MRreviewer =   "Martin W. Liebeck",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part 2.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C7310 (Mathematics);
                 C1160 (Combinatorial mathematics)",
  corpsource =   "Math. Inst., Warwick Univ., Coventry, UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm; backtrack search; branches; computation;
                 finite permutation group; mathematics computing;
                 normalizers; permutation groups; search problems;
                 search tree; subgroup; symbol manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kantor:1991:FCF,
  author =       "William M. Kantor",
  title =        "Finding composition factors of permutation groups of
                 degree $ n \leq 10^6 $",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "4--5",
  pages =        "517--526",
  month =        oct # "--" # nov,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20B40 (68Q40)",
  MRnumber =     "93d:20009",
  MRreviewer =   "Peter M. Neumann",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part 2.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling techniques);
                 C1160 (Combinatorial mathematics)",
  corpsource =   "Oregon Univ., Eugene, OR, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "arithmetic calculations; composition factors;
                 composition series; computations; generating set; group
                 theoretic; group theory; mathematics computing;
                 permutation groups; simplicity; symbol manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxtitle =      "Finding Composition Factors of Permutation Groups of
                 Degree $n < 10^6$",
}

@Article{Leedham-Green:1991:CGH,
  author =       "Charles R. Leedham-Green and Cheryl E. Praeger and
                 Leonard H. Soicher",
  title =        "Computing with Group Homomorphisms",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "4--5",
  pages =        "527--532",
  month =        oct # "--" # nov,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (20B40)",
  MRnumber =     "92m:68053",
  MRreviewer =   "M. Greendlinger",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part 2.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling techniques);
                 C1160 (Combinatorial mathematics)",
  corpsource =   "Sch. of Math. Sci., Queen Mary and Westfield Coll.,
                 London, UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm; finite groups; Gauss algorithm; generating
                 set; group homomorphisms; group theory; kernel;
                 mathematics computing; PAG-systems; permutation groups;
                 power conjugate; presentations; probabilistic; soluble
                 group; symbol manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Leon:1991:PGA,
  author =       "Jeffrey S. Leon",
  title =        "Permutation Group Algorithms Based on Partitions, {I}:
                 Theory and Algorithms",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "4--5",
  pages =        "533--583",
  month =        oct # "--" # nov,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (20B40)",
  MRnumber =     "93c:68043",
  MRreviewer =   "Jean Moulin Ollagnier",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Computational group theory, Part 2.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling techniques);
                 C1160 (Combinatorial mathematics)",
  corpsource =   "Dept. of Math., Stat. and Comput. Sci., Illinois
                 Univ., Chicago, IL, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational group theory; generating set; graph
                 isomorphism; graph theory; group theory; manipulation;
                 mathematics computing; ordered partitions; partitions;
                 permutation group algorithms; refinement; strong;
                 successive; symbol",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Herfort:1991:NNR,
  author =       "W. Herfort and H. Penz",
  title =        "A new notion of reduction: generating universal
                 {Gr{\"o}bner} bases of ideals in {$ K(x, y) $}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "6",
  pages =        "585--606 (or 585--605??)",
  month =        dec,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P10 (68Q40)",
  MRnumber =     "92k:13017",
  MRreviewer =   "Joachim Apel",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C7310
                 (Mathematics)",
  corpsource =   "Inst. fur Numerische und Angewandte Math., Tech.
                 Univ., Wien, Austria",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "symbol manipulation; generating universal Gr{\"o}bner
                 bases; ideals; set ORD; term; orderings; polynomial
                 ring; general Buchberger algorithm; term orderings",
  treatment =    "P Practical",
}

@Article{Sendra:1991:SPC,
  author =       "J. Rafael Sendra and Franz Winkler",
  title =        "Symbolic Parametrization of Curves",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "6",
  pages =        "607--632 (or 607--631??)",
  month =        dec,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "14Q05 (14H20 65Y25 68U05)",
  MRnumber =     "93a:14053",
  MRreviewer =   "J. S. Joel",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4260 (Computational geometry); C6130 (Data handling
                 techniques); C7310 (Mathematics)",
  corpsource =   "Dept. de Matematicas de Alcala de Henares, Madrid,
                 Spain",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic curve; algebraic equations; computational
                 geometry; conjugate points; implicit representation;
                 multiplicity; parametric representation;
                 parametrization; plane; rational; symbol manipulation;
                 symbolic parametrization of curves",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxtitle =      "Symbolic parameterization of curves",
}

@Article{Nipkow:1991:CMA,
  author =       "Tobias Nipkow",
  title =        "Combining Matching Algorithms: The Regular Case",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "6",
  pages =        "633--654 (or 633--653??)",
  month =        dec,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35 03C05)",
  MRnumber =     "93a:68128",
  MRreviewer =   "Ursula Martin",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Comput. Lab., Cambridge Univ., UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "arbitrary; combining matching algorithms;
                 decidability; decidable; disjoint signatures;
                 equational; equational theories; rewriting system;
                 rewriting systems; theories",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Hartley:1991:CIC,
  author =       "David Hartley and Robin W. Tucker",
  title =        "A constructive implementation of the
                 {Cartan--K{\"a}hler} theory of exterior differential
                 systems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "6",
  pages =        "655--668 (or 655--667??)",
  month =        dec,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "58A15 (58-04 68Q40)",
  MRnumber =     "92i:58005",
  MRreviewer =   "Kichoon Yang",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/cathode.bib; Theory/reduce.bib",
  abstract =     "An efficient algorithm for the construction of a
                 regular chain of involutive integral elements for a
                 general exterior differential system is presented. It
                 is based upon the existence theorems of the
                 Cartan--K{\"a}hler theory, and may be used to analyse
                 partial differential equations by formulating them as
                 exterior differential systems.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4170 (Differential equations)",
  corpsource =   "Sch. of Phys. and Mater., Lancaster Univ., UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm; Cartan-; constructive implementation;
                 differential equations; exterior calculus EXCALC
                 REDUCE; exterior differential systems; involutive
                 integral elements; Kahler theory; mathematics
                 computing; partial; partial differential equations;
                 REDUCE implementation; regular chain; symbol
                 manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Yamartino:1991:ACA,
  author =       "Robert J. Yamartino and Richard Pavelle",
  title =        "An Application of Computer Algebra to a Problem in
                 Stratified Fluid Flow",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "6",
  pages =        "669--672",
  month =        dec,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "76-04 (68Q40 76V05)",
  MRnumber =     "1 141 546",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/reduce.bib",
  abstract =     "The computationally tedious problem of considering
                 trial Green's function solutions to the fourth-order
                 partial differential equation for a stratified
                 atmosphere flowing over a hill is approached using
                 MACSYMA. Significance of the problem, solution
                 methodologies and CPU time intercomparisons using
                 various computer platforms and other algebra systems
                 are discussed.",
  acknowledgement = ack-nhfb,
  affiliation =  "Sigma Res. Corp., Westford, MA, USA",
  classcodes =   "A4755H (Stratified flows); C7310 (Mathematics); C4170
                 (Differential equations)",
  classification = "A4755H (Stratified flows); C4170 (Differential
                 equations); C7310 (Mathematics)",
  corpsource =   "Sigma Res. Corp., Westford, MA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computationally; Computationally tedious problem;
                 Computer algebra; computer algebra; CPU time
                 intercomparisons; fourth-; Fourth-order partial
                 differential equation; MACSYMA; mathematics computing;
                 order partial differential equation; partial
                 differential equations; Stratified atmosphere;
                 stratified atmosphere; stratified flow; Stratified
                 fluid flow; stratified fluid flow; symbol manipulation;
                 tedious problem; Trial Green's function solutions;
                 trial Green's function solutions",
  thesaurus =    "Mathematics computing; Partial differential equations;
                 Stratified flow; Symbol manipulation",
  treatment =    "A Application; P Practical",
}

@Article{Wolf:1991:GCP,
  author =       "Kurt Bernardo Wolf and Guillermo Kr{\"o}tzsch",
  title =        "Group-classified polynomials of phase space in
                 higher-order aberration expansions",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "6",
  pages =        "673--694 (or 673--693??)",
  month =        dec,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "58F05 (34E10 58F40 68Q40 78A05)",
  MRnumber =     "92m:58050",
  MRreviewer =   "Richard C. Churchill",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling techniques);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "Inst. de Investigaciones en Matematicas Aplicadas y en
                 Sistemas, Univ. Nacional Autonoma de Mexico, Mexico
                 City, Mexico",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "aberration expansions; aberration-group products;
                 Baker--Campbell--Hausdorff compounding; classical phase
                 variables; computation complexity; group classified
                 polynomials; harmonics; higher-; higher-order; linear
                 combination; monomial basis; multiplication; optical
                 elements; order perturbation; phase space; Poisson
                 brackets; polynomials; solid spherical; symbol
                 manipulation; symplectic basis",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Andersen:1991:IHP,
  author =       "Carl M. Andersen and James F. Geer",
  title =        "Investigating a hybrid {perturbation-Galerkin}
                 technique using computer algebra",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "12",
  number =       "6",
  pages =        "695--714",
  month =        dec,
  year =         "1991",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "65L60 (34-04 34A50)",
  MRnumber =     "92i:65130",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "Ai/LP.bib;
                 http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4170 (Differential equations)",
  corpsource =   "Dept. of Math., Coll. of William and Mary,
                 Williamsburg, VA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "and eigenfunctions; approximate solutions;
                 boundary-value problems; classical Bubnov-Galerkin
                 method; computer algebra; differential equation type
                 problems; differential equations; eigenvalue problem;
                 eigenvalues; hybrid perturbation-Galerkin technique;
                 independent field variable; perturbation expansion;
                 perturbation theory; point boundary-value problem;
                 quantum; radius of convergence; scalar parameter;
                 symbol manipulation; two-",
  treatment =    "P Practical; X Experimental",
}

@Article{Lassez:1992:CFG,
  author =       "Jean-Louis L. Lassez and Ken McAloon",
  title =        "A canonical form for generalized linear constraints",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "1",
  pages =        "1--24",
  month =        jan,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T25 (68N15 68N17 68Q25)",
  MRnumber =     "93f:68082",
  MRreviewer =   "M. I. Dekhtyar",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Also appears as IBM Technical Report RC 15004.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4130 (Interpolation and function
                 approximation); C4240P (Parallel programming and
                 algorithm theory); C1230 (Artificial intelligence);
                 C1180 (Optimisation techniques)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "artificial intelligence; canonical form; completeness
                 theorem; constraint propagation; generalized linear
                 constraints; languages; linear arithmetic constraints;
                 mathematical programming; natural canonical;
                 parallelism; polynomial time algorithms; polynomials;
                 program verification; programming; redundancy;
                 representation; solvability; symbol manipulation;
                 symbolic computation system",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Sendra:1992:EPG,
  author =       "J. Rafael Sendra and Juan Llovet",
  title =        "An Extended Polynomial {GCD} Algorithm using {Hankel}
                 Matrices",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "1",
  pages =        "25--40 (or 25--39??)",
  month =        jan,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "93a:68067",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4130 (Interpolation and function
                 approximation); C4140 (Linear algebra)",
  corpsource =   "Dept. of Mat., Alcala Univ., Madrid, Spain",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "extended polynomial GCD algorithm; finite sequence of;
                 greatest common divisor; Hankel matrices; mathematics
                 computing; matrix algebra; polynomials; univariate
                 polynomials",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Landau:1992:NZD,
  author =       "Susan Landau",
  title =        "A Note on ``{Zippel} Denesting''",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "1",
  pages =        "41--46 (or 41--45??)",
  month =        jan,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11Y40",
  MRnumber =     "93b:11168",
  MRreviewer =   "Joe P. Buhler",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics)",
  corpsource =   "Dept. of Comput. Sci., Massachusetts Univ., Amherst,
                 MA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "condition; lower nesting depth; sufficient; symbol
                 manipulation; symbolic computation systems; Zippel
                 denesting",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Monagan:1992:HIT,
  author =       "Michael B. Monagan",
  title =        "A Heuristic Irreducibility Test for Univariate
                 Polynomials",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "1",
  pages =        "47--58 (or 47--57??)",
  month =        jan,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "1 153 634",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
  classcodes =   "C7310 (Mathematics); C4130 (Interpolation and function
                 approximation); C4140 (Linear algebra)",
  classification = "C4130 (Interpolation and function approximation);
                 C4140 (Linear algebra); C7310 (Mathematics)",
  corpsource =   "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm; Berlekamp-Hensel; Berlekamp-Hensel
                 algorithm; evaluation; Factoring polynomials; factoring
                 polynomials; Factorization package; factorization
                 package; Heuristic irreducibility test; heuristic
                 irreducibility test; linear algebra; MACSYMA;
                 manipulation; MAPLE; Maple symbolic algebra; Maple
                 symbolic algebra system; mathematics computing;
                 polynomial factorization, MAPLE; polynomials; prime;
                 Prime evaluation; Probabilistic primality test;
                 probabilistic primality test; REDUCE; symbol; system;
                 Univariate polynomials; univariate polynomials",
  thesaurus =    "Linear algebra; Mathematics computing; Polynomials;
                 Symbol manipulation",
  treatment =    "P Practical",
}

@Article{Mills:1992:SRT,
  author =       "R. D. Mills",
  title =        "Slope Retention Techniques for Solving Boundary-Value
                 Problems in Differential Equations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "1",
  pages =        "59--80",
  month =        jan,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "65L10",
  MRnumber =     "92k:65114",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290P (Differential equations); C4170 (Differential
                 equations); C7310 (Mathematics)",
  corpsource =   "Dept. of Comput. Sci., Glasgow Univ., UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "boundary-value problems; computation; differential;
                 differential equations; eigenvalue problems;
                 eigenvalues and eigenfunctions; elliptic partial;
                 equations; mathematics computing; numerical
                 computation; Numerov formula; partial differential
                 equations; recurrence formulae; shooting technique;
                 slope retention techniques; symbol manipulation;
                 symbolic; symbolic parameter",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Martin:1992:SEC,
  author =       "Ursula Martin and Michael Lai",
  title =        "Some Experiments with a Completion Theorem Prover",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "1",
  pages =        "81--100",
  month =        jan,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35 68Q40)",
  MRnumber =     "93e:68114",
  MRreviewer =   "Alexander Leitsch",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. Sci., London Univ., UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "automatic theorem prover; completion algorithm;
                 theorem proving; Theorem proving REVE group theory,
                 Knuth--Bendix",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cowell:1992:AOS,
  author =       "R. G. Cowell",
  title =        "Application of Ordered Standard Bases to Catastrophe
                 Theory",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "1",
  pages =        "101--115",
  month =        jan,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "58C28 (13P10 68Q40)",
  MRnumber =     "92m:58014",
  MRreviewer =   "Joachim Apel",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "A0240 (Geometry, differential geometry, and topology);
                 C4240 (Programming and algorithm theory); C4130
                 (Interpolation and function approximation)",
  corpsource =   "Dept. of Stat. Sci., Univ. Coll. London, UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm theory; catastrophe theory; polynomials;
                 symbol; manipulation; ordered standard bases;
                 catastrophe theory; Boardman; symbols; elementary
                 catastrophes; recognition problem; Gr{\"o}bner bases;
                 polynomial ideal theory",
  treatment =    "A Application; T Theoretical or Mathematical",
}

@Article{Lazard:1992:SZD,
  author =       "D. Lazard",
  title =        "Solving Zero-Dimensional Algebraic Systems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "2",
  pages =        "117--132 (or 117--131??)",
  month =        feb,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "93a:68066",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra)",
  corpsource =   "LITP, Inst. Blaise Pascal, Paris, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; polynomials; polynomial algorithms;
                 zero-dimensional algebraic systems; triangular sets;
                 polynomials; triangular systems; Gr{\"o}bner; bases",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fitzpatrick:1992:GBT,
  author =       "Patrick Fitzpatrick and John Flynn",
  title =        "A {Gr{\"o}bner} Basis Technique for {Pad{\'e}}
                 Approximation",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "2",
  pages =        "133--138",
  month =        feb,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (41A21)",
  MRnumber =     "93b:68037",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation)",
  corpsource =   "Dept. of Math., Univ. Coll., Cork, Ireland",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "approximation theory; polynomials; congruence;
                 multivariable polynomials; polynomial ideal; Pade
                 approximation; decoding Hensel codes; Gr{\"o}bner
                 bases; Euclidean algorithm; 1-variable problem",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "A {Gr{\"o}bner} Basis Technique for Inverting
                 Multivariable {Hensel} Codes",
}

@Article{Vorobjov:1992:CDC,
  author =       "Nikolaj N. {Vorobjov, Jr.}",
  title =        "The Complexity of Deciding Consistency of Systems of
                 Polynomials in Exponent Inequalities",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "2",
  pages =        "139--173 (or 139--174??)",
  month =        feb,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (68Q25)",
  MRnumber =     "93c:68046",
  MRreviewer =   "David Pokrass Jacobs",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C4240 (Programming and algorithm
                 theory); C4130 (Interpolation and function
                 approximation)",
  corpsource =   "Dept. of Math., Steklov Inst., Acad. of Sci.,
                 Leningrad, USSR",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "absolute value; complexity; computational complexity;
                 consistency decisions; decidability; exponent
                 inequalities; polynomial systems; polynomials; Real
                 Algebraic Geometry; time polynomial",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Burris:1992:DVS,
  author =       "Stanley Burris",
  title =        "Discriminator Varieties and Symbolic Computation",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "2",
  pages =        "175--208 (or 175--207??)",
  month =        feb,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (08B05 68T15)",
  MRnumber =     "93e:68044",
  MRreviewer =   "H.-J. Hoehnke",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C1230 (Artificial
                 intelligence)",
  corpsource =   "Dept. of Pure Math., Waterloo Univ., Ont., Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Birkhoff inference rules; computational logic;
                 discriminator varieties; equational; formal logic;
                 inference mechanisms; logic; symbolic computation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dickerson:1992:IAP,
  author =       "Matthew Dickerson",
  title =        "The Inverse of an Automorphism in Polynomial Time",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "2",
  pages =        "209--220",
  month =        feb,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (12Y05 13P99)",
  MRnumber =     "93b:68036",
  MRreviewer =   "Timothy Stokes",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Math. and Comput Sci., Middlebury Coll., VT,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "automorphism inverse; commutative ring; computational
                 complexity; endomorphism; exponential time solution;
                 field; polynomial; polynomial time algorithm; ring",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Beyer:1992:VCT,
  author =       "W. A. Beyer and L. R. Fawcett and L. P. Harten and B.
                 K. Swartz",
  title =        "The Volume Common to Two Congruent Circular
                 Cylinders",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "2",
  pages =        "221--230",
  month =        feb,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "51M25 (33E05 68Q40)",
  MRnumber =     "92k:51031",
  MRreviewer =   "E. J. F. Primrose",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Los Alamos Nat. Lab., California Univ., NM, USA",
  classcodes =   "C4180 (Integral equations)",
  classification = "C4180 (Integral equations)",
  corpsource =   "Los Alamos Nat. Lab., California Univ., NM, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "complete elliptic function formula; Complete elliptic
                 function formula; complete elliptic integrals; Complete
                 elliptic integrals; congruent circular cylinders;
                 Congruent circular cylinders; elliptic integrals;
                 incomplete; Incomplete elliptic integrals; integral
                 equations; MACSYMA; series; Series; symbol manipulator;
                 Symbol manipulator; volume formulae; Volume formulae",
  thesaurus =    "Integral equations",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lazard:1992:NUB,
  author =       "D. Lazard",
  title =        "A Note on Upper Bounds for Ideal-Theoretic Problems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "3",
  pages =        "231--234 (or 231--233??)",
  month =        mar,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13D02 (13P10)",
  MRnumber =     "93b:13020",
  MRreviewer =   "Joachim Apel",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C4130
                 (Interpolation and function approximation)",
  corpsource =   "LITP, Inst. Blaise Pascal, Paris, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational complexity; field; ideal theory;
                 membership relation; polynomials; syzygies; upper
                 bounds",
  treatment =    "T Theoretical or Mathematical",
}

@Article{OHearn:1992:RFF,
  author =       "Peter W. O'Hearn and Zbigniew Stachniak",
  title =        "A Resolution Framework for Finitely-valued First-order
                 Logics",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "3",
  pages =        "235--254",
  month =        mar,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B22 (03B35 03B50 68T15)",
  MRnumber =     "93e:03013",
  MRreviewer =   "P. {\v{S}}t{\v{e}}p{\'a}nek",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Sch. of Comput. and Inf. Sci., Syracuse Univ., NY,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "automated proof systems; completeness; finitely-valued
                 first-order logics; formal logic; polarity; resolution
                 proof; theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Renegar:1992:CCGa,
  author =       "James Renegar",
  title =        "On the Computational Complexity and Geometry of the
                 First-Order Theory of the Reals, Part {I}:
                 Introduction. {Preliminaries}. {The} Geometry of
                 Semi-Algebraic Sets. {The} Decision Problem for the
                 Existential Theory of the Reals",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "3",
  pages =        "255--299 (or 255--300??)",
  month =        mar,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B25 (03C10 03D15 12L05 68Q15 68Q22 68Q40)",
  MRnumber =     "93h:03011a",
  MRreviewer =   "G. Asser",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C4260
                 (Computational geometry); C1160 (Combinatorial
                 mathematics)",
  corpsource =   "Coll. of Eng., Cornell Univ., Ithaca, NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic sets; complexity upper bounds; computational
                 complexity; computational geometry; decision; decision
                 method; decision problem; existential theory;
                 expressions; false; first order; quantifier elimination
                 method; reals; semi-; set theory; theory; true",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Renegar:1992:CCGb,
  author =       "James Renegar",
  title =        "On the Computational Complexity and Geometry of the
                 First-Order Theory of the Reals, Part {II}: The General
                 Decision Problem. {Preliminaries} for Quantifier
                 Elimination",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "3",
  pages =        "301--328 (or 301--327??)",
  month =        mar,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B25 (03C10 03D15 12L05 68Q15 68Q22 68Q40)",
  MRnumber =     "93h:03011b",
  MRreviewer =   "G. Asser",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C4260
                 (Computational geometry)",
  corpsource =   "Coll. of Eng., Cornell Univ., Ithaca, NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "atomic predicates; Boolean formula; computational
                 complexity; computational geometry; decision; decision
                 problem; elimination; first-; order theory; polynomial;
                 quantifier; reals; sentences; theory",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Renegar:1992:CCGc,
  author =       "James Renegar",
  title =        "On the Computational Complexity and Geometry of the
                 First-order Theory of the Reals. Part {III}: Quantifier
                 Elimination",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "3",
  pages =        "329--352",
  month =        mar,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B25 (03C10 03D15 12L05 68Q15 68Q22 68Q40)",
  MRnumber =     "93h:03011c",
  MRreviewer =   "G. Asser",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C4260
                 (Computational geometry)",
  corpsource =   "Coll. of Eng., Cornell Univ., Ithaca, NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "atomic; Boolean formula; computational complexity;
                 computational geometry; elimination method; first-;
                 free variables; order theory; polynomial; predicates;
                 real number model quantifier",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sit:1992:ASP,
  author =       "William Y. Sit",
  title =        "An Algorithm for Solving Parametric Linear Systems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "4",
  pages =        "353--394",
  month =        apr,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "65F30 (68Q40)",
  MRnumber =     "93h:65062",
  MRreviewer =   "Sudhangshu B. Karmakar",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290H (Linear algebra); C4140 (Linear algebra); C4240
                 (Programming and algorithm theory); C7310
                 (Mathematics)",
  corpsource =   "Dept. of Math., City Coll. of New York, NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm; complexity analysis; computational
                 complexity; efficient; elimination method; Gaussian;
                 linear equations; manipulation; matrix algebra;
                 parametric linear systems; SCRATCHPAD II; symbol",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sasaki:1992:TNA,
  author =       "Tateaki Sasaki and Masayuki Suzuki",
  title =        "Three New Algorithms for Multivariate Polynomial
                 {GCD}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "4",
  pages =        "395--412 (or 395--411??)",
  month =        apr,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "93c:68045",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation);
                 B0290F (Interpolation and function approximation);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "Inst. of Phys. and Chem. Res., Saitama, Japan",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm theory; polynomials; multivariate polynomial
                 GCD; greatest common divisor; Gr{\"o}bner basis;
                 subresultant; truncated power series; PRS; polynomial
                 remainder sequence",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bronstein:1992:SLO,
  author =       "Manuel Bronstein",
  title =        "On Solutions of Linear Ordinary Differential Equations
                 in Their Coefficient Field",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "4",
  pages =        "413--440 (or 413--439??)",
  month =        apr,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (34A05)",
  MRnumber =     "93e:68042",
  MRreviewer =   "Jean Moulin Ollagnier",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290P (Differential equations); C4170 (Differential
                 equations)",
  corpsource =   "Inst. fur Wissenschaftliches Rechnen, ETH Zentrum,
                 Zurich, Switzerland",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "coefficient field; differential equations; linear
                 ordinary differential equations; Liouvillian;
                 Liouvillian coefficients; primitive adjunctions;
                 rational algorithm; solutions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dorre:1992:SSF,
  author =       "Jochen D{\"o}rre and William C. Rounds",
  title =        "On Subsumption and Semiunification in Feature
                 Algebras",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "4",
  pages =        "441--461",
  month =        apr,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (68T30)",
  MRnumber =     "93h:68064",
  MRreviewer =   "P. {\v{S}}t{\v{e}}p{\'a}nek",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "IBM Deutschland GmbH, Inst. for Knowledge-Based Syst.,
                 Stuttgart, Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra homomorphism; algebras; computational
                 linguistics; decidability; feature algebras; finite
                 feature; formal logic; function symbols;
                 semiunification problem; term subsumption; unary",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Beauzamy:1992:PPP,
  author =       "Bernard Beauzamy",
  title =        "Products of Polynomials and a Priori Estimates for
                 Coefficients in Polynomial Decompositions: a Sharp
                 Result",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "5",
  pages =        "463--472",
  month =        may,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11Y05 (12D05 68Q40)",
  MRnumber =     "93h:11140",
  MRreviewer =   "Jean-Pierre Massias",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics); C1110 (Algebra)",
  corpsource =   "Inst. de Calcul Math., Paris 7 Univ., France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "a priori estimates; coefficients; decompositions;
                 integer; number theory; numerical constant; polynomial;
                 polynomials; submultiplicative norm; weighted norm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Adams:1992:SRG,
  author =       "William W. Adams and Ann K. Boyle",
  title =        "Some results on {Gr{\"o}bner} bases over commutative
                 rings",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "5",
  pages =        "473--484",
  month =        may,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P10 (68Q40)",
  MRnumber =     "93h:13025",
  MRreviewer =   "Ralf Fr{\"o}berg",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra)",
  corpsource =   "Dept. of Math., Maryland Univ., College Park, MD,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "group theory; polynomials; Gr{\"o}bner bases;
                 commutative rings; finite set; polynomials; Szekeres
                 bases; UFD",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "Some Comments on {Gr{\"o}bner} Bases over Commutative
                 Rings",
}

@Article{Manocha:1992:IRR,
  author =       "Dinesh Manocha and John F. Canny",
  title =        "Implicit Representation of Rational Parametric
                 Surfaces",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "5",
  pages =        "485--510",
  month =        may,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "14Q10 (68Q40 68U05)",
  MRnumber =     "93d:14090",
  MRreviewer =   "Jean D'Almeida",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4260 (Computational geometry); C4130 (Interpolation
                 and function approximation)",
  corpsource =   "Div. of Comput. Sci., California Univ., Berkeley, CA,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "base points; blow up curves; computational geometry;
                 curve fitting; rational curves; rational parametric
                 surfaces",
  treatment =    "T Theoretical or Mathematical",
  xxauthor =     "J. F. Canny and D. Manocha",
}

@Article{Grossman:1992:SCD,
  author =       "Robert Grossman and Richard G. Larson",
  title =        "Symbolic Computation of Derivations Using Labelled
                 Trees",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "5",
  pages =        "511--524 (or 511--523??)",
  month =        may,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "93f:68050",
  MRreviewer =   "A. K. Lenstra",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "Ai/LP.bib;
                 http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C6120 (File
                 organisation); C1160 (Combinatorial mathematics)",
  corpsource =   "Illinois Univ., Chicago, IL, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra homomorphism; associative algebra; data; data
                 structures; derivations; formal linear combinations;
                 operators; programming theory; rooted labelled;
                 structures; symbolic computation; trees; trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
  xxauthor =     "R. Grossmann and R. G. Larson",
  xxtitle =      "Symbolic Computation of Derivations Using Labeled
                 Trees",
}

@Article{Knowles:1992:ICT,
  author =       "Paul H. Knowles",
  title =        "Integration of a Class of Transcendental {Liouvillian}
                 Functions with Error-Functions, Part {I}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "5",
  pages =        "525--544 (or 525--543??)",
  month =        may,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "93m:68093",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "A0230 (Function theory, analysis); A0260 (Numerical
                 approximation and analysis); C4160 (Numerical
                 integration and differentiation); C4110 (Error analysis
                 in numerical methods)",
  corpsource =   "D'Youville Coll., Buffalo, NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "decision-procedure; elementary; error analysis;
                 error-functions; functions; integration; Liouville
                 equation; symbolic integration; transcendental
                 Liouvillian functions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Fateman:1992:RM,
  author =       "Richard J. Fateman",
  title =        "A Review of {Mathematica}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "5",
  pages =        "545--579",
  month =        may,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (68-04 68N99)",
  MRnumber =     "93f:68049",
  MRreviewer =   "D. Z. Spicer",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "ftp://ftp.math.utah.edu/pub/tex/bib/mathematica.bib;
                 http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Div. of Comput. Sci., California Univ., Berkeley, CA,
                 USA",
  classcodes =   "C7310 (Mathematics)",
  classification = "C7310 (Mathematics)",
  corpsource =   "Div. of Comput. Sci., California Univ., Berkeley, CA,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic; Algebraic computation; computation;
                 Mathematica computer system; mathematics computing;
                 software packages; Symbolic computation; symbolic
                 computation",
  thesaurus =    "Mathematics computing; Software packages",
  treatment =    "B Bibliography; P Practical; R Product Review",
}

@Article{Koepf:1992:PSC,
  author =       "Wolfram Koepf",
  title =        "Power Series in Computer Algebra",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "6",
  pages =        "581--604 (or 581--603??)",
  month =        jun,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "93j:68087",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Fachbereich Math., Freie Univ., Berlin, Germany",
  classcodes =   "C7310 (Mathematics); C6130 (Data handling
                 techniques)",
  classification = "C6130 (Data handling techniques); C7310
                 (Mathematics)",
  corpsource =   "Fachbereich Math., Freie Univ., Berlin, Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Addition; addition; Algorithmic approach; algorithmic
                 approach; Analytic functions; analytic functions;
                 Computer algebra; computer algebra; Computer algebra
                 systems; computer algebra systems; Division; division;
                 equation; formal; Formal substitution; Inversion;
                 inversion; MACSYMA; manipulation; mathematics
                 computing; Multiplication; multiplication; Numerical
                 programming; numerical programming; ordinary
                 differential; Ordinary differential equation; Power
                 series; power series; series (mathematics);
                 substitution; symbol",
  thesaurus =    "Mathematics computing; Series [mathematics]; Symbol
                 manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Mignotte:1992:PLR,
  author =       "Maurice Mignotte",
  title =        "On the Product of the Largest Roots of a Polynomial",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "6",
  pages =        "605--612 (or 605--611??)",
  month =        jun,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "26C10 (30C15 65H05 68Q40)",
  MRnumber =     "93h:26023",
  MRreviewer =   "N. K. Govil",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "Univ. Louis Pasteur, Strasbourg, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "largest; largest roots; moduli; polynomial;
                 polynomials; product; upper bound",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Caferra:1992:MSS,
  author =       "Ricardo Caferra and Nicolas Zabel",
  title =        "A Method for Simultaneous Search for Refutations and
                 Models by Equational Constraint Solving",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "6",
  pages =        "613--642 (or 613--641??)",
  month =        jun,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35)",
  MRnumber =     "94d:68092",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C1230 (Artificial intelligence);
                 C1160 (Combinatorial mathematics); C1180 (Optimisation
                 techniques); C7310 (Mathematics); C6110L (Logic
                 programming)",
  corpsource =   "LIFIA-IMAG-CNRS, Grenoble, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Bernays-Schonfinkel class; constraint solving;
                 decision procedure; equational; Herbrand models;
                 inference; inference mechanisms; linear programming;
                 models; question-answering problem; refutations;
                 resolution; search problems; simultaneous search;
                 symbol manipulation; system; theorem proving",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Guimaraes:1992:DRT,
  author =       "J. E. F. Guimaraes and G. R. Heppler and S. R.
                 Czapor",
  title =        "On the Derivation and Reduction of {$ C^1 $}
                 Trigonometric Basis Functions Using {Maple}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "6",
  pages =        "643--676 (or 643--675??)",
  month =        jun,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "65T10",
  MRnumber =     "93d:65117",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "ftp://ftp.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Syst. Design Eng., Waterloo Univ., Ont.,
                 Canada",
  classcodes =   "C7310 (Mathematics); C4185 (Finite element analysis);
                 C1230 (Artificial intelligence)",
  classification = "C1230 (Artificial intelligence); C4185 (Finite
                 element analysis); C7310 (Mathematics)",
  corpsource =   "Dept. of Syst. Design Eng., Waterloo Univ., Ont.,
                 Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "$C^1$ trigonometric basis functions; Canonical
                 simplification; Derivation; Finite element method;
                 Gr{\"o}bner bases; Heuristic methodology; Reduction;
                 Trial function; Waterloo Maple software; finite element
                 analysis; heuristic programming; mathematics;
                 computing; Waterloo Maple software; derivation;
                 reduction; $C^1$; trigonometric basis functions;
                 heuristic methodology; finite; element method; trial
                 function; canonical simplification; Gr{\"o}bner bases",
  thesaurus =    "Finite element analysis; Heuristic programming;
                 Mathematics computing",
  treatment =    "P Practical",
}

@Article{Chee:1992:GQS,
  author =       "Yeow Meng Chee",
  title =        "On Graphical Quintuple Systems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "6",
  pages =        "677--682 (or 677--681??)",
  month =        jun,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "05B05",
  MRnumber =     "93d:05019",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C1160 (Combinatorial
                 mathematics); C6130B (Graphics techniques)",
  corpsource =   "Planning and Infrastructure Dept., Nat. Comput. Board,
                 Singapore",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computer graphics; graph theory; graphical quintuple
                 systems; symbol manipulation; symbolic computational
                 tools",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Sarlet:1992:RPS,
  author =       "W. Sarlet and J. {Vanden Bonne}",
  title =        "{REDUCE}-Procedures for the Study of Adjoint
                 Symmetries of Second-Order Differential Equations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "13",
  number =       "6",
  pages =        "683--693",
  month =        jun,
  year =         "1992",
  CODEN =        "JSYCEH",
  DOI =          "http://dx.doi.org/10.1016/S0747-7171(10)80017-3",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "34A26 (34-04 58F35)",
  MRnumber =     "1177715 (93h:34014)",
  MRreviewer =   "L. M. Berkovich",
  bibdate =      "Sat Sep 13 16:02:50 2014",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 http://www.math.utah.edu/pub/tex/bib/redextra.bib;
                 Theory/cathode.bib; Theory/reduce.bib",
  abstract =     "Two {REDUCE} programs are presented which should be of
                 assistance in computing and studying so-called adjoint
                 symmetries of second-order ordinary differential
                 equations. The first program essentially serves to
                 construct the determining equations for adjoint
                 symmetries, whose leading coefficients are allowed to
                 be polynomial functions of the velocities. The second
                 program runs various tests concerning the possible
                 construction of a first integral or a lagrangian for
                 the given system.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4130 (Interpolation and function
                 approximation); C4170 (Differential equations)",
  corpsource =   "Inst. voor Theor. Mech., Gent Univ., Belgium",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "adjoint symmetries; differential equations; integral;
                 Lagrangian; mathematics computing; polynomial
                 functions; polynomials; Reduce computer-algebra system;
                 REDUCE ODEs first integrals; REDUCE-procedures;
                 second-order",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Weispfenning:1992:CGB,
  author =       "Volker Weispfenning",
  title =        "Comprehensive {Gr{\"o}bner} Bases",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "1",
  pages =        "1--30 (or 1--29??)",
  month =        jul,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P10 (68Q40)",
  MRnumber =     "93h:13029",
  MRreviewer =   "Ralf Fr{\"o}berg",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4130 (Interpolation and function
                 approximation); C4260 (Computational geometry)",
  corpsource =   "Passau Univ., Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational geometry; polynomials; symbol
                 manipulation; comprehensive Gr{\"o}bner bases; integral
                 domain; polynomial; ring; finite ideal basis;
                 ALDES/SAC-2 implementation; algebraic geometry",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Bayer:1992:CHF,
  author =       "Dave Bayer and Mike Stillman",
  title =        "Computation of {Hilbert} Functions",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "1",
  pages =        "31--50",
  month =        jul,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P10 (13D40 68Q40)",
  MRnumber =     "94f:13018",
  MRreviewer =   "Rafael H. Villarreal",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4130 (Interpolation and function
                 approximation)",
  corpsource =   "Dept. of Math., Barnard Coll., New York, NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "generic coordinates; Hilbert function; implementation
                 details; monomial ideal; polynomials; symbol
                 manipulation; timing data",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Adi:1992:AUR,
  author =       "Mohamed Adi and Claude Kirchner",
  title =        "{AC}-Unification Race: The System Solving Approach,
                 Implementation and Benchmarks",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "1",
  pages =        "51--70",
  month =        jul,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15",
  MRnumber =     "93j:68170",
  MRreviewer =   "Ralph W. Wilkerson",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6110B (Software engineering
                 techniques)",
  corpsource =   "CRIN, Villers les Nancy, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "AC-unification race; associative-commutative;
                 benchmarks; C language; formal specification;
                 implementation; performance; program; specification;
                 symbol manipulation; system solving approach;
                 unification algorithm",
  treatment =    "P Practical",
}

@Article{Harper:1992:CTS,
  author =       "Robert Harper",
  title =        "Constructing Type Systems over an Operational
                 Semantics",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "1",
  pages =        "71--84",
  month =        jul,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q55 (03B70)",
  MRnumber =     "93i:68121",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Carnegie-Mellon Univ., Pittsburgh, PA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "closed; formal languages; inductive definition;
                 inductively-defined relations; Martin-Lof type; NuPRL
                 system; operational semantics; partial equivalence
                 relations; programming language; set-theoretic
                 argument; terms; theorem proving; theory; type systems
                 construction; type theories; type-free",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Dietrich:1992:EAC,
  author =       "Volker Dietrich",
  title =        "{ELISE}, an Algorithm to Compute Asymptotic
                 Representations for Solutions of Linear Differential
                 Equations, Realized with the Computer Algebra System
                 {MAPLE}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "1",
  pages =        "85--92",
  month =        jul,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "34-04 (34A20 34E05 65L99)",
  MRnumber =     "93f:34002",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "ftp://ftp.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Lehrstuhl II fur Math., RWTH Aachen, Germany",
  classcodes =   "C7310 (Mathematics); C4170 (Differential equations)",
  classification = "C4170 (Differential equations); C7310
                 (Mathematics)",
  corpsource =   "Lehrstuhl II fur Math., RWTH Aachen, Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "asymptotic representations; Asymptotic
                 representations; computer algebra system MAPLE;
                 Computer algebra system MAPLE; irregular singular
                 points; linear differential equations; Linear
                 differential equations; manipulation; software
                 packages; symbol",
  thesaurus =    "Linear differential equations; Software packages;
                 Symbol manipulation",
  treatment =    "P Practical",
}

@Article{Richardson:1992:BBP,
  author =       "J. Richardson",
  title =        "The {Blockhandler} and the {Bitfield} package",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "1",
  pages =        "93--102 (or 93--101??)",
  month =        jul,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 http://www.math.utah.edu/pub/tex/bib/magma.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation); C7310 (Mathematics)",
  corpsource =   "Sch. of Math. and Stat., Sydney Univ., NSW,
                 Australia",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Bitfield package; Blockhandler; C; Cayley; computer
                 algebra system; data access; garbage collection;
                 implementation; indirect; memory management;
                 programming interface; reference; storage management;
                 symbol manipulation",
  treatment =    "P Practical",
}

@Article{Carminati:1992:IDE,
  author =       "John Carminati and John S. Devitt and Greg J. Fee",
  title =        "Isogroups of Differential Equations Using Algebraic
                 Computing",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "1",
  pages =        "103--120",
  month =        jul,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "35-04 (35A30 35Q99)",
  MRnumber =     "93f:35004",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Math., Murdoch Univ., WA, Australia",
  classcodes =   "C7310 (Mathematics); C4170 (Differential equations)",
  classification = "C4170 (Differential equations); C7310
                 (Mathematics)",
  corpsource =   "Dept. of Math., Murdoch Univ., WA, Australia",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic computing; Algebraic computing; differential
                 equations; Differential equations; Harrison-Estabrook
                 procedure; interactive tools; Interactive tools;
                 isogroups; Isogroups; Liesymm package; MAPLE;
                 mathematics computing; packages; partial differential
                 equations; Partial differential equations; software;
                 symbol manipulation",
  thesaurus =    "Differential equations; Mathematics computing;
                 Software packages; Symbol manipulation",
  treatment =    "A Application; P Practical",
}

@Article{Buchberger:1992:SIJ,
  author =       "B. Buchberger",
  title =        "Special Issue of {JSC} on ``{Symbolic Computation in
                 Combinatorics}'' --- Foreward of the
                 {Editor-in-Chief}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "2--3",
  pages =        "121--122",
  month =        aug # "--" # sep,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Feb 7 13:30:07 MST 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  xxtitle =      "Special Issue: Symbolic Computation in
                 Combinatorics---Foreword of the Editor-in-Chief",
}

@Article{Paule:1992:SIJ,
  author =       "P. Paule and D. Zeilberger",
  title =        "Special Issue of {JSC} on ``{Symbolic Computation in
                 Combinatorics}'' --- Foreward of the {Guest Editors}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "2--3",
  pages =        "123--126",
  month =        aug # "--" # sep,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Feb 7 13:30:07 MST 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  xxtitle =      "Special Issue: Symbolic Computation in Combinatorics:
                 Foreword of the {Guest Editors}",
}

@Article{Bergeron:1992:SMS,
  author =       "Fran{\c{c}}ois Bergeron and Nantel Bergeron",
  title =        "Symbolic Manipulation for the Study of the Descent
                 Algebra of Finite {Coxeter} Groups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "2--3",
  pages =        "127--140 (or 127--139??)",
  month =        aug # "--" # sep,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (20F55)",
  MRnumber =     "94d:68048",
  MRreviewer =   "Richard M. Thomas",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "LACIM, Quebec Univ., Montreal, Que., Canada",
  classcodes =   "C7310 (Mathematics); C6130 (Data handling techniques);
                 C4210 (Formal logic)",
  classification = "C4210 (Formal logic); C6130 (Data handling
                 techniques); C7310 (Mathematics)",
  corpsource =   "LACIM, Quebec Univ., Montreal, Que., Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "descent algebra; finite Coxeter; groups; Maple; proofs
                 of theorems; symbol manipulation; symbolic
                 manipulation; theorem proving",
  thesaurus =    "Symbol manipulation; Theorem proving",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Garvan:1992:PTP,
  author =       "Frank G. Garvan and Gaston H. Gonnet",
  title =        "A proof of the two parameter $q$-cases of the
                 {Macdonald-Morris} constant term root system conjecture
                 for $ {S}({F}_4)$ and $ {S}({F}_4)^\vee $ via
                 {Zeilberger}'s method",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "2--3",
  pages =        "141--178 (or 141--177??)",
  month =        aug # "--" # sep,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (33D80 68R05)",
  MRnumber =     "94c:68100",
  MRreviewer =   "Peter Paule",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation); C4210
                 (Formal logic)",
  corpsource =   "Dept. of Math., Florida Univ., Gainesville, FL, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "hypergeometric sequence; linear system of equations;
                 Macdonald-Morris constant term root; polynomials; q-;
                 system; theorem proving; two parameter q-cases;
                 Zeilberger's method",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gessel:1992:SBN,
  author =       "Ira M. Gessel",
  title =        "Super Ballot Numbers",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "2--3",
  pages =        "179--194",
  month =        aug # "--" # sep,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "05A10",
  MRnumber =     "93k:05009",
  MRreviewer =   "R. A. Askey",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Dept. of Math., Brandeis Univ., Waltham, MA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Catalan numbers; combinatorial problems; number
                 theory; numbers; super ballot",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kerber:1992:SOO,
  author =       "Adalbert Kerber and Axel Kohnert and Alain Lascoux",
  title =        "{SYMMETRICA}, an Object Oriented Computer-Algebra
                 System for the Symmetric Group",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "2--3",
  pages =        "195--204 (or 195--203??)",
  month =        aug # "--" # sep,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (05E10 20C30 20C40)",
  MRnumber =     "93g:68062",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6110J (Object-oriented
                 programming); C4130 (Interpolation and function
                 approximation)",
  corpsource =   "Lehrstuhl Math. II, Bayreuth Univ., Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; classical multivariate polynomials;
                 coefficients; combinatorics; integer sequences;
                 invariant theory; Littlewood--Richardson; manipulation;
                 object oriented computer-algebra system;
                 object-oriented programming; of polynomials;
                 polynomials; representation theory; Schubert
                 polynomials; symbol; symbolic computations; symmetric
                 group; SYMMETRICA",
  treatment =    "P Practical",
  xxauthor =     "Adalbert Kerber and Axel Kohnert and Alain {Lascous or
                 Lascoux??}",
}

@Article{Kohnert:1992:SPS,
  author =       "Axel Kohnert",
  title =        "{Schubert} Polynomials and Skew {Schur} Functions",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "2--3",
  pages =        "205--210",
  month =        aug # "--" # sep,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "05E05",
  MRnumber =     "94a:05210",
  MRreviewer =   "Piotr Pragacz",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4130 (Interpolation and function
                 approximation)",
  corpsource =   "Lehrstuhl Math. II, Bayreuth Univ., Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "coefficients; combinatorial algorithms; Littlewood
                 Richardson; polynomials; Schubert polynomials; skew
                 Schur functions; symbol manipulation; SYMCHAR;
                 symmetric; SYMMETRICA",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Labelle:1992:CAE,
  author =       "Gilbert Labelle",
  title =        "Counting Asymmetric Enriched Trees",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "2--3",
  pages =        "211--242",
  month =        aug # "--" # sep,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "05A15 (05C30)",
  MRnumber =     "93m:05011",
  MRreviewer =   "C. C. Rousseau",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C1160 (Combinatorial
                 mathematics)",
  corpsource =   "Quebec Univ., Montreal, Que., Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "1-2-3; asymmetry index series; automorphism group;
                 computing algebra; cyclic; enriched trees; explicit
                 formulas; Otter-Robinson-Leroux formula; permutation;
                 planar; R-; recursive formulas; symbol manipulation;
                 symbolic computation; topological; trees
                 (mathematics)",
  treatment =    "B Bibliography; P Practical; T Theoretical or
                 Mathematical",
}

@Article{Petkovsek:1992:HSL,
  author =       "Marko Petkov{\v{s}}ek",
  title =        "Hypergeometric Solutions of Linear Recurrences with
                 Polynomial Coefficients",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "2--3",
  pages =        "243--264",
  month =        aug # "--" # sep,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "39A10 (03D45 05A99 12H10 12Y05 33C80)",
  MRnumber =     "94a:39006",
  MRreviewer =   "Alessandro Logar",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4130 (Interpolation and function
                 approximation)",
  corpsource =   "Dept. of Math., Ljubljana Univ., Slovenia",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm Hyper; coefficients; hypergeometric
                 solutions; linear recurrences; polynomial; polynomials;
                 symbol manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Takayama:1992:AZR,
  author =       "Nobuki Takayama",
  title =        "An Approach to the Zero Recognition Problem by
                 {Buchberger} Algorithm",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "2--3",
  pages =        "265--282",
  month =        aug # "--" # sep,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "93j:68090",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4140 (Linear algebra)",
  corpsource =   "Dept. of Math., Kobe Univ., Japan",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra-analog; algorithm; Buchberger; differential
                 operators; holonomic function; linear algebra;
                 quasi-algorithm; Sylvester's dyalitic elimination;
                 symbol manipulation; Weyl; zero recognition problem",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{BoydelaTour:1992:ORC,
  author =       "Thierry {Boy de la Tour}",
  title =        "An Optimality Result for Clause Form Translation",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "4",
  pages =        "283--302 (or 283--301??)",
  month =        oct,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35)",
  MRnumber =     "93j:68172",
  MRreviewer =   "Ralph W. Wilkerson",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C4210
                 (Formal logic)",
  corpsource =   "Lab. d'Inf. Fondamentale et d'Intelligence
                 Artificielle, Grenoble, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "clause form translation; clause forms; computational
                 complexity; equivalence-free conjectures; exponential
                 complexity; polynomial; theorem proving; translation",
  treatment =    "T Theoretical or Mathematical",
  xxauthor =     "T. {Boy De La Tour}",
}

@Article{Dougherty:1992:IGU,
  author =       "Daniel J. Dougherty and Patricia Johann",
  title =        "An improved general $ {E}$-unification method",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "4",
  pages =        "303--320",
  month =        oct,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35 03C05)",
  MRnumber =     "93i:68155",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Dept. of Math., Wesleyan Univ., Middletown, CT, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "E-unification; Paramodulation; symbol manipulation;
                 theorem proving; transformations",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Miller:1992:UUM,
  author =       "Dale Miller",
  title =        "Unification Under a Mixed Prefix",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "4",
  pages =        "321--358",
  month =        oct,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35 03B40)",
  MRnumber =     "93g:68121",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Pennsylvania Univ.,
                 Philadelphia, PA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "decidability; mixed prefix; optimizations;
                 pre-unifiers; search problems; symbol manipulation;
                 unification problems; unification search problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zhang:1992:SPF,
  author =       "Louxin Zhang",
  title =        "Some Properties of Finite Special String-Rewriting
                 Systems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "4",
  pages =        "359--370 (or 359--369??)",
  month =        oct,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q42 (03D03 03D40)",
  MRnumber =     "94c:68108",
  MRreviewer =   "K. G. Subramanian",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "decidability; decision problems; finite; rewriting
                 systems; special monoids; special string-rewriting
                 systems; undecidable",
  treatment =    "T Theoretical or Mathematical",
}

@Article{McNulty:1992:FGE,
  author =       "George F. McNulty",
  title =        "A Field Guide to Equational Logic",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "4",
  pages =        "371--398 (or 371--397??)",
  month =        oct,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03C05 (08B05 68Q40 68Q42)",
  MRnumber =     "94g:03065",
  MRreviewer =   "Paul Bankston",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Dept. of Math., South Carolina Univ., Columbia, SC,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "equational; logic; rewriting systems; symbol
                 manipulation; symbolic computation; term rewriting
                 systems",
  treatment =    "B Bibliography; T Theoretical or Mathematical",
}

@Article{Yokoyama:1992:SSA,
  author =       "Kazuhiro Yokoyama and Masayuki Noro and Taku
                 Takeshima",
  title =        "Solutions of Systems of Algebraic Equations and Linear
                 Maps on Residue Class Rings",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "4",
  pages =        "399--417",
  month =        oct,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P10 (68Q40)",
  MRnumber =     "94g:13020",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory)",
  corpsource =   "Int. Inst. for Adv. Study of Social Inf. Sci., Fujitsu
                 Labs. Ltd., Numazu, Japan",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational complexity; symbol manipulation;
                 algebraic equations; linear maps; residue class rings;
                 linear algebra; Gr{\"o}bner basis",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lescanne:1992:WRO,
  author =       "Pierre Lescanne",
  title =        "Well Rewrite Orderings and Well Quasi-Orderings",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "5",
  pages =        "419--436 (or 419--435??)",
  month =        nov,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q42 (03B35 03D35 04A20 68T15)",
  MRnumber =     "93k:68053",
  MRreviewer =   "Ursula Martin",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "INRIA-Lorraine, Vandoeuvre-les-Nancy, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "basicity; divisibility order; narrowing; orderings;
                 projectivity; rewrite relation; rewriting systems;
                 transitive closure; well quasi-; well rewrite
                 orderings, embedding order",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Treinen:1992:NMU,
  author =       "Ralf Treinen",
  title =        "A New Method for Undecidability Proofs of First Order
                 Theories",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "5",
  pages =        "437--458 (or 437--457??)",
  month =        nov,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03D35 (03C07)",
  MRnumber =     "93m:03077",
  MRreviewer =   "M. A. Ta{\u{\i}} tslin",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "DFKI, Saarbrucken, Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "associativity; commutativity; correspondence;
                 decidability; decision problem; first order theories;
                 ordering; partial lexicographic path; problem;
                 reduction proofs; term algebra; undecidability proofs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gao:1992:IRP,
  author =       "Xiao Shan Gao and Shang-Ching Chou",
  title =        "Implicitization of Rational Parametric Equations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "5",
  pages =        "459--470",
  month =        nov,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "93h:68065",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4260 (Computational geometry); C1160 (Combinatorial
                 mathematics)",
  corpsource =   "Dept. of Comput. Sci., Wichita State Univ., KS, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational geometry; number theory; rational
                 parametric equations; Gr{\"o}bner basis method;
                 implicitization; basis; implicit prime ideal;
                 independent; parameters; inversion maps; algebraic
                 curves",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pauer:1992:LIG,
  author =       "Franz Pauer",
  title =        "On Lucky Ideals for {Gr{\"o}bner} Basis Computations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "5",
  pages =        "471--482",
  month =        nov,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P10 (68Q40)",
  MRnumber =     "94a:13031",
  MRreviewer =   "Gianfranco Niesi",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4260 (Computational geometry); C1160 (Combinatorial
                 mathematics); C1110 (Algebra)",
  corpsource =   "Inst. fur Math., Innsbruck Univ., Austria",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational geometry; number theory; polynomials;
                 lucky ideals; Gr{\"o}bner basis; principal ideal ring;
                 commutative ring; polynomial ring; ideal basis",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rutman:1992:GBP,
  author =       "Elizabeth W. Rutman",
  title =        "{Gr{\"o}bner} Bases and Primary Decomposition of
                 Modules",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "5",
  pages =        "483--504 (or 483--503??)",
  month =        nov,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P10 (68Q40)",
  MRnumber =     "94a:13032",
  MRreviewer =   "Gianfranco Niesi",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4260 (Computational geometry); C1160 (Combinatorial
                 mathematics)",
  corpsource =   "Maryland Univ., College Park, MD, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational geometry; number theory; Gr{\"o}bner
                 bases; primary decomposition; submodules; free;
                 modules; polynomial rings; Noetherian commutative
                 rings; base ring; PID; dimension conditions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Shen:1992:SCG,
  author =       "Ba Zhong Shen",
  title =        "Solving a Congruence on a Graded Algebra by a
                 Subresultant Sequence and its Application",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "5",
  pages =        "505--522",
  month =        nov,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "94B27 (13A02 68Q40 94B05 94B35)",
  MRnumber =     "94a:94009",
  MRreviewer =   "Shojiro Sakata",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B6120B (Codes); B0210 (Algebra); C4240 (Programming
                 and algorithm theory); C1110 (Algebra); C6130 (Data
                 handling techniques)",
  corpsource =   "Dept. of Math. and Comput. Sci., Eindhoven Univ. of
                 Technol., Netherlands",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; codes; computational complexity; congruence;
                 decode; geometric Goppa codes; graded algebra; group
                 theory; nonnegative integers; nonzero ideal; submonoid;
                 subresultant sequence",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Barbier:1992:AGM,
  author =       "Christine Barbier and Peter Bettess and Jacqueline A.
                 Bettess",
  title =        "Automatic Generation of Mapping Functions for Infinite
                 Elements Using {REDUCE}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "5",
  pages =        "523--534",
  month =        nov,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "65-04 (65N30)",
  MRnumber =     "1 197 718",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/reduce.bib",
  abstract =     "Co continuous basis functions for use in the finite
                 element method when the elements extend to infinity in
                 one or more directions can be derived simply following
                 the method of Zienkiewicz. The numerical code for these
                 functions can be generated automatically using computer
                 algebra languages such as {REDUCE}. This paper
                 describes the method and explains how {REDUCE} is used
                 to easily produce numerical code.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4185 (Finite element analysis); C7310 (Mathematics)",
  corpsource =   "Dept. of Marine Technol., Newcastle upon Tyne Univ.,
                 UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "$C_0$; code; computer algebra languages; continuous
                 basis functions; finite element analysis; finite
                 element method; infinite elements; mapping functions;
                 mathematics computing; numerical; REDUCE",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Domenjoud:1992:AUT,
  author =       "Eric Domenjoud",
  title =        "{AC} Unification Through Order-Sorted {AC1}
                 Unification",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "6",
  pages =        "537--556",
  month =        dec,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (03B35 68T15)",
  MRnumber =     "93m:68091",
  MRreviewer =   "Ralph W. Wilkerson",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1230 (Artificial intelligence); C4240 (Programming
                 and algorithm theory)",
  corpsource =   "CRIN, Vandoeuvre-les-Nancy, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "AC unification; associativity; collapsing theory;
                 commutativity; computational complexity; inference
                 mechanisms; NP-complete; order-sorted AC1 unification",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "{AC} unification through order-sorted {ACI}
                 unification",
}

@Article{Schicho:1992:CPP,
  author =       "Josef Schicho",
  title =        "On the Choice of Pencils in the Parametrization of
                 Curves",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "6",
  pages =        "557--576",
  month =        dec,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (14H10 14Q05)",
  MRnumber =     "94b:68066",
  MRreviewer =   "Alexander I. Barvinok",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4260 (Computational geometry)",
  corpsource =   "Dept. of Symbolic Comput., Linz Univ., Austria",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational geometry; curve parameterization;
                 pencils",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "On the Choice of Pencils in the Parameterization of
                 Curves",
}

@Article{Paul:1992:GRC,
  author =       "Etienne Paul",
  title =        "A General Refutational Completeness Result for an
                 Inference Procedure Based on Associative ---
                 Commutative Unification",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "6",
  pages =        "577--618",
  month =        dec,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35)",
  MRnumber =     "94f:68163",
  MRreviewer =   "Alexander Leitsch",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1230 (Artificial intelligence); C4210 (Formal logic);
                 C4240 (Programming and algorithm theory)",
  corpsource =   "CNET, Issy les Moulineaux, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "AC-paramodulation; associative-commutative
                 unification; completeness proof; equality; extension
                 clauses; inference; inference mechanisms; inference
                 rules; procedure; proving; Q-semantic tree;
                 refutational completeness; semantic tree; theorem;
                 theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Richardson:1992:CTB,
  author =       "Daniel Richardson",
  title =        "Computing the Topology of a Bounded Non-Algebraic
                 Curve in the Plane",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "6",
  pages =        "619--644 (or 619--643??)",
  month =        dec,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (03D45)",
  MRnumber =     "94e:68092",
  MRreviewer =   "Joos Heintz",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4260 (Computational geometry); C4220 (Automata
                 theory)",
  corpsource =   "Dept. of Math., Bath Univ., UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "analytic functions; bounded coordinate aligned
                 rectangle; bounded nonalgebraic curve; computational
                 geometry; constant problem; cylindrical decomposition;
                 definable constants; derivatives; false; first order
                 algebraic differential equations; local Sturm
                 sequences; oracle; polynomials; real plane; topology;
                 Turing machines; Turing reduced; zero set",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Berque:1992:SPS,
  author =       "David Berque and Ronald Cecchini and Mark Goldberg and
                 Reid Rivenburgh",
  title =        "The Set Player System for Symbolic Computation on
                 Power Sets",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "14",
  number =       "6",
  pages =        "645--662",
  month =        dec,
  year =         "1992",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (04-04 05C85 68R05)",
  MRnumber =     "93m:68090",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C1160 (Combinatorial
                 mathematics)",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "combinatorics; data structures; graph theory;
                 mathematics computing; packages; power sets; set
                 theory; SetPlayer system; software; symbolic set
                 computation",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxtitle =      "The {SetPlayer} System for Symbolic Computation on
                 Power Sets",
}

@Article{Puel:1993:CPM,
  author =       "Laurence Puel and Asc{\'a}nder Su{\'a}rez",
  title =        "Compiling Pattern Matching by Term Decomposition",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "1",
  pages =        "1--26",
  month =        jan,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68N17 (68N20 68Q55)",
  MRnumber =     "94c:68038",
  MRreviewer =   "Zhenyu Qian",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6150C (Compilers, interpreters and other processors);
                 C4210 (Formal logic)",
  corpsource =   "Univ. Paris Sud, Orsay, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "compiling pattern matching; lazy languages; match
                 algorithm; ML; partial evaluation; program compilers;
                 rewriting systems; term decomposition; term rewriting",
  treatment =    "P Practical",
}

@Article{Sidebottom:1993:ICI,
  author =       "G. Sidebottom",
  title =        "Implementing {CLP(IB)} using the connection theorem
                 proving method and a clause management system",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "1",
  pages =        "27--48",
  month =        jan,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6140D (High level languages); C6110L (Logic
                 programming)",
  corpsource =   "Dept. of Comput. Sci., Simon Fraser Univ., Burnaby,
                 BC, Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Boolean algebra; clause management; CLP; CLP(IB);
                 connection theorem proving; constraint handling;
                 constraint processing algorithms; digital circuit
                 design; language; logic programming; logic programming
                 languages; propositional logic problems; proving;
                 theorem; verification",
  treatment =    "P Practical",
  xxtitle =      "Implementing {CLP} ({B}) using the Connection Theorem
                 Proving Method and a Clause Management System",
}

@Article{Adams:1993:TWS,
  author =       "W. W. Adams and A. Boyle and P. Loustaunau",
  title =        "Transitivity for Weak and Strong {Gr{\"o}bner} Bases",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "1",
  pages =        "49--66 (or 49--65??)",
  month =        jan,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (13A02 13P10)",
  MRnumber =     "94b:68064",
  MRreviewer =   "Joachim Apel",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics); C4260
                 (Computational geometry)",
  corpsource =   "Maryland Univ., College Park, MD, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational geometry; group theory; transitivity;
                 Gr{\"o}bner bases; Noetherian integral domain; ordered
                 group; term order; finite subset; PID",
  treatment =    "T Theoretical or Mathematical",
  xxauthor =     "W. W. Adams and A. Boyle and A. P. Loustaunau",
}

@Article{Burris:1993:EPF,
  author =       "Stanley Burris and John Lawrence",
  title =        "The Equivalence Problem for Finite Rings",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "1",
  pages =        "67--72 (or 67--71??)",
  month =        jan,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "16P10 (03D15 68Q25)",
  MRnumber =     "94c:16030",
  MRreviewer =   "Mike Prest",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4260 (Computational geometry)",
  corpsource =   "Dept. of Pure Math., Waterloo Univ., Ont., Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "co-NP-complete; computational complexity;
                 computational geometry; equivalence problem; finite
                 rings",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Klimov:1993:SMG,
  author =       "D. M. Klimov and V. V. Leonov and V. M. Rudenko",
  title =        "The study of motion for a gyroscope with gimbal
                 suspension: obtaining the highest approximations for a
                 drift of {Magnus}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "1",
  pages =        "73--78",
  month =        jan,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/reduce.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7320 (Physics and Chemistry)",
  comment =      "Here we give a solution to the classic problem of the
                 applied mechanics of the gyroscope. The problem is
                 reduced to using the computer algebra system {REDUCE}.
                 We show that symbolic computation is very convenient
                 for applied mechanics.",
  corpsource =   "Inst. for Problems in Mech., Russian Acad. of Sci.,
                 Moscow, Russia",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra system; applied mechanics; approximations;
                 computer; drift of Magnus; gimbal suspension;
                 gyroscope; highest; motion study; physics computing;
                 REDUCE; symbol manipulation; symbolic computation",
  treatment =    "P Practical",
}

@Article{Bennett:1993:CAT,
  author =       "J. P. Bennett and M. Grinfeld and J. Hubble",
  title =        "Computer Algebra Techniques in Affinity Binding
                 Equations: the Dimer Case",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "1",
  pages =        "79--84 (or 79--83??)",
  month =        jan,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/reduce.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "A3620C (Conformation (statistics and dynamics));
                 A8715H (Molecular dynamics, molecular probes, molecular
                 pattern recognition); A8715K (Molecular interactions,
                 charge transfer complexes); C7320 (Physics and
                 Chemistry)",
  comment =      "In this note we apply computer algebra techniques to
                 affinity binding equations. We treat the situation in
                 which the protein is dimeric and shows cooperative
                 binding. Special attention is paid to the case where
                 more than one molecule of the immobilized ligand can be
                 bound by the macromolecule.",
  corpsource =   "Sch. of Math. Sci., Bath Univ., UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "affinity binding; affinity chromatography; biophysics;
                 chemistry computing; computer algebra; cooperative
                 binding; dimer case; equations; immobilized ligand;
                 macromolecular dynamics; macromolecule; molecular;
                 physics computing; protein; proteins; symbol
                 manipulation",
  treatment =    "P Practical",
}

@Article{Zharkov:1993:CCI,
  author =       "A. Yu. Zharkov",
  title =        "Computer Classification of the Integrable Coupled
                 {Kdv}-like Systems with Unit Main Matrix",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "1",
  pages =        "85--90",
  month =        jan,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "35Q53 (68Q40)",
  MRnumber =     "94b:35252",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/reduce.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4170 (Differential equations); C7310 (Mathematics);
                 C4140 (Linear algebra)",
  comment =      "The classification of 2-component systems of equations
                 for the form
                 $u^{i}_{t}=u^{i}_{xxx}+c_{ij}u^{i}u^{j}_{x}(i,j=1,2)$
                 which possess higher symmetries is given. A new class
                 of such integrable KdV-like systems is obtained. All
                 the computations have been done using the {REDUCE}
                 computer algebra system.",
  corpsource =   "Saratov State Univ., Russia",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "equations; integrable coupled Kdv-like systems;
                 mathematics computing; matrix algebra; partial
                 differential; PDE; REDUCE computer algebra system;
                 symbol manipulation; unit main matrix",
  treatment =    "P Practical",
}

@Article{Mills:1993:SPS,
  author =       "Harry S. D. Mills",
  title =        "Symbolically precise solutions to a homogeneous second
                 order matrix ordinary differential equation with
                 {Macsyma}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "1",
  pages =        "91--98",
  month =        jan,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "34-04 (34A05 68Q40)",
  MRnumber =     "1 210 450",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Math., Idaho Univ., ID, Moscow, USA",
  classcodes =   "C4170 (Differential equations); C4140 (Linear
                 algebra); C7310 (Mathematics)",
  classification = "C4140 (Linear algebra); C4170 (Differential
                 equations); C7310 (Mathematics)",
  corpsource =   "Dept. of Math., Idaho Univ., ID, Moscow, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; batch file; Batch file; determinant;
                 Determinant; differential equations; equation; factors;
                 functional entries; Functional entries; homogeneous
                 second order matrix ordinary differential; Homogeneous
                 second order matrix ordinary differential equation; ilt
                 function; Ilt function; inverse transform; Inverse
                 transform; Laplace; Laplace transform theory; Macsyma;
                 mathematics computing; matrix; matrix equation; Matrix
                 equation; ODE; quadratic; Quadratic factors; SUN 3/60;
                 symbol manipulation; transform theory; tube-ode2;
                 Tube-ode2",
  thesaurus =    "Differential equations; Mathematics computing; Matrix
                 algebra; Symbol manipulation",
  treatment =    "P Practical",
}

@Article{Manocha:1993:MRA,
  author =       "Dinesh Manocha and John F. Canny",
  title =        "{MultiPolynomial} Resultant Algorithms",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "2",
  pages =        "99--122",
  month =        feb,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "93m:68094",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4240 (Programming and algorithm
                 theory)C4130 (Interpolation and function
                 approximation)",
  corpsource =   "Dept. of Comput. Sci., North Carolina Univ., Chapel
                 Hill, NC, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational complexity; polynomials; symbol
                 manipulation; multipolynomial resultant algorithms;
                 computational methods; Gr{\"o}bner bases; symbolic
                 determinants; storage requirements; symbolic
                 elimination algorithm; performance",
  treatment =    "B Bibliography; P Practical",
}

@Article{Murao:1993:FSR,
  author =       "Hirokazu Murao and Hidetsune Kobayashi and Tetsuro
                 Fujise",
  title =        "On factorizing the symbolic $
                 {U}$-resultant---application of the $ {\rm ddet}$
                 operator",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "2",
  pages =        "123--142",
  month =        feb,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "93m:68095",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C1140 (Probability and
                 statistics)",
  corpsource =   "Comput. Centre, Tokyo Univ., Japan",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic equations; algebraic extensions; ddet
                 operator; factorizing; factors; finitely many
                 solutions; probabilistic; probability; symbol
                 manipulation; symbolic representation; symbolic
                 U-resultant; system of; true linear",
  treatment =    "P Practical",
}

@Article{Kalkbrener:1993:GEA,
  author =       "Michael Kalkbrener",
  title =        "A Generalized {Euclidean} Algorithm for Computing
                 Triangular Representations of Algebraic Varieties",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "2",
  pages =        "143--168 (or 143--167??)",
  month =        feb,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P10 (13-04 14-04 14Q15 68Q40)",
  MRnumber =     "94e:13053",
  MRreviewer =   "Robert O. Robson",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Res. Inst. for Symbolic Comput., Linz Univ., Austria",
  classcodes =   "C7310 (Mathematics); C4130 (Interpolation and function
                 approximation); C4240 (Programming and algorithm
                 theory)",
  classification = "C4130 (Interpolation and function approximation);
                 C4240 (Programming and algorithm theory); C7310
                 (Mathematics)",
  corpsource =   "Res. Inst. for Symbolic Comput., Linz Univ., Austria",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic varieties; Algebraic varieties;
                 computational complexity; computer algebra system
                 MAPLE; Computer algebra system MAPLE; generalized
                 Euclidean algorithm; Generalized Euclidean algorithm;
                 greatest common divisors; Greatest common divisors;
                 mathematics computing; polynomials; Polynomials;
                 radical membership; Radical membership; symbol
                 manipulation; triangular representations; Triangular
                 representations; unmixed-dimensional decomposition;
                 Unmixed-dimensional decomposition",
  thesaurus =    "Computational complexity; Mathematics computing;
                 Polynomials; Symbol manipulation",
  treatment =    "P Practical",
}

@Article{Jebelean:1993:AED,
  author =       "Tudor Jebelean",
  title =        "An Algorithm for Exact Division",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "2",
  pages =        "169--180",
  month =        feb,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "93m:68092",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240P (Parallel programming and algorithm theory);
                 C7310 (Mathematics)",
  corpsource =   "Res. Inst. for Symbolic Comput., Linz Univ., Austria",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithms; computer algebra systems; division modulo
                 a power; exact division algorithm; integer GCD
                 computation; least-; manipulation; mathematics
                 computing; of 2; parallel algorithms; significant
                 digits; symbol; systolic; systolic parallelization",
  treatment =    "P Practical",
}

@Article{Limongelli:1993:EAB,
  author =       "Carla Limongelli",
  title =        "On an Efficient Algorithm for Big Rational Number
                 Computations by Parallel $p$-adics",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "2",
  pages =        "181--198 (or 181--197??)",
  month =        feb,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (68Q25)",
  MRnumber =     "94c:68101",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240P (Parallel programming and algorithm theory)",
  corpsource =   "Dipartimento di Inf. e Sistemistica, Roma Univ.,
                 Italy",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "adics; algorithm; arithmetic expression; asymptotic
                 bit-wise; big rational number computations; complexity;
                 computational complexity; parallel algorithms; parallel
                 p-; parallelism; rational output; recovery step;
                 truncation order",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Grabe:1993:LP,
  author =       "Hans-Gert Gr{\"a}be",
  title =        "On Lucky Primes",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "2",
  pages =        "199--210 (or 199--209??)",
  month =        feb,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P10 (68Q40)",
  MRnumber =     "94e:13052",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Theory/reduce.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C4140
                 (Linear algebra); C4130 (Interpolation and function
                 approximation)",
  comment =      "Winkler (1988) and Pauer (1992) present algorithms for
                 a Hensel lifting of a modular Gr{\"o}bner basis over
                 lucky primes to a rational one. They have to solve a
                 linear system with modular polynomial entries that
                 requires another (modular) Gr{\"o}ner basis
                 computation. After an extension of luckiness to
                 arbitrary (commutative noetherian) base rings we show
                 in this paper that for a homogeneous polynomial ideal I
                 one lift not only its Gr{\"o}bner basis but also a
                 homogeneous basis of its syzygy module. The same result
                 holds for arbitrary ideals and liftings from Z/p to Q.
                 Moreover the same lifting can be obtained from a true
                 Gr{\"o}bner trace by linear algebra over Q only.
                 Parallel modular techniques allow to find such a true
                 Gr{\"o}bner and a lucky prime with high probability.
                 All these results generalize in an obvious way to
                 homogeneous modules generated by the rows of matrices
                 with polynomial entries. Since luckiness can be
                 weakened to a condition that transfers from I to higher
                 syzygy modules the lifting theorem generalizes to a
                 lifting theorem for the resolution of I.",
  corpsource =   "Inst. fur Inf., Leipzig Univ., Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational complexity; linear algebra; polynomials;
                 parallel modular techniques; lucky primes; Hensel
                 lifting; modular Gr{\"o}bner basis; modular polynomial
                 entries; homogeneous polynomial ideal; homogeneous
                 basis; syzygy; module; linear algebra; high
                 probability",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Wursthorn:1993:IMG,
  author =       "Martin Wursthorn",
  title =        "Isomorphisms of modular group algebras: An algorithm
                 and its application to groups of order $ 2^6 $",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "2",
  pages =        "211--228 (or 211--227??)",
  month =        feb,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20C05 (20C40 68Q40)",
  MRnumber =     "94h:20008",
  MRreviewer =   "Wolfgang Lempken",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
}

@Article{Butler:1993:HA,
  author =       "Greg Butler and John J. Cannon",
  title =        "On {Holt}'s Algorithm",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "2",
  pages =        "229--234 (or 229--233??)",
  month =        feb,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20-04 (20B40 68Q40)",
  MRnumber =     "94e:20001",
  MRreviewer =   "J. D. Dixon",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
}

@Article{Thatte:1993:FAT,
  author =       "Satish R. Thatte",
  title =        "Finite Acyclic Theories are Unitary",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "2",
  pages =        "235--249",
  month =        feb,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B35 (03C05 68Q50 68T15)",
  MRnumber =     "94h:03028",
  MRreviewer =   "Sauro Tulipani",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
}

@Article{Becker:1993:SBP,
  author =       "Thomas Becker",
  title =        "Standard Bases in Power Series Rings: Uniqueness and
                 Superfluous Critical Pairs",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "3",
  pages =        "251--266 (or 251--265??)",
  month =        mar,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "95b:68061",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0210 (Algebra); C1110 (Algebra); C7310
                 (Mathematics)",
  corpsource =   "Fakultat fur Math. und Inf., Passau Univ., Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "series (mathematics); symbol manipulation; power
                 series rings; uniqueness; superfluous critical pairs;
                 fixed admissible term order; Gr{\"o}bner basis
                 criterion",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Rutman:1993:PDM,
  author =       "Elizabeth W. Rutman",
  title =        "Primary Decomposition of Modules: Two Variables over a
                 Field",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "3",
  pages =        "267--276 (or 267--275??)",
  month =        mar,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "94i:68136",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "Maryland Univ., College Park, MD, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "free module; modules; polynomial ring; polynomials;
                 primary decomposition; submodule; symbol manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Dube:1993:CPE,
  author =       "Thomas W. Dub{\'e}",
  title =        "A Combinatorial Proof of the Effective
                 {Nullstellensatz}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "3",
  pages =        "277--296",
  month =        mar,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P10 (14Q20 68Q40)",
  MRnumber =     "94j:13022",
  MRreviewer =   "Timothy Stokes",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "Coll. of the Holy Cross, Worcester, MA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "affine multi-variate; combinatorial proof; counting
                 arguments; degree bound D; degrees of polynomials;
                 Nullstellensatz; polynomial ring; polynomials; symbol
                 manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Lippok:1993:RBC,
  author =       "Frank Lippok",
  title =        "On the Representation of 1 by Binary Cubic Forms of
                 Positive Discriminant",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "3",
  pages =        "297--314 (or 297--313??)",
  month =        mar,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11D85 (11E25 11Y50 68Q40)",
  MRnumber =     "94h:11029",
  MRreviewer =   "A. Peth{\"o}",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation)",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "binary cubic forms; computer-search; discriminant;
                 even nonreversible forms; polynomials; positive; symbol
                 manipulation; Thue equation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Deutsch:1993:IAH,
  author =       "Jesse Ira Deutsch",
  title =        "Identities arising from {Hecke} transformations of
                 modular forms over {$ {\bf Q}(\sqrt {2}) $} and {$ {\bf
                 Q}(\sqrt {3}) $}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "3",
  pages =        "315--324 (or 315--323??)",
  month =        mar,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11F41 (11Y40 68Q40)",
  MRnumber =     "94e:11047",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics)",
  classification = "C7310 (Mathematics)",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computer algebra system MACSYMA; Computer algebra
                 system MACSYMA; eigenfunctions; Eigenfunctions; Hecke
                 transformations; Hilbert modular forms; modular forms;
                 Modular forms; numerical identities; Numerical
                 identities; symbol manipulation",
  thesaurus =    "Symbol manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Wilson:1993:BTC,
  author =       "Robert A. Wilson",
  title =        "The {Brauer} tree for $ {J}_3 $ in characteristic $ 17
                 $",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "3",
  pages =        "325--330",
  month =        mar,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20C34 (68Q40)",
  MRnumber =     "94g:20021",
  MRreviewer =   "Jamshid Moori",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0250 (Combinatorial mathematics); C1160
                 (Combinatorial mathematics)",
  corpsource =   "Dept. of Math., Birmingham Univ., UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Brauer tree; characteristic 17; ordinary characters;
                 trees (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Middeldorp:1993:CCC,
  author =       "Aart Middeldorp and Yoshihito Toyama",
  title =        "Completeness of Combinations of Constructor Systems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "3",
  pages =        "331--348",
  month =        mar,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q42",
  MRnumber =     "94f:68111",
  MRreviewer =   "Ralph W. Wilkerson",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Dept. of Software Technol., CWI, Amsterdam,
                 Netherlands",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "completeness; completeness of combinations;
                 confluence; constructor systems; disjoint union; divide
                 and conquer technique; function; modular; modularity;
                 property; rewriting system; rewriting systems; symbols;
                 term; weak normalisation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Wang:1993:ACI,
  author =       "Rongdong Wang and Peng-yung Woo",
  title =        "Automatic computation of $z$- {\&} inverse
                 $z$-transformations by {Maple}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "3",
  pages =        "349--363",
  month =        mar,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "1 229 641",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "ftp://ftp.math.utah.edu/pub/tex/bib/maple-extract.bib;
                 http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Math., Texas A and I Univ., Kingsville, TX,
                 USA",
  classcodes =   "C7310 (Mathematics); C6115 (Programming support)",
  classification = "C6115 (Programming support); C7310 (Mathematics)",
  corpsource =   "Dept. of Math., Texas A and I Univ., Kingsville, TX,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Algebraic manipulation software; algebraic
                 manipulation software; Inverse Z-transformations;
                 inverse Z-transformations; manipulation; Maple;
                 mathematics computing; software packages; symbol;
                 Z-transformation; z-transformation",
  thesaurus =    "Mathematics computing; Software packages; Symbol
                 manipulation",
  treatment =    "P Practical",
}

@Article{Bergeron:1993:SMU,
  author =       "Fran{\c{c}}ois Bergeron",
  title =        "Surprising Mathematics Using a Computer Algebra
                 System",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "3",
  pages =        "365--370",
  month =        mar,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20C40 (68Q40)",
  MRnumber =     "94j:20010",
  MRreviewer =   "Gerhard Hiss",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics)",
  corpsource =   "Dept. de Math. et Inf., Quebec Univ., Montreal, Que.,
                 Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computer algebra system; cyclotomic polynomial; group
                 algebra; primitive; ring of polynomials modulo; roots
                 of unity; symbol manipulation; symmetric group",
  treatment =    "P Practical",
}

@Article{Viry:1993:FMP,
  author =       "Guy Viry",
  title =        "Factorization of Multivariate Polynomials with
                 Coefficients in {$ {\bf F}_p $}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "4",
  pages =        "371--392 (or 371--391??)",
  month =        apr,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "95a:68065",
  MRreviewer =   "Albrecht Fortenbacher",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
}

@Article{Beauzamy:1993:PFS,
  author =       "Bernard Beauzamy and Vilmar Trevisan and Paul S.
                 Wang",
  title =        "Polynomial Factorization: Sharp Bounds, Efficient
                 Algorithms",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "4",
  pages =        "393--414 (or 393--413??)",
  month =        apr,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "94m:68091",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C7310 (Mathematics);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "Inst. de Calcul Math., Paris 7 Univ., France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithms; coefficient bound; efficient; integers;
                 p-adic lifting; polynomial factorisation; polynomials;
                 sharp bounds; single-factor bound; symbol manipulation;
                 univariate polynomials; weighted norm",
  treatment =    "P Practical",
}

@Article{Snyder:1993:FAG,
  author =       "Wayne Snyder",
  title =        "A Fast Algorithm for Generating Reduced Ground
                 Rewriting Systems from a Set of Ground Equations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "4",
  pages =        "415--450",
  month =        apr,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q42 (68Q25)",
  MRnumber =     "94h:68115",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. Sci., Boston Univ., MA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "closure; congruence; fast algorithm; generating
                 reduced ground rewriting systems; Knuth--Bendix
                 procedures; lexicographic path; linear space; ordering;
                 quadratic space; rewriting systems; set of ground
                 equations; theorem proving; total precedence ordering;
                 worst-case time",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Zhang:1993:EAP,
  author =       "C. N. Zhang and B. Shirazi and D. Y. Y. Yun",
  title =        "An Efficient Algorithm and Parallel Implementations
                 for Binary and Residue Number Systems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "4",
  pages =        "451--462",
  month =        apr,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "65G10 (65Y05)",
  MRnumber =     "94j:65066",
  MRreviewer =   "De Ren Wang",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C7410D (Electronic engineering)",
  corpsource =   "Dept. of Comput. Sci., Regina Univ., Sask., Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm; binary number systems; circuit CAD;
                 computation; digital signal processing; parallel
                 implementations; parallelism; residue number systems;
                 symbol manipulation; symbolic; VLSI; VLSI hardware
                 design",
  treatment =    "A Application; P Practical",
}

@Article{Bibel:1993:SIA,
  author =       "W. Bibel and A. W. Biermann",
  title =        "Special Issue: Automatic Programming --- Foreword of
                 the {Guest Editors}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "5--6",
  pages =        "463--466",
  month =        may # "--" # jun,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Feb 7 13:30:07 MST 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
}

@Article{Dershowitz:1993:DIS,
  author =       "Nachum Dershowitz and Uday S. Reddy",
  title =        "Deductive and Inductive Synthesis of Equational
                 Programs",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "5--6",
  pages =        "467--494",
  month =        may # "--" # jun,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68N17 (68N05)",
  MRnumber =     "94e:68038",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Misc/Functional.bib",
  abstract =     "An equational approach to the synthesis of functional
                 and logic programs is taken. In this context, the
                 synthesis task involves finding executable equations
                 such that the given specification holds in their
                 standard model. Hence, to synthesize such programs,
                 induction is necessary. The authors formulate
                 procedures for inductive proof, as well as for program
                 synthesis, using the framework of `ordered rewriting'.
                 They also propose heuristics for generalizing from a
                 sequence of equational consequences. These heuristics
                 handle cases where the deductive process alone is
                 inadequate for coming up with a program.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C6110L (Logic programming);
                 C4240 (Programming and algorithm theory); C1230
                 (Artificial intelligence)",
  corpsource =   "Dept. of Comput. Sci., Illinois Univ.,
                 Urbana-Champaign, IL, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "consequences; deductive synthesis; equational;
                 executable equations; functional programming;
                 heuristics; inductive synthesis; inference mechanisms;
                 logic; logic functional; logic programs; ordered
                 rewriting; program synthesis; program verification;
                 programming; programs; rewriting systems; standard",
  treatment =    "B Bibliography; P Practical",
}

@Article{Boulanger:1993:DFU,
  author =       "Dmitri Boulanger and Maurice Bruynooghe",
  title =        "Deriving Fold\slash Unfold Transformations of Logic
                 Programs Using Extended {OLDT}-Based Abstract
                 Interpretation",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "5--6",
  pages =        "495--522 (or 495--521??)",
  month =        may # "--" # jun,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q60 (03B70 68N17)",
  MRnumber =     "94j:68182",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6110L (Logic programming); C6120 (File organisation);
                 C6150C (Compilers, interpreters and other processors)",
  corpsource =   "Dept. of Comput. Sci., Katholieke Univ. Leuven,
                 Heverlee, Belgium",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "abstract data types; based abstract interpretation;
                 definite logic programs; extended OLDT-; fold/unfold
                 transformations; logic programming; logic programs;
                 program compilers; unifying framework",
  treatment =    "P Practical",
}

@Article{vanDeursen:1993:OT,
  author =       "A. {van Deursen} and P. Klint and F. Tip",
  title =        "Origin Tracking",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "5--6",
  pages =        "523--546 (or 523--545??)",
  month =        may # "--" # jun,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6115 (Programming support); C6110B (Software
                 engineering techniques); C4210 (Formal logic); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems)",
  corpsource =   "CWI, Amsterdam, Netherlands",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "abstract; error; evaluator; expressions; formal
                 language specifications; formal languages; formal
                 specification; identifiers; interactive programming
                 environments; interactive systems; language-specific
                 debuggers; origin tracking; program debugging; program
                 execution; programming environments; reports;
                 rewriting; statements; syntax tree of programs;
                 systems; term rewriting; translator; type checker",
  treatment =    "P Practical",
  xxauthor =     "A. Van Deursen and P. Klint and F. Tip",
}

@Article{Clauss:1993:SAD,
  author =       "Philippe Clauss and Catherine Mongenet",
  title =        "Synthesis Aspects in the Design of Efficient Processor
                 Arrays from Affine Recurrence Equations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "5--6",
  pages =        "547--570 (or 547--569??)",
  month =        may # "--" # jun,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68M07",
  MRnumber =     "94f:68036",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C5220P (Parallel architecture); C6150C (Compilers,
                 interpreters and other processors)",
  corpsource =   "IECS, Univ. Robert Schuman, Strasbourg, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "affine; architectures; Cholesky factorization;
                 classical; dedicated compiling; linear allocation;
                 parallel architectures; processor array; processor
                 arrays design; program compilers; recurrence equations;
                 scheduling; space-time mapping; synthesis aspects",
  treatment =    "P Practical",
}

@Article{Smith:1993:CSM,
  author =       "Douglas R. Smith",
  title =        "Constructing Specification Morphisms",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "5--6",
  pages =        "571--606",
  month =        may # "--" # jun,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q60 (68Q55 68Q65 68T20)",
  MRnumber =     "94k:68134",
  MRreviewer =   "Peter Bachmann",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6110B (Software engineering techniques); C6120 (File
                 organisation)",
  corpsource =   "Kestral Inst., Palo Alto, CA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "abstractions; algebraic specifications; axioms;
                 connection techniques; data structure design; data
                 structures; design knowledge; formal specification;
                 foundations; function symbols; KIDS program; logical;
                 sort; source; specification; specification morphisms;
                 transformation system; unskolemization",
  treatment =    "P Practical",
}

@Article{Paulin-Mohring:1993:SMP,
  author =       "Christine Paulin-Mohring and Benjamin Werner",
  title =        "Synthesis of {ML} Programs in the System {Coq}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "5--6",
  pages =        "607--640",
  month =        may # "--" # jun,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q60",
  MRnumber =     "1 237 569",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Misc/Functional.bib",
  abstract =     "The system Coq by G. Dowek et. al (1991) is an
                 environment for proof development based on the calculus
                 of constructions enhanced with inductive definitions.
                 From a constructive proof formalized in Coq, one
                 extracts a functional program which can be compiled and
                 executed in ML. This paper describes how to obtain ML
                 programs from proofs in Coq. The methods are
                 illustrated with the example of a propositional
                 tautology checkers. The authors study the specification
                 of the program, the development of the proof and the
                 extraction of the executable ML program. Part of the
                 example is the development of a normalization function
                 for IF-expressions, whose termination has been studied,
                 in several formalisms. The authors show that the total
                 program using primitive recursive functionals obtained
                 out of a structural proof of termination leads to an
                 (at first) surprisingly efficient algorithm. They also
                 explain how to introduce a fixpoint and get the usual
                 recursive program. Optimizations which are necessary in
                 order to obtain efficient programs from proofs are
                 explained. They also justify the properties of the
                 final ML program with respect to the initial
                 specification.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6110B (Software engineering techniques); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems); C4240P (Parallel programming and algorithm
                 theory)",
  corpsource =   "LIP-IMAG, ENS Lyon, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "calculus of constructions; constructive proof;
                 fixpoint; formal specification; functional; functional
                 program; functional programming; IF-expressions;
                 inductive definitions; initial specification; ML
                 programs synthesis; normalization function; program;
                 proof development; propositional; recursive program;
                 specification; structural proof; system Coq; tautology
                 checkers; termination; verification",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Takayama:1993:CCP,
  author =       "Yukihide Takayama",
  title =        "{$ {\rm QPC}_2 $}: a constructive calculus with
                 parameterized specifications",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "5--6",
  pages =        "641--672",
  month =        may # "--" # jun,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B60 (03B15 03F50 68Q60)",
  MRnumber =     "94h:03050",
  MRreviewer =   "B. H. Mayoh",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 Misc/Functional.bib",
  abstract =     "A second order constructive calculus is presented. The
                 idea is not to give a yet another system but to
                 restrict higher order calculi such as the calculus of
                 constructions (CoC) and Martin-Lof's intuitionistic
                 type theory (ITT) with the hierarchy of universes. One
                 of the aims of the restriction is to provide a program
                 synthesis system which directly generates functional
                 programs with the program constructs such as
                 if-then-else and pairing. Unlike CoC, F, and F omega,
                 we do not use Prawitz coding of logical connectives
                 because, if one uses the coding, the constructs such as
                 if-then-else and pairing are not primitives but the
                 functionals defined in higher order lambda terms.
                 Another aim of the restriction is to find a subset of
                 existing higher order systems which is necessary and
                 sufficient for parameterized specifications. The
                 obtained system, which is called QPC2, roughly
                 corresponds to a subset of ITT with the universes U1
                 and U2, but has a few differences.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C6110B
                 (Software engineering techniques)",
  corpsource =   "Dept. of Comput. Sci. and Syst. Eng., Ritsumeikan
                 Univ., Kyoto, Japan",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "calculus of; constructions; constructive calculus;
                 constructs; formal specification; functional;
                 functional programming; functional programs; higher
                 order calculi; Martin-Lof's intuitionistic type theory;
                 pairing; parameterized; program; program synthesis
                 system; QPC$_2$; specifications; type theory;
                 verification",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Omodeo:1993:DAE,
  author =       "Eugenio G. Omodeo and Franco Parlamento and Alberto
                 Policriti",
  title =        "A Derived Algorithm for Evaluating, $ \epsilon
                 $-Expressions over Abstract Sets",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "5--6",
  pages =        "673--704",
  month =        may # "--" # jun,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03E30 (03B70 68Q55)",
  MRnumber =     "95h:03118",
  MRreviewer =   "Constantin Milici",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation); C6110J (Object-oriented
                 programming)",
  corpsource =   "Rome Univ., Italy",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "abstract; abstract data types; abstract data-type;
                 checking sentences; completeness proof; constraint;
                 decision method; derived algorithm; evaluating
                 epsilon-expressions; provability; satisfiability;
                 satisfiable; sets; theorem proving; weak theories",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Chadha:1993:MDL,
  author =       "Ritu Chadha and David A. Plaisted",
  title =        "On the Mechanical Derivation of Loop Invariants",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "5--6",
  pages =        "705--744",
  month =        may # "--" # jun,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q60",
  MRnumber =     "94f:68129",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C6150G
                 (Diagnostic, testing, debugging and evaluating
                 systems); C6110B (Software engineering techniques)",
  corpsource =   "Bell Commun. Res., Morristown, NJ, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "first-order formulas; first-order language; invariant;
                 invariants; iterative algorithm; logical consequences;
                 loop; mechanical derivation; program correctness
                 proving; program verification; resolution; technique;
                 unskolemization",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Dershowitz:1993:LD,
  author =       "N. Dershowitz and Y.-L. Lee",
  title =        "Logical Debugging",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "5--6",
  pages =        "745--774 (or 745--773??)",
  month =        may # "--" # jun,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6110L (Logic programming); C6150G (Diagnostic,
                 testing, debugging and evaluating systems); C6110B
                 (Software engineering techniques)",
  corpsource =   "Dept. of Comput. Sci., Illinois Univ.,
                 Urbana-Champaign, IL, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "bug correction; deductive inference; formal
                 specification; inductive inference; inference
                 mechanisms; logic; logical debugging; program; program
                 debugging; programming; programs; reasoning;
                 specifications; synthesis",
  treatment =    "B Bibliography; P Practical",
  xxauthor =     "N. Dershowitz and Y.-J. Lee",
}

@Article{Flener:1993:LPS,
  author =       "Pierre Flener and Yves Deville",
  title =        "Logic Program Synthesis from Incomplete
                 Specifications",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "5--6",
  pages =        "775--806 (or 775--805??)",
  month =        may # "--" # jun,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q60 (68N17)",
  MRnumber =     "94i:68181",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6110L (Logic programming); C6110B (Software
                 engineering techniques); C4240 (Programming and
                 algorithm theory); C1230 (Artificial intelligence)",
  corpsource =   "Unite d'Inf., Univ. Catholique de Louvain, Belgium",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "deductive; divide-and-conquer schema; downward
                 progression; formal specification; formalisms;
                 framework; incomplete; inductive; inference mechanisms;
                 logic; logic program correctness; logic program
                 synthesis; program verification; programming;
                 specifications; stepwise synthesis; SYNAPSE; upward
                 progression",
  treatment =    "P Practical",
}

@Article{Fahmy:1993:SRT,
  author =       "Amr F. Fahmy and Alan W. Biermann",
  title =        "Synthesis of Real Time Acceptors",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "15",
  number =       "5--6",
  pages =        "807--842",
  month =        may # "--" # jun,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q60 (68T05)",
  MRnumber =     "95g:68069",
  MRreviewer =   "Alexey P. Stolboushkin",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4220 (Automata theory); C6120 (File organisation)",
  corpsource =   "Aiken Comput. Lab., Harvard Univ., Cambridge, MA,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "control structure; data structure; data structures;
                 finite sequence; finite state machines; finite subsets;
                 graphical representation; input sequence; machine;
                 real-time acceptors synthesis; state; symbols",
  treatment =    "P Practical",
}

@Article{SauxPicart:1993:SCS,
  author =       "M. Ph. {Saux Picart}",
  title =        "{Schur--Cohn} Sub-Transforms of a Polynomial",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "1",
  pages =        "1--8 (or 1--7??)",
  month =        jul,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "94e:68093",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "Dept. de Math., Univ. de Bretagne Occidentale, Brest,
                 France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "polynomial; polynomials; roots of a; Schur--Cohn
                 subtransforms of polynomial",
  treatment =    "T Theoretical or Mathematical",
  xxauthor =     "Picart M. Ph. Saux",
  xxtitle =      "{Schur Cohn} sub-transforms of a polynomial",
}

@Article{Singer:1993:GGS,
  author =       "Michael F. Singer and Felix Ulmer",
  title =        "{Galois} Groups of Second and Third Order Linear
                 Differential Equations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "1",
  pages =        "9--36",
  month =        jul,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "34A30 (12H05 20C15 34A05 68Q40)",
  MRnumber =     "94i:34015",
  MRreviewer =   "G. Eisenreich",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290P (Differential equations); B0210 (Algebra);
                 C4170 (Differential equations); C1110 (Algebra)",
  corpsource =   "Dept. of Math., North Carolina State Univ., Raleigh,
                 NC, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Galois groups; group theory; linear differential
                 equations; Liouvillian; necessary and sufficient
                 conditions; of groups; representation; solutions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Singer:1993:LAS,
  author =       "Michael F. Singer and Felix Ulmer",
  title =        "{Liouvillian} and Algebraic Solutions of Second and
                 Third Order Linear Differential Equations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "1",
  pages =        "37--74 (or 37--73??)",
  month =        jul,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "34A30 (12H05 34A05)",
  MRnumber =     "94i:34016",
  MRreviewer =   "G. Eisenreich",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290P (Differential equations); B0290F (Interpolation
                 and function approximation); C4170 (Differential
                 equations); C4130 (Interpolation and function
                 approximation)",
  corpsource =   "Dept. of Math., North Carolina State Univ., Raleigh,
                 NC, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "1-reducible subgroup; algebraic solutions;
                 differential; differential equations; Galois group;
                 linear; linear differential equations; Liouvillian
                 solutions; minimal polynomial; polynomials; Riccati
                 equation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kalkbrener:1993:LDS,
  author =       "M. Kalkbrener and M. Sweedler and L. Taylor",
  title =        "Low Degree Solutions to Linear Equations with {$ K(x)
                 $} Coefficients",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "1",
  pages =        "75--81",
  month =        jul,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P99 (68Q40)",
  MRnumber =     "94j:13023",
  MRreviewer =   "N. Popescu",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "Math. Sci. Inst., Cornell Univ., Ithaca, NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "degree bounds; equations; linear; low degree
                 polynomials; low degree solutions; polynomials",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Wang:1993:EMP,
  author =       "Dong Ming Wang",
  title =        "An Elimination Method for Polynomial Systems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "2",
  pages =        "83--114",
  month =        aug,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P99 (68Q40)",
  MRnumber =     "95b:13035",
  MRreviewer =   "Thomas Beth",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation);
                 C7310 (Mathematics)",
  corpsource =   "Res. Inst. for Symbolic Comput., Johannes Kepler
                 Univ., Linz, Austria",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "differential polynomials; elimination method;
                 multivariate polynomials; polynomial system;
                 polynomials; symbol manipulation; triangularizing",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Boyd:1993:BHFa,
  author =       "David W. Boyd",
  title =        "Bounds for the Height of a Factor of a Polynomial in
                 Terms of {Bombieri}'s Norms: {I}. The Largest Factor",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "2",
  pages =        "115--130",
  month =        aug,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11C08 (12D05 68Q40)",
  MRnumber =     "94m:11032a",
  MRreviewer =   "Maurice Mignotte",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C1110 (Algebra); C4130
                 (Interpolation and function approximation)",
  corpsource =   "Dept. of Math., British Columbia Univ., Vancouver, BC,
                 Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Bombieri's norms; complex coefficients; explicit
                 constants; factor; height bounds; irreducibility of;
                 monic polynomial; polynomial; polynomials; symbol
                 manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Boyd:1993:BHFb,
  author =       "David W. Boyd",
  title =        "Bounds for the Height of a Factor of a Polynomial in
                 Terms of {Bombieri}'s Norms: {II}. The Smallest
                 Factor",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "2",
  pages =        "131--145",
  month =        aug,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11C08 (12D05 68Q40)",
  MRnumber =     "94m:11032b",
  MRreviewer =   "Maurice Mignotte",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4130 (Interpolation and function
                 approximation)",
  corpsource =   "Dept. of Math., British Columbia Univ., Vancouver, BC,
                 Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Bombieri's norms; complex coefficients; explicit
                 constants; factor; height bounds; polynomial;
                 polynomials; smallest factor; symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Andrews:1993:SQC,
  author =       "G. E. Andrews and P. Paule",
  title =        "Some Questions Concerning Computer-Generated Proofs of
                 a Binomial Double-Sum Identity",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "2",
  pages =        "147--154 (or 147--153??)",
  month =        aug,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4210 (Formal logic)",
  corpsource =   "Dept. of Math., Pennsylvania State Univ., University
                 Park, PA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "binomial double-sum identity; computer-assisted
                 treatment; computer-generated proofs; double-sum
                 identity; symbol manipulation; theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Schorn:1993:AAR,
  author =       "Peter Schorn",
  title =        "An Axiomatic Approach to Robust Geometric Programs",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "2",
  pages =        "155--166 (or 155--165??)",
  month =        aug,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68U07",
  MRnumber =     "94k:68196",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4260 (Computational geometry); C1180 (Optimisation
                 techniques)",
  corpsource =   "Inst. fur Theor. Inf., Eidgenossische Tech.
                 Hochschule, Zurich, Switzerland",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "axiomatic approach; computational geometry; digital
                 arithmetic; floating point arithmetic; geometric;
                 imprecise primitives; non-trivial; plane sweep
                 algorithm; primitives; programming; robust geometric
                 programs",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Madlener:1993:PGS,
  author =       "Klaus Madlener and Andrea Sattler-Klein and Friedrich
                 Otto",
  title =        "On the Problem of Generating Small Convergent
                 Systems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "2",
  pages =        "167--188 (or 167--187??)",
  month =        aug,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q42 (68Q40)",
  MRnumber =     "95j:68079",
  MRreviewer =   "Peter R. J. Asveld",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Fachbereich Inf., Kaiserslautern Univ., Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Bendix completion; decidability; finite alphabet;
                 finite convergent; fixed; intermediate rules; Knuth-;
                 length-lexicographical ordering; rewriting systems;
                 small convergent systems; string-rewriting systems;
                 system",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Torgersen:1993:PSR,
  author =       "T. Torgersen",
  title =        "Parallel Scheduling of Recursively Defined Arrays:
                 Revisited",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "2",
  pages =        "189--226",
  month =        aug,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240P (Parallel programming and algorithm theory);
                 C7310 (Mathematics)",
  corpsource =   "Wake Forest Univ., Winston-Salem, NC, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithmic; convex polyhedron; equation; feasible
                 schedules; hyperplane; hyperplane scheduling; method;
                 parallel algorithms; parallel scheduling; program
                 specification; recurrence; recursive; recursively
                 defined arrays; relations; scheduling; scheduling
                 constraints; symbol manipulation; symbolic computing;
                 symbolic linear inequalities; symbolic scheduling
                 constraints; wavefront method",
  treatment =    "B Bibliography; T Theoretical or Mathematical",
}

@Article{Knowles:1993:ICT,
  author =       "Paul H. Knowles",
  title =        "Integration of a Class of Transcendental {Liouvillian}
                 Functions with Error-Functions, Part {II}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "3",
  pages =        "227--242 (or 227--241??)",
  month =        sep,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "95e:68101",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290M (Numerical integration and differentiation);
                 B0290B (Error analysis in numerical methods); C4160
                 (Numerical integration and differentiation); C4110
                 (Error analysis in numerical methods)",
  corpsource =   "D. Youville Coll., Buffalo, NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "decision procedure; elementary; error analysis;
                 error-functions; functions; integrands; integration;
                 symbol manipulation; symbolic integration;
                 transcendental Liouvillian functions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lisonek:1993:IDS,
  author =       "Petr Lison{\v{e}}k and Peter Paule and Volker Strehl",
  title =        "Improvement of the Degree Setting in {Gosper}'s
                 Algorithm",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "3",
  pages =        "243--258",
  month =        sep,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "95b:68062",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory)",
  corpsource =   "Res. Inst. for Symbolic Comput., Johannes Kepler
                 Univ., Linz, Austria",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm theory; degree setting; Gosper's algorithm;
                 hypergeometric input; hypergeometric summation;
                 indefinite; proper; rational input; symbol
                 manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Rieger:1993:CVG,
  author =       "J. H. Rieger",
  title =        "Computing View Graphs of Algebraic Surfaces",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "3",
  pages =        "259--272",
  month =        sep,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "14Q10 (14J99 68Q40)",
  MRnumber =     "95b:14041",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0250 (Combinatorial mathematics); C4260
                 (Computational geometry); C1160 (Combinatorial
                 mathematics)",
  corpsource =   "Fachbereich Inf., Hamburg Univ., Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic surface; bifurcation; bifurcation set;
                 centres of projection; computational geometry;
                 degenerate projections; differential geometry; graph
                 theory; positive codimension; rational coefficients;
                 smooth; surface; symbol manipulation; view graph",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Reeves:1993:NPR,
  author =       "Alyson Reeves and Bernd Sturmfels",
  title =        "A Note on Polynomial Reduction",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "3",
  pages =        "273--278 (or 273--277??)",
  month =        sep,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P10 (68Q40)",
  MRnumber =     "94k:13034",
  MRreviewer =   "Joachim Apel",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0210 (Algebra); B0250 (Combinatorial mathematics);
                 C1110 (Algebra); C1160 (Combinatorial mathematics)",
  corpsource =   "Dept. of Math., Brandeis Univ., Waltham, MA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "polynomials; set theory; symbol manipulation;
                 polynomial reduction; reduction relation; Noetherian
                 modulo; admissible term order; Gr{\"o}bner bases",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Freese:1993:TRS,
  author =       "Ralph Freese and J. Je{\v{z}}ek and J. B. Nation",
  title =        "Term Rewrite Systems for Lattice Theory",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "3",
  pages =        "279--288",
  month =        sep,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q42 (03C05 06-04)",
  MRnumber =     "95f:68118",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Dept. of Math., Hawaii Univ., Honolulu, HI, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "decidable; equational theory; free lattices; lattice
                 theory; natural normal form; rewriting systems; term
                 rewrite system",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hentzel:1993:EI,
  author =       "Irvin Roy Hentzel and David P. Jacobs and Sekhar V.
                 Muddana",
  title =        "Experimenting with the Identity $ (x y)z = y(z x) $",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "3",
  pages =        "289--294 (or 289--293??)",
  month =        sep,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20L05 (68Q40)",
  MRnumber =     "94i:20101",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "See errata \cite{Hentzel:1994:EEI}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C7310 (Mathematics)",
  corpsource =   "Dept. of Math., Iowa State Univ., Ames, IA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Albert; algebra; associative; commutative; group
                 theory; groupoid; identity; nonassociative algebra
                 program; ring; semiprime; symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gaal:1993:R,
  author =       "Istv{\'a}n Ga{\'a}l",
  title =        "On the Resolution of $ {F}(x, y) = {G}(x, y) $",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "3",
  pages =        "295--304 (or 295--303??)",
  month =        sep,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "94k:68096",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C1110 (Algebra); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Maths. Inst., Kossuth Lajos Univ., Debrecen, Hungary",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational complexity; fast algorithm; homogeneous;
                 inequality; polynomials; symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{OBrien:1993:ITG,
  author =       "E. A. O'Brien",
  title =        "Isomorphism Testing for $p$-Groups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "3",
  pages =        "305--320",
  month =        sep,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20D15 (20D45 20F28)",
  MRnumber =     "95f:20040a",
  MRreviewer =   "Richard Davitt",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C1110
                 (Algebra)",
  corpsource =   "Dept. of Appl. Math., Australian Nat. Univ., Canberra,
                 ACT, Australia",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm theory; automorphism group; canonical
                 presentation; finite p-groups; group theory; isomorphic
                 groups; p-groups",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gaal:1993:FAF,
  author =       "Istv{\'a}n Ga{\'a}l",
  title =        "A Fast Algorithm for Finding ``Small'' Solutions of {$
                 F(x, y) = G(x, y) $} over Imaginary Quadratic Fields",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "4",
  pages =        "321--328",
  month =        oct,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11Y50 (11D41 68Q40)",
  MRnumber =     "95a:11111",
  MRreviewer =   "B. M. M. de Weger",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Math. Inst., Kossuth Lajos Univ., Debrecen, Hungary",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational complexity; fast algorithm; homogeneous;
                 imaginary quadratic fields; irreducible; LLL basis
                 reduction algorithm; number theory; positive integer;
                 reduction methods; square-free; symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Faugere:1993:ECZ,
  author =       "J. C. Faugere and P. Gianni and D. Lazard and T.
                 Mora",
  title =        "{Efficient Computation of Zero-Dimensional Gr{\"o}bner
                 Bases by Change of Ordering}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "4",
  pages =        "329--344",
  month =        oct,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "94k:68095",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "LITP, Paris VI Univ., France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational complexity; symbol manipulation;
                 zero-dimensional Gr{\"o}bner bases; change of ordering;
                 lexicographical Gr{\"o}bner basis; zero-dimensional
                 ideal; efficient algorithm",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Vaughan-Lee:1993:ACG,
  author =       "Michael Vaughan-Lee",
  title =        "An Algorithm for Computing Graded Algebras",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "4",
  pages =        "345--354",
  month =        oct,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "16S15 (68Q40)",
  MRnumber =     "94k:16043",
  MRreviewer =   "E. Formanek",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C1110 (Algebra)",
  corpsource =   "Christ Church, Oxford Univ., UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; algorithm; associative algebras; finite
                 dimensional graded algebras; graded algebras; symbol
                 manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Man:1993:CCFa,
  author =       "Yiu-Kwong Man",
  title =        "On Computing Closed Forms for Indefinite Summations",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "4",
  pages =        "355--376",
  month =        oct,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "39A10 (33C05 39A99 68Q40)",
  MRnumber =     "95k:39006",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "Sch. of Math. Sci., Queen Mary and Westfield Coll.,
                 London, UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "closed forms computing; degree bounds; functions;
                 Gosper's algorithm; indefinite summations; polynomials;
                 quasipolynomials; quasirational; rational functions",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Boyd:1993:CLS,
  author =       "John P. Boyd",
  title =        "{Chebyshev} and {Legendre} Spectral Methods in
                 Algebraic Manipulation Languages",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "4",
  pages =        "377--399",
  month =        oct,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (65M60)",
  MRnumber =     "94k:68094",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 C7310 (Mathematics); C4130 (Interpolation and function
                 approximation); C6130 (Data handling techniques)",
  classification = "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation); C6130
                 (Data handling techniques); C7310 (Mathematics)",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic manipulation languages; Algebraic
                 manipulation languages; bifurcations; Bifurcations;
                 Chebyshev; Chebyshev approximation; Chebyshev
                 polynomials; collocation methods; Collocation methods;
                 eigenproblem; Eigenproblem; eigenvalues and
                 eigenfunctions; Fourier series; Galerkin methods;
                 Legendre spectral methods; Maple; mathematics
                 computing; nonlinear diffusion; Nonlinear diffusion;
                 polynomial; Polynomial; polynomials; REDUCE; series
                 (mathematics); symbol manipulation; trigonometric
                 manipulations; Trigonometric manipulations",
  thesaurus =    "Chebyshev approximation; Eigenvalues and
                 eigenfunctions; Mathematics computing; Polynomials;
                 Series [mathematics]; Symbol manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Niederreiter:1993:FPF,
  author =       "Harald Niederreiter and Rainer G{\"o}ttfert",
  title =        "Factorization of Polynomials over Finite Fields and
                 Characteristic Sequences",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "5",
  pages =        "401--412",
  month =        nov,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "95d:68072",
  MRreviewer =   "Ralph W. Wilkerson",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation); C7310
                 (Mathematics)",
  corpsource =   "Inst. for Inf. Phys., Austrian Acad. of Sci., Vienna,
                 Austria",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "arbitrary finite fields; characteristic sequences;
                 classical Berlekamp algorithm; factorization algorithm;
                 finite fields; linear; linearization step; polynomials;
                 recurring sequences; symbol manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Butler:1993:TGD,
  author =       "Greg Butler",
  title =        "The Transitive Groups of Degree Fourteen and Fifteen",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "5",
  pages =        "413--422",
  month =        nov,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20B35 (20B40 68Q40)",
  MRnumber =     "95e:20006",
  MRreviewer =   "Gerhard Hiss",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C7310
                 (Mathematics)",
  corpsource =   "Dept. of Comput. Sci., Concordia Univ., Montreal,
                 Que., Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "degree fifteen; degree fourteen; symbol manipulation;
                 symmetric group; transitive groups",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Man:1993:CCFb,
  author =       "Yiu-Kwong Man",
  title =        "Computing Closed Form Solutions of First Order {ODEs}
                 Using the {Prelle--Singer} Procedure",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "5",
  pages =        "423--444 (or 423--443??)",
  month =        nov,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "34-04 (34A05 68Q40)",
  MRnumber =     "94m:34002",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Sch. of Math. Sci., Queen Mary and Westfield Coll.,
                 London, UK",
  classcodes =   "C7310 (Mathematics); C4170 (Differential equations)",
  classification = "C4170 (Differential equations); C7310
                 (Mathematics)",
  corpsource =   "Sch. of Math. Sci., Queen Mary and Westfield Coll.,
                 London, UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "closed form solutions; Closed form solutions;
                 differential equations; first order ODEs; First order
                 ODEs; MACSYMA implementation; manipulation; mathematics
                 computing; ODEFI; ODESOLVE; Prelle--Singer;
                 Prelle--Singer procedure; procedure; PSODE; PSODE
                 versions 1; PSODE versions 2; REDUCE implementations;
                 symbol; timings; Timings; versions 2",
  thesaurus =    "Differential equations; Mathematics computing; Symbol
                 manipulation",
  treatment =    "P Practical",
}

@Article{Baumgartner:1993:CFC,
  author =       "Peter Baumgartner and Ulrich Furbach",
  title =        "Consolution as a Framework for Comparing Calculi",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "5",
  pages =        "445--477",
  month =        nov,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B35 (03B10 03F20 68T15)",
  MRnumber =     "95h:03023",
  MRreviewer =   "Henry Africk",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C6130 (Data handling
                 techniques); C7310 (Mathematics)",
  corpsource =   "Koblenz Univ., Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "connection method; consolution calculus; elimination;
                 first-order proof calculi; Loveland's model
                 elimination; nearly stepwise simulation; resolution;
                 symbol manipulation; tableaux model; theorem proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Berarducci:1993:GU,
  author =       "Alessandro Berarducci and Marisa Venturini Zilli",
  title =        "Generalizations of Unification",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "5",
  pages =        "478--492 (or 479--491??)",
  month =        nov,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35 68Q40)",
  MRnumber =     "95e:68190",
  MRreviewer =   "Sauro Tulipani",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C6110L (Logic programming)",
  corpsource =   "Dipartimento di Matematica, Pisa Univ., Italy",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "classification; decidability; finite terms; functional
                 programming; logic programming; matching; unification;
                 weak-unification",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Contejean:1993:SPM,
  author =       "Evelyne Contejean",
  title =        "Solving $ *$-problems modulo distributivity by a
                 reduction to {$ {\rm AC}1$}-unification",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "5",
  pages =        "493--521",
  month =        nov,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B35 (03B25 03C05 03D35 68T15)",
  MRnumber =     "95e:03039",
  MRreviewer =   "Sauro Tulipani",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C6130 (Data handling
                 techniques); C7310 (Mathematics)",
  corpsource =   "Lab. de Recherche en Inf., CNRS, Orsay, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "AC1-unification; distributivity; formal logic; general
                 infinitely many; minimal solutions; symbol
                 manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Rosenmann:1993:ACG,
  author =       "Amnon Rosenmann",
  title =        "An Algorithm for Constructing {Gr{\"o}bner} and Free
                 {Schreier} Bases in Free Group Algebras",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "6",
  pages =        "523--550 (or 523--549??)",
  month =        dec,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "95e:68104",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4130 (Interpolation and function
                 approximation); C6130 (Data handling techniques)",
  corpsource =   "Inst. for Experimental Math., Univ. GH Essen,
                 Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "mathematics computing; polynomials; symbol
                 manipulation; Gr{\"o}bner basis; free Schreier bases;
                 free group algebras; finitely generated one-sided
                 ideals; free generators; Buchberger's algorithm;
                 maximal degree; polynomials; generalised membership
                 problem; Nielsen-Hall algorithm",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{vandenEssen:1993:ACI,
  author =       "Arno {van den Essen}",
  title =        "An algorithm to compute the invariant ring of a {$
                 {\bf G}_a $}-action on an affine variety",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "6",
  pages =        "551--556 (or 551--555??)",
  month =        dec,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "14L30 (13A50 13B10)",
  MRnumber =     "95c:14064",
  MRreviewer =   "Martha K. Smith",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling
                 techniques)",
  corpsource =   "Dept. of Math., Catholic Univ., Nijmegen,
                 Netherlands",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "symbol manipulation; invariant ring; $G_a$-action;
                 affine variety; locally; nilpotent derivation;
                 Gr{\"o}bner bases",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Jacobs:1993:WPF,
  author =       "David P. Jacobs and Sekhar V. Muddana",
  title =        "The Word Problem for Free Partially Commutative,
                 Partially Associative Groupoids",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "6",
  pages =        "557--562",
  month =        dec,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q25 (03D40)",
  MRnumber =     "95e:68091",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. Sci., Clemson Univ., SC, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "associative groupoids; formal logic; free partially
                 commutative; groups; linear-time algorithm; monoids;
                 partially; rewriting systems; word problem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gaal:1993:RIF,
  author =       "Istv{\'a}n Ga{\'a}l and Attila Peth{\"o} and Michael
                 Pohst",
  title =        "On the Resolution of Index Form Equations in Quartic
                 Number Fields",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "6",
  pages =        "563--584",
  month =        dec,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11Y40 (11R16 68Q40)",
  MRnumber =     "95f:11109",
  MRreviewer =   "A. K. Lenstra",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C1160 (Combinatorial
                 mathematics)",
  corpsource =   "Kossuth Lajos Univ., Math. Inst., Debrecen, Hungary",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "binary cubic form; cubic equation; Galois group; index
                 form equations; number theory; quartic number fields;
                 resolution; ternary logic; ternary quadratic forms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gao:1993:ZST,
  author =       "Xiao Shan Gao and Shang-Ching Chou",
  title =        "A Zero Structure Theorem for Differential Parametric
                 Systems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "6",
  pages =        "585--596 (or 585--595??)",
  month =        dec,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12H05 (68Q40)",
  MRnumber =     "96d:12008",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "Dept. of Comput. Sci., Wichita State Univ., KS, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "differential parametric systems; differential
                 polynomials; polynomials; quantifier elimination; zero
                 structure theorem",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Boudet:1993:CUA,
  author =       "Alexandre Boudet",
  title =        "Combining Unification Algorithms",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "16",
  number =       "6",
  pages =        "597--626",
  month =        dec,
  year =         "1993",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35 03C05)",
  MRnumber =     "95i:68114",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C6110L (Logic programming)",
  corpsource =   "Univ. Paris-Sud, Orsay, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm; arbitrary theories; disjoint sets;
                 function; logic programming; nondeterministic
                 branching; rewrite systems; rewriting systems; symbols;
                 transformation rules; unification algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Middeldorp:1994:CCC,
  author =       "Aart Middeldorp",
  title =        "Completeness of Combinations of Conditional
                 Constructor Systems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "1",
  pages =        "3--21",
  month =        jan,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q42",
  MRnumber =     "95g:68059",
  MRreviewer =   "Klaus Madlener",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Conditional term rewriting systems
                 (Pont-{\`a}-Mousson, 1992).",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Inst. of Inf. Sci. and Electron., Tsukuba Univ.,
                 Japan",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "completeness; conditional constructor systems;
                 confluence; conquer technique; divide and; rewrite
                 rules; rewriting systems; semicompleteness; Special
                 Issue on Conditional Term Rewriting Systems; strong
                 normalisation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Zantema:1994:TTR,
  author =       "H. Zantema",
  title =        "Termination of term rewriting: interpretation and type
                 elimination",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "1",
  pages =        "23--50",
  month =        jan,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q42 (03D35)",
  MRnumber =     "95h:68105",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Conditional term rewriting systems
                 (Pont-{\`a}-Mousson, 1992).",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. Sci., Utrecht Univ., Netherlands",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "collapsing rules; direct sum; duplicating rules;
                 elimination; interpretation; interpretations; lambda
                 calculus; modularity; polynomial; program verification;
                 programming theory; rewriting systems; semantic level;
                 Special Issue on Conditional Term Rewriting Systems;
                 term rewriting; termination; type; undecidability
                 proofs; well-founded monotone algebra",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wirth:1994:CBA,
  author =       "Claus-Peter Wirth and Bernhard Gramlich",
  title =        "A Constructor-Based Approach to Positive\slash
                 Negative-Conditional Equational Specifications",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "1",
  pages =        "51--90",
  month =        jan,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q65 (68Q42)",
  MRnumber =     "96b:68124",
  MRreviewer =   "David B. Benson",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Conditional term rewriting systems
                 (Pont-{\`a}-Mousson, 1992).",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Fachbereich Inf., Kaiserslautern Univ., Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic specifications; conditional rewrite systems;
                 constructor-based approach; decidability; equational
                 specifications; factor algebra; finite; Horn clauses;
                 Horn-form; minimum model; positive-;
                 positive/negative-conditional; reducibility; reduction
                 relation; rewriting systems; sets; Special Issue on
                 Conditional Term Rewriting Systems; term algebra;
                 universally quantified first-order implications",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Hofbauer:1994:LTR,
  author =       "Dieter Hofbauer and Maria Huber",
  title =        "Linearizing Term Rewriting Systems Using Test Sets",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "1",
  pages =        "91--129",
  month =        jan,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q42",
  MRnumber =     "95h:68098",
  MRreviewer =   "Albrecht Fortenbacher",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Conditional term rewriting systems
                 (Pont-{\`a}-Mousson, 1992).",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "Tech. Univ. Berlin, Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "decidability; ground terms; irreducible; regular tree
                 language; rewriting systems; Special Issue on
                 Conditional Term Rewriting Systems; term rewriting
                 systems linearisation; test sets",
  treatment =    "T Theoretical or Mathematical",
}

@Article{OBrien:1994:ITG,
  author =       "E. A. O'Brien",
  title =        "Isomorphism Testing for $p$-Groups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "2",
  pages =        "133--148 (or 133--147??)",
  month =        feb,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "131",
  MRnumber =     "95f:20040b",
  MRreviewer =   "Richard Davitt",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C7310
                 (Mathematics)",
  corpsource =   "Centre for Math. and its Applications, Sch. of Math.
                 Sci., Australian Nat. Univ., Canberra, ACT, Australia",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "automorphism group; canonical presentation;
                 isomorphism testing; p-groups; symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Froberg:1994:HSI,
  author =       "Ralf Fr{\"o}berg and Joachim Hollman",
  title =        "{Hilbert} Series for Ideals Generated by Generic
                 Forms",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "2",
  pages =        "149--158 (or 149--157??)",
  month =        feb,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13D40 (13P10 68Q40)",
  MRnumber =     "95h:13015",
  MRreviewer =   "J. K. Verma",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4130 (Interpolation and function
                 approximation); C4210 (Formal logic)",
  corpsource =   "Dept. of Math., Stockholm Univ., Sweden",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computer calculations; generic forms; Hilbert series;
                 ideals; mathematics; mathematics computing; polynomial
                 ring; polynomials; symbol manipulation; theorem
                 proving",
  treatment =    "A Application; P Practical; T Theoretical or
                 Mathematical",
}

@Article{Brown:1994:CSC,
  author =       "Ronald Brown and Andrew Tonks",
  title =        "Calculations with Simplicial and Cubical Groups in
                 {AXIOM}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "2",
  pages =        "159--180 (or 159--179??)",
  month =        feb,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20-04 (68Q40)",
  MRnumber =     "1 283 741",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling
                 techniques)",
  corpsource =   "Sch. of Math., Univ. of Wales, Bangor, UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "AXIOM; cubical groups; mathematics computing; monoids;
                 nonabelian calculations; simplicial groups; software;
                 symbol manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kean:1994:COI,
  author =       "Alex Kean and George Tsiknis",
  title =        "A corrigendum for the {optimized-IPIA}: {{``An
                 incremental method for generating prime
                 implicants\slash implicates''} [J. Symbolic Comput.
                 {\bf 9} (1990), no. 2, 185--206, MR 91h:68071]}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "2",
  pages =        "181--188 (or 181--187??)",
  month =        feb,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q20 (03B35 68T20 94C10)",
  MRnumber =     "95f:68089",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "See \cite{Kean:1990:IMG}.",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling techniques);
                 C1180 (Optimisation techniques)",
  corpsource =   "Dept. of Comput. Sci., Hong Kong Univ. of Sci. and
                 Technol., Kowloon, Hong Kong",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "implicates; incremental algorithm; mathematics
                 computing; optimisation; optimizations; prime
                 implicants; symbol manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Zhang:1994:NMB,
  author =       "Hantao Zhang",
  title =        "A New Method for the {Boolean} Ring Based Theorem
                 Proving",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "2",
  pages =        "189--212 (or 189--211??)",
  month =        feb,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T15 (03B35)",
  MRnumber =     "95d:68124",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C4130 (Interpolation and
                 function approximation)",
  corpsource =   "Dept. of Comput. Sci., Iowa Univ., Iowa City, IA,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Boolean algebra; Boolean ring based theorem proving;
                 clauses; inferences; monomials; N-rule; N-Strategy;
                 polynomials; semantic trees; superposition; theorem
                 proving",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Hentzel:1994:EEI,
  author =       "I. R. Hentzel and D. P. Jacobs and S. V. Muddana",
  title =        "Erratum: {``Experimenting with the identity $ (x y)z =
                 y(z x) $'' [J. Symbolic Comput. {\bf 16} (1993), no. 3,
                 289--293, MR 94i:20101]}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "2",
  pages =        "213--213",
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20L05 (68Q40)",
  MRnumber =     "1 283 744",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "See \cite{Hentzel:1993:EI}.",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
}

@Article{Eiter:1994:ETH,
  author =       "Thomas Eiter",
  title =        "Exact transversal hypergraphs and application to
                 {Boolean} $ \mu $-functions",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "3",
  pages =        "215--226 (or 215--225??)",
  month =        mar,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q25 (05C65 06E30)",
  MRnumber =     "95f:68104",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C4130 (Interpolation and
                 function approximation); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Inf. Syst. Dept., Tech. Univ., Vienna, Austria",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Boolean functions; Boolean mu -functions; co-NP-hard;
                 computational complexity; delays; exact transversal
                 hypergraphs; finite; independent sets; lexicographic
                 order; maximal; minimal transversals; monotone Boolean
                 expression; polynomial delay; polynomial time;
                 polynomials; vertex set",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Salvy:1994:FCS,
  author =       "Bruno Salvy",
  title =        "Fast Computation of Some Asymptotic Functional
                 Inverses",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "3",
  pages =        "227--236",
  month =        mar,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11Y35 (68Q40)",
  MRnumber =     "95e:11135",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "Projet Algorithmes, INRIA Rocquencourt, Le Chesnay,
                 France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "asymptotic functional inverses; fast computation;
                 one-variable formal power series; polynomials; series
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Davis:1994:ICF,
  author =       "Richard A. Davis",
  title =        "Idempotent Computation over Finite Fields",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "3",
  pages =        "237--258",
  month =        mar,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (13P99)",
  MRnumber =     "95e:68098",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "Nat. Security Agency, Ft. Meade, MD, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "commutative artinian algebra; counts; dimensional
                 quotient; finite; finite fields; idempotent
                 computation; idempotents; operation; polynomial ring;
                 polynomials; primitive; pseudocode",
  treatment =    "T Theoretical or Mathematical",
  xxauthor =     "R. A. Davies",
}

@Article{Dehon:1994:CGC,
  author =       "Michel Dehon",
  title =        "Classifying Geometries with {Cayley}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "3",
  pages =        "259--276",
  month =        mar,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "51E24 (51-04)",
  MRnumber =     "95f:51007",
  MRreviewer =   "Gernot Stroth",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 http://www.math.utah.edu/pub/tex/bib/magma.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4260 (Computational geometry)",
  corpsource =   "Dept. de Math., Univ. Libre de Bruxelles, Belgium",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational geometry; geometrical objects;
                 geometries classification; group; Hall-Janko",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Mignotte:1994:SDP,
  author =       "Maurice Mignotte and Philippe Glesser",
  title =        "On the Smallest Divisor of a Polynomial",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "3",
  pages =        "277--282",
  month =        mar,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12D05",
  MRnumber =     "95e:12001",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "Dept. de Math., Univ. Louis Pasteur, Strasbourg,
                 France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithms of; factorization; integer coefficients;
                 integer polynomials; polynomial; polynomials; reducible
                 univariate; smallest divisor",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gusynin:1994:SCD,
  author =       "V. P. Gusynin and V. V. Kornyak",
  title =        "Symbolic Computation of {DeWitt-Seeley-Gilkey}
                 Coefficients on Curved Manifolds",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "3",
  pages =        "283--294",
  month =        mar,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "58G11 (58-04 58G18 58G25 68Q40)",
  MRnumber =     "95j:58165",
  MRreviewer =   "Friedbert Pr{\"u}fer",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling
                 techniques)",
  corpsource =   "Inst. for Theor. Phys., Kiev, Ukraine",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic manipulation; C language; covariant
                 pseudodifferential calculus; curved manifolds;
                 DeWitt-Seeley-Gilkey coefficients; manipulations;
                 program package; symbol manipulation; symbolic
                 computation; tensor; torsion",
  treatment =    "P Practical",
}

@Article{Mehlhorn:1994:SIA,
  author =       "K. Mehlhorn and S. N{\"a}her and Nievergelt J.",
  title =        "Special Issue on Algorithms: Implementation, Libraries
                 and Use---Introduction of the {Guest Editors}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "4",
  pages =        "295",
  month =        apr,
  year =         "1994",
  bibdate =      "Wed Feb 22 07:40:30 2012",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Editors' Introduction to the Special Issue on
                 Algorithms: Implementation, Libraries and Use",
}

@Article{Nievergelt:1994:CAP,
  author =       "J. Nievergelt",
  title =        "Complexity, Algorithms, Programs, Systems: The
                 Shifting Focus",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "4",
  pages =        "297--310",
  month =        apr,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C0200 (General computer topics); C4240 (Programming
                 and algorithm theory); C6110 (Systems analysis and
                 programming); C6115 (Programming support)",
  corpsource =   "Dept. of Comput. Sci., ETH Zurich, Switzerland",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm theory; algorithms; application packages;
                 complexity; computational complexity; computer users;
                 programming; programs; software systems; software
                 tools; Special Issue on Algorithms: Implementation,
                 Libraries and Use; system development; systems; systems
                 analysis; technology; technology transfer problem;
                 theory; tools; transfer; usable",
  treatment =    "G General Review; P Practical",
}

@Article{Schorn:1994:ESS,
  author =       "P. Schorn",
  title =        "Evolution of a Software System: Interaction,
                 Interfaces and Applications in the {XYZ} {GeoBench}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "4",
  pages =        "311--320",
  month =        apr,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C4260 (Computational geometry);
                 C6180 (User interfaces); C6115 (Programming support)",
  corpsource =   "Inst. fur Theor. Inf., ETH Zurich, Switzerland",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational geometry; computing; eXperimental
                 GeometrY; geometric computation; interactive systems;
                 interactive usability; interfaces; mathematics;
                 random-data generation; software; software tools;
                 Special Issue on Algorithms: Implementation, Libraries
                 and Use; system; test-data-generation; user interfaces;
                 XYZ GeoBench; Zurich",
  treatment =    "A Application; P Practical",
}

@Article{Weber:1994:APP,
  author =       "G. Weber and L. Knipping and H. Alt",
  title =        "An Application of Point Pattern Matching in
                 Astronautics",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "4",
  pages =        "321--340",
  month =        apr,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7350 (Astronomy and astrophysics); C1250 (Pattern
                 recognition); C4260 (Computational geometry)",
  corpsource =   "Inst. fur Inf., Freie Univ., Berlin, Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "astronautics; astronomy computing; computational
                 geometry; constellations; incremental Delaunay
                 triangulation; pattern; point pattern matching;
                 recognition; satellite attitude determination; Special
                 Issue on Algorithms: Implementation, Libraries and Use;
                 star field sensors",
  treatment =    "A Application; P Practical",
}

@Article{Raymond:1994:GCL,
  author =       "D. Raymond and D. Wood",
  title =        "{Grail}: {A C++} Library for Automata and
                 Expressions",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "4",
  pages =        "341--350",
  month =        apr,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  bibdate =      "Wed Mar 19 13:51:24 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling techniques);
                 C4220 (Automata theory); C6140D (High level
                 languages)",
  corpsource =   "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "C language; C++ library; expressions; finite automata;
                 finite-state automata; Grail; language enumeration;
                 mathematics computing; minimization; packages;
                 software; Special Issue on Algorithms: Implementation,
                 Libraries and Use; subset construction; symbol
                 manipulation; symbolic manipulation",
  treatment =    "A Application; P Practical",
}

@Article{Welzl:1994:SRB,
  author =       "Emo Welzl and Barbara Wolfers",
  title =        "Surface Reconstruction between Simple Polygons via
                 Angle Criteria",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "4",
  pages =        "351--369",
  month =        apr,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68U05",
  MRnumber =     "95f:68248",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  note =         "Algorithms: implementation, libraries and use (Schloss
                 Dagstuhl, 1993).",
  acknowledgement = ack-nhfb,
  classcodes =   "C4260 (Computational geometry); C1250 (Pattern
                 recognition); C5260B (Computer vision and picture
                 processing)",
  corpsource =   "Inst. fur Inf., Freie Univ. Berlin, Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "angle consistency; angle criteria; computational
                 geometry; convex hull; image reconstruction; optimally
                 criterion; parallel planes; polyhedral surface; simple
                 polygons; Special Issue on Algorithms: Implementation,
                 Libraries and Use; surface reconstruction",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxauthor =     "E. Welzi and B. Wolfers",
}

@Article{Shoup:1994:FCI,
  author =       "Victor Shoup",
  title =        "Fast Construction of Irreducible Polynomials over
                 Finite Fields",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "5",
  pages =        "371--391",
  month =        may,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11T06 (11Y16 68Q40)",
  MRnumber =     "95k:11156",
  MRreviewer =   "Joachim {von zur Gathen}",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "Univ. des Saarlandes, Saarbrucken, Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "finite fields; irreducible polynomials; polynomials",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Larsen:1994:ICF,
  author =       "Kim S. Larsen and Michael I. Schwartzbach",
  title =        "Injectivity of Composite Functions",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "5",
  pages =        "393--408",
  month =        may,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68N05 (68Q20)",
  MRnumber =     "95d:68013",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C4240 (Programming and algorithm
                 theory)",
  corpsource =   "Dept. of Comput. Sci., Aarhus Univ., Denmark",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "completeness; composite functions; compositions; Horn
                 clauses; injectivity; program verification; proof of
                 correctness; propositional Horn clause axioms;
                 soundness",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lucchini:1994:CSG,
  author =       "Andrea Lucchini and Federico Menegazzo",
  title =        "Computing a Set of Generators of Minimal Cardinality
                 in a Solvable Group",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "5",
  pages =        "409--420",
  month =        may,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20D10 (20-04 68Q40)",
  MRnumber =     "95e:20030",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib;
                 http://www.math.utah.edu/pub/tex/bib/magma.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics); C6130 (Data handling
                 techniques)",
  corpsource =   "Dipartimento di Matematica Pura e Applicata, Padova
                 Univ., Italy",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "CAYLEY V.3.7.2; chief series; minimal cardinality;
                 polycyclic presentation; procedures; set of generators;
                 solvable group; symbol manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Backofen:1994:RPE,
  author =       "Rolf Backofen",
  title =        "Regular Path Expressions in Feature Logic",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "5",
  pages =        "421--455",
  month =        may,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T30 (68S05 68T20 68T27)",
  MRnumber =     "95i:68128",
  MRreviewer =   "P. {\v{S}}t{\v{e}}p{\'a}nek",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  corpsource =   "DFKI, Saarbrucken, Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational linguistics; decidability; decidable;
                 existential fragment; expressions; feature logic;
                 formal languages; formal logic; functional uncertainty;
                 quasi-terminating rule system; regular language;
                 regular path; satisfiability; subterm relation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Herbert:1994:SLR,
  author =       "D. J. Herbert",
  title =        "Symbolic Local Refinement of Tetrahedral Grids",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "5",
  pages =        "457--472",
  month =        may,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (65Y25)",
  MRnumber =     "95e:68100",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4260 (Computational geometry); C6120 (File
                 organisation); C6130 (Data handling techniques); C7310
                 (Mathematics)",
  corpsource =   "Dept. of Math. and Stat., Pittsburgh Univ., PA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "3-dimensional case; addressing scheme; computational
                 geometry; face-compatible refinement; geometric
                 information; grids; implementation; local grid
                 refinement algorithm; logical operations; manipulation;
                 mesh generation; neighbors; physically nearest;
                 refinement tree; simplex; splitting; symbol; symbolic;
                 symbolic local refinement; tetrahedral; tree data
                 structures; vertices location",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxauthor =     "D. J. Hebert",
}

@Article{Shallit:1994:ALS,
  author =       "Jeffrey Shallit and Jonathan Sorenson",
  title =        "Analysis of a Left-Shift Binary {GCD} Algorithm",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "6",
  pages =        "473--486",
  month =        jun,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "95g:68057",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C5230
                 (Digital arithmetic methods)",
  corpsource =   "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational complexity; digital arithmetic; greatest
                 common divisor; left-shift binary GCD algorithm;
                 polynomials; Ramharter theorem; symbol manipulation;
                 worst-case behavior",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Worfolk:1994:ZEV,
  author =       "Patrick A. Worfolk",
  title =        "Zeros of Equivariant Vector Fields: Algorithms for an
                 Invariant Approach",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "6",
  pages =        "487--512 (or 487--511??)",
  month =        jun,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (12-xx)",
  MRnumber =     "1 300 350",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1110 (Algebra); C7310 (Mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Div. of Appl. Math., Brown Univ., Providence, RI,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Cohen-; computational complexity; equivariant map;
                 equivariant vector fields; finite matrix group;
                 invariant polynomials; Macaulay; matrix algebra;
                 polynomial; polynomials; symbol manipulation; symbolic
                 algorithm; vector field equivariant; vectors; zeros",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Cooperman:1994:RBC,
  author =       "Gene Cooperman and Larry Finkelstein",
  title =        "A Random Base Change Algorithm for Permutation
                 Groups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "6",
  pages =        "513--528",
  month =        jun,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (20B07)",
  MRnumber =     "96a:68048",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics); C4240 (Programming
                 and algorithm theory); C1140Z (Other and
                 miscellaneous); C7310 (Mathematics); C6130 (Data
                 handling techniques)",
  corpsource =   "Coll. of Comput. Sci., Northeastern Univ., Boston, MA,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "asymptotic running time; combinatorial mathematics;
                 computational complexity; data; data structure; domain;
                 generation; group membership; group theory;
                 permutation; permutation groups; point stabilizer;
                 probability; Rand(G); random base change algorithm;
                 random generator; random number; sequence; structures;
                 time bound; time complexity; worst case",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lux:1994:PCS,
  author =       "Klaus Lux and J{\"u}rgen M{\"u}ller and Michael
                 Ringe",
  title =        "Peakword condensation and submodule lattices: an
                 application of the {MEAT-AXE}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "6",
  pages =        "529--544",
  month =        jun,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (16D10)",
  MRnumber =     "95h:68091",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "A0550 (Lattice theory and statistics; Ising problems);
                 A0210 (Algebra, set theory, and graph theory); C7320
                 (Physics and Chemistry); C1110 (Algebra)",
  corpsource =   "Lehratuhl der fur Math., Tech. Hochschule Aachen,
                 Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebra; C version; condensation method; field;
                 finite; finite dimensional algebra; lattice theory and
                 statistics; MEAT-AXE; multidimensional; peakword
                 condensation; physics computing; primitive idempotents;
                 submodule lattices; systems",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yokoyama:1994:MMA,
  author =       "Kazuhiro Yokoyama and Masayuki Noro and Taku
                 Takeshima",
  title =        "Multi-Modular Approach to Polynomial-Time
                 Factorization of Bivariate Integral Polynomials",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "17",
  number =       "6",
  pages =        "545--563",
  month =        jun,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (12D05)",
  MRnumber =     "96a:68052",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4130 (Interpolation and function approximation);
                 C4240 (Programming and algorithm theory); C7310
                 (Mathematics)",
  corpsource =   "ISIS, Fujitsu Labs., Shizuoka, Japan",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "bivariate integral polynomials; computational
                 complexity; mathematics computing; modular
                 factorizations; multi-modular approach; polynomial-time
                 factorization; polynomials",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Priestley:1994:MBA,
  author =       "H. A. Priestley and M. P. Ward",
  title =        "A Multipurpose Backtracking Algorithm",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "1",
  pages =        "1--40",
  month =        jul,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T20",
  MRnumber =     "1 300 795",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C1230
                 (Artificial intelligence); C1160 (Combinatorial
                 mathematics)",
  corpsource =   "Math. Inst., Oxford Univ., UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "backtracking; combinatorial mathematics; combinatorial
                 problems; element order; multipurpose backtracking
                 algorithm; relation-preserving maps; selection",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Miglioli:1994:APC,
  author =       "Pierangelo Miglioli and Ugo Moscato and Mario
                 Ornaghi",
  title =        "Abstract Parametric Classes and Abstract Data Types
                 defined by Classical and Constructive Logical Methods",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "1",
  pages =        "41--82 (or 41--81??)",
  month =        jul,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q65 (03B70)",
  MRnumber =     "95k:68155",
  MRreviewer =   "J{\'a}nos Demetrovics",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation); C6110J (Object-oriented
                 programming)",
  corpsource =   "Dipartimento di Sci. dell'Inf., Milan Univ., Italy",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "abstract data types; abstract parametric classes;
                 APC-; classical logical methods; classical model
                 theory; constructive logical methods; expression; first
                 order theories; inheritance; inheritance properties;
                 isoinitial; model; provability; semantics",
  treatment =    "P Practical",
}

@Article{Duntsch:1994:MBS,
  author =       "Ivo D{\"u}ntsch",
  title =        "A Microcomputer Based System for Small Relation
                 Algebras",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "1",
  pages =        "83--86",
  month =        jul,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "03B35 (03G15 04A05 68Q40)",
  MRnumber =     "95m:03021",
  MRreviewer =   "M. Randall Holmes",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C4250 (Database theory); C6160D
                 (Relational databases)",
  corpsource =   "Fac. of Inf., Ulster Univ., Jordanstown, UK",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "equational logic; first order logic; microcomputer
                 based system; n-ary; relational algebra; relations
                 algebra; small relation algebras",
  treatment =    "A Application; P Practical; T Theoretical or
                 Mathematical",
}

@Article{Orr:1994:CAA,
  author =       "Craig R. Orr and Doron Zeilberger",
  title =        "A Computer Algebra Approach to the Discrete
                 {Dirichlet} Problem",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "1",
  pages =        "87--90",
  month =        jul,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (39A10)",
  MRnumber =     "95f:68116",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing); C6130 (Data handling
                 techniques); C4210 (Formal logic); C4170 (Differential
                 equations)",
  corpsource =   "Dept. of Math., Temple Univ., Philadelphia, PA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "boundary-value problems; difference equations;
                 process; algebra; symbol manipulation; computer algebra
                 approach; discrete Dirichlet problem; Gr{\"o}bner Basis
                 Algorithm; closed form expressions; generating;
                 functions; finite difference equations; elliptic PDE's;
                 random walk problems; gambler's ruin problems",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Cremanns:1994:FDT,
  author =       "Robert Cremanns and Friedrich Otto",
  title =        "Finite derivation type implies the homological
                 finiteness condition {$ {\rm FP}_3 $}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "2",
  pages =        "91--112",
  month =        aug,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q42 (20F05 20M05)",
  MRnumber =     "96d:68112",
  MRreviewer =   "Yuji Kobayashi",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210L (Formal languages and computational
                 linguistics); C1110 (Algebra); C1160 (Combinatorial
                 mathematics)",
  corpsource =   "Fachbereich Math./Inf., Kassel Univ., Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "combinatorial property; convergence; decidability;
                 finite convergent presentation; finite derivation type;
                 finitely presented monoids; FP$_3$; graph theory; group
                 theory; homological finiteness condition; rewriting
                 systems; Squier's",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Kirchner:1994:CSC,
  author =       "H{\'e}l{\`e}ne Kirchner and Christophe Ringeissen",
  title =        "Combining Symbolic Constraint Solvers on Algebraic
                 Domains",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "2",
  pages =        "113--156 (or 113--155??)",
  month =        aug,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40 (68T15)",
  MRnumber =     "96g:68059",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6110L (Logic programming); C4210 (Formal logic);
                 C6170K (Knowledge engineering techniques)",
  corpsource =   "Inst. Nat. de Recherche en Inf. et Autom.,
                 Vandoeuvre-les-Nancy, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic domains; constraint; constraint handling;
                 constraint language; disequations; equations; finite
                 algebras; inequations; logic programming; symbolic
                 constraint solvers; theorem proving; unification
                 algorithms",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yamasaki:1994:TLP,
  author =       "Susumu Yamasaki and Kentaro Iida",
  title =        "Transformation of Logic Programs to {FP} Programs
                 Based on Dataflows",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "2",
  pages =        "157--182",
  month =        aug,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68N17 (68N15)",
  MRnumber =     "95h:68032",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6110L (Logic programming); C6110P (Parallel
                 programming)",
  corpsource =   "Dept. of Inf. Technol., Okayama Univ., Japan",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic manipulations; atom; data flow computing;
                 dataflows; designated predicate; extensionalities of
                 predicates; functional programming; functionality;
                 logic; logic programs; meaning; preserving program;
                 programming; resolution deduction; sequence;
                 substitution sequence; symbol manipulation",
  treatment =    "P Practical",
}

@Article{Pan:1994:SMP,
  author =       "Victor Y. Pan",
  title =        "Simple Multivariate Polynomial Multiplication",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "3",
  pages =        "183--186",
  month =        sep,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "95m:68089",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing); C1110 (Algebra)",
  corpsource =   "Dept. of Math. and Comput. Sci., Lehman Coll., New
                 York, NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "arithmetic time-complexity; evaluation; interpolation;
                 Kronecker's map; multidimensional grid; multivariate
                 polynomial multiplication; polynomial; polynomials;
                 symbol manipulation; upper bound",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Wang:1994:HO,
  author =       "Xiang Dong Wang",
  title =        "The {Hecke} operators on {$ {S}_k({\Gamma }_1 ({N}))
                 $}",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "3",
  pages =        "187--198",
  month =        sep,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11F25 (11F11 11F75)",
  MRnumber =     "96a:11043",
  MRreviewer =   "B. Ramakrishnan",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
}

@Article{Meer:1994:RNC,
  author =       "Klaus Meer",
  title =        "Real Number Computations: On the Use of Information",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "3",
  pages =        "199--206",
  month =        sep,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q10 (68Q15 68Q40)",
  MRnumber =     "95m:68049",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240C (Computational complexity); C4220 (Automata
                 theory); C1140E (Game theory)",
  corpsource =   "Lehrstuhl C fur Math., Tech. Hochschule Aachen,
                 Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Blum-Shub-Smale machine; complexity theory;
                 computational complexity; decision theory;
                 P=NP?-question; programming; quadratic-; real number
                 computations; Turing machine; Turing machines",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sawada:1994:PCG,
  author =       "Hiroyuki Sawada and Satoshi Terasaki and Akira Aiba",
  title =        "Parallel Computation of {Gr{\"o}bner} Bases on
                 Distributed Memory Machines",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "3",
  pages =        "207--222",
  month =        sep,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "1 318 136",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240P (Parallel programming and algorithm theory);
                 C6110L (Logic programming)",
  corpsource =   "Mechanical Eng. Lab., Tsukuba, Japan",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "constraint handling; distributed memory systems;
                 parallel; algorithms; Gr{\"o}bner bases; distributed
                 memory machines; parallel; algorithm; S-polynomials;
                 distributed memory parallel; machine; coarse grained
                 parallelism; constraint logic; programming;
                 manager-worker model; worker processes; minimum;
                 polynomial",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Oaku:1994:GBM,
  author =       "Toshinori {\=O}aku and Takeshi Shimoyama",
  title =        "A {Gr{\"o}bner} Basis Method for Modules over Rings of
                 Differential Operators",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "3",
  pages =        "223--248",
  month =        sep,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "16S32 (12H20 13P10 68Q40)",
  MRnumber =     "96e:16037",
  MRreviewer =   "G. Eisenreich",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
}

@Article{Wang:1994:DII,
  author =       "Dong Ming Wang",
  title =        "Differentiation and Integration of Indefinite
                 Summations with Respect to Indexed Variables --- Some
                 Rules and Applications",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "3",
  pages =        "249--264 (or 249--263??)",
  month =        sep,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q40",
  MRnumber =     "95m:68090",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Res. Inst. for Symbolic Comput., Johannes Kepler
                 Univ., Linz, Austria",
  classcodes =   "C7310 (Mathematics computing); C4160 (Numerical
                 integration and differentiation)",
  classification = "C4160 (Numerical integration and differentiation);
                 C7310 (Mathematics computing)",
  corpsource =   "Res. Inst. for Symbolic Comput., Johannes Kepler
                 Univ., Linz, Austria",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Artificial neural systems; artificial neural systems;
                 Computer-aided analysis; computer-aided analysis;
                 Differentiation; differentiation; Indefinite
                 summations; indefinite summations; indexed; Indexed
                 variables; Integration; integration; MACSYMA; MAPLE;
                 symbol manipulation; Toolkit; toolkit; variables",
  thesaurus =    "Differentiation; Integration; Symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Sofroniou:1994:SDR,
  author =       "M. Sofroniou",
  title =        "Symbolic Derivation of {Runge--Kutta} Methods",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "3",
  pages =        "265--296",
  month =        sep,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "65-04 (65L06)",
  MRnumber =     "1 318 139",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing); C4170 (Differential
                 equations)",
  corpsource =   "Dipartimento di Matematica, Bologna Univ., Italy",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "graph-theoretical formalism; Runge--Kutta methods;
                 software packages; symbol manipulation; symbolic
                 derivation; symbolic package",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Lugiez:1994:TAH,
  author =       "D. Lugiez and J. L. Moysset",
  title =        "Tree automata help one to solve equational formulae in
                 {AC}-theories",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "4",
  pages =        "297--318",
  month =        oct,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q68 (03D05)",
  MRnumber =     "96d:68155",
  MRreviewer =   "Zdzis{\l}aw Grodzki",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4220 (Automata theory); C4210 (Formal logic); C6120
                 (File organisation)",
  corpsource =   "CRIN-INRIA Lorraine, Vandoeuvre-les-Nancy, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "AC-theories; associative-;
                 associativity-commutativity; automata; automata theory;
                 commutative axioms; complement problems; conditional
                 tree; decidability; decision procedure; equational
                 formulae; inductive; inductive reducibility; module;
                 Presburger's arithmetic; reducibility module
                 associativity; tree automata; tree data structures",
  treatment =    "T Theoretical or Mathematical",
  xxtitle =      "Tree Automata Help Solve Equational Formulae in
                 AC-Theories",
}

@Article{Durand:1994:BSS,
  author =       "Ir{\'e}ne Durand",
  title =        "Bounded, Strongly Sequential and Forward-Branching
                 Term Rewriting Systems",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "4",
  pages =        "319--352",
  month =        oct,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q42",
  MRnumber =     "96e:68073",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210L (Formal languages and computational
                 linguistics); C1250 (Pattern recognition)",
  corpsource =   "Lab. Bordelais de Recherche en Inf., Bordeaux I Univ.,
                 Talence, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "bounded term rewriting; branching term rewriting
                 systems; forward-; forward-branching index tree;
                 pattern matching; rewriting systems; strongly
                 sequential term rewriting systems; systems",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{vanHoeij:1994:ACI,
  author =       "Mark {van Hoeij}",
  title =        "An Algorithm for Computing an Integral Basis in an
                 Algebraic Function Field",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "4",
  pages =        "353--364 (or 353--363??)",
  month =        oct,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11Y16 (11R58 68Q40)",
  MRnumber =     "96e:11166",
  MRreviewer =   "Juraj Kostra",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Math., Nijmegen Univ., Netherlands",
  classcodes =   "C7310 (Mathematics computing); C6130 (Data handling
                 techniques)",
  classification = "C6130 (Data handling techniques); C7310 (Mathematics
                 computing)",
  corpsource =   "Dept. of Math., Nijmegen Univ., Netherlands",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic function field; Algebraic function field;
                 algebraic number field; Algebraic number field; AXIOM;
                 computer algebra; Computer algebra systems; expansions;
                 integral basis; Integral basis; intermediate expression
                 swell; Intermediate expression swell; Maple 5.2;
                 mathematics computing; Puiseux; Puiseux expansions;
                 symbol manipulation; systems",
  thesaurus =    "Mathematics computing; Symbol manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Kalkbrener:1994:PDR,
  author =       "Michael Kalkbrener",
  title =        "Prime Decompositions of Radicals in Polynomial Rings",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "4",
  pages =        "365--372",
  month =        oct,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P10 (13F20)",
  MRnumber =     "96b:13019",
  MRreviewer =   "Joachim Apel",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation); C6130
                 (Data handling techniques); C7310 (Mathematics
                 computing)",
  corpsource =   "Dept. of Math., Swiss Federal Inst. of Technol.,
                 Zurich, Switzerland",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "noetherian commutative ring; polynomials; prime
                 decompositions; quotient field; radicals in polynomial
                 rings; symbol manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Hreinsdottir:1994:CWC,
  author =       "Freyja Hreinsd{\'o}ttir",
  title =        "A Case Where Choosing a Product Order Makes the
                 Calculations of a {Gr{\"o}bner} Basis Much Faster",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "4",
  pages =        "373--378",
  month =        oct,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P10",
  MRnumber =     "95m:13017",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290H (Linear algebra); C4140 (Linear algebra); C6130
                 (Data handling techniques); C7310 (Mathematics
                 computing)",
  corpsource =   "Dept. of Math., Stockholm Univ., Sweden",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "matrix algebra; symbol manipulation; product order;
                 Gr{\"o}bner basis; reverse lexicographic order",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Mignotte:1994:LIH,
  author =       "Maurice Mignotte and Philippe H. Glesser",
  title =        "{Landau}'s Inequality via {Hadamard}'s",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "4",
  pages =        "379--384 (or 379--383??)",
  month =        oct,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "26D20 (26C05)",
  MRnumber =     "96d:26026",
  MRreviewer =   "I. Gavrea",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "Dept. de Math., Univ. Louis Pasteur, Strasbourg,
                 France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "Hadamard's inequality; Jensen's formula; Landau's
                 inequality; polynomial; polynomials",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Ulmer:1994:ILD,
  author =       "Felix Ulmer",
  title =        "Irreducible Linear Differential Equations of Prime
                 Order",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "4",
  pages =        "385--401",
  month =        oct,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "12H05 (12F12 34A30)",
  MRnumber =     "96d:12010",
  MRreviewer =   "G. Eisenreich",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290P (Differential equations); B0290F (Interpolation
                 and function approximation); B0290H (Linear algebra);
                 C4170 (Differential equations); C4130 (Interpolation
                 and function approximation); C4140 (Linear algebra)",
  corpsource =   "IRMAR, Rennes I Univ., France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "associated Riccati; equation; equations; finite
                 differential Galois groups; Galois group; irreducible
                 linear differential equations; linear differential
                 equations; Liouvillian solution; polynomials; prime
                 order; Riccati; unimodular differential; unique minimal
                 polynomial",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yamamoto:1994:SBZ,
  author =       "Osami Yamamoto",
  title =        "On Some Bounds for Zeros of Norm-Bounded Polynomials",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "5",
  pages =        "403--428 (or 403--427??)",
  month =        nov,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "30C15",
  MRnumber =     "96d:30006",
  MRreviewer =   "Miodrag Petkovi\'c",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B0290F (Interpolation and function approximation);
                 C4130 (Interpolation and function approximation)",
  corpsource =   "Dept. of Inf. Sci., Tokyo Inst. of Technol., Japan",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "bounds; complex number; field; integers; norm-bounded
                 polynomials; poles and zeros; polynomials; zeros",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Duval:1994:ANE,
  author =       "Dominique Duval",
  title =        "Algebraic Numbers: An Example of Dynamic Evaluation",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "5",
  pages =        "429--446 (or 429--445??)",
  month =        nov,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11Y40 (12Y05 68Q40)",
  MRnumber =     "96b:11163",
  MRreviewer =   "Robert O. Robson",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques); C7310 (Mathematics
                 computing)",
  corpsource =   "LACO, Limoges Univ., France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algebraic numbers; automatic case; discussion; dynamic
                 evaluation; sketch theory; symbol manipulation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

@Article{Assi:1994:FGP,
  author =       "Abdallah Assi",
  title =        "On Flatness of Generic Projections",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "5",
  pages =        "447--462",
  month =        nov,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13P10 (13A30 13C11 68Q40)",
  MRnumber =     "96e:13033",
  MRreviewer =   "Philippe Loustaunau",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  corpsource =   "Mathematiques, Univ. d'Angers, France",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "symbol manipulation; flatness; generic projections;
                 commutative noetherian ring; algebraic varieties; prime
                 ideal; quotient field; localization; standard bases;
                 Gr{\"o}bner bases; SpecR",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Weiermann:1994:CBS,
  author =       "Andreas Weiermann",
  title =        "Complexity Bounds for Some Finite Forms of {Kruskal}'s
                 Theorem",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "5",
  pages =        "463--488",
  month =        nov,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q60",
  MRnumber =     "96m:68116",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240C (Computational complexity); C6150G (Diagnostic,
                 testing, debugging and evaluating systems)",
  corpsource =   "Inst. fur Math. Logik und Grundlagenforschung,
                 Westfalischen Wilhelms-Univ., M{\"u}nster, Germany",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "bound; complexity bounds; computational complexity;
                 finite forms; finite signature; Hardy; homeomorphic
                 embeddability; Kruskal's theorem; mathematical basis;
                 orders; partial; program verification; programming;
                 proving; termination of algorithms; theory; upper
                 bounds",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Apt:1994:SPN,
  author =       "Krzysztof R. Apt and Peter {van Emde Boas} and Angelo
                 Welling",
  title =        "The {STO}-problem is {NP}-hard",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "5",
  pages =        "489--495",
  month =        nov,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68Q25 (68N17)",
  MRnumber =     "96c:68081",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240C (Computational complexity)",
  corpsource =   "Dept. of Math. and Comput. Sci., Amsterdam Univ.,
                 Netherlands",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational complexity; finite set;
                 Martelli-Montanari unification algorithm; NP-hard;
                 STO-problem; subject to; term equations; the
                 occur-check",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Barkee:1994:WYC,
  author =       "Boo Barkee and Deh Cac Can and Julia Ecks and Theo
                 Moriarty and R. F. Ree",
  title =        "Why You Cannot Even Hope to Use {Gr{\"o}bner} Bases in
                 Public Key Cryptography: An Open Letter to a Scientist
                 Who Failed and a Challenge to Those Who Have Not Yet
                 Failed",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "6",
  pages =        "497--502 (or 497--501??)",
  month =        dec,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "94A60",
  MRnumber =     "1 334 658",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "B6120B (Codes); C6130S (Data security); C4240C
                 (Computational complexity)",
  corpsource =   "Math White Hall, Cornell Univ., Ithaca, NY, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computational complexity; public key cryptography;
                 Gr{\"o}bner bases; public key cryptography scheme;
                 computational; complexity",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Ma:1994:MDG,
  author =       "Yonghao Ma",
  title =        "On the Minors Defined by a Generic Matrix",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "6",
  pages =        "503--518",
  month =        dec,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "13C40 (13D02 13P10)",
  MRnumber =     "96d:13017",
  MRreviewer =   "Andrew Kustin",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing); C1110 (Algebra)",
  corpsource =   "Dept. of Math., Southwest Texas State Univ., San
                 Marcos, TX, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "associated standard bases; division algorithm; generic
                 matrix; mathematics computing; minors; polynomial ring;
                 polynomials; symbol manipulation; syzygies",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Huang:1994:EAR,
  author =       "Ming-Deh D. Huang and Doug Ierardi",
  title =        "Efficient Algorithms for the {Riemann--Roch} Problem
                 and for Addition in the {Jacobian} of a Curve",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "6",
  pages =        "519--540 (or 519--539??)",
  month =        dec,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "14Q05 (14H40 14H45)",
  MRnumber =     "96h:14077",
  MRreviewer =   "K. Kiyek",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing); C4240C (Computational
                 complexity); C4140 (Linear algebra)",
  corpsource =   "Univ. of Southern California, Los Angeles, CA, USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "algorithm; computational complexity;
                 factorization-free; Jacobian; Jacobian matrices; linear
                 space; Noether's; plane curve; poles; poles and;
                 polynomial-time algorithm; Riemann--Roch problem;
                 symbol manipulation; worst-case complexity; zeroes;
                 zeros",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Niemeyer:1994:FSQ,
  author =       "Alice C. Niemeyer",
  title =        "A Finite Soluble Quotient Algorithm",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "6",
  pages =        "541--562 (or 541--561??)",
  month =        dec,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20-04 (20D10)",
  MRnumber =     "96j:20001",
  MRreviewer =   "Cheryl E. Praeger",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7310 (Mathematics computing); C1110 (Algebra)",
  corpsource =   "Dept. of Math., Western Australia Univ., Nedlands, WA,
                 Australia",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "finite soluble quotients; group theory; polycyclic;
                 polycyclic groups; power conjugate presentations;
                 predetermined structure; series; symbol manipulation",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Pedersen:1994:TRC,
  author =       "John Pedersen and Margaret Yoder",
  title =        "Term Rewriting for the Conjugacy Problem and the
                 {Braid} Groups",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "6",
  pages =        "563--572",
  month =        dec,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "20F10 (20F36 68Q40 68Q45)",
  MRnumber =     "96c:20052",
  MRreviewer =   "Ralph W. Wilkerson",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210L (Formal languages and computational
                 linguistics); C7310 (Mathematics computing)",
  corpsource =   "Dept. of Math., Univ. of South Florida, Tampa, FL,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "braid groups; conjugacy problem; problem; rewriting
                 systems; symbol manipulation; term rewriting; word",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Gemignani:1994:SHS,
  author =       "Luca Gemignani",
  title =        "Solving {Hankel} Systems over the Integers",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "6",
  pages =        "573--584",
  month =        dec,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "11Y16 (15A36)",
  MRnumber =     "96e:11165",
  MRreviewer =   "A. Bultheel",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4140 (Linear algebra); C4240C (Computational
                 complexity); C7310 (Mathematics computing)",
  corpsource =   "Dipartimento di Inf., Pisa Univ., Italy",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "almost optimal; Boolean sequential cost; computational
                 complexity; factorization properties; fast integer LU
                 factorization; Hankel; Hankel matrices; Hankel systems;
                 manipulation; matrices; structured matrix techniques;
                 symbol",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Bach:1994:TPC,
  author =       "Eric Bach",
  title =        "Tensor Products and Computability",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "18",
  number =       "6",
  pages =        "585--593",
  month =        dec,
  year =         "1994",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "16B70 (03D40 15A72)",
  MRnumber =     "96c:16003",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/jsymcomp.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240C (Computational complexity); C1110 (Algebra);
                 C4210 (Formal logic)",
  corpsource =   "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI,
                 USA",
  fjournal =     "Journal of Symbolic Computation",
  journal-URL =  "http://www.sciencedirect.com/science/journal/07477171/",
  keywords =     "computability; computational complexity; computations;
                 decidability; decidable; finite local ring; generators;
                 modules; polynomial time; relations; tensor products;
                 tensors; Turing machine-like; undecidable",
  treatment =    "T Theoretical or Mathematical",
}

@Article{Yi:1995:ATT,
  author =       "Bo Yi and Jia Fu Xu",
  title =        "Analogical Type Theory",
  journal =      j-J-SYMBOLIC-COMP,
  volume =       "19",
  number =       "1/2/3",
  pages =        "3--24",
  month =        jan # ", " # feb # ", " # mar,
  year =         "1995",
  CODEN =        "JSYCEH",
  ISSN =         "0747-7171 (print), 1095-855X (electronic)",
  ISSN-L =       "0747-7171",
  MRclass =      "68T27 (03B35)",
  MRnumber =     "96e:68122",
  bibdate =      "Sat May 10 15:54:09 MDT 1997",
  bibsource =    "htt