Communication complexity in lattices
Ahlswede, Rudolf ; Cai, Ning ; Tamm, UlrichIn: Applied Mathematics Letters, Jg. 6 H. 6, S. 53-581993Diametric theorems in sequence spaces
Ahlswede, Rudolf ; Cai, Ning ; Zhang, ZhenIn: Combinatorica, Jg. 12 H. 1, S. 1-171992A general 4-words inequality with consequences for 2-way communication complexity
Ahlswede, Rudolf ; Cai, Ning ; Zhang, ZhenIn: Advances in Applied Mathematics, Jg. 10 H. 1, S. 75-941989A generalization of the AZ identity
Ahlswede, Rudolf ; Cai, NingIn: Combinatorica, Jg. 13 H. 3, S. 241-2471993A new direction in extremal theory
Ahlswede, Rudolf ; Cai, Ning ; Zhang, ZhenIn: Journal of combinatorics, information and system sciences, Jg. 19 H. 3, S. 269-2801994On communication complexity of vector-valued functions
Ahlswede, Rudolf ; Cai, NingIn: IEEE transactions on information theory, Jg. 40 H. 6, S. 2062-20671994On extremal set partitions in Cartesian product spaces
Ahlswede, Rudolf ; Cai, NingIn: Combinatorics, Probability & Computing, Jg. 2 H. 2, S. 211-2201993On partitioning and packing products with rectangles
Ahlswede, Rudolf ; Cai, NingIn: Combinatorics, Probability & Computing, Jg. 3 H. 04, S. 429-4341994Rank formulas for certain products of matrices
Ahlswede, Rudolf ; Cai, NingIn: Applicable Algebra in Engineering, Communication and Computing, Jg. 4 H. 4, S. 253-2611993A recursive bound for the number of complete K-subgraphs of a graph
Ahlswede, Rudolf ; Cai, Ning ; Zhang, Zhen ; Bodendiek, Rainer (Hrsg.) ; Henn, Rudolf (Hrsg.)1990Rich colorings with local constraints
Ahlswede, Rudolf ; Cai, Ning ; Zhang, ZhenIn: Journal of combinatorics, information & system sciences, Jg. 17 H. 3, S. 203-2161992Two proofs of Pinsker's conjecture concerning arbitrarily varying channels
Ahlswede, Rudolf ; Cai, NingIn: IEEE transactions on information theory, Jg. 37 H. 6, S. 1647-16491991Two-way communication complexity of sum-type functions for one processor to be informed
Ahlswede, Rudolf ; Cai, NingIn: Problems of information transmission, Jg. 30 H. 1, S. 3-101994