LIST OF PUBLICATIONS

Ulrich Tamm



Diploma Thesis and Dissertation

Zur Kommunikationskomplexität des Hamming--Abstands,
Diploma Thesis, Universität Bielefeld, 1987.

Zur Kommunikationskomplexität von Summentyp--Funktionen,
PhD Dissertation, Universität Bielefeld, 1991.

On the Communication Complexity of Sum-Type Functions,
Preprint 91-016, SFB 343, "Discrete Structures in Mathematics", University of Bielefeld, 1991. (translation of PhD dissertation).

Orthogonal Polynomials in Information Theory, Habilitation, 2002.


Publications in Journals and Books


1. Communication complexity in lattices.
   Applied Mathematics Letters 6, no. 6, 53-58, 1993, also Preprint 93-030, SFB 343, "Discrete Structures in Mathematics", University of Bielefeld, 1993.
   (with R. Ahlswede and N. Cai).
   
   
2. Still another rank determination of set intersection matrices with an application in communication complexity.
   Applied Mathematics Letters 7, no. 2, 39-44, 1994.
   
   
3. Communication complexity of sum-type functions invariant under translation.
   Information and Computation 116, no. 2, 162-173, 1995.
   
   
4. Deterministic communication complexity of set intersection.
   Discrete Applied Mathematics 61, no. 3, 271--283, 1995, also Preprint 91-077, SFB 343, "Discrete Structures in Mathematics", University of Bielefeld, 1991.
   
   
5. Splittings of cyclic groups and perfect shift codes,
   IEEE Transactions on Information Theory 44, no. 5, 2003-2009, 1998,, also Preprint 97-112, SFB 343, "Discrete Structures in Mathematics", University of Bielefeld, 1997.
   
   
6. Communication complexity of functions on direct sums,
   "Numbers, Information and Complexity" (Festschrift in honour of Rudolf Ahlswede),
   I. Althöfer, N. Cai, G. Dueck, L. Khachatrian, M. Pinsker, A. Sarközy, I. Wegener and Z. Zhang (eds.), pp. 589-602, Kluwer Academic Publishers, 2000.
   
   
7. Communication complexity and orthogonal polynomials,
   "Codes and Association Schemes" (A. Barg and S. Litsyn eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 56, pp. 277-285, American Mathematical Society, 2001.
   
   
8. Some aspects of Hankel matrices in Coding Theory and Combinatorics,
   The Electronic Journal of Combinatorics, 8, 2001, #A1, 31 pp..
   
   
9. Lattice paths not touching a given boundary,
   Journal of Statistical Planning and Inference, 105(2), 433-448, 2002.
   
   
10. Enumeration of rooted trees with fixed maximum vertex degree,
    Discrete Mathematics, submitted.
    
    
11. On a problem of Berlekamp,
    Problems of Information Transmission, submitted
    
    
    
    Reports in Proceedings
    
    Communication Complexity in Lattices,
    Proceedings of 6th Joint Swedish-Russian Workshop on Information Theory, Moelle, Sweden, pp. 456 - 460, 1993, ISBN 91-7167-002-5.
    also in Proceedings of 3rd Twente Workshop on Graphs and Combinatorial Optimization, pp. 191-194, Memorandum No. 1132, Univ. Twente, 1993.
    
    Communication Complexity of the Hamming Distance,
    Proceedings of the EIDMA Winter Meeting on Coding Theory, Information Theory and Cryptology, Eindhoven, The Netherlands, (H. C. A. van Tilborg and F. M. J. Willems eds.), p. 21, 1994, ISBN 90-75332-01-7.
    
    The Influence of Memory for a Special Permutation Channel,
    Proceedings 1995 International Symposium on Information Theory, Whistler, Canada, p. 72, 1995, ISBN 0-7803-2453-6.
    
    The Influence of Memory on Creating Order,
    Proceedings of 5th Japan - Benelux Workshop on Coding and Information Theory, Hakone, Japan, , (H. Morita and A. J. van Wijngaarden eds.), p. 12.1, 1996, ISBN 90-74249-08-6.
    
    Applications of Baranyai's theorem in Information Theory,
    Proceedings of 6th Benelux -- Japan Workshop on Coding and Information Theory, Essen, 1996, ISBN 90-74249-10-8.
    
    On Perfect 3- and 4- Shift N-Designs,
    Proceedings 2nd INTAS Meeting on Information Theory and Combinatorics, Essen, Germany, (A. J. H. Vinck ed.), pp. 37 - 39, 1997, ISBN 90-74249-15-9.
    
    Pascal -- like triangles in the enumeration of trees and sequences,
    Proceedings of 7th Benelux - Japan Workshop on Coding and Information Theory, Eltville, Germany 1997.
    
    On Perfect 3- Shift N-Designs,
    Proceedings 1997 International Symposium on Information Theory, Ulm, Germany, p. 454, 1997, ISBN 0-7803-3956-8.
    
    Splittings of cyclic groups, tilings of Euclidean space, and perfect shift designs,
    Proceedings 1998 International Symposium on Information Theory, MIT, Boston, p. 245, August 1998
    
    Communication complexity and association schemes,
    Proceedings 2000 International Symposium on Information Theory, Sorrento, p. 4, June 2000.
    
    
    Further Preprints in SFB 343
    
    The Influence of Memory on Creating Order, Preprint 96-031, SFB 343, "Discrete Structures in Mathematics", University of Bielefeld, 1996.
    
    Symposium "Numbers, Information and Complexity" in honour of R. Ahlswede,
    Preprint 98-010E, SFB 343, "Discrete Structures in Mathematics", University of Bielefeld, 1998 (with B. Balkenhol).
    
    Majorization in Lattice Path Enumeration and Creating Order, Preprint 00-108, SFB 343, "Discrete Structures in Mathematics", University of Bielefeld, 2000.
    
    
    In Preparation
    
    On a certain nonlinear difference equation.
    
    
    Lecture Notes
    
    Information and Complexity, about 500 pages on Data Compression, Information Theory, Communication Complexity, Cryptology.
    
    Stochastics, 90 pages.
    
    
    Reports for Math. Reviews