Preda Mihăilescu

887 total citations
20 papers, 318 citations indexed

About

Preda Mihăilescu is a scholar working on Information Systems, Geometry and Topology and Algebra and Number Theory. According to data from OpenAlex, Preda Mihăilescu has authored 20 papers receiving a total of 318 indexed citations (citations by other indexed papers that have themselves been cited), including 6 papers in Information Systems, 6 papers in Geometry and Topology and 6 papers in Algebra and Number Theory. Recurrent topics in Preda Mihăilescu's work include Biometric Identification and Security (6 papers), Algebraic Geometry and Number Theory (5 papers) and Coding theory and cryptography (5 papers). Preda Mihăilescu is often cited by papers focused on Biometric Identification and Security (6 papers), Algebraic Geometry and Number Theory (5 papers) and Coding theory and cryptography (5 papers). Preda Mihăilescu collaborates with scholars based in Germany, Canada and France. Preda Mihăilescu's co-authors include Axel Munk, Carsten Gottschlich, Yann Bugeaud, Valentin Blomer, Éric Schost, François Morain, Francesco Pappalardi, Michael Th. Rassias and Jörg Brüdern and has published in prestigious journals such as Mathematics of Computation, IEEE Transactions on Information Forensics and Security and Journal für die reine und angewandte Mathematik (Crelles Journal).

In The Last Decade

Preda Mihăilescu

18 papers receiving 264 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Preda Mihăilescu Germany 7 118 93 90 88 67 20 318
George Purdy United States 9 41 0.3× 25 0.3× 76 0.8× 15 0.2× 60 0.9× 39 285
Serge Dulucq France 13 53 0.4× 16 0.2× 17 0.2× 80 0.9× 12 0.2× 23 350
Frazer Jarvis United Kingdom 9 117 1.0× 10 0.1× 25 0.3× 70 0.8× 10 0.1× 15 228
Asif Ali Pakistan 10 35 0.3× 6 0.1× 164 1.8× 34 0.4× 23 0.3× 40 274
Bryant Tuckerman United States 7 35 0.3× 19 0.2× 22 0.2× 48 0.5× 38 0.6× 15 223
Nicolas Bonichon France 7 34 0.3× 13 0.1× 16 0.2× 22 0.3× 12 0.2× 24 210
Jacek Cichoń Poland 10 170 1.4× 14 0.2× 12 0.1× 47 0.5× 6 0.1× 50 264
Mario Di Raimondo Italy 9 26 0.2× 112 1.2× 116 1.3× 24 0.3× 173 2.6× 22 365
Geir Agnarsson United States 7 30 0.3× 11 0.1× 14 0.2× 30 0.3× 11 0.2× 27 246
Maozhi Xu China 10 25 0.2× 13 0.1× 38 0.4× 9 0.1× 117 1.7× 53 291

Countries citing papers authored by Preda Mihăilescu

Since Specialization
Citations

This map shows the geographic impact of Preda Mihăilescu's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Preda Mihăilescu with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Preda Mihăilescu more than expected).

Fields of papers citing papers by Preda Mihăilescu

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Preda Mihăilescu. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Preda Mihăilescu. The network helps show where Preda Mihăilescu may publish in the future.

Co-authorship network of co-authors of Preda Mihăilescu

This figure shows the co-authorship network connecting the top 25 collaborators of Preda Mihăilescu. A scholar is included among the top collaborators of Preda Mihăilescu based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Preda Mihăilescu. Preda Mihăilescu is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Mihăilescu, Preda. (2021). Improved lower bounds for possible solutions in the Second Case of the Fermat Last Theorem and in the Catalan Equation. Journal of Number Theory. 225. 151–173. 1 indexed citations
2.
Rassias, Michael Th., Jörg Brüdern, & Preda Mihăilescu. (2017). Goldbach's Problem: Selected Topics. Medical Entomology and Zoology. 1 indexed citations
3.
Mihăilescu, Preda, et al.. (2015). Security Considerations in Minutiae-Based Fuzzy Vaults. IEEE Transactions on Information Forensics and Security. 10(5). 985–998. 60 indexed citations
4.
Blomer, Valentin & Preda Mihăilescu. (2011). Contributions in Analytic and Algebraic Number Theory. CERN Document Server (European Organization for Nuclear Research). 1 indexed citations
5.
Mihăilescu, Preda, et al.. (2010). Elliptic Gauss sums and applications to point counting. Journal of Symbolic Computation. 45(8). 825–836. 1 indexed citations
6.
Munk, Axel, et al.. (2010). Improved Fingerprint Image Segmentation and Reconstruction of Low Quality Areas. 1241–1244. 6 indexed citations
7.
Gottschlich, Carsten, Axel Munk, & Preda Mihăilescu. (2009). Robust orientation field estimation in fingerprint images with broken ridge lines. 529–533. 1 indexed citations
8.
Mihăilescu, Preda. (2009). Reflection, Bernoulli Numbers and the Proof of Catalan's Conjecture. 325–340. 1 indexed citations
9.
Gottschlich, Carsten, Preda Mihăilescu, & Axel Munk. (2009). Robust Orientation Field Estimation and Extrapolation Using Semilocal Line Sensors. IEEE Transactions on Information Forensics and Security. 4(4). 802–811. 38 indexed citations
10.
Munk, Axel, et al.. (2008). Hierarchically linked extended features in fingerprints. 2. 47–52. 1 indexed citations
11.
Mihăilescu, Preda, François Morain, & Éric Schost. (2007). Computing the eigenvalue in the schoof-elkies-atkin algorithm using abelian lifts. 285–292. 4 indexed citations
12.
Bugeaud, Yann & Preda Mihăilescu. (2007). On the Nagell-Ljunggren equation $(x^n - 1)/(x - 1) = y^q$. MATHEMATICA SCANDINAVICA. 101(2). 177–177. 11 indexed citations
13.
Mihăilescu, Preda. (2007). Fast convolutions meet Montgomery. Mathematics of Computation. 77(262). 1199–1222. 2 indexed citations
14.
Mihăilescu, Preda. (2006). New bounds and conditions for the equation of Nagell–Ljunggren. Journal of Number Theory. 124(2). 380–395. 4 indexed citations
15.
Mihăilescu, Preda. (2005). On the class groups of cyclotomic extensions in presence of a solution to Catalan's equation. Journal of Number Theory. 118(1). 123–144. 5 indexed citations
16.
Mihăilescu, Preda, et al.. (2005). Dynamic threshold using polynomial surface regression with application to the binarization of fingerprints. Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE. 7 indexed citations
17.
Mihăilescu, Preda, et al.. (2004). Generic Efficient Arithmetic Algorithms for PAFFs (Processor Adequate Finite Fields) and Related Algebraic Structures. 1 indexed citations
18.
Mihăilescu, Preda. (2004). Primary cyclotomic units and a proof of Catalans conjecture. Journal für die reine und angewandte Mathematik (Crelles Journal). 2004(572). 160 indexed citations
19.
Mihăilescu, Preda. (2003). A class number free criterion for catalan's conjecture. Journal of Number Theory. 99(2). 225–231. 13 indexed citations
20.
Mihăilescu, Preda & Francesco Pappalardi. (2001). Review of the book "Elliptic Curves in Cryptography" by I. Blake, G. Seroussi, N. Smart.. 70(236). 1755–1759.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026