Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Wednesday, September 21, 2005, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Michael Krivelevich (Tel Aviv Univ.)
Property Testing is a relatively young field of Theoretical Computer Science, close in spirit to Approximation Algorithms, Computational Learning, Computational Complexity ans several other subjects. A typical task in Property Testing is, given a property P and input I, to decide quickly and reliably whether I possesses P, or alternatively it is far (in appropriately defined quantitative sense) from any object in P. An algorithm is allowed to use randomness and is normally expected to query only a small part of the description of I (sometimes just a constant number of queries).
In this talk, after an introductory discussion of Property Testing, its setting, models and obtained results, I will pass on to a novel model of Graph Property Testing, combining previously studied models for testing dense graphs (where the input its represented by its adjacency matrix) and testing sparse/bounded degree graphs (where the input is a collection of incidence lists of the graph's vertices). This model appears to be suitable for testing graphs of arbitrary density. I will describe results obtained for this model.
This talk will be based on joint works with Noga Alon, Tali Kaufman and Dana Ron, all from Tel Aviv University.
No previous knowledge/experience in Property Testing will be assumed - before the talk...
Automatic MiSe System Software Version 1.4803M | admin login