We stand with Ukraine  

Ulrich Tamm

According to our database1, Ulrich Tamm authored at least 18 papers between 1995 and 2017.

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

2017
Proceedings of Workshop AEW10: Concepts in Information Theory and Communications.
[BibTeX]
[DOI]
Kees A. Schouhamer Immink
,
Stan Baggen
,
Ferdaous Chaabane
,
Yanling Chen
,
Peter H. N. de With
,
Héla Gassara
,
Hamed Gharbi
,
Adel Ghazel
,
Khaled Grati
,
Naira M. Grigoryan
,
Ashot N. Harutyunyan
,
Masayuki Imanishi
,
Mitsugu Iwamoto
,
Ken-ichi Iwata
,
Hiroshi Kamabe
,
Brian M. Kurkoski
,
Shigeaki Kuzuoka
,
Patrick Langenhuizen
,
Jan Lewandowsky
,
Akiko Manada
,
Shigeki Miyake
,
Hiroyoshi Morita
,
Jun Muramatsu
,
Safa Najjar
,
Arnak V. Poghosyan
,
Fatma Rouissi
,
Yuta Sakai
,
Ulrich Tamm
,
Joost van der Putten
,
Fons van der Sommen
,
A. J. Han Vinck
,
Tadashi Wadayama
,
Dirk Wübben
,
Hirosuke Yamamoto
CoRR, 2017

Claude Shannon in Chess Review.
[BibTeX]
[DOI]
Ulrich Tamm
Proceedings of the 2017 Information Theory and Applications Workshop, 2017

2016
Communication complexity of functions related to set intersection.
[BibTeX]
[DOI]
Ulrich Tamm
Proceedings of the 2016 Information Theory and Applications Workshop, 2016

2015
Integer codes and lattice packings by cubes of sidelength k.
[BibTeX]
[DOI]
Ulrich Tamm
Proceedings of the 2015 Information Theory and Applications Workshop, 2015

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

2013
Communication complexity and data compression.
[BibTeX]
[DOI]
Ulrich Tamm
Proceedings of the 2013 Information Theory and Applications Workshop, 2013

Lucas polynomials and power sums.
[BibTeX]
[DOI]
Ulrich Tamm
Proceedings of the 2013 Information Theory and Applications Workshop, 2013

Creating Order and Ballot Sequences.
[BibTeX]
[DOI]
Ulrich Tamm
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

Multiparty Communication Complexity of Vector-Valued and Sum-Type Functions.
[BibTeX]
[DOI]
Ulrich Tamm
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2011
Possible applications of information theory in logistics.
[BibTeX]
[DOI]
Ulrich Tamm
Proceedings of the Information Theory and Applications Workshop, 2011

2010
Reflections about a Single Checksum.
[BibTeX]
[DOI]
Ulrich Tamm
Proceedings of the Arithmetic of Finite Fields, Third International Workshop, 2010

2005
Size of Downsets in the Pushing Order and a Problem of Berlekamp.
[BibTeX]
[DOI]
Ulrich Tamm
Electron. Notes Discret. Math., 2005

On perfect integer codes.
[BibTeX]
[DOI]
Ulrich Tamm
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2001
Some Aspects of Hankel Matrices in Coding Theory and Combinatorics.
[BibTeX]
[DOI]
Ulrich Tamm
Electron. J. Comb., 2001

1999
Communication complexity and orthogonal polynomials.
[BibTeX]
[DOI]
Ulrich Tamm
Proceedings of the Codes and Association Schemes, 1999

1998
Splittings of Cyclic Groups and Perfect Shift Codes.
[BibTeX]
[DOI]
Ulrich Tamm
IEEE Trans. Inf. Theory, 1998

1995
Communication Complexity of Sum-Type Functions Invariant under Translation
[BibTeX]
[DOI]
Ulrich Tamm
Inf. Comput., February, 1995

Deterministic Communication Complexity of Set Intersection.
[BibTeX]
[DOI]
Ulrich Tamm
Discret. Appl. Math., 1995


  Loading...