Ulrich Tamm

According to our database1, Ulrich Tamm authored at least 19 papers between 1995 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Ning Cai: A Tribute to a Pioneering Scholar in Information Theory.
CoRR, 2024

2017
Proceedings of Workshop AEW10: Concepts in Information Theory and Communications.
CoRR, 2017

Claude Shannon in Chess Review.
Proceedings of the 2017 Information Theory and Applications Workshop, 2017

2016
Communication complexity of functions related to set intersection.
Proceedings of the 2016 Information Theory and Applications Workshop, 2016

2015
Integer codes and lattice packings by cubes of sidelength k.
Proceedings of the 2015 Information Theory and Applications Workshop, 2015

2014
Some refelections about the Lambert W function as inverse of x · log(x).
Proceedings of the 2014 Information Theory and Applications Workshop, 2014

2013
Communication complexity and data compression.
Proceedings of the 2013 Information Theory and Applications Workshop, 2013

Lucas polynomials and power sums.
Proceedings of the 2013 Information Theory and Applications Workshop, 2013

Creating Order and Ballot Sequences.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

Multiparty Communication Complexity of Vector-Valued and Sum-Type Functions.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2011
Possible applications of information theory in logistics.
Proceedings of the Information Theory and Applications Workshop, 2011

2010
Reflections about a Single Checksum.
Proceedings of the Arithmetic of Finite Fields, Third International Workshop, 2010

2008
Size of downsets in the pushing order and a problem of Berlekamp.
Discret. Appl. Math., 2008

2005
On perfect integer codes.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2001
Some Aspects of Hankel Matrices in Coding Theory and Combinatorics.
Electron. J. Comb., 2001

1999
Communication complexity and orthogonal polynomials.
Proceedings of the Codes and Association Schemes, 1999

1998
Splittings of Cyclic Groups and Perfect Shift Codes.
IEEE Trans. Inf. Theory, 1998

1995
Communication Complexity of Sum-Type Functions Invariant under Translation
Inf. Comput., February, 1995

Deterministic Communication Complexity of Set Intersection.
Discret. Appl. Math., 1995


  Loading...