98
Voted
ESA
15 years 2 months ago
2008 Springer  116
click to vote
ESA
15 years 2 months ago
2008 Springer
We study the mechanism design problem of scheduling unrelated machines and we completely characterize the decisive truthful mechanisms for two players when the domain contains bot...
109
Voted
ESA
15 years 2 months ago
2008 Springer 
We present an optimal cache-oblivious algorithm for finding all intersections between a set of non-intersecting red segments and a set of non-intersecting blue segments in the plan...
98
Voted
ESA
15 years 2 months ago
2008 Springer 107
click to vote
ESA
15 years 2 months ago
2008 Springer 
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
|
Algorithms