Sommaire du Fascicule no. 1

One quantifier alternation in first-order logic with modular predicates
Exact location of the phase transition for random (1,2)-QSAT
New bounds on the edge-bandwidth of triangular grids
The finiteness problem for monoids of morphisms
Further results on generalized conditional entropies

Sommaire du Fascicule no. 2

Computing the 2-blocks of directed graphs
An upper bound on the complexity of recognizable tree languages
Towards using the history in online computation with advice
Linear grammars with one-sided contexts and their automaton representation

Sommaire du Fascicule no. 3

Optimal strategy synthesis for request-response games
On language equations with concatenation and various sets of Boolean operations
Reducing the gradedness problem of string rewriting systems to a termination problem
Algorithm design and theoretical analysis of a novel CMM modular exponentiation algorithm for large integers

Sommaire du Fascicule no. 4

Neighbor Isolated Tenacity of Graphs
Analysis of a local search algorithm for the k-facility location problem
Certificateless ring signature based on RSA problem and DL problem