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

In biology, a phylogenetic tree is a tool to represent the evolutionary relationship between
species. Unfortunately, the classical Schröder tree model is not adapted to take into account …

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

We introduce a logic programming framework for data type transformations based on
isomorphisms between elementary data types (natural numbers, finite functions, sets and …

As a variation on the known theme of Gödel numberings, isomorphisms defining data type
transformations in a strongly typed functional language are organized as a finite groupoid …

In this paper we focus on concurrent processes built on synchronization by means of futures.
This concept is an abstraction for processes based on a main execution thread but allowing …

This paper is an exploration of isomorphisms between elementary data types (eg, natural
numbers, sets, finite functions, graphs, hypergraphs) and their extension to hereditarily finite …

We describe in this extended abstract the experiments that we have conducted in order to
fullfil the following goals: a) to obtain a working implementation of the unranking algorithms …

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 …

This paper is an exploration in a functional programming framework of isomorphisms
between elementary data types (natural numbers, sets, bitstrings, finite functions) and their …