Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Ulrich Tamm
2010 – today
- 2013
[c4]
[c3]- 2011
[c2]- 2010
[c1]
2000 – 2009
- 2008
[j6]Ulrich Tamm: Size of downsets in the pushing order and a problem of Berlekamp. Discrete Applied Mathematics 156(9): 1560-1566 (2008)- 2005
[j5]Ulrich Tamm: Size of Downsets in the Pushing Order and a Problem of Berlekamp. Electronic Notes in Discrete Mathematics 21: 373-376 (2005)- 2001
[j4]Ulrich Tamm: Some Aspects of Hankel Matrices in Coding Theory and Combinatorics. Electr. J. Comb. 8(1) (2001)
1990 – 1999
- 1998
[j3]Ulrich Tamm: Splittings of Cyclic Groups and Perfect Shift Codes. IEEE Transactions on Information Theory 44(5): 2003-2009 (1998)- 1995
[j2]Ulrich Tamm: Deterministic Communication Complexity of Set Intersection. Discrete Applied Mathematics 61(3): 271-283 (1995)
[j1]Ulrich Tamm: Communication Complexity of Sum-Type Functions Invariant under Translation. Inf. Comput. 116(2): 162-173 (1995)
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-26 21:25 CEST by the dblp team



