Paul K. Stockmeyer

1.2k total citations
25 papers, 708 citations indexed

About

Paul K. Stockmeyer is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Vision and Pattern Recognition. According to data from OpenAlex, Paul K. Stockmeyer has authored 25 papers receiving a total of 708 indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Computational Theory and Mathematics, 10 papers in Artificial Intelligence and 5 papers in Computer Vision and Pattern Recognition. Recurrent topics in Paul K. Stockmeyer's work include Algorithms and Data Compression (5 papers), semigroups and automata theory (4 papers) and Digital Image Processing Techniques (4 papers). Paul K. Stockmeyer is often cited by papers focused on Algorithms and Data Compression (5 papers), semigroups and automata theory (4 papers) and Digital Image Processing Techniques (4 papers). Paul K. Stockmeyer collaborates with scholars based in United States, Germany and France. Paul K. Stockmeyer's co-authors include William G. Poole, Norman E. Gibbs, Bennet Manvel, K. Smith, F. Frances Yao, D. Banks, Stephen Linton, Allen J. Schwenk, Andréas Hinz and Nicholas A. Loehr and has published in prestigious journals such as SIAM Journal on Numerical Analysis, SIAM Journal on Computing and IEEE Transactions on Visualization and Computer Graphics.

In The Last Decade

Paul K. Stockmeyer

23 papers receiving 622 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Paul K. Stockmeyer United States	10	334	189	125	121	117	25	708
William G. Poole United States	9	333 1.0×	222 1.2×	80 0.6×	158 1.3×	126 1.1×	12	759
Andrew H. Sherman United States	13	361 1.1×	178 0.9×	114 0.9×	241 2.0×	194 1.7×	32	934
Elizabeth Cuthill Sweden	4	376 1.1×	211 1.1×	125 1.0×	256 2.1×	195 1.7×	7	986
A. M. Erisman United States	9	336 1.0×	157 0.8×	40 0.3×	103 0.9×	73 0.6×	14	633
Rudolf Mathon Canada	15	235 0.7×	468 2.5×	305 2.4×	185 1.5×	39 0.3×	59	1.0k
T. Fujisawa Japan	13	263 0.8×	319 1.7×	53 0.4×	24 0.2×	119 1.0×	20	848
William A. Porter United States	15	162 0.5×	135 0.7×	182 1.5×	54 0.4×	67 0.6×	121	830
Yuji Nakatsukasa United Kingdom	17	376 1.1×	47 0.2×	170 1.4×	144 1.2×	43 0.4×	73	748
Henry Crapo France	18	505 1.5×	246 1.3×	138 1.1×	64 0.5×	75 0.6×	48	1.3k
J Rubinstein Australia	19	205 0.6×	160 0.8×	49 0.4×	15 0.1×	87 0.7×	100	1.0k

Countries citing papers authored by Paul K. Stockmeyer

Since Specialization

Citations

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

Fields of papers citing papers by Paul K. Stockmeyer

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Paul K. Stockmeyer

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

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Hinz, Andréas & Paul K. Stockmeyer. (2019). Discovering Fibonacci Numbers, Fibonacci Words, and a Fibonacci Fractal in the Tower of Hanoi. The Fibonacci quarterly. 57(5). 72–83. 2 indexed citations

2.

Stockmeyer, Paul K.. (2017). An Exploration of Sequence A000975. The Fibonacci quarterly. 55(5). 174–185. 3 indexed citations

3.

Stockmeyer, Paul K.. (2008). A Smooth Tight Upper Bound for the Fibonacci Representation Function R(n). The Fibonacci quarterly. 46-47(2). 103–106. 1 indexed citations

4.

Stockmeyer, Paul K.. (2005). The Tower of Hanoi: A Bibliography. 6 indexed citations

5.

Stockmeyer, Paul K.. (2004). What Did Lincoln Really Mean?. College Mathematics Journal. 35(2). 103–104. 1 indexed citations

6.

Banks, D., Stephen Linton, & Paul K. Stockmeyer. (2004). Counting cases in substitope algorithms. IEEE Transactions on Visualization and Computer Graphics. 10(4). 371–384. 17 indexed citations

7.

Watkins, Mark E., et al.. (2003). Algebraic Graph Theory. 484–609. 1 indexed citations

8.

Stockmeyer, Paul K.. (1996). The Average Distance between Nodes in the Cyclic Tower of Hanoi Digraph. 2 indexed citations

9.

Kløve, Torleiv, et al.. (1995). Problems: 10459-10465. American Mathematical Monthly. 102(6). 553–553. 2 indexed citations

10.

Stockmeyer, Paul K., et al.. (1995). Exchanging disks in the tower of hanoi. International Journal of Computer Mathematics. 59(1-2). 37–47. 4 indexed citations

11.

Stockmeyer, Paul K.. (1994). Variations on the Four-Post Tower of Hanoi Puzzle. 20 indexed citations

12.

Manvel, Bennet, et al.. (1991). Reconstruction of sequences. Discrete Mathematics. 94(3). 209–219. 30 indexed citations

13.

Stockmeyer, Paul K.. (1981). A census of non-reconstructable digraphs, I: Six related families. Journal of Combinatorial Theory Series B. 31(2). 232–239. 15 indexed citations

14.

Schwenk, Allen J., et al.. (1981). Pseudosimilar vertices in a graph. Journal of Graph Theory. 5(2). 171–181. 10 indexed citations

15.

Stockmeyer, Paul K. & F. Frances Yao. (1980). On the Optimality of Linear Merge. SIAM Journal on Computing. 9(1). 85–90. 12 indexed citations

16.

Stockmeyer, Paul K.. (1977). The falsity of the reconstruction conjecture for tournaments. Journal of Graph Theory. 1(1). 19–25. 55 indexed citations

17.

Gibbs, Norman E., et al.. (1976). Algorithm 508: Matrix Bandwidth and Profile Reduction [F1]. ACM Transactions on Mathematical Software. 2(4). 375–377. 31 indexed citations

18.

Gibbs, Norman E., William G. Poole, & Paul K. Stockmeyer. (1976). A Comparison of Several Bandwidth and Profile Reduction Algorithms. ACM Transactions on Mathematical Software. 2(4). 322–330. 74 indexed citations

19.

Manvel, Bennet & Paul K. Stockmeyer. (1971). On Reconstruction of Matrices. Mathematics Magazine. 44(4). 218–221. 7 indexed citations

20.

Manvel, Bennet & Paul K. Stockmeyer. (1971). On Reconstruction of Matrices. Mathematics Magazine. 44(4). 218–218. 6 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