The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Joachim von zur Gathen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Joachim von zur Gathen, Michael Nöcker
    Exponentiation in Finite Fields: Theory and Practice. [Citation Graph (0, 0)][DBLP]
    AAECC, 1997, pp:88-113 [Conf]
  2. Joachim von zur Gathen, Igor Shparlinski
    Constructing Elements of Large Order in Finite Fields. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:404-409 [Conf]
  3. Joachim von zur Gathen, Malte Sieveking
    Weitere zum Erfüllungsproblem polynomial äquivalente kombinatorische Aufgaben. [Citation Graph (0, 0)][DBLP]
    Komplexität von Entscheidungsproblemen 1976, 1976, pp:49-71 [Conf]
  4. Gene Cooperman, Sandra Feisel, Joachim von zur Gathen, George Havas
    GCD of Many Integers. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:310-317 [Conf]
  5. Allan Borodin, Joachim von zur Gathen, John E. Hopcroft
    Fast Parallel Matrix and GCD Computations [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:65-71 [Conf]
  6. Joachim von zur Gathen
    Representations of Rational Functions [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:133-137 [Conf]
  7. Joachim von zur Gathen
    Factoring Sparse Multivariate Polynomials [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:172-179 [Conf]
  8. Joachim von zur Gathen
    Parallel Powering [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:31-36 [Conf]
  9. Joachim von zur Gathen
    Permanent and Determinant [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:398-401 [Conf]
  10. Joachim von zur Gathen
    Testing Permutation Polynomials (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:88-92 [Conf]
  11. Joachim von zur Gathen
    Efficient Exponentiation in Finite Fields (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:384-391 [Conf]
  12. Joachim von zur Gathen, Dexter Kozen, Susan Landau
    Functional Decomposition of Polynomials [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:127-131 [Conf]
  13. Joachim von zur Gathen, Igor Shparlinski
    Finding Points on Curves over Finite Fields (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:284-292 [Conf]
  14. Joachim von zur Gathen
    Irreducible Polynomials over Finite Fields. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:252-262 [Conf]
  15. Joachim von zur Gathen, Erich Kaltofen
    Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:250-263 [Conf]
  16. Marcus Bednara, M. Daldrup, Joachim von zur Gathen, Jamshid Shokrollahi, Jürgen Teich
    Reconfigurable Implementation of Elliptic Curve Crypto Algorithms. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  17. Cornelia Grabbe, Marcus Bednara, Joachim von zur Gathen, Jamshid Shokrollahi, Jürgen Teich
    A High Performance VLIW Processor for Finite Field Arithmetic. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:189- [Conf]
  18. Joachim von zur Gathen, Igor Shparlinski
    GCD of Random Linear Forms. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:464-469 [Conf]
  19. Joachim von zur Gathen, Igor Shparlinski
    Components and Projections of Curves over Finite Fields. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:297-305 [Conf]
  20. Joachim von zur Gathen, Igor Shparlinski
    Orders of Gauss Periods in Finite Fields. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:208-215 [Conf]
  21. Cornelia Grabbe, Marcus Bednara, Jürgen Teich, Joachim von zur Gathen, Jamshid Shokrollahi
    FPGA designs of parallel high performance GF(2233) multipliers. [Citation Graph (0, 0)][DBLP]
    ISCAS (2), 2003, pp:268-271 [Conf]
  22. Marcus Bednara, M. Daldrup, Jürgen Teich, Joachim von zur Gathen, Jamshid Shokrollahi
    Tradeoff analysis of FPGA based elliptic curve cryptography. [Citation Graph (0, 0)][DBLP]
    ISCAS (5), 2002, pp:797-800 [Conf]
  23. Joachim von zur Gathen
    Irreducible trinomials over finite fields. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:332-336 [Conf]
  24. Joachim von zur Gathen
    Polynomials over Finite Fields with Large Images. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1990, pp:140-144 [Conf]
  25. Joachim von zur Gathen, Jürgen Gerhard
    Arithmetic and Factorization of Polynomial Over F2 (extended abstract). [Citation Graph (0, 0)][DBLP]
    ISSAC, 1996, pp:1-9 [Conf]
  26. Joachim von zur Gathen, Jürgen Gerhard
    Fast Algorithms for Taylor Shifts and Certain Difference Equations. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1997, pp:40-47 [Conf]
  27. Joachim von zur Gathen, Silke Hartlieb
    Factoring Modular Polynomials (extended abstract). [Citation Graph (0, 0)][DBLP]
    ISSAC, 1996, pp:10-17 [Conf]
  28. Joachim von zur Gathen, Michael Nöcker
    Computing Special Powers in Finite Fields (extended abstract). [Citation Graph (0, 0)][DBLP]
    ISSAC, 1999, pp:83-90 [Conf]
  29. Joachim von zur Gathen
    Who was who in polynomial factorization: 1. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2006, pp:2- [Conf]
  30. Shuhong Gao, Joachim von zur Gathen, Daniel Panario
    Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:311-322 [Conf]
  31. Joachim von zur Gathen
    Arithmetic Circuits for Discrete Logarithms. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:557-566 [Conf]
  32. Joachim von zur Gathen, Thomas Lücking
    Subresultants Revisited. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:318-342 [Conf]
  33. Joachim von zur Gathen, Igor Shparlinski
    The CREW PRAM Complexity of Modular Inversion. [Citation Graph (0, 0)][DBLP]
    LATIN, 1998, pp:305-315 [Conf]
  34. Joachim von zur Gathen
    Parallel Arithmetic Computations: A Survey. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:93-112 [Conf]
  35. Joachim von zur Gathen, Igor Shparlinski
    Predicting Subset Sum Pseudorandom Generators. [Citation Graph (0, 0)][DBLP]
    Selected Areas in Cryptography, 2004, pp:241-251 [Conf]
  36. Joachim von zur Gathen, Jamshid Shokrollahi
    Efficient FPGA-Based Karatsuba Multipliers for Polynomials over F2. [Citation Graph (0, 0)][DBLP]
    Selected Areas in Cryptography, 2005, pp:359-369 [Conf]
  37. Joachim von zur Gathen, Igor Shparlinski
    Polynomial interpolation from multiples. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:1132-1137 [Conf]
  38. Joachim von zur Gathen
    Parallel algorithms for algebraic problems [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:17-23 [Conf]
  39. Joachim von zur Gathen, Marek Karpinski, Igor Shparlinski
    Counting curves and their projections. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:805-812 [Conf]
  40. Joachim von zur Gathen, Victor Shoup
    Computing Frobenius Maps and Factoring Polynomials (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:97-105 [Conf]
  41. Keju Ma, Joachim von zur Gathen
    The computational complexity of recognizing permutation functions. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:392-401 [Conf]
  42. Joachim von zur Gathen, Jaime Gutierrez, Rosario Rubio
    Multivariate Polynomial Decomposition. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2003, v:14, n:1, pp:11-31 [Journal]
  43. Joachim von zur Gathen, Igor Shparlinski
    Orders of Gauss Periods in Finite Fields. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1998, v:9, n:1, pp:15-24 [Journal]
  44. Joachim von zur Gathen, Igor Shparlinski
    GCD of Random Linear Combinations. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:1, pp:137-148 [Journal]
  45. Keju Ma, Joachim von zur Gathen
    The Computational Complexity of Recognizing Permutation Functions. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1995, v:5, n:1, pp:76-97 [Journal]
  46. Eric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor Shparlinski
    Complexity of some arithmetic problems for binary polynomials. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2003, v:12, n:1-2, pp:23-47 [Journal]
  47. Joachim von zur Gathen
    Efficient and Optimal Exponentiation in Finite Fields. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1991, v:1, n:, pp:360-394 [Journal]
  48. Joachim von zur Gathen, Marek Karpinski, Igor Shparlinski
    Counting Curves and Their Projections. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:1, pp:64-99 [Journal]
  49. Joachim von zur Gathen, Victor Shoup
    Computing Frobenius Maps and Factoring Polynomials. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1992, v:2, n:, pp:187-224 [Journal]
  50. Joachim von zur Gathen, James R. Roche
    Polynomials with two Values. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:3, pp:345-362 [Journal]
  51. Allan Borodin, Joachim von zur Gathen, John E. Hopcroft
    Fast Parallel Matrix and GCD Computations [Citation Graph (0, 0)][DBLP]
    Information and Control, 1982, v:52, n:3, pp:241-256 [Journal]
  52. Joachim von zur Gathen, Gadiel Seroussi
    Boolean Circuits Versus Arithmetic Circuits [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:91, n:1, pp:142-154 [Journal]
  53. Joachim von zur Gathen
    Processor-Efficient Exponentiation in Finite Fields. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:41, n:2, pp:81-86 [Journal]
  54. Joachim von zur Gathen
    Irreducibility of Multivariate Polynomials. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1985, v:31, n:2, pp:225-264 [Journal]
  55. Joachim von zur Gathen, Erich Kaltofen
    Factoring Sparse Multivariate Polynomials. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1985, v:31, n:2, pp:265-287 [Journal]
  56. Joachim von zur Gathen, Michael Nöcker
    Polynomial and Normal Bases for Finite Fields. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2005, v:18, n:4, pp:337-355 [Journal]
  57. Joachim von zur Gathen
    Functional Decomposition of Polynomials: The Wild Case. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1990, v:10, n:5, pp:437-452 [Journal]
  58. Joachim von zur Gathen
    Functional Decomposition of Polynomials: The Tame Case. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1990, v:9, n:3, pp:281-299 [Journal]
  59. Joachim von zur Gathen, Mark Giesbrecht
    Constructing Normal Bases in Finite Fields. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1990, v:10, n:6, pp:547-570 [Journal]
  60. Joachim von zur Gathen, Silke Hartlieb
    Factoring Modular Polynomials. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1998, v:26, n:5, pp:583-606 [Journal]
  61. Joachim von zur Gathen, Daniel Panario
    Factoring Polynomials Over Finite Fields: A Survey. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2001, v:31, n:1/2, pp:3-17 [Journal]
  62. Joachim von zur Gathen, Jürgen Weiss
    Homogeneous Bivariate Decompositions. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1995, v:19, n:5, pp:409-434 [Journal]
  63. Joachim von zur Gathen
    Feasible Arithmetic Computations: Valiant's Hypothesis. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1987, v:4, n:2, pp:137-172 [Journal]
  64. Shuhong Gao, Joachim von zur Gathen, Daniel Panario, Victor Shoup
    Algorithms for Exponentiation in Finite Fields. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2000, v:29, n:6, pp:879-889 [Journal]
  65. Joachim von zur Gathen
    Inversion in Finite Fields Using Logarithmic Depth. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1990, v:9, n:2, pp:175-183 [Journal]
  66. Keju Ma, Joachim von zur Gathen
    Analysis of Euclidean Algorithms for Polynomials over Finite Fields. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1990, v:9, n:4, pp:429-455 [Journal]
  67. Joachim von zur Gathen
    Irreducible trinomials over finite fields. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 2003, v:72, n:244, pp:1987-2000 [Journal]
  68. Joachim von zur Gathen, Jürgen Gerhard
    Polynomial factorization over F2. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 2002, v:71, n:240, pp:1677-1698 [Journal]
  69. Joachim von zur Gathen, Michael Nöcker
    Computing special powers in finite fields. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 2004, v:73, n:247, pp:1499-1523 [Journal]
  70. Sandra Feisel, Joachim von zur Gathen, M. Amin Shokrollahi
    Normal bases via general Gauss periods. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 1999, v:68, n:225, pp:271-290 [Journal]
  71. Shuhong Gao, Joachim von zur Gathen, Daniel Panario
    Gauss periods: orders and cryptographical applications. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 1998, v:67, n:221, pp:343-352 [Journal]
  72. Joachim von zur Gathen
    Parallel Algorithms for Algebraic Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:4, pp:802-824 [Journal]
  73. Joachim von zur Gathen
    Representations and Parallel Computations for Rational Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:432-452 [Journal]
  74. Joachim von zur Gathen
    Computing Powers in Parallel. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:5, pp:930-945 [Journal]
  75. Joachim von zur Gathen
    Tests for Permutation Polynomials. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:3, pp:591-602 [Journal]
  76. Joachim von zur Gathen, Igor Shparlinski
    The CREW PRAM Complexity of Modular Inversion. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:6, pp:1839-1857 [Journal]
  77. Joachim von zur Gathen, Igor Shparlinski
    Computing components and projections of curves over finite fields. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:3, pp:822-840 [Journal]
  78. Joachim von zur Gathen, Igor Shparlinski, Alistair Sinclair
    Finding Points on Curves over Finite Fields. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:6, pp:1436-1448 [Journal]
  79. Joachim von zur Gathen
    Factoring Polynomials and Primitive Elements for Special Primes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:52, n:, pp:77-89 [Journal]
  80. Joachim von zur Gathen, Thomas Lücking
    Subresultants revisited. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:199-239 [Journal]
  81. Joachim von zur Gathen, Michael Nöcker
    Fast arithmetic with general Gauß periods. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:315, n:2-3, pp:419-452 [Journal]
  82. Joachim von zur Gathen, Volker Strassen
    Some Polynomials that are Hard to Compute. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:331-335 [Journal]
  83. Joachim von zur Gathen
    Counting reducible and singular bivariate polynomials. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2007, pp:369-376 [Conf]
  84. Joachim von zur Gathen, Amin Shokrollahi, Jamshid Shokrollahi
    Efficient Multiplication Using Type 2 Optimal Normal Bases. [Citation Graph (0, 0)][DBLP]
    WAIFI, 2007, pp:55-68 [Conf]

  85. The number of decomposable univariate polynomials. extended abstract. [Citation Graph (, )][DBLP]


  86. Approximate Polynomial gcd: Small Degree and Small Height Perturbations. [Citation Graph (, )][DBLP]


  87. Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields. [Citation Graph (, )][DBLP]


  88. Composition collisions and projective polynomials [Citation Graph (, )][DBLP]


Search in 0.436secs, Finished in 0.439secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002