REFERENCES
- Brent , R. P. , Gustavson , F. G. and Yun , D. Y. Y. 1980 . “Fast solution of Toeplitz systems of equations and computation of Padá approximants” . J. Algorithms , 1 : 259 – 295 . [Brent et al. 1980]
- Cannon , J. W. and Wagreich , P. 1992 . “Growth functions of surface groups” . Math. Ann. , 293 : 239 – 257 . [Cannon and Wagreich 1992]
- Coppersmith , D. and Winograd , S. 1990 . “Matrix multiplication via arithmetic progressions” . J. Symbolic Comput. , 9 : 251 – 280 . [Coppersmith and Winograd 1990]
- Epstein , D. B. A. , Cannon , J. W. , Holt , D. F. , Levy , S. V. F. , Paterson , M. S. and Thurston , W. P. 1992 . Word Processing in Groups Boston : Jones and Bartlett. . [Epstein et al. 1992]
- Epstein , D. B. A. , Holt , D. F. and Rees , S. E. 1991 . “The use of Knuth–Bendix methods to solve the word problem in automatic groups” . J. Symbolic Comput. , 12 : 397 – 414 . [Epstein et al. 1991]
- Faddeev , D. K. and Faddeeva , V. N. 1963 . Computational methods in linear algebra San Francisco : W. H. Freeman. . [Faddeev and Faddeeva 1963]
- Ghys , E. and de la Harpe , P. 1989 . Sur les groupes hyperboliques d'après Mikhael Gromov Boston : Birkhäuser. . [Ghys and de la Harpe 1989], Progress in Math. 83
- Goodman , O. and Levy , S. 1993 . Hyperbolic.m Geometry Center, University of Minnesota. . [Goodman and Levy 1993], http://www.geom.umn.edu/software/download/hyperbolic.html
- Keller-Gehrig , W. 1985 . “Fast algorithms for the characteristic polynomial” . Theoret. Comput. Sci. , 36 : 309 – 317 . [Keller-Gehrig 1985]
- Knuth , D. E. and Bendix , P. B. 1970 . “Simple word problems in universal algebra”. ” . In Computational problems in abstract algebras Edited by: Leech , J. 263 – 297 . Oxford : Pergamon Press. . [Knuth and Bendix 1970], (Oxford, 1967)
- Lauer , M. 1983 . “Computing by homomorphic images”. ” . In Computer algebra: symbolic and algebraic computation, , 2nd ed. 139 – 168 . Wien : Springer. . [Lauer 1983]
- Massey , J. L. 1969 . “Shift Register Synthesis and BCH Decoding” . IEEE Trans. Information Theory , IT-15 : 122 – 127 . [Massey 1969]
- Mignotte , M. 1983 . “Some useful bounds”. ” . In Computer algebra: symbolic and algebraic computation, , 2nd ed. 259 – 263 . Wien : Springer. . [Mignotte 1983]
- Saito , K. “The limit element in the configuration algebra for a discrete group” . Proc. Int. Congress Mathematicians . 1990 , Kyoto . pp. 931 – 942 . Tokyo : Springer. . [Saito 1991]
- Stanley , R. P. 1986 . Enumerative combinatorics Monterey , CA : Wadsworth and Brooks/Cole. . [Stanley 1986]
- Wiedemann , D. 1986 . “Solving sparse linear equations over finite fields” . IEEE Trans. Information Theory , IT-32 : 54 – 62 . [Wiedemann 1986]