Andreas Allemann and Testing - Free people check

(1 - 11 from 12

)

Andreas Allemann - The Mathematics Genealogy Project

www.genealogy.math.ndsu.nodak.edu

Andreas Allemann . MathSciNet. Ph.D. Rheinisch-Westfälische Technische Hochschule Aachen Dissertation: Improved Upper Bounds for Several Variants of Group Testing. Advisor 1: Eberhard Triesch Advisor 2: Lutz Volkmann. No students known.

Improved Upper Bounds for Several Variants of Group Testing - Andreas...

books.google.de

Andreas Allemann pages. 0 Reviewshttp://books.google.com/books/ about/Improved_Upper_Bounds_for_Several_Varian.html?id=3TaNngEACAAJ ...

In Memory of Rudolf Ahlswede - researchr publicationresearchr.org › publication

researchr.org

[doi] · An Efficient Algorithm for Combinatorial Group TestingAndreas Allemann [doi] · Randomized Post-optimization for ...

An Efficient Algorithm for Combinatorial Group Testingwww.math2.rwth-aachen.de › basilic › Publications › All03

www.math2.rwth-aachen.de

An Efficient Algorithm for Combinatorial Group Testing. Andreas Allemann. Ahlswede Festschrift, Springer (2003),

Andreas Allemann - dblpdblp.uni-trier.de › Persons

dblp.uni-trier.de

List of computer science publications by Andreas Allemann Andreas Allemann: An Efficient Algorithm for Combinatorial Group Testing.

Improved upper bounds for several variants of group testing - CORE

core.ac.uk

By Andreas Allemann. Download PDF (418 KB) Abstract. Group testing is a class of search problems, in which we aim to identify all of n items as either good or defective. We may perform tests on arbitrary subsets, which indicate whether the tested group contains only good items or at least one defective.