Lawrence H. Harper

From MaRDI portal
Revision as of 22:34, 12 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Lawrence H. Harper to Lawrence H. Harper: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:783064

Available identifiers

zbMath Open harper.lawrence-hWikidataQ102142001 ScholiaQ102142001MaRDI QIDQ783064

List of research outcomes

PublicationDate of PublicationType
The symmetric group, ordered by refinement of cycles, is strongly Sperner2021-05-28Paper
The absolute orders on the Coxeter groups \(A_n\) and \(B_n\) are Sperner2020-07-30Paper
Morphisms for resistive electrical networks2014-02-07Paper
On the bandwidth of 3-dimensional Hamming graphs2008-11-18Paper
https://portal.mardi4nfdi.de/entity/Q54614522005-07-26Paper
Accidental combinatorist, an autobiography2004-10-27Paper
https://portal.mardi4nfdi.de/entity/Q44584142004-03-17Paper
The edge-isoperimetric problem on the 600-vertex regular solid2003-07-30Paper
On the bandwidth of a Hamming graph2003-07-30Paper
Size of the largest antichain in a partition poset2003-06-19Paper
Morphisms for the maximum weight ideal problem2001-05-17Paper
The congestion of \(n\)-cube layout on a rectangular grid2000-06-22Paper
On an isoperimetric problem for Hamming graphs2000-05-04Paper
https://portal.mardi4nfdi.de/entity/Q43593211998-03-18Paper
https://portal.mardi4nfdi.de/entity/Q48634121996-02-06Paper
https://portal.mardi4nfdi.de/entity/Q48634831996-02-06Paper
Large antichains in the partition lattice1995-02-09Paper
Duality theorems for a continuous analog of Ford-Fulkerson flows in networks1994-05-26Paper
On a problem of Kleitman and West1992-06-28Paper
A continuous analog of Ford-Fulkerson flows in networks and its application to a problem of Rota1992-06-25Paper
On a continuous analog of Sperner's problem1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34874421984-01-01Paper
Morphisms for the strong Sperner property of Stanley and Griggs1984-01-01Paper
Some remarks on normalized matching1983-01-01Paper
Linear programming the global approach1982-01-01Paper
The global theory of paths in networks. I: Definitions, examples and limits1981-01-01Paper
A Sperner theorem for the interval order of a projective geometry1980-01-01Paper
The global theory of flows in networks1980-01-01Paper
Lower Bounds on Synchronous Combinational Complexity1979-01-01Paper
An n logn Lower Bound on Synchronous Combinational Complexity1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41921071977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41381411976-01-01Paper
A class of Boolean functions with linear combinational complexity1975-01-01Paper
Sorting X + Y1975-01-01Paper
A Note on Some Classes of Boolean Functions1975-01-01Paper
The morphology of partially ordered sets1974-01-01Paper
On the complexity of the marriage problem1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56425701971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56309651970-01-01Paper
Some Results on Matching in Bipartite Graphs1969-01-01Paper
Stirling Behavior is Asymptotically Normal1967-01-01Paper
A necessary condition on minimal cube numberings1967-01-01Paper
Capacities of Sets and Harmonic Analysis on the Group 2&#9691967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55938061967-01-01Paper
A Family of Combinatorial Identities1966-01-01Paper
Optimal numberings and isoperimetric problems on graphs1966-01-01Paper
Optimal Assignments of Numbers to Vertices1964-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Lawrence H. Harper