On-line Algorithms

本研究计画在线上演算法的领域中，著重于k-服务器问题的决定性与随机演算法及其自然推广，并检视与这些问题相关的许多重要问题。 他们的决议将影响该地区的在线算法，并将有助于弥合差距之间的理论竞争分析和它的众多应用在机器人技术，数据和内存管理和编程语言。 其他领域的调查包括复杂性理论，电路理论，近似算法和新颖的搜索策略。

This research project, in the area of on-line algorithms, focuses on deterministic and randomized algorithms for the k-server problem and some natural generalizations of it. Many important questions related to these problems are examined. Their resolution will impact the area of on-line algorithms, and will help to bridge the gap between the theory of competitive analysis and its numerous applications in robotics, data and memory management and programming languages. Additional areas of investigation include complexity theory, the theory of circuits, approximation algorithms, and novel search strategies.