2252 search results - page 295 / 451 » Lower Bounds for Dynamic Algorithms |
111
Voted
CPM
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We consider the problem of sorting linear and circular permutations and 0/1 sequences by reversals in a length-sensitive cost model. We extend the results on sorting by l...
138
click to vote
WAOA
2004
Springer
15 years 8 months ago
2004
Springer
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...
107
click to vote
ICCAD
2000
IEEE
15 years 8 months ago
2000
IEEE
For data dominated applications, the system level design trajectory should first focus on finding a good data transfer and storage solution. Since no realization details are avail...
129
Voted
COCOON
1999
Springer
15 years 7 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
134
Voted
STACS
1999
Springer
15 years 7 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...