default search action
Ulrich Tamm
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i2]Ingo Althöfer, Holger Boche, Christian Deppe, Ulrich Tamm, Andreas J. Winter, Raymond W. Yeung:
Ning Cai: A Tribute to a Pioneering Scholar in Information Theory. CoRR abs/2409.19398 (2024)
2010 – 2019
- 2017
- [c12]Ulrich Tamm:
Claude Shannon in Chess Review. ITA 2017: 1-3 - [i1]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:
Proceedings of Workshop AEW10: Concepts in Information Theory and Communications. CoRR abs/1707.08567 (2017) - 2016
- [c11]Ulrich Tamm:
Communication complexity of functions related to set intersection. ITA 2016: 1-4 - 2015
- [c10]Ulrich Tamm:
Integer codes and lattice packings by cubes of sidelength k. ITA 2015: 173-174 - 2014
- [c9]Ulrich Tamm:
Some refelections about the Lambert W function as inverse of x · log(x). ITA 2014: 1-4 - 2013
- [c8]Ulrich Tamm:
Multiparty Communication Complexity of Vector-Valued and Sum-Type Functions. Information Theory, Combinatorics, and Search Theory 2013: 451-462 - [c7]Ulrich Tamm:
Creating Order and Ballot Sequences. Information Theory, Combinatorics, and Search Theory 2013: 711-724 - [c6]Ulrich Tamm:
Lucas polynomials and power sums. ITA 2013: 1-4 - [c5]Ulrich Tamm:
Communication complexity and data compression. ITA 2013: 1-4 - 2011
- [c4]Ulrich Tamm:
Possible applications of information theory in logistics. ITA 2011: 383-385 - 2010
- [c3]Ulrich Tamm:
Reflections about a Single Checksum. WAIFI 2010: 238-249
2000 – 2009
- 2008
- [j6]Ulrich Tamm:
Size of downsets in the pushing order and a problem of Berlekamp. Discret. Appl. Math. 156(9): 1560-1566 (2008) - 2005
- [j5]Ulrich Tamm:
Size of Downsets in the Pushing Order and a Problem of Berlekamp. Electron. Notes Discret. Math. 21: 373-376 (2005) - [c2]Ulrich Tamm:
On perfect integer codes. ISIT 2005: 117-120 - 2001
- [j4]Ulrich Tamm:
Some Aspects of Hankel Matrices in Coding Theory and Combinatorics. Electron. J. Comb. 8(1) (2001)
1990 – 1999
- 1999
- [c1]Ulrich Tamm:
Communication complexity and orthogonal polynomials. Codes and Association Schemes 1999: 277-285 - 1998
- [j3]Ulrich Tamm:
Splittings of Cyclic Groups and Perfect Shift Codes. IEEE Trans. Inf. Theory 44(5): 2003-2009 (1998) - 1995
- [j2]Ulrich Tamm:
Deterministic Communication Complexity of Set Intersection. Discret. Appl. Math. 61(3): 271-283 (1995) - [j1]Ulrich Tamm:
Communication Complexity of Sum-Type Functions Invariant under Translation. Inf. Comput. 116(2): 162-173 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 19:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: