Algorithms for testing occurrences of length 4 patterns in permutations

DOI10.1007/s10878-017-0163-8zbMath1386.05006OpenAlexW2743938404MaRDI QIDQ1698070

Yijie Han, Sanjeev Saxena

Publication date: 21 February 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0163-8

zbMATH Keywords

parallel algorithmspattern matchingoptimal algorithmsseparable permutationslength 4 permutations

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding pattern matchings for permutations
• Pattern matching for permutations
• Patterns in permutations and words.
• An efficient parallel algorithm for building the separating tree
• Dominance made simple
• On computing the length of longest increasing subsequences
• Parallel algorithms for separable permutations
• Optimal cooperative search in fractional cascaded data structures
• 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

This page was built for publication: Algorithms for testing occurrences of length 4 patterns in permutations