Остановите войну!
for scientists:
default search action
Joachim von zur Gathen
Publications
- 2021
- [j62]Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler:
Counting invariant subspaces and decompositions of additive polynomials. J. Symb. Comput. 105: 214-233 (2021) - 2020
- [j61]Lucas Boppre Niehues, Joachim von zur Gathen, Lucas Pandolfo Perin, Ana Zumalacárregui:
Sidon sets and statistics of the ElGamal function. Cryptologia 44(5): 438-450 (2020) - 2019
- [c54]Juan José Cabezas, Francisco Castro, Joachim von zur Gathen, Jorge Tiscornia, Alfredo Viola:
Uruguayan Cryptography: Printed Book Covers. HistoCrypt 2019: 158:007 - [i7]Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler:
Counting invariant subspaces and decompositions of additive polynomials. CoRR abs/1912.00212 (2019) - 2018
- [c53]Juan José Cabezas, Joachim von zur Gathen, Jorge Tiscornia:
Uruguayan Cryptographic Carpet. HistoCrypt 2018: 149:009 - 2015
- [p2]Joachim von zur Gathen, Konstantin Ziegler:
Survey on Counting Special Types of Polynomials. Computer Algebra and Polynomials 2015: 50-75 - 2014
- [i4]Joachim von zur Gathen, Konstantin Ziegler:
Survey on counting special types of polynomials. CoRR abs/1407.2970 (2014) - 2013
- [b2]Joachim von zur Gathen, Jürgen Gerhard:
Modern Computer Algebra (3. ed.). Cambridge University Press 2013, ISBN 978-1-107-03903-2, pp. I-XIII, 1-795 - [j53]Raoul Blankertz, Joachim von zur Gathen, Konstantin Ziegler:
Compositions and collisions at degree p2. J. Symb. Comput. 59: 113-145 (2013) - [j52]Joachim von zur Gathen, Alfredo Viola, Konstantin Ziegler:
Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields. SIAM J. Discret. Math. 27(2): 855-891 (2013) - 2012
- [j51]Joachim von zur Gathen, Daniel Panario, L. Bruce Richmond:
Interval Partitions and Polynomial Factorization. Algorithmica 63(1-2): 363-397 (2012) - [c52]Raoul Blankertz, Joachim von zur Gathen, Konstantin Ziegler:
Compositions and collisions at degree p2. ISSAC 2012: 91-98 - [i3]Raoul Blankertz, Joachim von zur Gathen, Konstantin Ziegler:
Compositions and collisions at degree p2. CoRR abs/1202.5810 (2012) - 2010
- [c51]Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler:
Composition collisions and projective polynomials: statement of results. ISSAC 2010: 123-130 - [c49]Joachim von zur Gathen, Alfredo Viola, Konstantin Ziegler:
Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields. LATIN 2010: 243-254 - [i2]Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler:
Composition collisions and projective polynomials. CoRR abs/1005.1087 (2010) - 2003
- [b1]Joachim von zur Gathen, Jürgen Gerhard:
Modern computer algebra (2. ed.). Cambridge University Press 2003, ISBN 978-0-521-82646-4, pp. I-XIII, 1-785 - 2002
- [j34]Joachim von zur Gathen, Jürgen Gerhard:
Polynomial factorization over F2. Math. Comput. 71(240): 1677-1698 (2002) - 2001
- [j33]Olaf Bonorden, Joachim von zur Gathen, Jürgen Gerhard, Olaf Müller:
Factoring a binary polynomial of degree over one million. SIGSAM Bull. 35(1): 16-18 (2001) - [j32]Joachim von zur Gathen, Daniel Panario:
Factoring Polynomials Over Finite Fields: A Survey. J. Symb. Comput. 31(1/2): 3-17 (2001) - 2000
- [j31]Shuhong Gao, Joachim von zur Gathen, Daniel Panario, Victor Shoup:
Algorithms for Exponentiation in Finite Fields. J. Symb. Comput. 29(6): 879-889 (2000) - 1998
- [j26]Shuhong Gao, Joachim von zur Gathen, Daniel Panario:
Gauss periods: orders and cryptographical applications. Math. Comput. 67(221): 343-352 (1998) - 1997
- [c24]Joachim von zur Gathen, Jürgen Gerhard:
Fast Algorithms for Taylor Shifts and Certain Difference Equations. ISSAC 1997: 40-47 - 1996
- [c23]Joachim von zur Gathen, Jürgen Gerhard:
Arithmetic and Factorization of Polynomial Over F2 (extended abstract). ISSAC 1996: 1-9 - 1995
- [c19]Shuhong Gao, Joachim von zur Gathen, Daniel Panario:
Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract). LATIN 1995: 311-322 - 1992
- [j20]Joachim von zur Gathen, Victor Shoup:
Computing Frobenius Maps and Factoring Polynomials. Comput. Complex. 2: 187-224 (1992) - [c15]Joachim von zur Gathen, Victor Shoup:
Computing Frobenius Maps and Factoring Polynomials (Extended Abstract). STOC 1992: 97-105 - 1991
- [j16]Joachim von zur Gathen, Gadiel Seroussi:
Boolean Circuits Versus Arithmetic Circuits. Inf. Comput. 91(1): 142-154 (1991) - 1990
- [j10]Joachim von zur Gathen, Mark Giesbrecht:
Constructing Normal Bases in Finite Fields. J. Symb. Comput. 10(6): 547-570 (1990) - 1985
- [j4]Joachim von zur Gathen, Erich L. Kaltofen:
Factoring Sparse Multivariate Polynomials. J. Comput. Syst. Sci. 31(2): 265-287 (1985) - 1983
- [c4]Joachim von zur Gathen, Erich L. Kaltofen:
Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields. ICALP 1983: 250-263
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint