\begin{thebibliography}{10}

\bibitem{sykung87}
S.~Y. Kung, ``Optimal systolic design for the transitive closure and shortest
  paths problems,'' {\em IEEE Transactions on Computers}, vol.~C-36,
  pp.~603--614, May 1987.

\bibitem{pstseng87}
P.~S. Tseng, 1987.
\newblock personal communication.

\bibitem{kung82a}
H.~T. Kung, ``Why systolic architectures?,'' {\em IEEE Computer}, pp.~37--46,
  Jan. 1982.

\bibitem{sykung81}
S.~Y. Kung, K.~S. Arun, R.~J. Gal-Ezer, and D.~V. {Bhaskar Rao}, ``Wavefront
  array architecture: Language, architecture, and applications,'' {\em IEEE
  Transactions on Computers}, vol.~C-31, pp.~1054--1066, Nov. 1982.

\bibitem{quinton84}
P.~Quinton, ``Automatic systhesis of systolic arrays from uniform recurrent
  equations,'' in {\em International Symposium on Computer Architecture},
  pp.~208--214, IEEE, 1984.

\bibitem{rao85}
S.~K. Rao, {\em Regular Iterative Algorithms and Their Implementations on
  Processor Arrays}.
\newblock PhD thesis, Stanford, 1985.

\bibitem{moldovan86}
D.~I. Moldovan and J.~Fortes, ``Partitioning and mapping algorithms into fixed
  size systolic arrays,'' {\em IEEE Transactions on Computers}, vol.~C-35,
  pp.~1--12, Jan. 1986.

\bibitem{leekedem88}
P.~Lee and Z.~Kedem, ``Synthesizing linear array algorithms from nested for
  loop algorithms,'' {\em IEEE Transactions on Computers}, vol.~37,
  pp.~1578--1598, Dec. 1988.

\bibitem{leekedem90}
P.~Lee and Z.~Kedem, ``Mapping nested loop algorithms into multidimensional
  systolic arrays,'' {\em IEEE Transactions on Parallel and Distributed
  Systems}, vol.~1, pp.~64--76, Jan. 1990.

\bibitem{annaratone87e}
M.~Annaratone, E.~Arnould, T.~Gross, H.~T. Kung, M.~Lam, O.~Menzilcioglu, and
  J.~Webb, ``The {W}arp computer: Architecture, implementation, and
  performance,'' {\em IEEE Transactions on Computers}, vol.~C-36,
  pp.~1523--1538, Dec. 1987.

\bibitem{rote85}
G.~Rote, ``A systolic array algorithm for the algebraic path problem,'' {\em
  Computing}, vol.~34, pp.~191--219, 1985.

\bibitem{floyd62}
R.~W. Floyd, ``Algorithm 97: Shortest path,'' {\em Communications of the ACM},
  vol.~5, no.~6, p.~345, 1962.

\bibitem{maggs88}
B.~M. Maggs and S.~A. Plotkin, ``Minimum-cost spanning tree as a path-finding
  problem,'' {\em Information Processing Letters}, vol.~26, pp.~291--293, Jan.
  1988.

\bibitem{robert86}
Y.~Robert and D.~Trystram, ``Systolic solution of the algebraic path problem,''
  in {\em Systolic Arrays} (W.~Moore, A.~McCabe, and R.~Urquhart, eds.),
  Boston: Adam Hilger, 1986.

\bibitem{aho74}
A.~V. Aho, J.~E. Hopcroft, and J.~D. Ullman, {\em Design and Analysis of
  Computer Algorithms}.
\newblock Addison-Wesley, 1974.

\bibitem{jover86}
J.~M. Jover and T.~Kailath, ``A parallel architecture for {K}alman filter
  measurement update and parameter estimation,'' {\em Automatica}, vol.~22,
  no.~1, pp.~32--57, 1986.

\bibitem{baheti90}
R.~S. Baheti, D.~R. O'Hallaron, and H.~R. Itzkowitz, ``Mapping extended
  {K}alman filters onto linear arrays,'' 1990.
\newblock to appear in IEEE Transactions on Automatic Control.

\bibitem{golub83}
G.~H. Golub and C.~F.~V. Loan, {\em Matrix Computations}.
\newblock Johns Hopkins University Press, 1983.

\end{thebibliography}
