V. Ya. Pan, “Methods of computing values of polynomials”, Russian Math. Surveys, 21:1 (1966), 105

This publication is cited in the following 77 articles:

Ramona Anton, Nicolae Mihalache, François Vigneron, “Fast evaluation of real and complex polynomials”, Numer. Math., 157:1 (2025), 355
Francesco Antognazza, Alessandro Barenghi, Gerardo Pelosi, Ruggero Susella, 2024 IEEE International Symposium on Hardware Oriented Security and Trust (HOST), 2024, 431
Qi Pang, Jinhao Zhu, Helen Möllering, Wenting Zheng, Thomas Schneider, 2024 IEEE Symposium on Security and Privacy (SP), 2024, 4753
Victor Y. Pan, Soo Go, Qi Luan, Liang Zhao, “A New Fast Root-finder for Black Box Polynomials”, Theoretical Computer Science, 2024, 115022
Alin Bostan, Sergey Yurkevich, “Fast computation of the N-th term of a q-holonomic sequence and applications”, Journal of Symbolic Computation, 115 (2023), 96
Pablo Ilabaca Parra, Samuel Montejo-Sánchez, Juan A. Fraire, Richard Demo Souza, Sandra Céspedes, “Network Size Estimation for Direct-to-Satellite IoT”, IEEE Internet Things J., 10:7 (2023), 6111
S. E. Ivanov, A. D. Televnoi, “Chislenno-analiticheskii metod preobrazovanii dlya analiza nelineinykh matematicheskikh modelei polinomialnoi struktury”, Vestn. Astrakhan. gos. tekhn. un-ta. Ser. upravlenie, vychisl. tekhn. inform., 2022, no. 2, 97–109
Manuel Tiglio, Aarón Villanueva, “Reduced order and surrogate models for gravitational waves”, Living Rev Relativ, 25:1 (2022)
Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, Simon Perdrix, Sophie Tison, A Guided Tour of Artificial Intelligence Research, 2020, 51
Gerasimos C. Meletiou, Dimitrios S. Triantafyllou, Michael N. Vrahatis, Springer Optimization and Its Applications, 159, Computational Mathematics and Variational Analysis, 2020, 247
Alin Bostan, Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation, 2020, 46
Giuseppe Bilotta, Vito Zago, Alexis Hérault, High Performance Parallel Computing, 2019
Rima Bellal, El-sedik Lamini, Hacene Belbachir, Samir Tagzout, Adel Belouchrani, “Improved Affine Arithmetic-Based Precision Analysis for Polynomial Function Evaluation”, IEEE Trans. Comput., 68:5 (2019), 702
Yiannis N. Moschovakis, Abstract Recursion and Intrinsic Complexity, 2018
V. Ya. Pan, “Fast matrix multiplication and its algebraic neighbourhood”, Sb. Math., 208:11 (2017), 1661–1704
Florian Lemaitre, Benjamin Couturier, Lionel Lacassagne, “Cholesky factorization on SIMD multi-core architectures”, Journal of Systems Architecture, 79 (2017), 1
Mridul Nandi, Lecture Notes in Computer Science, 8540, Fast Software Encryption, 2015, 489
Simin Xu, Suhaib A. Fahmy, Ian V. McLoughlin, Proceedings of the 2014 ACM/SIGDA international symposium on Field-programmable gate arrays, 2014, 99
Markus Bläser, Perspectives in Computational Complexity, 2014, 117
Armin P. Barth, Algorithmik für Einsteiger, 2013, 95