\title{MPCR: An  Efficient and Flexible Chains of Recurrences Server} 

\author{Olaf Bachmann\thanks{Work reported herein has been supported in 
part by the National Science Foundation under Grant CCR-9503650.}\\
Department of Mathematics and Computer Science \\
Kent State University \\ 
Kent, OH - 44242, U.S.A.\\
\verb?obachman@mcs.kent.edu?}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\begin{abstract}
  {\sc mpcr} is a stand-alone, flexible, and efficient implementation
  of the Chains of Recurrences (CR) method. It can be used
  interactively, as a network-based server, or as a library. Using the
  CR method, {\sc mpcr} evaluates closed-form expressions over regular
  grids with great efficiency -- often hundreds of times faster than
  comparable programs. {\sc mpcr} also features an MP (Multi Protocol)
  interface for data exchange, conditional CR simplification, use of
  intermediate evaluation arrays and generation of C source code.
  Evaluation timings are given and compared with other programs, and
  the algorithms which result in the high efficiency of {\sc mpcr} are
  discussed.
\end{abstract}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%