|Phone/Email Directory | Maps | På dansk|
IMADA > Employees > Christian Kudahl
The Advice Complexity of a Class of Hard Online Problems, STACS 2015. Arxiv
Adding Isolated Vertices Makes some Online Algorithms Optimal, IWOCA 2015. Arxiv
Advice Complexity of the Online Search Problem, IWOCA 2016. Springer
Advice Complexity of the Online Induced Subgraph Problem, MFCS 2016. Arxiv
Here you can find my Bachelor's Thesis. It is about using different measures to analyse two algorithms for the 3-server problem. It is in danish.
Here you can find my Master's Thesis. The main contribution is complexity theoretic results for On-line graph coloring and On-line independent set.