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