Parallel algorithms for separable permutations

DOI10.1016/j.dam.2004.10.004zbMath1085.68183OpenAlexW2038377288MaRDI QIDQ1763485

Sanjeev Saxena, V. Yugandhar

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 matchingTree traversalSeparable permutations

Mathematics Subject Classification ID

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

Related Items

A fast algorithm for permutation pattern matching based on alternating runs, Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations, Algorithms for testing occurrences of length 4 patterns in permutations, The Möbius function of separable and decomposable permutations, Unnamed Item, An efficient parallel algorithm for building the separating tree, Unnamed Item, Finding and counting permutations via CSPs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding pattern matchings for permutations
• Pattern matching for permutations
• On parallel integer merging
• Incomparability in parallel computation
• Improved deterministic parallel integer sorting
• Optimal cooperative search in fractional cascaded data structures
• Parallel Merge Sort
• Relations between Concurrent-Write Models of Parallel Computation
• Recursive Star-Tree Parallel Data Structure
• Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains
• Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
• The Parallel Simplicity of Compaction and Chaining