2252 search results - page 5 / 451 » Lower Bounds for Dynamic Algorithms |
PODS
2009
ACM
14 years 8 months ago
2009
ACM
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
SODA
1992
ACM
13 years 8 months ago
1992
ACM
An m
STOC
2012
ACM
11 years 10 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
AIML
2004
13 years 9 months ago
2004
This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponent...
TCS
2011
13 years 2 months ago
2011
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...