Generalization of Statistical Korovkin Theorems. - Alperen Ali Ergür; Oktay Duman (J. Appl. Math., 2013)

Probabilistic Condition Number Estimates for Real Polynomial Systems II: Structure and Smoothed Analysis. - Alperen Ali Ergür; Grigoris Paouris; J. Maurice Rojas (CoRR, 2018)

Multihomogeneous Nonnegative Polynomials and Sums of Squares. - Alperen Ali Ergür (Discret. Comput. Geom., 2018)

Plantinga-Vegter Algorithm takes Average Polynomial Time. - Felipe Cucker; Alperen Ali Ergür; Josué Tonelli-Cueto (ISSAC, 2019)

The rank of sparse random matrices. - Amin Coja-Oghlan; Alperen Ali Ergür; Samuel Hetterich; Maurice Rolvien (CoRR, 2019)

A Polyhedral Homotopy Algorithm For Real Zeros. - Alperen Ali Ergür; Timo de Wolff (CoRR, 2019)

Probabilistic Condition Number Estimates for Real Polynomial Systems I: A Broader Family of Distributions. - Alperen Ali Ergür; Grigoris Paouris; J. Maurice Rojas (Found. Comput. Math., 2019)

On the Number of Real Zeros of Random Fewnomials. - Peter Bürgisser; Alperen Ali Ergür; Josué Tonelli-Cueto (SIAM J. Appl. Algebra Geom., 2019)

Approximating Nonnegative Polynomials via Spectral Sparsification. - Alperen Ali Ergür (SIAM J. Optim., 2019)

Functional norms, condition numbers and numerical algorithms in algebraic geometry. - Felipe Cucker; Alperen Ali Ergür; Josué Tonelli-Cueto (CoRR, 2021)

Smoothed analysis for the condition number of structured real polynomial systems. - Alperen Ali Ergür; Grigoris Paouris; J. Maurice Rojas (Math. Comput., 2021)

Beyond Worst-Case Analysis for Root Isolation Algorithms. - Alperen Ali Ergür; Josué Tonelli-Cueto; Elias P. Tsigaridas (ISSAC, 2022)

A Near-Optimal Expected Boolean Complexity Bound for Descartes Solver. - Alperen Ali Ergür; Josué Tonelli-Cueto; Elias P. Tsigaridas (CoRR, 2022)

The Boolean complexity of computing Chow forms. - Mahmut Levent Dogan; Alperen Ali Ergür; Elias P. Tsigaridas (CoRR, 2022)

Approximate Low-Rank Decomposition for Real Symmetric Tensors. - Alperen Ali Ergür; Jesus Rebollo Bueno; Petros Valettas (CoRR, 2022)

On the Complexity of the Plantinga-Vegter Algorithm. - Felipe Cucker; Alperen Ali Ergür; Josué Tonelli-Cueto (Discret. Comput. Geom., 2022)

The Multivariate Schwartz-Zippel Lemma. - M. Levent Dogan; Alperen Ali Ergür; Jake D. Mundo; Elias P. Tsigaridas (SIAM J. Discret. Math., 2022)

The rank of sparse random matrices. - Amin Coja-Oghlan; Alperen Ali Ergür; Pu Gao; Samuel Hetterich; Maurice Rolvien (Random Struct. Algorithms, 2023)

On the Complexity of Chow and Hurwitz Forms. - M. Levent Dogan; Alperen Ali Ergür; Elias P. Tsigaridas (ACM Commun. Comput. Algebra, 2023)

Feasibility of Circuit Polynomials without Purple Swans: Feasibility without Purple Swans. - Weixun Deng; Alperen Ali Ergür; Grigoris Paouris; J. Maurice Rojas (ISSAC, 2024)

Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms. - Alperen Ali Ergür; Josué Tonelli-Cueto; Elias P. Tsigaridas (CoRR, 2025)

On the number of iterations of the DBA algorithm. - Frederik Brüning; Anne Driemel; Alperen Ergür; Heiko Röglin (Data Min. Knowl. Discov., 2025)