Sommaire du Fascicule no. 1

STACS 88

Éditorial
ITA
Polygon placement under translation and rotation
Hotz-isomorphism theorems in formal language theory
The relation of two patterns with comparable languages patterns
Fairness and regularity for SCCS processes
Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata
On computations with integer division
Efficient distributed algorithms by using the archimedean time assumption

Sommaire du Fascicule no. 2

Completing codes
Disjunctive languages and compatible orders
An application of m-ary trees to the design of data structures for geometric searching problems
Nonuniform complexity classes specified by lower and upper bounds
Production en temps réel et complexité de structure de suites infinies
A normal form for restricted exponential functions

Sommaire du Fascicule no. 3

Sur des points fixes de morphismes d'un monoïde libre
Algorithms for weighted graph problems on the modified cellular graph automaton
Asymptotical behaviour of some non-uniform measures
Factorisation des ensembles préfixiels
Combinatorial analysis of quicksort algorithm
A limiting distribution for quicksort
La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, Lovász

Sommaire du Fascicule no. 4

Motifs et bases de langages
Compositions de fonctions de commutation partielle
Codes et motifs
Non recursive functions have transcendental generating series
Représentations matricielles des séries d'arbre reconnaissables
Sur quelques classes d’applications de N 2 dans les ensembles finis