Algorithms for testing occurrences of length 4 patterns in permutations
type: Item
instance of: scholarly article
title: Algorithms for testing occurrences of length 4 patterns in permutations
zbMATH Open document ID: 1386.05006
author: Yijie Han
author: Sanjeev Saxena
published in: Journal of Combinatorial Optimization
publication date: 2018-02-21T00:00:00Z
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 6841569
zbMATH Keywords: separable permutations
zbMATH Keywords: length 4 permutations
zbMATH Keywords: pattern matching
zbMATH Keywords: optimal algorithms
zbMATH Keywords: parallel algorithms
MaRDI profile type: Publication
full work available at URL: s10878-017-0163-8
OpenAlex ID: W2743938404
cites work: Q4474102
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: Pattern matching for permutations
cites work: On computing the length of longest increasing subsequences
cites work: An efficient parallel algorithm for building the separating tree
cites work: Finding pattern matchings for permutations
cites work: Q4385522
cites work: Patterns in permutations and words.
cites work: Q3992847
cites work: Dominance made simple
cites work: Optimal cooperative search in fractional cascaded data structures
cites work: Parallel algorithms for separable permutations
DOI: 10.1007/S10878-017-0163-8
description: scientific article; zbMATH DE number 6841569