Abstract.
{In a seminal paper of 1989, Fredman and Saks proved lower bounds for some important data-structure problems in the cell probe model. In particular, lower bounds were established on worst-case and amortized operation cost for the union-find problem and the prefix sum problem. The goal of this paper is to turn their proof technique into a general tool that can be applied to different problems and computational models. To this end we define two quantities: Output Variability depends only on the model of computation. It indicates how much variation can be found in the results of a program with certain resource bounds. This measures in some sense the power of a model. Problem Variability characterizes in a similar sense the difficulty of the problem.
}
Our Main Theorem shows that by comparing a model's output variability to a problem's problem variability, lower bounds on the complexity of solving the problem on the given model may be inferred. The theorem thus shows how to separate the analysis of the model of computation from that of the problem when proving lower bounds.
We show how the results of Fredman and Saks fit our framework by computing the output variability of the cell probe model and the problem variability for problems considered in their paper. This allows us to reprove their lower bound results, and slightly extend them. The main purpose of this paper though is to present the generalized technique.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received January 25, 1999; revised July 30, 1999.
Rights and permissions
About this article
Cite this article
Ben-Amram, A., Galil, Z. A Generalization of a Lower Bound Technique due to Fredman and Saks. Algorithmica 30, 34–66 (2001). https://doi.org/10.1007/s004530010077
Issue Date:
DOI: https://doi.org/10.1007/s004530010077