An efficient parallel algorithm for building the separating tree

DOI10.1016/j.jpdc.2010.01.007zbMath1233.68223OpenAlexW1984060562MaRDI QIDQ666141

Yijie Han, Sanjeev Saxena, Xiao-Jun Shen

Publication date: 7 March 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2010.01.007

zbMATH Keywords

parallel algorithmsseparable permutation

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10)

Related Items (2)

Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations ⋮ Algorithms for testing occurrences of length 4 patterns in permutations

Cites Work

• Finding pattern matchings for permutations
• Deterministic parallel list ranking
• Improved deterministic parallel integer sorting
• Parallel algorithms for separable permutations
• A unifying look at data structures
• Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
• Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs

This page was built for publication: An efficient parallel algorithm for building the separating tree