Abstract
The range product problem is, for a given set S equipped with an associative operator o, to preprocess a sequence a 1,⋯, a n of elements from S so as to enable efficient subsequent processing of queries of the form: Given a pair (s, t) of integers with 1≤s≤t≤n, return a s oa s+1 o⋯o a t . The generic range product problem and special cases thereof, usually with o computing the maximum of its arguments according to some linear order on S, have been extensively studied. We show that a large number of previous sequential and parallel algorithms for these problems can be unified and simplified by means of prefix graphs.
Supported by the ESPRIT Basic Research Actions Program of the EU under contract No. 7141 (project ALCOM II).
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
N. Alon and N. Megiddo, Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time, J. Assoc. Comput. Mach. 41 (1994), pp. 422–434.
N. Alon and B. Schieber, Optimal Preprocessing for Answering On-line Product Queries, Tech. Rep. No. 71/87, Tel-Aviv University, 1987.
O. Berkman, Y. Matias and U. Vishkin, Randomized Range-Maxima in Nearly-Constant Parallel Time, Comput. Complexity 2 (1992), pp. 350–373.
O. Berkman and U. Vishkin, Recursive Star-Tree Parallel Data Structure, SIAM J. Comput. 22 (1993), pp. 221–242.
O. Berkman and U. Vishkin, On Parallel Integer Merging, Inform. and Computation 106 (1993), pp. 266–285.
A. K. Chandra, S. Fortune and R. Lipton, Lower Bounds for Constant Depth Circuits for Prefix Problems, Proc. 10th International Colloquium on Automata, Languages and Programming (1983), Springer Lecture Notes in Computer Science, Vol. 154, pp. 109–117.
A. K. Chandra, S. Fortune and R. Lipton, Unbounded Fan-in Circuits and Associative Functions, J. Comput. Syst. Sci. 30 (1985), pp. 222–234.
D. Eppstein and Z. Galil, Parallel Algorithmic Techniques for Combinatorial Computation, Ann. Rev. Comput. Sci. 3 (1988), pp. 233–283.
T. Hagerup, The Log-Star Revolution, Proc., 9th Annual Symposium on Theoretical Aspects of Computer Science (1992), Springer Lecture Notes in Computer Science, Vol. 577, pp. 259–278.
R. E. Ladner and M. J. Fischer, Parallel Prefix Computation, J. Assoc. Comput. Mach. 27 (1980), pp. 831–838.
P. Ragde, The Parallel Simplicity of Compaction and Chaining, J. Alg. 14 (1993), pp. 371–380.
P. Raghavan, Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs, J. Comput. Syst. Sci. 37 (1988), pp. 130–143.
L. G. Valiant, Parallelism in Comparison Problems, SIAM J. Comput 4 (1975), pp. 348–355.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chaudhuri, S., Hagerup, T. (1995). Prefix graphs and their applications. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds) Graph-Theoretic Concepts in Computer Science. WG 1994. Lecture Notes in Computer Science, vol 903. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59071-4_49
Download citation
DOI: https://doi.org/10.1007/3-540-59071-4_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59071-2
Online ISBN: 978-3-540-49183-5
eBook Packages: Springer Book Archive