An efficient parallel algorithm for building the separating tree

Authors:
Yijie Han;Sanjeev Saxena;Xiaojun Shen
Affiliations:
School of Computing and Engineering, University of Missouri at Kansas City, 5100 Rockhill Road, Kansas City, MO 64110, USA;Computer Science and Engineering, Indian Institute of Technology, Kanpur-208 016, India;School of Computing and Engineering, University of Missouri at Kansas City, 5100 Rockhill Road, Kansas City, MO 64110, USA
Venue:
Journal of Parallel and Distributed Computing
Year:
2010

Citing 10
Cited 0

Parallel algorithms for computing linked list prefix

Journal of Parallel and Distributed Computing
Improved deterministic parallel integer sorting

Information and Computation
Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values

Journal of Algorithms
Finding pattern matchings for permutations

Information Processing Letters
A unifying look at data structures

Communications of the ACM
Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs

SIAM Journal on Computing
Pattern Matching for Permutations

WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Scaling and related techniques for geometry problems

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Parallel algorithms for separable permutations

Discrete Applied Mathematics
Finding Biconnected Componemts And Computing Tree Functions In Logarithmic Parallel Time

SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an efficient parallel algorithm for building the separating tree for a separable permutation. Our algorithm runs in O(log^2n) time using O(nlog^1^.^5n) operations on the CREW PRAM and O(log^2n) time using O(nlognloglogn) operations on the COMMON CRCW PRAM.