COSSAC' 2001 PROGRAM

Friday, September 7th 

9:00 - 9:45 
Two Colors and More
Martin Aigner, Freie Universitat

9:45 - 10:30 
Group Testing for Complexes
Antony J. Macula, State University of New York at Geneseo

(Coffee Break 10:30 - 11:00)

11:00 - 11:45 
Sorting with Unreliable Comparisons
Edward M. Reingold, University of Illinois at Urbana-Champaign

11:45 - 12:30
Recognition Problems in Combinatorial Search
Gabor Wiener, Alfred Renyi Institute

(Lunch Break 12:30 - 14:45)

14:45 - 15:30 
Some Problems on Generalized Huffman Coding
Mordecai J. Golin, The Hong Kong University of Science and Technology

15:30 - 16:00
On the Hardness of the Decision Tree Problem
Eduardo S. Laber, Loana T. Nogeira
Pontificia Universidade Catolica do Rio de Janeiro

(Coffee Break 16:00 – 16:30)

16:30 - 17:00 
Algorithmic Complexity of Protein Identification: Combinatorics of Weighted Strings
Mark Cieliebak, Thomas Erlebach, Zsuzsanna Liptak, ETH Zurich
Jens Stoye, Max Planch Institute
Emo Welzl, ETH Zurich

17:00 - 17:30
Learning and the Art of Fault-Tolerant Guesswork
Ferdinando Cicalese, Universita' di Salerno
Daniele Mundici, Universita' di Milano

17:30 - 18:00 
Optimal Versus Randomized Search of Fixed Length Binary Words
Helmut Prodinger, University of Witwatersrand
Wojciech Szpankowski, Purdue University

Saturday, September 8th 

9:00 - 9:45 
Group Testing for Consecutive Defectives
Charles J. Colbourn, Arizona State University

9:45 - 10:30 
Search with Small Sets in Presence of a Liar
Gyula H.O.  Katona, Alfred Renyi Institute

(Coffee Break 10:30 - 11:00)

11:00 - 11:45 
Searching with Uncertainty
Evangelos Kranakis, Carleton University

11:45 - 12:30
Approximate Location of Relevant Variables Under the Crossover Distribution
Peter Damaschke, Chalmers University

(Lunch Break 12:30 - 14:45)

14:45 - 15:30 
On Some Problems of Combinatorial Search and Coding Theory
Arkadii G. Dyachkov, Moscow State University

15:30 - 16:00 
On the Influence of Inhibitors on Group Testing Procedures
Annalisa De Bonis, Ugo Vaccaro
Universita' di Salerno

(Coffee Break 16:00 – 16:30)

16:30 - 17:00 
A Lower Bound on the Average-Case Complexity of Shellsort
Tao Jiang, University of California - Riverside
Ming Li, University of California - Santa Barbara
Paul Vitanyi, University of Amsterdam

17:00 - 17:30
Optimal Coding with Asymmetric Errors: Below the Sphere Packing Bound
Ferdinando Cicalese, Universita' di Salerno
Daniele Mundici, Universita' di Milano

17:30 - 18:00
Equivalence of ECO-systems
Enrica Duchi, Elisa Pergola, Renzo Pinzani,
Universita' di Firenze

Sunday, September 9th 

9:00 - 9:45 
New Construction of Non-Adaptive and Error-Tolerance Pooling Designs
Ding-Zhu Du, University of Minnesota

9:45 - 10:30 
An Isoperimetric Theorem for Sequences Generated by Feedback 
and Feedback-codes for Unequal Error Protection
Christian Deppe, Universitat Bielefeld

10:30 - 11:15 
Superimposed Codes
Miklos Ruszinko, Hungarian Academy of Sciences