Joachim von zur Gathen

From MaRDI portal
Person:165879

Available identifiers

zbMath Open von-zur-gathen.joachimWikidataQ11112511 ScholiaQ11112511MaRDI QIDQ165879

List of research outcomes

PublicationDate of PublicationType
Shifted varieties and discrete neighborhoods around varieties2021-09-29Paper
Interpolation by decomposable univariate polynomials2021-03-29Paper
Counting invariant subspaces and decompositions of additive polynomials2021-02-18Paper
Comparative Analysis of Random Generators2021-01-12Paper
Explicit estimates for polynomial systems defining irreducible smooth complete intersections2019-05-13Paper
Iteration entropy2019-03-22Paper
Density of real and complex decomposable univariate polynomials2018-11-20Paper
Counting Decomposable Univariate Polynomials2017-10-04Paper
Sidon sets and statistics of the ElGamal function2017-08-15Paper
Irreducible trinomials over finite fields2017-02-03Paper
The computational complexity of recognizing permutation functions2016-09-01Paper
Survey on Counting Special Types of Polynomials2016-05-25Paper
CryptoSchool2016-03-11Paper
CLAUDE COMIERS: THE FIRST ARITHMETICAL CRYPTOGRAPHY2015-11-13Paper
Composition collisions and projective polynomials2015-09-17Paper
Decomposition of generic multivariate polynomials2015-09-17Paper
https://portal.mardi4nfdi.de/entity/Q55013792015-08-03Paper
Counting curves and their projections2015-05-07Paper
Compositions and collisions at degree p 22015-03-27Paper
Circulant graphs and GCD and LCM of subsets2014-12-09Paper
Normal form for Ritt's second theorem2014-07-25Paper
Compositions and collisions at degree \(p^2\)2014-03-03Paper
Generating safe primes2014-01-23Paper
Modern Computer Algebra2013-11-20Paper
Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields2013-09-26Paper
The number of reducible space curves over a finite field2013-02-21Paper
Lower bounds for decomposable univariate wild polynomials2013-01-10Paper
Counting decomposable multivariate polynomials2012-06-20Paper
The number of decomposable univariate polynomials. extended abstract2012-05-13Paper
Interval partitions and polynomial factorization2012-04-26Paper
https://portal.mardi4nfdi.de/entity/Q30622742011-01-03Paper
Approximate polynomial GCD: small degree and small height perturbations2010-06-25Paper
Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields2010-04-27Paper
Zimmermann Telegram: The Original Draft2009-10-12Paper
Subset sum pseudorandom numbers: fast generation and distribution2009-10-09Paper
LATIN 2004: Theoretical Informatics2009-05-07Paper
https://portal.mardi4nfdi.de/entity/Q53016942009-01-20Paper
Counting reducible and singular bivariate polynomials2008-12-05Paper
Approximate Polynomial gcd: Small Degree and Small Height Perturbations2008-04-15Paper
Efficient Multiplication Using Type 2 Optimal Normal Bases2007-11-15Paper
Efficient FPGA-Based Karatsuba Multipliers for Polynomials over ${\mathbb F}_{2}$2007-11-15Paper
GCD of random linear combinations2006-10-16Paper
Selected Areas in Cryptography2006-10-10Paper
Polynomial and normal bases for finite fields2006-08-14Paper
Algorithms and Computation2005-12-22Paper
Average order in cyclic groups2005-06-30Paper
https://portal.mardi4nfdi.de/entity/Q31564332005-01-07Paper
Complexity of some arithmetic problems for binary polynomials2004-12-13Paper
Factoring a binary polynomial of degree over one million2004-09-01Paper
Computing special powers in finite fields2004-08-13Paper
Fast arithmetic with general Gauß periods2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44704622004-07-01Paper
Finding Points on Curves over Finite Fields2003-09-28Paper
Multivariate polynomial decomposition2003-08-26Paper
Subresultants revisited.2003-08-17Paper
Irreducible trinomials over finite fields2003-07-28Paper
https://portal.mardi4nfdi.de/entity/Q44065332003-06-25Paper
https://portal.mardi4nfdi.de/entity/Q27121092003-02-25Paper
Algorithms for exponentiation in finite fields2002-11-12Paper
Polynomial factorization over ${\mathbb F}_2$2002-09-18Paper
https://portal.mardi4nfdi.de/entity/Q45026472002-05-23Paper
Factoring polynomials over special finite fields2002-05-19Paper
https://portal.mardi4nfdi.de/entity/Q45083892002-05-09Paper
Factoring polynomials over finite fields: A survey2001-09-20Paper
Homogeneous bivariate decompositions2001-09-05Paper
https://portal.mardi4nfdi.de/entity/Q27086102001-07-17Paper
https://portal.mardi4nfdi.de/entity/Q45257132001-01-24Paper
The CREW PRAM Complexity of Modular Inversion2000-10-18Paper
https://portal.mardi4nfdi.de/entity/Q49386712000-02-23Paper
https://portal.mardi4nfdi.de/entity/Q42273161999-09-23Paper
https://portal.mardi4nfdi.de/entity/Q42527131999-08-31Paper
https://portal.mardi4nfdi.de/entity/Q42482501999-06-07Paper
https://portal.mardi4nfdi.de/entity/Q42269361999-05-30Paper
Counting curves and their projections1999-05-05Paper
Factoring modular polynomials1999-03-11Paper
https://portal.mardi4nfdi.de/entity/Q42273171999-02-23Paper
Computing components and projections of curves over finite fields1999-02-22Paper
https://portal.mardi4nfdi.de/entity/Q42266941999-01-28Paper
Polynomials with two values1999-01-24Paper
Normal bases via general Gauss periods1998-12-14Paper
https://portal.mardi4nfdi.de/entity/Q38390111998-10-08Paper
Orders of Gauss periods in finite fields1998-08-12Paper
Gauss periods: orders and cryptographical applications1997-12-16Paper
The computational complexity of recognizing permutation functions1995-07-11Paper
Tests for permutation functions1995-02-09Paper
https://portal.mardi4nfdi.de/entity/Q43143591994-12-18Paper
Efficient and optimal exponentiation in finite fields1993-10-10Paper
Computing Frobenius maps and factoring polynomials1993-06-29Paper
Processor-efficient exponentiation in finite fields1992-06-28Paper
Maximal bilinear complexity and codes1991-01-01Paper
Boolean circuits versus arithmetic circuits1991-01-01Paper
Tests for Permutation Polynomials1991-01-01Paper
Values of polynomials over finite fields1991-01-01Paper
Functional decomposition of polynomials: the tame case1990-01-01Paper
Functional decomposition of polynomials: the wild case1990-01-01Paper
Analysis of Euclidean algorithms for polynomials over finite fields1990-01-01Paper
Inversion in finite fields using logarithmic depth1990-01-01Paper
Constructing normal bases in finite fields1990-01-01Paper
Factoring polynomials and primitive elements for special primes1987-01-01Paper
Permanent and determinant1987-01-01Paper
Feasible arithmetic computations: Valiant's hypothesis1987-01-01Paper
Computing Powers in Parallel1987-01-01Paper
Representations and Parallel Computations for Rational Functions1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47247291986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47257421986-01-01Paper
Factoring sparse multivariate polynomials1985-01-01Paper
Irreducibility of multivariate polynomials1985-01-01Paper
Factorization of Multivariate Polynomials Over Finite Fields1985-01-01Paper
Parallel Algorithms for Algebraic Problems1984-01-01Paper
Hensel and Newton Methods in Valuation Rings1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30413041983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33165871983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33409601983-01-01Paper
Secant Spaces to Curves1983-01-01Paper
Fast parallel matrix and GCD computations1982-01-01Paper
Some polynomials that are hard to compute1980-01-01Paper
A Bound on Solutions of Linear Integer Equalities and Inequalities1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41096841976-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Joachim von zur Gathen