C. Andrew Neff

963 total citations
16 papers, 708 citations indexed

About

C. Andrew Neff is a scholar working on Computational Theory and Mathematics, Computational Mechanics and Artificial Intelligence. According to data from OpenAlex, C. Andrew Neff has authored 16 papers receiving a total of 708 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Computational Theory and Mathematics, 6 papers in Computational Mechanics and 4 papers in Artificial Intelligence. Recurrent topics in C. Andrew Neff's work include Polynomial and algebraic computation (9 papers), Advanced Numerical Analysis Techniques (6 papers) and Coding theory and cryptography (3 papers). C. Andrew Neff is often cited by papers focused on Polynomial and algebraic computation (9 papers), Advanced Numerical Analysis Techniques (6 papers) and Coding theory and cryptography (3 papers). C. Andrew Neff collaborates with scholars based in United States and Israel. C. Andrew Neff's co-authors include Rida T. Farouki, John H. Reif, Don Coppersmith, R. Nair, Mikko Honkala and Achim Basermann and has published in prestigious journals such as Mathematics of Computation, ACM Transactions on Graphics and IBM Journal of Research and Development.

In The Last Decade

C. Andrew Neff

16 papers receiving 675 citations

Peers

C. Andrew Neff
Ronald Goldman United States
Hwan Pyo Moon South Korea
Chanderjit L. Bajaj United States
Evan C. Sherbrooke United States
Henry Moreton United States
Lee R. Nackman United States
Ioannis Ivrissimtzis United Kingdom
Ronald Goldman United States
C. Andrew Neff
Citations per year, relative to C. Andrew Neff C. Andrew Neff (= 1×) peers Ronald Goldman

Countries citing papers authored by C. Andrew Neff

Since Specialization
Citations

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

Fields of papers citing papers by C. Andrew Neff

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of C. Andrew Neff

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

All Works

16 of 16 papers shown
1.
Honkala, Mikko, et al.. (2008). Study and development of an efficient RC-in-RC-out MOR method. 1277–1280. 3 indexed citations
2.
Neff, C. Andrew. (2002). Specified precision polynomial root isolation is in NC. 1 2 3. 152–162. 14 indexed citations
3.
Neff, C. Andrew & John H. Reif. (2002). An O(n/sup 1+ε/ log b) algorithm for the complex roots problem. 540–547. 3 indexed citations
4.
Neff, C. Andrew & John H. Reif. (1996). An Efficient Algorithm for the Complex Roots Problem. Journal of Complexity. 12(2). 81–115. 33 indexed citations
5.
Farouki, Rida T. & C. Andrew Neff. (1995). Hermite interpolation by Pythagorean hodograph quintics. Mathematics of Computation. 64(212). 1589–1609. 165 indexed citations
6.
Farouki, Rida T. & C. Andrew Neff. (1995). Hermite Interpolation by Pythagorean Hodograph Quintics. Mathematics of Computation. 64(212). 1589–1589. 147 indexed citations
7.
Coppersmith, Don & C. Andrew Neff. (1994). Roots of a polynomial and its derivatives. Symposium on Discrete Algorithms. 271–279. 12 indexed citations
8.
Neff, C. Andrew. (1994). Specified precision polynomial root isolation is in NC. Journal of Computer and System Sciences. 48(3). 429–463. 22 indexed citations
9.
Neff, C. Andrew. (1990). Boundary convergence of functions in the meromorphic Nevanlinna class. Colloquium Mathematicum. 60(2). 477–506. 1 indexed citations
10.
Farouki, Rida T. & C. Andrew Neff. (1990). On the numerical condition of Bernstein-Bézier subdivision processes. Mathematics of Computation. 55(192). 637–647. 16 indexed citations
11.
Farouki, Rida T. & C. Andrew Neff. (1990). Analytic properties of plane offset curves. Computer Aided Geometric Design. 7(1-4). 83–99. 133 indexed citations
12.
Neff, C. Andrew. (1990). Finding the distance between two circles in three-dimensional space. IBM Journal of Research and Development. 34(5). 770–775. 14 indexed citations
13.
Farouki, Rida T. & C. Andrew Neff. (1990). Algebraic properties of plane offset curves. Computer Aided Geometric Design. 7(1-4). 101–127. 98 indexed citations
14.
Farouki, Rida T., et al.. (1989). Automatic parsing of degenerate quadric-surface intersections. ACM Transactions on Graphics. 8(3). 174–203. 39 indexed citations
15.
Neff, C. Andrew. (1989). Decomposing algebraic sets using Gröbner bases. Computer Aided Geometric Design. 6(3). 249–263. 5 indexed citations
16.
Neff, C. Andrew & R. Nair. (1987). A Ranking Algorithm for MOS Circuit Layouts. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 6(1). 17–21. 3 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