L. H. Harper

1.9k total citations
36 papers, 1.0k citations indexed

About

L. H. Harper is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, L. H. Harper has authored 36 papers receiving a total of 1.0k indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Computational Theory and Mathematics, 7 papers in Discrete Mathematics and Combinatorics and 7 papers in Geometry and Topology. Recurrent topics in L. H. Harper's work include semigroups and automata theory (7 papers), graph theory and CDMA systems (5 papers) and Limits and Structures in Graph Theory (5 papers). L. H. Harper is often cited by papers focused on semigroups and automata theory (7 papers), graph theory and CDMA systems (5 papers) and Limits and Structures in Graph Theory (5 papers). L. H. Harper collaborates with scholars based in United States, Spain and Germany. L. H. Harper's co-authors include John E. Savage, Ronald Graham, Thomas H. Payne, E. G. Straus, E. Rodney Canfield, Josep Dı́az, D. E. Daykin, János Balogh, X. Obradors and Ákos Seress and has published in prestigious journals such as Communications of the ACM, Transactions of the American Mathematical Society and SIAM Journal on Computing.

In The Last Decade

L. H. Harper

33 papers receiving 869 citations

Peers

Countries citing papers authored by L. H. Harper

Since Specialization

Citations

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

Fields of papers citing papers by L. H. Harper

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of L. H. Harper

This figure shows the co-authorship network connecting the top 25 collaborators of L. H. Harper. A scholar is included among the top collaborators of L. H. Harper 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 L. H. Harper. L. H. Harper 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

#	Work	Indexed citations
1	On the bandwidth of 3-dimensional Hamming graphs 2008 ·Theoretical Computer Science ·János Balogh, (unknown), L. H. Harper, Ákos Seress	5
2	The Edge-Isoperimetric Problem for Regular Planar Tesselations. 2001 ·Ars Combinatoria ·L. H. Harper	0
3	Morphisms for the Maximum Weight Ideal Problem 2000 ·Journal of Combinatorial Theory Series A ·L. H. Harper	1
4	The congestion of n-cube layout on a rectangular grid 2000 ·Discrete Mathematics ·(unknown), (unknown), L. H. Harper, (unknown), (unknown)	62
5	On an isoperimetric problem for Hamming graphs 1999 ·Discrete Applied Mathematics ·L. H. Harper	16
6	Duality Theorems for a Continuous Analog of Ford-Fulkerson Flows in Networks 1993 ·Advances in Applied Mathematics ·(unknown), L. H. Harper	1
7	On a problem of Kleitman and West 1991 ·Discrete Mathematics ·L. H. Harper	9
8	Some remarks on normalized matching 1983 ·Journal of Combinatorial Theory Series A ·Douglas B. West, L. H. Harper, D. E. Daykin	4
9	A solution of the Sperner-Erdös problem 1982 ·Theoretical Computer Science ·X. Obradors, Josep Dı́az, L. H. Harper	2
10	Linear programming, the global approach 1982 ·Journal of Combinatorial Theory Series A ·L. H. Harper	2
11	The global theory of paths in networks. I. Definitions, examples and limits 1981 ·Advances in Applied Mathematics ·L. H. Harper, X. Obradors	0
12	A Sperner theorem for the interval order of a projective geometry 1980 ·Journal of Combinatorial Theory Series A ·L. H. Harper	1
13	The global theory of flows in networks 1980 ·Advances in Applied Mathematics ·L. H. Harper	12
14	Estabilización y resolución de algunos problemas combinatorios en grafos simétricos 1979 ·UPCommons institutional repository (Universitat Politècnica de Catalunya) ·X. Obradors, L. H. Harper	1
15	A class of boolean functions with linear combinational complexity 1975 ·Theoretical Computer Science ·L. H. Harper, (unknown), John E. Savage	10
16	The morphology of partially ordered sets 1974 ·Journal of Combinatorial Theory Series A ·L. H. Harper	37
17	Reducing the Complexity of Calculating Syndromes for Error-Correcting Codes 1972 ·L. H. Harper, John E. Savage	1
18	A necessary condition on minimal cube numberings 1967 ·Journal of Applied Probability ·L. H. Harper	11
19	Capacities of sets and harmonic analysis on the group 2^{𝜔} 1967 ·Transactions of the American Mathematical Society ·L. H. Harper	5
20	Optimal numberings and isoperimetric problems on graphs 1966 ·Journal of Combinatorial Theory ·L. H. Harper	245

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