Ulrich Tamm

Available identifiers

Publication	Date of Publication	Type
Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions	2013-04-09	Paper
Creating Order and Ballot Sequences	2013-04-09	Paper
Reflections about a Single Checksum	2010-07-20	Paper
Size of downsets in the pushing order and a problem of Berlekamp	2008-09-29	Paper
Size of Downsets in the Pushing Order and a Problem of Berlekamp	2007-05-29	Paper
https://portal.mardi4nfdi.de/entity/Q5492548	2006-10-13	Paper
Lattice paths not touching a given boundary	2002-08-28	Paper
Some aspects of Hankel matrices in coding theory and combinatorics	2002-02-07	Paper
Communication complexity and orthogonal polynomials	2001-09-30	Paper
https://portal.mardi4nfdi.de/entity/Q4946043	2000-09-04	Paper
Splittings of cyclic groups and perfect shift codes	1999-11-21	Paper
Deterministic communication complexity of set intersection	1996-02-13	Paper
Communication complexity of sum-type functions invariant under translation	1995-05-28	Paper
Communication complexity in lattices	1994-06-23	Paper
Still another rank determination of set intersection matrices with an application in communication complexity	1994-05-24	Paper

This page was built for person: Ulrich Tamm