I.B.P HOMElitp.95.01.ps M. Drmota, M. Soria Marking in Combinatorial Constructions.: Images and Preimages in Ramdom Mappings
litp.95.02.ps M. Drmota, M. soria Marking in Combinatorial Constructions.: Generating Functions and Limiting Distributions
litp.95.03.ps G. Dowek, T.Hardin, C. Kirchner Higher-order unification via explicit substitutions
litp.95.04.ps J. Berstel, L. Boasson The set of minimal words of a context-free language is context-free
litp.95.05.ps L. Viennot Parallel N-free Order Recognition
litp.95.06.ps I. FAGNOT Sur les facteurs des mots automatiques
litp.95.07.ps D. Krob, B. Leclerc, J-Y. Thibon NONCOMMUTATIVE SYMMETRIC FUNCTIONS II : TRANSFORMATIONS OF ALPHABETS
litp.95.08.ps V. Bruyère, G. Hansel Recognizable sets of numbers in nonstandard bases
litp.95.09.ps V. Bruyère, C. de Felice Coding and strong coding in trace monoids
litp.95.10.ps C.Picouleau Worst-Case Analysis of Fast Heuristics for Packing Squares into a Square
litp.95.11.ps C. HANEN PROBLEMES D'ORDONNANCEMENT CYCLIQUES
litp.95.12.ps A.Munier, C.Hanen An approximation algorithm for scheduling unitary tasks on m processors with communication delays
litp.95.13.ps J. Berstel, J-E. Pin Local languages and the Berry-Sethi algorithm
litp.95.14.ps S. Bauget, P. Gastin On congruences and partial orders
litp.95.15.ps V. Diekert, P. Gastin A Domain for Concurrent Termination : A Generalization of Mazurkiewicz traces
litp.95.16.ps A. de Luca a DIVISION PROPERTY OF THE FIBONACCi WORD
litp.95.17.ps B. LECLERC, J-Y. THIBON The Robinson-Schensted correspondance as the quantum straightening at q = O
litp.95.18.ps F. Bergeron, D. Krob Acyclic complexes related to noncommutative symmetric functions
litp.95.19.ps M-P. Béal Puissance extérieure d'un automate déterministe, application au calcul de la fonction zêta d'un système sofique.
litp.95.20.ps M-P. Béal, O. Carton Cyclic languages and languages of stabilizers
litp.95.21.ps H.Vivien A QUASI-OPTIMAL TIME FOR SYNCHRONIZING TWO INTERACTING FINITE AUTOMATA
litp.95.22.ps V. Guba, M. Sapir Diagram Groups
litp.95.23.ps A. Lascoux, M -P. Schützenberger Treillis et bases des groupes de Coxeter
litp.95.24.ps J. Berstel, A. De Luca Sturmian Words, Lyndon Words and Trees
litp.95.25.ps M. MARGENSTERN, L. PAVLOTSKAIA
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.
litp.95.26.ps J.-C. Birget Time complexity of the word problem for semigroups and the Higman embedding theorem
litp.95.27.ps E. Garel Séparateurs dans les mots infinis engendrés par morphismes
litp.95.28.ps V. Thibau Extension of the definition of the provable totality of a function in the intuitionistic logic HApr.
litp.95.29.ps V. Thibau. A refinement of a part of Gödel's theorem on provably total functions of PA.
litp.95.30.ps M. Steinby General Varieties of Tree Languages
litp.95.31.ps O. Kharlampovich, M. Sapir Algorithmic problems in varieties
litp.95.32.ps M. Sapir Combinatorics on words with applications
litp.95.33.ps E. GOLES, M. MARGENSTERN Universality of the parallel chip-firing game and related results
litp.95.34.ps M. SERFATI The lattice theory of r-ordered partitions
litp.95.35.ps M. SERFATI M-Algebras and dyadics . Axioms and some properties
litp.95.36.ps J. Cassaigne, J. Karhumäki Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms
litp.95.37.ps M. Morvan, L. Viennot Parallel Comparability Graph Recognition and Modular Decomposition
litp.95.38.ps J. Gustedt, M. Morvan, L. Viennot A Compact Data Structure and Parallel Algorithms for Permutation Graphs
litp.95.39.ps J-E. Pin Finite semigroups as categories, ordered semigroups or compact semigroups
litp.95.40.ps J-E. PIN Tropical Semirings
litp.95.41.ps J-E. Pin A negative answer to a question of Wilke on varieties of w-languages
litp.95.42.ps G. DUCHAMP, D. KROB, B. LECLERC, J-Y. THIBON Fonctions quasi-symétriques, fonctions symétriques non commutatives, et algèbres de Hecke à q = 0
litp.95.43.ps A. LASCOUX, B. LECLERC, J-Y. THIBON Flag Varieties and the Yang-Baxter Equation
litp.95.44.ps D. Krob, B. Leclerc, J.C. Novelli, J-Y. Thibon Baker-Campbell-Hausdorff type computations using noncommutative symmetric functions
litp.95.45.ps j-C. Birget Infinite string rewrite systems and complexity
litp.95.46.ps J. Cassaigne, M. Espie, F. Hivert, D. Krob, J-C. Novelli THE CHINESE MONOID
litp.95.47.ps A.Munier, C.Hanen Using duplication for scheduling unitary tasks on m processors with communication delays
litp.95.48.ps P . Gastin, A. Petit Workshop on Algebraic and Syntactic Aspects of Concurrency
litp.95.49.ps O. HEEN Accélération d'une constante sur automates cellulaires et applications
litp.95.50.ps J. Almeida, P. Weil Free profinite R-trivial monoids.
litp.95.51.ps A. LASCOUX, B. LECLERC, J-Y. THIBON Hecke algebras at roots of unity and crystal bases of quantum affine algebras
litp.95.52.ps C. Frougny On the successor function in non-classical numeration systems
litp.95.53.ps J-C. Novelli, I. Pak, A. V. Stoyanovskii A new proof of the hook-length formula
litp.95.54.ps D. KROB Eléments de Combinatoire
litp.95.55.ps F. POINT, V. BRUYERE On the Cobham-Semenov Theorem
litp.95.56.ps V. BRUYERE, G. HANSEL Bertrand Numeration Systems and Recognizability
litp.95.57.ps O. HEEN Linear speed-up without synchronization on one dimensional cellular automata
litp.95.58.ps M. Margenstern, L. Pavlotskaïa Vers une nouvelle approche de l'Université concernant les machines de Turing
litp.95.59.ps M -P. Béal, F. Mignosi, A. Restivo Minimal forbidden words and symbolic dynamics
litp.95.60.ps C. FROUGNY, J. SAKAROVITCH Synchronisation Déterministe des Automates à délai Borné
litp.95.61.ps T. E. Hall, P. Weil On radical congruence systems
litp.95.62.ps A. VALIBOUZE MODULES DE CAUCHY, POLYNOMES CARACTéRISTIQUES ET RéSOLVANTES
litp.95.63.ps Y. Gurevich , J. Huggins The Railroad Crossing Problem : An Evolving Algebra Solution
litp.95.64.ps Y. Gurevitch The Logic in Computer Science column
WebMaster :Olivier MangonI.B.P HOME