Partitioning a sequence into few monotone subsequences

DOI10.1007/S002360050126MaRDI QIDQ1130169zbMATH OpenOpenAlexFDO

Authors Reuven Bar-Yehuda, Sergio Fogel

Publication date 8 November 1998

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002360050126

zbMATH Keywords

VLSIgood splitters

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• Publication:4724636
• A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences
• A fast planar partition algorithm. I
• scientific article; zbMATH DE number 3880704
• Optimal Partitioning of Sequences

Cited in

(9)

• Untangled monotonic chains and adaptive range search
• Finding all maximal subsequences with hereditary properties
• A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences
• A positive fraction Erdős-Szekeres theorem and its applications
• A note on a Ramsey-type problem for sequences
• Relating graph thickness to planar layers and bend complexity
• scientific article; zbMATH DE number 1880331 (Why is no real title available?)
• A linear time approximation algorithm for permutation flow shop scheduling
• On minimum \(k\)-modal partitions of permutations

This page was built for publication: Partitioning a sequence into few monotone subsequences

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