Prefix graphs and their applications
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 206-218
- https://doi.org/10.1007/3-540-59071-4_49
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Lower bounds for constant depth circuits for prefix problemsPublished by Springer Nature ,2005
- Parallel linear programming in fixed dimension almost surely in constant timeJournal of the ACM, 1994
- On Parallel Integer MergingInformation and Computation, 1993
- The Parallel Simplicity of Compaction and ChainingJournal of Algorithms, 1993
- Recursive Star-Tree Parallel Data StructureSIAM Journal on Computing, 1993
- Randomized range-maxima in nearly-constant parallel timecomputational complexity, 1992
- Probabilistic construction of deterministic algorithms: Approximating packing integer programsJournal of Computer and System Sciences, 1988
- Parallel Algorithmic Techniques For Combinational ComputationAnnual Review of Computer Science, 1988
- Unbounded fan-in circuits and associative functionsJournal of Computer and System Sciences, 1985
- Parallel Prefix ComputationJournal of the ACM, 1980