Simple constant amortized time generation of fixed length numeric partitions
From MaRDI portal
Publication:4651808
DOI10.1016/j.jalgor.2004.01.002zbMath1090.68077OpenAlexW2089329507MaRDI QIDQ4651808
Publication date: 22 February 2005
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.01.002
Nonnumerical algorithms (68W05) Combinatorial aspects of partitions of integers (05A17) Combinatorics in computer science (68R05)
Related Items (2)
A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order ⋮ Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
This page was built for publication: Simple constant amortized time generation of fixed length numeric partitions
