default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoachim von zur Gathen
Publications
- 2015
[j57]Joachim von zur Gathen, Igor E. Shparlinski
:
Circulant graphs and GCD and LCM of subsets. Inf. Process. Lett. 115(2): 134-138 (2015)- 2014
- [i5]Joachim von zur Gathen, Igor E. Shparlinski:
Circulant graphs and GCD and LCM of Subsets. CoRR abs/1402.5449 (2014) - 2013
- [j55]Joachim von zur Gathen, Igor E. Shparlinski:
Generating safe primes. J. Math. Cryptol. 7(4): 333-365 (2013) - 2010
- [j49]Joachim von zur Gathen, Maurice Mignotte, Igor E. Shparlinski:
Approximate polynomial GCD: Small degree and small height perturbations. J. Symb. Comput. 45(8): 879-886 (2010) - 2009
- [j48]Joachim von zur Gathen, Igor E. Shparlinski:
Subset sum pseudorandom numbers: fast generation and distribution. J. Math. Cryptol. 3(2): 149-163 (2009) - 2008
- [c47]Joachim von zur Gathen, Igor E. Shparlinski:
Approximate Polynomial gcd: Small Degree and Small Height Perturbations. LATIN 2008: 276-283 - 2006
- [j45]Joachim von zur Gathen, Igor E. Shparlinski:
GCD of Random Linear Combinations. Algorithmica 46(1): 137-148 (2006) - 2004
- [c41]Joachim von zur Gathen, Igor E. Shparlinski:
GCD of Random Linear Forms. ISAAC 2004: 464-469 - [c39]Joachim von zur Gathen, Igor E. Shparlinski:
Predicting Subset Sum Pseudorandom Generators. Selected Areas in Cryptography 2004: 241-251 - [c38]Joachim von zur Gathen, Igor E. Shparlinski:
Polynomial interpolation from multiples. SODA 2004: 1132-1137 - 2003
- [j39]Eric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor E. Shparlinski:
Complexity of some arithmetic problems for binary polynomials. Comput. Complex. 12(1-2): 23-47 (2003) - [j36]Joachim von zur Gathen, Igor E. Shparlinski, Alistair Sinclair:
Finding Points on Curves over Finite Fields. SIAM J. Comput. 32(6): 1436-1448 (2003) - [c35]Joachim von zur Gathen, Amin Shokrollahi, Igor E. Shparlinski:
An authentication scheme based on roots of sparse polynomials. ITW 2003: 159-162 - 2000
- [j30]Joachim von zur Gathen, Igor E. Shparlinski:
The CREW PRAM Complexity of Modular Inversion. SIAM J. Comput. 29(6): 1839-1857 (2000) - 1999
- [c30]Joachim von zur Gathen, Igor E. Shparlinski:
Constructing Elements of Large Order in Finite Fields. AAECC 1999: 404-409 - 1998
- [j28]Joachim von zur Gathen, Igor E. Shparlinski:
Orders of Gauss Periods in Finite Fields. Appl. Algebra Eng. Commun. Comput. 9(1): 15-24 (1998) - [j25]Joachim von zur Gathen, Igor E. Shparlinski:
Computing components and projections of curves over finite fields. SIAM J. Comput. 28(3): 822-840 (1998) - [c26]Joachim von zur Gathen, Igor E. Shparlinski:
The CREW PRAM Complexity of Modular Inversion. LATIN 1998: 305-315 - 1997
- [j24]Joachim von zur Gathen, Marek Karpinski, Igor E. Shparlinski:
Counting Curves and Their Projections. Comput. Complex. 6(1): 64-99 (1997) - 1995
- [c21]Joachim von zur Gathen, Igor E. Shparlinski:
Finding Points on Curves over Finite Fields (Extended Abstract). FOCS 1995: 284-292 - [c20]Joachim von zur Gathen, Igor E. Shparlinski:
Orders of Gauss Periods in Finite Fields. ISAAC 1995: 208-215 - 1994
- [c18]Joachim von zur Gathen, Igor E. Shparlinski:
Components and Projections of Curves over Finite Fields. ISAAC 1994: 297-305 - 1993
- [c16]Joachim von zur Gathen, Marek Karpinski, Igor E. Shparlinski:
Counting curves and their projections. STOC 1993: 805-812
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-08-10 00:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
