An efficient parallel algorithm for building the separating tree

DOI10.1016/J.JPDC.2010.01.007zbMATH Open1233.68223OpenAlexW1984060562MaRDI QIDQ666141FDOQ666141

Authors: Yijie Han, Sanjeev Saxena, Xiaojun 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

Recommendations

• Parallel algorithms for separable permutations
• Efficient parallel algorithms for permutation graphs
• An optimal parallel algorithm for merging using multiselection
• An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs
• A unified approach to the parallel construction of search trees

zbMATH Keywords

parallel algorithmsseparable permutation

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations
• A simple optimal parallel algorithm for a core of a tree
• A unified approach to the parallel construction of search trees
• Algorithms for testing occurrences of length 4 patterns in permutations
• A parallel tree difference algorithm

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666141)