When: Tuesdays and Fridays, 9:00--11:30am.
Where: room ?? Đại học Bách Khoa tpHCM.
This is a short course on algorithmic combinatorial group testing and applications. The basic setting of the group testing problem is to identify a subset of "positive" items from a huge item population using as few "tests" as possible. The meaning of "positive", "tests" and "items" are dependent on the application. For example, dated back to World War II when the area of group testing started, "items" are blood samples, "positive" means syphilis-positive, and a "test" contains a pool of blood samples which results in a positive outcome if there is at least one sample in the pool positive for syphylis. This basic problem paradigm has found numerous applications in biology, cryptography, networking, signal processing, coding theory, statistical learning theory, data streaming, etc. This short course aims to introduce group testing from a computational view point, where not only the constructions of group testing strategies are of interest, but also the computational efficiency of both the construction and the decoding procedures are studied. We will also briefly introduce the probabilistic method, algorithmic coding theory, and several direct applications of group testing.
Basic knowledge of probability theory. (We assume that you have studied some introductory probability course/book before.) Basic knowledge of algorithm analysis and design. Some familiarity with linear algebra.
You're not required to purchase any book. In fact, except for a few very basic results, our coverage will be on materials not covered in any books yet.