Preprint-Server of the SFB 343

"Diskrete Strukturen in der Mathematik"

Directions for use
1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001

Search

Preprintreihe 2001 (Supplements)

01-001   M.V. Burnashev
         On Identification Capacity of Finite
         Alphabets or Continuous Time Channels 
         (PS) (PDF) 

01-002   Ning Cai, Kwok Yan Lam
         On Identification Secret Sharing
         Schemes 
         (PS) (PDF)

01-003   R. Ahlswede, N. Alon, P.L. Erdös, M. Ruszinko, L.A. Szekely
         Intersecting Systems 

01-004   R. Ahlswede, L.H. Khachatrian
         On Attractive and Friendly Sets in
         Sequence Spaces 

01-005   R. Ahlswede, B. Balkenhol, M. Fröhlich
         A Fast Seuffix-Sorting Algorithm 

01-006   R. Ahlswede
         Solution of Burashev's Problem and
         a Sharpening of the Erdös/Ko/Rado Theorem

01-007   R. Ahlswede, L.H. Khachatrian, C. Maudit, A. Sarközy
         On the Complexity of Families of Binary
         Sequences 

01-008   G.P. Chistyakov, F. Götze
         Limit Distributions of Studentized
         Means 


01-009   H. Krause, O. Solberg
         Filtering Modules of Finite Projective
         Dimension 
         (PS) (PDF)

01-010   A. Franklin, P. Jorgensen
         Foxby Equivalence, Complete Modules and
         Torsion Modules (PS) (PDF)

Ergänzungsreihe

E01-001  C. Deppe
         Coding with Feedback and Searching with
         Lies 


E01-002  S. Zhai
         Two Contributions for the
         Multiple-Access Channel 


E01-003  R. Ahlswede
         Advances on Extremal Problems in Number
         Theory and Combinatorics