On the "Log Rank"-Conjecture in Communication Complexity. - Ran Raz; Boris Spieker (Comb., 1995)

The Set of Super-stable Marriages Forms a Distributive Lattice. - Boris Spieker (Discret. Appl. Math., 1995)

On the communication complexity of t -intersection problems in generalized Boolean algebras. - Ulrich Faigle; Walter Kern; Boris Spieker (Math. Methods Oper. Res., 1996)