Suchmethodologien
Termin: 25. - 29. Oktober 2010
Leitung: Rudolf Ahlswede (Bielefeld), Ferdinando Cicalese (Fisciano)
Nachdem Rudolf Ahlswede und Ingo Wegener mit dem Buch Suchprobleme (1979) und seiner russischen (1981) und englischen (1987) Übersetzung Pionierarbeit geleistet haben, ist es jetzt Ziel der ZiF-Arbeitsgemeinschaft, fächerübergreifende allgemeine Suchtheorien zu entwickeln, die nach dem viel zu frühen Ableben von Ingo Wegener gemeinsam mit Christian Deppe in Buchform veröffentlicht werden sollen.
Tagungsbeiträge
- Haratyun Aydinian: On Generic Erasure Correcting Sets and Related Problems
- Vladimir Blinovsky: Solutions of Some Problems from Extremal Combinatorics
- Huilan Chang: Identication and Classication Problems on Pooling Designs for Inhibitor Complex Models
- Hong-Bin Chen: Pooling Designs with Sensitive and Ecient Decoding
- Ferdinando Cicalese: Superselectors: Ecient Constructions and Applications
- Eva Czabarka: Full Transversals and Mixed Orthogonal Arrays
- Peter Damaschke: Randomized and Competitive Group Testing in Stages
- Annalisa De Bonis: Combinatorial Group Testing for Corruption Localizing Hashing
- Christian Deppe: Threshold and Majority Group Testing
- Arkadii Dyachkov: DNA Codes for Additive Stem Distance
- Dániel Gerbner: Search with Density Tests
- Tobias Jacobs: Searching in Trees
- Sampath Kannan: Sampling from Constrained Multivariate Distributions
- Gyula O. H. Katona: Average Length in q-ary Search with Restricted Sizes of Question Sets
- Balazs Keszegh: Path-Search in a Pyramid and Other Graphs
- Kingo Kobayashi: Some Structures of Tower of Hanoi with Four Pegs
- Elena Konstantinova: Search Problems on Cayley Graphs
- Vladimir Lebedev: Shadows Under the Word-Subword Relation
- Ulf Lorenz: Searching for Solutions of Hard Problems
- Anthony J. Macula: Combinatorial Method for Anomaly Detection
- Martin Milanic: Haplotype Inference and Graphs of Small Separability
- Ely Porat: An Extension of List Disjunct Matrices that can Correct Errors in Test Outcomes
- K. Rüdiger Reischuk: Searching for Hidden Information
- Soren Riis: A New Max-Flow Min-Cut Theorem for Information Flows
- Vyacheslav V. Rykov: An Application of Superimposed Coding Theory to the Multiple Access OR Channel and Two-Stage Group Testing Algorithms
- Christian Sohler: Streaming Algorithms for the Analysis of Massive Data Sets
- László Székely: M-part Sperner families
- Olivier Teytaud: Monte-Carlo Tree Search: a New Paradigm for Computational Intelligence
- Eberhard Triesch: A Lower Bound for the Complexity of Monotone Graph Properties
- Anna N. Voronina: DNA Codes for Non-Additive Stem Distance
Teilnehmerinnen und Teilnehmer
Ingo Althöfer (Jena), Haratyun Aydinian (Bielefeld), Vladimir Blinovsky (Moskau), Minglai Cai (Bielefeld), Huilan Chang (Hsinchu), Hong-Bin Chen (Hsinchu), Charles Colbourn (Tempe, AZ)), Eva Czabarka (Columbia, SC), Peter Damaschke (Göteborg), Annalisa De Bonis (Fisciano), Gianluca De Marco (Fisciano), Christian Deppe (Bielefeld), Arkadii D’yachkov (Moskau), Dániel Gerbner (Budapest), Lov Kumar Grover (Murray Hill, NJ), Tobias Jacobs (Tokio), Sampath Kannan (Philadelphia, PA), Gyula O.H. Katona (Budapest), Balázs Keszegh (Budapest), Kingo Kobayashi (Tokio), Elena Konstantinova (Novosibirsk), Evangelos Kranakis (Ottawa), Vladimir Lebedev (Moskau), Ulf Lorenz (Darmstadt), Anthony J. Macula (Geneseo, NY), Martin Milanic (Koper), Ely Porat (Ramat Gan), K. Rüdiger Reischuk (Lübeck), Soren Riis (London), Yvacheslav V. Rykov (Omaha, NE), Christian Sohler (Dortmund), László Székely (Columbia, SC), Olivier Teytaud (Orsay), Eberhard Triesch (Aachen), Ugo Vaccaro (Salerno), Anna Nikitichna Voronina (Moskau)
