default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrej Dujella
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j16]Mihai Cipu, Andrej Dujella, Yasutsugu Fujita:
Extensions of a Diophantine triple by adjoining smaller elements II. Period. Math. Hung. 89(1): 54-60 (2024)- 2022
- [j15]Yann Bugeaud
, Andrej Dujella, Wenjie Fang, Tomislav Pejkovic, Bruno Salvy:
Absolute Root Separation. Exp. Math. 31(3): 806-813 (2022) - [j14]Andrej Dujella, Zrinka Franusic, Vinko Petricevic:
Formulas for Diophantine quintuples containing two pairs of conjugates in some quadratic fields. Period. Math. Hung. 85(2): 303-311 (2022) - 2021
- [j13]Mihai Cipu, Andrej Dujella, Yasutsugu Fujita:
Diophantine triples with largest two elements in common. Period. Math. Hung. 82(1): 56-68 (2021) - 2017
- [j12]Yann Bugeaud, Andrej Dujella, Tomislav Pejkovic, Bruno Salvy:
Absolute Real Root Separation. Am. Math. Mon. 124(10): 930-936 (2017) - 2014
- [j11]Andrej Dujella, Juan Carlos Peral:
High-rank elliptic curves with torsion induced by Diophantine triples. LMS J. Comput. Math. 17(1): 282-288 (2014) - [j10]Julián Aguirre, Andrej Dujella, Mirela Jukic Bokun, Juan Carlos Peral:
High rank elliptic curves with prescribed torsion group over quadratic fields. Period. Math. Hung. 68(2): 222-230 (2014) - 2012
- [j9]Saúl Díaz Alvarado, Andrej Dujella, Florian Luca:
On a Conjecture Regarding Balancing With Powers of Fibonacci Numbers. Integers 12A: A2 (2012) - [j8]Andrej Dujella, Florian Luca:
On the sum of two divisors of (n 2 + 1)/2. Period. Math. Hung. 65(1): 83-96 (2012) - [j7]Andrej Dujella, Filip Najman:
Elliptic curves with large torsion and positive rank over number fields of small degree and ECM factorization. Period. Math. Hung. 65(2): 193-203 (2012) - 2009
- [j6]Andrej Dujella:
A variant of Wiener's attack on RSA. Computing 85(1-2): 77-83 (2009) - 2008
- [j5]Andrej Dujella:
A variant of Wiener's attack on RSA with small secret exponent. ACM Commun. Comput. Algebra 42(1-2): 50-51 (2008) - [j4]Andrej Dujella, Vinko Petriccevic:
Strong Diophantine Triples. Exp. Math. 17(1): 83-89 (2008) - 2002
- [j3]Andrej Dujella, Clemens Fuchs, Robert F. Tichy:
Diophantine m-tuples for linear polynomials. Period. Math. Hung. 45(1-2): 21-33 (2002) - 2001
- [j2]Andrej Dujella:
Newton's Formula and the Continued Fraction Expansion of √d. Exp. Math. 10(1): 125-131 (2001) - 1999
- [j1]Andrej Dujella:
A bijective proof of Riordan's theorem on powers of Fibonacci numbers. Discret. Math. 199(1-3): 217-220 (1999)
Informal and Other Publications
- 2019
- [i4]Yann Bugeaud, Andrej Dujella, Wenjie Fang, Tomislav Pejkovic, Bruno Salvy:
Absolute root separation. CoRR abs/1907.01232 (2019) - 2008
- [i3]Andrej Dujella:
A variant of Wiener's attack on RSA. CoRR abs/0811.0063 (2008) - [i2]Andrej Dujella:
A variant of Wiener's attack on RSA. IACR Cryptol. ePrint Arch. 2008: 459 (2008) - 2004
- [i1]Andrej Dujella:
Continued fractions and RSA with small secret exponent. CoRR cs.CR/0402052 (2004)
Coauthor Index
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-22 20:48 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:
