Analytic combinatorics aims to enable precise quantitative predictions of the properties of
large combinatorial structures. The theory has emerged over recent decades as essential …

In this paper, we study the problem of develo** new combinatorial generation algorithms.
The main purpose of our research is to derive and improve general methods for develo** …

In the context of combinatorial sampling, the so-called “unranking method” can be seen as a
link between a total order over the objects and an effective way to construct an object of …

In this work, we present an optimal mapper for OFDM with index modulation (OFDM-IM). By
optimal we mean the mapper achieves the lowest possible asymptotic computational …

This paper briefly describes our generic approach to the exhaustive generation of
unlabelled and labelled combinatorial classes. Our algorithms receive a size n and a finite …

This article introduces an algorithm to draw random discrete uniform variables within a given
range of size n from a source of random bits. The algorithm aims to be simple to implement …

We address the non-redundant random generation of k words of length n in a context-free
language. Additionally, we want to avoid a predefined set of words. We study a rejection …

Библиографическое описание: Кручинин ВВ Методы, алгоритмы и программное
обеспечение комбинаторной генерации: автореферат диссертации на соискание …

Background Random biological sequences are a topic of great interest in genome analysis
since, according to a powerful paradigm, they represent the background noise from which …

Any Boolean function corresponds with a complete full binary decision tree. This tree can in
turn be represented in a maximally compact form as a direct acyclic graph where common …