Much recent work in the theoretical computer science, linear algebra, and machine learning has considered matrix decompositions of the following form: given an m
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...
We study congestion games where players aim to access a set of resources. Each player has a set of possible strategies and each resource has a function associating the latency it i...
Ioannis Caragiannis, Christos Kaklamanis, Panagiot...
Abstract. Define a static algorithm as an algorithm that computes some combinatorial property of its input consisting of static, i.e., non-moving, objects. In this paper, we descri...
Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, ...
We study the bandwidth allocation problem (bap) in bounded degree trees. In this problem we are given a tree and a set of connection requests. Each request consists of a path in t...
Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dro...