A Class of Boolean Functions with Linear Combinational Complexity. - Lawrence H. Harper; W. N. Hsieh; S. E. Savage (Theor. Comput. Sci., 1975)

A Sperner Theorem for the Interval Order of a Projective Geometry. - Lawrence H. Harper (J. Comb. Theory A, 1980)

Linear Programming, the Global Approach. - Lawrence H. Harper (J. Comb. Theory A, 1982)

A Solution of the Sperner-Erdös Problem. - Xavier Berenguer; Josep Díaz; Lawrence H. Harper (Theor. Comput. Sci., 1982)

Some Remarks on Normalized Matching. - Douglas B. West; Lawrence H. Harper; David E. Daykin (J. Comb. Theory A, 1983)

On a problem of Kleitman and West. - Lawrence H. Harper (Discret. Math., 1991)

On an Isoperimetric Problem for Hamming Graphs. - Lawrence H. Harper (Discret. Appl. Math., 1999)

Morphisms for the Maximum Weight Ideal Problem. - Lawrence H. Harper (J. Comb. Theory A, 2000)

Size of the Largest Antichain in a Partition Poset. - Vladimir M. Blinovsky; Lawrence H. Harper (Probl. Inf. Transm., 2002)

On the bandwidth of a Hamming graph. - Lawrence H. Harper (Theor. Comput. Sci., 2003)

Accidental combinatorist, an autobiography. - Lawrence H. Harper (Theor. Comput. Sci., 2003)

Morphisms for resistive electrical networks. - Lawrence H. Harper (Discret. Appl. Math., 2014)

The Absolute Orders on the Coxeter Groups $A_n$ and $B_n$ are Sperner. - Lawrence H. Harper; Gene B. Kim; Neal Livesay (Electron. J. Comb., 2020)