Parallel algorithms for separable permutations
type: Item
instance of: scholarly article
title: Parallel algorithms for separable permutations
zbMATH Open document ID: 1085.68183
author: V. Yugandhar
author: Sanjeev Saxena
published in: Discrete Applied Mathematics
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 2136341
zbMATH Keywords: Parallel algorithms
zbMATH Keywords: Separable permutations
zbMATH Keywords: Pattern matching
zbMATH Keywords: Tree traversal
MaRDI profile type: Publication
full work available at URL: j.dam.2004.10.004
OpenAlex ID: W2038377288
cites work: Q4321931
cites work: Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains
cites work: Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
cites work: On parallel integer merging
cites work: Recursive Star-Tree Parallel Data Structure
cites work: Improved deterministic parallel integer sorting
cites work: Pattern matching for permutations
cites work: Parallel Merge Sort
cites work: Relations between Concurrent-Write Models of Parallel Computation
cites work: Incomparability in parallel computation
cites work: Finding pattern matchings for permutations
cites work: Q4023519
cites work: Q4398780
cites work: The Parallel Simplicity of Compaction and Chaining
cites work: Optimal cooperative search in fractional cascaded data structures
DOI: 10.1016/J.DAM.2004.10.004
Recommended article: Parallel algorithms for permutation graphs
Recommended article: Q3513420
Recommended article: Efficient parallel algorithms for permutation graphs
Recommended article: A parallel algorithm for the generation of a permutation and applications
Recommended article: Parallel algorithms for arrangements
Recommended article: Q3033316
Recommended article: Parallel algorithms for solvable permutation groups
Recommended article: Q3776653
Recommended article: Efficient parallel algorithms for bipartite permutation graphs
Recommended article: Parallel algorithms for partitioning sorted sets and related problems
description: scientific article; zbMATH DE number 2136341