Deterministic Communication Complexity of Set Intersection. - Ulrich Tamm (Discret. Appl. Math., 1995)

Communication Complexity of Sum-Type Functions Invariant under Translation - Ulrich Tamm (Inf. Comput., 1995)

Splittings of Cyclic Groups and Perfect Shift Codes. - Ulrich Tamm (IEEE Trans. Inf. Theory, 1998)

Communication complexity and orthogonal polynomials. - Ulrich Tamm (Codes and Association Schemes, 1999)

Some Aspects of Hankel Matrices in Coding Theory and Combinatorics. - Ulrich Tamm (Electron. J. Comb., 2001)

On perfect integer codes. - Ulrich Tamm (ISIT, 2005)

Size of downsets in the pushing order and a problem of Berlekamp. - Ulrich Tamm (Discret. Appl. Math., 2008)

Reflections about a Single Checksum. - Ulrich Tamm (WAIFI, 2010)

Possible applications of information theory in logistics. - Ulrich Tamm (ITA, 2011)

Multiparty Communication Complexity of Vector-Valued and Sum-Type Functions. - Ulrich Tamm (Information Theory, Combinatorics, and Search Theory, 2013)

Creating Order and Ballot Sequences. - Ulrich Tamm (Information Theory, Combinatorics, and Search Theory, 2013)

Lucas polynomials and power sums. - Ulrich Tamm (ITA, 2013)

Communication complexity and data compression. - Ulrich Tamm (ITA, 2013)

Some refelections about the Lambert W function as inverse of x · log(x). - Ulrich Tamm (ITA, 2014)

Integer codes and lattice packings by cubes of sidelength k. - Ulrich Tamm (ITA, 2015)

Communication complexity of functions related to set intersection. - Ulrich Tamm (ITA, 2016)

Claude Shannon in Chess Review. - Ulrich Tamm (ITA, 2017)

Proceedings of Workshop AEW10: Concepts in Information Theory and Communications. - Kees A. Schouhamer Immink; Stan Baggen; Ferdaous Chaabane; Yanling Chen 001; Peter H. N. de With; Héla Gassara; Hamed Gharbi; Adel Ghazel; Khaled Grati; Naira M. Grigoryan; Ashot N. Harutyunyan; Masayuki Imanishi; et al. (CoRR, 2017)

Ning Cai: A Tribute to a Pioneering Scholar in Information Theory. - Ingo Althöfer; Holger Boche; Christian Deppe; Ulrich Tamm; Andreas J. Winter 002; Raymond W. Yeung (Information Theory and Related Fields, 2025)

Ning Cai's Work on Communication Complexity. - Ulrich Tamm (Information Theory and Related Fields, 2025)