The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Joachim von zur Gathen" ( http://dblp.L3S.de/Authors/Joachim_von_zur_Gathen )

URL (Homepage):  http://math-www.uni-paderborn.de/~aggathen/joachim.html  Author page on DBLP  Author page in RDF  Community of Joachim von zur Gathen in ASPL-2

Publication years (Num. hits)
1976-1986 (16) 1987-1991 (15) 1992-1997 (17) 1998-2002 (17) 2003-2005 (16) 2006-2010 (15) 2011-2012 (3)
Publication types (Num. hits)
article(49) book(1) inproceedings(48) proceedings(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 27 occurrences of 21 keywords

Results
Found 99 publication records. Showing 99 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Joachim von zur Gathen, Daniel Panario, L. Bruce Richmond Interval Partitions and Polynomial Factorization. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Raoul Blankertz, Joachim von zur Gathen, Konstantin Ziegler Compositions and collisions at degree p^2 Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Joachim von zur Gathen Counting decomposable multivariate polynomials. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Maurice Mignotte, Igor Shparlinski Approximate polynomial GCD: Small degree and small height perturbations. Search on Bibsonomy J. Symb. Comput. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler Composition collisions and projective polynomials Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Joachim von zur Gathen, Alfredo Viola, Konstantin Ziegler Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields. Search on Bibsonomy LATIN The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Jean-Charles Faugère, Joachim von zur Gathen, Ludovic Perret Decomposition of generic multivariate polynomials. Search on Bibsonomy ISSAC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler Composition collisions and projective polynomials: statement of results. Search on Bibsonomy ISSAC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen The number of decomposable univariate polynomials. extended abstract. Search on Bibsonomy ISSAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF combinatorics on polynomials, polynomial decomposition, finite fields, computer algebra
1Joachim von zur Gathen Counting reducible and singular bivariate polynomials. Search on Bibsonomy Finite Fields and Their Applications The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Igor Shparlinski Approximate Polynomial gcd: Small Degree and Small Height Perturbations. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Euclidean algorithm, gcd, approximate computation
1Joachim von zur Gathen, José Luis Imaña, Çetin Kaya Koç (eds.) Arithmetic of Finite Fields, 2nd International Workshop, WAIFI 2008, Siena, Italy, July 6-9, 2008, Proceedings Search on Bibsonomy WAIFI The full citation details ... 2008 DBLP  BibTeX  RDF
1Laila El Aimani, Joachim von zur Gathen Finding Low Weight Polynomial Multiples Using Lattices. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2007 DBLP  BibTeX  RDF
1Joachim von zur Gathen Zimmermann Telegram: The Original Draft. Search on Bibsonomy Cryptologia The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Amin Shokrollahi, Jamshid Shokrollahi Efficient Multiplication Using Type 2 Optimal Normal Bases. Search on Bibsonomy WAIFI The full citation details ... 2007 DBLP  DOI  BibTeX  RDF optimal normal bases, asymptotically fast algorithms, Finite field arithmetic
1Joachim von zur Gathen Counting reducible and singular bivariate polynomials. Search on Bibsonomy ISSAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF bivariate polynomials, combinatorics on polynomials, reducible polynomials, singular polynomials, finite fields, counting problems
1Joachim von zur Gathen, Igor Shparlinski GCD of Random Linear Combinations. Search on Bibsonomy Algorithmica The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen Who was who in polynomial factorization: 1. Search on Bibsonomy ISSAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF history, polynomial factorization
1Joachim von zur Gathen, Michael Nöcker Polynomial and Normal Bases for Finite Fields. Search on Bibsonomy J. Cryptology The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Jamshid Shokrollahi Efficient FPGA-Based Karatsuba Multipliers for Polynomials over F2. Search on Bibsonomy Selected Areas in Cryptography The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Michael Nöcker Fast arithmetic with general Gauß periods. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Michael Nöcker Computing special powers in finite fields. Search on Bibsonomy Math. Comput. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Igor Shparlinski Polynomial interpolation from multiples. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF black box polynomial, hidden polynomial, integer lattices, short vectors, approximate computation
1Joachim von zur Gathen Arithmetic Circuits for Discrete Logarithms. Search on Bibsonomy LATIN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Discrete logarithm, arithmetic circuit, generic algorithm, cyclic group
1Joachim von zur Gathen, Igor Shparlinski Predicting Subset Sum Pseudorandom Generators. Search on Bibsonomy Selected Areas in Cryptography The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Igor Shparlinski GCD of Random Linear Forms. Search on Bibsonomy ISAAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Thomas Lücking Subresultants revisited. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Eric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor Shparlinski Complexity of some arithmetic problems for binary polynomials. Search on Bibsonomy Computational Complexity The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000). ((no classification))
1Joachim von zur Gathen, Jaime Gutierrez, Rosario Rubio Multivariate Polynomial Decomposition. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen Irreducible trinomials over finite fields. Search on Bibsonomy Math. Comput. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Igor Shparlinski, Alistair Sinclair Finding Points on Curves over Finite Fields. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Jürgen Gerhard Modern computer algebra (2. ed.). Search on Bibsonomy 2003   RDF
1Cornelia Grabbe, Marcus Bednara, Joachim von zur Gathen, Jamshid Shokrollahi, Jürgen Teich A High Performance VLIW Processor for Finite Field Arithmetic. Search on Bibsonomy IPDPS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Cornelia Grabbe, Marcus Bednara, Jürgen Teich, Joachim von zur Gathen, Jamshid Shokrollahi FPGA designs of parallel high performance GF(2233) multipliers. Search on Bibsonomy ISCAS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Jürgen Gerhard Polynomial factorization over F2. Search on Bibsonomy Math. Comput. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Marcus Bednara, M. Daldrup, Joachim von zur Gathen, Jamshid Shokrollahi, Jürgen Teich Reconfigurable Implementation of Elliptic Curve Crypto Algorithms. (PDF / PS) Search on Bibsonomy IPDPS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Marcus Bednara, M. Daldrup, Jürgen Teich, Joachim von zur Gathen, Jamshid Shokrollahi Tradeoff analysis of FPGA based elliptic curve cryptography. Search on Bibsonomy ISCAS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Daniel Panario Factoring Polynomials Over Finite Fields: A Survey. Search on Bibsonomy J. Symb. Comput. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen Irreducible trinomials over finite fields. Search on Bibsonomy ISSAC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Shuhong Gao, Joachim von zur Gathen, Daniel Panario, Victor Shoup Algorithms for Exponentiation in Finite Fields. Search on Bibsonomy J. Symb. Comput. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Igor Shparlinski The CREW PRAM Complexity of Modular Inversion. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Thomas Lücking Subresultants Revisited. Search on Bibsonomy LATIN The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Sandra Feisel, Joachim von zur Gathen, Amin Shokrollahi Normal bases via general Gauss periods. Search on Bibsonomy Math. Comput. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Igor Shparlinski Constructing Elements of Large Order in Finite Fields. Search on Bibsonomy AAECC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Gene Cooperman, Sandra Feisel, Joachim von zur Gathen, George Havas GCD of Many Integers. Search on Bibsonomy COCOON The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Michael Nöcker Computing Special Powers in Finite Fields (extended abstract). Search on Bibsonomy ISSAC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Silke Hartlieb Factoring Modular Polynomials. Search on Bibsonomy J. Symb. Comput. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Igor Shparlinski Orders of Gauss Periods in Finite Fields. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Primitive roots, Normal bases, Artin's conjecture, Algorithms, Finite fields
1Shuhong Gao, Joachim von zur Gathen, Daniel Panario Gauss periods: orders and cryptographical applications. Search on Bibsonomy Math. Comput. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Igor Shparlinski Computing components and projections of curves over finite fields. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Igor Shparlinski The CREW PRAM Complexity of Modular Inversion. Search on Bibsonomy LATIN The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, James R. Roche Polynomials with two Values. Search on Bibsonomy Combinatorica The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Marek Karpinski, Igor Shparlinski Counting Curves and Their Projections. Search on Bibsonomy Computational Complexity The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Michael Nöcker Exponentiation in Finite Fields: Theory and Practice. Search on Bibsonomy AAECC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Jürgen Gerhard Fast Algorithms for Taylor Shifts and Certain Difference Equations. Search on Bibsonomy ISSAC The full citation details ... 1997 DBLP  BibTeX  RDF
1Joachim von zur Gathen, Silke Hartlieb Factoring Modular Polynomials (extended abstract). Search on Bibsonomy ISSAC The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Jürgen Gerhard Arithmetic and Factorization of Polynomial Over F2 (extended abstract). Search on Bibsonomy ISSAC The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Jürgen Weiss Homogeneous Bivariate Decompositions. Search on Bibsonomy J. Symb. Comput. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Keju Ma, Joachim von zur Gathen The Computational Complexity of Recognizing Permutation Functions. Search on Bibsonomy Computational Complexity The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Shuhong Gao, Joachim von zur Gathen, Daniel Panario Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract). Search on Bibsonomy LATIN The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Igor Shparlinski Finding Points on Curves over Finite Fields (Extended Abstract). Search on Bibsonomy FOCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF plane algebraic curves, uniform random point, amortized polynomial time, computational geometry, finite fields, curves, computational problems
1Joachim von zur Gathen, Igor Shparlinski Orders of Gauss Periods in Finite Fields. Search on Bibsonomy ISAAC The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Igor Shparlinski Components and Projections of Curves over Finite Fields. Search on Bibsonomy ISAAC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Keju Ma, Joachim von zur Gathen The computational complexity of recognizing permutation functions. Search on Bibsonomy STOC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Marek Karpinski, Igor Shparlinski Counting curves and their projections. Search on Bibsonomy STOC The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen Processor-Efficient Exponentiation in Finite Fields. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Victor Shoup Computing Frobenius Maps and Factoring Polynomials. Search on Bibsonomy Computational Complexity The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Victor Shoup Computing Frobenius Maps and Factoring Polynomials (Extended Abstract) Search on Bibsonomy STOC The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Gadiel Seroussi Boolean Circuits Versus Arithmetic Circuits Search on Bibsonomy Inf. Comput. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen Efficient and Optimal Exponentiation in Finite Fields. Search on Bibsonomy Computational Complexity The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen Tests for Permutation Polynomials. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen Efficient Exponentiation in Finite Fields (Extended Abstract) Search on Bibsonomy FOCS The full citation details ... 1991 DBLP  DOI  BibTeX  RDF ground field, optimal sequential algorithms, finite field extension, parallel algorithms, finite field, exponentiation, normal basis
1Joachim von zur Gathen Inversion in Finite Fields Using Logarithmic Depth. Search on Bibsonomy J. Symb. Comput. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen Functional Decomposition of Polynomials: The Tame Case. Search on Bibsonomy J. Symb. Comput. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Keju Ma, Joachim von zur Gathen Analysis of Euclidean Algorithms for Polynomials over Finite Fields. Search on Bibsonomy J. Symb. Comput. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen Functional Decomposition of Polynomials: The Wild Case. Search on Bibsonomy J. Symb. Comput. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Mark Giesbrecht Constructing Normal Bases in Finite Fields. Search on Bibsonomy J. Symb. Comput. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen Polynomials over Finite Fields with Large Images. Search on Bibsonomy ISSAC The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen Testing Permutation Polynomials (Extended Abstract) Search on Bibsonomy FOCS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF random polynomial-time test, value list, exceptional polynomials, probabilistic variant, Hermite test, probabilistic test, computer algebra, permutation polynomials
1Joachim von zur Gathen Factoring Polynomials and Primitive Elements for Special Primes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen Feasible Arithmetic Computations: Valiant's Hypothesis. Search on Bibsonomy J. Symb. Comput. The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen Computing Powers in Parallel. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Dexter Kozen, Susan Landau Functional Decomposition of Polynomials Search on Bibsonomy FOCS The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen Representations and Parallel Computations for Rational Functions. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen Parallel Arithmetic Computations: A Survey. Search on Bibsonomy MFCS The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen Permanent and Determinant Search on Bibsonomy FOCS The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen Irreducible Polynomials over Finite Fields. Search on Bibsonomy FSTTCS The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Erich Kaltofen Factoring Sparse Multivariate Polynomials. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen Irreducibility of Multivariate Polynomials. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen Parallel Algorithms for Algebraic Problems. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen Parallel Powering Search on Bibsonomy FOCS The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Erich Kaltofen Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields. Search on Bibsonomy ICALP The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen Representations of Rational Functions Search on Bibsonomy FOCS The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen Factoring Sparse Multivariate Polynomials Search on Bibsonomy FOCS The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen Parallel algorithms for algebraic problems Search on Bibsonomy STOC The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
1Allan Borodin, Joachim von zur Gathen, John E. Hopcroft Fast Parallel Matrix and GCD Computations Search on Bibsonomy Information and Control The full citation details ... 1982 DBLP  DOI  BibTeX  RDF
1Allan Borodin, Joachim von zur Gathen, John E. Hopcroft Fast Parallel Matrix and GCD Computations Search on Bibsonomy FOCS The full citation details ... 1982 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Volker Strassen Some Polynomials that are Hard to Compute. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1980 DBLP  DOI  BibTeX  RDF
1Joachim von zur Gathen, Malte Sieveking Weitere zum Erfüllungsproblem polynomial äquivalente kombinatorische Aufgaben. Search on Bibsonomy Komplexität von Entscheidungsproblemen 1976 The full citation details ... 1976 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #99 of 99 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.