Lower Bounds for Dynamic Algorithms

13 years 8 months ago

Download www.cs.lth.se

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

Michael L. Fredman

Real-time Traffic

Algorithms | Data Structure | Dynamic Algorithm | Lower Bound | SWAT 1994 |

claim paper

» On Dynamic Bin Packing An Improved Lower Bound and Resource Augmentation Analysis

» Using Lower Bounds During Dynamic BDD Minimization

» Lower bounds for dynamic connectivity

» Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems

» Systemwide energy minimization for realtime tasks lower bound and approximation

» Nonuniform ACC Circuit Lower Bounds

» Lower Bounds for Maximum Parsimony with Gene Order Data

» Clustering with Lower Bound on Similarity

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1994
Where	SWAT
Authors	Michael L. Fredman

Comments (0)

Sciweavers

Lower Bounds for Dynamic Algorithms

Algorithms | Data Structure | Dynamic Algorithm | Lower Bound | SWAT 1994 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers