Razvan Barbulescu

898 total citations
10 papers, 107 citations indexed

About

Razvan Barbulescu is a scholar working on Geometry and Topology, Information Systems and Artificial Intelligence. According to data from OpenAlex, Razvan Barbulescu has authored 10 papers receiving a total of 107 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Geometry and Topology, 5 papers in Information Systems and 5 papers in Artificial Intelligence. Recurrent topics in Razvan Barbulescu's work include Algebraic Geometry and Number Theory (8 papers), Coding theory and cryptography (5 papers) and Cryptography and Residue Arithmetic (5 papers). Razvan Barbulescu is often cited by papers focused on Algebraic Geometry and Number Theory (8 papers), Coding theory and cryptography (5 papers) and Cryptography and Residue Arithmetic (5 papers). Razvan Barbulescu collaborates with scholars based in France, Switzerland and Canada. Razvan Barbulescu's co-authors include Sylvain Duquesne, Thorsten Kleinjung, Joppe W. Bos and Peter L. Montgomery and has published in prestigious journals such as Mathematics of Computation, Journal of Cryptology and Acta Arithmetica.

In The Last Decade

Razvan Barbulescu

9 papers receiving 105 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Razvan Barbulescu France	3	89	71	21	13	11	10	107
Thorsten Kleinjung Switzerland	7	93 1.0×	76 1.1×	23 1.1×	19 1.5×	11 1.0×	18	116
Khoa Nguyen Singapore	7	91 1.0×	41 0.6×	26 1.2×	21 1.6×	9 0.8×	22	113
Daniel R. L. Brown Canada	5	55 0.6×	41 0.6×	19 0.9×	13 1.0×	6 0.5×	11	85
Jérôme Plût Burundi	1	104 1.2×	86 1.2×	11 0.5×	12 0.9×	18 1.6×	2	130
Robert Zuccherato Canada	7	109 1.2×	95 1.3×	17 0.8×	13 1.0×	25 2.3×	11	130
Katsuyuki Takashima Japan	6	79 0.9×	46 0.6×	18 0.9×	17 1.3×	8 0.7×	19	94
Luca De Feo France	4	120 1.3×	97 1.4×	12 0.6×	17 1.3×	21 1.9×	11	152
Muhammed F. Esgin Australia	5	66 0.7×	66 0.9×	22 1.0×	7 0.5×	5 0.5×	8	100
Oliver Schirokauer United States	5	78 0.9×	64 0.9×	7 0.3×	10 0.8×	12 1.1×	7	94
Élie de Panafieu France	2	107 1.2×	52 0.7×	18 0.9×	46 3.5×	4 0.4×	6	122

Countries citing papers authored by Razvan Barbulescu

Since Specialization

Citations

This map shows the geographic impact of Razvan Barbulescu'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 Razvan Barbulescu with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Razvan Barbulescu more than expected).

Fields of papers citing papers by Razvan Barbulescu

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Razvan Barbulescu. 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 Razvan Barbulescu. The network helps show where Razvan Barbulescu may publish in the future.

Co-authorship network of co-authors of Razvan Barbulescu

This figure shows the co-authorship network connecting the top 25 collaborators of Razvan Barbulescu. A scholar is included among the top collaborators of Razvan Barbulescu 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 Razvan Barbulescu. Razvan Barbulescu is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

10 of 10 papers shown

1.

Barbulescu, Razvan, et al.. (2024). ECM and the Elliott–Halberstam conjecture for quadratic fields. Acta Arithmetica. 213(4). 289–324.

2.

Barbulescu, Razvan, et al.. (2021). A classification of ECM-friendly families of elliptic curves using modular curves. Mathematics of Computation. 1 indexed citations

3.

Barbulescu, Razvan, et al.. (2021). A classification of ECM-friendly families using modular curves. Mathematics of Computation. 1 indexed citations

4.

Barbulescu, Razvan, et al.. (2020). Numerical verification of the Cohen–Lenstra–Martinet heuristics and of Greenberg’s p -rationality conjecture. Journal de Théorie des Nombres de Bordeaux. 32(1). 159–177. 2 indexed citations

5.

Barbulescu, Razvan & Sylvain Duquesne. (2018). Updating Key Size Estimations for Pairings. Journal of Cryptology. 32(4). 1298–1336. 91 indexed citations

6.

Barbulescu, Razvan, et al.. (2017). SOME REMARKS AND EXPERIMENTS ON GREENBERG'S p-RATIONALITY CONJECTURE. arXiv (Cornell University). 3 indexed citations

7.

Barbulescu, Razvan. (2015). Selecting polynomials for the Function Field Sieve. Mathematics of Computation. 84(296). 2987–3012. 2 indexed citations

8.

Barbulescu, Razvan, et al.. (2014). The multiple number field sieve for medium- and high-characteristic finite fields. LMS Journal of Computation and Mathematics. 17(A). 230–246. 5 indexed citations

9.

Barbulescu, Razvan, et al.. (2013). Finding ECM-friendly curves through a study of Galois properties. 1(1). 63–86. 1 indexed citations

10.

Barbulescu, Razvan. (2009). Familles de courbes adaptées à la factorisation des entiers. SPIRE - Sciences Po Institutional REpository. 1 indexed citations

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