AG Information und Komplexität

R. Ahlswede, B. Balkenhol, C. Deppe

Workshop on
Search, Sorting and Coding

October 09 - 11, 2000

(Warning: may be changed on demand even during the meeting!)

All talks will be in the auditorium H11 (Hörsaal 11) of the Bielefeld University main building (map).

Monday, October 09, 2000
14:00  Welcome.

14:15  ``On coset weight distribution of codes''
       Victor A. Zinoviev (Russian Academy of Sciences) 

15:15  ``Hankel Matrices in Coding Theory and Combinatorics''
       Ulrich Tamm (Bielefeld)

16:15  Coffee Break

16:45  ``A Simple Decision Support System for FREECELL''
       Ingo Althöfer (University of Jena)

Tuesday, October 10, 2000
09:15  ``Parallel Searching in Trees''
       Frank Recker (University of Tier) 

10:15  Coffee Break

10:45  ``A survey of combinatorial search problems modelling sorting''
       G. O. H. Katona (Alfred Renyi Institute of Mathematics)

11:45  Lunch Break

14:15  ``Inequalities for Linear Extensions and Balancing Pairs''
       Stefan Felsner (Freie Universitaet Berlin) 

15:15  ``Coping with delays and time-outs in binary search 
       Ferdinando Cicalese (University of Salerno) 

16:15  Coffee Break

16:45  ``Codes with Unequal Protection with Feedback''
       Christian Deppe (University of Bielefeld) 

17:45  ``Least Adaptive Optimal Search
with  Unreliable Tests''
       Ugo Vaccaro (University of Salerno)

20:00  Joint Dinner (optional; at restaurant "Im Bültmannshof").

Wednesday, October 11, 2000
09:15  ``On the minimum number of questions in searching with 1 lie and delay in answers''
       Vladimir Balakirsky (Eindhoven University of Technology) 

10:15  Coffee Break

10:45  ``Combinatorial Search and Communication Complexity''
       Gabor Wiener (Alfred Renyi Institute of Mathematics)

Afterwards:  Farewell party in the Cafeteria.

Christian Deppe
Thu Sept 20 11:26:43 CEST 2000