Computing the number of mergings with constraints

DOI10.1016/0020-0190(87)90151-7zbMath0653.68052OpenAlexW2054336133MaRDI QIDQ1108016

S. H. Smith

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90151-7

zbMATH Keywords

Fibonacci numbersCatalan numberslinear extensionmerging

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Searching and sorting (68P10) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (7)

The Ford-Johnson algorithm still unbeaten for less than 47 elements ⋮ Bounded capacity priority queues ⋮ Combinatorial and geometric approaches to counting problems on linear matroids, graphic arrangements, and partial orders ⋮ The Worst Balanced Partially Ordered Sets—Ladders with Broken Rungs ⋮ Counting linear extensions ⋮ Poset entropy versus number of linear extensions: the width-2 case. ⋮ Balanced pairs in partial orders

Cites Work

• The Information-Theoretic Bound is Good for Merging
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing the number of mergings with constraints