2252 search results - page 21 / 451 » Lower Bounds for Dynamic Algorithms |
SODA
2003
ACM
13 years 9 months ago
2003
ACM
SODA
1993
ACM
13 years 9 months ago
1993
ACM
SODA
2008
ACM
13 years 9 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
AAAI
2004
13 years 9 months ago
2004
Recently, several lower bound functions are proposed for solving the MAX-2-SAT problem optimally in a branch-and-bound algorithm. These lower bounds improve significantly the perf...
COLT
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We derive upper and lower bounds for some statistical estimation problems. The upper bounds are established for the Gibbs algorithm. The lower bounds, applicable for all ...