OPODIS
2010
13 years 7 months ago
2010
We consider the problem of scheduling dependent real-time tasks for overloads on a multiprocessor system, yielding best-effort timing assurance. The application/scheduling model in...
LICS
2010
IEEE
13 years 7 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
ISAAC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. In this paper we present an implicit dictionary with the working set property i.e. a dictionary supporting insert(e), delete(x) and predecessor(x) in O(log n) time and se...
ISAAC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
ISAAC
2010
Springer
13 years 7 months ago
2010
Springer
In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A sequence of rectangular items (square items, respectively) arrive over time, which must be p...
ISAAC
2010
Springer
13 years 7 months ago
2010
Springer
ISAAC
2010
Springer
13 years 7 months ago
2010
Springer
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...
ISAAC
2010
Springer
13 years 7 months ago
2010
Springer
ISAAC
2010
Springer
13 years 7 months ago
2010
Springer
We give the first fully compressed representation of a set of m points on an n
ISAAC
2010
Springer
13 years 7 months ago
2010
Springer
Given a multiset M = V1 V2