Lower Bounds for Dynamic Algorithms

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

• Type: Conference
• Year: 1994
• Where: SWAT
• Authors: Michael L. Fredman
• Keywords: Algorithms, Data Structure, Dynamic Algorithm, Lower Bound, SWAT 1994