Lawrence H. Harper

According to our database1, Lawrence H. Harper authored at least 13 papers between 1975 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
The Absolute Orders on the Coxeter Groups $A_n$ and $B_n$ are Sperner.
Electron. J. Comb., 2020

2014
Morphisms for resistive electrical networks.
Discret. Appl. Math., 2014

2003
Accidental combinatorist, an autobiography.
Theor. Comput. Sci., 2003

On the bandwidth of a Hamming graph.
Theor. Comput. Sci., 2003

2002
Size of the Largest Antichain in a Partition Poset.
Probl. Inf. Transm., 2002

2000
Morphisms for the Maximum Weight Ideal Problem.
J. Comb. Theory A, 2000

1999
On an Isoperimetric Problem for Hamming Graphs.
Discret. Appl. Math., 1999

1991
On a problem of Kleitman and West.
Discret. Math., 1991

1983
Some Remarks on Normalized Matching.
J. Comb. Theory A, 1983

1982
A Solution of the Sperner-Erdös Problem.
Theor. Comput. Sci., 1982

Linear Programming, the Global Approach.
J. Comb. Theory A, 1982

1980
A Sperner Theorem for the Interval Order of a Projective Geometry.
J. Comb. Theory A, 1980

1975
A Class of Boolean Functions with Linear Combinational Complexity.
Theor. Comput. Sci., 1975


  Loading...