986 search results - page 120 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
127
click to vote
CIAC
1997
Springer
15 years 8 months ago
1997
Springer
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...
151
click to vote
JCO
2007
15 years 3 months ago
2007
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
123
click to vote
TCS
1998
15 years 3 months ago
1998
This paper presents algorithms and lower bounds for several fundamental problems on the Exclusive Read, Concurrent Write Parallel Random Access Machine (ERCW PRAM) and some result...
121
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
The faulty memory RAM presented by Finocchi and Italiano [1] is a variant of the RAM model where the content of any memory cell can get corrupted at any time, and corrupted cells c...
116
click to vote
STACS
2000
Springer
15 years 7 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...