Name
Abstract | ||
|---|---|---|
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We give the model access to the right answer $\pm 1$ as an oracle and prove that the problem remains hard. This suggests which kind of information is hard to maintain. From these results, we derive a number of lower bounds for dynamic algorithms and data structures: We prove lower bounds for dynamic algorithms for existential range queries, reachability in directed graphs, planarity testing, planar point location, incremental parsing, and fundamental data structure problems like maintaining the majority of the prefixes of a string of bits. We prove a lower bound for reachability in grid graphs in terms of the graph's width. We characterize the complexity of maintaining the value of any symmetric function on the prefixes of a bit string. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1137/S0097539701391592 | SIAM J. Comput. |
Keywords | Field | DocType |
fundamental data structure problem,existential range query,dynamic partial sum problem,grid graph,lower bound,data structure,dynamic partial sums,related problems,partial sum,dynamic algorithm,model access,new lower bound techniques,bit string,cell-probe model,partial sums,range query,directed graph,point location,symmetric function | Discrete mathematics,Combinatorics,Planarity testing,Nondeterministic algorithm,Upper and lower bounds,Range query (data structures),Directed graph,Reachability,Dynamic problem,Cell-probe model,Mathematics | Journal |
Volume | Issue | ISSN |
32 | 3 | 0097-5397 |
Citations | PageRank | References |
9 | 0.59 | 25 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thore Husfeldt | 1 | 733 | 40.87 |
| Theis Rauhe | 2 | 661 | 35.11 |