2252 search results - page 18 / 451 » Lower Bounds for Dynamic Algorithms |
90
Voted
SODA
2003
ACM
15 years 4 months ago
2003
ACM
SODA
2010
ACM
15 years 2 months ago
2010
ACM
144
Voted
IWOCA
2010
Springer
14 years 10 months ago
2010
Springer
110
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
A recurring theme in the literature on derandomization is that probabilistic algorithms can be simulated quickly by deterministic algorithms, if one can obtain impressive (i.e., s...