1. Thomas Beth, Jörn Müller-Quade, and Rainer Steinwandt, Computing restrictions of ideals in finitely generated k-algebras by means of Buchberger's algorithm, J. Symbolic Comput. 41 (2006), no. 3-4, 372–380.[MR]
  2. Willi Geiselmann, Jörn Müller-Quade, and Rainer Steinwandt, Comment on: "A new representation of elements of finite fields GF(2m) yielding small complexity arithmetic circuits" by G. Drolet, IEEE Trans. Comput. 51 (2002), no. 12, 1460–1461.[MR]
  3. Jörn Müller-Quade and Rainer Steinwandt, Basic algorithms for rational function fields, J. Symbolic Comput. 27 (1999), no. 2, 143–170.[MR]
  4. Jörn Müller-Quade and Rainer Steinwandt, Gröbner bases applied to finitely generated field extensions, J. Symbolic Comput. 30 (2000), no. 4, 469–490.[MR]
  5. Jörn Müller-Quade and Rainer Steinwandt, Recognizing simple subextensions of purely transcendental field extensions, Appl. Algebra Engrg. Comm. Comput. 11 (2000), no. 1, 35–41.[MR]
  6. Michael Schmid, Rainer Steinwandt, Jörn Müller-Quade, Martin Rötteler, and Thomas Beth, Decomposing a matrix into circulant and diagonal factors, Linear Algebra Appl. 306 (2000), no. 1-3, 131–143.[MR]
  7. Rainer Steinwandt and Jörn Müller-Quade, Freeness, linear disjointness, and implicitization—a classical approach, Beiträge Algebra Geom. 41 (2000), no. 1, 57–66.[MR]