K. E. Hillstrom

3.0k total citations · 1 hit paper
19 papers, 1.7k citations indexed

About

K. E. Hillstrom is a scholar working on Numerical Analysis, Computational Theory and Mathematics and Applied Mathematics. According to data from OpenAlex, K. E. Hillstrom has authored 19 papers receiving a total of 1.7k indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Numerical Analysis, 8 papers in Computational Theory and Mathematics and 7 papers in Applied Mathematics. Recurrent topics in K. E. Hillstrom's work include Mathematical functions and polynomials (6 papers), Mathematical Approximation and Integration (4 papers) and Matrix Theory and Algorithms (4 papers). K. E. Hillstrom is often cited by papers focused on Mathematical functions and polynomials (6 papers), Mathematical Approximation and Integration (4 papers) and Matrix Theory and Algorithms (4 papers). K. E. Hillstrom collaborates with scholars based in United States. K. E. Hillstrom's co-authors include B. S. Garbow, Jorge J. Morè, William J. Cody, Michael Minkoff, Henry C. Thacher and Noel A. Clark and has published in prestigious journals such as Communications of the ACM, Mathematics of Computation and ACM Transactions on Mathematical Software.

In The Last Decade

K. E. Hillstrom

18 papers receiving 1.5k citations

Hit Papers

Testing Unconstrained Optimization Software 1981 2026 1996 2011 1981 250 500 750 1000
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. Testing Unconstrained Optimization Software
    1981 1.1k citations Jorge J. Morè, B. S. Garbow et al. ACM Transactions on Mathematical Software profile →

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
K. E. Hillstrom United States 9 1.1k 814 351 241 156 19 1.7k
A. A. Goldstein United States 14 940 0.9× 954 1.2× 459 1.3× 221 0.9× 237 1.5× 35 1.8k
E. W. Cheney United States 22 1.0k 1.0× 985 1.2× 589 1.7× 231 1.0× 209 1.3× 60 3.1k
B. S. Garbow United States 13 1.2k 1.2× 1.2k 1.4× 515 1.5× 307 1.3× 267 1.7× 23 2.7k
Klaus Ritter Germany 21 874 0.8× 735 0.9× 385 1.1× 136 0.6× 218 1.4× 95 2.3k
J. M. Varah Canada 20 533 0.5× 577 0.7× 374 1.1× 96 0.4× 170 1.1× 46 1.6k
Luigi Grippo Italy 19 1.7k 1.6× 1.3k 1.6× 627 1.8× 429 1.8× 393 2.5× 42 2.3k
D. J. Evans United Kingdom 22 772 0.7× 929 1.1× 327 0.9× 166 0.7× 83 0.5× 241 2.2k
Emilie V. Haynsworth United States 15 561 0.5× 1.1k 1.4× 183 0.5× 113 0.5× 164 1.1× 29 1.8k
Fred T. Krogh United States 12 314 0.3× 533 0.7× 192 0.5× 172 0.7× 84 0.5× 42 1.5k
G. A. Watson United Kingdom 21 530 0.5× 576 0.7× 452 1.3× 116 0.5× 210 1.3× 98 1.7k

Countries citing papers authored by K. E. Hillstrom

Since Specialization
Citations

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

Fields of papers citing papers by K. E. Hillstrom

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of K. E. Hillstrom

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

All Works

19 of 19 papers shown
1.
Hillstrom, K. E.. (1982). JAKEF - a portable symbolic differentiator of functions given by algorithms. University of North Texas Digital Library (University of North Texas). 7 indexed citations
2.
Morè, Jorge J., B. S. Garbow, & K. E. Hillstrom. (1981). Algorithm 566: FORTRAN Subroutines for Testing Unconstrained Optimization Software [C5], [E4]. ACM Transactions on Mathematical Software. 7(1). 136–140. 32 indexed citations
3.
Morè, Jorge J., B. S. Garbow, & K. E. Hillstrom. (1981). Testing Unconstrained Optimization Software. ACM Transactions on Mathematical Software. 7(1). 17–41. 1133 indexed citations breakdown →
4.
Garbow, B. S., et al.. (1980). LCLSQ: An Implementation of an Algorithm for Linearly Constrained Linear Least-Squares Problems. University of North Texas Digital Library (University of North Texas). 4 indexed citations
5.
Hillstrom, K. E., et al.. (1980). Solution of the General Nonlinear Programming Problem with Subroutine VMCOM. University of North Texas Digital Library (University of North Texas). 34 indexed citations
6.
Morè, Jorge J., B. S. Garbow, & K. E. Hillstrom. (1980). User Guide for Minpack-1. University of North Texas Digital Library (University of North Texas). 396 indexed citations
7.
Garbow, B. S., K. E. Hillstrom, & Jorge J. Morè. (1980). Implementation guide for MINPACK-1. University of North Texas Digital Library (University of North Texas). 8 indexed citations
8.
Hillstrom, K. E.. (1977). A Simulation Test Approach to the Evaluation of Nonlinear Optimization Algorithms. ACM Transactions on Mathematical Software. 3(4). 305–315. 50 indexed citations
9.
Hillstrom, K. E., et al.. (1971). Chebyshev Approximations for the Riemann Zeta Function. Mathematics of Computation. 25(115). 537–537. 1 indexed citations
10.
Cody, William J., K. E. Hillstrom, & Henry C. Thacher. (1971). Chebyshev approximations for the Riemann zeta function. Mathematics of Computation. 25(115). 537–547. 9 indexed citations
11.
Cody, William J. & K. E. Hillstrom. (1970). Chebyshev approximations for the Coulomb phase shift. Mathematics of Computation. 24(111). 671–677. 14 indexed citations
12.
Hillstrom, K. E., et al.. (1970). Chebyshev Approximations for the Coulomb Phase Shift. Mathematics of Computation. 24(111). 671–671. 3 indexed citations
13.
Hillstrom, K. E.. (1970). Comparison of several adaptive Newton-Cotes quadrature routines in evaluating definite integrals with peaked integrands. Communications of the ACM. 13(6). 362–365. 8 indexed citations
14.
Hillstrom, K. E., et al.. (1967). Chebyshev Approximations for the Natural Logarithm of the Gamma Function. Mathematics of Computation. 21(98). 198–198. 2 indexed citations
15.
Cody, William J. & K. E. Hillstrom. (1967). Chebyshev approximations for the natural logarithm of the Gamma function. Mathematics of Computation. 21(98). 198–203. 12 indexed citations
16.
Hillstrom, K. E.. (1967). Certification of Algorithm 279: Chebyshev quadrature. Communications of the ACM. 10(5). 294–294. 2 indexed citations
17.
Clark, Noel A., et al.. (1967). Performance statistics of the Fortran IV (H) library for the IBM system/360. ACM SIGNUM Newsletter. 2(3). 3–3. 4 indexed citations
18.
Hillstrom, K. E.. (1967). Remark on Correction to Certification of Algorithm 279: Chebyshev Quadrature. Communications of the ACM. 10(10). 666–666. 3 indexed citations
19.
Hillstrom, K. E.. (1966). Certification of algorithm 257: Havie integrator. Communications of the ACM. 9(11). 795–795. 2 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

Breakdown of academic impact, for papers by A. A. Goldstein Breakdown of academic impact, for papers by E. W. Cheney Breakdown of academic impact, for papers by B. S. Garbow Breakdown of academic impact, for papers by Klaus Ritter Breakdown of academic impact, for papers by J. M. Varah Breakdown of academic impact, for papers by Luigi Grippo Breakdown of academic impact, for papers by D. J. Evans Breakdown of academic impact, for papers by Emilie V. Haynsworth Breakdown of academic impact, for papers by Fred T. Krogh Breakdown of academic impact, for papers by G. A. Watson
Rankless by CCL
2026