2252 search results - page 92 / 451 » Lower Bounds for Dynamic Algorithms |
103
click to vote
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
In this paper, we consider the mechanism design version of the fractional variant of the scheduling problem on unrelated machines. We give a lower bound of 2 − 1/n for any fracti...
112
click to vote
CRYPTO
2006
Springer
15 years 5 months ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
105
click to vote
ICALP
1994
Springer
15 years 5 months ago
1994
Springer
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
KIVS
2009
Springer
15 years 8 months ago
2009
Springer
In the context of large decentralized many-to-many communication systems it is impractical to provide realistic and hard bounds for certain QoS metrics including latency bounds. Ne...
129
Voted
FOCS
2006
IEEE
15 years 7 months ago
2006
IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...