Parallel algorithms for separable permutations

DOI10.1016/J.DAM.2004.10.004MaRDI QIDQ1763485zbMATH OpenOpenAlexFDO

Authors V. Yugandhar, Sanjeev Saxena

Publication date 22 February 2005

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2004.10.004

zbMATH Keywords

Parallel algorithmsPattern matchingSeparable permutationsTree traversal

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Parallel algorithms in computer science (68W10)

Recommendations

• Parallel algorithms for permutation graphs
• scientific article; zbMATH DE number 5307920
• Efficient parallel algorithms for permutation graphs
• A parallel algorithm for the generation of a permutation and applications
• Parallel algorithms for arrangements
• scientific article; zbMATH DE number 4131653
• Parallel algorithms for solvable permutation groups
• scientific article; zbMATH DE number 4037239
• Efficient parallel algorithms for bipartite permutation graphs
• Parallel algorithms for partitioning sorted sets and related problems

Cites work

• Finding pattern matchings for permutations
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• scientific article; zbMATH DE number 719756 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• Improved deterministic parallel integer sorting
• Incomparability in parallel computation
• On parallel integer merging
• Optimal cooperative search in fractional cascaded data structures
• Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
• Parallel Merge Sort
• Pattern matching for permutations
• Recursive Star-Tree Parallel Data Structure
• Relations between Concurrent-Write Models of Parallel Computation
• The Parallel Simplicity of Compaction and Chaining
• Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains

Cited in

(13)

• Algorithms for testing occurrences of length 4 patterns in permutations
• A parallel derangement generation algorithm
• Efficient parallel algorithms for permutation graphs
• Parallel algorithms for arrangements
• Finding and counting permutations via CSPs
• scientific article; zbMATH DE number 5307920 (Why is no real title available?)
• Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
• Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations
• scientific article; zbMATH DE number 7559423 (Why is no real title available?)
• A permutation parallel algorithm under exchange restriction with message passing interface
• scientific article; zbMATH DE number 7765381 (Why is no real title available?)
• The Möbius function of separable and decomposable permutations
• An efficient parallel algorithm for building the separating tree

This page was built for publication: Parallel algorithms for separable permutations

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