B. R. Heap
Comment: I do not understand the claim that there are sufficient sources. Based upon his citations collectively he does not pass WP:NPROF. The only ways would be:1. If his algorithm was notable enough to pass WP:NPROF#C1 via 1b by itself. However, the algorithm has only about 160 cites, and a number closer to 5K would be needed. In addition, the term "heap" is used frequently and is not connected to him.2. If he has awards that would qualify him via WP:NPROF#C2. There are none cited here. Ldm1954 (talk) 21:13, 18 August 2026 (UTC)
B. R. Heap was affiliated with the Mathematics Division of the National Physical Laboratory (NPL) in Teddington, England.[1] In computer science, Heap is known for Heap's algorithm, a method for generating permutations that he presented in his 1963 paper Permutations by Interchanges in The Computer Journal.[2] The method generates successive permutations using interchanges between pairs of objects.[2] Heap's method was later discussed in Robert Sedgewick's 1977 survey of permutation-generation methods.[3]
Research
During the 1960s, several of his papers listed his affiliation as the Mathematics Division of the National Physical Laboratory.[1][4]
With M. S. Lynn, Heap published research on non-negative matrices and the Frobenius problem. Their work included The Index of Primitivity of a Non-Negative Matrix in 1964 and an improved algorithm for a linear Diophantine problem of Frobenius in 1965.[5][1]
Heap also published work in graph theory. In 1966 he co-authored Lattice Constant Systems and Graph Theory with M. F. Sykes, J. W. Essam and B. J. Hiley,[6] and in the same year published The Enumeration of Homeomorphically Irreducible Star Graphs.[4]
In 1967, Heap and Lynn published A Note on p-Cyclic Matrices and Digraphs. The paper listed Heap at the National Physical Laboratory and stated that his contribution formed part of the NPL research programme.[7]
Selected publications
- Heap, B. R. (1963). "Permutations by Interchanges". The Computer Journal. 6 (3): 293–298.
- Heap, B. R.; Lynn, M. S. (1964). "The Index of Primitivity of a Non-Negative Matrix". Numerische Mathematik. 6: 120–141.
- Heap, B. R.; Lynn, M. S. (1965). "On a linear diophantine problem of Frobenius: an improved algorithm". Numerische Mathematik. 7: 226–231.
- Sykes, M. F.; Essam, J. W.; Heap, B. R.; Hiley, B. J. (1966). "Lattice Constant Systems and Graph Theory". Journal of Mathematical Physics. 7 (9): 1557–1572.
- Heap, B. R. (1966). "The Enumeration of Homeomorphically Irreducible Star Graphs". Journal of Mathematical Physics. 7 (9): 1582–1587.
- Heap, B. R.; Lynn, M. S. (1967). "A Note on p-Cyclic Matrices and Digraphs". Canadian Mathematical Bulletin. 10 (4): 497–501.
References
- ↑ 1.0 1.1 1.2 Heap, B. R.; Lynn, M. S. (1965). "On a linear diophantine problem of Frobenius: an improved algorithm". Numerische Mathematik. 7: 226–231. doi:10.1007/BF01436078.
- ↑ 2.0 2.1 Heap, B. R. (1963). "Permutations by Interchanges". The Computer Journal. 6 (3): 293–298. doi:10.1093/comjnl/6.3.293.
- ↑ Sedgewick, Robert (1977). "Permutation Generation Methods". ACM Computing Surveys. 9 (2): 137–164. doi:10.1145/356689.356692.
- ↑ 4.0 4.1 Heap, B. R. (1966). "The Enumeration of Homeomorphically Irreducible Star Graphs". Journal of Mathematical Physics. 7 (9): 1582–1587. doi:10.1063/1.1705068.
- ↑ Heap, B. R.; Lynn, M. S. (1964). "The Index of Primitivity of a Non-Negative Matrix". Numerische Mathematik. 6: 120–141. doi:10.1007/BF01386062.
- ↑ Sykes, M. F.; Essam, J. W.; Heap, B. R.; Hiley, B. J. (1966). "Lattice Constant Systems and Graph Theory". Journal of Mathematical Physics. 7 (9): 1557–1572. doi:10.1063/1.1705066.
- ↑ Heap, B. R.; Lynn, M. S. (1967). "A Note on p-Cyclic Matrices and Digraphs". Canadian Mathematical Bulletin. 10 (4): 497–501. doi:10.4153/CMB-1967-047-1.
This article "B. R. Heap" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:B. R. Heap. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.
