|
Jan VolecHello, welcome to my REU page. My name is Jan Volec and I am an undergraduate student of Computer Science at the Faculty of Mathematics and Physics of Charles University in Prague. My main scientific interests are extremal combinatorics, probabilistic method and structural graph theory. REU 2011The other members of our research group are Ondra Bílka, Dušan Knop, Ruda Stolař, Tom Toufar, and Vojta Tůma.
ProblemsWe are working together on several problems, some of them are described on pages of my colleagues. Our advisor is Mario Szegedy. Local Computation Algorithms and Lovasz Local LemmaStatement of the problem:Given a problem which has a global solution guaranteed by the Local Lemma, is it true that there exists a randomized local computation algorithm which is able to answer a query in sublinear time?SlidesHere is my introductory presentation. |