Diplomarbeit und Dissertation

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

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



    Publikationen in Zeitschriften

  1. Communication complexity in lattices.
    Appl. Math. Lett. 6, no. 6, 53-58 (1993)
    (with R. Ahlswede and N. Cai)
    .
  2. Still another rank determination of set intersection matrices with an application in communication complexity.
    Appl. Math.Lett. 7, no. 2, 39-44 (1994).

  3. Communication complexity of sum-type functions invariant under translation.
    Inform. and Comput. 116, no. 2, 162-173 (1995).

  4. Deterministic communication complexity of set intersection.
    Discrete Appl. Math. 61, no. 3, 271--283 (1995).

  5. Splittings of cyclic groups and perfect shift codes,
    IEEE Trans. Inform. Theory 44, no. 5, 2003-2009 (1998).



    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.

    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. (new version)

    On Perfect 3- Shift N-Designs,
    Proceedings 1997 International Symposium on Information Theory, Ulm, Germany, p. 454, 1997, ISBN 0-7803-3956-8.

    Ballot sequences in creating order, Preprint

    Splittings of cyclic groups, tilings of Euclidean space, and perfect shift designs,
    Proceedings 1998 International Symposium on Information Theory, Boston, p. 245, August 1998

    The determinant of a Hessenberg matrix and some applications in discrete mathematics, Preprint


icon Hauptseite icon main site
 
For any questions and problems with this web site please email to cdeppe@Mathematik.Uni-Bielefeld.DE. Last change: 12/10/1998