Anton Leykin

1.2k total citations
37 papers, 388 citations indexed

About

Anton Leykin is a scholar working on Computational Theory and Mathematics, Algebra and Number Theory and Computational Mechanics. According to data from OpenAlex, Anton Leykin has authored 37 papers receiving a total of 388 indexed citations (citations by other indexed papers that have themselves been cited), including 26 papers in Computational Theory and Mathematics, 21 papers in Algebra and Number Theory and 19 papers in Computational Mechanics. Recurrent topics in Anton Leykin's work include Polynomial and algebraic computation (26 papers), Commutative Algebra and Its Applications (21 papers) and Advanced Numerical Analysis Techniques (19 papers). Anton Leykin is often cited by papers focused on Polynomial and algebraic computation (26 papers), Commutative Algebra and Its Applications (21 papers) and Advanced Numerical Analysis Techniques (19 papers). Anton Leykin collaborates with scholars based in United States, Czechia and Spain. Anton Leykin's co-authors include Jan Verschelde, Carlos Beltrán, Frank Sottile, Claudia S. Miller, Srikanth B. Iyengar, Anurag Singh, Uli Walther, Tomáš Pajdla, Ezra Miller and Graham Leuschke and has published in prestigious journals such as IEEE Transactions on Pattern Analysis and Machine Intelligence, IEEE Transactions on Power Systems and Mathematics of Computation.

In The Last Decade

Anton Leykin

32 papers receiving 344 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Anton Leykin United States 11 274 160 140 139 32 37 388
Térésa Krick Argentina 11 249 0.9× 90 0.6× 122 0.9× 122 0.9× 16 0.5× 29 344
Carlos D’Andrea Spain 11 298 1.1× 169 1.1× 181 1.3× 138 1.0× 20 0.6× 45 385
Nicolai Vorobjov United Kingdom 10 327 1.2× 67 0.4× 96 0.7× 118 0.8× 49 1.5× 27 434
Pablo Solernó Argentina 9 197 0.7× 55 0.3× 83 0.6× 66 0.5× 38 1.2× 22 244
Grégoire Lecerf France 15 598 2.2× 207 1.3× 190 1.4× 185 1.3× 42 1.3× 46 687
Adam Strzeboński United States 12 269 1.0× 93 0.6× 34 0.2× 58 0.4× 40 1.3× 27 351
Henri Lombardi France 14 429 1.6× 79 0.5× 289 2.1× 233 1.7× 28 0.9× 67 654
P. Gianni Italy 7 276 1.0× 94 0.6× 95 0.7× 84 0.6× 17 0.5× 12 349
Masayuki Noro Japan 7 155 0.6× 35 0.2× 83 0.6× 90 0.6× 17 0.5× 25 245
Luis Miguel Pardo Spain 14 568 2.1× 204 1.3× 272 1.9× 199 1.4× 43 1.3× 45 646

Countries citing papers authored by Anton Leykin

Since Specialization
Citations

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

Fields of papers citing papers by Anton Leykin

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Anton Leykin

This figure shows the co-authorship network connecting the top 25 collaborators of Anton Leykin. A scholar is included among the top collaborators of Anton Leykin 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 Anton Leykin. Anton Leykin 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.
Leykin, Anton, et al.. (2025). Geometric Solution to the Angles-Only Initial Orbit Determination Problem. The Journal of the Astronautical Sciences. 72(5).
2.
Jensen, Anders & Anton Leykin. (2025). Smale's 6th Problem for Generic Masses. 1(2).
3.
Leykin, Anton, et al.. (2024). PL$${}_{1}$$P: Point-Line Minimal Problems under Partial Visibility in Three Views. International Journal of Computer Vision. 132(8). 3302–3323.
4.
Leykin, Anton, et al.. (2023). u-generation: solving systems of polynomials equation-by-equation. Numerical Algorithms. 95(2). 813–838. 1 indexed citations
5.
Chen, Justin, et al.. (2022). Noetherian operators in Macaulay2. 12(1). 33–41. 2 indexed citations
6.
Chen, Justin, et al.. (2021). Noetherian operators and primary decomposition. Journal of Symbolic Computation. 110. 1–23. 2 indexed citations
7.
Hillar, Christopher J., et al.. (2019). Equivariant Gröbner bases. Advanced studies in pure mathematics.
8.
Leykin, Anton, et al.. (2019). PLMP - Point-Line Minimal Problems in Complete Multi-View Visibility. 1675–1684. 20 indexed citations
9.
Leykin, Anton, et al.. (2016). Eliminating dual spaces. Journal of Symbolic Computation. 79. 609–622. 2 indexed citations
10.
Beltrán, Carlos & Anton Leykin. (2013). Robust Certified Numerical Homotopy Tracking. Foundations of Computational Mathematics. 13(2). 253–295. 23 indexed citations
11.
Leykin, Anton, et al.. (2010). Algorithms for Bernstein--Sato polynomials and multiplier ideals. 99–106. 4 indexed citations
12.
Aschenbrenner, Matthias & Anton Leykin. (2009). Degree bounds for Gröbner bases in algebras of solvable type. Journal of Pure and Applied Algebra. 213(8). 1578–1605. 2 indexed citations
13.
Iyengar, Srikanth B., Graham Leuschke, Anton Leykin, et al.. (2007). Twenty-Four Hours of Local Cohomology. Graduate studies in mathematics. 52 indexed citations
14.
Leykin, Anton & Frank Sottile. (2007). Computing monodromy via parallel homotopy continuation. 97–98. 1 indexed citations
15.
Leykin, Anton, et al.. (2006). Newton's method with deflation for isolated singularities of polynomial systems. Theoretical Computer Science. 359(1-3). 111–122. 84 indexed citations
16.
Leykin, Anton. (2004). On parallel computation of grobner bases. Proceedings of the International Conference on Parallel Processing. 160–164. 4 indexed citations
17.
Leykin, Anton. (2004). Algorithmic proofs of two theorems of Stafford. Journal of Symbolic Computation. 38(6). 1535–1550. 10 indexed citations
18.
Lyubeznik, Gennady & Anton Leykin. (2003). Algorithms in computational algebraic analysis. 2 indexed citations
19.
Leykin, Anton. (2002). D-MODULES FOR MACAULAY 2. 169–179. 5 indexed citations
20.
Leykin, Anton. (2001). Constructibility of the Set of Polynomials with a Fixed Bernstein–Sato Polynomial: an Algorithmic Approach. Journal of Symbolic Computation. 32(6). 663–675. 13 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

Rankless by CCL
2026