84 search results - page 6 / 17 » icalp 2010 |
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
We show that a natural online algorithm for scheduling jobs on a heterogeneous multiprocessor, with arbitrary power functions, is scalable for the objective function of weighted ď¬...
69
Voted
ICALP
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We consider the randomized k-server problem, and give improved results for various metric spaces. In particular, we extend a recent result of Cot
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
ICALP
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. The Regular Post Embedding Problem is a variant of Post’s Correspondence Problem where one compares strings with the subword relation and imposes additional regular con...
67
Voted
ICALP
2010
Springer
15 years 3 months ago
2010
Springer
We show that linear probing requires 5-independent hash functions for expected constant-time performance, matching an upper bound of [Pagh et al. STOC’07]. For (1 + ε)-approxima...