Sommaire du Fascicule no. 1

Relationships among PL, #L, and the determinant
UET flow shop scheduling with delays
A category theory approach to conceptual data modeling
Separating words with machines and groups

Sommaire du Fascicule no. 2

Preface
ITA
Bounded queries to arbitrary sets
Complexity classes between Θ k P and Δ k P
On the robustness of ALMOST-ℛ
On sets bounded truth-table reducible to P-selective sets
Monotonous and randomized reductions to sparse sets

Sommaire du Fascicule no. 3

A more efficient notion of zigzag stability
A note concerning the limit distribution of the quicksort algorithm
The closure under division and a characterization of the recognizable 𝒵-subsets
Incorporating an implicit time dimension into the relational model and algebra
Opérateurs de mise en mémoire et types ∀-positifs

Sommaire du Fascicule no. 4

A Markovian concurrency measure
Average case analysis of fully dynamic reachability for directed graphs
Algorithme de Bareiss, algorithme des sous-résultants
On free inverse monoid languages

Sommaire du Fascicule no. 5

Decomposing a k-valued transducer into k unambiguous ones
One-rule semi-Thue systems with loops of length one, two or three
On the distributed decision-making complexity of the minimum vertex cover problem
On the Horton-Strahler number for random tries
On semidirect and two-sided semidirect products of finite 𝒥trivial monoids

Sommaire du Fascicule no. 6

On codes having no finite completion
Les automates circulaires biaisés vérifient la conjecture de Černý
Digital search trees with keys of variable length
Efficient string matching on packed texts
On the average minimal prefix-length of the generalized semi-Dycklanguage