Publications and preprints (since 1990)

Journal Publications

  • S. Feisel, J. von zur Gathen and A. Shokrollahi, Normal bases via general Gauß periods. To appear in Mathematics of Computation, July 1998. Abstract Postscript
  • J. von zur Gathen and J. Weiß, Bivariate homogeneous decompositions. Journal of Symbolic computation 19 (1995), 409-434. Abstract
  • K. Ma and J. von zur Gathen, The computational complexity of recognizing permutation functions. Computational complexity 5 (1995), 76-97. Abstract
  • K. Ma and J. von zur Gathen, Tests for permutation functions. Finite Fields and their Applications 1 (1995), 31-56. Abstract
  • S. Gao and J. von zur Gathen, Berlekamp's and Niederreiter's Polynomial Factorization Algorithms. Contemporary Mathematics 168 (1994), 101-116. MR 95f:11106. Abstract
  • J. von zur Gathen an V. Shoup, Computing Frobenius maps an factoring polynomials. Computational complexity 2 (1992), 187-224. MR 94d:12011, Zbl. 778.11076. Abstract
  • J. von zur Gathen, Processor-efficient exponentiation in finite fields. Information Processing Letters 41 (1992), 81-86, Zbl. 762.68026. Abstract
  • J. von zur Gathen, Efficient and optimal exponentiation in finite fields. Computational complexity 1 (1991), 360-394, MR 94a:68061, Zbl. 788.68074. Abstract
  • J. von zur Gathen, Values of polynomials over finite fields. Bulletin of the Australian Mathematical Society 43 (1991), 141-146. MR 92b:11088, ZBl. 711.11047. Abstract
  • J. von zur Gathen, Tests for permutation polynomials. SIAM Journal on Computing 20 (1991), 591-602. MR 92g:11117, Zbl. 733.11048, Computer Abstracts 35 (1991) 5007. Abstract
  • J. von zur Gathen, Maximal bilinear complexity and codes. Linear Algebra and Its Applications 144 (1991), 49-61. MR 91i:68061, ZBl. 717.68041. Abstract
  • J. von zur Gathen and G. Seroussi, Boolean circuits versus arithmetic circuits. Information and Computation 91 (1991), 142-154. MR 92a:68056, Zbl. 718.11064. Abstract
  • J. von zur Gathen and M. Giesbrecht, Constructing normal bases in finite fields. Journal of Symbolic Computation 10 (1990), 547-570. MR 92e:11142, Zbl. 718.11065, Computer Abstracts 35 (1991) 2162. Abstract
  • J. von zur Gathen, Functional decomposition of polynomials: the wild case. Journal of Symbolic Computation 10 (1990), 437-452. MR 92i:12008, Zbl. 722.12003, Computer Abstracts 35 (1991) 2172. Abstract
  • J. von zur Gathen, Functional decomposition of polynomials: the tame case. Journal of Symbolic Computation 9 (1990), 281-299. MR 92a:12015, Zbl. 722.12003, Computer Abstracts 34 (1990) 2004. Abstract
  • K. Ma and J. von zur Gathen, Analysis of Euclidean algorithms for polynomials over finite fields. Journal of Symbolic Computation 9 (1990), 429-455. MR 91j:11113, Zbl. 698.68045, Computer Abstracts 34 (1990) 2709. Abstract
  • J. von zur Gathen, Inversion in finite fields using logarithmic depth. Journal of Symbolic Computation 9 (1990), 175-183. MR 91g:68089. Abstract

    • Publications in Proceedings

  • J. von zur Gathen and J. Gerhard, Fast algorithms for Taylor shifts and certain difference equations, Proc. ISSAC 97, Maui, USA, ACM press, pp 40-47. Abstract Postscript
  • J. von zur Gathen and M. Nöcker, Exponentiation in finite fields: theory and practice, Proc. AAECC 97, Toulouse, France, to appear in Springer LNCS. Postscript
  • J. von zur Gathen and J. Gerhard, Arithmetic and Factorization of Polynomials over F_2, Proc. ISSAC 96, Zurich, Switzerland, ACM press, 1-9. Abstract Postscript Full version (Technical report tr-rsfb-96-018, University of Paderborn, Germany, 1996, 43 pages)
  • J. von zur Gathen and S. Hartlieb, Factoring modular polynomials, Proc. ISSAC 96, Zurich, Switzerland, ACM press, 10-17. Postscript
  • J. von zur Gathen and I. E. Shparlinski, Orders of Gauss periods in finite fields, Proc. ISAAC '95, Cairns, Australia, to appear. Abstract Postscript
  • J. von zur Gathen and I. E. Shparlinski, Finding points on curves over finite fields. Proc. 36th Ann. Symp. on Foundations of Computer Science FOCS '95 (1995), 284-292. Abstract Postscript
  • S. Gao, J. von zur Gathen and D. Panario, Gauss periods and fast exponentiation in finite fields. Proc. Latin '95, Valparaiso, Chile, Springer Lecture Notes in Computer Science 911 (1995), 311-322. Abstract
  • J. von zur Gathen and I. Shparlinski, Components and projections of curves over finite fields. Proc. ISAAC '94, Beijing, China, Springer Lecture Notes in Computer Science 834 (1994), 297-305. Abstract Postscript
  • K. Ma and J. von zur Gathen, The computational complexity of recognizing permutation functions. Proc. 26th Annual ACM Symp. on Theory of Computing, Montreal PQ, 1994, 392-401. Abstract
  • J. von zur Gathen, Counting curves over finite fields. In: Abstracts of Papers presented at the 884th AMS Meeting, Syracuse, NY, 1993, 575. Abstract
  • J. von zur Gathen, M. Karpinski and I. Shparlinski, Counting curves and their projections. Proc. 25th Annual ACM Symp. on Theory of Computing, San Diego CA, 1993, 805-812. Abstract Postscript
  • J. von zur Gathen and V. Shoup, Computing Frobenius maps and factoring polynomials. Proc. 24th Annual ACM Symp. on Theory of Computing, Victoria BC, 1992, 97-105. Abstract
  • J. von zur Gathen, Efficient exponentiation in finite fields. Proc. 32nd Annual IEEE Symp. Foundations of Computer Science, San Juan PR, 1991, 384-391. Abstract
  • J. von zur Gathen, Polynomials over finite fields with large images. Proc. ISSAC-90, Tokyo, Japan, ACM Press, 140-144. Abstract

    Articles in books

    1. Parallel linear algebra. In Synthesis of parallel algorithms, ed. J. Reif, Morgan & Kaufman, 1993, 573-617.

    • Non-refereed Publications

  • J. von zur Gathen, Faktorisieren von Polynomen. In Computeralgebra in Deutschland, Fachgruppe Computeralgebra der GI, DMV, GAMM (1993), 20-22 und 25-26.
  • J. von zur Gathen, A polynomial factorization challenge. SIGSAM Bulletin 26 (1992), 22-24.
    • Last change: