It is necessary to activate JavaScript to navigate this site.

Grant 201/05/0124     1.1.2005 - 31.12.2007
Grantor: Grant Agency of Czech Republic (GACR)

Online algorithms, randomness, and extremal problems

This project proposes basic research in theoretical computer science. Its goal is to obtain new theoretical results in the following two areas: (i) design and analysis of online and approximation algorithms for problems including scheduling, k-server problem, and their variants and (ii) investigation of problems related to randomness (including pseudorandomness and Kolmogorov randomness) and extremal combinatorics. Both of these areas belong to important and active research areas in current computer science. This project is intended as a continuation of the project 201/01/1195 of GA CR and the international cooperative grant KONTAKT ME476, which both ended in 2003. We expect that the proposed project will bring new theoretical results that will be published in high quality international journals and conference proceedings and at the same time it will contribute to teaching advanced courses and advising students.

 Main investigator:

Sgall Jiří

 Participating institutions:

Institute of Mathematics, AS CR