La langue du titre indique la langue du document. Tous les
rapports ont un résumé en français.
The language of the document is the same as used for the title.
Abstract in english always available.
|
01
|
Marking in Combinatorial Constructions : Images and Preimages in Ramdom Mappings
M. Drmota, M. Soria
|
|
02
|
Marking in Combinatorial Constructions : Generating Functions and Limiting Distributions
M. Drmota, M. soria
|
|
03
|
Higher-order unification via explicit substitutions
G. Dowek, T.Hardin, C. Kirchner
|
|
04
|
The set of minimal words of a context-free language is context-free
J. Berstel, L. Boasson
|
|
05
|
Parallel N-free Order Recognition
L. Viennot
|
|
06
|
Sur les facteurs des mots automatiques
I. FAGNOT
|
|
07
|
NONCOMMUTATIVE SYMMETRIC FUNCTIONS II : TRANSFORMATIONS OF ALPHABETS
D. Krob, B. Leclerc, J-Y. Thibon
|
|
08
|
Recognizable sets of numbers in nonstandard bases
V. Bruyère, G. Hansel
|
|
09
|
Coding and strong coding in trace monoids
V. Bruyère, C. de Felice
|
|
10
|
Worst-Case Analysis of Fast Heuristics for Packing Squares into a Square
C.Picouleau
|
|
11
|
PROBLEMES D'ORDONNANCEMENT CYCLIQUES
C. HANEN
|
|
12
|
An approximation algorithm for scheduling unitary tasks on m processors with communication delays
A.Munier, C.Hanen
|
|
13
|
Local languages and the Berry-Sethi algorithm
J. Berstel, J-E. Pin
|
|
14
|
On congruences and partial orders
S. Bauget, P. Gastin
|
|
15
|
A Domain for Concurrent Termination : A Generalization of Mazurkiewicz traces
V. Diekert, P. Gastin
|
|
16
|
a DIVISION PROPERTY OF THE FIBONACCi WORD
A. de Luca
|
|
17
|
The Robinson-Schensted correspondance as the quantum straightening at q = O
B. LECLERC, J-Y. THIBON
|
|
18
|
Acyclic complexes related to noncommutative symmetric functions
F. Bergeron, D. Krob
|
|
19
|
Puissance extérieure d'un automate déterministe, application au calcul de la fonction zêta d'un système sofique.
M-P. Béal
|
|
20
|
Cyclic languages and languages of stabilizers
M-P. Béal, O. Carton
|
|
21
|
A QUASI-OPTIMAL TIME FOR SYNCHRONIZING TWO INTERACTING FINITE AUTOMATA
H.Vivien
|
|
22
|
Diagram Groups
V. Guba, M. Sapir
|
|
23
|
Treillis et bases des groupes de Coxeter
A. Lascoux, M -P. Schützenberger
|
|
24
|
Sturmian Words, Lyndon Words and Trees
J. Berstel, A. De Luca
|
|
25
|
Deux machines de Turing universelles :l'une sur {0,1} avec deux instructions gauches, l'autre sur {0,1,2} avec une seule instruction gauche.
M. MARGENSTERN, L. PAVLOTSKAIA
|
|
26
|
Time complexity of the word problem for semigroups and the Higman embedding theorem
J.-C. Birget
|
|
27
|
Séparateurs dans les mots infinis engendrés par morphismes
E. Garel
|
|
28
|
Extension of the definition of the provable totality of a function in the intuitionistic logic HApr.
V. Thibau
|
|
29
|
A refinement of a part of Gödel's theorem on provably total functions of PA.
V. Thibau.
|
|
30
|
General Varieties of Tree Languages
M. Steinby
|
|
31
|
Algorithmic problems in varieties
O. Kharlampovich, M. Sapir
|
|
32
|
Combinatorics on words with applications
M. Sapir
|
|
33
|
Universality of the parallel chip-firing game and related results
E. GOLES, M. MARGENSTERN
|
|
34
|
The lattice theory of r-ordered partitions
M. SERFATI
|
|
35
|
M-Algebras and dyadics . Axioms and some properties
M. SERFATI
|
|
36
|
Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms
J. Cassaigne, J. Karhumäki
|
|
37
|
Parallel Comparability Graph Recognition and Modular Decomposition
M. Morvan, L. Viennot
|
|
38
|
A Compact Data Structure and Parallel Algorithms for Permutation Graphs
J. Gustedt, M. Morvan, L. Viennot
|
|
39
|
Finite semigroups as categories, ordered semigroups or compact semigroups
J-E. Pin
|
|
40
|
Tropical Semirings
J-E. PIN
|
|
41
|
A negative answer to a question of Wilke on varieties of w-languages
J-E. Pin
|
|
42
|
Fonctions quasi-symétriques, fonctions symétriques non commutatives, et algèbres de Hecke à q = 0
G. DUCHAMP, D. KROB, B. LECLERC, J-Y. THIBON
|
|
43
|
Flag Varieties and the Yang-Baxter Equation
A. LASCOUX, B. LECLERC, J-Y. THIBON
|
|
44
|
Baker-Campbell-Hausdorff type computations using noncommutative symmetric functions
D. Krob, B. Leclerc, J.C. Novelli, J-Y. Thibon
|
|
45
|
Infinite string rewrite systems and complexity
j-C. Birget
|
|
46
|
THE CHINESE MONOID
J. Cassaigne, M. Espie, F. Hivert, D. Krob, J-C. Novelli
|
|
47
|
Using duplication for scheduling unitary tasks on m processors with communication delays
A.Munier, C.Hanen
|
|
48
|
Workshop on Algebraic and Syntactic Aspects of Concurrency
P . Gastin, A. Petit
|
|
49
|
Accélération d'une constante sur automates cellulaires et applications
O. HEEN
|
|
50
|
Free profinite R-trivial monoids.
J. Almeida, P. Weil
|
|
51
|
Hecke algebras at roots of unity and crystal bases of quantum affine algebras
A. LASCOUX, B. LECLERC, J-Y. THIBON
|
|
52
|
On the successor function in non-classical numeration systems
C. Frougny
|
|
53
|
A new proof of the hook-length formula
J-C. Novelli, I. Pak, A. V. Stoyanovskii
|
|
54
|
Eléments de Combinatoire
D. KROB
|
|
55
|
On the Cobham-Semenov Theorem
F. POINT, V. BRUYERE
|
|
56
|
Bertrand Numeration Systems and Recognizability
V. BRUYERE, G. HANSEL
|
|
57
|
Linear speed-up without synchronization on one dimensional cellular automata
O. HEEN
|
|
58
|
Vers une nouvelle approche de l'Université concernant les machines de Turing
M. Margenstern, L. Pavlotskaïa
|
|
59
|
Minimal forbidden words and symbolic dynamics
M -P. Béal, F. Mignosi, A. Restivo
|
|
60
|
Synchronisation Déterministe des Automates à délai Borné
C. FROUGNY, J. SAKAROVITCH
|
|
61
|
On radical congruence systems
T. E. Hall, P. Weil
|
|
62
|
MODULES DE CAUCHY, POLYNOMES CARACTéRISTIQUES ET RéSOLVANTES
A. VALIBOUZE
|
|
63
|
The Railroad Crossing Problem :
An Evolving Algebra Solution
Y. Gurevich , J. Huggins
|
|
64
|
The Logic in Computer Science column
Y. Gurevitch
|
|
Th01
|
eGALITé DES FACTEURS DIAGONALES DE SéRIES FORMELLES
I. FAGNOT
|
|
Th02
|
Un service de synchronisation distribuée tolérant les pannes : implantation dans CHORUS
S. ERANIAN
|
|
Th03
|
Séquents qu'on calcule
De l'interprétation du calcul des séquents comme calcul de lambda-termes et comme calcul de stratégies gagnantes
H. HERBELIN
|
|
Th04
|
Rangs des relations binaires Semigroupes de relations non ambigus
V. FROIDURE
|
|
Th05
|
Hauteur sur le treillis des partitions
S. KIM
|
|
Th06
|
COMBINATOIRE DES GROUPES À CROISSANCE POLYNOMIALE
R. INCITTI
|
|
|
|