552 search results - page 3 / 111 » Lower bounds for dynamic connectivity |
DAC
1999
ACM
13 years 9 months ago
1999
ACM
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
SWAT
1994
Springer
13 years 9 months ago
1994
Springer
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
EUROPAR
1998
Springer
13 years 9 months ago
1998
Springer
Instruction Balanced Time Slicing IBTS allows multiple parallel jobs to be scheduled in a manner akin to the well-known gang scheduling scheme in parallel computers. IBTS however a...
DAGSTUHL
2006
13 years 6 months ago
2006
In this paper we study a class of dynamical systems defined by Pfaffian maps. It is a sub-class of o-minimal dynamical systems which capture rich continuous dynamics and yet can be...
COCOON
2006
Springer
13 years 9 months ago
2006
Springer
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...