Communication complexity in lattices
In: Applied Mathematics Letters, Jg. 6 H. 6, S. 53-58
Diametric theorems in sequence spaces
In: Combinatorica, Jg. 12 H. 1, S. 1-17A general 4-words inequality with consequences for 2-way communication complexity
In: Advances in Applied Mathematics, Jg. 10 H. 1, S. 75-94A generalization of the AZ identity
In: Combinatorica, Jg. 13 H. 3, S. 241-247A new direction in extremal theory
In: Journal of combinatorics, information and system sciences, Jg. 19 H. 3, S. 269-280On communication complexity of vector-valued functions
In: IEEE transactions on information theory, Jg. 40 H. 6, S. 2062-2067On extremal set partitions in Cartesian product spaces
In: Combinatorics, Probability & Computing, Jg. 2 H. 2, S. 211-220On partitioning and packing products with rectangles
In: Combinatorics, Probability & Computing, Jg. 3 H. 04, S. 429-434Rank formulas for certain products of matrices
In: Applicable Algebra in Engineering, Communication and Computing, Jg. 4 H. 4, S. 253-261Rich colorings with local constraints
In: Journal of combinatorics, information & system sciences, Jg. 17 H. 3, S. 203-216Two proofs of Pinsker's conjecture concerning arbitrarily varying channels
In: IEEE transactions on information theory, Jg. 37 H. 6, S. 1647-1649Two-way communication complexity of sum-type functions for one processor to be informed
In: Problems of information transmission, Jg. 30 H. 1, S. 3-10