Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
Information and Control
Searching and sorting similar lists
Journal of Algorithms
Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Optimal parallel evaluation of tree-structured computations by raking (extended abstract)
VLSI Algorithms and Architectures
Sorting in c log n parallel steps
Combinatorica
SIAM Journal on Computing
Adaptive bitonic sorting: an optimal parallel algorithm for shared-memory machines
SIAM Journal on Computing
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
A simple parallel tree contraction algorithm
Journal of Algorithms
Cascading divide-and-conquer: a technique for designing parallel algorithms
SIAM Journal on Computing
Generalized sweep methods for parallel computational geometry
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Intersecting line segments in parallel with an output-sensitive number of processors
SIAM Journal on Computing
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A linear-time algorithm for a special case of disjoint set union
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Efficient parallel techniques for computational geometry
Efficient parallel techniques for computational geometry
Parallel job scheduling algorithms
Parallel job scheduling algorithms
(Semantic web) evolution through change logs: problems and solutions
AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
Parallelizing union-find in constraint handling rules using confluence analysis
ICLP'05 Proceedings of the 21st international conference on Logic Programming
| Hi-index | 0.00 |
Given an off-line sequence S of n set-manipulation operations, we investigate the parallel complexity of evaluating S (i.e., finding the response to every operation in S and returning the resulting set). We show that the problem of evaluating S is in NC for various combinations of common set-manipulation operations. Once we establish membership in NC (or, if membership in NC is obvious), we develop techniques for improving the time and/or processor complexity.